@performant-software/geospatial 3.1.12-beta.3 → 3.1.12

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (68) hide show
  1. package/dist/index.cjs14.js +1 -1
  2. package/dist/index.cjs188.js +1 -1
  3. package/dist/index.cjs211.js +1 -1
  4. package/dist/index.cjs212.js +1 -1
  5. package/dist/index.cjs213.js +1 -1
  6. package/dist/index.cjs231.js +1 -1
  7. package/dist/index.cjs241.js +1 -1
  8. package/dist/index.cjs241.js.map +1 -1
  9. package/dist/index.cjs242.js +1 -1
  10. package/dist/index.cjs242.js.map +1 -1
  11. package/dist/index.cjs254.js +1 -1
  12. package/dist/index.cjs255.js +1 -1
  13. package/dist/index.cjs258.js +1 -1
  14. package/dist/index.cjs262.js +1 -1
  15. package/dist/index.cjs262.js.map +1 -1
  16. package/dist/index.cjs264.js +1 -1
  17. package/dist/index.cjs264.js.map +1 -1
  18. package/dist/index.cjs31.js +1 -1
  19. package/dist/index.cjs33.js +1 -1
  20. package/dist/index.cjs34.js +1 -1
  21. package/dist/index.cjs75.js +1 -743
  22. package/dist/index.cjs75.js.map +1 -1
  23. package/dist/index.cjs76.js +1 -1
  24. package/dist/index.cjs77.js +1 -1
  25. package/dist/index.cjs77.js.map +1 -1
  26. package/dist/index.cjs78.js +743 -1
  27. package/dist/index.cjs78.js.map +1 -1
  28. package/dist/index.cjs79.js +1 -1
  29. package/dist/index.cjs79.js.map +1 -1
  30. package/dist/index.cjs80.js +1 -1
  31. package/dist/index.cjs80.js.map +1 -1
  32. package/dist/index.cjs81.js +1 -1
  33. package/dist/index.cjs81.js.map +1 -1
  34. package/dist/index.es14.js +2 -2
  35. package/dist/index.es188.js +1 -1
  36. package/dist/index.es211.js +1 -1
  37. package/dist/index.es212.js +1 -1
  38. package/dist/index.es213.js +1 -1
  39. package/dist/index.es231.js +1 -1
  40. package/dist/index.es241.js +4 -6
  41. package/dist/index.es241.js.map +1 -1
  42. package/dist/index.es242.js +6 -4
  43. package/dist/index.es242.js.map +1 -1
  44. package/dist/index.es254.js +1 -1
  45. package/dist/index.es255.js +1 -1
  46. package/dist/index.es258.js +1 -1
  47. package/dist/index.es262.js +69 -15
  48. package/dist/index.es262.js.map +1 -1
  49. package/dist/index.es264.js +15 -69
  50. package/dist/index.es264.js.map +1 -1
  51. package/dist/index.es31.js +2 -2
  52. package/dist/index.es33.js +2 -2
  53. package/dist/index.es34.js +2 -2
  54. package/dist/index.es75.js +1954 -21313
  55. package/dist/index.es75.js.map +1 -1
  56. package/dist/index.es76.js +6 -2
  57. package/dist/index.es76.js.map +1 -1
  58. package/dist/index.es77.js +2 -106
  59. package/dist/index.es77.js.map +1 -1
  60. package/dist/index.es78.js +21352 -10
  61. package/dist/index.es78.js.map +1 -1
  62. package/dist/index.es79.js +2 -1993
  63. package/dist/index.es79.js.map +1 -1
  64. package/dist/index.es80.js +105 -5
  65. package/dist/index.es80.js.map +1 -1
  66. package/dist/index.es81.js +10 -2
  67. package/dist/index.es81.js.map +1 -1
  68. package/package.json +1 -1
@@ -2,7 +2,7 @@ import { cartesian as Q, cartesianCross as T, cartesianDot as R, cartesianScale
2
2
  import { circleStream as $ } from "./index.es244.js";
3
3
  import { pi as v, cos as F, epsilon as x, abs as G, sqrt as b } from "./index.es246.js";
4
4
  import J from "./index.es263.js";
5
- import m from "./index.es264.js";
5
+ import m from "./index.es262.js";
6
6
  function fn(S, V) {
7
7
  var A = F(S), C = A > 0, W = G(A) > x;
8
8
  function X(n, i, o, e) {
@@ -1,5 +1,5 @@
1
1
  import c from "./index.es260.js";
2
- import n from "./index.es262.js";
2
+ import n from "./index.es264.js";
3
3
  function S(l, a, r) {
4
4
  var f = a[1][0] - a[0][0], m = a[1][1] - a[0][1], i = l.clipExtent && l.clipExtent();
5
5
  l.scale(150).translate([0, 0]), i != null && l.clipExtent(null), c(r, l.stream(n));
@@ -1,19 +1,73 @@
1
- import r from "./index.es261.js";
2
- var o = 1 / 0, f = o, t = -o, a = t, d = {
3
- point: u,
4
- lineStart: r,
5
- lineEnd: r,
6
- polygonStart: r,
7
- polygonEnd: r,
8
- result: function() {
9
- var n = [[o, f], [t, a]];
10
- return t = a = -(f = o = 1 / 0), n;
11
- }
12
- };
13
- function u(n, i) {
14
- n < o && (o = n), n > t && (t = n), i < f && (f = i), i > a && (a = i);
1
+ import A from "./index.es248.js";
2
+ import D from "./index.es250.js";
3
+ import { halfPi as S, epsilon as R } from "./index.es246.js";
4
+ import F from "./index.es193.js";
5
+ import "./index.es192.js";
6
+ import G from "./index.es251.js";
7
+ function T(e, p, m, v) {
8
+ return function(g, n) {
9
+ var d = p(n), j = g.invert(v[0], v[1]), h = A(), c = p(h), l = !1, a, f, u, r = {
10
+ point: y,
11
+ lineStart: x,
12
+ lineEnd: s,
13
+ polygonStart: function() {
14
+ r.point = B, r.lineStart = w, r.lineEnd = z, f = [], a = [];
15
+ },
16
+ polygonEnd: function() {
17
+ r.point = y, r.lineStart = x, r.lineEnd = s, f = G(f);
18
+ var o = F(a, j);
19
+ f.length ? (l || (n.polygonStart(), l = !0), D(f, J, o, m, n)) : o && (l || (n.polygonStart(), l = !0), n.lineStart(), m(null, null, 1, n), n.lineEnd()), l && (n.polygonEnd(), l = !1), f = a = null;
20
+ },
21
+ sphere: function() {
22
+ n.polygonStart(), n.lineStart(), m(null, null, 1, n), n.lineEnd(), n.polygonEnd();
23
+ }
24
+ };
25
+ function y(o, t) {
26
+ var i = g(o, t);
27
+ e(o = i[0], t = i[1]) && n.point(o, t);
28
+ }
29
+ function q(o, t) {
30
+ var i = g(o, t);
31
+ d.point(i[0], i[1]);
32
+ }
33
+ function x() {
34
+ r.point = q, d.lineStart();
35
+ }
36
+ function s() {
37
+ r.point = y, d.lineEnd();
38
+ }
39
+ function B(o, t) {
40
+ u.push([o, t]);
41
+ var i = g(o, t);
42
+ c.point(i[0], i[1]);
43
+ }
44
+ function w() {
45
+ c.lineStart(), u = [];
46
+ }
47
+ function z() {
48
+ B(u[0][0], u[0][1]), c.lineEnd();
49
+ var o = c.clean(), t = h.result(), i, I = t.length, P, E, C;
50
+ if (u.pop(), a.push(u), u = null, !!I) {
51
+ if (o & 1) {
52
+ if (E = t[0], (P = E.length - 1) > 0) {
53
+ for (l || (n.polygonStart(), l = !0), n.lineStart(), i = 0; i < P; ++i) n.point((C = E[i])[0], C[1]);
54
+ n.lineEnd();
55
+ }
56
+ return;
57
+ }
58
+ I > 1 && o & 2 && t.push(t.pop().concat(t.shift())), f.push(t.filter(H));
59
+ }
60
+ }
61
+ return r;
62
+ };
63
+ }
64
+ function H(e) {
65
+ return e.length > 1;
66
+ }
67
+ function J(e, p) {
68
+ return ((e = e.x)[0] < 0 ? e[1] - S - R : S - e[1]) - ((p = p.x)[0] < 0 ? p[1] - S - R : S - p[1]);
15
69
  }
16
70
  export {
17
- d as default
71
+ T as default
18
72
  };
19
73
  //# sourceMappingURL=index.es262.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.es262.js","sources":["../../../node_modules/d3-geo/src/path/bounds.js"],"sourcesContent":["import noop from \"../noop\";\n\nvar x0 = Infinity,\n y0 = x0,\n x1 = -x0,\n y1 = x1;\n\nvar boundsStream = {\n point: boundsPoint,\n lineStart: noop,\n lineEnd: noop,\n polygonStart: noop,\n polygonEnd: noop,\n result: function() {\n var bounds = [[x0, y0], [x1, y1]];\n x1 = y1 = -(y0 = x0 = Infinity);\n return bounds;\n }\n};\n\nfunction boundsPoint(x, y) {\n if (x < x0) x0 = x;\n if (x > x1) x1 = x;\n if (y < y0) y0 = y;\n if (y > y1) y1 = y;\n}\n\nexport default boundsStream;\n"],"names":["x0","y0","x1","y1","boundsStream","boundsPoint","noop","bounds","x","y"],"mappings":";AAEA,IAAIA,IAAK,OACLC,IAAKD,GACLE,IAAK,CAACF,GACNG,IAAKD,GAELE,IAAe;AAAA,EACjB,OAAOC;AAAA,EACP,WAAWC;AAAA,EACX,SAASA;AAAA,EACT,cAAcA;AAAA,EACd,YAAYA;AAAA,EACZ,QAAQ,WAAW;AACjB,QAAIC,IAAS,CAAC,CAACP,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,CAAC;AAChC,WAAAD,IAAKC,IAAK,EAAEF,IAAKD,IAAK,QACfO;AAAA,EACT;AACF;AAEA,SAASF,EAAYG,GAAGC,GAAG;AACzB,EAAID,IAAIR,MAAIA,IAAKQ,IACbA,IAAIN,MAAIA,IAAKM,IACbC,IAAIR,MAAIA,IAAKQ,IACbA,IAAIN,MAAIA,IAAKM;AACnB;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index.es262.js","sources":["../../../node_modules/d3-geo/src/clip/index.js"],"sourcesContent":["import clipBuffer from \"./buffer\";\nimport clipPolygon from \"./polygon\";\nimport {epsilon, halfPi} from \"../math\";\nimport polygonContains from \"../polygonContains\";\nimport {merge} from \"d3-array\";\n\nexport default function(pointVisible, clipLine, interpolate, start) {\n return function(rotate, sink) {\n var line = clipLine(sink),\n rotatedStart = rotate.invert(start[0], start[1]),\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, rotatedStart);\n if (segments.length) {\n if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n clipPolygon(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 var point = rotate(lambda, phi);\n if (pointVisible(lambda = point[0], phi = point[1])) sink.point(lambda, phi);\n }\n\n function pointLine(lambda, phi) {\n var point = rotate(lambda, phi);\n line.point(point[0], point[1]);\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 var point = rotate(lambda, phi);\n ringSink.point(point[0], point[1]);\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","rotate","sink","line","rotatedStart","ringBuffer","clipBuffer","ringSink","polygonStarted","polygon","segments","ring","point","lineStart","lineEnd","pointRing","ringStart","ringEnd","merge","startInside","polygonContains","clipPolygon","compareIntersection","lambda","phi","pointLine","clean","ringSegments","n","m","segment","validSegment","a","b","halfPi","epsilon"],"mappings":";;;;;;AAMA,SAAAA,EAAwBC,GAAcC,GAAUC,GAAaC,GAAO;AAClE,SAAO,SAASC,GAAQC,GAAM;AAC5B,QAAIC,IAAOL,EAASI,CAAI,GACpBE,IAAeH,EAAO,OAAOD,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,GAC/CK,IAAaC,KACbC,IAAWT,EAASO,CAAU,GAC9BG,IAAiB,IACjBC,GACAC,GACAC,GAEAf,IAAO;AAAA,MACT,OAAAgB;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,cAAc,WAAW;AACvB,QAAAlB,EAAK,QAAQmB,GACbnB,EAAK,YAAYoB,GACjBpB,EAAK,UAAUqB,GACfP,IAAW,CAAA,GACXD,IAAU,CAAA;AAAA,MACZ;AAAA,MACA,YAAY,WAAW;AACrB,QAAAb,EAAK,QAAQgB,GACbhB,EAAK,YAAYiB,GACjBjB,EAAK,UAAUkB,GACfJ,IAAWQ,EAAMR,CAAQ;AACzB,YAAIS,IAAcC,EAAgBX,GAASL,CAAY;AACvD,QAAIM,EAAS,UACNF,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3Da,EAAYX,GAAUY,GAAqBH,GAAapB,GAAaG,CAAI,KAChEiB,MACJX,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3DN,EAAK,UAAA,GACLH,EAAY,MAAM,MAAM,GAAGG,CAAI,GAC/BA,EAAK,QAAA,IAEHM,MAAgBN,EAAK,WAAA,GAAcM,IAAiB,KACxDE,IAAWD,IAAU;AAAA,MACvB;AAAA,MACA,QAAQ,WAAW;AACjB,QAAAP,EAAK,aAAA,GACLA,EAAK,UAAA,GACLH,EAAY,MAAM,MAAM,GAAGG,CAAI,GAC/BA,EAAK,QAAA,GACLA,EAAK,WAAA;AAAA,MACP;AAAA,IAAA;AAGF,aAASU,EAAMW,GAAQC,GAAK;AAC1B,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAI3B,EAAa0B,IAASX,EAAM,CAAC,GAAGY,IAAMZ,EAAM,CAAC,CAAC,KAAGV,EAAK,MAAMqB,GAAQC,CAAG;AAAA,IAC7E;AAEA,aAASC,EAAUF,GAAQC,GAAK;AAC9B,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAArB,EAAK,MAAMS,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IAC/B;AAEA,aAASC,IAAY;AACnB,MAAAjB,EAAK,QAAQ6B,GACbtB,EAAK,UAAA;AAAA,IACP;AAEA,aAASW,IAAU;AACjB,MAAAlB,EAAK,QAAQgB,GACbT,EAAK,QAAA;AAAA,IACP;AAEA,aAASY,EAAUQ,GAAQC,GAAK;AAC9B,MAAAb,EAAK,KAAK,CAACY,GAAQC,CAAG,CAAC;AACvB,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAAjB,EAAS,MAAMK,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IACnC;AAEA,aAASI,IAAY;AACnB,MAAAT,EAAS,UAAA,GACTI,IAAO,CAAA;AAAA,IACT;AAEA,aAASM,IAAU;AACjB,MAAAF,EAAUJ,EAAK,CAAC,EAAE,CAAC,GAAGA,EAAK,CAAC,EAAE,CAAC,CAAC,GAChCJ,EAAS,QAAA;AAET,UAAImB,IAAQnB,EAAS,MAAA,GACjBoB,IAAetB,EAAW,OAAA,GAC1B,GAAGuB,IAAID,EAAa,QAAQE,GAC5BC,GACAlB;AAMJ,UAJAD,EAAK,IAAA,GACLF,EAAQ,KAAKE,CAAI,GACjBA,IAAO,MAEH,EAACiB,GAGL;AAAA,YAAIF,IAAQ,GAAG;AAEb,cADAI,IAAUH,EAAa,CAAC,IACnBE,IAAIC,EAAQ,SAAS,KAAK,GAAG;AAGhC,iBAFKtB,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3DN,EAAK,UAAA,GACA,IAAI,GAAG,IAAI2B,GAAG,EAAE,EAAG,CAAA3B,EAAK,OAAOU,IAAQkB,EAAQ,CAAC,GAAG,CAAC,GAAGlB,EAAM,CAAC,CAAC;AACpE,YAAAV,EAAK,QAAA;AAAA,UACP;AACA;AAAA,QACF;AAIA,QAAI0B,IAAI,KAAKF,IAAQ,KAAGC,EAAa,KAAKA,EAAa,IAAA,EAAM,OAAOA,EAAa,MAAA,CAAO,CAAC,GAEzFjB,EAAS,KAAKiB,EAAa,OAAOI,CAAY,CAAC;AAAA;AAAA,IACjD;AAEA,WAAOnC;AAAA,EACT;AACF;AAEA,SAASmC,EAAaD,GAAS;AAC7B,SAAOA,EAAQ,SAAS;AAC1B;AAIA,SAASR,EAAoBU,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]}
@@ -1,73 +1,19 @@
1
- import A from "./index.es248.js";
2
- import D from "./index.es250.js";
3
- import { halfPi as S, epsilon as R } from "./index.es246.js";
4
- import F from "./index.es193.js";
5
- import "./index.es192.js";
6
- import G from "./index.es251.js";
7
- function T(e, p, m, v) {
8
- return function(g, n) {
9
- var d = p(n), j = g.invert(v[0], v[1]), h = A(), c = p(h), l = !1, a, f, u, r = {
10
- point: y,
11
- lineStart: x,
12
- lineEnd: s,
13
- polygonStart: function() {
14
- r.point = B, r.lineStart = w, r.lineEnd = z, f = [], a = [];
15
- },
16
- polygonEnd: function() {
17
- r.point = y, r.lineStart = x, r.lineEnd = s, f = G(f);
18
- var o = F(a, j);
19
- f.length ? (l || (n.polygonStart(), l = !0), D(f, J, o, m, n)) : o && (l || (n.polygonStart(), l = !0), n.lineStart(), m(null, null, 1, n), n.lineEnd()), l && (n.polygonEnd(), l = !1), f = a = null;
20
- },
21
- sphere: function() {
22
- n.polygonStart(), n.lineStart(), m(null, null, 1, n), n.lineEnd(), n.polygonEnd();
23
- }
24
- };
25
- function y(o, t) {
26
- var i = g(o, t);
27
- e(o = i[0], t = i[1]) && n.point(o, t);
28
- }
29
- function q(o, t) {
30
- var i = g(o, t);
31
- d.point(i[0], i[1]);
32
- }
33
- function x() {
34
- r.point = q, d.lineStart();
35
- }
36
- function s() {
37
- r.point = y, d.lineEnd();
38
- }
39
- function B(o, t) {
40
- u.push([o, t]);
41
- var i = g(o, t);
42
- c.point(i[0], i[1]);
43
- }
44
- function w() {
45
- c.lineStart(), u = [];
46
- }
47
- function z() {
48
- B(u[0][0], u[0][1]), c.lineEnd();
49
- var o = c.clean(), t = h.result(), i, I = t.length, P, E, C;
50
- if (u.pop(), a.push(u), u = null, !!I) {
51
- if (o & 1) {
52
- if (E = t[0], (P = E.length - 1) > 0) {
53
- for (l || (n.polygonStart(), l = !0), n.lineStart(), i = 0; i < P; ++i) n.point((C = E[i])[0], C[1]);
54
- n.lineEnd();
55
- }
56
- return;
57
- }
58
- I > 1 && o & 2 && t.push(t.pop().concat(t.shift())), f.push(t.filter(H));
59
- }
60
- }
61
- return r;
62
- };
63
- }
64
- function H(e) {
65
- return e.length > 1;
66
- }
67
- function J(e, p) {
68
- return ((e = e.x)[0] < 0 ? e[1] - S - R : S - e[1]) - ((p = p.x)[0] < 0 ? p[1] - S - R : S - p[1]);
1
+ import r from "./index.es261.js";
2
+ var o = 1 / 0, f = o, t = -o, a = t, d = {
3
+ point: u,
4
+ lineStart: r,
5
+ lineEnd: r,
6
+ polygonStart: r,
7
+ polygonEnd: r,
8
+ result: function() {
9
+ var n = [[o, f], [t, a]];
10
+ return t = a = -(f = o = 1 / 0), n;
11
+ }
12
+ };
13
+ function u(n, i) {
14
+ n < o && (o = n), n > t && (t = n), i < f && (f = i), i > a && (a = i);
69
15
  }
70
16
  export {
71
- T as default
17
+ d as default
72
18
  };
73
19
  //# sourceMappingURL=index.es264.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.es264.js","sources":["../../../node_modules/d3-geo/src/clip/index.js"],"sourcesContent":["import clipBuffer from \"./buffer\";\nimport clipPolygon from \"./polygon\";\nimport {epsilon, halfPi} from \"../math\";\nimport polygonContains from \"../polygonContains\";\nimport {merge} from \"d3-array\";\n\nexport default function(pointVisible, clipLine, interpolate, start) {\n return function(rotate, sink) {\n var line = clipLine(sink),\n rotatedStart = rotate.invert(start[0], start[1]),\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, rotatedStart);\n if (segments.length) {\n if (!polygonStarted) sink.polygonStart(), polygonStarted = true;\n clipPolygon(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 var point = rotate(lambda, phi);\n if (pointVisible(lambda = point[0], phi = point[1])) sink.point(lambda, phi);\n }\n\n function pointLine(lambda, phi) {\n var point = rotate(lambda, phi);\n line.point(point[0], point[1]);\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 var point = rotate(lambda, phi);\n ringSink.point(point[0], point[1]);\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","rotate","sink","line","rotatedStart","ringBuffer","clipBuffer","ringSink","polygonStarted","polygon","segments","ring","point","lineStart","lineEnd","pointRing","ringStart","ringEnd","merge","startInside","polygonContains","clipPolygon","compareIntersection","lambda","phi","pointLine","clean","ringSegments","n","m","segment","validSegment","a","b","halfPi","epsilon"],"mappings":";;;;;;AAMA,SAAAA,EAAwBC,GAAcC,GAAUC,GAAaC,GAAO;AAClE,SAAO,SAASC,GAAQC,GAAM;AAC5B,QAAIC,IAAOL,EAASI,CAAI,GACpBE,IAAeH,EAAO,OAAOD,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC,GAC/CK,IAAaC,KACbC,IAAWT,EAASO,CAAU,GAC9BG,IAAiB,IACjBC,GACAC,GACAC,GAEAf,IAAO;AAAA,MACT,OAAAgB;AAAA,MACA,WAAAC;AAAA,MACA,SAAAC;AAAA,MACA,cAAc,WAAW;AACvB,QAAAlB,EAAK,QAAQmB,GACbnB,EAAK,YAAYoB,GACjBpB,EAAK,UAAUqB,GACfP,IAAW,CAAA,GACXD,IAAU,CAAA;AAAA,MACZ;AAAA,MACA,YAAY,WAAW;AACrB,QAAAb,EAAK,QAAQgB,GACbhB,EAAK,YAAYiB,GACjBjB,EAAK,UAAUkB,GACfJ,IAAWQ,EAAMR,CAAQ;AACzB,YAAIS,IAAcC,EAAgBX,GAASL,CAAY;AACvD,QAAIM,EAAS,UACNF,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3Da,EAAYX,GAAUY,GAAqBH,GAAapB,GAAaG,CAAI,KAChEiB,MACJX,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3DN,EAAK,UAAA,GACLH,EAAY,MAAM,MAAM,GAAGG,CAAI,GAC/BA,EAAK,QAAA,IAEHM,MAAgBN,EAAK,WAAA,GAAcM,IAAiB,KACxDE,IAAWD,IAAU;AAAA,MACvB;AAAA,MACA,QAAQ,WAAW;AACjB,QAAAP,EAAK,aAAA,GACLA,EAAK,UAAA,GACLH,EAAY,MAAM,MAAM,GAAGG,CAAI,GAC/BA,EAAK,QAAA,GACLA,EAAK,WAAA;AAAA,MACP;AAAA,IAAA;AAGF,aAASU,EAAMW,GAAQC,GAAK;AAC1B,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAI3B,EAAa0B,IAASX,EAAM,CAAC,GAAGY,IAAMZ,EAAM,CAAC,CAAC,KAAGV,EAAK,MAAMqB,GAAQC,CAAG;AAAA,IAC7E;AAEA,aAASC,EAAUF,GAAQC,GAAK;AAC9B,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAArB,EAAK,MAAMS,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IAC/B;AAEA,aAASC,IAAY;AACnB,MAAAjB,EAAK,QAAQ6B,GACbtB,EAAK,UAAA;AAAA,IACP;AAEA,aAASW,IAAU;AACjB,MAAAlB,EAAK,QAAQgB,GACbT,EAAK,QAAA;AAAA,IACP;AAEA,aAASY,EAAUQ,GAAQC,GAAK;AAC9B,MAAAb,EAAK,KAAK,CAACY,GAAQC,CAAG,CAAC;AACvB,UAAIZ,IAAQX,EAAOsB,GAAQC,CAAG;AAC9B,MAAAjB,EAAS,MAAMK,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,IACnC;AAEA,aAASI,IAAY;AACnB,MAAAT,EAAS,UAAA,GACTI,IAAO,CAAA;AAAA,IACT;AAEA,aAASM,IAAU;AACjB,MAAAF,EAAUJ,EAAK,CAAC,EAAE,CAAC,GAAGA,EAAK,CAAC,EAAE,CAAC,CAAC,GAChCJ,EAAS,QAAA;AAET,UAAImB,IAAQnB,EAAS,MAAA,GACjBoB,IAAetB,EAAW,OAAA,GAC1B,GAAGuB,IAAID,EAAa,QAAQE,GAC5BC,GACAlB;AAMJ,UAJAD,EAAK,IAAA,GACLF,EAAQ,KAAKE,CAAI,GACjBA,IAAO,MAEH,EAACiB,GAGL;AAAA,YAAIF,IAAQ,GAAG;AAEb,cADAI,IAAUH,EAAa,CAAC,IACnBE,IAAIC,EAAQ,SAAS,KAAK,GAAG;AAGhC,iBAFKtB,MAAgBN,EAAK,aAAA,GAAgBM,IAAiB,KAC3DN,EAAK,UAAA,GACA,IAAI,GAAG,IAAI2B,GAAG,EAAE,EAAG,CAAA3B,EAAK,OAAOU,IAAQkB,EAAQ,CAAC,GAAG,CAAC,GAAGlB,EAAM,CAAC,CAAC;AACpE,YAAAV,EAAK,QAAA;AAAA,UACP;AACA;AAAA,QACF;AAIA,QAAI0B,IAAI,KAAKF,IAAQ,KAAGC,EAAa,KAAKA,EAAa,IAAA,EAAM,OAAOA,EAAa,MAAA,CAAO,CAAC,GAEzFjB,EAAS,KAAKiB,EAAa,OAAOI,CAAY,CAAC;AAAA;AAAA,IACjD;AAEA,WAAOnC;AAAA,EACT;AACF;AAEA,SAASmC,EAAaD,GAAS;AAC7B,SAAOA,EAAQ,SAAS;AAC1B;AAIA,SAASR,EAAoBU,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]}
1
+ {"version":3,"file":"index.es264.js","sources":["../../../node_modules/d3-geo/src/path/bounds.js"],"sourcesContent":["import noop from \"../noop\";\n\nvar x0 = Infinity,\n y0 = x0,\n x1 = -x0,\n y1 = x1;\n\nvar boundsStream = {\n point: boundsPoint,\n lineStart: noop,\n lineEnd: noop,\n polygonStart: noop,\n polygonEnd: noop,\n result: function() {\n var bounds = [[x0, y0], [x1, y1]];\n x1 = y1 = -(y0 = x0 = Infinity);\n return bounds;\n }\n};\n\nfunction boundsPoint(x, y) {\n if (x < x0) x0 = x;\n if (x > x1) x1 = x;\n if (y < y0) y0 = y;\n if (y > y1) y1 = y;\n}\n\nexport default boundsStream;\n"],"names":["x0","y0","x1","y1","boundsStream","boundsPoint","noop","bounds","x","y"],"mappings":";AAEA,IAAIA,IAAK,OACLC,IAAKD,GACLE,IAAK,CAACF,GACNG,IAAKD,GAELE,IAAe;AAAA,EACjB,OAAOC;AAAA,EACP,WAAWC;AAAA,EACX,SAASA;AAAA,EACT,cAAcA;AAAA,EACd,YAAYA;AAAA,EACZ,QAAQ,WAAW;AACjB,QAAIC,IAAS,CAAC,CAACP,GAAIC,CAAE,GAAG,CAACC,GAAIC,CAAE,CAAC;AAChC,WAAAD,IAAKC,IAAK,EAAEF,IAAKD,IAAK,QACfO;AAAA,EACT;AACF;AAEA,SAASF,EAAYG,GAAGC,GAAG;AACzB,EAAID,IAAIR,MAAIA,IAAKQ,IACbA,IAAIN,MAAIA,IAAKM,IACbC,IAAIR,MAAIA,IAAKQ,IACbA,IAAIN,MAAIA,IAAKM;AACnB;","x_google_ignoreList":[0]}
@@ -1,5 +1,5 @@
1
- import { getDefaultExportFromCjs as f } from "./index.es80.js";
2
- import { __require as n } from "./index.es75.js";
1
+ import { getDefaultExportFromCjs as f } from "./index.es76.js";
2
+ import { __require as n } from "./index.es78.js";
3
3
  function s(t, i) {
4
4
  for (var o = 0; o < i.length; o++) {
5
5
  const e = i[o];
@@ -1,5 +1,5 @@
1
- import { GenIcon as a } from "./index.es77.js";
2
- import "./index.es78.js";
1
+ import { GenIcon as a } from "./index.es80.js";
2
+ import "./index.es81.js";
3
3
  function l(t) {
4
4
  return a({ attr: { fill: "currentColor", viewBox: "0 0 16 16" }, child: [{ tag: "path", attr: { d: "m14.12 10.163 1.715.858c.22.11.22.424 0 .534L8.267 15.34a.6.6 0 0 1-.534 0L.165 11.555a.299.299 0 0 1 0-.534l1.716-.858 5.317 2.659c.505.252 1.1.252 1.604 0l5.317-2.66zM7.733.063a.6.6 0 0 1 .534 0l7.568 3.784a.3.3 0 0 1 0 .535L8.267 8.165a.6.6 0 0 1-.534 0L.165 4.382a.299.299 0 0 1 0-.535z" }, child: [] }, { tag: "path", attr: { d: "m14.12 6.576 1.715.858c.22.11.22.424 0 .534l-7.568 3.784a.6.6 0 0 1-.534 0L.165 7.968a.299.299 0 0 1 0-.534l1.716-.858 5.317 2.659c.505.252 1.1.252 1.604 0z" }, child: [] }] })(t);
5
5
  }
@@ -1,5 +1,5 @@
1
- import { GenIcon as o } from "./index.es77.js";
2
- import "./index.es78.js";
1
+ import { GenIcon as o } from "./index.es80.js";
2
+ import "./index.es81.js";
3
3
  function e(t) {
4
4
  return o({ attr: { viewBox: "0 0 512 512" }, child: [{ tag: "path", attr: { fill: "none", strokeLinecap: "round", strokeLinejoin: "round", strokeWidth: "32", d: "M416 128 192 384l-96-96" }, child: [] }] })(t);
5
5
  }