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

package/dist/index.es164.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es164.js","sources":["../../../node_modules/underscore/modules/shuffle.js"],"sourcesContent":["import sample from './sample.js';\n\n// Shuffle a collection.\nexport default function shuffle(obj) {\n  return sample(obj, Infinity);\n}\n"],"names":["shuffle","obj","sample"],"mappings":";AAGA,SAAwBA,EAAQC,GAAK;AAC5B,SAAAC,EAAOD,GAAK,KAAQ;AAC7B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es164.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es165.js

@@ -1,20 +1,12 @@
-import s from "./index.es232.js";
-import v from "./index.es109.js";
-import u from "./index.es213.js";
-import o from "./index.es129.js";
-import h from "./index.es171.js";
-function M(r, a, e) {
-  if (a == null || e)
-    return s(r) || (r = v(r)), r[o(r.length - 1)];
-  var t = h(r), f = u(t);
-  a = Math.max(Math.min(a, f), 0);
-  for (var i = f - 1, m = 0; m < a; m++) {
-    var l = o(m, i), p = t[m];
-    t[m] = t[l], t[l] = p;
-  }
-  return t.slice(0, a);
+import f from "./index.es146.js";
+import p from "./index.es211.js";
+import u from "./index.es144.js";
+function n(t) {
+  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
+    m[r] = u(t, r);
+  return m;
 }
 export {
-  M as default
+  n 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/sample.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport getLength from './_getLength.js';\nimport random from './random.js';\nimport toArray from './toArray.js';\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `_.map`.\nexport default function sample(obj, n, guard) {\n  if (n == null || guard) {\n    if (!isArrayLike(obj)) obj = values(obj);\n    return obj[random(obj.length - 1)];\n  }\n  var sample = toArray(obj);\n  var length = getLength(sample);\n  n = Math.max(Math.min(n, length), 0);\n  var last = length - 1;\n  for (var index = 0; index < n; index++) {\n    var rand = random(index, last);\n    var temp = sample[index];\n    sample[index] = sample[rand];\n    sample[rand] = temp;\n  }\n  return sample.slice(0, n);\n}\n"],"names":["sample","obj","n","guard","isArrayLike","values","random","toArray","length","getLength","last","index","rand","temp"],"mappings":";;;;;AAUwB,SAAAA,EAAOC,GAAKC,GAAGC,GAAO;AACxC,MAAAD,KAAK,QAAQC;AACX,WAACC,EAAYH,CAAG,MAAGA,IAAMI,EAAOJ,CAAG,IAChCA,EAAIK,EAAOL,EAAI,SAAS,CAAC,CAAC;AAE/BD,MAAAA,IAASO,EAAQN,CAAG,GACpBO,IAASC,EAAUT,CAAM;AAC7B,EAAAE,IAAI,KAAK,IAAI,KAAK,IAAIA,GAAGM,CAAM,GAAG,CAAC;AAEnC,WADIE,IAAOF,IAAS,GACXG,IAAQ,GAAGA,IAAQT,GAAGS,KAAS;AAClC,QAAAC,IAAON,EAAOK,GAAOD,CAAI,GACzBG,IAAOb,EAAOW,CAAK;AACvBX,IAAAA,EAAOW,CAAK,IAAIX,EAAOY,CAAI,GAC3BZ,EAAOY,CAAI,IAAIC;AAAA,EACjB;AACOb,SAAAA,EAAO,MAAM,GAAGE,CAAC;AAC1B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es165.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es166.js

@@ -1,26 +1,10 @@
-import c from "./index.es222.js";
-import d from "./index.es160.js";
-import e from "./index.es152.js";
-function x(u, t, f) {
-  var a = 0;
-  return t = c(t, f), d(e(u, function(i, n, r) {
-    return {
-      value: i,
-      index: a++,
-      criteria: t(i, n, r)
-    };
-  }).sort(function(i, n) {
-    var r = i.criteria, o = n.criteria;
-    if (r !== o) {
-      if (r > o || r === void 0)
-        return 1;
-      if (r < o || o === void 0)
-        return -1;
-    }
-    return i.index - n.index;
-  }), "value");
+import n from "./index.es211.js";
+function u(e, t) {
+  for (var o = {}, r = 0, f = n(e); r < f; r++)
+    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
+  return o;
 }
 export {
-  x as default
+  u as default
 };
 //# sourceMappingURL=index.es166.js.map

package/dist/index.es166.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es166.js","sources":["../../../node_modules/underscore/modules/sortBy.js"],"sourcesContent":["import cb from './_cb.js';\nimport pluck from './pluck.js';\nimport map from './map.js';\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport default function sortBy(obj, iteratee, context) {\n  var index = 0;\n  iteratee = cb(iteratee, context);\n  return pluck(map(obj, function(value, key, list) {\n    return {\n      value: value,\n      index: index++,\n      criteria: iteratee(value, key, list)\n    };\n  }).sort(function(left, right) {\n    var a = left.criteria;\n    var b = right.criteria;\n    if (a !== b) {\n      if (a > b || a === void 0) return 1;\n      if (a < b || b === void 0) return -1;\n    }\n    return left.index - right.index;\n  }), 'value');\n}\n"],"names":["sortBy","obj","iteratee","context","index","cb","pluck","map","value","key","list","left","right","a","b"],"mappings":";;;AAKwB,SAAAA,EAAOC,GAAKC,GAAUC,GAAS;AACrD,MAAIC,IAAQ;AACD,SAAAF,IAAAG,EAAGH,GAAUC,CAAO,GACxBG,EAAMC,EAAIN,GAAK,SAASO,GAAOC,GAAKC,GAAM;AACxC,WAAA;AAAA,MACL,OAAAF;AAAA,MACA,OAAOJ;AAAA,MACP,UAAUF,EAASM,GAAOC,GAAKC,CAAI;AAAA,IAAA;AAAA,EAEtC,CAAA,EAAE,KAAK,SAASC,GAAMC,GAAO;AAC5B,QAAIC,IAAIF,EAAK,UACTG,IAAIF,EAAM;AACd,QAAIC,MAAMC,GAAG;AACP,UAAAD,IAAIC,KAAKD,MAAM;AAAe,eAAA;AAC9B,UAAAA,IAAIC,KAAKA,MAAM;AAAe,eAAA;AAAA,IACpC;AACO,WAAAH,EAAK,QAAQC,EAAM;AAAA,EAAA,CAC3B,GAAG,OAAO;AACb;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es166.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es167.js

@@ -1,9 +1,10 @@
-import r from "./index.es234.js";
-import i from "./index.es211.js";
-const n = r(function(o, f, p) {
-  i(o, p) ? o[p].push(f) : o[p] = [f];
-});
+function u(n, a, r) {
+  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
+  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
+    e[f] = n;
+  return e;
+}
 export {
-  n as default
+  u as default
 };
 //# sourceMappingURL=index.es167.js.map

package/dist/index.es167.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es167.js","sources":["../../../node_modules/underscore/modules/groupBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Groups the object's values by a criterion. Pass either a string attribute\n// to group by, or a function that returns the criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key].push(value); else result[key] = [value];\n});\n"],"names":["groupBy","group","result","value","key","has"],"mappings":";;AAKA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAC5C,EAAAC,EAAIH,GAAQE,CAAG,IAAUF,EAAAE,CAAG,EAAE,KAAKD,CAAK,IAAeD,EAAAE,CAAG,IAAI,CAACD,CAAK;AAC1E,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es167.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es168.js

@@ -1,8 +1,12 @@
-import r from "./index.es234.js";
-const f = r(function(o, t, n) {
-  o[n] = t;
-});
+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;
+}
 export {
-  f as default
+  h 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/indexBy.js"],"sourcesContent":["import group from './_group.js';\n\n// Indexes the object's values by a criterion, similar to `_.groupBy`, but for\n// when you know that your index values will be unique.\nexport default group(function(result, value, key) {\n  result[key] = value;\n});\n"],"names":["indexBy","group","result","value","key"],"mappings":";AAIA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAChD,EAAAF,EAAOE,CAAG,IAAID;AAChB,CAAC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es168.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es169.js

@@ -1,9 +1,40 @@
-import t from "./index.es234.js";
-import a from "./index.es211.js";
-const p = t(function(o, i, f) {
-  a(o, f) ? o[f]++ : o[f] = 1;
-});
+import e from "./index.es62.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 {
-  p 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/countBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Counts instances of an object that group by a certain criterion. Pass\n// either a string attribute to count by, or a function that returns the\n// criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key]++; else result[key] = 1;\n});\n"],"names":["countBy","group","result","value","key","has"],"mappings":";;AAMA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAK;AAC5C,EAAAC,EAAIH,GAAQE,CAAG,IAAGF,EAAOE,CAAG,MAAUF,EAAOE,CAAG,IAAI;AAC1D,CAAC;","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.es224.js";
-import a from "./index.es226.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 p from "./index.es234.js";
-const i = p(function(t, o, r) {
-  t[r ? 0 : 1].push(o);
-}, !0);
+import e from "./index.es62.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 {
-  i 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/partition.js"],"sourcesContent":["import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n  result[pass ? 0 : 1].push(value);\n}, true);\n"],"names":["partition","group","result","value","pass"],"mappings":";AAIA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAM;AACjD,EAAAF,EAAOE,IAAO,IAAI,CAAC,EAAE,KAAKD,CAAK;AACjC,GAAG,EAAI;","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,15 +1,88 @@
-import f from "./index.es99.js";
-import { slice as t } from "./index.es6.js";
-import i from "./index.es91.js";
-import m from "./index.es232.js";
-import u from "./index.es152.js";
-import e from "./index.es122.js";
-import o from "./index.es109.js";
-var a = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
-function A(r) {
-  return r ? f(r) ? t.call(r) : i(r) ? r.match(a) : m(r) ? u(r, e) : o(r) : [];
+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 {
-  A 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/toArray.js"],"sourcesContent":["import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default function toArray(obj) {\n  if (!obj) return [];\n  if (isArray(obj)) return slice.call(obj);\n  if (isString(obj)) {\n    // Keep surrogate pair characters together.\n    return obj.match(reStrSymbol);\n  }\n  if (isArrayLike(obj)) return map(obj, identity);\n  return values(obj);\n}\n"],"names":["reStrSymbol","toArray","obj","isArray","slice","isString","isArrayLike","map","identity","values"],"mappings":";;;;;;;AASA,IAAIA,IAAc;AAClB,SAAwBC,EAAQC,GAAK;AACnC,SAAKA,IACDC,EAAQD,CAAG,IAAUE,EAAM,KAAKF,CAAG,IACnCG,EAASH,CAAG,IAEPA,EAAI,MAAMF,CAAW,IAE1BM,EAAYJ,CAAG,IAAUK,EAAIL,GAAKM,CAAQ,IACvCC,EAAOP,CAAG,IAPA;AAQnB;","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,9 +1,19 @@
-import e from "./index.es232.js";
-import t from "./index.es107.js";
-function f(r) {
-  return r == null ? 0 : e(r) ? r.length : t(r).length;
+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 {
-  f 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/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.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]}

package/dist/index.es173.js

@@ -1,8 +1,56 @@
-import n from "./index.es174.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 { slice as g } from "./index.es264.js";
+import p from "./index.es265.js";
+import { x as v, y as h } from "./index.es266.js";
+import c from "./index.es263.js";
+import k from "./index.es174.js";
+function T(n) {
+  return n.source;
+}
+function d(n) {
+  return n.target;
+}
+function f(n) {
+  var e = T, r = d, i = v, o = h, a = null;
+  function u() {
+    var t, l = g.call(arguments), m = e.apply(this, l), s = r.apply(this, l);
+    if (a || (a = t = k()), n(a, +i.apply(this, (l[0] = m, l)), +o.apply(this, l), +i.apply(this, (l[0] = s, l)), +o.apply(this, l)), t)
+      return a = null, t + "" || null;
+  }
+  return u.source = function(t) {
+    return arguments.length ? (e = t, u) : e;
+  }, u.target = function(t) {
+    return arguments.length ? (r = t, u) : r;
+  }, u.x = function(t) {
+    return arguments.length ? (i = typeof t == "function" ? t : p(+t), u) : i;
+  }, u.y = function(t) {
+    return arguments.length ? (o = typeof t == "function" ? t : p(+t), u) : o;
+  }, u.context = function(t) {
+    return arguments.length ? (a = t ?? null, u) : a;
+  }, u;
+}
+function z(n, e, r, i, o) {
+  n.moveTo(e, r), n.bezierCurveTo(e = (e + i) / 2, r, e, o, i, o);
+}
+function b(n, e, r, i, o) {
+  n.moveTo(e, r), n.bezierCurveTo(e, r = (r + o) / 2, i, r, i, o);
+}
+function y(n, e, r, i, o) {
+  var a = c(e, r), u = c(e, r = (r + o) / 2), t = c(i, r), l = c(i, o);
+  n.moveTo(a[0], a[1]), n.bezierCurveTo(u[0], u[1], t[0], t[1], l[0], l[1]);
+}
+function S() {
+  return f(z);
+}
+function j() {
+  return f(b);
+}
+function q() {
+  var n = f(y);
+  return n.angle = n.x, delete n.x, n.radius = n.y, delete n.y, n;
 }
 export {
-  u as default
+  S as linkHorizontal,
+  q as linkRadial,
+  j as linkVertical
 };
 //# sourceMappingURL=index.es173.js.map

package/dist/index.es173.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es173.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.es173.js","sources":["../../../node_modules/d3-shape/src/link/index.js"],"sourcesContent":["import {path} from \"d3-path\";\nimport {slice} from \"../array.js\";\nimport constant from \"../constant.js\";\nimport {x as pointX, y as pointY} from \"../point.js\";\nimport pointRadial from \"../pointRadial.js\";\n\nfunction linkSource(d) {\n  return d.source;\n}\n\nfunction linkTarget(d) {\n  return d.target;\n}\n\nfunction link(curve) {\n  var source = linkSource,\n      target = linkTarget,\n      x = pointX,\n      y = pointY,\n      context = null;\n\n  function link() {\n    var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);\n    if (!context) context = buffer = path();\n    curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  link.source = function(_) {\n    return arguments.length ? (source = _, link) : source;\n  };\n\n  link.target = function(_) {\n    return arguments.length ? (target = _, link) : target;\n  };\n\n  link.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), link) : x;\n  };\n\n  link.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), link) : y;\n  };\n\n  link.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), link) : context;\n  };\n\n  return link;\n}\n\nfunction curveHorizontal(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);\n}\n\nfunction curveVertical(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);\n}\n\nfunction curveRadial(context, x0, y0, x1, y1) {\n  var p0 = pointRadial(x0, y0),\n      p1 = pointRadial(x0, y0 = (y0 + y1) / 2),\n      p2 = pointRadial(x1, y0),\n      p3 = pointRadial(x1, y1);\n  context.moveTo(p0[0], p0[1]);\n  context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\nexport function linkHorizontal() {\n  return link(curveHorizontal);\n}\n\nexport function linkVertical() {\n  return link(curveVertical);\n}\n\nexport function linkRadial() {\n  var l = link(curveRadial);\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n  return l;\n}\n"],"names":["linkSource","d","linkTarget","link","curve","source","target","x","pointX","y","pointY","context","buffer","argv","slice","s","t","path","_","constant","curveHorizontal","x0","y0","x1","y1","curveVertical","curveRadial","p0","pointRadial","p1","p2","p3","linkHorizontal","linkVertical","linkRadial","l"],"mappings":";;;;;AAMA,SAASA,EAAWC,GAAG;AACrB,SAAOA,EAAE;AACX;AAEA,SAASC,EAAWD,GAAG;AACrB,SAAOA,EAAE;AACX;AAEA,SAASE,EAAKC,GAAO;AACf,MAAAC,IAASL,GACTM,IAASJ,GACTK,IAAIC,GACJC,IAAIC,GACJC,IAAU;AAEd,WAASR,IAAO;AACd,QAAIS,GAAQC,IAAOC,EAAM,KAAK,SAAS,GAAGC,IAAIV,EAAO,MAAM,MAAMQ,CAAI,GAAGG,IAAIV,EAAO,MAAM,MAAMO,CAAI;AAG/F,QAFCF,MAASA,IAAUC,IAASK,MACjCb,EAAMO,GAAS,CAACJ,EAAE,MAAM,OAAOM,EAAK,CAAC,IAAIE,GAAGF,EAAK,GAAG,CAACJ,EAAE,MAAM,MAAMI,CAAI,GAAG,CAACN,EAAE,MAAM,OAAOM,EAAK,CAAC,IAAIG,GAAGH,EAAK,GAAG,CAACJ,EAAE,MAAM,MAAMI,CAAI,CAAC,GAC/HD;AAAe,aAAAD,IAAU,MAAMC,IAAS,MAAM;AAAA,EACpD;AAEAT,SAAAA,EAAK,SAAS,SAASe,GAAG;AACxB,WAAO,UAAU,UAAUb,IAASa,GAAGf,KAAQE;AAAA,EAAA,GAGjDF,EAAK,SAAS,SAASe,GAAG;AACxB,WAAO,UAAU,UAAUZ,IAASY,GAAGf,KAAQG;AAAA,EAAA,GAGjDH,EAAK,IAAI,SAASe,GAAG;AACZ,WAAA,UAAU,UAAUX,IAAI,OAAOW,KAAM,aAAaA,IAAIC,EAAS,CAACD,CAAC,GAAGf,KAAQI;AAAAA,EAAA,GAGrFJ,EAAK,IAAI,SAASe,GAAG;AACZ,WAAA,UAAU,UAAUT,IAAI,OAAOS,KAAM,aAAaA,IAAIC,EAAS,CAACD,CAAC,GAAGf,KAAQM;AAAAA,EAAA,GAGrFN,EAAK,UAAU,SAASe,GAAG;AACzB,WAAO,UAAU,UAAWP,IAAUO,KAAY,MAAWf,KAAQQ;AAAA,EAAA,GAGhER;AACT;AAEA,SAASiB,EAAgBT,GAASU,GAAIC,GAAIC,GAAIC,GAAI;AACxC,EAAAb,EAAA,OAAOU,GAAIC,CAAE,GACbX,EAAA,cAAcU,KAAMA,IAAKE,KAAM,GAAGD,GAAID,GAAIG,GAAID,GAAIC,CAAE;AAC9D;AAEA,SAASC,EAAcd,GAASU,GAAIC,GAAIC,GAAIC,GAAI;AACtC,EAAAb,EAAA,OAAOU,GAAIC,CAAE,GACbX,EAAA,cAAcU,GAAIC,KAAMA,IAAKE,KAAM,GAAGD,GAAID,GAAIC,GAAIC,CAAE;AAC9D;AAEA,SAASE,EAAYf,GAASU,GAAIC,GAAIC,GAAIC,GAAI;AACxC,MAAAG,IAAKC,EAAYP,GAAIC,CAAE,GACvBO,IAAKD,EAAYP,GAAIC,KAAMA,IAAKE,KAAM,CAAC,GACvCM,IAAKF,EAAYL,GAAID,CAAE,GACvBS,IAAKH,EAAYL,GAAIC,CAAE;AAC3B,EAAAb,EAAQ,OAAOgB,EAAG,CAAC,GAAGA,EAAG,CAAC,CAAC,GAC3BhB,EAAQ,cAAckB,EAAG,CAAC,GAAGA,EAAG,CAAC,GAAGC,EAAG,CAAC,GAAGA,EAAG,CAAC,GAAGC,EAAG,CAAC,GAAGA,EAAG,CAAC,CAAC;AAChE;AAEO,SAASC,IAAiB;AAC/B,SAAO7B,EAAKiB,CAAe;AAC7B;AAEO,SAASa,IAAe;AAC7B,SAAO9B,EAAKsB,CAAa;AAC3B;AAEO,SAASS,IAAa;AACvB,MAAAC,IAAIhC,EAAKuB,CAAW;AACxB,SAAAS,EAAE,QAAQA,EAAE,GAAG,OAAOA,EAAE,GACxBA,EAAE,SAASA,EAAE,GAAG,OAAOA,EAAE,GAClBA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es174.js

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

package/dist/index.es174.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es174.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.es174.js","sources":["../../../node_modules/d3-path/src/path.js"],"sourcesContent":["var pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction Path() {\n  this._x0 = this._y0 = // start of current subpath\n  this._x1 = this._y1 = null; // end of current subpath\n  this._ = \"\";\n}\n\nfunction path() {\n  return new Path;\n}\n\nPath.prototype = path.prototype = {\n  constructor: Path,\n  moveTo: function(x, y) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y);\n  },\n  closePath: function() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._ += \"Z\";\n    }\n  },\n  lineTo: function(x, y) {\n    this._ += \"L\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  quadraticCurveTo: function(x1, y1, x, y) {\n    this._ += \"Q\" + (+x1) + \",\" + (+y1) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  bezierCurveTo: function(x1, y1, x2, y2, x, y) {\n    this._ += \"C\" + (+x1) + \",\" + (+y1) + \",\" + (+x2) + \",\" + (+y2) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  arcTo: function(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n    var x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._ += \"M\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._ += \"L\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      var x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._ += \"L\" + (x1 + t01 * x01) + \",\" + (y1 + t01 * y01);\n      }\n\n      this._ += \"A\" + r + \",\" + r + \",0,0,\" + (+(y01 * x20 > x01 * y20)) + \",\" + (this._x1 = x1 + t21 * x21) + \",\" + (this._y1 = y1 + t21 * y21);\n    }\n  },\n  arc: function(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n    var dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._ += \"M\" + x0 + \",\" + y0;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._ += \"L\" + x0 + \",\" + y0;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (x - dx) + \",\" + (y - dy) + \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (this._x1 = x0) + \",\" + (this._y1 = y0);\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,\" + (+(da >= pi)) + \",\" + cw + \",\" + (this._x1 = x + r * Math.cos(a1)) + \",\" + (this._y1 = y + r * Math.sin(a1));\n    }\n  },\n  rect: function(x, y, w, h) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y) + \"h\" + (+w) + \"v\" + (+h) + \"h\" + (-w) + \"Z\";\n  },\n  toString: function() {\n    return this._;\n  }\n};\n\nexport default path;\n"],"names":["pi","tau","epsilon","tauEpsilon","Path","path","x","y","x1","y1","x2","y2","r","x0","y0","x21","y21","x01","y01","l01_2","x20","y20","l21_2","l20_2","l21","l01","l","t01","t21","a0","a1","ccw","dx","dy","cw","da","w"],"mappings":"AAAA,IAAIA,IAAK,KAAK,IACVC,IAAM,IAAID,GACVE,IAAU,MACVC,IAAaF,IAAMC;AAEvB,SAASE,IAAO;AACd,OAAK,MAAM,KAAK;AAAA,EAChB,KAAK,MAAM,KAAK,MAAM,MACtB,KAAK,IAAI;AACX;AAEA,SAASC,IAAO;AACd,SAAO,IAAID,EAAA;AACb;AAEAA,EAAK,YAAYC,EAAK,YAAY;AAAA,EAChC,aAAaD;AAAA,EACb,QAAQ,SAASE,GAAGC,GAAG;AACrB,SAAK,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAACD,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAACC;AAAA,EAC7E;AAAA,EACA,WAAW,WAAW;AAChB,IAAA,KAAK,QAAQ,SACf,KAAK,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KACrC,KAAK,KAAK;AAAA,EAEd;AAAA,EACA,QAAQ,SAASD,GAAGC,GAAG;AAChB,SAAA,KAAK,OAAO,KAAK,MAAM,CAACD,KAAK,OAAO,KAAK,MAAM,CAACC;AAAA,EACvD;AAAA,EACA,kBAAkB,SAASC,GAAIC,GAAIH,GAAGC,GAAG;AACvC,SAAK,KAAK,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,OAAO,KAAK,MAAM,CAACH,KAAK,OAAO,KAAK,MAAM,CAACC;AAAA,EACnF;AAAA,EACA,eAAe,SAASC,GAAIC,GAAIC,GAAIC,GAAIL,GAAGC,GAAG;AACvC,SAAA,KAAK,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,MAAO,CAACC,IAAM,OAAO,KAAK,MAAM,CAACL,KAAK,OAAO,KAAK,MAAM,CAACC;AAAA,EAC/G;AAAA,EACA,OAAO,SAASC,GAAIC,GAAIC,GAAIC,GAAIC,GAAG;AACjC,IAAAJ,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAK,CAACA,GAAIC,IAAI,CAACA;AACzC,QAAAC,IAAK,KAAK,KACVC,IAAK,KAAK,KACVC,IAAML,IAAKF,GACXQ,IAAML,IAAKF,GACXQ,IAAMJ,IAAKL,GACXU,IAAMJ,IAAKL,GACXU,IAAQF,IAAMA,IAAMC,IAAMA;AAG9B,QAAIN,IAAI;AAAS,YAAA,IAAI,MAAM,sBAAsBA,CAAC;AAG9C,QAAA,KAAK,QAAQ;AACf,WAAK,KAAK,OAAO,KAAK,MAAMJ,KAAM,OAAO,KAAK,MAAMC;AAAA,aAI3CU,IAAQjB;AAKV,UAAA,EAAE,KAAK,IAAIgB,IAAMH,IAAMC,IAAMC,CAAG,IAAIf,MAAY,CAACU;AACxD,aAAK,KAAK,OAAO,KAAK,MAAMJ,KAAM,OAAO,KAAK,MAAMC;AAAA,WAIjD;AACC,YAAAW,IAAMV,IAAKG,GACXQ,IAAMV,IAAKG,GACXQ,IAAQP,IAAMA,IAAMC,IAAMA,GAC1BO,IAAQH,IAAMA,IAAMC,IAAMA,GAC1BG,IAAM,KAAK,KAAKF,CAAK,GACrBG,IAAM,KAAK,KAAKN,CAAK,GACrBO,IAAId,IAAI,KAAK,KAAKZ,IAAK,KAAK,MAAMsB,IAAQH,IAAQI,MAAU,IAAIC,IAAMC,EAAI,KAAK,CAAC,GAChFE,IAAMD,IAAID,GACVG,IAAMF,IAAIF;AAGd,QAAI,KAAK,IAAIG,IAAM,CAAC,IAAIzB,MACtB,KAAK,KAAK,OAAOM,IAAKmB,IAAMV,KAAO,OAAOR,IAAKkB,IAAMT,KAGlD,KAAA,KAAK,MAAMN,IAAI,MAAMA,IAAI,UAAW,EAAEM,IAAME,IAAMH,IAAMI,KAAQ,OAAO,KAAK,MAAMb,IAAKoB,IAAMb,KAAO,OAAO,KAAK,MAAMN,IAAKmB,IAAMZ;AAAA,MACxI;AAAA,EACF;AAAA,EACA,KAAK,SAASV,GAAGC,GAAGK,GAAGiB,GAAIC,GAAIC,GAAK;AAC9B,IAAAzB,IAAA,CAACA,GAAGC,IAAI,CAACA,GAAGK,IAAI,CAACA,GAAGmB,IAAM,CAAC,CAACA;AAC5B,QAAAC,IAAKpB,IAAI,KAAK,IAAIiB,CAAE,GACpBI,IAAKrB,IAAI,KAAK,IAAIiB,CAAE,GACpBhB,IAAKP,IAAI0B,GACTlB,IAAKP,IAAI0B,GACTC,IAAK,IAAIH,GACTI,IAAKJ,IAAMF,IAAKC,IAAKA,IAAKD;AAG9B,QAAIjB,IAAI;AAAS,YAAA,IAAI,MAAM,sBAAsBA,CAAC;AAalD,IAVI,KAAK,QAAQ,OACV,KAAA,KAAK,MAAMC,IAAK,MAAMC,KAIpB,KAAK,IAAI,KAAK,MAAMD,CAAE,IAAIX,KAAW,KAAK,IAAI,KAAK,MAAMY,CAAE,IAAIZ,OACjE,KAAA,KAAK,MAAMW,IAAK,MAAMC,IAIxBF,MAGDuB,IAAK,MAAGA,IAAKA,IAAKlC,IAAMA,IAGxBkC,IAAKhC,IACF,KAAA,KAAK,MAAMS,IAAI,MAAMA,IAAI,UAAUsB,IAAK,OAAO5B,IAAI0B,KAAM,OAAOzB,IAAI0B,KAAM,MAAMrB,IAAI,MAAMA,IAAI,UAAUsB,IAAK,OAAO,KAAK,MAAMrB,KAAM,OAAO,KAAK,MAAMC,KAIrJqB,IAAKjC,MACP,KAAA,KAAK,MAAMU,IAAI,MAAMA,IAAI,QAAS,EAAEuB,KAAMnC,KAAO,MAAMkC,IAAK,OAAO,KAAK,MAAM5B,IAAIM,IAAI,KAAK,IAAIkB,CAAE,KAAK,OAAO,KAAK,MAAMvB,IAAIK,IAAI,KAAK,IAAIkB,CAAE;AAAA,EAEpJ;AAAA,EACA,MAAM,SAASxB,GAAGC,GAAG6B,GAAG,GAAG;AACpB,SAAA,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAAC9B,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,CAACC,KAAK,MAAO,CAAC6B,IAAK,MAAO,CAAC,IAAK,MAAO,CAACA,IAAK;AAAA,EACzH;AAAA,EACA,UAAU,WAAW;AACnB,WAAO,KAAK;AAAA,EACd;AACF;","x_google_ignoreList":[0]}