@performant-software/geospatial 3.1.25-beta.1 → 3.1.25

package/dist/index.es254.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es254.js","sources":["../../../node_modules/d3-geo/src/cartesian.js"],"sourcesContent":["import {asin, atan2, cos, sin, sqrt} from \"./math\";\n\nexport function spherical(cartesian) {\n  return [atan2(cartesian[1], cartesian[0]), asin(cartesian[2])];\n}\n\nexport function cartesian(spherical) {\n  var lambda = spherical[0], phi = spherical[1], cosPhi = cos(phi);\n  return [cosPhi * cos(lambda), cosPhi * sin(lambda), sin(phi)];\n}\n\nexport function cartesianDot(a, b) {\n  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\n}\n\nexport function cartesianCross(a, b) {\n  return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];\n}\n\n// TODO return a\nexport function cartesianAddInPlace(a, b) {\n  a[0] += b[0], a[1] += b[1], a[2] += b[2];\n}\n\nexport function cartesianScale(vector, k) {\n  return [vector[0] * k, vector[1] * k, vector[2] * k];\n}\n\n// TODO return d\nexport function cartesianNormalizeInPlace(d) {\n  var l = sqrt(d[0] * d[0] + d[1] * d[1] + d[2] * d[2]);\n  d[0] /= l, d[1] /= l, d[2] /= l;\n}\n"],"names":["spherical","cartesian","atan2","asin","lambda","phi","cosPhi","cos","sin","cartesianDot","a","b","cartesianCross","cartesianAddInPlace","cartesianScale","vector","k","cartesianNormalizeInPlace","d","l","sqrt"],"mappings":";AAEO,SAASA,EAAUC,GAAW;AACnC,SAAO,CAACC,EAAMD,EAAU,CAAC,GAAGA,EAAU,CAAC,CAAC,GAAGE,EAAKF,EAAU,CAAC,CAAC,CAAC;AAC/D;AAEO,SAASA,EAAUD,GAAW;AACnC,MAAII,IAASJ,EAAU,CAAC,GAAGK,IAAML,EAAU,CAAC,GAAGM,IAASC,EAAIF,CAAG;AAC/D,SAAO,CAACC,IAASC,EAAIH,CAAM,GAAGE,IAASE,EAAIJ,CAAM,GAAGI,EAAIH,CAAG,CAAC;AAC9D;AAEO,SAASI,EAAaC,GAAGC,GAAG;AACjC,SAAOD,EAAE,CAAC,IAAIC,EAAE,CAAC,IAAID,EAAE,CAAC,IAAIC,EAAE,CAAC,IAAID,EAAE,CAAC,IAAIC,EAAE,CAAC;AAC/C;AAEO,SAASC,EAAeF,GAAGC,GAAG;AACnC,SAAO,CAACD,EAAE,CAAC,IAAIC,EAAE,CAAC,IAAID,EAAE,CAAC,IAAIC,EAAE,CAAC,GAAGD,EAAE,CAAC,IAAIC,EAAE,CAAC,IAAID,EAAE,CAAC,IAAIC,EAAE,CAAC,GAAGD,EAAE,CAAC,IAAIC,EAAE,CAAC,IAAID,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC;AACzF;AAGO,SAASE,EAAoBH,GAAGC,GAAG;AACxC,EAAAD,EAAE,CAAC,KAAKC,EAAE,CAAC,GAAGD,EAAE,CAAC,KAAKC,EAAE,CAAC,GAAGD,EAAE,CAAC,KAAKC,EAAE,CAAC;AACzC;AAEO,SAASG,EAAeC,GAAQC,GAAG;AACxC,SAAO,CAACD,EAAO,CAAC,IAAIC,GAAGD,EAAO,CAAC,IAAIC,GAAGD,EAAO,CAAC,IAAIC,CAAC;AACrD;AAGO,SAASC,EAA0BC,GAAG;AAC3C,MAAIC,IAAIC,EAAKF,EAAE,CAAC,IAAIA,EAAE,CAAC,IAAIA,EAAE,CAAC,IAAIA,EAAE,CAAC,IAAIA,EAAE,CAAC,IAAIA,EAAE,CAAC,CAAC;AACpD,EAAAA,EAAE,CAAC,KAAKC,GAAGD,EAAE,CAAC,KAAKC,GAAGD,EAAE,CAAC,KAAKC;AAChC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es254.js","sources":["../../../node_modules/@turf/center/dist/esm/index.js"],"sourcesContent":["// index.ts\nimport { bbox } from \"@turf/bbox\";\nimport { point } from \"@turf/helpers\";\nfunction center(geojson, options = {}) {\n  const ext = bbox(geojson);\n  const x = (ext[0] + ext[2]) / 2;\n  const y = (ext[1] + ext[3]) / 2;\n  return point([x, y], options.properties, options);\n}\nvar index_default = center;\nexport {\n  center,\n  index_default as default\n};\n//# sourceMappingURL=index.js.map"],"names":["center","geojson","options","ext","bbox","x","y","point"],"mappings":";;AAGA,SAASA,EAAOC,GAASC,IAAU,IAAI;AACrC,QAAMC,IAAMC,EAAKH,CAAO,GAClBI,KAAKF,EAAI,CAAC,IAAIA,EAAI,CAAC,KAAK,GACxBG,KAAKH,EAAI,CAAC,IAAIA,EAAI,CAAC,KAAK;AAC9B,SAAOI,EAAM,CAACF,GAAGC,CAAC,GAAGJ,EAAQ,YAAYA,CAAO;AAClD;","x_google_ignoreList":[0]}

package/dist/index.es255.js

@@ -1,25 +1,8 @@
-var n = 1e-6, r = Math.PI, t = r / 2, s = r / 4, v = r * 2, i = 180 / r, h = r / 180, e = Math.abs, M = Math.atan, o = Math.atan2, c = Math.cos, u = Math.sin, f = Math.sqrt;
-function p(a) {
-  return a > 1 ? 0 : a < -1 ? r : Math.acos(a);
-}
-function q(a) {
-  return a > 1 ? t : a < -1 ? -t : Math.asin(a);
-}
+import { getDefaultExportFromCjs as r } from "./index.es88.js";
+import { __require as t } from "./index.es276.js";
+var s = t();
+const m = /* @__PURE__ */ r(s);
 export {
-  e as abs,
-  p as acos,
-  q as asin,
-  M as atan,
-  o as atan2,
-  c as cos,
-  i as degrees,
-  n as epsilon,
-  t as halfPi,
-  r as pi,
-  s as quarterPi,
-  h as radians,
-  u as sin,
-  f as sqrt,
-  v as tau
+  m as default
 };
 //# sourceMappingURL=index.es255.js.map

package/dist/index.es255.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es255.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 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","pi","halfPi","quarterPi","tau","degrees","radians","abs","atan","atan2","cos","sin","sqrt","acos","x","asin"],"mappings":"AAAO,IAAIA,IAAU,MAEVC,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,KAMXC,IAAM,KAAK,KAEXC,IAAO,KAAK;AAGhB,SAASC,EAAKC,GAAG;AACtB,SAAOA,IAAI,IAAI,IAAIA,IAAI,KAAKb,IAAK,KAAK,KAAKa,CAAC;AAC9C;AAEO,SAASC,EAAKD,GAAG;AACtB,SAAOA,IAAI,IAAIZ,IAASY,IAAI,KAAK,CAACZ,IAAS,KAAK,KAAKY,CAAC;AACxD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es255.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/index.es256.js

@@ -1,78 +1,4 @@
-import { abs as q, epsilon as z } from "./index.es255.js";
-import X from "./index.es257.js";
-import Y from "./index.es258.js";
-import Z from "./index.es259.js";
-import "./index.es201.js";
-import $ from "./index.es260.js";
-var S = 1e9, B = -S;
-function en(c, _, E, u) {
-  function A(i, n) {
-    return c <= i && i <= E && _ <= n && n <= u;
-  }
-  function C(i, n, l, o) {
-    var f = 0, s = 0;
-    if (i == null || (f = d(i, l)) !== (s = d(n, l)) || D(i, n) < 0 ^ l > 0)
-      do
-        o.point(f === 0 || f === 3 ? c : E, f > 1 ? u : _);
-      while ((f = (f + l + 4) % 4) !== s);
-    else
-      o.point(n[0], n[1]);
-  }
-  function d(i, n) {
-    return q(i[0] - c) < z ? n > 0 ? 0 : 3 : q(i[0] - E) < z ? n > 0 ? 2 : 1 : q(i[1] - _) < z ? n > 0 ? 1 : 0 : n > 0 ? 3 : 2;
-  }
-  function O(i, n) {
-    return D(i.x, n.x);
-  }
-  function D(i, n) {
-    var l = d(i, 1), o = d(n, 1);
-    return l !== o ? l - o : 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 = X(), o, f, s, F, G, H, I, P, v, L, w, k = {
-      point: J,
-      lineStart: U,
-      lineEnd: V,
-      polygonStart: R,
-      polygonEnd: T
-    };
-    function J(t, e) {
-      A(t, e) && n.point(t, e);
-    }
-    function Q() {
-      for (var t = 0, e = 0, r = f.length; e < r; ++e)
-        for (var p = f[e], a = 1, W = p.length, g = p[0], M, m, N = g[0], h = g[1]; a < W; ++a)
-          M = N, m = h, g = p[a], N = g[0], h = g[1], m <= u ? h > u && (N - M) * (u - m) > (h - m) * (c - M) && ++t : h <= u && (N - M) * (u - m) < (h - m) * (c - M) && --t;
-      return t;
-    }
-    function R() {
-      n = l, o = [], f = [], w = !0;
-    }
-    function T() {
-      var t = Q(), e = w && t, r = (o = $(o)).length;
-      (e || r) && (i.polygonStart(), e && (i.lineStart(), C(null, null, 1, i), i.lineEnd()), r && Z(o, O, t, C, i), i.polygonEnd()), n = i, o = f = s = null;
-    }
-    function U() {
-      k.point = K, f && f.push(s = []), L = !0, v = !1, I = P = NaN;
-    }
-    function V() {
-      o && (K(F, G), H && v && l.rejoin(), o.push(l.result())), k.point = J, v && n.lineEnd();
-    }
-    function K(t, e) {
-      var r = A(t, e);
-      if (f && s.push([t, e]), L)
-        F = t, G = e, H = r, L = !1, r && (n.lineStart(), n.point(t, e));
-      else if (r && v) n.point(t, e);
-      else {
-        var p = [I = Math.max(B, Math.min(S, I)), P = Math.max(B, Math.min(S, P))], a = [t = Math.max(B, Math.min(S, t)), e = Math.max(B, Math.min(S, e))];
-        Y(p, a, c, _, E, u) ? (v || (n.lineStart(), n.point(p[0], p[1])), n.point(a[0], a[1]), r || n.lineEnd(), w = !1) : r && (n.lineStart(), n.point(t, e), w = !1);
-      }
-      I = t, P = e, v = r;
-    }
-    return k;
-  };
-}
-export {
-  en as clipExtent
-};
+import r from "./index.es318.js";
+r();
+r();
 //# sourceMappingURL=index.es256.js.map

package/dist/index.es256.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es256.js","sources":["../../../node_modules/d3-geo/src/clip/extent.js"],"sourcesContent":["import {abs, epsilon} from \"../math\";\nimport clipBuffer from \"./buffer\";\nimport clipLine from \"./line\";\nimport clipPolygon from \"./polygon\";\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 function clipExtent(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          clipPolygon(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\nexport default function() {\n  var x0 = 0,\n      y0 = 0,\n      x1 = 960,\n      y1 = 500,\n      cache,\n      cacheStream,\n      clip;\n\n  return clip = {\n    stream: function(stream) {\n      return cache && cacheStream === stream ? cache : cache = clipExtent(x0, y0, x1, y1)(cacheStream = stream);\n    },\n    extent: function(_) {\n      return arguments.length ? (x0 = +_[0][0], y0 = +_[0][1], x1 = +_[1][0], y1 = +_[1][1], cache = cacheStream = null, clip) : [[x0, y0], [x1, y1]];\n    }\n  };\n}\n"],"names":["clipMax","clipMin","clipExtent","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","clipPolygon","linePoint","v","clipLine"],"mappings":";;;;;;AAMA,IAAIA,IAAU,KAAKC,IAAU,CAACD;AAKvB,SAASE,GAAWC,GAAIC,GAAIC,GAAIC,GAAI;AAEzC,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,EAAA,GACfC,GACAC,GACAC,GACAC,GAAKC,GAAKC,GACVC,GAAIC,GAAIC,GACRC,GACAC,GAEAC,IAAa;AAAA,MACf,OAAAC;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,cAAAC;AAAA,MACA,YAAAC;AAAA,IAAA;AAGF,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,KACdU,IAAcjB,KAASgB,GACvBhD,KAAWsB,IAAW4B,EAAM5B,CAAQ,GAAG;AAC3C,OAAI2B,KAAejD,OACjBO,EAAO,aAAA,GACH0C,MACF1C,EAAO,UAAA,GACPJ,EAAY,MAAM,MAAM,GAAGI,CAAM,GACjCA,EAAO,QAAA,IAELP,KACFmD,EAAY7B,GAAUP,GAAqBiC,GAAa7C,GAAaI,CAAM,GAE7EA,EAAO,WAAA,IAETY,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,OAAA,GAC5BE,EAAS,KAAKF,EAAa,QAAQ,IAErCa,EAAW,QAAQC,GACfJ,OAAiB,QAAA;AAAA,IACvB;AAEA,aAASsB,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,UAAA,GACbA,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,UAAA,GACbA,EAAa,MAAMX,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,IAE/BW,EAAa,MAAMH,EAAE,CAAC,GAAGA,EAAE,CAAC,CAAC,GACxBqC,KAAGlC,EAAa,QAAA,GACrBa,IAAQ,MACCqB,MACTlC,EAAa,UAAA,GACbA,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]}
+{"version":3,"file":"index.es256.js","sources":["../../../node_modules/d3-geo/src/area.js"],"sourcesContent":["import adder from \"./adder\";\nimport {atan2, cos, quarterPi, radians, sin, tau} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nexport var areaRingSum = adder();\n\nvar areaSum = adder(),\n    lambda00,\n    phi00,\n    lambda0,\n    cosPhi0,\n    sinPhi0;\n\nexport var areaStream = {\n  point: noop,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: function() {\n    areaRingSum.reset();\n    areaStream.lineStart = areaRingStart;\n    areaStream.lineEnd = areaRingEnd;\n  },\n  polygonEnd: function() {\n    var areaRing = +areaRingSum;\n    areaSum.add(areaRing < 0 ? tau + areaRing : areaRing);\n    this.lineStart = this.lineEnd = this.point = noop;\n  },\n  sphere: function() {\n    areaSum.add(tau);\n  }\n};\n\nfunction areaRingStart() {\n  areaStream.point = areaPointFirst;\n}\n\nfunction areaRingEnd() {\n  areaPoint(lambda00, phi00);\n}\n\nfunction areaPointFirst(lambda, phi) {\n  areaStream.point = areaPoint;\n  lambda00 = lambda, phi00 = phi;\n  lambda *= radians, phi *= radians;\n  lambda0 = lambda, cosPhi0 = cos(phi = phi / 2 + quarterPi), sinPhi0 = sin(phi);\n}\n\nfunction areaPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  phi = phi / 2 + quarterPi; // half the angular distance from south pole\n\n  // Spherical excess E for a spherical triangle with vertices: south pole,\n  // previous point, current point.  Uses a formula derived from Cagnoli’s\n  // theorem.  See Todhunter, Spherical Trig. (1871), Sec. 103, Eq. (2).\n  var dLambda = lambda - lambda0,\n      sdLambda = dLambda >= 0 ? 1 : -1,\n      adLambda = sdLambda * dLambda,\n      cosPhi = cos(phi),\n      sinPhi = sin(phi),\n      k = sinPhi0 * sinPhi,\n      u = cosPhi0 * cosPhi + k * cos(adLambda),\n      v = k * sdLambda * sin(adLambda);\n  areaRingSum.add(atan2(v, u));\n\n  // Advance the previous points.\n  lambda0 = lambda, cosPhi0 = cosPhi, sinPhi0 = sinPhi;\n}\n\nexport default function(object) {\n  areaSum.reset();\n  stream(object, areaStream);\n  return areaSum * 2;\n}\n"],"names":["adder"],"mappings":";AAKyBA,EAAA;AAEXA,EAAA;","x_google_ignoreList":[0]}

package/dist/index.es257.js

@@ -1,24 +1,4 @@
-import o from "./index.es271.js";
-function e() {
-  var n = [], t;
-  return {
-    point: function(i, u) {
-      t.push([i, u]);
-    },
-    lineStart: function() {
-      n.push(t = []);
-    },
-    lineEnd: o,
-    rejoin: function() {
-      n.length > 1 && n.push(n.pop().concat(n.shift()));
-    },
-    result: function() {
-      var i = n;
-      return n = [], t = null, i;
-    }
-  };
-}
-export {
-  e as default
-};
+import r from "./index.es318.js";
+import "./index.es256.js";
+r();
 //# sourceMappingURL=index.es257.js.map

package/dist/index.es257.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es257.js","sources":["../../../node_modules/d3-geo/src/clip/buffer.js"],"sourcesContent":["import noop from \"../noop\";\n\nexport default function() {\n  var lines = [],\n      line;\n  return {\n    point: function(x, y) {\n      line.push([x, y]);\n    },\n    lineStart: function() {\n      lines.push(line = []);\n    },\n    lineEnd: noop,\n    rejoin: function() {\n      if (lines.length > 1) lines.push(lines.pop().concat(lines.shift()));\n    },\n    result: function() {\n      var result = lines;\n      lines = [];\n      line = null;\n      return result;\n    }\n  };\n}\n"],"names":["clipBuffer","lines","line","x","y","noop","result"],"mappings":";AAEA,SAAAA,IAA0B;AACxB,MAAIC,IAAQ,CAAA,GACRC;AACJ,SAAO;AAAA,IACL,OAAO,SAASC,GAAGC,GAAG;AACpB,MAAAF,EAAK,KAAK,CAACC,GAAGC,CAAC,CAAC;AAAA,IAClB;AAAA,IACA,WAAW,WAAW;AACpB,MAAAH,EAAM,KAAKC,IAAO,EAAE;AAAA,IACtB;AAAA,IACA,SAASG;AAAA,IACT,QAAQ,WAAW;AACjB,MAAIJ,EAAM,SAAS,KAAGA,EAAM,KAAKA,EAAM,IAAA,EAAM,OAAOA,EAAM,MAAA,CAAO,CAAC;AAAA,IACpE;AAAA,IACA,QAAQ,WAAW;AACjB,UAAIK,IAASL;AACb,aAAAA,IAAQ,CAAA,GACRC,IAAO,MACAI;AAAA,IACT;AAAA,EAAA;AAEJ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es257.js","sources":["../../../node_modules/d3-geo/src/bounds.js"],"sourcesContent":["import adder from \"./adder\";\nimport {areaStream, areaRingSum} from \"./area\";\nimport {cartesian, cartesianCross, cartesianNormalizeInPlace, spherical} from \"./cartesian\";\nimport {abs, degrees, epsilon, radians} from \"./math\";\nimport stream from \"./stream\";\n\nvar lambda0, phi0, lambda1, phi1, // bounds\n    lambda2, // previous lambda-coordinate\n    lambda00, phi00, // first point\n    p0, // previous 3D point\n    deltaSum = adder(),\n    ranges,\n    range;\n\nvar boundsStream = {\n  point: boundsPoint,\n  lineStart: boundsLineStart,\n  lineEnd: boundsLineEnd,\n  polygonStart: function() {\n    boundsStream.point = boundsRingPoint;\n    boundsStream.lineStart = boundsRingStart;\n    boundsStream.lineEnd = boundsRingEnd;\n    deltaSum.reset();\n    areaStream.polygonStart();\n  },\n  polygonEnd: function() {\n    areaStream.polygonEnd();\n    boundsStream.point = boundsPoint;\n    boundsStream.lineStart = boundsLineStart;\n    boundsStream.lineEnd = boundsLineEnd;\n    if (areaRingSum < 0) lambda0 = -(lambda1 = 180), phi0 = -(phi1 = 90);\n    else if (deltaSum > epsilon) phi1 = 90;\n    else if (deltaSum < -epsilon) phi0 = -90;\n    range[0] = lambda0, range[1] = lambda1;\n  }\n};\n\nfunction boundsPoint(lambda, phi) {\n  ranges.push(range = [lambda0 = lambda, lambda1 = lambda]);\n  if (phi < phi0) phi0 = phi;\n  if (phi > phi1) phi1 = phi;\n}\n\nfunction linePoint(lambda, phi) {\n  var p = cartesian([lambda * radians, phi * radians]);\n  if (p0) {\n    var normal = cartesianCross(p0, p),\n        equatorial = [normal[1], -normal[0], 0],\n        inflection = cartesianCross(equatorial, normal);\n    cartesianNormalizeInPlace(inflection);\n    inflection = spherical(inflection);\n    var delta = lambda - lambda2,\n        sign = delta > 0 ? 1 : -1,\n        lambdai = inflection[0] * degrees * sign,\n        phii,\n        antimeridian = abs(delta) > 180;\n    if (antimeridian ^ (sign * lambda2 < lambdai && lambdai < sign * lambda)) {\n      phii = inflection[1] * degrees;\n      if (phii > phi1) phi1 = phii;\n    } else if (lambdai = (lambdai + 360) % 360 - 180, antimeridian ^ (sign * lambda2 < lambdai && lambdai < sign * lambda)) {\n      phii = -inflection[1] * degrees;\n      if (phii < phi0) phi0 = phii;\n    } else {\n      if (phi < phi0) phi0 = phi;\n      if (phi > phi1) phi1 = phi;\n    }\n    if (antimeridian) {\n      if (lambda < lambda2) {\n        if (angle(lambda0, lambda) > angle(lambda0, lambda1)) lambda1 = lambda;\n      } else {\n        if (angle(lambda, lambda1) > angle(lambda0, lambda1)) lambda0 = lambda;\n      }\n    } else {\n      if (lambda1 >= lambda0) {\n        if (lambda < lambda0) lambda0 = lambda;\n        if (lambda > lambda1) lambda1 = lambda;\n      } else {\n        if (lambda > lambda2) {\n          if (angle(lambda0, lambda) > angle(lambda0, lambda1)) lambda1 = lambda;\n        } else {\n          if (angle(lambda, lambda1) > angle(lambda0, lambda1)) lambda0 = lambda;\n        }\n      }\n    }\n  } else {\n    ranges.push(range = [lambda0 = lambda, lambda1 = lambda]);\n  }\n  if (phi < phi0) phi0 = phi;\n  if (phi > phi1) phi1 = phi;\n  p0 = p, lambda2 = lambda;\n}\n\nfunction boundsLineStart() {\n  boundsStream.point = linePoint;\n}\n\nfunction boundsLineEnd() {\n  range[0] = lambda0, range[1] = lambda1;\n  boundsStream.point = boundsPoint;\n  p0 = null;\n}\n\nfunction boundsRingPoint(lambda, phi) {\n  if (p0) {\n    var delta = lambda - lambda2;\n    deltaSum.add(abs(delta) > 180 ? delta + (delta > 0 ? 360 : -360) : delta);\n  } else {\n    lambda00 = lambda, phi00 = phi;\n  }\n  areaStream.point(lambda, phi);\n  linePoint(lambda, phi);\n}\n\nfunction boundsRingStart() {\n  areaStream.lineStart();\n}\n\nfunction boundsRingEnd() {\n  boundsRingPoint(lambda00, phi00);\n  areaStream.lineEnd();\n  if (abs(deltaSum) > epsilon) lambda0 = -(lambda1 = 180);\n  range[0] = lambda0, range[1] = lambda1;\n  p0 = null;\n}\n\n// Finds the left-right distance between two longitudes.\n// This is almost the same as (lambda1 - lambda0 + 360°) % 360°, except that we want\n// the distance between ±180° to be 360°.\nfunction angle(lambda0, lambda1) {\n  return (lambda1 -= lambda0) < 0 ? lambda1 + 360 : lambda1;\n}\n\nfunction rangeCompare(a, b) {\n  return a[0] - b[0];\n}\n\nfunction rangeContains(range, x) {\n  return range[0] <= range[1] ? range[0] <= x && x <= range[1] : x < range[0] || range[1] < x;\n}\n\nexport default function(feature) {\n  var i, n, a, b, merged, deltaMax, delta;\n\n  phi1 = lambda1 = -(lambda0 = phi0 = Infinity);\n  ranges = [];\n  stream(feature, boundsStream);\n\n  // First, sort ranges by their minimum longitudes.\n  if (n = ranges.length) {\n    ranges.sort(rangeCompare);\n\n    // Then, merge any ranges that overlap.\n    for (i = 1, a = ranges[0], merged = [a]; i < n; ++i) {\n      b = ranges[i];\n      if (rangeContains(a, b[0]) || rangeContains(a, b[1])) {\n        if (angle(a[0], b[1]) > angle(a[0], a[1])) a[1] = b[1];\n        if (angle(b[0], a[1]) > angle(a[0], a[1])) a[0] = b[0];\n      } else {\n        merged.push(a = b);\n      }\n    }\n\n    // Finally, find the largest gap between the merged ranges.\n    // The final bounding box will be the inverse of this gap.\n    for (deltaMax = -Infinity, n = merged.length - 1, i = 0, a = merged[n]; i <= n; a = b, ++i) {\n      b = merged[i];\n      if ((delta = angle(a[1], b[0])) > deltaMax) deltaMax = delta, lambda0 = b[0], lambda1 = a[1];\n    }\n  }\n\n  ranges = range = null;\n\n  return lambda0 === Infinity || phi0 === Infinity\n      ? [[NaN, NaN], [NaN, NaN]]\n      : [[lambda0, phi0], [lambda1, phi1]];\n}\n"],"names":["adder"],"mappings":";;AAUeA,EAAA;","x_google_ignoreList":[0]}

package/dist/index.es258.js

@@ -1,44 +1,39 @@
-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;
-        }
-      }
-    }
+import A from "./index.es331.js";
+import { tau as p, atan2 as I, asin as P, pi as z, sin as t, cos as i } from "./index.es321.js";
+function R(r, n) {
+  return [r > z ? r - p : r < -z ? r + p : r, n];
+}
+R.invert = R;
+function E(r, n, o) {
+  return (r %= p) ? n || o ? A(j(r), q(n, o)) : j(r) : n || o ? q(n, o) : R;
+}
+function g(r) {
+  return function(n, o) {
+    return n += r, [n > z ? n - p : n < -z ? n + p : n, o];
+  };
+}
+function j(r) {
+  var n = g(r);
+  return n.invert = g(-r), n;
+}
+function q(r, n) {
+  var o = i(r), x = t(r), y = i(n), k = t(n);
+  function w(u, c) {
+    var f = i(c), s = i(u) * f, e = t(u) * f, v = t(c), D = v * o + s * x;
+    return [
+      I(e * y - D * k, s * o - v * x),
+      P(D * y + e * k)
+    ];
   }
+  return w.invert = function(u, c) {
+    var f = i(c), s = i(u) * f, e = t(u) * f, v = t(c), D = v * y - e * k;
+    return [
+      I(e * y + v * k, s * o + D * x),
+      P(D * o - s * x)
+    ];
+  }, w;
 }
 export {
-  p as default
+  E as rotateRadians
 };
 //# sourceMappingURL=index.es258.js.map

package/dist/index.es258.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es258.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":"AAAA,SAAAA,EAAwBC,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]}
+{"version":3,"file":"index.es258.js","sources":["../../../node_modules/d3-geo/src/rotation.js"],"sourcesContent":["import compose from \"./compose\";\nimport {asin, atan2, cos, degrees, pi, radians, sin, tau} from \"./math\";\n\nfunction rotationIdentity(lambda, phi) {\n  return [lambda > pi ? lambda - tau : lambda < -pi ? lambda + tau : 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    return lambda += deltaLambda, [lambda > pi ? lambda - tau : lambda < -pi ? lambda + tau : 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","pi","tau","rotateRadians","deltaLambda","deltaPhi","deltaGamma","compose","rotationLambda","rotationPhiGamma","forwardRotationLambda","rotation","cosDeltaPhi","cos","sinDeltaPhi","sin","cosDeltaGamma","sinDeltaGamma","cosPhi","x","y","z","k","atan2","asin"],"mappings":";;AAGA,SAASA,EAAiBC,GAAQC,GAAK;AACrC,SAAO,CAACD,IAASE,IAAKF,IAASG,IAAMH,IAAS,CAACE,IAAKF,IAASG,IAAMH,GAAQC,CAAG;AAChF;AAEAF,EAAiB,SAASA;AAEnB,SAASK,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/DR;AACN;AAEA,SAASY,EAAsBN,GAAa;AAC1C,SAAO,SAASL,GAAQC,GAAK;AAC3B,WAAOD,KAAUK,GAAa,CAACL,IAASE,IAAKF,IAASG,IAAMH,IAAS,CAACE,IAAKF,IAASG,IAAMH,GAAQC,CAAG;AAAA,EACvG;AACF;AAEA,SAASQ,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,EAASZ,GAAQC,GAAK;AAC7B,QAAIkB,IAASL,EAAIb,CAAG,GAChBmB,IAAIN,EAAId,CAAM,IAAImB,GAClBE,IAAIL,EAAIhB,CAAM,IAAImB,GAClBG,IAAIN,EAAIf,CAAG,GACXsB,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,IAAA;AAAA,EAE9C;AAEA,SAAAN,EAAS,SAAS,SAASZ,GAAQC,GAAK;AACtC,QAAIkB,IAASL,EAAIb,CAAG,GAChBmB,IAAIN,EAAId,CAAM,IAAImB,GAClBE,IAAIL,EAAIhB,CAAM,IAAImB,GAClBG,IAAIN,EAAIf,CAAG,GACXsB,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,IAAA;AAAA,EAE1C,GAEOH;AACT;","x_google_ignoreList":[0]}

package/dist/index.es259.js

@@ -1,53 +1,4 @@
-import a from "./index.es272.js";
-function g(f, v, h, o) {
-  this.x = f, this.z = v, this.o = h, this.e = o, this.v = !1, this.n = this.p = null;
-}
-function B(f, v, h, o, n) {
-  var s = [], w = [], l, E;
-  if (f.forEach(function(x) {
-    if (!((e = x.length - 1) <= 0)) {
-      var e, z = x[0], k = x[e], t;
-      if (a(z, k)) {
-        for (n.lineStart(), l = 0; l < e; ++l) n.point((z = x[l])[0], z[1]);
-        n.lineEnd();
-        return;
-      }
-      s.push(t = new g(z, x, null, !0)), w.push(t.o = new g(z, null, t, !1)), s.push(t = new g(k, x, null, !1)), w.push(t.o = new g(k, null, t, !0));
-    }
-  }), !!s.length) {
-    for (w.sort(v), P(s), P(w), l = 0, E = w.length; l < E; ++l)
-      w[l].e = h = !h;
-    for (var q = s[0], p, d; ; ) {
-      for (var i = q, u = !0; i.v; ) if ((i = i.n) === q) return;
-      p = i.z, n.lineStart();
-      do {
-        if (i.v = i.o.v = !0, i.e) {
-          if (u)
-            for (l = 0, E = p.length; l < E; ++l) n.point((d = p[l])[0], d[1]);
-          else
-            o(i.x, i.n.x, 1, n);
-          i = i.n;
-        } else {
-          if (u)
-            for (p = i.p.z, l = p.length - 1; l >= 0; --l) n.point((d = p[l])[0], d[1]);
-          else
-            o(i.x, i.p.x, -1, n);
-          i = i.p;
-        }
-        i = i.o, p = i.z, u = !u;
-      } while (!i.v);
-      n.lineEnd();
-    }
-  }
-}
-function P(f) {
-  if (v = f.length) {
-    for (var v, h = 0, o = f[0], n; ++h < v; )
-      o.n = n = f[h], n.p = o, o = n;
-    o.n = n = f[0], n.p = o;
-  }
-}
-export {
-  B as default
-};
+import o from "./index.es467.js";
+import r from "./index.es468.js";
+r(o);
 //# sourceMappingURL=index.es259.js.map

package/dist/index.es259.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es259.js","sources":["../../../node_modules/d3-geo/src/clip/polygon.js"],"sourcesContent":["import pointEqual from \"../pointEqual\";\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 the first and last points of a segment are coincident, then treat as a\n    // closed ring. TODO if all rings are closed, then the winding order of the\n    // exterior ring should be checked.\n    if (pointEqual(p0, p1)) {\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\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","clipPolygon","segments","compareIntersection","startInside","interpolate","stream","subject","clip","i","n","segment","p0","p1","x","pointEqual","link","start","current","isSubject","array","a","b"],"mappings":";AAEA,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;AAKA,SAAAC,EAAwBC,GAAUC,GAAqBC,GAAaC,GAAaC,GAAQ;AACvF,MAAIC,IAAU,CAAA,GACVC,IAAO,CAAA,GACPC,GACAC;AAsBJ,MApBAR,EAAS,QAAQ,SAASS,GAAS;AACjC,QAAKD,GAAAA,IAAIC,EAAQ,SAAS,MAAM,IAChC;AAAA,UAAID,GAAGE,IAAKD,EAAQ,CAAC,GAAGE,IAAKF,EAAQD,CAAC,GAAGI;AAKzC,UAAIC,EAAWH,GAAIC,CAAE,GAAG;AAEtB,aADAP,EAAO,UAAA,GACFG,IAAI,GAAGA,IAAIC,GAAG,EAAED,EAAG,CAAAH,EAAO,OAAOM,IAAKD,EAAQF,CAAC,GAAG,CAAC,GAAGG,EAAG,CAAC,CAAC;AAChE,QAAAN,EAAO,QAAA;AACP;AAAA,MACF;AAEA,MAAAC,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,GAC7Ba,EAAKT,CAAO,GACZS,EAAKR,CAAI,GAEJC,IAAI,GAAGC,IAAIF,EAAK,QAAQC,IAAIC,GAAG,EAAED;AACpC,MAAAD,EAAKC,CAAC,EAAE,IAAIL,IAAc,CAACA;AAO7B,aAJIa,IAAQV,EAAQ,CAAC,GACjBT,GACAD,OAEM;AAIR,eAFIqB,IAAUD,GACVE,IAAY,IACTD,EAAQ,IAAG,MAAKA,IAAUA,EAAQ,OAAOD,EAAO;AACvD,MAAAnB,IAASoB,EAAQ,GACjBZ,EAAO,UAAA;AACP,SAAG;AAED,YADAY,EAAQ,IAAIA,EAAQ,EAAE,IAAI,IACtBA,EAAQ,GAAG;AACb,cAAIC;AACF,iBAAKV,IAAI,GAAGC,IAAIZ,EAAO,QAAQW,IAAIC,GAAG,EAAED,KAAU,OAAOZ,IAAQC,EAAOW,CAAC,GAAG,CAAC,GAAGZ,EAAM,CAAC,CAAC;AAAA;AAExF,YAAAQ,EAAYa,EAAQ,GAAGA,EAAQ,EAAE,GAAG,GAAGZ,CAAM;AAE/C,UAAAY,IAAUA,EAAQ;AAAA,QACpB,OAAO;AACL,cAAIC;AAEF,iBADArB,IAASoB,EAAQ,EAAE,GACdT,IAAIX,EAAO,SAAS,GAAGW,KAAK,GAAG,EAAEA,EAAG,CAAAH,EAAO,OAAOT,IAAQC,EAAOW,CAAC,GAAG,CAAC,GAAGZ,EAAM,CAAC,CAAC;AAAA;AAEtF,YAAAQ,EAAYa,EAAQ,GAAGA,EAAQ,EAAE,GAAG,IAAIZ,CAAM;AAEhD,UAAAY,IAAUA,EAAQ;AAAA,QACpB;AACA,QAAAA,IAAUA,EAAQ,GAClBpB,IAASoB,EAAQ,GACjBC,IAAY,CAACA;AAAA,MACf,SAAS,CAACD,EAAQ;AAClB,MAAAZ,EAAO,QAAA;AAAA,IACT;AAAA;AACF;AAEA,SAASU,EAAKI,GAAO;AACnB,MAAMV,IAAIU,EAAM,QAKhB;AAAA,aAJIV,GACAD,IAAI,GACJY,IAAID,EAAM,CAAC,GACXE,GACG,EAAEb,IAAIC;AACX,MAAAW,EAAE,IAAIC,IAAIF,EAAMX,CAAC,GACjBa,EAAE,IAAID,GACNA,IAAIC;AAEN,IAAAD,EAAE,IAAIC,IAAIF,EAAM,CAAC,GACjBE,EAAE,IAAID;AAAA;AACR;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es259.js","sources":["../../../node_modules/d3-geo/node_modules/d3-array/src/bisect.js"],"sourcesContent":["import ascending from \"./ascending\";\nimport bisector from \"./bisector\";\n\nvar ascendingBisect = bisector(ascending);\nexport var bisectRight = ascendingBisect.right;\nexport var bisectLeft = ascendingBisect.left;\nexport default bisectRight;\n"],"names":["bisector","ascending"],"mappings":";;AAGsBA,EAASC,CAAS;","x_google_ignoreList":[0]}

package/dist/index.es26.js

@@ -1,8 +1,8 @@
 import * as d from "react";
 import { useContext as s, useRef as f, useState as y, useMemo as m, useEffect as g, cloneElement as S } from "react";
 import { MapContext as h } from "./index.es16.js";
-import u from "./index.es217.js";
-import { deepEqual as C } from "./index.es215.js";
+import u from "./index.es224.js";
+import { deepEqual as C } from "./index.es222.js";
 let b = 0;
 function k(t, e, a) {
   if (t.style && t.style._loaded) {

package/dist/index.es260.js

@@ -1,11 +1,26 @@
-function i(e) {
-  for (var n = e.length, l, g = -1, t = 0, h, r; ++g < n; ) t += e[g].length;
-  for (h = new Array(t); --n >= 0; )
-    for (r = e[n], l = r.length; --l >= 0; )
-      h[--t] = r[l];
-  return h;
+import Y from "./index.es318.js";
+import { cartesianCross as S, cartesian as T, cartesianNormalizeInPlace as U } from "./index.es320.js";
+import { quarterPi as V, atan2 as Z, sin as e, cos as s, asin as _, epsilon as g, pi as $, tau as k } from "./index.es321.js";
+var n = Y();
+function l(y, B) {
+  var f = B[0], E = B[1], W = [e(f), -s(f), 0], C = 0, F = 0;
+  n.reset();
+  for (var m = 0, X = y.length; m < X; ++m)
+    if (w = (q = y[m]).length)
+      for (var q, w, v = q[w - 1], x = v[0], G = v[1] / 2 + V, H = e(G), J = s(G), z = 0; z < w; ++z, x = I, H = L, J = M, v = o) {
+        var o = q[z], I = o[0], K = o[1] / 2 + V, L = e(K), M = s(K), r = I - x, N = r >= 0 ? 1 : -1, c = N * r, u = c > $, O = H * L;
+        if (n.add(Z(O * N * e(c), J * M + O * s(c))), C += u ? r + N * k : r, u ^ x >= f ^ I >= f) {
+          var a = S(T(v), T(o));
+          U(a);
+          var Q = S(W, a);
+          U(Q);
+          var R = (u ^ r >= 0 ? -1 : 1) * _(Q[2]);
+          (E > R || E === R && (a[0] || a[1])) && (F += u ^ r >= 0 ? 1 : -1);
+        }
+      }
+  return (C < -g || C < g && n < -g) ^ F & 1;
 }
 export {
-  i as default
+  l as default
 };
 //# sourceMappingURL=index.es260.js.map

package/dist/index.es260.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es260.js","sources":["../../../node_modules/d3-geo/node_modules/d3-array/src/merge.js"],"sourcesContent":["export default function(arrays) {\n  var n = arrays.length,\n      m,\n      i = -1,\n      j = 0,\n      merged,\n      array;\n\n  while (++i < n) j += arrays[i].length;\n  merged = new Array(j);\n\n  while (--n >= 0) {\n    array = arrays[n];\n    m = array.length;\n    while (--m >= 0) {\n      merged[--j] = array[m];\n    }\n  }\n\n  return merged;\n}\n"],"names":["merge","arrays","m","i","j","merged","array"],"mappings":"AAAA,SAAAA,EAAwBC,GAAQ;AAQ9B,WAPI,IAAIA,EAAO,QACXC,GACAC,IAAI,IACJC,IAAI,GACJC,GACAC,GAEG,EAAEH,IAAI,IAAG,CAAAC,KAAKH,EAAOE,CAAC,EAAE;AAG/B,OAFAE,IAAS,IAAI,MAAMD,CAAC,GAEb,EAAE,KAAK;AAGZ,SAFAE,IAAQL,EAAO,CAAC,GAChBC,IAAII,EAAM,QACH,EAAEJ,KAAK;AACZ,MAAAG,EAAO,EAAED,CAAC,IAAIE,EAAMJ,CAAC;AAIzB,SAAOG;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es260.js","sources":["../../../node_modules/d3-geo/src/polygonContains.js"],"sourcesContent":["import adder from \"./adder\";\nimport {cartesian, cartesianCross, cartesianNormalizeInPlace} from \"./cartesian\";\nimport {asin, atan2, cos, epsilon, pi, quarterPi, sin, tau} from \"./math\";\n\nvar sum = adder();\n\nexport default function(polygon, point) {\n  var lambda = point[0],\n      phi = point[1],\n      normal = [sin(lambda), -cos(lambda), 0],\n      angle = 0,\n      winding = 0;\n\n  sum.reset();\n\n  for (var i = 0, n = polygon.length; i < n; ++i) {\n    if (!(m = (ring = polygon[i]).length)) continue;\n    var ring,\n        m,\n        point0 = ring[m - 1],\n        lambda0 = point0[0],\n        phi0 = point0[1] / 2 + quarterPi,\n        sinPhi0 = sin(phi0),\n        cosPhi0 = cos(phi0);\n\n    for (var j = 0; j < m; ++j, lambda0 = lambda1, sinPhi0 = sinPhi1, cosPhi0 = cosPhi1, point0 = point1) {\n      var point1 = ring[j],\n          lambda1 = point1[0],\n          phi1 = point1[1] / 2 + quarterPi,\n          sinPhi1 = sin(phi1),\n          cosPhi1 = cos(phi1),\n          delta = lambda1 - lambda0,\n          sign = delta >= 0 ? 1 : -1,\n          absDelta = sign * delta,\n          antimeridian = absDelta > pi,\n          k = sinPhi0 * sinPhi1;\n\n      sum.add(atan2(k * sign * sin(absDelta), cosPhi0 * cosPhi1 + k * cos(absDelta)));\n      angle += antimeridian ? delta + sign * tau : delta;\n\n      // Are the longitudes either side of the point’s meridian (lambda),\n      // and are the latitudes smaller than the parallel (phi)?\n      if (antimeridian ^ lambda0 >= lambda ^ lambda1 >= lambda) {\n        var arc = cartesianCross(cartesian(point0), cartesian(point1));\n        cartesianNormalizeInPlace(arc);\n        var intersection = cartesianCross(normal, arc);\n        cartesianNormalizeInPlace(intersection);\n        var phiArc = (antimeridian ^ delta >= 0 ? -1 : 1) * asin(intersection[2]);\n        if (phi > phiArc || phi === phiArc && (arc[0] || arc[1])) {\n          winding += antimeridian ^ delta >= 0 ? 1 : -1;\n        }\n      }\n    }\n  }\n\n  // First, determine whether the South pole is inside or outside:\n  //\n  // It is inside if:\n  // * the polygon winds around it in a clockwise direction.\n  // * the polygon does not (cumulatively) wind around it, but has a negative\n  //   (counter-clockwise) area.\n  //\n  // Second, count the (signed) number of times a segment crosses a lambda\n  // from the point to the South pole.  If it is zero, then the point is the\n  // same side as the South pole.\n\n  return (angle < -epsilon || angle < epsilon && sum < -epsilon) ^ (winding & 1);\n}\n"],"names":["sum","adder","polygonContains","polygon","point","lambda","phi","normal","sin","cos","angle","winding","i","n","m","ring","point0","lambda0","phi0","quarterPi","sinPhi0","cosPhi0","j","lambda1","sinPhi1","cosPhi1","point1","phi1","delta","sign","absDelta","antimeridian","pi","k","atan2","tau","arc","cartesianCross","cartesian","cartesianNormalizeInPlace","intersection","phiArc","asin","epsilon"],"mappings":";;;AAIA,IAAIA,IAAMC,EAAA;AAEV,SAAAC,EAAwBC,GAASC,GAAO;AACtC,MAAIC,IAASD,EAAM,CAAC,GAChBE,IAAMF,EAAM,CAAC,GACbG,IAAS,CAACC,EAAIH,CAAM,GAAG,CAACI,EAAIJ,CAAM,GAAG,CAAC,GACtCK,IAAQ,GACRC,IAAU;AAEd,EAAAX,EAAI,MAAA;AAEJ,WAASY,IAAI,GAAGC,IAAIV,EAAQ,QAAQS,IAAIC,GAAG,EAAED;AAC3C,QAAME,KAAKC,IAAOZ,EAAQS,CAAC,GAAG;AAS9B,eARIG,GACAD,GACAE,IAASD,EAAKD,IAAI,CAAC,GACnBG,IAAUD,EAAO,CAAC,GAClBE,IAAOF,EAAO,CAAC,IAAI,IAAIG,GACvBC,IAAUZ,EAAIU,CAAI,GAClBG,IAAUZ,EAAIS,CAAI,GAEbI,IAAI,GAAGA,IAAIR,GAAG,EAAEQ,GAAGL,IAAUM,GAASH,IAAUI,GAASH,IAAUI,GAAST,IAASU,GAAQ;AACpG,YAAIA,IAASX,EAAKO,CAAC,GACfC,IAAUG,EAAO,CAAC,GAClBC,IAAOD,EAAO,CAAC,IAAI,IAAIP,GACvBK,IAAUhB,EAAImB,CAAI,GAClBF,IAAUhB,EAAIkB,CAAI,GAClBC,IAAQL,IAAUN,GAClBY,IAAOD,KAAS,IAAI,IAAI,IACxBE,IAAWD,IAAOD,GAClBG,IAAeD,IAAWE,GAC1BC,IAAIb,IAAUI;AAOlB,YALAxB,EAAI,IAAIkC,EAAMD,IAAIJ,IAAOrB,EAAIsB,CAAQ,GAAGT,IAAUI,IAAUQ,IAAIxB,EAAIqB,CAAQ,CAAC,CAAC,GAC9EpB,KAASqB,IAAeH,IAAQC,IAAOM,IAAMP,GAIzCG,IAAed,KAAWZ,IAASkB,KAAWlB,GAAQ;AACxD,cAAI+B,IAAMC,EAAeC,EAAUtB,CAAM,GAAGsB,EAAUZ,CAAM,CAAC;AAC7D,UAAAa,EAA0BH,CAAG;AAC7B,cAAII,IAAeH,EAAe9B,GAAQ6B,CAAG;AAC7C,UAAAG,EAA0BC,CAAY;AACtC,cAAIC,KAAUV,IAAeH,KAAS,IAAI,KAAK,KAAKc,EAAKF,EAAa,CAAC,CAAC;AACxE,WAAIlC,IAAMmC,KAAUnC,MAAQmC,MAAWL,EAAI,CAAC,KAAKA,EAAI,CAAC,QACpDzB,KAAWoB,IAAeH,KAAS,IAAI,IAAI;AAAA,QAE/C;AAAA,MACF;AAcF,UAAQlB,IAAQ,CAACiC,KAAWjC,IAAQiC,KAAW3C,IAAM,CAAC2C,KAAYhC,IAAU;AAC9E;","x_google_ignoreList":[0]}

package/dist/index.es261.js

@@ -1,24 +1,3 @@
-import { atan2 as f, asin as s, sqrt as m, sin as i, cos as o } from "./index.es255.js";
-function z(u) {
-  return function(n, r) {
-    var t = o(n), c = o(r), a = u(t * c);
-    return [
-      a * c * i(n),
-      a * i(r)
-    ];
-  };
-}
-function h(u) {
-  return function(n, r) {
-    var t = m(n * n + r * r), c = u(t), a = i(c), e = o(c);
-    return [
-      f(n * a, t * e),
-      s(t && r * a / t)
-    ];
-  };
-}
-export {
-  h as azimuthalInvert,
-  z as azimuthalRaw
-};
+import r from "./index.es318.js";
+r();
 //# sourceMappingURL=index.es261.js.map

package/dist/index.es261.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es261.js","sources":["../../../node_modules/d3-geo/src/projection/azimuthal.js"],"sourcesContent":["import {asin, atan2, cos, sin, sqrt} from \"../math\";\n\nexport function azimuthalRaw(scale) {\n  return function(x, y) {\n    var cx = cos(x),\n        cy = cos(y),\n        k = scale(cx * cy);\n    return [\n      k * cy * sin(x),\n      k * sin(y)\n    ];\n  }\n}\n\nexport function azimuthalInvert(angle) {\n  return function(x, y) {\n    var z = sqrt(x * x + y * y),\n        c = angle(z),\n        sc = sin(c),\n        cc = cos(c);\n    return [\n      atan2(x * sc, z * cc),\n      asin(z && y * sc / z)\n    ];\n  }\n}\n"],"names":["azimuthalRaw","scale","x","y","cx","cos","cy","k","sin","azimuthalInvert","angle","z","sqrt","sc","cc","atan2","asin"],"mappings":";AAEO,SAASA,EAAaC,GAAO;AAClC,SAAO,SAASC,GAAGC,GAAG;AACpB,QAAIC,IAAKC,EAAIH,CAAC,GACVI,IAAKD,EAAIF,CAAC,GACVI,IAAIN,EAAMG,IAAKE,CAAE;AACrB,WAAO;AAAA,MACLC,IAAID,IAAKE,EAAIN,CAAC;AAAA,MACdK,IAAIC,EAAIL,CAAC;AAAA,IAAA;AAAA,EAEb;AACF;AAEO,SAASM,EAAgBC,GAAO;AACrC,SAAO,SAASR,GAAGC,GAAG;AACpB,QAAIQ,IAAIC,EAAKV,IAAIA,IAAIC,IAAIA,CAAC,GACtB,IAAIO,EAAMC,CAAC,GACXE,IAAKL,EAAI,CAAC,GACVM,IAAKT,EAAI,CAAC;AACd,WAAO;AAAA,MACLU,EAAMb,IAAIW,GAAIF,IAAIG,CAAE;AAAA,MACpBE,EAAKL,KAAKR,IAAIU,IAAKF,CAAC;AAAA,IAAA;AAAA,EAExB;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es261.js","sources":["../../../node_modules/d3-geo/src/length.js"],"sourcesContent":["import adder from \"./adder\";\nimport {abs, atan2, cos, radians, sin, sqrt} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nvar lengthSum = adder(),\n    lambda0,\n    sinPhi0,\n    cosPhi0;\n\nvar lengthStream = {\n  sphere: noop,\n  point: noop,\n  lineStart: lengthLineStart,\n  lineEnd: noop,\n  polygonStart: noop,\n  polygonEnd: noop\n};\n\nfunction lengthLineStart() {\n  lengthStream.point = lengthPointFirst;\n  lengthStream.lineEnd = lengthLineEnd;\n}\n\nfunction lengthLineEnd() {\n  lengthStream.point = lengthStream.lineEnd = noop;\n}\n\nfunction lengthPointFirst(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  lambda0 = lambda, sinPhi0 = sin(phi), cosPhi0 = cos(phi);\n  lengthStream.point = lengthPoint;\n}\n\nfunction lengthPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var sinPhi = sin(phi),\n      cosPhi = cos(phi),\n      delta = abs(lambda - lambda0),\n      cosDelta = cos(delta),\n      sinDelta = sin(delta),\n      x = cosPhi * sinDelta,\n      y = cosPhi0 * sinPhi - sinPhi0 * cosPhi * cosDelta,\n      z = sinPhi0 * sinPhi + cosPhi0 * cosPhi * cosDelta;\n  lengthSum.add(atan2(sqrt(x * x + y * y), z));\n  lambda0 = lambda, sinPhi0 = sinPhi, cosPhi0 = cosPhi;\n}\n\nexport default function(object) {\n  lengthSum.reset();\n  stream(object, lengthStream);\n  return +lengthSum;\n}\n"],"names":["adder"],"mappings":";AAKgBA,EAAA;","x_google_ignoreList":[0]}

package/dist/index.es262.js

@@ -1,69 +1,4 @@
-import P from "./index.es263.js";
-import D from "./index.es264.js";
-import { clipExtent as F } from "./index.es256.js";
-import H from "./index.es265.js";
-import T from "./index.es266.js";
-import { radians as n, degrees as i, sqrt as I } from "./index.es255.js";
-import { rotateRadians as J } from "./index.es200.js";
-import { transformer as K } from "./index.es206.js";
-import { fitExtent as N, fitSize as O } from "./index.es267.js";
-import w from "./index.es268.js";
-var Q = K({
-  point: function(o, u) {
-    this.stream.point(o * n, u * n);
-  }
-});
-function et(o) {
-  return U(function() {
-    return o;
-  })();
-}
-function U(o) {
-  var u, e = 150, g = 480, d = 250, l, m, h = 0, j = 0, v = 0, x = 0, y = 0, q, E, R = null, C = P, f = null, S, b, z, G = T, A = 0.5, L = w(M, A), s, k;
-  function r(t) {
-    return t = E(t[0] * n, t[1] * n), [t[0] * e + l, m - t[1] * e];
-  }
-  function B(t) {
-    return t = E.invert((t[0] - l) / e, (m - t[1]) / e), t && [t[0] * i, t[1] * i];
-  }
-  function M(t, c) {
-    return t = u(t, c), [t[0] * e + l, m - t[1] * e];
-  }
-  r.stream = function(t) {
-    return s && k === t ? s : s = Q(C(q, L(G(k = t))));
-  }, r.clipAngle = function(t) {
-    return arguments.length ? (C = +t ? D(R = t * n, 6 * n) : (R = null, P), p()) : R * i;
-  }, r.clipExtent = function(t) {
-    return arguments.length ? (G = t == null ? (f = S = b = z = null, T) : F(f = +t[0][0], S = +t[0][1], b = +t[1][0], z = +t[1][1]), p()) : f == null ? null : [[f, S], [b, z]];
-  }, r.scale = function(t) {
-    return arguments.length ? (e = +t, a()) : e;
-  }, r.translate = function(t) {
-    return arguments.length ? (g = +t[0], d = +t[1], a()) : [g, d];
-  }, r.center = function(t) {
-    return arguments.length ? (h = t[0] % 360 * n, j = t[1] % 360 * n, a()) : [h * i, j * i];
-  }, r.rotate = function(t) {
-    return arguments.length ? (v = t[0] % 360 * n, x = t[1] % 360 * n, y = t.length > 2 ? t[2] % 360 * n : 0, a()) : [v * i, x * i, y * i];
-  }, r.precision = function(t) {
-    return arguments.length ? (L = w(M, A = t * t), p()) : I(A);
-  }, r.fitExtent = function(t, c) {
-    return N(r, t, c);
-  }, r.fitSize = function(t, c) {
-    return O(r, t, c);
-  };
-  function a() {
-    E = H(q = J(v, x, y), u);
-    var t = u(h, j);
-    return l = g - t[0] * e, m = d + t[1] * e, p();
-  }
-  function p() {
-    return s = k = null, r;
-  }
-  return function() {
-    return u = o.apply(this, arguments), r.invert = u.invert && B, a();
-  };
-}
-export {
-  et as default,
-  U as projectionMutator
-};
+import r from "./index.es318.js";
+r();
+r();
 //# sourceMappingURL=index.es262.js.map