@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/d3-geo/src/rotation.js

@@ -0,0 +1,49 @@
+import B from "./compose.js";
+import { radians as t, degrees as k, tau as y, atan2 as M, asin as R, sin as i, cos as f, abs as q, pi as A } from "./math.js";
+function w(r, u) {
+  return q(r) > A && (r -= Math.round(r / y) * y), [r, u];
+}
+w.invert = w;
+function C(r, u, n) {
+  return (r %= y) ? u || n ? B(P(r), j(u, n)) : P(r) : u || n ? j(u, n) : w;
+}
+function I(r) {
+  return function(u, n) {
+    return u += r, q(u) > A && (u -= Math.round(u / y) * y), [u, n];
+  };
+}
+function P(r) {
+  var u = I(r);
+  return u.invert = I(-r), u;
+}
+function j(r, u) {
+  var n = f(r), e = i(r), g = f(u), h = i(u);
+  function z(o, v) {
+    var c = f(v), s = f(o) * c, D = i(o) * c, p = i(v), x = p * n + s * e;
+    return [
+      M(D * g - x * h, s * n - p * e),
+      R(x * g + D * h)
+    ];
+  }
+  return z.invert = function(o, v) {
+    var c = f(v), s = f(o) * c, D = i(o) * c, p = i(v), x = p * g - D * h;
+    return [
+      M(D * g + p * h, s * n + x * e),
+      R(x * n - s * e)
+    ];
+  }, z;
+}
+function H(r) {
+  r = C(r[0] * t, r[1] * t, r.length > 2 ? r[2] * t : 0);
+  function u(n) {
+    return n = r(n[0] * t, n[1] * t), n[0] *= k, n[1] *= k, n;
+  }
+  return u.invert = function(n) {
+    return n = r.invert(n[0] * t, n[1] * t), n[0] *= k, n[1] *= k, n;
+  }, u;
+}
+export {
+  H as default,
+  C as rotateRadians
+};
+//# sourceMappingURL=rotation.js.map

package/dist/node_modules/d3-geo/src/rotation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rotation.js","sources":["../../../../node_modules/d3-geo/src/rotation.js"],"sourcesContent":["import compose from \"./compose.js\";\nimport {abs, asin, atan2, cos, degrees, pi, radians, sin, tau} from \"./math.js\";\n\nfunction rotationIdentity(lambda, phi) {\n  if (abs(lambda) > pi) lambda -= Math.round(lambda / tau) * tau;\n  return [lambda, phi];\n}\n\nrotationIdentity.invert = rotationIdentity;\n\nexport function rotateRadians(deltaLambda, deltaPhi, deltaGamma) {\n  return (deltaLambda %= tau) ? (deltaPhi || deltaGamma ? compose(rotationLambda(deltaLambda), rotationPhiGamma(deltaPhi, deltaGamma))\n    : rotationLambda(deltaLambda))\n    : (deltaPhi || deltaGamma ? rotationPhiGamma(deltaPhi, deltaGamma)\n    : rotationIdentity);\n}\n\nfunction forwardRotationLambda(deltaLambda) {\n  return function(lambda, phi) {\n    lambda += deltaLambda;\n    if (abs(lambda) > pi) lambda -= Math.round(lambda / tau) * tau;\n    return [lambda, phi];\n  };\n}\n\nfunction rotationLambda(deltaLambda) {\n  var rotation = forwardRotationLambda(deltaLambda);\n  rotation.invert = forwardRotationLambda(-deltaLambda);\n  return rotation;\n}\n\nfunction rotationPhiGamma(deltaPhi, deltaGamma) {\n  var cosDeltaPhi = cos(deltaPhi),\n      sinDeltaPhi = sin(deltaPhi),\n      cosDeltaGamma = cos(deltaGamma),\n      sinDeltaGamma = sin(deltaGamma);\n\n  function rotation(lambda, phi) {\n    var cosPhi = cos(phi),\n        x = cos(lambda) * cosPhi,\n        y = sin(lambda) * cosPhi,\n        z = sin(phi),\n        k = z * cosDeltaPhi + x * sinDeltaPhi;\n    return [\n      atan2(y * cosDeltaGamma - k * sinDeltaGamma, x * cosDeltaPhi - z * sinDeltaPhi),\n      asin(k * cosDeltaGamma + y * sinDeltaGamma)\n    ];\n  }\n\n  rotation.invert = function(lambda, phi) {\n    var cosPhi = cos(phi),\n        x = cos(lambda) * cosPhi,\n        y = sin(lambda) * cosPhi,\n        z = sin(phi),\n        k = z * cosDeltaGamma - y * sinDeltaGamma;\n    return [\n      atan2(y * cosDeltaGamma + z * sinDeltaGamma, x * cosDeltaPhi + k * sinDeltaPhi),\n      asin(k * cosDeltaPhi - x * sinDeltaPhi)\n    ];\n  };\n\n  return rotation;\n}\n\nexport default function(rotate) {\n  rotate = rotateRadians(rotate[0] * radians, rotate[1] * radians, rotate.length > 2 ? rotate[2] * radians : 0);\n\n  function forward(coordinates) {\n    coordinates = rotate(coordinates[0] * radians, coordinates[1] * radians);\n    return coordinates[0] *= degrees, coordinates[1] *= degrees, coordinates;\n  }\n\n  forward.invert = function(coordinates) {\n    coordinates = rotate.invert(coordinates[0] * radians, coordinates[1] * radians);\n    return coordinates[0] *= degrees, coordinates[1] *= degrees, coordinates;\n  };\n\n  return forward;\n}\n"],"names":["rotationIdentity","lambda","phi","abs","pi","tau","rotateRadians","deltaLambda","deltaPhi","deltaGamma","compose","rotationLambda","rotationPhiGamma","forwardRotationLambda","rotation","cosDeltaPhi","cos","sinDeltaPhi","sin","cosDeltaGamma","sinDeltaGamma","cosPhi","x","y","z","k","atan2","asin","rotate","radians","forward","coordinates","degrees"],"mappings":";;AAGA,SAASA,EAAiBC,GAAQC,GAAK;AACrC,SAAIC,EAAIF,CAAM,IAAIG,MAAIH,KAAU,KAAK,MAAMA,IAASI,CAAG,IAAIA,IACpD,CAACJ,GAAQC,CAAG;AACrB;AAEAF,EAAiB,SAASA;AAEnB,SAASM,EAAcC,GAAaC,GAAUC,GAAY;AAC/D,UAAQF,KAAeF,KAAQG,KAAYC,IAAaC,EAAQC,EAAeJ,CAAW,GAAGK,EAAiBJ,GAAUC,CAAU,CAAC,IAC/HE,EAAeJ,CAAW,IACzBC,KAAYC,IAAaG,EAAiBJ,GAAUC,CAAU,IAC/DT;AACN;AAEA,SAASa,EAAsBN,GAAa;AAC1C,SAAO,SAASN,GAAQC,GAAK;AAC3B,WAAAD,KAAUM,GACNJ,EAAIF,CAAM,IAAIG,MAAIH,KAAU,KAAK,MAAMA,IAASI,CAAG,IAAIA,IACpD,CAACJ,GAAQC,CAAG;AAAA,EACrB;AACF;AAEA,SAASS,EAAeJ,GAAa;AACnC,MAAIO,IAAWD,EAAsBN,CAAW;AAChD,SAAAO,EAAS,SAASD,EAAsB,CAACN,CAAW,GAC7CO;AACT;AAEA,SAASF,EAAiBJ,GAAUC,GAAY;AAC9C,MAAIM,IAAcC,EAAIR,CAAQ,GAC1BS,IAAcC,EAAIV,CAAQ,GAC1BW,IAAgBH,EAAIP,CAAU,GAC9BW,IAAgBF,EAAIT,CAAU;AAElC,WAASK,EAASb,GAAQC,GAAK;AAC7B,QAAImB,IAASL,EAAId,CAAG,GAChBoB,IAAIN,EAAIf,CAAM,IAAIoB,GAClBE,IAAIL,EAAIjB,CAAM,IAAIoB,GAClBG,IAAIN,EAAIhB,CAAG,GACXuB,IAAID,IAAIT,IAAcO,IAAIL;AAC9B,WAAO;AAAA,MACLS,EAAMH,IAAIJ,IAAgBM,IAAIL,GAAeE,IAAIP,IAAcS,IAAIP,CAAW;AAAA,MAC9EU,EAAKF,IAAIN,IAAgBI,IAAIH,CAAa;AAAA,IAChD;AAAA,EACE;AAEA,SAAAN,EAAS,SAAS,SAASb,GAAQC,GAAK;AACtC,QAAImB,IAASL,EAAId,CAAG,GAChBoB,IAAIN,EAAIf,CAAM,IAAIoB,GAClBE,IAAIL,EAAIjB,CAAM,IAAIoB,GAClBG,IAAIN,EAAIhB,CAAG,GACXuB,IAAID,IAAIL,IAAgBI,IAAIH;AAChC,WAAO;AAAA,MACLM,EAAMH,IAAIJ,IAAgBK,IAAIJ,GAAeE,IAAIP,IAAcU,IAAIR,CAAW;AAAA,MAC9EU,EAAKF,IAAIV,IAAcO,IAAIL,CAAW;AAAA,IAC5C;AAAA,EACE,GAEOH;AACT;AAEe,SAAAA,EAASc,GAAQ;AAC9B,EAAAA,IAAStB,EAAcsB,EAAO,CAAC,IAAIC,GAASD,EAAO,CAAC,IAAIC,GAASD,EAAO,SAAS,IAAIA,EAAO,CAAC,IAAIC,IAAU,CAAC;AAE5G,WAASC,EAAQC,GAAa;AAC5B,WAAAA,IAAcH,EAAOG,EAAY,CAAC,IAAIF,GAASE,EAAY,CAAC,IAAIF,CAAO,GAChEE,EAAY,CAAC,KAAKC,GAASD,EAAY,CAAC,KAAKC,GAASD;AAAA,EAC/D;AAEA,SAAAD,EAAQ,SAAS,SAASC,GAAa;AACrC,WAAAA,IAAcH,EAAO,OAAOG,EAAY,CAAC,IAAIF,GAASE,EAAY,CAAC,IAAIF,CAAO,GACvEE,EAAY,CAAC,KAAKC,GAASD,EAAY,CAAC,KAAKC,GAASD;AAAA,EAC/D,GAEOD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/stream.js

@@ -0,0 +1,53 @@
+function l(n, i) {
+  n && f.hasOwnProperty(n.type) && f[n.type](n, i);
+}
+var u = {
+  Feature: function(n, i) {
+    l(n.geometry, i);
+  },
+  FeatureCollection: function(n, i) {
+    for (var e = n.features, t = -1, o = e.length; ++t < o; ) l(e[t].geometry, i);
+  }
+}, f = {
+  Sphere: function(n, i) {
+    i.sphere();
+  },
+  Point: function(n, i) {
+    n = n.coordinates, i.point(n[0], n[1], n[2]);
+  },
+  MultiPoint: function(n, i) {
+    for (var e = n.coordinates, t = -1, o = e.length; ++t < o; ) n = e[t], i.point(n[0], n[1], n[2]);
+  },
+  LineString: function(n, i) {
+    a(n.coordinates, i, 0);
+  },
+  MultiLineString: function(n, i) {
+    for (var e = n.coordinates, t = -1, o = e.length; ++t < o; ) a(e[t], i, 0);
+  },
+  Polygon: function(n, i) {
+    h(n.coordinates, i);
+  },
+  MultiPolygon: function(n, i) {
+    for (var e = n.coordinates, t = -1, o = e.length; ++t < o; ) h(e[t], i);
+  },
+  GeometryCollection: function(n, i) {
+    for (var e = n.geometries, t = -1, o = e.length; ++t < o; ) l(e[t], i);
+  }
+};
+function a(n, i, e) {
+  var t = -1, o = n.length - e, r;
+  for (i.lineStart(); ++t < o; ) r = n[t], i.point(r[0], r[1], r[2]);
+  i.lineEnd();
+}
+function h(n, i) {
+  var e = -1, t = n.length;
+  for (i.polygonStart(); ++e < t; ) a(n[e], i, 1);
+  i.polygonEnd();
+}
+function g(n, i) {
+  n && u.hasOwnProperty(n.type) ? u[n.type](n, i) : l(n, i);
+}
+export {
+  g as default
+};
+//# sourceMappingURL=stream.js.map

package/dist/node_modules/d3-geo/src/stream.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stream.js","sources":["../../../../node_modules/d3-geo/src/stream.js"],"sourcesContent":["function streamGeometry(geometry, stream) {\n  if (geometry && streamGeometryType.hasOwnProperty(geometry.type)) {\n    streamGeometryType[geometry.type](geometry, stream);\n  }\n}\n\nvar streamObjectType = {\n  Feature: function(object, stream) {\n    streamGeometry(object.geometry, stream);\n  },\n  FeatureCollection: function(object, stream) {\n    var features = object.features, i = -1, n = features.length;\n    while (++i < n) streamGeometry(features[i].geometry, stream);\n  }\n};\n\nvar streamGeometryType = {\n  Sphere: function(object, stream) {\n    stream.sphere();\n  },\n  Point: function(object, stream) {\n    object = object.coordinates;\n    stream.point(object[0], object[1], object[2]);\n  },\n  MultiPoint: function(object, stream) {\n    var coordinates = object.coordinates, i = -1, n = coordinates.length;\n    while (++i < n) object = coordinates[i], stream.point(object[0], object[1], object[2]);\n  },\n  LineString: function(object, stream) {\n    streamLine(object.coordinates, stream, 0);\n  },\n  MultiLineString: function(object, stream) {\n    var coordinates = object.coordinates, i = -1, n = coordinates.length;\n    while (++i < n) streamLine(coordinates[i], stream, 0);\n  },\n  Polygon: function(object, stream) {\n    streamPolygon(object.coordinates, stream);\n  },\n  MultiPolygon: function(object, stream) {\n    var coordinates = object.coordinates, i = -1, n = coordinates.length;\n    while (++i < n) streamPolygon(coordinates[i], stream);\n  },\n  GeometryCollection: function(object, stream) {\n    var geometries = object.geometries, i = -1, n = geometries.length;\n    while (++i < n) streamGeometry(geometries[i], stream);\n  }\n};\n\nfunction streamLine(coordinates, stream, closed) {\n  var i = -1, n = coordinates.length - closed, coordinate;\n  stream.lineStart();\n  while (++i < n) coordinate = coordinates[i], stream.point(coordinate[0], coordinate[1], coordinate[2]);\n  stream.lineEnd();\n}\n\nfunction streamPolygon(coordinates, stream) {\n  var i = -1, n = coordinates.length;\n  stream.polygonStart();\n  while (++i < n) streamLine(coordinates[i], stream, 1);\n  stream.polygonEnd();\n}\n\nexport default function(object, stream) {\n  if (object && streamObjectType.hasOwnProperty(object.type)) {\n    streamObjectType[object.type](object, stream);\n  } else {\n    streamGeometry(object, stream);\n  }\n}\n"],"names":["streamGeometry","geometry","stream","streamGeometryType","streamObjectType","object","features","i","n","coordinates","streamLine","streamPolygon","geometries","closed","coordinate","geoStream"],"mappings":"AAAA,SAASA,EAAeC,GAAUC,GAAQ;AACxC,EAAID,KAAYE,EAAmB,eAAeF,EAAS,IAAI,KAC7DE,EAAmBF,EAAS,IAAI,EAAEA,GAAUC,CAAM;AAEtD;AAEA,IAAIE,IAAmB;AAAA,EACrB,SAAS,SAASC,GAAQH,GAAQ;AAChC,IAAAF,EAAeK,EAAO,UAAUH,CAAM;AAAA,EACxC;AAAA,EACA,mBAAmB,SAASG,GAAQH,GAAQ;AAE1C,aADII,IAAWD,EAAO,UAAUE,IAAI,IAAIC,IAAIF,EAAS,QAC9C,EAAEC,IAAIC,IAAG,CAAAR,EAAeM,EAASC,CAAC,EAAE,UAAUL,CAAM;AAAA,EAC7D;AACF,GAEIC,IAAqB;AAAA,EACvB,QAAQ,SAASE,GAAQH,GAAQ;AAC/B,IAAAA,EAAO,OAAM;AAAA,EACf;AAAA,EACA,OAAO,SAASG,GAAQH,GAAQ;AAC9B,IAAAG,IAASA,EAAO,aAChBH,EAAO,MAAMG,EAAO,CAAC,GAAGA,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC;AAAA,EAC9C;AAAA,EACA,YAAY,SAASA,GAAQH,GAAQ;AAEnC,aADIO,IAAcJ,EAAO,aAAaE,IAAI,IAAIC,IAAIC,EAAY,QACvD,EAAEF,IAAIC,IAAG,CAAAH,IAASI,EAAYF,CAAC,GAAGL,EAAO,MAAMG,EAAO,CAAC,GAAGA,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC;AAAA,EACvF;AAAA,EACA,YAAY,SAASA,GAAQH,GAAQ;AACnC,IAAAQ,EAAWL,EAAO,aAAaH,GAAQ,CAAC;AAAA,EAC1C;AAAA,EACA,iBAAiB,SAASG,GAAQH,GAAQ;AAExC,aADIO,IAAcJ,EAAO,aAAaE,IAAI,IAAIC,IAAIC,EAAY,QACvD,EAAEF,IAAIC,IAAG,CAAAE,EAAWD,EAAYF,CAAC,GAAGL,GAAQ,CAAC;AAAA,EACtD;AAAA,EACA,SAAS,SAASG,GAAQH,GAAQ;AAChC,IAAAS,EAAcN,EAAO,aAAaH,CAAM;AAAA,EAC1C;AAAA,EACA,cAAc,SAASG,GAAQH,GAAQ;AAErC,aADIO,IAAcJ,EAAO,aAAaE,IAAI,IAAIC,IAAIC,EAAY,QACvD,EAAEF,IAAIC,IAAG,CAAAG,EAAcF,EAAYF,CAAC,GAAGL,CAAM;AAAA,EACtD;AAAA,EACA,oBAAoB,SAASG,GAAQH,GAAQ;AAE3C,aADIU,IAAaP,EAAO,YAAYE,IAAI,IAAIC,IAAII,EAAW,QACpD,EAAEL,IAAIC,IAAG,CAAAR,EAAeY,EAAWL,CAAC,GAAGL,CAAM;AAAA,EACtD;AACF;AAEA,SAASQ,EAAWD,GAAaP,GAAQW,GAAQ;AAC/C,MAAIN,IAAI,IAAIC,IAAIC,EAAY,SAASI,GAAQC;AAE7C,OADAZ,EAAO,UAAS,GACT,EAAEK,IAAIC,IAAG,CAAAM,IAAaL,EAAYF,CAAC,GAAGL,EAAO,MAAMY,EAAW,CAAC,GAAGA,EAAW,CAAC,GAAGA,EAAW,CAAC,CAAC;AACrG,EAAAZ,EAAO,QAAO;AAChB;AAEA,SAASS,EAAcF,GAAaP,GAAQ;AAC1C,MAAIK,IAAI,IAAIC,IAAIC,EAAY;AAE5B,OADAP,EAAO,aAAY,GACZ,EAAEK,IAAIC,IAAG,CAAAE,EAAWD,EAAYF,CAAC,GAAGL,GAAQ,CAAC;AACpD,EAAAA,EAAO,WAAU;AACnB;AAEe,SAAAa,EAASV,GAAQH,GAAQ;AACtC,EAAIG,KAAUD,EAAiB,eAAeC,EAAO,IAAI,IACvDD,EAAiBC,EAAO,IAAI,EAAEA,GAAQH,CAAM,IAE5CF,EAAeK,GAAQH,CAAM;AAEjC;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/transform.js

@@ -0,0 +1,34 @@
+function e(t) {
+  return function(n) {
+    var r = new o();
+    for (var i in t) r[i] = t[i];
+    return r.stream = n, r;
+  };
+}
+function o() {
+}
+o.prototype = {
+  constructor: o,
+  point: function(t, n) {
+    this.stream.point(t, n);
+  },
+  sphere: function() {
+    this.stream.sphere();
+  },
+  lineStart: function() {
+    this.stream.lineStart();
+  },
+  lineEnd: function() {
+    this.stream.lineEnd();
+  },
+  polygonStart: function() {
+    this.stream.polygonStart();
+  },
+  polygonEnd: function() {
+    this.stream.polygonEnd();
+  }
+};
+export {
+  e as transformer
+};
+//# sourceMappingURL=transform.js.map

package/dist/node_modules/d3-geo/src/transform.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transform.js","sources":["../../../../node_modules/d3-geo/src/transform.js"],"sourcesContent":["export default function(methods) {\n  return {\n    stream: transformer(methods)\n  };\n}\n\nexport function transformer(methods) {\n  return function(stream) {\n    var s = new TransformStream;\n    for (var key in methods) s[key] = methods[key];\n    s.stream = stream;\n    return s;\n  };\n}\n\nfunction TransformStream() {}\n\nTransformStream.prototype = {\n  constructor: TransformStream,\n  point: function(x, y) { this.stream.point(x, y); },\n  sphere: function() { this.stream.sphere(); },\n  lineStart: function() { this.stream.lineStart(); },\n  lineEnd: function() { this.stream.lineEnd(); },\n  polygonStart: function() { this.stream.polygonStart(); },\n  polygonEnd: function() { this.stream.polygonEnd(); }\n};\n"],"names":["transformer","methods","stream","s","TransformStream","key","x","y"],"mappings":"AAMO,SAASA,EAAYC,GAAS;AACnC,SAAO,SAASC,GAAQ;AACtB,QAAIC,IAAI,IAAIC;AACZ,aAASC,KAAOJ,EAAS,CAAAE,EAAEE,CAAG,IAAIJ,EAAQI,CAAG;AAC7C,WAAAF,EAAE,SAASD,GACJC;AAAA,EACT;AACF;AAEA,SAASC,IAAkB;AAAC;AAE5BA,EAAgB,YAAY;AAAA,EAC1B,aAAaA;AAAA,EACb,OAAO,SAASE,GAAGC,GAAG;AAAE,SAAK,OAAO,MAAMD,GAAGC,CAAC;AAAA,EAAG;AAAA,EACjD,QAAQ,WAAW;AAAE,SAAK,OAAO,OAAM;AAAA,EAAI;AAAA,EAC3C,WAAW,WAAW;AAAE,SAAK,OAAO,UAAS;AAAA,EAAI;AAAA,EACjD,SAAS,WAAW;AAAE,SAAK,OAAO,QAAO;AAAA,EAAI;AAAA,EAC7C,cAAc,WAAW;AAAE,SAAK,OAAO,aAAY;AAAA,EAAI;AAAA,EACvD,YAAY,WAAW;AAAE,SAAK,OAAO,WAAU;AAAA,EAAI;AACrD;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/accessors.js

@@ -0,0 +1,12 @@
+function o(n) {
+  return n == null ? null : r(n);
+}
+function r(n) {
+  if (typeof n != "function") throw new Error();
+  return n;
+}
+export {
+  o as optional,
+  r as required
+};
+//# sourceMappingURL=accessors.js.map

package/dist/node_modules/d3-hierarchy/src/accessors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"accessors.js","sources":["../../../../node_modules/d3-hierarchy/src/accessors.js"],"sourcesContent":["export function optional(f) {\n  return f == null ? null : required(f);\n}\n\nexport function required(f) {\n  if (typeof f !== \"function\") throw new Error;\n  return f;\n}\n"],"names":["optional","f","required"],"mappings":"AAAO,SAASA,EAASC,GAAG;AAC1B,SAAOA,KAAK,OAAO,OAAOC,EAASD,CAAC;AACtC;AAEO,SAASC,EAASD,GAAG;AAC1B,MAAI,OAAOA,KAAM,WAAY,OAAM,IAAI;AACvC,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/array.js

@@ -0,0 +1,14 @@
+function o(t) {
+  return typeof t == "object" && "length" in t ? t : Array.from(t);
+}
+function u(t, l) {
+  let e = t.length, f, n;
+  for (; e; )
+    n = l() * e-- | 0, f = t[e], t[e] = t[n], t[n] = f;
+  return t;
+}
+export {
+  o as default,
+  u as shuffle
+};
+//# sourceMappingURL=array.js.map

package/dist/node_modules/d3-hierarchy/src/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sources":["../../../../node_modules/d3-hierarchy/src/array.js"],"sourcesContent":["export default function(x) {\n  return typeof x === \"object\" && \"length\" in x\n    ? x // Array, TypedArray, NodeList, array-like\n    : Array.from(x); // Map, Set, iterable, string, or anything else\n}\n\nexport function shuffle(array, random) {\n  let m = array.length,\n      t,\n      i;\n\n  while (m) {\n    i = random() * m-- | 0;\n    t = array[m];\n    array[m] = array[i];\n    array[i] = t;\n  }\n\n  return array;\n}\n"],"names":["array","x","shuffle","random","m","t","i"],"mappings":"AAAe,SAAAA,EAASC,GAAG;AACzB,SAAO,OAAOA,KAAM,YAAY,YAAYA,IACxCA,IACA,MAAM,KAAKA,CAAC;AAClB;AAEO,SAASC,EAAQF,GAAOG,GAAQ;AACrC,MAAIC,IAAIJ,EAAM,QACVK,GACAC;AAEJ,SAAOF;AACL,IAAAE,IAAIH,EAAM,IAAKC,MAAM,GACrBC,IAAIL,EAAMI,CAAC,GACXJ,EAAMI,CAAC,IAAIJ,EAAMM,CAAC,GAClBN,EAAMM,CAAC,IAAID;AAGb,SAAOL;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/cluster.js

@@ -0,0 +1,50 @@
+function g(e, n) {
+  return e.parent === n.parent ? 1 : 2;
+}
+function m(e) {
+  return e.reduce(p, 0) / e.length;
+}
+function p(e, n) {
+  return e + n.x;
+}
+function v(e) {
+  return 1 + e.reduce(z, 0);
+}
+function z(e, n) {
+  return Math.max(e, n.y);
+}
+function R(e) {
+  for (var n; n = e.children; ) e = n[0];
+  return e;
+}
+function S(e) {
+  for (var n; n = e.children; ) e = n[n.length - 1];
+  return e;
+}
+function w() {
+  var e = g, n = 1, a = 1, i = !1;
+  function u(t) {
+    var c, s = 0;
+    t.eachAfter(function(r) {
+      var h = r.children;
+      h ? (r.x = m(h), r.y = v(h)) : (r.x = c ? s += e(r, c) : 0, r.y = 0, c = r);
+    });
+    var f = R(t), l = S(t), x = f.x - e(f, l) / 2, y = l.x + e(l, f) / 2;
+    return t.eachAfter(i ? function(r) {
+      r.x = (r.x - t.x) * n, r.y = (t.y - r.y) * a;
+    } : function(r) {
+      r.x = (r.x - x) / (y - x) * n, r.y = (1 - (t.y ? r.y / t.y : 1)) * a;
+    });
+  }
+  return u.separation = function(t) {
+    return arguments.length ? (e = t, u) : e;
+  }, u.size = function(t) {
+    return arguments.length ? (i = !1, n = +t[0], a = +t[1], u) : i ? null : [n, a];
+  }, u.nodeSize = function(t) {
+    return arguments.length ? (i = !0, n = +t[0], a = +t[1], u) : i ? [n, a] : null;
+  }, u;
+}
+export {
+  w as default
+};
+//# sourceMappingURL=cluster.js.map

package/dist/node_modules/d3-hierarchy/src/cluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.js","sources":["../../../../node_modules/d3-hierarchy/src/cluster.js"],"sourcesContent":["function defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\nfunction meanX(children) {\n  return children.reduce(meanXReduce, 0) / children.length;\n}\n\nfunction meanXReduce(x, c) {\n  return x + c.x;\n}\n\nfunction maxY(children) {\n  return 1 + children.reduce(maxYReduce, 0);\n}\n\nfunction maxYReduce(y, c) {\n  return Math.max(y, c.y);\n}\n\nfunction leafLeft(node) {\n  var children;\n  while (children = node.children) node = children[0];\n  return node;\n}\n\nfunction leafRight(node) {\n  var children;\n  while (children = node.children) node = children[children.length - 1];\n  return node;\n}\n\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = false;\n\n  function cluster(root) {\n    var previousNode,\n        x = 0;\n\n    // First walk, computing the initial x & y values.\n    root.eachAfter(function(node) {\n      var children = node.children;\n      if (children) {\n        node.x = meanX(children);\n        node.y = maxY(children);\n      } else {\n        node.x = previousNode ? x += separation(node, previousNode) : 0;\n        node.y = 0;\n        previousNode = node;\n      }\n    });\n\n    var left = leafLeft(root),\n        right = leafRight(root),\n        x0 = left.x - separation(left, right) / 2,\n        x1 = right.x + separation(right, left) / 2;\n\n    // Second walk, normalizing x & y to the desired size.\n    return root.eachAfter(nodeSize ? function(node) {\n      node.x = (node.x - root.x) * dx;\n      node.y = (root.y - node.y) * dy;\n    } : function(node) {\n      node.x = (node.x - x0) / (x1 - x0) * dx;\n      node.y = (1 - (root.y ? node.y / root.y : 1)) * dy;\n    });\n  }\n\n  cluster.separation = function(x) {\n    return arguments.length ? (separation = x, cluster) : separation;\n  };\n\n  cluster.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? null : [dx, dy]);\n  };\n\n  cluster.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return cluster;\n}\n"],"names":["defaultSeparation","a","b","meanX","children","meanXReduce","x","c","maxY","maxYReduce","y","leafLeft","node","leafRight","cluster","separation","dx","dy","nodeSize","root","previousNode","left","right","x0","x1"],"mappings":"AAAA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAEA,SAASC,EAAMC,GAAU;AACvB,SAAOA,EAAS,OAAOC,GAAa,CAAC,IAAID,EAAS;AACpD;AAEA,SAASC,EAAYC,GAAGC,GAAG;AACzB,SAAOD,IAAIC,EAAE;AACf;AAEA,SAASC,EAAKJ,GAAU;AACtB,SAAO,IAAIA,EAAS,OAAOK,GAAY,CAAC;AAC1C;AAEA,SAASA,EAAWC,GAAGH,GAAG;AACxB,SAAO,KAAK,IAAIG,GAAGH,EAAE,CAAC;AACxB;AAEA,SAASI,EAASC,GAAM;AAEtB,WADIR,GACGA,IAAWQ,EAAK,WAAU,CAAAA,IAAOR,EAAS,CAAC;AAClD,SAAOQ;AACT;AAEA,SAASC,EAAUD,GAAM;AAEvB,WADIR,GACGA,IAAWQ,EAAK,WAAU,CAAAA,IAAOR,EAASA,EAAS,SAAS,CAAC;AACpE,SAAOQ;AACT;AAEe,SAAAE,IAAW;AACxB,MAAIC,IAAaf,GACbgB,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASJ,EAAQK,GAAM;AACrB,QAAIC,GACAd,IAAI;AAGR,IAAAa,EAAK,UAAU,SAASP,GAAM;AAC5B,UAAIR,IAAWQ,EAAK;AACpB,MAAIR,KACFQ,EAAK,IAAIT,EAAMC,CAAQ,GACvBQ,EAAK,IAAIJ,EAAKJ,CAAQ,MAEtBQ,EAAK,IAAIQ,IAAed,KAAKS,EAAWH,GAAMQ,CAAY,IAAI,GAC9DR,EAAK,IAAI,GACTQ,IAAeR;AAAA,IAEnB,CAAC;AAED,QAAIS,IAAOV,EAASQ,CAAI,GACpBG,IAAQT,EAAUM,CAAI,GACtBI,IAAKF,EAAK,IAAIN,EAAWM,GAAMC,CAAK,IAAI,GACxCE,IAAKF,EAAM,IAAIP,EAAWO,GAAOD,CAAI,IAAI;AAG7C,WAAOF,EAAK,UAAUD,IAAW,SAASN,GAAM;AAC9C,MAAAA,EAAK,KAAKA,EAAK,IAAIO,EAAK,KAAKH,GAC7BJ,EAAK,KAAKO,EAAK,IAAIP,EAAK,KAAKK;AAAA,IAC/B,IAAI,SAASL,GAAM;AACjB,MAAAA,EAAK,KAAKA,EAAK,IAAIW,MAAOC,IAAKD,KAAMP,GACrCJ,EAAK,KAAK,KAAKO,EAAK,IAAIP,EAAK,IAAIO,EAAK,IAAI,MAAMF;AAAA,IAClD,CAAC;AAAA,EACH;AAEA,SAAAH,EAAQ,aAAa,SAASR,GAAG;AAC/B,WAAO,UAAU,UAAUS,IAAaT,GAAGQ,KAAWC;AAAA,EACxD,GAEAD,EAAQ,OAAO,SAASR,GAAG;AACzB,WAAO,UAAU,UAAUY,IAAW,IAAOF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGQ,KAAYI,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAC5G,GAEAH,EAAQ,WAAW,SAASR,GAAG;AAC7B,WAAO,UAAU,UAAUY,IAAW,IAAMF,IAAK,CAACV,EAAE,CAAC,GAAGW,IAAK,CAACX,EAAE,CAAC,GAAGQ,KAAYI,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EACxG,GAEOH;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/constant.js

@@ -0,0 +1,13 @@
+function t() {
+  return 0;
+}
+function r(n) {
+  return function() {
+    return n;
+  };
+}
+export {
+  t as constantZero,
+  r as default
+};
+//# sourceMappingURL=constant.js.map

package/dist/node_modules/d3-hierarchy/src/constant.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constant.js","sources":["../../../../node_modules/d3-hierarchy/src/constant.js"],"sourcesContent":["export function constantZero() {\n  return 0;\n}\n\nexport default function(x) {\n  return function() {\n    return x;\n  };\n}\n"],"names":["constantZero","constant","x"],"mappings":"AAAO,SAASA,IAAe;AAC7B,SAAO;AACT;AAEe,SAAAC,EAASC,GAAG;AACzB,SAAO,WAAW;AAChB,WAAOA;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/ancestors.js

@@ -0,0 +1,9 @@
+function t() {
+  for (var e = this, n = [e]; e = e.parent; )
+    n.push(e);
+  return n;
+}
+export {
+  t as default
+};
+//# sourceMappingURL=ancestors.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/ancestors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ancestors.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/ancestors.js"],"sourcesContent":["export default function() {\n  var node = this, nodes = [node];\n  while (node = node.parent) {\n    nodes.push(node);\n  }\n  return nodes;\n}\n"],"names":["node_ancestors","node","nodes"],"mappings":"AAAe,SAAAA,IAAW;AAExB,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GACvBA,IAAOA,EAAK;AACjB,IAAAC,EAAM,KAAKD,CAAI;AAEjB,SAAOC;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/count.js

@@ -0,0 +1,13 @@
+function i(u) {
+  var e = 0, n = u.children, t = n && n.length;
+  if (!t) e = 1;
+  else for (; --t >= 0; ) e += n[t].value;
+  u.value = e;
+}
+function l() {
+  return this.eachAfter(i);
+}
+export {
+  l as default
+};
+//# sourceMappingURL=count.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/count.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"count.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/count.js"],"sourcesContent":["function count(node) {\n  var sum = 0,\n      children = node.children,\n      i = children && children.length;\n  if (!i) sum = 1;\n  else while (--i >= 0) sum += children[i].value;\n  node.value = sum;\n}\n\nexport default function() {\n  return this.eachAfter(count);\n}\n"],"names":["count","node","sum","children","i","node_count"],"mappings":"AAAA,SAASA,EAAMC,GAAM;AACnB,MAAIC,IAAM,GACNC,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS;AAC7B,MAAI,CAACC,EAAG,CAAAF,IAAM;AAAA,MACT,QAAO,EAAEE,KAAK,IAAG,CAAAF,KAAOC,EAASC,CAAC,EAAE;AACzC,EAAAH,EAAK,QAAQC;AACf;AAEe,SAAAG,IAAW;AACxB,SAAO,KAAK,UAAUL,CAAK;AAC7B;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/descendants.js

@@ -0,0 +1,7 @@
+function e() {
+  return Array.from(this);
+}
+export {
+  e as default
+};
+//# sourceMappingURL=descendants.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/descendants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"descendants.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/descendants.js"],"sourcesContent":["export default function() {\n  return Array.from(this);\n}\n"],"names":["node_descendants"],"mappings":"AAAe,SAAAA,IAAW;AACxB,SAAO,MAAM,KAAK,IAAI;AACxB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/each.js

@@ -0,0 +1,10 @@
+function i(t, e) {
+  let n = -1;
+  for (const o of this)
+    t.call(e, o, ++n, this);
+  return this;
+}
+export {
+  i as default
+};
+//# sourceMappingURL=each.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/each.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"each.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/each.js"],"sourcesContent":["export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n"],"names":["node_each","callback","that","index","node"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AACtC,MAAIC,IAAQ;AACZ,aAAWC,KAAQ;AACjB,IAAAH,EAAS,KAAKC,GAAME,GAAM,EAAED,GAAO,IAAI;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/eachAfter.js

@@ -0,0 +1,13 @@
+function p(o, r) {
+  for (var e = this, i = [e], t = [], h, n, l, d = -1; e = i.pop(); )
+    if (t.push(e), h = e.children)
+      for (n = 0, l = h.length; n < l; ++n)
+        i.push(h[n]);
+  for (; e = t.pop(); )
+    o.call(r, e, ++d, this);
+  return this;
+}
+export {
+  p as default
+};
+//# sourceMappingURL=eachAfter.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/eachAfter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eachAfter.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/eachAfter.js"],"sourcesContent":["export default function(callback, that) {\n  var node = this, nodes = [node], next = [], children, i, n, index = -1;\n  while (node = nodes.pop()) {\n    next.push(node);\n    if (children = node.children) {\n      for (i = 0, n = children.length; i < n; ++i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  while (node = next.pop()) {\n    callback.call(that, node, ++index, this);\n  }\n  return this;\n}\n"],"names":["node_eachAfter","callback","that","node","nodes","next","children","i","n","index"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AAEtC,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,IAAO,CAAA,GAAIC,GAAUC,GAAGC,GAAGC,IAAQ,IAC7DN,IAAOC,EAAM;AAElB,QADAC,EAAK,KAAKF,CAAI,GACVG,IAAWH,EAAK;AAClB,WAAKI,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AACxC,QAAAH,EAAM,KAAKE,EAASC,CAAC,CAAC;AAI5B,SAAOJ,IAAOE,EAAK;AACjB,IAAAJ,EAAS,KAAKC,GAAMC,GAAM,EAAEM,GAAO,IAAI;AAEzC,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/eachBefore.js

@@ -0,0 +1,11 @@
+function d(o, r) {
+  for (var e = this, h = [e], n, i, t = -1; e = h.pop(); )
+    if (o.call(r, e, ++t, this), n = e.children)
+      for (i = n.length - 1; i >= 0; --i)
+        h.push(n[i]);
+  return this;
+}
+export {
+  d as default
+};
+//# sourceMappingURL=eachBefore.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/eachBefore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eachBefore.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/eachBefore.js"],"sourcesContent":["export default function(callback, that) {\n  var node = this, nodes = [node], children, i, index = -1;\n  while (node = nodes.pop()) {\n    callback.call(that, node, ++index, this);\n    if (children = node.children) {\n      for (i = children.length - 1; i >= 0; --i) {\n        nodes.push(children[i]);\n      }\n    }\n  }\n  return this;\n}\n"],"names":["node_eachBefore","callback","that","node","nodes","children","index"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AAEtC,WADIC,IAAO,MAAMC,IAAQ,CAACD,CAAI,GAAGE,GAAU,GAAGC,IAAQ,IAC/CH,IAAOC,EAAM;AAElB,QADAH,EAAS,KAAKC,GAAMC,GAAM,EAAEG,GAAO,IAAI,GACnCD,IAAWF,EAAK;AAClB,WAAK,IAAIE,EAAS,SAAS,GAAG,KAAK,GAAG,EAAE;AACtC,QAAAD,EAAM,KAAKC,EAAS,CAAC,CAAC;AAI5B,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/find.js

@@ -0,0 +1,10 @@
+function f(t, e) {
+  let o = -1;
+  for (const n of this)
+    if (t.call(e, n, ++o, this))
+      return n;
+}
+export {
+  f as default
+};
+//# sourceMappingURL=find.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/find.js"],"sourcesContent":["export default function(callback, that) {\n  let index = -1;\n  for (const node of this) {\n    if (callback.call(that, node, ++index, this)) {\n      return node;\n    }\n  }\n}\n"],"names":["node_find","callback","that","index","node"],"mappings":"AAAe,SAAAA,EAASC,GAAUC,GAAM;AACtC,MAAIC,IAAQ;AACZ,aAAWC,KAAQ;AACjB,QAAIH,EAAS,KAAKC,GAAME,GAAM,EAAED,GAAO,IAAI;AACzC,aAAOC;AAGb;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/index.js

@@ -0,0 +1,65 @@
+import m from "./count.js";
+import c from "./each.js";
+import s from "./eachBefore.js";
+import u from "./eachAfter.js";
+import l from "./find.js";
+import _ from "./sum.js";
+import y from "./sort.js";
+import v from "./path.js";
+import g from "./ancestors.js";
+import A from "./descendants.js";
+import w from "./leaves.js";
+import B from "./links.js";
+import b from "./iterator.js";
+function d(e, o) {
+  e instanceof Map ? (e = [void 0, e], o === void 0 && (o = j)) : o === void 0 && (o = C);
+  for (var f = new i(e), r, h = [f], a, t, n, p; r = h.pop(); )
+    if ((t = o(r.data)) && (p = (t = Array.from(t)).length))
+      for (r.children = t, n = p - 1; n >= 0; --n)
+        h.push(a = t[n] = new i(t[n])), a.parent = r, a.depth = r.depth + 1;
+  return f.eachBefore(D);
+}
+function k() {
+  return d(this).eachBefore(x);
+}
+function C(e) {
+  return e.children;
+}
+function j(e) {
+  return Array.isArray(e) ? e[1] : null;
+}
+function x(e) {
+  e.data.value !== void 0 && (e.value = e.data.value), e.data = e.data.data;
+}
+function D(e) {
+  var o = 0;
+  do
+    e.height = o;
+  while ((e = e.parent) && e.height < ++o);
+}
+function i(e) {
+  this.data = e, this.depth = this.height = 0, this.parent = null;
+}
+i.prototype = d.prototype = {
+  constructor: i,
+  count: m,
+  each: c,
+  eachAfter: u,
+  eachBefore: s,
+  find: l,
+  sum: _,
+  sort: y,
+  path: v,
+  ancestors: g,
+  descendants: A,
+  leaves: w,
+  links: B,
+  copy: k,
+  [Symbol.iterator]: b
+};
+export {
+  i as Node,
+  D as computeHeight,
+  d as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/index.js"],"sourcesContent":["import node_count from \"./count.js\";\nimport node_each from \"./each.js\";\nimport node_eachBefore from \"./eachBefore.js\";\nimport node_eachAfter from \"./eachAfter.js\";\nimport node_find from \"./find.js\";\nimport node_sum from \"./sum.js\";\nimport node_sort from \"./sort.js\";\nimport node_path from \"./path.js\";\nimport node_ancestors from \"./ancestors.js\";\nimport node_descendants from \"./descendants.js\";\nimport node_leaves from \"./leaves.js\";\nimport node_links from \"./links.js\";\nimport node_iterator from \"./iterator.js\";\n\nexport default function hierarchy(data, children) {\n  if (data instanceof Map) {\n    data = [undefined, data];\n    if (children === undefined) children = mapChildren;\n  } else if (children === undefined) {\n    children = objectChildren;\n  }\n\n  var root = new Node(data),\n      node,\n      nodes = [root],\n      child,\n      childs,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if ((childs = children(node.data)) && (n = (childs = Array.from(childs)).length)) {\n      node.children = childs;\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = childs[i] = new Node(childs[i]));\n        child.parent = node;\n        child.depth = node.depth + 1;\n      }\n    }\n  }\n\n  return root.eachBefore(computeHeight);\n}\n\nfunction node_copy() {\n  return hierarchy(this).eachBefore(copyData);\n}\n\nfunction objectChildren(d) {\n  return d.children;\n}\n\nfunction mapChildren(d) {\n  return Array.isArray(d) ? d[1] : null;\n}\n\nfunction copyData(node) {\n  if (node.data.value !== undefined) node.value = node.data.value;\n  node.data = node.data.data;\n}\n\nexport function computeHeight(node) {\n  var height = 0;\n  do node.height = height;\n  while ((node = node.parent) && (node.height < ++height));\n}\n\nexport function Node(data) {\n  this.data = data;\n  this.depth =\n  this.height = 0;\n  this.parent = null;\n}\n\nNode.prototype = hierarchy.prototype = {\n  constructor: Node,\n  count: node_count,\n  each: node_each,\n  eachAfter: node_eachAfter,\n  eachBefore: node_eachBefore,\n  find: node_find,\n  sum: node_sum,\n  sort: node_sort,\n  path: node_path,\n  ancestors: node_ancestors,\n  descendants: node_descendants,\n  leaves: node_leaves,\n  links: node_links,\n  copy: node_copy,\n  [Symbol.iterator]: node_iterator\n};\n"],"names":["hierarchy","data","children","mapChildren","objectChildren","root","Node","node","nodes","child","childs","i","n","computeHeight","node_copy","copyData","d","height","node_count","node_each","node_eachAfter","node_eachBefore","node_find","node_sum","node_sort","node_path","node_ancestors","node_descendants","node_leaves","node_links","node_iterator"],"mappings":";;;;;;;;;;;;;AAce,SAASA,EAAUC,GAAMC,GAAU;AAChD,EAAID,aAAgB,OAClBA,IAAO,CAAC,QAAWA,CAAI,GACnBC,MAAa,WAAWA,IAAWC,MAC9BD,MAAa,WACtBA,IAAWE;AAWb,WARIC,IAAO,IAAIC,EAAKL,CAAI,GACpBM,GACAC,IAAQ,CAACH,CAAI,GACbI,GACAC,GACAC,GACAC,GAEGL,IAAOC,EAAM;AAClB,SAAKE,IAASR,EAASK,EAAK,IAAI,OAAOK,KAAKF,IAAS,MAAM,KAAKA,CAAM,GAAG;AAEvE,WADAH,EAAK,WAAWG,GACXC,IAAIC,IAAI,GAAGD,KAAK,GAAG,EAAEA;AACxB,QAAAH,EAAM,KAAKC,IAAQC,EAAOC,CAAC,IAAI,IAAIL,EAAKI,EAAOC,CAAC,CAAC,CAAC,GAClDF,EAAM,SAASF,GACfE,EAAM,QAAQF,EAAK,QAAQ;AAKjC,SAAOF,EAAK,WAAWQ,CAAa;AACtC;AAEA,SAASC,IAAY;AACnB,SAAOd,EAAU,IAAI,EAAE,WAAWe,CAAQ;AAC5C;AAEA,SAASX,EAAeY,GAAG;AACzB,SAAOA,EAAE;AACX;AAEA,SAASb,EAAYa,GAAG;AACtB,SAAO,MAAM,QAAQA,CAAC,IAAIA,EAAE,CAAC,IAAI;AACnC;AAEA,SAASD,EAASR,GAAM;AACtB,EAAIA,EAAK,KAAK,UAAU,WAAWA,EAAK,QAAQA,EAAK,KAAK,QAC1DA,EAAK,OAAOA,EAAK,KAAK;AACxB;AAEO,SAASM,EAAcN,GAAM;AAClC,MAAIU,IAAS;AACb;AAAG,IAAAV,EAAK,SAASU;AAAA,UACTV,IAAOA,EAAK,WAAYA,EAAK,SAAS,EAAEU;AAClD;AAEO,SAASX,EAAKL,GAAM;AACzB,OAAK,OAAOA,GACZ,KAAK,QACL,KAAK,SAAS,GACd,KAAK,SAAS;AAChB;AAEAK,EAAK,YAAYN,EAAU,YAAY;AAAA,EACrC,aAAaM;AAAA,EACb,OAAOY;AAAA,EACP,MAAMC;AAAA,EACN,WAAWC;AAAA,EACX,YAAYC;AAAA,EACZ,MAAMC;AAAA,EACN,KAAKC;AAAA,EACL,MAAMC;AAAA,EACN,MAAMC;AAAA,EACN,WAAWC;AAAA,EACX,aAAaC;AAAA,EACb,QAAQC;AAAA,EACR,OAAOC;AAAA,EACP,MAAMf;AAAA,EACN,CAAC,OAAO,QAAQ,GAAGgB;AACrB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/iterator.js

@@ -0,0 +1,13 @@
+function* l() {
+  var e = this, t, n = [e], i, r, h;
+  do
+    for (t = n.reverse(), n = []; e = t.pop(); )
+      if (yield e, i = e.children)
+        for (r = 0, h = i.length; r < h; ++r)
+          n.push(i[r]);
+  while (n.length);
+}
+export {
+  l as default
+};
+//# sourceMappingURL=iterator.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/iterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterator.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/iterator.js"],"sourcesContent":["export default function*() {\n  var node = this, current, next = [node], children, i, n;\n  do {\n    current = next.reverse(), next = [];\n    while (node = current.pop()) {\n      yield node;\n      if (children = node.children) {\n        for (i = 0, n = children.length; i < n; ++i) {\n          next.push(children[i]);\n        }\n      }\n    }\n  } while (next.length);\n}\n"],"names":["node_iterator","node","current","next","children","i","n"],"mappings":"AAAe,UAAAA,IAAY;AACzB,MAAIC,IAAO,MAAMC,GAASC,IAAO,CAACF,CAAI,GAAGG,GAAUC,GAAGC;AACtD;AAEE,SADAJ,IAAUC,EAAK,QAAO,GAAIA,IAAO,CAAA,GAC1BF,IAAOC,EAAQ;AAEpB,UADA,MAAMD,GACFG,IAAWH,EAAK;AAClB,aAAKI,IAAI,GAAGC,IAAIF,EAAS,QAAQC,IAAIC,GAAG,EAAED;AACxC,UAAAF,EAAK,KAAKC,EAASC,CAAC,CAAC;AAAA,SAIpBF,EAAK;AAChB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/leaves.js

@@ -0,0 +1,10 @@
+function n() {
+  var e = [];
+  return this.eachBefore(function(a) {
+    a.children || e.push(a);
+  }), e;
+}
+export {
+  n as default
+};
+//# sourceMappingURL=leaves.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/leaves.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"leaves.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/leaves.js"],"sourcesContent":["export default function() {\n  var leaves = [];\n  this.eachBefore(function(node) {\n    if (!node.children) {\n      leaves.push(node);\n    }\n  });\n  return leaves;\n}\n"],"names":["node_leaves","leaves","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAS,CAAA;AACb,cAAK,WAAW,SAASC,GAAM;AAC7B,IAAKA,EAAK,YACRD,EAAO,KAAKC,CAAI;AAAA,EAEpB,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/links.js

@@ -0,0 +1,10 @@
+function a() {
+  var r = this, n = [];
+  return r.each(function(t) {
+    t !== r && n.push({ source: t.parent, target: t });
+  }), n;
+}
+export {
+  a as default
+};
+//# sourceMappingURL=links.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/links.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"links.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/links.js"],"sourcesContent":["export default function() {\n  var root = this, links = [];\n  root.each(function(node) {\n    if (node !== root) { // Don’t include the root’s parent, if any.\n      links.push({source: node.parent, target: node});\n    }\n  });\n  return links;\n}\n"],"names":["node_links","root","links","node"],"mappings":"AAAe,SAAAA,IAAW;AACxB,MAAIC,IAAO,MAAMC,IAAQ,CAAA;AACzB,SAAAD,EAAK,KAAK,SAASE,GAAM;AACvB,IAAIA,MAASF,KACXC,EAAM,KAAK,EAAC,QAAQC,EAAK,QAAQ,QAAQA,EAAI,CAAC;AAAA,EAElD,CAAC,GACMD;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/path.js

@@ -0,0 +1,18 @@
+function p(t) {
+  for (var e = this, r = n(e, t), o = [e]; e !== r; )
+    e = e.parent, o.push(e);
+  for (var s = o.length; t !== r; )
+    o.splice(s, 0, t), t = t.parent;
+  return o;
+}
+function n(t, e) {
+  if (t === e) return t;
+  var r = t.ancestors(), o = e.ancestors(), s = null;
+  for (t = r.pop(), e = o.pop(); t === e; )
+    s = t, t = r.pop(), e = o.pop();
+  return s;
+}
+export {
+  p as default
+};
+//# sourceMappingURL=path.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/path.js"],"sourcesContent":["export default function(end) {\n  var start = this,\n      ancestor = leastCommonAncestor(start, end),\n      nodes = [start];\n  while (start !== ancestor) {\n    start = start.parent;\n    nodes.push(start);\n  }\n  var k = nodes.length;\n  while (end !== ancestor) {\n    nodes.splice(k, 0, end);\n    end = end.parent;\n  }\n  return nodes;\n}\n\nfunction leastCommonAncestor(a, b) {\n  if (a === b) return a;\n  var aNodes = a.ancestors(),\n      bNodes = b.ancestors(),\n      c = null;\n  a = aNodes.pop();\n  b = bNodes.pop();\n  while (a === b) {\n    c = a;\n    a = aNodes.pop();\n    b = bNodes.pop();\n  }\n  return c;\n}\n"],"names":["node_path","end","start","ancestor","leastCommonAncestor","nodes","k","a","b","aNodes","bNodes","c"],"mappings":"AAAe,SAAAA,EAASC,GAAK;AAI3B,WAHIC,IAAQ,MACRC,IAAWC,EAAoBF,GAAOD,CAAG,GACzCI,IAAQ,CAACH,CAAK,GACXA,MAAUC;AACf,IAAAD,IAAQA,EAAM,QACdG,EAAM,KAAKH,CAAK;AAGlB,WADII,IAAID,EAAM,QACPJ,MAAQE;AACb,IAAAE,EAAM,OAAOC,GAAG,GAAGL,CAAG,GACtBA,IAAMA,EAAI;AAEZ,SAAOI;AACT;AAEA,SAASD,EAAoBG,GAAGC,GAAG;AACjC,MAAID,MAAMC,EAAG,QAAOD;AACpB,MAAIE,IAASF,EAAE,UAAS,GACpBG,IAASF,EAAE,UAAS,GACpBG,IAAI;AAGR,OAFAJ,IAAIE,EAAO,IAAG,GACdD,IAAIE,EAAO,IAAG,GACPH,MAAMC;AACX,IAAAG,IAAIJ,GACJA,IAAIE,EAAO,IAAG,GACdD,IAAIE,EAAO,IAAG;AAEhB,SAAOC;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/sort.js

@@ -0,0 +1,9 @@
+function t(r) {
+  return this.eachBefore(function(e) {
+    e.children && e.children.sort(r);
+  });
+}
+export {
+  t as default
+};
+//# sourceMappingURL=sort.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/sort.js"],"sourcesContent":["export default function(compare) {\n  return this.eachBefore(function(node) {\n    if (node.children) {\n      node.children.sort(compare);\n    }\n  });\n}\n"],"names":["node_sort","compare","node"],"mappings":"AAAe,SAAAA,EAASC,GAAS;AAC/B,SAAO,KAAK,WAAW,SAASC,GAAM;AACpC,IAAIA,EAAK,YACPA,EAAK,SAAS,KAAKD,CAAO;AAAA,EAE9B,CAAC;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/hierarchy/sum.js

@@ -0,0 +1,10 @@
+function l(i) {
+  return this.eachAfter(function(e) {
+    for (var a = +i(e.data) || 0, t = e.children, u = t && t.length; --u >= 0; ) a += t[u].value;
+    e.value = a;
+  });
+}
+export {
+  l as default
+};
+//# sourceMappingURL=sum.js.map

package/dist/node_modules/d3-hierarchy/src/hierarchy/sum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sum.js","sources":["../../../../../node_modules/d3-hierarchy/src/hierarchy/sum.js"],"sourcesContent":["export default function(value) {\n  return this.eachAfter(function(node) {\n    var sum = +value(node.data) || 0,\n        children = node.children,\n        i = children && children.length;\n    while (--i >= 0) sum += children[i].value;\n    node.value = sum;\n  });\n}\n"],"names":["node_sum","value","node","sum","children","i"],"mappings":"AAAe,SAAAA,EAASC,GAAO;AAC7B,SAAO,KAAK,UAAU,SAASC,GAAM;AAInC,aAHIC,IAAM,CAACF,EAAMC,EAAK,IAAI,KAAK,GAC3BE,IAAWF,EAAK,UAChBG,IAAID,KAAYA,EAAS,QACtB,EAAEC,KAAK,IAAG,CAAAF,KAAOC,EAASC,CAAC,EAAE;AACpC,IAAAH,EAAK,QAAQC;AAAA,EACf,CAAC;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-hierarchy/src/lcg.js

@@ -0,0 +1,8 @@
+function c() {
+  let t = 1;
+  return () => (t = (1664525 * t + 1013904223) % 4294967296) / 4294967296;
+}
+export {
+  c as default
+};
+//# sourceMappingURL=lcg.js.map

package/dist/node_modules/d3-hierarchy/src/lcg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lcg.js","sources":["../../../../node_modules/d3-hierarchy/src/lcg.js"],"sourcesContent":["// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n"],"names":["lcg","s"],"mappings":"AAKe,SAAAA,IAAW;AACxB,MAAIC,IAAI;AACR,SAAO,OAAOA,KAAK,UAAIA,IAAI,cAAK,cAAK;AACvC;","x_google_ignoreList":[0]}