@performant-software/visualize 3.1.7 → 3.1.9

package/dist/index.es176.js

@@ -1,8 +1,16 @@
-import f from "./index.es223.js";
-function n(t, e) {
-  return f(t, e, !1);
+import t from "./index.es243.js";
+function n(f, l) {
+  for (var a = 0; a < l.length; a++) {
+    var e = l[a];
+    e.enumerable = e.enumerable || !1, e.configurable = !0, "value" in e && (e.writable = !0), Object.defineProperty(f, t(e.key), e);
+  }
+}
+function u(f, l, a) {
+  return l && n(f.prototype, l), a && n(f, a), Object.defineProperty(f, "prototype", {
+    writable: !1
+  }), f;
 }
 export {
-  n as default
+  u as default
 };
 //# sourceMappingURL=index.es176.js.map

package/dist/index.es176.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es176.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":";AAIA,SAAwBA,EAAQC,GAAOC,GAAO;AAC5C,SAAOC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es176.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/createClass.js"],"sourcesContent":["import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, toPropertyKey(descriptor.key), descriptor);\n  }\n}\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  Object.defineProperty(Constructor, \"prototype\", {\n    writable: false\n  });\n  return Constructor;\n}"],"names":["_defineProperties","target","props","i","descriptor","toPropertyKey","_createClass","Constructor","protoProps","staticProps"],"mappings":";AACA,SAASA,EAAkBC,GAAQC,GAAO;AACxC,WAASC,IAAI,GAAGA,IAAID,EAAM,QAAQC,KAAK;AACrC,QAAIC,IAAaF,EAAMC,CAAC;AACxB,IAAAC,EAAW,aAAaA,EAAW,cAAc,IACjDA,EAAW,eAAe,IACtB,WAAWA,MAAYA,EAAW,WAAW,KACjD,OAAO,eAAeH,GAAQI,EAAcD,EAAW,GAAG,GAAGA,CAAU;AAAA,EACzE;AACF;AACA,SAAwBE,EAAaC,GAAaC,GAAYC,GAAa;AACzE,SAAID,KAAYR,EAAkBO,EAAY,WAAWC,CAAU,GAC/DC,KAAaT,EAAkBO,GAAaE,CAAW,GAC3D,OAAO,eAAeF,GAAa,aAAa;AAAA,IAC9C,UAAU;AAAA,EAAA,CACX,GACMA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es177.js

@@ -1,16 +1,9 @@
-import b from "./index.es87.js";
-import q from "./index.es216.js";
-import B from "./index.es207.js";
-import r from "./index.es157.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 i(e) {
+  if (e === void 0)
+    throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  return e;
 }
 export {
-  w as default
+  i as default
 };
 //# sourceMappingURL=index.es177.js.map

package/dist/index.es177.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es177.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;AAC/D,EAAKC,EAAUH,CAAQ,MACrBE,IAAUD,GACVA,IAAWD,GACXA,IAAW,KAETC,KAAY,SAAMA,IAAWG,EAAGH,GAAUC,CAAO;AAGrD,WAFIG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AACtD,IAAIV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GAC9CJ,IAAOK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es177.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js"],"sourcesContent":["export default function _assertThisInitialized(self) {\n  if (self === void 0) {\n    throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");\n  }\n  return self;\n}"],"names":["_assertThisInitialized","self"],"mappings":"AAAA,SAAwBA,EAAuBC,GAAM;AACnD,MAAIA,MAAS;AACX,UAAM,IAAI,eAAe,2DAA2D;AAEtF,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es178.js

@@ -1,18 +1,18 @@
-import u from "./index.es207.js";
-import f from "./index.es157.js";
-function v(o) {
-  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
-    var e = o[n];
-    if (!f(t, e)) {
-      var r;
-      for (r = 1; r < a && f(arguments[r], e); r++)
-        ;
-      r === a && t.push(e);
+import o from "./index.es244.js";
+function i(e, t) {
+  if (typeof t != "function" && t !== null)
+    throw new TypeError("Super expression must either be null or a function");
+  e.prototype = Object.create(t && t.prototype, {
+    constructor: {
+      value: e,
+      writable: !0,
+      configurable: !0
     }
-  }
-  return t;
+  }), Object.defineProperty(e, "prototype", {
+    writable: !1
+  }), t && o(e, t);
 }
 export {
-  v as default
+  i as default
 };
 //# sourceMappingURL=index.es178.js.map

package/dist/index.es178.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es178.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAG1C,WAFIC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAON,EAAMG,CAAC;AAClB,QAAI,CAAAI,EAASN,GAAQK,CAAI,GACzB;AAAA,UAAIE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es178.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/inherits.js"],"sourcesContent":["import setPrototypeOf from \"./setPrototypeOf.js\";\nexport default function _inherits(subClass, superClass) {\n  if (typeof superClass !== \"function\" && superClass !== null) {\n    throw new TypeError(\"Super expression must either be null or a function\");\n  }\n  subClass.prototype = Object.create(superClass && superClass.prototype, {\n    constructor: {\n      value: subClass,\n      writable: true,\n      configurable: true\n    }\n  });\n  Object.defineProperty(subClass, \"prototype\", {\n    writable: false\n  });\n  if (superClass) setPrototypeOf(subClass, superClass);\n}"],"names":["_inherits","subClass","superClass","setPrototypeOf"],"mappings":";AACA,SAAwBA,EAAUC,GAAUC,GAAY;AACtD,MAAI,OAAOA,KAAe,cAAcA,MAAe;AACrD,UAAM,IAAI,UAAU,oDAAoD;AAE1E,EAAAD,EAAS,YAAY,OAAO,OAAOC,KAAcA,EAAW,WAAW;AAAA,IACrE,aAAa;AAAA,MACX,OAAOD;AAAA,MACP,UAAU;AAAA,MACV,cAAc;AAAA,IAAA;AAAA,EAChB,CACD,GACD,OAAO,eAAeA,GAAU,aAAa;AAAA,IAC3C,UAAU;AAAA,EAAA,CACX,GACGC,KAAYC,EAAeF,GAAUC,CAAU;AACrD;","x_google_ignoreList":[0]}

package/dist/index.es179.js

@@ -1,12 +1,13 @@
-import f from "./index.es160.js";
-import p from "./index.es207.js";
-import u from "./index.es158.js";
-function n(t) {
-  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
-    m[r] = u(t, r);
-  return m;
+import o from "./index.es174.js";
+import t from "./index.es177.js";
+function f(e, r) {
+  if (r && (o(r) === "object" || typeof r == "function"))
+    return r;
+  if (r !== void 0)
+    throw new TypeError("Derived constructors may only return object or undefined");
+  return t(e);
 }
 export {
-  n as default
+  f as default
 };
 //# sourceMappingURL=index.es179.js.map

package/dist/index.es179.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es179.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAEpC,SAAOD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es179.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js"],"sourcesContent":["import _typeof from \"./typeof.js\";\nimport assertThisInitialized from \"./assertThisInitialized.js\";\nexport default function _possibleConstructorReturn(self, call) {\n  if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) {\n    return call;\n  } else if (call !== void 0) {\n    throw new TypeError(\"Derived constructors may only return object or undefined\");\n  }\n  return assertThisInitialized(self);\n}"],"names":["_possibleConstructorReturn","self","call","_typeof","assertThisInitialized"],"mappings":";;AAEA,SAAwBA,EAA2BC,GAAMC,GAAM;AAC7D,MAAIA,MAASC,EAAQD,CAAI,MAAM,YAAY,OAAOA,KAAS;AACzD,WAAOA;AACT,MAAWA,MAAS;AAClB,UAAM,IAAI,UAAU,0DAA0D;AAEhF,SAAOE,EAAsBH,CAAI;AACnC;","x_google_ignoreList":[0]}

package/dist/index.es180.js

@@ -1,10 +1,9 @@
-import n from "./index.es207.js";
-function u(e, t) {
-  for (var o = {}, r = 0, f = n(e); r < f; r++)
-    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
-  return o;
+function e(o) {
+  return e = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function(t) {
+    return t.__proto__ || Object.getPrototypeOf(t);
+  }, e(o);
 }
 export {
-  u as default
+  e as default
 };
 //# sourceMappingURL=index.es180.js.map

package/dist/index.es180.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es180.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":";AAKA,SAAwBA,EAAOC,GAAMC,GAAQ;AAE3C,WADIC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAE1BD,EAAOF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAGlC,SAAOD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es180.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js"],"sourcesContent":["export default function _getPrototypeOf(o) {\n  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {\n    return o.__proto__ || Object.getPrototypeOf(o);\n  };\n  return _getPrototypeOf(o);\n}"],"names":["_getPrototypeOf","o"],"mappings":"AAAA,SAAwBA,EAAgB,GAAG;AACzC,SAAAA,IAAkB,OAAO,iBAAiB,OAAO,eAAe,SAAS,SAAyBC,GAAG;AACnG,WAAOA,EAAE,aAAa,OAAO,eAAeA,CAAC;AAAA,EAC/C,GACOD,EAAgB,CAAC;AAC1B;","x_google_ignoreList":[0]}

package/dist/index.es181.js

@@ -1,10 +1,13 @@
-function u(n, a, r) {
-  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
-  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
-    e[f] = n;
-  return e;
+import i from "./index.es243.js";
+function f(r, e, t) {
+  return e = i(e), e in r ? Object.defineProperty(r, e, {
+    value: t,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : r[e] = t, r;
 }
 export {
-  u as default
+  f as default
 };
 //# sourceMappingURL=index.es181.js.map

package/dist/index.es181.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es181.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":"AAGA,SAAwBA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GAChBA,IAAQ,IAELE,MACHA,IAAOD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGf,SAAOD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es181.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/defineProperty.js"],"sourcesContent":["import toPropertyKey from \"./toPropertyKey.js\";\nexport default function _defineProperty(obj, key, value) {\n  key = toPropertyKey(key);\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n  return obj;\n}"],"names":["_defineProperty","obj","key","value","toPropertyKey"],"mappings":";AACA,SAAwBA,EAAgBC,GAAKC,GAAKC,GAAO;AACvD,SAAAD,IAAME,EAAcF,CAAG,GACnBA,KAAOD,IACT,OAAO,eAAeA,GAAKC,GAAK;AAAA,IAC9B,OAAAC;AAAA,IACA,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,EAAA,CACX,IAEDF,EAAIC,CAAG,IAAIC,GAENF;AACT;","x_google_ignoreList":[0]}

package/dist/index.es182.js

@@ -1,11 +1,11 @@
-import { slice as n } from "./index.es6.js";
-function h(r, l) {
-  if (l == null || l < 1) return [];
-  for (var t = [], e = 0, i = r.length; e < i; )
-    t.push(n.call(r, e, e += l));
-  return t;
+import o from "./index.es245.js";
+import t from "./index.es246.js";
+import e from "./index.es247.js";
+import a from "./index.es248.js";
+function n(r) {
+  return o(r) || t(r) || e(r) || a();
 }
 export {
-  h as default
+  n as default
 };
 //# sourceMappingURL=index.es182.js.map

package/dist/index.es182.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es182.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":";AAIA,SAAwBA,EAAMC,GAAOC,GAAO;AAC1C,MAAIA,KAAS,QAAQA,IAAQ,UAAU,CAAA;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAE9C,SAAOC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es182.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/toArray.js"],"sourcesContent":["import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nexport default function _toArray(arr) {\n  return arrayWithHoles(arr) || iterableToArray(arr) || unsupportedIterableToArray(arr) || nonIterableRest();\n}"],"names":["_toArray","arr","arrayWithHoles","iterableToArray","unsupportedIterableToArray","nonIterableRest"],"mappings":";;;;AAIA,SAAwBA,EAASC,GAAK;AACpC,SAAOC,EAAeD,CAAG,KAAKE,EAAgBF,CAAG,KAAKG,EAA2BH,CAAG,KAAKI,EAAA;AAC3F;","x_google_ignoreList":[0]}

package/dist/index.es183.js

@@ -1,7 +1,39 @@
-import { getDefaultExportFromCjs as e } from "./index.es242.js";
-import { __require as r } from "./index.es198.js";
-var o = r();
-const a = /* @__PURE__ */ e(o);
+import e from "./index.es63.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 {
   a as default
 };

package/dist/index.es183.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es183.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}
+{"version":3,"file":"index.es183.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,EAAA;AAAA,EAEL,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EAAA;AAEP;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC/C,SAAoB,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,IAAA,CACf,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IAAA,CACf,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}

package/dist/index.es184.js

@@ -1,32 +1,26 @@
-import { ResizeObserverController as t } from "./index.es256.js";
-import { isElement as o } from "./index.es257.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;
-}();
+import e from "./index.es63.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 {
-  u as ResizeObserver
+  t as default
 };
 //# sourceMappingURL=index.es184.js.map

package/dist/index.es184.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es184.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;AAC9B,QAAI,UAAU,WAAW;AACrB,YAAM,IAAI,UAAU,gFAAgF;AAExG,QAAI,OAAOA,KAAa;AACpB,YAAM,IAAI,UAAU,+FAA+F;AAEvH,IAAAC,EAAyB,QAAQ,MAAMD,CAAQ;AAAA,EACnD;AACAD,SAAAA,EAAe,UAAU,UAAU,SAAUG,GAAQC,GAAS;AAC1D,QAAI,UAAU,WAAW;AACrB,YAAM,IAAI,UAAU,2FAA2F;AAEnH,QAAI,CAACC,EAAUF,CAAM;AACjB,YAAM,IAAI,UAAU,sFAAsF;AAE9G,IAAAD,EAAyB,QAAQ,MAAMC,GAAQC,CAAO;AAAA,EAC1D,GACAJ,EAAe,UAAU,YAAY,SAAUG,GAAQ;AACnD,QAAI,UAAU,WAAW;AACrB,YAAM,IAAI,UAAU,6FAA6F;AAErH,QAAI,CAACE,EAAUF,CAAM;AACjB,YAAM,IAAI,UAAU,wFAAwF;AAEhH,IAAAD,EAAyB,UAAU,MAAMC,CAAM;AAAA,EACnD,GACAH,EAAe,UAAU,aAAa,WAAY;AAC9C,IAAAE,EAAyB,WAAW,IAAI;AAAA,EAC5C,GACAF,EAAe,WAAW,WAAY;AAClC,WAAO;AAAA,EACX,GACOA;AACX,EAAA;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es184.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,EAAA,IACDA;AACN,SAAoB,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.es185.js

@@ -1,43 +1,86 @@
-import { ResizeObserverBoxOptions as z } from "./index.es275.js";
-import { ResizeObserverSize as X } from "./index.es260.js";
-import { DOMRectReadOnly as P } from "./index.es276.js";
-import { isHidden as A, isSVG as I } from "./index.es257.js";
-import { freeze as O } from "./index.es259.js";
-import { global as R } from "./index.es277.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;
+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 {
-  Q as calculateBoxSize,
-  F as calculateBoxSizes
+  L as default
 };
 //# sourceMappingURL=index.es185.js.map

package/dist/index.es185.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es185.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,QAAA,GACZC,IAAe,eACfC,IAAiB,gBACjBC,IAAM,gBAAiB,KAAKC,EAAO,aAAaA,EAAO,UAAU,SAAS,GAC1EC,IAAiB,SAAUC,GAAO;AAAE,SAAO,WAAWA,KAAS,GAAG;AAAG,GACrEC,IAAO,SAAUC,GAAYC,GAAWC,GAAa;AACrD,SAAIF,MAAe,WAAUA,IAAa,IACtCC,MAAc,WAAUA,IAAY,IACpCC,MAAgB,WAAUA,IAAc,KACrC,IAAIC,GAAoBD,IAAcD,IAAYD,MAAe,IAAIE,IAAcF,IAAaC,MAAc,CAAC;AAC1H,GACIG,IAAYC,EAAO;AAAA,EACnB,2BAA2BN,EAAA;AAAA,EAC3B,eAAeA,EAAA;AAAA,EACf,gBAAgBA,EAAA;AAAA,EAChB,aAAa,IAAIO,EAAgB,GAAG,GAAG,GAAG,CAAC;AAC/C,CAAC,GACGC,IAAoB,SAAUC,GAAQC,GAAoB;AAE1D,MADIA,MAAuB,WAAUA,IAAqB,KACtDjB,EAAM,IAAIgB,CAAM,KAAK,CAACC;AACtB,WAAOjB,EAAM,IAAIgB,CAAM;AAE3B,MAAIE,EAASF,CAAM;AACf,WAAAhB,EAAM,IAAIgB,GAAQJ,CAAS,GACpBA;AAEX,MAAIO,IAAK,iBAAiBH,CAAM,GAC5BI,IAAMC,EAAML,CAAM,KAAKA,EAAO,mBAAmBA,EAAO,QAAA,GACxDM,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;AACD,SAAA1C,EAAM,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,IACJ,KAAKK,EAAyB;AAC1B,aAAOD;AAAA,IACX,KAAKC,EAAyB;AAC1B,aAAOH;AAAA,IACX;AACI,aAAOC;AAAA,EAAA;AAEnB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es185.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;AAMxB,WALIM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACPA,KAASI,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;AAStB,WARIC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AAClB,QAAInB,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;AAKrB,UAACI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAGA,SAAAI,IAA0B;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AAClB,QAAIU,IAAIX,EAASC,CAAI;AAOrB,QAJAU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH,EAAU,CAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACb,MAAAA,EAAK,WAAW,SAASH,GAAM;AAC7B,QAAIA,EAAK,IAAIiB,EAAK,MAAGA,IAAOjB,IACxBA,EAAK,IAAIkB,EAAM,MAAGA,IAAQlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAOA,IAASnB;AAAA,MAC1C,CAAC;AACD,UAAIoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC/B,MAAAhB,EAAK,WAAW,SAASH,GAAM;AAC7B,QAAAA,EAAK,KAAKA,EAAK,IAAIqB,KAAMC,GACzBtB,EAAK,IAAIA,EAAK,QAAQuB;AAAA,MACxB,CAAC;AAAA,IACH;AAEA,WAAOpB;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;AACf,UAAIwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC/BV,EAAE,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA,IAEV,OAAW9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAEjC,IAAAV,EAAE,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,GACvBA,EAAE,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaA,WAASyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUL,eATIgC,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,GACRM,IAAQM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GACpDuC,KAAOvC,GACPwC,KAAOxC,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,GACfnC,IAAWb;AAAA,IAEf;AACA,WAAOa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACVV,EAAK,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEA,SAAAP,EAAK,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EACrD,GAEAL,EAAK,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,EACzG,GAEAP,EAAK,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,EACrG,GAEOP;AACT;","x_google_ignoreList":[0]}

package/dist/index.es19.js

@@ -1,5 +1,5 @@
-import m from "./index.es83.js";
-import p from "./index.es222.js";
+import m from "./index.es67.js";
+import p from "./index.es220.js";
 import s from "./index.es10.js";
 var l = m(function(u, e) {
   var h = l.placeholder, o = function() {