@hkyhy/marsun-components-core 0.1.113 → 0.1.115

package/dist/node_modules/d3-geo/src/clip/circle.js

@@ -0,0 +1,67 @@
+import { cartesian as Q, cartesianCross as T, cartesianDot as P, cartesianScale as R, cartesianAddInPlace as w, spherical as U } from "../cartesian.js";
+import { circleStream as $ } from "../circle.js";
+import { pi as v, cos as y, abs as F, epsilon as g, sqrt as b, radians as m } from "../math.js";
+import G from "../pointEqual.js";
+import nn from "./index.js";
+function cn(d) {
+  var x = y(d), V = 2 * m, A = x > 0, W = F(x) > g;
+  function X(n, i, o, e) {
+    $(e, d, V, o, n, i);
+  }
+  function J(n, i) {
+    return y(n) * y(i) > x;
+  }
+  function Y(n) {
+    var i, o, e, C, a;
+    return {
+      lineStart: function() {
+        C = e = !1, a = 1;
+      },
+      point: function(f, u) {
+        var t = [f, u], r, c = J(f, u), H = A ? c ? 0 : K(f, u) : c ? K(f + (f < 0 ? v : -v), u) : 0;
+        if (!i && (C = e = c) && n.lineStart(), c !== e && (r = D(i, t), (!r || G(i, r) || G(t, r)) && (t[2] = 1)), c !== e)
+          a = 0, c ? (n.lineStart(), r = D(t, i), n.point(r[0], r[1])) : (r = D(i, t), n.point(r[0], r[1], 2), n.lineEnd()), i = r;
+        else if (W && i && A ^ c) {
+          var l;
+          !(H & o) && (l = D(t, i, !0)) && (a = 0, A ? (n.lineStart(), n.point(l[0][0], l[0][1]), n.point(l[1][0], l[1][1]), n.lineEnd()) : (n.point(l[1][0], l[1][1]), n.lineEnd(), n.lineStart(), n.point(l[0][0], l[0][1], 3)));
+        }
+        c && (!i || !G(i, t)) && n.point(t[0], t[1]), i = t, e = c, o = H;
+      },
+      lineEnd: function() {
+        e && n.lineEnd(), i = null;
+      },
+      // Rejoin first and last segments if there were intersections and the first
+      // and last points were visible.
+      clean: function() {
+        return a | (C && e) << 1;
+      }
+    };
+  }
+  function D(n, i, o) {
+    var e = Q(n), C = Q(i), a = [1, 0, 0], f = T(e, C), u = P(f, f), t = f[0], r = u - t * t;
+    if (!r) return !o && n;
+    var c = x * u / r, H = -x * t / r, l = T(a, f), S = R(a, c), Z = R(f, H);
+    w(S, Z);
+    var z = l, I = P(S, z), h = P(z, z), M = I * I - h * (P(S, S) - 1);
+    if (!(M < 0)) {
+      var N = b(M), p = R(z, (-I - N) / h);
+      if (w(p, S), p = U(p), !o) return p;
+      var s = n[0], B = i[0], E = n[1], q = i[1], L;
+      B < s && (L = s, s = B, B = L);
+      var j = B - s, k = F(j - v) < g, _ = k || j < g;
+      if (!k && q < E && (L = E, E = q, q = L), _ ? k ? E + q > 0 ^ p[1] < (F(p[0] - s) < g ? E : q) : E <= p[1] && p[1] <= q : j > v ^ (s <= p[0] && p[0] <= B)) {
+        var O = R(z, (-I + N) / h);
+        return w(O, S), [p, U(O)];
+      }
+    }
+  }
+  function K(n, i) {
+    var o = A ? d : v - d, e = 0;
+    return n < -o ? e |= 1 : n > o && (e |= 2), i < -o ? e |= 4 : i > o && (e |= 8), e;
+  }
+  return nn(J, Y, X, A ? [0, -d] : [-v, d - v]);
+}
+export {
+  cn as default
+};
+//# sourceMappingURL=circle.js.map

package/dist/node_modules/d3-geo/src/clip/circle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"circle.js","sources":["../../../../../node_modules/d3-geo/src/clip/circle.js"],"sourcesContent":["import {cartesian, cartesianAddInPlace, cartesianCross, cartesianDot, cartesianScale, spherical} from \"../cartesian.js\";\nimport {circleStream} from \"../circle.js\";\nimport {abs, cos, epsilon, pi, radians, sqrt} from \"../math.js\";\nimport pointEqual from \"../pointEqual.js\";\nimport clip from \"./index.js\";\n\nexport default function(radius) {\n  var cr = cos(radius),\n      delta = 2 * radians,\n      smallRadius = cr > 0,\n      notHemisphere = abs(cr) > epsilon; // TODO optimise for this common case\n\n  function interpolate(from, to, direction, stream) {\n    circleStream(stream, radius, delta, direction, from, to);\n  }\n\n  function visible(lambda, phi) {\n    return cos(lambda) * cos(phi) > cr;\n  }\n\n  // Takes a line and cuts into visible segments. Return values used for polygon\n  // clipping: 0 - there were intersections or the line was empty; 1 - no\n  // intersections 2 - there were intersections, and the first and last segments\n  // should be rejoined.\n  function clipLine(stream) {\n    var point0, // previous point\n        c0, // code for previous point\n        v0, // visibility of previous point\n        v00, // visibility of first point\n        clean; // no intersections\n    return {\n      lineStart: function() {\n        v00 = v0 = false;\n        clean = 1;\n      },\n      point: function(lambda, phi) {\n        var point1 = [lambda, phi],\n            point2,\n            v = visible(lambda, phi),\n            c = smallRadius\n              ? v ? 0 : code(lambda, phi)\n              : v ? code(lambda + (lambda < 0 ? pi : -pi), phi) : 0;\n        if (!point0 && (v00 = v0 = v)) stream.lineStart();\n        if (v !== v0) {\n          point2 = intersect(point0, point1);\n          if (!point2 || pointEqual(point0, point2) || pointEqual(point1, point2))\n            point1[2] = 1;\n        }\n        if (v !== v0) {\n          clean = 0;\n          if (v) {\n            // outside going in\n            stream.lineStart();\n            point2 = intersect(point1, point0);\n            stream.point(point2[0], point2[1]);\n          } else {\n            // inside going out\n            point2 = intersect(point0, point1);\n            stream.point(point2[0], point2[1], 2);\n            stream.lineEnd();\n          }\n          point0 = point2;\n        } else if (notHemisphere && point0 && smallRadius ^ v) {\n          var t;\n          // If the codes for two points are different, or are both zero,\n          // and there this segment intersects with the small circle.\n          if (!(c & c0) && (t = intersect(point1, point0, true))) {\n            clean = 0;\n            if (smallRadius) {\n              stream.lineStart();\n              stream.point(t[0][0], t[0][1]);\n              stream.point(t[1][0], t[1][1]);\n              stream.lineEnd();\n            } else {\n              stream.point(t[1][0], t[1][1]);\n              stream.lineEnd();\n              stream.lineStart();\n              stream.point(t[0][0], t[0][1], 3);\n            }\n          }\n        }\n        if (v && (!point0 || !pointEqual(point0, point1))) {\n          stream.point(point1[0], point1[1]);\n        }\n        point0 = point1, v0 = v, c0 = c;\n      },\n      lineEnd: function() {\n        if (v0) stream.lineEnd();\n        point0 = null;\n      },\n      // Rejoin first and last segments if there were intersections and the first\n      // and last points were visible.\n      clean: function() {\n        return clean | ((v00 && v0) << 1);\n      }\n    };\n  }\n\n  // Intersects the great circle between a and b with the clip circle.\n  function intersect(a, b, two) {\n    var pa = cartesian(a),\n        pb = cartesian(b);\n\n    // We have two planes, n1.p = d1 and n2.p = d2.\n    // Find intersection line p(t) = c1 n1 + c2 n2 + t (n1 ⨯ n2).\n    var n1 = [1, 0, 0], // normal\n        n2 = cartesianCross(pa, pb),\n        n2n2 = cartesianDot(n2, n2),\n        n1n2 = n2[0], // cartesianDot(n1, n2),\n        determinant = n2n2 - n1n2 * n1n2;\n\n    // Two polar points.\n    if (!determinant) return !two && a;\n\n    var c1 =  cr * n2n2 / determinant,\n        c2 = -cr * n1n2 / determinant,\n        n1xn2 = cartesianCross(n1, n2),\n        A = cartesianScale(n1, c1),\n        B = cartesianScale(n2, c2);\n    cartesianAddInPlace(A, B);\n\n    // Solve |p(t)|^2 = 1.\n    var u = n1xn2,\n        w = cartesianDot(A, u),\n        uu = cartesianDot(u, u),\n        t2 = w * w - uu * (cartesianDot(A, A) - 1);\n\n    if (t2 < 0) return;\n\n    var t = sqrt(t2),\n        q = cartesianScale(u, (-w - t) / uu);\n    cartesianAddInPlace(q, A);\n    q = spherical(q);\n\n    if (!two) return q;\n\n    // Two intersection points.\n    var lambda0 = a[0],\n        lambda1 = b[0],\n        phi0 = a[1],\n        phi1 = b[1],\n        z;\n\n    if (lambda1 < lambda0) z = lambda0, lambda0 = lambda1, lambda1 = z;\n\n    var delta = lambda1 - lambda0,\n        polar = abs(delta - pi) < epsilon,\n        meridian = polar || delta < epsilon;\n\n    if (!polar && phi1 < phi0) z = phi0, phi0 = phi1, phi1 = z;\n\n    // Check that the first point is between a and b.\n    if (meridian\n        ? polar\n          ? phi0 + phi1 > 0 ^ q[1] < (abs(q[0] - lambda0) < epsilon ? phi0 : phi1)\n          : phi0 <= q[1] && q[1] <= phi1\n        : delta > pi ^ (lambda0 <= q[0] && q[0] <= lambda1)) {\n      var q1 = cartesianScale(u, (-w + t) / uu);\n      cartesianAddInPlace(q1, A);\n      return [q, spherical(q1)];\n    }\n  }\n\n  // Generates a 4-bit vector representing the location of a point relative to\n  // the small circle's bounding box.\n  function code(lambda, phi) {\n    var r = smallRadius ? radius : pi - radius,\n        code = 0;\n    if (lambda < -r) code |= 1; // left\n    else if (lambda > r) code |= 2; // right\n    if (phi < -r) code |= 4; // below\n    else if (phi > r) code |= 8; // above\n    return code;\n  }\n\n  return clip(visible, clipLine, interpolate, smallRadius ? [0, -radius] : [-pi, radius - pi]);\n}\n"],"names":["clipCircle","radius","cr","cos","delta","radians","smallRadius","notHemisphere","abs","epsilon","interpolate","from","to","direction","stream","circleStream","visible","lambda","phi","clipLine","point0","c0","v0","v00","clean","point1","point2","v","c","code","pi","intersect","pointEqual","t","a","b","two","pa","cartesian","pb","n1","n2","cartesianCross","n2n2","cartesianDot","n1n2","determinant","c1","c2","n1xn2","A","cartesianScale","B","cartesianAddInPlace","u","w","uu","t2","sqrt","q","spherical","lambda0","lambda1","phi0","phi1","z","polar","meridian","q1","r","clip"],"mappings":";;;;;AAMe,SAAAA,GAASC,GAAQ;AAC9B,MAAIC,IAAKC,EAAIF,CAAM,GACfG,IAAQ,IAAIC,GACZC,IAAcJ,IAAK,GACnBK,IAAgBC,EAAIN,CAAE,IAAIO;AAE9B,WAASC,EAAYC,GAAMC,GAAIC,GAAWC,GAAQ;AAChD,IAAAC,EAAaD,GAAQb,GAAQG,GAAOS,GAAWF,GAAMC,CAAE;AAAA,EACzD;AAEA,WAASI,EAAQC,GAAQC,GAAK;AAC5B,WAAOf,EAAIc,CAAM,IAAId,EAAIe,CAAG,IAAIhB;AAAA,EAClC;AAMA,WAASiB,EAASL,GAAQ;AACxB,QAAIM,GACAC,GACAC,GACAC,GACAC;AACJ,WAAO;AAAA,MACL,WAAW,WAAW;AACpB,QAAAD,IAAMD,IAAK,IACXE,IAAQ;AAAA,MACV;AAAA,MACA,OAAO,SAASP,GAAQC,GAAK;AAC3B,YAAIO,IAAS,CAACR,GAAQC,CAAG,GACrBQ,GACAC,IAAIX,EAAQC,GAAQC,CAAG,GACvBU,IAAItB,IACAqB,IAAI,IAAIE,EAAKZ,GAAQC,CAAG,IACxBS,IAAIE,EAAKZ,KAAUA,IAAS,IAAIa,IAAK,CAACA,IAAKZ,CAAG,IAAI;AAO1D,YANI,CAACE,MAAWG,IAAMD,IAAKK,MAAIb,EAAO,UAAS,GAC3Ca,MAAML,MACRI,IAASK,EAAUX,GAAQK,CAAM,IAC7B,CAACC,KAAUM,EAAWZ,GAAQM,CAAM,KAAKM,EAAWP,GAAQC,CAAM,OACpED,EAAO,CAAC,IAAI,KAEZE,MAAML;AACR,UAAAE,IAAQ,GACJG,KAEFb,EAAO,UAAS,GAChBY,IAASK,EAAUN,GAAQL,CAAM,GACjCN,EAAO,MAAMY,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC,MAGjCA,IAASK,EAAUX,GAAQK,CAAM,GACjCX,EAAO,MAAMY,EAAO,CAAC,GAAGA,EAAO,CAAC,GAAG,CAAC,GACpCZ,EAAO,QAAO,IAEhBM,IAASM;AAAA,iBACAnB,KAAiBa,KAAUd,IAAcqB,GAAG;AACrD,cAAIM;AAGJ,UAAI,EAAEL,IAAIP,OAAQY,IAAIF,EAAUN,GAAQL,GAAQ,EAAI,OAClDI,IAAQ,GACJlB,KACFQ,EAAO,UAAS,GAChBA,EAAO,MAAMmB,EAAE,CAAC,EAAE,CAAC,GAAGA,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7BnB,EAAO,MAAMmB,EAAE,CAAC,EAAE,CAAC,GAAGA,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7BnB,EAAO,QAAO,MAEdA,EAAO,MAAMmB,EAAE,CAAC,EAAE,CAAC,GAAGA,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7BnB,EAAO,QAAO,GACdA,EAAO,UAAS,GAChBA,EAAO,MAAMmB,EAAE,CAAC,EAAE,CAAC,GAAGA,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;AAAA,QAGtC;AACA,QAAIN,MAAM,CAACP,KAAU,CAACY,EAAWZ,GAAQK,CAAM,MAC7CX,EAAO,MAAMW,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC,GAEnCL,IAASK,GAAQH,IAAKK,GAAGN,IAAKO;AAAA,MAChC;AAAA,MACA,SAAS,WAAW;AAClB,QAAIN,KAAIR,EAAO,QAAO,GACtBM,IAAS;AAAA,MACX;AAAA;AAAA;AAAA,MAGA,OAAO,WAAW;AAChB,eAAOI,KAAUD,KAAOD,MAAO;AAAA,MACjC;AAAA,IACN;AAAA,EACE;AAGA,WAASS,EAAUG,GAAGC,GAAGC,GAAK;AAC5B,QAAIC,IAAKC,EAAUJ,CAAC,GAChBK,IAAKD,EAAUH,CAAC,GAIhBK,IAAK,CAAC,GAAG,GAAG,CAAC,GACbC,IAAKC,EAAeL,GAAIE,CAAE,GAC1BI,IAAOC,EAAaH,GAAIA,CAAE,GAC1BI,IAAOJ,EAAG,CAAC,GACXK,IAAcH,IAAOE,IAAOA;AAGhC,QAAI,CAACC,EAAa,QAAO,CAACV,KAAOF;AAEjC,QAAIa,IAAM7C,IAAKyC,IAAOG,GAClBE,IAAK,CAAC9C,IAAK2C,IAAOC,GAClBG,IAAQP,EAAeF,GAAIC,CAAE,GAC7BS,IAAIC,EAAeX,GAAIO,CAAE,GACzBK,IAAID,EAAeV,GAAIO,CAAE;AAC7B,IAAAK,EAAoBH,GAAGE,CAAC;AAGxB,QAAIE,IAAIL,GACJM,IAAIX,EAAaM,GAAGI,CAAC,GACrBE,IAAKZ,EAAaU,GAAGA,CAAC,GACtBG,IAAKF,IAAIA,IAAIC,KAAMZ,EAAaM,GAAGA,CAAC,IAAI;AAE5C,QAAI,EAAAO,IAAK,IAET;AAAA,UAAIxB,IAAIyB,EAAKD,CAAE,GACXE,IAAIR,EAAeG,IAAI,CAACC,IAAItB,KAAKuB,CAAE;AAIvC,UAHAH,EAAoBM,GAAGT,CAAC,GACxBS,IAAIC,EAAUD,CAAC,GAEX,CAACvB,EAAK,QAAOuB;AAGjB,UAAIE,IAAU3B,EAAE,CAAC,GACb4B,IAAU3B,EAAE,CAAC,GACb4B,IAAO7B,EAAE,CAAC,GACV8B,IAAO7B,EAAE,CAAC,GACV8B;AAEJ,MAAIH,IAAUD,MAASI,IAAIJ,GAASA,IAAUC,GAASA,IAAUG;AAEjE,UAAI7D,IAAQ0D,IAAUD,GAClBK,IAAQ1D,EAAIJ,IAAQ0B,CAAE,IAAIrB,GAC1B0D,IAAWD,KAAS9D,IAAQK;AAKhC,UAHI,CAACyD,KAASF,IAAOD,MAAME,IAAIF,GAAMA,IAAOC,GAAMA,IAAOC,IAGrDE,IACED,IACEH,IAAOC,IAAO,IAAIL,EAAE,CAAC,KAAKnD,EAAImD,EAAE,CAAC,IAAIE,CAAO,IAAIpD,IAAUsD,IAAOC,KACjED,KAAQJ,EAAE,CAAC,KAAKA,EAAE,CAAC,KAAKK,IAC1B5D,IAAQ0B,KAAM+B,KAAWF,EAAE,CAAC,KAAKA,EAAE,CAAC,KAAKG,IAAU;AACvD,YAAIM,IAAKjB,EAAeG,IAAI,CAACC,IAAItB,KAAKuB,CAAE;AACxC,eAAAH,EAAoBe,GAAIlB,CAAC,GAClB,CAACS,GAAGC,EAAUQ,CAAE,CAAC;AAAA,MAC1B;AAAA;AAAA,EACF;AAIA,WAASvC,EAAKZ,GAAQC,GAAK;AACzB,QAAImD,IAAI/D,IAAcL,IAAS6B,IAAK7B,GAChC4B,IAAO;AACX,WAAIZ,IAAS,CAACoD,IAAGxC,KAAQ,IAChBZ,IAASoD,MAAGxC,KAAQ,IACzBX,IAAM,CAACmD,IAAGxC,KAAQ,IACbX,IAAMmD,MAAGxC,KAAQ,IACnBA;AAAA,EACT;AAEA,SAAOyC,GAAKtD,GAASG,GAAUT,GAAaJ,IAAc,CAAC,GAAG,CAACL,CAAM,IAAI,CAAC,CAAC6B,GAAI7B,IAAS6B,CAAE,CAAC;AAC7F;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/clip/index.js

@@ -0,0 +1,68 @@
+import w from "./buffer.js";
+import z from "./rejoin.js";
+import { halfPi as c, epsilon as R } from "../math.js";
+import A from "../polygonContains.js";
+import D from "../../../d3-array/src/merge.js";
+function N(r, l, S, j) {
+  return function(n) {
+    var d = l(n), y = w(), u = l(y), e = !1, g, f, p, i = {
+      point: m,
+      lineStart: h,
+      lineEnd: v,
+      polygonStart: function() {
+        i.point = s, i.lineStart = P, i.lineEnd = q, f = [], g = [];
+      },
+      polygonEnd: function() {
+        i.point = m, i.lineStart = h, i.lineEnd = v, f = D(f);
+        var o = A(g, j);
+        f.length ? (e || (n.polygonStart(), e = !0), z(f, G, o, S, n)) : o && (e || (n.polygonStart(), e = !0), n.lineStart(), S(null, null, 1, n), n.lineEnd()), e && (n.polygonEnd(), e = !1), f = g = null;
+      },
+      sphere: function() {
+        n.polygonStart(), n.lineStart(), S(null, null, 1, n), n.lineEnd(), n.polygonEnd();
+      }
+    };
+    function m(o, t) {
+      r(o, t) && n.point(o, t);
+    }
+    function C(o, t) {
+      d.point(o, t);
+    }
+    function h() {
+      i.point = C, d.lineStart();
+    }
+    function v() {
+      i.point = m, d.lineEnd();
+    }
+    function s(o, t) {
+      p.push([o, t]), u.point(o, t);
+    }
+    function P() {
+      u.lineStart(), p = [];
+    }
+    function q() {
+      s(p[0][0], p[0][1]), u.lineEnd();
+      var o = u.clean(), t = y.result(), a, x = t.length, B, E, I;
+      if (p.pop(), g.push(p), p = null, !!x) {
+        if (o & 1) {
+          if (E = t[0], (B = E.length - 1) > 0) {
+            for (e || (n.polygonStart(), e = !0), n.lineStart(), a = 0; a < B; ++a) n.point((I = E[a])[0], I[1]);
+            n.lineEnd();
+          }
+          return;
+        }
+        x > 1 && o & 2 && t.push(t.pop().concat(t.shift())), f.push(t.filter(F));
+      }
+    }
+    return i;
+  };
+}
+function F(r) {
+  return r.length > 1;
+}
+function G(r, l) {
+  return ((r = r.x)[0] < 0 ? r[1] - c - R : c - r[1]) - ((l = l.x)[0] < 0 ? l[1] - c - R : c - l[1]);
+}
+export {
+  N as default
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/d3-geo/src/clip/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/d3-geo/src/clip/index.js"],"sourcesContent":["import clipBuffer from \"./buffer.js\";\nimport clipRejoin from \"./rejoin.js\";\nimport {epsilon, halfPi} from \"../math.js\";\nimport polygonContains from \"../polygonContains.js\";\nimport {merge} from \"d3-array\";\n\nexport default function(pointVisible, clipLine, interpolate, start) {\n  return function(sink) {\n    var line = clipLine(sink),\n        ringBuffer = clipBuffer(),\n        ringSink = clipLine(ringBuffer),\n        polygonStarted = false,\n        polygon,\n        segments,\n        ring;\n\n    var clip = {\n      point: point,\n      lineStart: lineStart,\n      lineEnd: lineEnd,\n      polygonStart: function() {\n        clip.point = pointRing;\n        clip.lineStart = ringStart;\n        clip.lineEnd = ringEnd;\n        segments = [];\n        polygon = [];\n      },\n      polygonEnd: function() {\n        clip.point = point;\n        clip.lineStart = lineStart;\n        clip.lineEnd = lineEnd;\n        segments = merge(segments);\n        var startInside = polygonContains(polygon, start);\n        if (segments.length) {\n          if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n          clipRejoin(segments, compareIntersection, startInside, interpolate, sink);\n        } else if (startInside) {\n          if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n          sink.lineStart();\n          interpolate(null, null, 1, sink);\n          sink.lineEnd();\n        }\n        if (polygonStarted) sink.polygonEnd(), polygonStarted = false;\n        segments = polygon = null;\n      },\n      sphere: function() {\n        sink.polygonStart();\n        sink.lineStart();\n        interpolate(null, null, 1, sink);\n        sink.lineEnd();\n        sink.polygonEnd();\n      }\n    };\n\n    function point(lambda, phi) {\n      if (pointVisible(lambda, phi)) sink.point(lambda, phi);\n    }\n\n    function pointLine(lambda, phi) {\n      line.point(lambda, phi);\n    }\n\n    function lineStart() {\n      clip.point = pointLine;\n      line.lineStart();\n    }\n\n    function lineEnd() {\n      clip.point = point;\n      line.lineEnd();\n    }\n\n    function pointRing(lambda, phi) {\n      ring.push([lambda, phi]);\n      ringSink.point(lambda, phi);\n    }\n\n    function ringStart() {\n      ringSink.lineStart();\n      ring = [];\n    }\n\n    function ringEnd() {\n      pointRing(ring[0][0], ring[0][1]);\n      ringSink.lineEnd();\n\n      var clean = ringSink.clean(),\n          ringSegments = ringBuffer.result(),\n          i, n = ringSegments.length, m,\n          segment,\n          point;\n\n      ring.pop();\n      polygon.push(ring);\n      ring = null;\n\n      if (!n) return;\n\n      // No intersections.\n      if (clean & 1) {\n        segment = ringSegments[0];\n        if ((m = segment.length - 1) > 0) {\n          if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n          sink.lineStart();\n          for (i = 0; i < m; ++i) sink.point((point = segment[i])[0], point[1]);\n          sink.lineEnd();\n        }\n        return;\n      }\n\n      // Rejoin connected segments.\n      // TODO reuse ringBuffer.rejoin()?\n      if (n > 1 && clean & 2) ringSegments.push(ringSegments.pop().concat(ringSegments.shift()));\n\n      segments.push(ringSegments.filter(validSegment));\n    }\n\n    return clip;\n  };\n}\n\nfunction validSegment(segment) {\n  return segment.length > 1;\n}\n\n// Intersections are sorted along the clip edge. For both antimeridian cutting\n// and circle clipping, the same comparison is used.\nfunction compareIntersection(a, b) {\n  return ((a = a.x)[0] < 0 ? a[1] - halfPi - epsilon : halfPi - a[1])\n       - ((b = b.x)[0] < 0 ? b[1] - halfPi - epsilon : halfPi - b[1]);\n}\n"],"names":["clip","pointVisible","clipLine","interpolate","start","sink","line","ringBuffer","clipBuffer","ringSink","polygonStarted","polygon","segments","ring","point","lineStart","lineEnd","pointRing","ringStart","ringEnd","merge","startInside","polygonContains","clipRejoin","compareIntersection","lambda","phi","pointLine","clean","ringSegments","i","n","m","segment","validSegment","a","b","halfPi","epsilon"],"mappings":";;;;;AAMe,SAAAA,EAASC,GAAcC,GAAUC,GAAaC,GAAO;AAClE,SAAO,SAASC,GAAM;AACpB,QAAIC,IAAOJ,EAASG,CAAI,GACpBE,IAAaC,EAAU,GACvBC,IAAWP,EAASK,CAAU,GAC9BG,IAAiB,IACjBC,GACAC,GACAC,GAEAb,IAAO;AAAA,MACT,OAAOc;AAAA,MACP,WAAWC;AAAA,MACX,SAASC;AAAA,MACT,cAAc,WAAW;AACvB,QAAAhB,EAAK,QAAQiB,GACbjB,EAAK,YAAYkB,GACjBlB,EAAK,UAAUmB,GACfP,IAAW,CAAA,GACXD,IAAU,CAAA;AAAA,MACZ;AAAA,MACA,YAAY,WAAW;AACrB,QAAAX,EAAK,QAAQc,GACbd,EAAK,YAAYe,GACjBf,EAAK,UAAUgB,GACfJ,IAAWQ,EAAMR,CAAQ;AACzB,YAAIS,IAAcC,EAAgBX,GAASP,CAAK;AAChD,QAAIQ,EAAS,UACNF,MAAgBL,EAAK,aAAY,GAAIK,IAAiB,KAC3Da,EAAWX,GAAUY,GAAqBH,GAAalB,GAAaE,CAAI,KAC/DgB,MACJX,MAAgBL,EAAK,aAAY,GAAIK,IAAiB,KAC3DL,EAAK,UAAS,GACdF,EAAY,MAAM,MAAM,GAAGE,CAAI,GAC/BA,EAAK,QAAO,IAEVK,MAAgBL,EAAK,WAAU,GAAIK,IAAiB,KACxDE,IAAWD,IAAU;AAAA,MACvB;AAAA,MACA,QAAQ,WAAW;AACjB,QAAAN,EAAK,aAAY,GACjBA,EAAK,UAAS,GACdF,EAAY,MAAM,MAAM,GAAGE,CAAI,GAC/BA,EAAK,QAAO,GACZA,EAAK,WAAU;AAAA,MACjB;AAAA,IACN;AAEI,aAASS,EAAMW,GAAQC,GAAK;AAC1B,MAAIzB,EAAawB,GAAQC,CAAG,KAAGrB,EAAK,MAAMoB,GAAQC,CAAG;AAAA,IACvD;AAEA,aAASC,EAAUF,GAAQC,GAAK;AAC9B,MAAApB,EAAK,MAAMmB,GAAQC,CAAG;AAAA,IACxB;AAEA,aAASX,IAAY;AACnB,MAAAf,EAAK,QAAQ2B,GACbrB,EAAK,UAAS;AAAA,IAChB;AAEA,aAASU,IAAU;AACjB,MAAAhB,EAAK,QAAQc,GACbR,EAAK,QAAO;AAAA,IACd;AAEA,aAASW,EAAUQ,GAAQC,GAAK;AAC9B,MAAAb,EAAK,KAAK,CAACY,GAAQC,CAAG,CAAC,GACvBjB,EAAS,MAAMgB,GAAQC,CAAG;AAAA,IAC5B;AAEA,aAASR,IAAY;AACnB,MAAAT,EAAS,UAAS,GAClBI,IAAO,CAAA;AAAA,IACT;AAEA,aAASM,IAAU;AACjB,MAAAF,EAAUJ,EAAK,CAAC,EAAE,CAAC,GAAGA,EAAK,CAAC,EAAE,CAAC,CAAC,GAChCJ,EAAS,QAAO;AAEhB,UAAImB,IAAQnB,EAAS,MAAK,GACtBoB,IAAetB,EAAW,OAAM,GAChCuB,GAAGC,IAAIF,EAAa,QAAQG,GAC5BC,GACAnB;AAMJ,UAJAD,EAAK,IAAG,GACRF,EAAQ,KAAKE,CAAI,GACjBA,IAAO,MAEH,EAACkB,GAGL;AAAA,YAAIH,IAAQ,GAAG;AAEb,cADAK,IAAUJ,EAAa,CAAC,IACnBG,IAAIC,EAAQ,SAAS,KAAK,GAAG;AAGhC,iBAFKvB,MAAgBL,EAAK,aAAY,GAAIK,IAAiB,KAC3DL,EAAK,UAAS,GACTyB,IAAI,GAAGA,IAAIE,GAAG,EAAEF,EAAG,CAAAzB,EAAK,OAAOS,IAAQmB,EAAQH,CAAC,GAAG,CAAC,GAAGhB,EAAM,CAAC,CAAC;AACpE,YAAAT,EAAK,QAAO;AAAA,UACd;AACA;AAAA,QACF;AAIA,QAAI0B,IAAI,KAAKH,IAAQ,KAAGC,EAAa,KAAKA,EAAa,IAAG,EAAG,OAAOA,EAAa,MAAK,CAAE,CAAC,GAEzFjB,EAAS,KAAKiB,EAAa,OAAOK,CAAY,CAAC;AAAA;AAAA,IACjD;AAEA,WAAOlC;AAAA,EACT;AACF;AAEA,SAASkC,EAAaD,GAAS;AAC7B,SAAOA,EAAQ,SAAS;AAC1B;AAIA,SAAST,EAAoBW,GAAGC,GAAG;AACjC,WAASD,IAAIA,EAAE,GAAG,CAAC,IAAI,IAAIA,EAAE,CAAC,IAAIE,IAASC,IAAUD,IAASF,EAAE,CAAC,OACxDC,IAAIA,EAAE,GAAG,CAAC,IAAI,IAAIA,EAAE,CAAC,IAAIC,IAASC,IAAUD,IAASD,EAAE,CAAC;AACnE;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/clip/line.js

@@ -0,0 +1,44 @@
+function p(l, s, x, d, y, a) {
+  var n = l[0], u = l[1], c = s[0], o = s[1], f = 0, r = 1, e = c - n, t = o - u, i;
+  if (i = x - n, !(!e && i > 0)) {
+    if (i /= e, e < 0) {
+      if (i < f) return;
+      i < r && (r = i);
+    } else if (e > 0) {
+      if (i > r) return;
+      i > f && (f = i);
+    }
+    if (i = y - n, !(!e && i < 0)) {
+      if (i /= e, e < 0) {
+        if (i > r) return;
+        i > f && (f = i);
+      } else if (e > 0) {
+        if (i < f) return;
+        i < r && (r = i);
+      }
+      if (i = d - u, !(!t && i > 0)) {
+        if (i /= t, t < 0) {
+          if (i < f) return;
+          i < r && (r = i);
+        } else if (t > 0) {
+          if (i > r) return;
+          i > f && (f = i);
+        }
+        if (i = a - u, !(!t && i < 0)) {
+          if (i /= t, t < 0) {
+            if (i > r) return;
+            i > f && (f = i);
+          } else if (t > 0) {
+            if (i < f) return;
+            i < r && (r = i);
+          }
+          return f > 0 && (l[0] = n + f * e, l[1] = u + f * t), r < 1 && (s[0] = n + r * e, s[1] = u + r * t), !0;
+        }
+      }
+    }
+  }
+}
+export {
+  p as default
+};
+//# sourceMappingURL=line.js.map

package/dist/node_modules/d3-geo/src/clip/line.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"line.js","sources":["../../../../../node_modules/d3-geo/src/clip/line.js"],"sourcesContent":["export default function(a, b, x0, y0, x1, y1) {\n  var ax = a[0],\n      ay = a[1],\n      bx = b[0],\n      by = b[1],\n      t0 = 0,\n      t1 = 1,\n      dx = bx - ax,\n      dy = by - ay,\n      r;\n\n  r = x0 - ax;\n  if (!dx && r > 0) return;\n  r /= dx;\n  if (dx < 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  } else if (dx > 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  }\n\n  r = x1 - ax;\n  if (!dx && r < 0) return;\n  r /= dx;\n  if (dx < 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  } else if (dx > 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  }\n\n  r = y0 - ay;\n  if (!dy && r > 0) return;\n  r /= dy;\n  if (dy < 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  } else if (dy > 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  }\n\n  r = y1 - ay;\n  if (!dy && r < 0) return;\n  r /= dy;\n  if (dy < 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  } else if (dy > 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  }\n\n  if (t0 > 0) a[0] = ax + t0 * dx, a[1] = ay + t0 * dy;\n  if (t1 < 1) b[0] = ax + t1 * dx, b[1] = ay + t1 * dy;\n  return true;\n}\n"],"names":["clipLine","a","b","x0","y0","x1","y1","ax","ay","bx","by","t0","t1","dx","dy","r"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAGC,GAAIC,GAAIC,GAAIC,GAAI;AAC5C,MAAIC,IAAKN,EAAE,CAAC,GACRO,IAAKP,EAAE,CAAC,GACRQ,IAAKP,EAAE,CAAC,GACRQ,IAAKR,EAAE,CAAC,GACRS,IAAK,GACLC,IAAK,GACLC,IAAKJ,IAAKF,GACVO,IAAKJ,IAAKF,GACVO;AAGJ,MADAA,IAAIZ,IAAKI,GACL,GAACM,KAAME,IAAI,IAEf;AAAA,QADAA,KAAKF,GACDA,IAAK,GAAG;AACV,UAAIE,IAAIJ,EAAI;AACZ,MAAII,IAAIH,MAAIA,IAAKG;AAAA,IACnB,WAAWF,IAAK,GAAG;AACjB,UAAIE,IAAIH,EAAI;AACZ,MAAIG,IAAIJ,MAAIA,IAAKI;AAAA,IACnB;AAGA,QADAA,IAAIV,IAAKE,GACL,GAACM,KAAME,IAAI,IAEf;AAAA,UADAA,KAAKF,GACDA,IAAK,GAAG;AACV,YAAIE,IAAIH,EAAI;AACZ,QAAIG,IAAIJ,MAAIA,IAAKI;AAAA,MACnB,WAAWF,IAAK,GAAG;AACjB,YAAIE,IAAIJ,EAAI;AACZ,QAAII,IAAIH,MAAIA,IAAKG;AAAA,MACnB;AAGA,UADAA,IAAIX,IAAKI,GACL,GAACM,KAAMC,IAAI,IAEf;AAAA,YADAA,KAAKD,GACDA,IAAK,GAAG;AACV,cAAIC,IAAIJ,EAAI;AACZ,UAAII,IAAIH,MAAIA,IAAKG;AAAA,QACnB,WAAWD,IAAK,GAAG;AACjB,cAAIC,IAAIH,EAAI;AACZ,UAAIG,IAAIJ,MAAIA,IAAKI;AAAA,QACnB;AAGA,YADAA,IAAIT,IAAKE,GACL,GAACM,KAAMC,IAAI,IAEf;AAAA,cADAA,KAAKD,GACDA,IAAK,GAAG;AACV,gBAAIC,IAAIH,EAAI;AACZ,YAAIG,IAAIJ,MAAIA,IAAKI;AAAA,UACnB,WAAWD,IAAK,GAAG;AACjB,gBAAIC,IAAIJ,EAAI;AACZ,YAAII,IAAIH,MAAIA,IAAKG;AAAA,UACnB;AAEA,iBAAIJ,IAAK,MAAGV,EAAE,CAAC,IAAIM,IAAKI,IAAKE,GAAIZ,EAAE,CAAC,IAAIO,IAAKG,IAAKG,IAC9CF,IAAK,MAAGV,EAAE,CAAC,IAAIK,IAAKK,IAAKC,GAAIX,EAAE,CAAC,IAAIM,IAAKI,IAAKE,IAC3C;AAAA;AAAA;AAAA;AAAA;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/clip/rectangle.js

@@ -0,0 +1,77 @@
+import { abs as j, epsilon as k } from "../math.js";
+import W from "./buffer.js";
+import X from "./line.js";
+import Y from "./rejoin.js";
+import Z from "../../../d3-array/src/merge.js";
+var M = 1e9, R = -M;
+function tn(c, _, d, p) {
+  function q(i, n) {
+    return c <= i && i <= d && _ <= n && n <= p;
+  }
+  function z(i, n, l, f) {
+    var o = 0, s = 0;
+    if (i == null || (o = E(i, l)) !== (s = E(n, l)) || A(i, n) < 0 ^ l > 0)
+      do
+        f.point(o === 0 || o === 3 ? c : d, o > 1 ? p : _);
+      while ((o = (o + l + 4) % 4) !== s);
+    else
+      f.point(n[0], n[1]);
+  }
+  function E(i, n) {
+    return j(i[0] - c) < k ? n > 0 ? 0 : 3 : j(i[0] - d) < k ? n > 0 ? 2 : 1 : j(i[1] - _) < k ? n > 0 ? 1 : 0 : n > 0 ? 3 : 2;
+  }
+  function J(i, n) {
+    return A(i.x, n.x);
+  }
+  function A(i, n) {
+    var l = E(i, 1), f = E(n, 1);
+    return l !== f ? l - f : l === 0 ? n[1] - i[1] : l === 1 ? i[0] - n[0] : l === 2 ? i[1] - n[1] : n[0] - i[0];
+  }
+  return function(i) {
+    var n = i, l = W(), f, o, s, C, D, F, I, w, v, B, N, L = {
+      point: G,
+      lineStart: T,
+      lineEnd: U,
+      polygonStart: O,
+      polygonEnd: Q
+    };
+    function G(t, e) {
+      q(t, e) && n.point(t, e);
+    }
+    function K() {
+      for (var t = 0, e = 0, r = o.length; e < r; ++e)
+        for (var u = o[e], a = 1, V = u.length, g = u[0], S, h, P = g[0], m = g[1]; a < V; ++a)
+          S = P, h = m, g = u[a], P = g[0], m = g[1], h <= p ? m > p && (P - S) * (p - h) > (m - h) * (c - S) && ++t : m <= p && (P - S) * (p - h) < (m - h) * (c - S) && --t;
+      return t;
+    }
+    function O() {
+      n = l, f = [], o = [], N = !0;
+    }
+    function Q() {
+      var t = K(), e = N && t, r = (f = Z(f)).length;
+      (e || r) && (i.polygonStart(), e && (i.lineStart(), z(null, null, 1, i), i.lineEnd()), r && Y(f, J, t, z, i), i.polygonEnd()), n = i, f = o = s = null;
+    }
+    function T() {
+      L.point = H, o && o.push(s = []), B = !0, v = !1, I = w = NaN;
+    }
+    function U() {
+      f && (H(C, D), F && v && l.rejoin(), f.push(l.result())), L.point = G, v && n.lineEnd();
+    }
+    function H(t, e) {
+      var r = q(t, e);
+      if (o && s.push([t, e]), B)
+        C = t, D = e, F = r, B = !1, r && (n.lineStart(), n.point(t, e));
+      else if (r && v) n.point(t, e);
+      else {
+        var u = [I = Math.max(R, Math.min(M, I)), w = Math.max(R, Math.min(M, w))], a = [t = Math.max(R, Math.min(M, t)), e = Math.max(R, Math.min(M, e))];
+        X(u, a, c, _, d, p) ? (v || (n.lineStart(), n.point(u[0], u[1])), n.point(a[0], a[1]), r || n.lineEnd(), N = !1) : r && (n.lineStart(), n.point(t, e), N = !1);
+      }
+      I = t, w = e, v = r;
+    }
+    return L;
+  };
+}
+export {
+  tn as default
+};
+//# sourceMappingURL=rectangle.js.map

package/dist/node_modules/d3-geo/src/clip/rectangle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rectangle.js","sources":["../../../../../node_modules/d3-geo/src/clip/rectangle.js"],"sourcesContent":["import {abs, epsilon} from \"../math.js\";\nimport clipBuffer from \"./buffer.js\";\nimport clipLine from \"./line.js\";\nimport clipRejoin from \"./rejoin.js\";\nimport {merge} from \"d3-array\";\n\nvar clipMax = 1e9, clipMin = -clipMax;\n\n// TODO Use d3-polygon’s polygonContains here for the ring check?\n// TODO Eliminate duplicate buffering in clipBuffer and polygon.push?\n\nexport default function clipRectangle(x0, y0, x1, y1) {\n\n  function visible(x, y) {\n    return x0 <= x && x <= x1 && y0 <= y && y <= y1;\n  }\n\n  function interpolate(from, to, direction, stream) {\n    var a = 0, a1 = 0;\n    if (from == null\n        || (a = corner(from, direction)) !== (a1 = corner(to, direction))\n        || comparePoint(from, to) < 0 ^ direction > 0) {\n      do stream.point(a === 0 || a === 3 ? x0 : x1, a > 1 ? y1 : y0);\n      while ((a = (a + direction + 4) % 4) !== a1);\n    } else {\n      stream.point(to[0], to[1]);\n    }\n  }\n\n  function corner(p, direction) {\n    return abs(p[0] - x0) < epsilon ? direction > 0 ? 0 : 3\n        : abs(p[0] - x1) < epsilon ? direction > 0 ? 2 : 1\n        : abs(p[1] - y0) < epsilon ? direction > 0 ? 1 : 0\n        : direction > 0 ? 3 : 2; // abs(p[1] - y1) < epsilon\n  }\n\n  function compareIntersection(a, b) {\n    return comparePoint(a.x, b.x);\n  }\n\n  function comparePoint(a, b) {\n    var ca = corner(a, 1),\n        cb = corner(b, 1);\n    return ca !== cb ? ca - cb\n        : ca === 0 ? b[1] - a[1]\n        : ca === 1 ? a[0] - b[0]\n        : ca === 2 ? a[1] - b[1]\n        : b[0] - a[0];\n  }\n\n  return function(stream) {\n    var activeStream = stream,\n        bufferStream = clipBuffer(),\n        segments,\n        polygon,\n        ring,\n        x__, y__, v__, // first point\n        x_, y_, v_, // previous point\n        first,\n        clean;\n\n    var clipStream = {\n      point: point,\n      lineStart: lineStart,\n      lineEnd: lineEnd,\n      polygonStart: polygonStart,\n      polygonEnd: polygonEnd\n    };\n\n    function point(x, y) {\n      if (visible(x, y)) activeStream.point(x, y);\n    }\n\n    function polygonInside() {\n      var winding = 0;\n\n      for (var i = 0, n = polygon.length; i < n; ++i) {\n        for (var ring = polygon[i], j = 1, m = ring.length, point = ring[0], a0, a1, b0 = point[0], b1 = point[1]; j < m; ++j) {\n          a0 = b0, a1 = b1, point = ring[j], b0 = point[0], b1 = point[1];\n          if (a1 <= y1) { if (b1 > y1 && (b0 - a0) * (y1 - a1) > (b1 - a1) * (x0 - a0)) ++winding; }\n          else { if (b1 <= y1 && (b0 - a0) * (y1 - a1) < (b1 - a1) * (x0 - a0)) --winding; }\n        }\n      }\n\n      return winding;\n    }\n\n    // Buffer geometry within a polygon and then clip it en masse.\n    function polygonStart() {\n      activeStream = bufferStream, segments = [], polygon = [], clean = true;\n    }\n\n    function polygonEnd() {\n      var startInside = polygonInside(),\n          cleanInside = clean && startInside,\n          visible = (segments = merge(segments)).length;\n      if (cleanInside || visible) {\n        stream.polygonStart();\n        if (cleanInside) {\n          stream.lineStart();\n          interpolate(null, null, 1, stream);\n          stream.lineEnd();\n        }\n        if (visible) {\n          clipRejoin(segments, compareIntersection, startInside, interpolate, stream);\n        }\n        stream.polygonEnd();\n      }\n      activeStream = stream, segments = polygon = ring = null;\n    }\n\n    function lineStart() {\n      clipStream.point = linePoint;\n      if (polygon) polygon.push(ring = []);\n      first = true;\n      v_ = false;\n      x_ = y_ = NaN;\n    }\n\n    // TODO rather than special-case polygons, simply handle them separately.\n    // Ideally, coincident intersection points should be jittered to avoid\n    // clipping issues.\n    function lineEnd() {\n      if (segments) {\n        linePoint(x__, y__);\n        if (v__ && v_) bufferStream.rejoin();\n        segments.push(bufferStream.result());\n      }\n      clipStream.point = point;\n      if (v_) activeStream.lineEnd();\n    }\n\n    function linePoint(x, y) {\n      var v = visible(x, y);\n      if (polygon) ring.push([x, y]);\n      if (first) {\n        x__ = x, y__ = y, v__ = v;\n        first = false;\n        if (v) {\n          activeStream.lineStart();\n          activeStream.point(x, y);\n        }\n      } else {\n        if (v && v_) activeStream.point(x, y);\n        else {\n          var a = [x_ = Math.max(clipMin, Math.min(clipMax, x_)), y_ = Math.max(clipMin, Math.min(clipMax, y_))],\n              b = [x = Math.max(clipMin, Math.min(clipMax, x)), y = Math.max(clipMin, Math.min(clipMax, y))];\n          if (clipLine(a, b, x0, y0, x1, y1)) {\n            if (!v_) {\n              activeStream.lineStart();\n              activeStream.point(a[0], a[1]);\n            }\n            activeStream.point(b[0], b[1]);\n            if (!v) activeStream.lineEnd();\n            clean = false;\n          } else if (v) {\n            activeStream.lineStart();\n            activeStream.point(x, y);\n            clean = false;\n          }\n        }\n      }\n      x_ = x, y_ = y, v_ = v;\n    }\n\n    return clipStream;\n  };\n}\n"],"names":["clipMax","clipMin","clipRectangle","x0","y0","x1","y1","visible","x","y","interpolate","from","to","direction","stream","a","a1","corner","comparePoint","p","abs","epsilon","compareIntersection","b","ca","cb","activeStream","bufferStream","clipBuffer","segments","polygon","ring","x__","y__","v__","x_","y_","v_","first","clean","clipStream","point","lineStart","lineEnd","polygonStart","polygonEnd","polygonInside","winding","i","n","j","m","a0","b0","b1","startInside","cleanInside","merge","clipRejoin","linePoint","v","clipLine"],"mappings":";;;;;AAMA,IAAIA,IAAU,KAAKC,IAAU,CAACD;AAKf,SAASE,GAAcC,GAAIC,GAAIC,GAAIC,GAAI;AAEpD,WAASC,EAAQC,GAAGC,GAAG;AACrB,WAAON,KAAMK,KAAKA,KAAKH,KAAMD,KAAMK,KAAKA,KAAKH;AAAA,EAC/C;AAEA,WAASI,EAAYC,GAAMC,GAAIC,GAAWC,GAAQ;AAChD,QAAIC,IAAI,GAAGC,IAAK;AAChB,QAAIL,KAAQ,SACJI,IAAIE,EAAON,GAAME,CAAS,QAAQG,IAAKC,EAAOL,GAAIC,CAAS,MAC5DK,EAAaP,GAAMC,CAAE,IAAI,IAAIC,IAAY;AAC9C;AAAG,QAAAC,EAAO,MAAMC,MAAM,KAAKA,MAAM,IAAIZ,IAAKE,GAAIU,IAAI,IAAIT,IAAKF,CAAE;AAAA,cACrDW,KAAKA,IAAIF,IAAY,KAAK,OAAOG;AAAA;AAEzC,MAAAF,EAAO,MAAMF,EAAG,CAAC,GAAGA,EAAG,CAAC,CAAC;AAAA,EAE7B;AAEA,WAASK,EAAOE,GAAGN,GAAW;AAC5B,WAAOO,EAAID,EAAE,CAAC,IAAIhB,CAAE,IAAIkB,IAAUR,IAAY,IAAI,IAAI,IAChDO,EAAID,EAAE,CAAC,IAAId,CAAE,IAAIgB,IAAUR,IAAY,IAAI,IAAI,IAC/CO,EAAID,EAAE,CAAC,IAAIf,CAAE,IAAIiB,IAAUR,IAAY,IAAI,IAAI,IAC/CA,IAAY,IAAI,IAAI;AAAA,EAC5B;AAEA,WAASS,EAAoBP,GAAGQ,GAAG;AACjC,WAAOL,EAAaH,EAAE,GAAGQ,EAAE,CAAC;AAAA,EAC9B;AAEA,WAASL,EAAaH,GAAGQ,GAAG;AAC1B,QAAIC,IAAKP,EAAOF,GAAG,CAAC,GAChBU,IAAKR,EAAOM,GAAG,CAAC;AACpB,WAAOC,MAAOC,IAAKD,IAAKC,IAClBD,MAAO,IAAID,EAAE,CAAC,IAAIR,EAAE,CAAC,IACrBS,MAAO,IAAIT,EAAE,CAAC,IAAIQ,EAAE,CAAC,IACrBC,MAAO,IAAIT,EAAE,CAAC,IAAIQ,EAAE,CAAC,IACrBA,EAAE,CAAC,IAAIR,EAAE,CAAC;AAAA,EAClB;AAEA,SAAO,SAASD,GAAQ;AACtB,QAAIY,IAAeZ,GACfa,IAAeC,EAAU,GACzBC,GACAC,GACAC,GACAC,GAAKC,GAAKC,GACVC,GAAIC,GAAIC,GACRC,GACAC,GAEAC,IAAa;AAAA,MACf,OAAOC;AAAA,MACP,WAAWC;AAAA,MACX,SAASC;AAAA,MACT,cAAcC;AAAA,MACd,YAAYC;AAAA,IAClB;AAEI,aAASJ,EAAMjC,GAAGC,GAAG;AACnB,MAAIF,EAAQC,GAAGC,CAAC,KAAGiB,EAAa,MAAMlB,GAAGC,CAAC;AAAA,IAC5C;AAEA,aAASqC,IAAgB;AAGvB,eAFIC,IAAU,GAELC,IAAI,GAAGC,IAAInB,EAAQ,QAAQkB,IAAIC,GAAG,EAAED;AAC3C,iBAASjB,IAAOD,EAAQkB,CAAC,GAAGE,IAAI,GAAGC,IAAIpB,EAAK,QAAQU,IAAQV,EAAK,CAAC,GAAGqB,GAAIpC,GAAIqC,IAAKZ,EAAM,CAAC,GAAGa,IAAKb,EAAM,CAAC,GAAGS,IAAIC,GAAG,EAAED;AAClH,UAAAE,IAAKC,GAAIrC,IAAKsC,GAAIb,IAAQV,EAAKmB,CAAC,GAAGG,IAAKZ,EAAM,CAAC,GAAGa,IAAKb,EAAM,CAAC,GAC1DzB,KAAMV,IAAUgD,IAAKhD,MAAO+C,IAAKD,MAAO9C,IAAKU,MAAOsC,IAAKtC,MAAOb,IAAKiD,MAAK,EAAEL,IACrEO,KAAMhD,MAAO+C,IAAKD,MAAO9C,IAAKU,MAAOsC,IAAKtC,MAAOb,IAAKiD,MAAK,EAAEL;AAI5E,aAAOA;AAAA,IACT;AAGA,aAASH,IAAe;AACtB,MAAAlB,IAAeC,GAAcE,IAAW,CAAA,GAAIC,IAAU,CAAA,GAAIS,IAAQ;AAAA,IACpE;AAEA,aAASM,IAAa;AACpB,UAAIU,IAAcT,EAAa,GAC3BU,IAAcjB,KAASgB,GACvBhD,KAAWsB,IAAW4B,EAAM5B,CAAQ,GAAG;AAC3C,OAAI2B,KAAejD,OACjBO,EAAO,aAAY,GACf0C,MACF1C,EAAO,UAAS,GAChBJ,EAAY,MAAM,MAAM,GAAGI,CAAM,GACjCA,EAAO,QAAO,IAEZP,KACFmD,EAAW7B,GAAUP,GAAqBiC,GAAa7C,GAAaI,CAAM,GAE5EA,EAAO,WAAU,IAEnBY,IAAeZ,GAAQe,IAAWC,IAAUC,IAAO;AAAA,IACrD;AAEA,aAASW,IAAY;AACnB,MAAAF,EAAW,QAAQmB,GACf7B,KAASA,EAAQ,KAAKC,IAAO,CAAA,CAAE,GACnCO,IAAQ,IACRD,IAAK,IACLF,IAAKC,IAAK;AAAA,IACZ;AAKA,aAASO,IAAU;AACjB,MAAId,MACF8B,EAAU3B,GAAKC,CAAG,GACdC,KAAOG,KAAIV,EAAa,OAAM,GAClCE,EAAS,KAAKF,EAAa,QAAQ,IAErCa,EAAW,QAAQC,GACfJ,KAAIX,EAAa,QAAO;AAAA,IAC9B;AAEA,aAASiC,EAAUnD,GAAGC,GAAG;AACvB,UAAImD,IAAIrD,EAAQC,GAAGC,CAAC;AAEpB,UADIqB,KAASC,EAAK,KAAK,CAACvB,GAAGC,CAAC,CAAC,GACzB6B;AACF,QAAAN,IAAMxB,GAAGyB,IAAMxB,GAAGyB,IAAM0B,GACxBtB,IAAQ,IACJsB,MACFlC,EAAa,UAAS,GACtBA,EAAa,MAAMlB,GAAGC,CAAC;AAAA,eAGrBmD,KAAKvB,EAAI,CAAAX,EAAa,MAAMlB,GAAGC,CAAC;AAAA,WAC/B;AACH,YAAIM,IAAI,CAACoB,IAAK,KAAK,IAAIlC,GAAS,KAAK,IAAID,GAASmC,CAAE,CAAC,GAAGC,IAAK,KAAK,IAAInC,GAAS,KAAK,IAAID,GAASoC,CAAE,CAAC,CAAC,GACjGb,IAAI,CAACf,IAAI,KAAK,IAAIP,GAAS,KAAK,IAAID,GAASQ,CAAC,CAAC,GAAGC,IAAI,KAAK,IAAIR,GAAS,KAAK,IAAID,GAASS,CAAC,CAAC,CAAC;AACjG,QAAIoD,EAAS9C,GAAGQ,GAAGpB,GAAIC,GAAIC,GAAIC,CAAE,KAC1B+B,MACHX,EAAa,UAAS,GACtBA,EAAa,MAAMX,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,IAE/BW,EAAa,MAAMH,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,GACxBqC,KAAGlC,EAAa,QAAO,GAC5Ba,IAAQ,MACCqB,MACTlC,EAAa,UAAS,GACtBA,EAAa,MAAMlB,GAAGC,CAAC,GACvB8B,IAAQ;AAAA,MAEZ;AAEF,MAAAJ,IAAK3B,GAAG4B,IAAK3B,GAAG4B,IAAKuB;AAAA,IACvB;AAEA,WAAOpB;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/clip/rejoin.js

@@ -0,0 +1,57 @@
+import a from "../pointEqual.js";
+import { epsilon as A } from "../math.js";
+function g(f, v, p, n) {
+  this.x = f, this.z = v, this.o = p, this.e = n, this.v = !1, this.n = this.p = null;
+}
+function D(f, v, p, n, o) {
+  var z = [], w = [], l, d;
+  if (f.forEach(function(t) {
+    if (!((k = t.length - 1) <= 0)) {
+      var k, x = t[0], E = t[k], s;
+      if (a(x, E)) {
+        if (!x[2] && !E[2]) {
+          for (o.lineStart(), l = 0; l < k; ++l) o.point((x = t[l])[0], x[1]);
+          o.lineEnd();
+          return;
+        }
+        E[0] += 2 * A;
+      }
+      z.push(s = new g(x, t, null, !0)), w.push(s.o = new g(x, null, s, !1)), z.push(s = new g(E, t, null, !1)), w.push(s.o = new g(E, null, s, !0));
+    }
+  }), !!z.length) {
+    for (w.sort(v), R(z), R(w), l = 0, d = w.length; l < d; ++l)
+      w[l].e = p = !p;
+    for (var q = z[0], h, e; ; ) {
+      for (var i = q, u = !0; i.v; ) if ((i = i.n) === q) return;
+      h = i.z, o.lineStart();
+      do {
+        if (i.v = i.o.v = !0, i.e) {
+          if (u)
+            for (l = 0, d = h.length; l < d; ++l) o.point((e = h[l])[0], e[1]);
+          else
+            n(i.x, i.n.x, 1, o);
+          i = i.n;
+        } else {
+          if (u)
+            for (h = i.p.z, l = h.length - 1; l >= 0; --l) o.point((e = h[l])[0], e[1]);
+          else
+            n(i.x, i.p.x, -1, o);
+          i = i.p;
+        }
+        i = i.o, h = i.z, u = !u;
+      } while (!i.v);
+      o.lineEnd();
+    }
+  }
+}
+function R(f) {
+  if (v = f.length) {
+    for (var v, p = 0, n = f[0], o; ++p < v; )
+      n.n = o = f[p], o.p = n, n = o;
+    n.n = o = f[0], o.p = n;
+  }
+}
+export {
+  D as default
+};
+//# sourceMappingURL=rejoin.js.map

package/dist/node_modules/d3-geo/src/clip/rejoin.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rejoin.js","sources":["../../../../../node_modules/d3-geo/src/clip/rejoin.js"],"sourcesContent":["import pointEqual from \"../pointEqual.js\";\nimport {epsilon} from \"../math.js\";\n\nfunction Intersection(point, points, other, entry) {\n  this.x = point;\n  this.z = points;\n  this.o = other; // another intersection\n  this.e = entry; // is an entry?\n  this.v = false; // visited\n  this.n = this.p = null; // next & previous\n}\n\n// A generalized polygon clipping algorithm: given a polygon that has been cut\n// into its visible line segments, and rejoins the segments by interpolating\n// along the clip edge.\nexport default function(segments, compareIntersection, startInside, interpolate, stream) {\n  var subject = [],\n      clip = [],\n      i,\n      n;\n\n  segments.forEach(function(segment) {\n    if ((n = segment.length - 1) <= 0) return;\n    var n, p0 = segment[0], p1 = segment[n], x;\n\n    if (pointEqual(p0, p1)) {\n      if (!p0[2] && !p1[2]) {\n        stream.lineStart();\n        for (i = 0; i < n; ++i) stream.point((p0 = segment[i])[0], p0[1]);\n        stream.lineEnd();\n        return;\n      }\n      // handle degenerate cases by moving the point\n      p1[0] += 2 * epsilon;\n    }\n\n    subject.push(x = new Intersection(p0, segment, null, true));\n    clip.push(x.o = new Intersection(p0, null, x, false));\n    subject.push(x = new Intersection(p1, segment, null, false));\n    clip.push(x.o = new Intersection(p1, null, x, true));\n  });\n\n  if (!subject.length) return;\n\n  clip.sort(compareIntersection);\n  link(subject);\n  link(clip);\n\n  for (i = 0, n = clip.length; i < n; ++i) {\n    clip[i].e = startInside = !startInside;\n  }\n\n  var start = subject[0],\n      points,\n      point;\n\n  while (1) {\n    // Find first unvisited intersection.\n    var current = start,\n        isSubject = true;\n    while (current.v) if ((current = current.n) === start) return;\n    points = current.z;\n    stream.lineStart();\n    do {\n      current.v = current.o.v = true;\n      if (current.e) {\n        if (isSubject) {\n          for (i = 0, n = points.length; i < n; ++i) stream.point((point = points[i])[0], point[1]);\n        } else {\n          interpolate(current.x, current.n.x, 1, stream);\n        }\n        current = current.n;\n      } else {\n        if (isSubject) {\n          points = current.p.z;\n          for (i = points.length - 1; i >= 0; --i) stream.point((point = points[i])[0], point[1]);\n        } else {\n          interpolate(current.x, current.p.x, -1, stream);\n        }\n        current = current.p;\n      }\n      current = current.o;\n      points = current.z;\n      isSubject = !isSubject;\n    } while (!current.v);\n    stream.lineEnd();\n  }\n}\n\nfunction link(array) {\n  if (!(n = array.length)) return;\n  var n,\n      i = 0,\n      a = array[0],\n      b;\n  while (++i < n) {\n    a.n = b = array[i];\n    b.p = a;\n    a = b;\n  }\n  a.n = b = array[0];\n  b.p = a;\n}\n"],"names":["Intersection","point","points","other","entry","clipRejoin","segments","compareIntersection","startInside","interpolate","stream","subject","clip","i","n","segment","p0","p1","x","pointEqual","epsilon","link","start","current","isSubject","array","a","b"],"mappings":";;AAGA,SAASA,EAAaC,GAAOC,GAAQC,GAAOC,GAAO;AACjD,OAAK,IAAIH,GACT,KAAK,IAAIC,GACT,KAAK,IAAIC,GACT,KAAK,IAAIC,GACT,KAAK,IAAI,IACT,KAAK,IAAI,KAAK,IAAI;AACpB;AAKe,SAAAC,EAASC,GAAUC,GAAqBC,GAAaC,GAAaC,GAAQ;AACvF,MAAIC,IAAU,CAAA,GACVC,IAAO,CAAA,GACPC,GACAC;AAuBJ,MArBAR,EAAS,QAAQ,SAASS,GAAS;AACjC,QAAK,GAAAD,IAAIC,EAAQ,SAAS,MAAM,IAChC;AAAA,UAAID,GAAGE,IAAKD,EAAQ,CAAC,GAAGE,IAAKF,EAAQD,CAAC,GAAGI;AAEzC,UAAIC,EAAWH,GAAIC,CAAE,GAAG;AACtB,YAAI,CAACD,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC,GAAG;AAEpB,eADAP,EAAO,UAAS,GACXG,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAH,EAAO,OAAOM,IAAKD,EAAQF,CAAC,GAAG,CAAC,GAAGG,EAAG,CAAC,CAAC;AAChE,UAAAN,EAAO,QAAO;AACd;AAAA,QACF;AAEA,QAAAO,EAAG,CAAC,KAAK,IAAIG;AAAA,MACf;AAEA,MAAAT,EAAQ,KAAKO,IAAI,IAAIlB,EAAagB,GAAID,GAAS,MAAM,EAAI,CAAC,GAC1DH,EAAK,KAAKM,EAAE,IAAI,IAAIlB,EAAagB,GAAI,MAAME,GAAG,EAAK,CAAC,GACpDP,EAAQ,KAAKO,IAAI,IAAIlB,EAAaiB,GAAIF,GAAS,MAAM,EAAK,CAAC,GAC3DH,EAAK,KAAKM,EAAE,IAAI,IAAIlB,EAAaiB,GAAI,MAAMC,GAAG,EAAI,CAAC;AAAA;AAAA,EACrD,CAAC,GAEG,EAACP,EAAQ,QAMb;AAAA,SAJAC,EAAK,KAAKL,CAAmB,GAC7Bc,EAAKV,CAAO,GACZU,EAAKT,CAAI,GAEJC,IAAI,GAAGC,IAAIF,EAAK,QAAQC,IAAIC,GAAG,EAAED;AACpC,MAAAD,EAAKC,CAAC,EAAE,IAAIL,IAAc,CAACA;AAO7B,aAJIc,IAAQX,EAAQ,CAAC,GACjBT,GACAD,OAEM;AAIR,eAFIsB,IAAUD,GACVE,IAAY,IACTD,EAAQ,IAAG,MAAKA,IAAUA,EAAQ,OAAOD,EAAO;AACvD,MAAApB,IAASqB,EAAQ,GACjBb,EAAO,UAAS;AAChB,SAAG;AAED,YADAa,EAAQ,IAAIA,EAAQ,EAAE,IAAI,IACtBA,EAAQ,GAAG;AACb,cAAIC;AACF,iBAAKX,IAAI,GAAGC,IAAIZ,EAAO,QAAQW,IAAIC,GAAG,EAAED,EAAG,CAAAH,EAAO,OAAOT,IAAQC,EAAOW,CAAC,GAAG,CAAC,GAAGZ,EAAM,CAAC,CAAC;AAAA;AAExF,YAAAQ,EAAYc,EAAQ,GAAGA,EAAQ,EAAE,GAAG,GAAGb,CAAM;AAE/C,UAAAa,IAAUA,EAAQ;AAAA,QACpB,OAAO;AACL,cAAIC;AAEF,iBADAtB,IAASqB,EAAQ,EAAE,GACdV,IAAIX,EAAO,SAAS,GAAGW,KAAK,GAAG,EAAEA,EAAG,CAAAH,EAAO,OAAOT,IAAQC,EAAOW,CAAC,GAAG,CAAC,GAAGZ,EAAM,CAAC,CAAC;AAAA;AAEtF,YAAAQ,EAAYc,EAAQ,GAAGA,EAAQ,EAAE,GAAG,IAAIb,CAAM;AAEhD,UAAAa,IAAUA,EAAQ;AAAA,QACpB;AACA,QAAAA,IAAUA,EAAQ,GAClBrB,IAASqB,EAAQ,GACjBC,IAAY,CAACA;AAAA,MACf,SAAS,CAACD,EAAQ;AAClB,MAAAb,EAAO,QAAO;AAAA,IAChB;AAAA;AACF;AAEA,SAASW,EAAKI,GAAO;AACnB,MAAMX,IAAIW,EAAM,QAKhB;AAAA,aAJIX,GACAD,IAAI,GACJa,IAAID,EAAM,CAAC,GACXE,GACG,EAAEd,IAAIC;AACX,MAAAY,EAAE,IAAIC,IAAIF,EAAMZ,CAAC,GACjBc,EAAE,IAAID,GACNA,IAAIC;AAEN,IAAAD,EAAE,IAAIC,IAAIF,EAAM,CAAC,GACjBE,EAAE,IAAID;AAAA;AACR;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,12 @@
+function o(t, e) {
+  function i(n, r) {
+    return n = t(n, r), e(n[0], n[1]);
+  }
+  return t.invert && e.invert && (i.invert = function(n, r) {
+    return n = e.invert(n, r), n && t.invert(n[0], n[1]);
+  }), i;
+}
+export {
+  o as default
+};
+//# sourceMappingURL=compose.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"compose.js","sources":["../../../../node_modules/d3-geo/src/compose.js"],"sourcesContent":["export default function(a, b) {\n\n  function compose(x, y) {\n    return x = a(x, y), b(x[0], x[1]);\n  }\n\n  if (a.invert && b.invert) compose.invert = function(x, y) {\n    return x = b.invert(x, y), x && a.invert(x[0], x[1]);\n  };\n\n  return compose;\n}\n"],"names":["compose","a","b","x","y"],"mappings":"AAAe,SAAAA,EAASC,GAAGC,GAAG;AAE5B,WAASF,EAAQG,GAAGC,GAAG;AACrB,WAAOD,IAAIF,EAAEE,GAAGC,CAAC,GAAGF,EAAEC,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC;AAAA,EAClC;AAEA,SAAIF,EAAE,UAAUC,EAAE,WAAQF,EAAQ,SAAS,SAASG,GAAGC,GAAG;AACxD,WAAOD,IAAID,EAAE,OAAOC,GAAGC,CAAC,GAAGD,KAAKF,EAAE,OAAOE,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC;AAAA,EACrD,IAEOH;AACT;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,68 @@
+import { epsilon as s, ceil as d, abs as Y } from "./math.js";
+import x from "../../d3-array/src/range.js";
+function D(u, r, e) {
+  var i = x(u, r - s, e).concat(r);
+  return function(o) {
+    return i.map(function(c) {
+      return [o, c];
+    });
+  };
+}
+function L(u, r, e) {
+  var i = x(u, r - s, e).concat(r);
+  return function(o) {
+    return i.map(function(c) {
+      return [c, o];
+    });
+  };
+}
+function S() {
+  var u, r, e, i, o, c, a, f, l = 10, M = l, p = 90, g = 360, j, v, y, h, m = 2.5;
+  function t() {
+    return { type: "MultiLineString", coordinates: X() };
+  }
+  function X() {
+    return x(d(i / p) * p, e, p).map(y).concat(x(d(f / g) * g, a, g).map(h)).concat(x(d(r / l) * l, u, l).filter(function(n) {
+      return Y(n % p) > s;
+    }).map(j)).concat(x(d(c / M) * M, o, M).filter(function(n) {
+      return Y(n % g) > s;
+    }).map(v));
+  }
+  return t.lines = function() {
+    return X().map(function(n) {
+      return { type: "LineString", coordinates: n };
+    });
+  }, t.outline = function() {
+    return {
+      type: "Polygon",
+      coordinates: [
+        y(i).concat(
+          h(a).slice(1),
+          y(e).reverse().slice(1),
+          h(f).reverse().slice(1)
+        )
+      ]
+    };
+  }, t.extent = function(n) {
+    return arguments.length ? t.extentMajor(n).extentMinor(n) : t.extentMinor();
+  }, t.extentMajor = function(n) {
+    return arguments.length ? (i = +n[0][0], e = +n[1][0], f = +n[0][1], a = +n[1][1], i > e && (n = i, i = e, e = n), f > a && (n = f, f = a, a = n), t.precision(m)) : [[i, f], [e, a]];
+  }, t.extentMinor = function(n) {
+    return arguments.length ? (r = +n[0][0], u = +n[1][0], c = +n[0][1], o = +n[1][1], r > u && (n = r, r = u, u = n), c > o && (n = c, c = o, o = n), t.precision(m)) : [[r, c], [u, o]];
+  }, t.step = function(n) {
+    return arguments.length ? t.stepMajor(n).stepMinor(n) : t.stepMinor();
+  }, t.stepMajor = function(n) {
+    return arguments.length ? (p = +n[0], g = +n[1], t) : [p, g];
+  }, t.stepMinor = function(n) {
+    return arguments.length ? (l = +n[0], M = +n[1], t) : [l, M];
+  }, t.precision = function(n) {
+    return arguments.length ? (m = +n, j = D(c, o, 90), v = L(r, u, m), y = D(f, a, 90), h = L(i, e, m), t) : m;
+  }, t.extentMajor([[-180, -90 + s], [180, 90 - s]]).extentMinor([[-180, -80 - s], [180, 80 + s]]);
+}
+function k() {
+  return S()();
+}
+export {
+  k as graticule10
+};
+//# sourceMappingURL=graticule.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graticule.js","sources":["../../../../node_modules/d3-geo/src/graticule.js"],"sourcesContent":["import {range} from \"d3-array\";\nimport {abs, ceil, epsilon} from \"./math.js\";\n\nfunction graticuleX(y0, y1, dy) {\n  var y = range(y0, y1 - epsilon, dy).concat(y1);\n  return function(x) { return y.map(function(y) { return [x, y]; }); };\n}\n\nfunction graticuleY(x0, x1, dx) {\n  var x = range(x0, x1 - epsilon, dx).concat(x1);\n  return function(y) { return x.map(function(x) { return [x, y]; }); };\n}\n\nexport default function graticule() {\n  var x1, x0, X1, X0,\n      y1, y0, Y1, Y0,\n      dx = 10, dy = dx, DX = 90, DY = 360,\n      x, y, X, Y,\n      precision = 2.5;\n\n  function graticule() {\n    return {type: \"MultiLineString\", coordinates: lines()};\n  }\n\n  function lines() {\n    return range(ceil(X0 / DX) * DX, X1, DX).map(X)\n        .concat(range(ceil(Y0 / DY) * DY, Y1, DY).map(Y))\n        .concat(range(ceil(x0 / dx) * dx, x1, dx).filter(function(x) { return abs(x % DX) > epsilon; }).map(x))\n        .concat(range(ceil(y0 / dy) * dy, y1, dy).filter(function(y) { return abs(y % DY) > epsilon; }).map(y));\n  }\n\n  graticule.lines = function() {\n    return lines().map(function(coordinates) { return {type: \"LineString\", coordinates: coordinates}; });\n  };\n\n  graticule.outline = function() {\n    return {\n      type: \"Polygon\",\n      coordinates: [\n        X(X0).concat(\n        Y(Y1).slice(1),\n        X(X1).reverse().slice(1),\n        Y(Y0).reverse().slice(1))\n      ]\n    };\n  };\n\n  graticule.extent = function(_) {\n    if (!arguments.length) return graticule.extentMinor();\n    return graticule.extentMajor(_).extentMinor(_);\n  };\n\n  graticule.extentMajor = function(_) {\n    if (!arguments.length) return [[X0, Y0], [X1, Y1]];\n    X0 = +_[0][0], X1 = +_[1][0];\n    Y0 = +_[0][1], Y1 = +_[1][1];\n    if (X0 > X1) _ = X0, X0 = X1, X1 = _;\n    if (Y0 > Y1) _ = Y0, Y0 = Y1, Y1 = _;\n    return graticule.precision(precision);\n  };\n\n  graticule.extentMinor = function(_) {\n    if (!arguments.length) return [[x0, y0], [x1, y1]];\n    x0 = +_[0][0], x1 = +_[1][0];\n    y0 = +_[0][1], y1 = +_[1][1];\n    if (x0 > x1) _ = x0, x0 = x1, x1 = _;\n    if (y0 > y1) _ = y0, y0 = y1, y1 = _;\n    return graticule.precision(precision);\n  };\n\n  graticule.step = function(_) {\n    if (!arguments.length) return graticule.stepMinor();\n    return graticule.stepMajor(_).stepMinor(_);\n  };\n\n  graticule.stepMajor = function(_) {\n    if (!arguments.length) return [DX, DY];\n    DX = +_[0], DY = +_[1];\n    return graticule;\n  };\n\n  graticule.stepMinor = function(_) {\n    if (!arguments.length) return [dx, dy];\n    dx = +_[0], dy = +_[1];\n    return graticule;\n  };\n\n  graticule.precision = function(_) {\n    if (!arguments.length) return precision;\n    precision = +_;\n    x = graticuleX(y0, y1, 90);\n    y = graticuleY(x0, x1, precision);\n    X = graticuleX(Y0, Y1, 90);\n    Y = graticuleY(X0, X1, precision);\n    return graticule;\n  };\n\n  return graticule\n      .extentMajor([[-180, -90 + epsilon], [180, 90 - epsilon]])\n      .extentMinor([[-180, -80 - epsilon], [180, 80 + epsilon]]);\n}\n\nexport function graticule10() {\n  return graticule()();\n}\n"],"names":["graticuleX","y0","y1","dy","y","range","epsilon","x","graticuleY","x0","x1","dx","graticule","X1","X0","Y1","Y0","DX","DY","X","Y","precision","lines","ceil","abs","coordinates","_","graticule10"],"mappings":";;AAGA,SAASA,EAAWC,GAAIC,GAAIC,GAAI;AAC9B,MAAIC,IAAIC,EAAMJ,GAAIC,IAAKI,GAASH,CAAE,EAAE,OAAOD,CAAE;AAC7C,SAAO,SAASK,GAAG;AAAE,WAAOH,EAAE,IAAI,SAASA,GAAG;AAAE,aAAO,CAACG,GAAGH,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AACrE;AAEA,SAASI,EAAWC,GAAIC,GAAIC,GAAI;AAC9B,MAAIJ,IAAIF,EAAMI,GAAIC,IAAKJ,GAASK,CAAE,EAAE,OAAOD,CAAE;AAC7C,SAAO,SAASN,GAAG;AAAE,WAAOG,EAAE,IAAI,SAASA,GAAG;AAAE,aAAO,CAACA,GAAGH,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AACrE;AAEe,SAASQ,IAAY;AAClC,MAAIF,GAAID,GAAII,GAAIC,GACZZ,GAAID,GAAIc,GAAIC,GACZL,IAAK,IAAIR,IAAKQ,GAAIM,IAAK,IAAIC,IAAK,KAChCX,GAAGH,GAAGe,GAAGC,GACTC,IAAY;AAEhB,WAAST,IAAY;AACnB,WAAO,EAAC,MAAM,mBAAmB,aAAaU,EAAK,EAAE;AAAA,EACvD;AAEA,WAASA,IAAQ;AACf,WAAOjB,EAAMkB,EAAKT,IAAKG,CAAE,IAAIA,GAAIJ,GAAII,CAAE,EAAE,IAAIE,CAAC,EACzC,OAAOd,EAAMkB,EAAKP,IAAKE,CAAE,IAAIA,GAAIH,GAAIG,CAAE,EAAE,IAAIE,CAAC,CAAC,EAC/C,OAAOf,EAAMkB,EAAKd,IAAKE,CAAE,IAAIA,GAAID,GAAIC,CAAE,EAAE,OAAO,SAASJ,GAAG;AAAE,aAAOiB,EAAIjB,IAAIU,CAAE,IAAIX;AAAA,IAAS,CAAC,EAAE,IAAIC,CAAC,CAAC,EACrG,OAAOF,EAAMkB,EAAKtB,IAAKE,CAAE,IAAIA,GAAID,GAAIC,CAAE,EAAE,OAAO,SAASC,GAAG;AAAE,aAAOoB,EAAIpB,IAAIc,CAAE,IAAIZ;AAAA,IAAS,CAAC,EAAE,IAAIF,CAAC,CAAC;AAAA,EAC5G;AAEA,SAAAQ,EAAU,QAAQ,WAAW;AAC3B,WAAOU,EAAK,EAAG,IAAI,SAASG,GAAa;AAAE,aAAO,EAAC,MAAM,cAAc,aAAaA,EAAW;AAAA,IAAG,CAAC;AAAA,EACrG,GAEAb,EAAU,UAAU,WAAW;AAC7B,WAAO;AAAA,MACL,MAAM;AAAA,MACN,aAAa;AAAA,QACXO,EAAEL,CAAE,EAAE;AAAA,UACNM,EAAEL,CAAE,EAAE,MAAM,CAAC;AAAA,UACbI,EAAEN,CAAE,EAAE,QAAO,EAAG,MAAM,CAAC;AAAA,UACvBO,EAAEJ,CAAE,EAAE,QAAO,EAAG,MAAM,CAAC;AAAA,QAAC;AAAA,MAChC;AAAA,IACA;AAAA,EACE,GAEAJ,EAAU,SAAS,SAASc,GAAG;AAC7B,WAAK,UAAU,SACRd,EAAU,YAAYc,CAAC,EAAE,YAAYA,CAAC,IADfd,EAAU,YAAW;AAAA,EAErD,GAEAA,EAAU,cAAc,SAASc,GAAG;AAClC,WAAK,UAAU,UACfZ,IAAK,CAACY,EAAE,CAAC,EAAE,CAAC,GAAGb,IAAK,CAACa,EAAE,CAAC,EAAE,CAAC,GAC3BV,IAAK,CAACU,EAAE,CAAC,EAAE,CAAC,GAAGX,IAAK,CAACW,EAAE,CAAC,EAAE,CAAC,GACvBZ,IAAKD,MAAIa,IAAIZ,GAAIA,IAAKD,GAAIA,IAAKa,IAC/BV,IAAKD,MAAIW,IAAIV,GAAIA,IAAKD,GAAIA,IAAKW,IAC5Bd,EAAU,UAAUS,CAAS,KALN,CAAC,CAACP,GAAIE,CAAE,GAAG,CAACH,GAAIE,CAAE,CAAC;AAAA,EAMnD,GAEAH,EAAU,cAAc,SAASc,GAAG;AAClC,WAAK,UAAU,UACfjB,IAAK,CAACiB,EAAE,CAAC,EAAE,CAAC,GAAGhB,IAAK,CAACgB,EAAE,CAAC,EAAE,CAAC,GAC3BzB,IAAK,CAACyB,EAAE,CAAC,EAAE,CAAC,GAAGxB,IAAK,CAACwB,EAAE,CAAC,EAAE,CAAC,GACvBjB,IAAKC,MAAIgB,IAAIjB,GAAIA,IAAKC,GAAIA,IAAKgB,IAC/BzB,IAAKC,MAAIwB,IAAIzB,GAAIA,IAAKC,GAAIA,IAAKwB,IAC5Bd,EAAU,UAAUS,CAAS,KALN,CAAC,CAACZ,GAAIR,CAAE,GAAG,CAACS,GAAIR,CAAE,CAAC;AAAA,EAMnD,GAEAU,EAAU,OAAO,SAASc,GAAG;AAC3B,WAAK,UAAU,SACRd,EAAU,UAAUc,CAAC,EAAE,UAAUA,CAAC,IADXd,EAAU,UAAS;AAAA,EAEnD,GAEAA,EAAU,YAAY,SAASc,GAAG;AAChC,WAAK,UAAU,UACfT,IAAK,CAACS,EAAE,CAAC,GAAGR,IAAK,CAACQ,EAAE,CAAC,GACdd,KAFuB,CAACK,GAAIC,CAAE;AAAA,EAGvC,GAEAN,EAAU,YAAY,SAASc,GAAG;AAChC,WAAK,UAAU,UACff,IAAK,CAACe,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GACdd,KAFuB,CAACD,GAAIR,CAAE;AAAA,EAGvC,GAEAS,EAAU,YAAY,SAASc,GAAG;AAChC,WAAK,UAAU,UACfL,IAAY,CAACK,GACbnB,IAAIP,EAAWC,GAAIC,GAAI,EAAE,GACzBE,IAAII,EAAWC,GAAIC,GAAIW,CAAS,GAChCF,IAAInB,EAAWgB,GAAID,GAAI,EAAE,GACzBK,IAAIZ,EAAWM,GAAID,GAAIQ,CAAS,GACzBT,KANuBS;AAAA,EAOhC,GAEOT,EACF,YAAY,CAAC,CAAC,MAAM,MAAMN,CAAO,GAAG,CAAC,KAAK,KAAKA,CAAO,CAAC,CAAC,EACxD,YAAY,CAAC,CAAC,MAAM,MAAMA,CAAO,GAAG,CAAC,KAAK,KAAKA,CAAO,CAAC,CAAC;AAC/D;AAEO,SAASqB,IAAc;AAC5B,SAAOf,EAAS,EAAE;AACpB;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,5 @@
+const e = (t) => t;
+export {
+  e as default
+};
+//# sourceMappingURL=identity.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"identity.js","sources":["../../../../node_modules/d3-geo/src/identity.js"],"sourcesContent":["export default x => x;\n"],"names":["identity","x"],"mappings":"AAAA,MAAAA,IAAe,CAAAC,MAAKA;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,34 @@
+var n = 1e-6, v = 1e-12, r = Math.PI, t = r / 2, s = r / 4, i = r * 2, e = 180 / r, h = r / 180, M = Math.abs, o = Math.atan, c = Math.atan2, p = Math.cos, u = Math.ceil, l = Math.exp, g = Math.log, f = Math.pow, q = Math.sin, P = Math.sign || function(a) {
+  return a > 0 ? 1 : a < 0 ? -1 : 0;
+}, b = Math.sqrt, d = Math.tan;
+function w(a) {
+  return a > 1 ? 0 : a < -1 ? r : Math.acos(a);
+}
+function I(a) {
+  return a > 1 ? t : a < -1 ? -t : Math.asin(a);
+}
+export {
+  M as abs,
+  w as acos,
+  I as asin,
+  o as atan,
+  c as atan2,
+  u as ceil,
+  p as cos,
+  e as degrees,
+  n as epsilon,
+  v as epsilon2,
+  l as exp,
+  t as halfPi,
+  g as log,
+  r as pi,
+  f as pow,
+  s as quarterPi,
+  h as radians,
+  P as sign,
+  q as sin,
+  b as sqrt,
+  d as tan,
+  i as tau
+};
+//# sourceMappingURL=math.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"math.js","sources":["../../../../node_modules/d3-geo/src/math.js"],"sourcesContent":["export var epsilon = 1e-6;\nexport var epsilon2 = 1e-12;\nexport var pi = Math.PI;\nexport var halfPi = pi / 2;\nexport var quarterPi = pi / 4;\nexport var tau = pi * 2;\n\nexport var degrees = 180 / pi;\nexport var radians = pi / 180;\n\nexport var abs = Math.abs;\nexport var atan = Math.atan;\nexport var atan2 = Math.atan2;\nexport var cos = Math.cos;\nexport var ceil = Math.ceil;\nexport var exp = Math.exp;\nexport var floor = Math.floor;\nexport var hypot = Math.hypot;\nexport var log = Math.log;\nexport var pow = Math.pow;\nexport var sin = Math.sin;\nexport var sign = Math.sign || function(x) { return x > 0 ? 1 : x < 0 ? -1 : 0; };\nexport var sqrt = Math.sqrt;\nexport var tan = Math.tan;\n\nexport function acos(x) {\n  return x > 1 ? 0 : x < -1 ? pi : Math.acos(x);\n}\n\nexport function asin(x) {\n  return x > 1 ? halfPi : x < -1 ? -halfPi : Math.asin(x);\n}\n\nexport function haversin(x) {\n  return (x = sin(x / 2)) * x;\n}\n"],"names":["epsilon","epsilon2","pi","halfPi","quarterPi","tau","degrees","radians","abs","atan","atan2","cos","ceil","exp","log","pow","sin","sign","x","sqrt","tan","acos","asin"],"mappings":"AAAU,IAACA,IAAU,MACVC,IAAW,OACXC,IAAK,KAAK,IACVC,IAASD,IAAK,GACdE,IAAYF,IAAK,GACjBG,IAAMH,IAAK,GAEXI,IAAU,MAAMJ,GAChBK,IAAUL,IAAK,KAEfM,IAAM,KAAK,KACXC,IAAO,KAAK,MACZC,IAAQ,KAAK,OACbC,IAAM,KAAK,KACXC,IAAO,KAAK,MACZC,IAAM,KAAK,KAGXC,IAAM,KAAK,KACXC,IAAM,KAAK,KACXC,IAAM,KAAK,KACXC,IAAO,KAAK,QAAQ,SAASC,GAAG;AAAE,SAAOA,IAAI,IAAI,IAAIA,IAAI,IAAI,KAAK;AAAG,GACrEC,IAAO,KAAK,MACZC,IAAM,KAAK;AAEf,SAASC,EAAKH,GAAG;AACtB,SAAOA,IAAI,IAAI,IAAIA,IAAI,KAAKhB,IAAK,KAAK,KAAKgB,CAAC;AAC9C;AAEO,SAASI,EAAKJ,GAAG;AACtB,SAAOA,IAAI,IAAIf,IAASe,IAAI,KAAK,CAACf,IAAS,KAAK,KAAKe,CAAC;AACxD;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,6 @@
+function o() {
+}
+export {
+  o as default
+};
+//# sourceMappingURL=noop.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"noop.js","sources":["../../../../node_modules/d3-geo/src/noop.js"],"sourcesContent":["export default function noop() {}\n"],"names":["noop"],"mappings":"AAAe,SAASA,IAAO;AAAC;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/path/area.js

@@ -0,0 +1,34 @@
+import { abs as m } from "../math.js";
+import r from "../noop.js";
+import { Adder as i } from "../../../d3-array/src/fsum.js";
+var o = new i(), e = new i(), f, p, d, u, n = {
+  point: r,
+  lineStart: r,
+  lineEnd: r,
+  polygonStart: function() {
+    n.lineStart = S, n.lineEnd = g;
+  },
+  polygonEnd: function() {
+    n.lineStart = n.lineEnd = n.point = r, o.add(m(e)), e = new i();
+  },
+  result: function() {
+    var t = o / 2;
+    return o = new i(), t;
+  }
+};
+function S() {
+  n.point = c;
+}
+function c(t, a) {
+  n.point = l, f = d = t, p = u = a;
+}
+function l(t, a) {
+  e.add(u * t - d * a), d = t, u = a;
+}
+function g() {
+  l(f, p);
+}
+export {
+  n as default
+};
+//# sourceMappingURL=area.js.map

package/dist/node_modules/d3-geo/src/path/area.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"area.js","sources":["../../../../../node_modules/d3-geo/src/path/area.js"],"sourcesContent":["import {Adder} from \"d3-array\";\nimport {abs} from \"../math.js\";\nimport noop from \"../noop.js\";\n\nvar areaSum = new Adder(),\n    areaRingSum = new Adder(),\n    x00,\n    y00,\n    x0,\n    y0;\n\nvar areaStream = {\n  point: noop,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: function() {\n    areaStream.lineStart = areaRingStart;\n    areaStream.lineEnd = areaRingEnd;\n  },\n  polygonEnd: function() {\n    areaStream.lineStart = areaStream.lineEnd = areaStream.point = noop;\n    areaSum.add(abs(areaRingSum));\n    areaRingSum = new Adder();\n  },\n  result: function() {\n    var area = areaSum / 2;\n    areaSum = new Adder();\n    return area;\n  }\n};\n\nfunction areaRingStart() {\n  areaStream.point = areaPointFirst;\n}\n\nfunction areaPointFirst(x, y) {\n  areaStream.point = areaPoint;\n  x00 = x0 = x, y00 = y0 = y;\n}\n\nfunction areaPoint(x, y) {\n  areaRingSum.add(y0 * x - x0 * y);\n  x0 = x, y0 = y;\n}\n\nfunction areaRingEnd() {\n  areaPoint(x00, y00);\n}\n\nexport default areaStream;\n"],"names":["areaSum","Adder","areaRingSum","x00","y00","x0","y0","areaStream","noop","areaRingStart","areaRingEnd","abs","area","areaPointFirst","x","y","areaPoint"],"mappings":";;;AAIA,IAAIA,IAAU,IAAIC,EAAK,GACnBC,IAAc,IAAID,EAAK,GACvBE,GACAC,GACAC,GACAC,GAEAC,IAAa;AAAA,EACf,OAAOC;AAAA,EACP,WAAWA;AAAA,EACX,SAASA;AAAA,EACT,cAAc,WAAW;AACvB,IAAAD,EAAW,YAAYE,GACvBF,EAAW,UAAUG;AAAA,EACvB;AAAA,EACA,YAAY,WAAW;AACrB,IAAAH,EAAW,YAAYA,EAAW,UAAUA,EAAW,QAAQC,GAC/DR,EAAQ,IAAIW,EAAIT,CAAW,CAAC,GAC5BA,IAAc,IAAID,EAAK;AAAA,EACzB;AAAA,EACA,QAAQ,WAAW;AACjB,QAAIW,IAAOZ,IAAU;AACrB,WAAAA,IAAU,IAAIC,EAAK,GACZW;AAAA,EACT;AACF;AAEA,SAASH,IAAgB;AACvB,EAAAF,EAAW,QAAQM;AACrB;AAEA,SAASA,EAAeC,GAAGC,GAAG;AAC5B,EAAAR,EAAW,QAAQS,GACnBb,IAAME,IAAKS,GAAGV,IAAME,IAAKS;AAC3B;AAEA,SAASC,EAAUF,GAAGC,GAAG;AACvB,EAAAb,EAAY,IAAII,IAAKQ,IAAIT,IAAKU,CAAC,GAC/BV,IAAKS,GAAGR,IAAKS;AACf;AAEA,SAASL,IAAc;AACrB,EAAAM,EAAUb,GAAKC,CAAG;AACpB;","x_google_ignoreList":[0]}

package/dist/node_modules/d3-geo/src/path/bounds.js

@@ -0,0 +1,19 @@
+import r from "../noop.js";
+var o = 1 / 0, f = o, t = -o, a = t, d = {
+  point: u,
+  lineStart: r,
+  lineEnd: r,
+  polygonStart: r,
+  polygonEnd: r,
+  result: function() {
+    var n = [[o, f], [t, a]];
+    return t = a = -(f = o = 1 / 0), n;
+  }
+};
+function u(n, i) {
+  n < o && (o = n), n > t && (t = n), i < f && (f = i), i > a && (a = i);
+}
+export {
+  d as default
+};
+//# sourceMappingURL=bounds.js.map