@performant-software/geospatial 2.1.0-beta.51 → 2.1.0-beta.52

package/dist/index.es167.js

@@ -1,8 +1,4 @@
-import p from "./index.es233.js";
-const i = p(function(t, o, r) {
-  t[r ? 0 : 1].push(o);
-}, !0);
-export {
-  i as default
-};
+import r from "./index.es229.js";
+r();
+r();
 //# sourceMappingURL=index.es167.js.map

package/dist/index.es167.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es167.js","sources":["../../../node_modules/underscore/modules/partition.js"],"sourcesContent":["import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n  result[pass ? 0 : 1].push(value);\n}, true);\n"],"names":["partition","group","result","value","pass"],"mappings":";AAIA,MAAeA,IAAAC,EAAM,SAASC,GAAQC,GAAOC,GAAM;AACjD,EAAAF,EAAOE,IAAO,IAAI,CAAC,EAAE,KAAKD,CAAK;AACjC,GAAG,EAAI;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es167.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,EAAM;AAEjBA,EAAM;","x_google_ignoreList":[0]}

package/dist/index.es168.js

@@ -1,15 +1,4 @@
-import f from "./index.es96.js";
-import { slice as t } from "./index.es18.js";
-import i from "./index.es88.js";
-import m from "./index.es231.js";
-import u from "./index.es149.js";
-import e from "./index.es119.js";
-import o from "./index.es106.js";
-var a = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
-function A(r) {
-  return r ? f(r) ? t.call(r) : i(r) ? r.match(a) : m(r) ? u(r, e) : o(r) : [];
-}
-export {
-  A as default
-};
+import r from "./index.es229.js";
+import "./index.es167.js";
+r();
 //# sourceMappingURL=index.es168.js.map

package/dist/index.es168.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es168.js","sources":["../../../node_modules/underscore/modules/toArray.js"],"sourcesContent":["import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default function toArray(obj) {\n  if (!obj) return [];\n  if (isArray(obj)) return slice.call(obj);\n  if (isString(obj)) {\n    // Keep surrogate pair characters together.\n    return obj.match(reStrSymbol);\n  }\n  if (isArrayLike(obj)) return map(obj, identity);\n  return values(obj);\n}\n"],"names":["reStrSymbol","toArray","obj","isArray","slice","isString","isArrayLike","map","identity","values"],"mappings":";;;;;;;AASA,IAAIA,IAAc;AAClB,SAAwBC,EAAQC,GAAK;AACnC,SAAKA,IACDC,EAAQD,CAAG,IAAUE,EAAM,KAAKF,CAAG,IACnCG,EAASH,CAAG,IAEPA,EAAI,MAAMF,CAAW,IAE1BM,EAAYJ,CAAG,IAAUK,EAAIL,GAAKM,CAAQ,IACvCC,EAAOP,CAAG,IAPA;AAQnB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es168.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,EAAM;","x_google_ignoreList":[0]}

package/dist/index.es169.js

@@ -1,9 +1,39 @@
-import e from "./index.es231.js";
-import t from "./index.es104.js";
-function f(r) {
-  return r == null ? 0 : e(r) ? r.length : t(r).length;
+import A from "./index.es242.js";
+import { pi as z, tau as p, atan2 as I, asin as P, cos as t, sin as i } from "./index.es232.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 = t(r), x = i(r), y = t(n), k = i(n);
+  function w(u, c) {
+    var f = t(c), s = t(u) * f, e = i(u) * f, v = i(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 = t(c), s = t(u) * f, e = i(u) * f, v = i(c), D = v * y - e * k;
+    return [
+      I(e * y + v * k, s * o + D * x),
+      P(D * o - s * x)
+    ];
+  }, w;
 }
 export {
-  f as default
+  E as rotateRadians
 };
 //# sourceMappingURL=index.es169.js.map

package/dist/index.es169.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es169.js","sources":["../../../node_modules/underscore/modules/size.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the number of elements in a collection.\nexport default function size(obj) {\n  if (obj == null) return 0;\n  return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n"],"names":["size","obj","isArrayLike","keys"],"mappings":";;AAIA,SAAwBA,EAAKC,GAAK;AAChC,SAAIA,KAAO,OAAa,IACjBC,EAAYD,CAAG,IAAIA,EAAI,SAASE,EAAKF,CAAG,EAAE;AACnD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es169.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;AAC9B,SAAA,CAACD,IAASE,IAAKF,IAASG,IAAMH,IAAS,CAACE,IAAKF,IAASG,IAAMH,GAAQC,CAAG;AAChF;AAEAF,EAAiB,SAASA;AAEV,SAAAK,EAAcC,GAAaC,GAAUC,GAAY;AACvD,UAAAF,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;AACnC,SAAA,SAASL,GAAQC,GAAK;AAC3B,WAAOD,KAAUK,GAAa,CAACL,IAASE,IAAKF,IAASG,IAAMH,IAAS,CAACE,IAAKF,IAASG,IAAMH,GAAQC,CAAG;AAAA,EAAA;AAEzG;AAEA,SAASQ,EAAeJ,GAAa;AAC/B,MAAAO,IAAWD,EAAsBN,CAAW;AACvC,SAAAO,EAAA,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;AAEzB,WAAAK,EAASZ,GAAQC,GAAK;AACzB,QAAAkB,IAASL,EAAIb,CAAG,GAChBmB,IAAIN,EAAId,CAAM,IAAImB,GAClBE,IAAIL,EAAIhB,CAAM,IAAImB,GAClBG,IAAIN,EAAIf,CAAG,GACXsB,IAAID,IAAIT,IAAcO,IAAIL;AACvB,WAAA;AAAA,MACLS,EAAMH,IAAIJ,IAAgBM,IAAIL,GAAeE,IAAIP,IAAcS,IAAIP,CAAW;AAAA,MAC9EU,EAAKF,IAAIN,IAAgBI,IAAIH,CAAa;AAAA,IAAA;AAAA,EAE9C;AAES,SAAAN,EAAA,SAAS,SAASZ,GAAQC,GAAK;AAClC,QAAAkB,IAASL,EAAIb,CAAG,GAChBmB,IAAIN,EAAId,CAAM,IAAImB,GAClBE,IAAIL,EAAIhB,CAAM,IAAImB,GAClBG,IAAIN,EAAIf,CAAG,GACXsB,IAAID,IAAIL,IAAgBI,IAAIH;AACzB,WAAA;AAAA,MACLM,EAAMH,IAAIJ,IAAgBK,IAAIJ,GAAeE,IAAIP,IAAcU,IAAIR,CAAW;AAAA,MAC9EU,EAAKF,IAAIV,IAAcO,IAAIL,CAAW;AAAA,IAAA;AAAA,EACxC,GAGKH;AACT;","x_google_ignoreList":[0]}

package/dist/index.es17.js

@@ -1,5 +1,5 @@
-import * as i from "./index.es80.js";
-import m from "./index.es81.js";
+import * as i from "./index.es62.js";
+import m from "./index.es63.js";
 var r = m(i);
 r._ = r;
 export {

package/dist/index.es170.js

@@ -1,8 +1,4 @@
-import n from "./index.es171.js";
-function u(t, l, i) {
-  return t == null || t.length < 1 ? l == null || i ? void 0 : [] : l == null || i ? t[0] : n(t, t.length - l);
-}
-export {
-  u as default
-};
+import o from "./index.es253.js";
+import r from "./index.es254.js";
+r(o);
 //# sourceMappingURL=index.es170.js.map

package/dist/index.es170.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es170.js","sources":["../../../node_modules/underscore/modules/first.js"],"sourcesContent":["import initial from './initial.js';\n\n// Get the first element of an array. Passing **n** will return the first N\n// values in the array. The **guard** check allows it to work with `_.map`.\nexport default function first(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[0];\n  return initial(array, array.length - n);\n}\n"],"names":["first","array","n","guard","initial"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAGC,GAAO;AACzC,SAAAF,KAAS,QAAQA,EAAM,SAAS,IAAUC,KAAK,QAAQC,IAAQ,SAAS,CAAA,IACxED,KAAK,QAAQC,IAAcF,EAAM,CAAC,IAC/BG,EAAQH,GAAOA,EAAM,SAASC,CAAC;AACxC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es170.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.es171.js

@@ -1,8 +1,26 @@
-import { slice as e } from "./index.es18.js";
-function a(l, t, i) {
-  return e.call(l, 0, Math.max(0, l.length - (t == null || i ? 1 : t)));
+import Y from "./index.es229.js";
+import { cartesianCross as S, cartesian as T, cartesianNormalizeInPlace as U } from "./index.es231.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.es232.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 {
-  a as default
+  l as default
 };
 //# sourceMappingURL=index.es171.js.map

package/dist/index.es171.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es171.js","sources":["../../../node_modules/underscore/modules/initial.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the last entry of the array. Especially useful on\n// the arguments object. Passing **n** will return all the values in\n// the array, excluding the last N.\nexport default function initial(array, n, guard) {\n  return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n"],"names":["initial","array","n","guard","slice"],"mappings":";AAKwB,SAAAA,EAAQC,GAAOC,GAAGC,GAAO;AAC/C,SAAOC,EAAM,KAAKH,GAAO,GAAG,KAAK,IAAI,GAAGA,EAAM,UAAUC,KAAK,QAAQC,IAAQ,IAAID,EAAE,CAAC;AACtF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es171.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,EAAM;AAEhB,SAAAC,EAAwBC,GAASC,GAAO;AAClC,MAAAC,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,MAAM;AAED,WAAAY,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,GACrEpB,KAAAqB,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;AACzB,cAAAI,IAAeH,EAAe9B,GAAQ6B,CAAG;AAC7C,UAAAG,EAA0BC,CAAY;AAClC,cAAAC,KAAUV,IAAeH,KAAS,IAAI,KAAK,KAAKc,EAAKF,EAAa,CAAC,CAAC;AACpE,WAAAlC,IAAMmC,KAAUnC,MAAQmC,MAAWL,EAAI,CAAC,KAAKA,EAAI,CAAC,QACzCzB,KAAAoB,IAAeH,KAAS,IAAI,IAAI;AAAA,QAE/C;AAAA,MACF;AAcM,UAAAlB,IAAQ,CAACiC,KAAWjC,IAAQiC,KAAW3C,IAAM,CAAC2C,KAAYhC,IAAU;AAC9E;","x_google_ignoreList":[0]}

package/dist/index.es172.js

@@ -1,8 +1,3 @@
-import n from "./index.es173.js";
-function f(t, l, e) {
-  return t == null || t.length < 1 ? l == null || e ? void 0 : [] : l == null || e ? t[t.length - 1] : n(t, Math.max(0, t.length - l));
-}
-export {
-  f as default
-};
+import r from "./index.es229.js";
+r();
 //# sourceMappingURL=index.es172.js.map

package/dist/index.es172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es172.js","sources":["../../../node_modules/underscore/modules/last.js"],"sourcesContent":["import rest from './rest.js';\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport default function last(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[array.length - 1];\n  return rest(array, Math.max(0, array.length - n));\n}\n"],"names":["last","array","n","guard","rest"],"mappings":";AAIwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AACxC,SAAAF,KAAS,QAAQA,EAAM,SAAS,IAAUC,KAAK,QAAQC,IAAQ,SAAS,CAAA,IACxED,KAAK,QAAQC,IAAcF,EAAMA,EAAM,SAAS,CAAC,IAC9CG,EAAKH,GAAO,KAAK,IAAI,GAAGA,EAAM,SAASC,CAAC,CAAC;AAClD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es172.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,EACZ;","x_google_ignoreList":[0]}

package/dist/index.es173.js

@@ -1,8 +1,4 @@
-import { slice as e } from "./index.es18.js";
-function u(r, l, t) {
-  return e.call(r, l == null || t ? 1 : l);
-}
-export {
-  u as default
-};
+import r from "./index.es229.js";
+r();
+r();
 //# sourceMappingURL=index.es173.js.map

package/dist/index.es173.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es173.js","sources":["../../../node_modules/underscore/modules/rest.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the first entry of the `array`. Especially useful on\n// the `arguments` object. Passing an **n** will return the rest N values in the\n// `array`.\nexport default function rest(array, n, guard) {\n  return slice.call(array, n == null || guard ? 1 : n);\n}\n"],"names":["rest","array","n","guard","slice"],"mappings":";AAKwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAOC,EAAM,KAAKH,GAAOC,KAAK,QAAQC,IAAQ,IAAID,CAAC;AACrD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es173.js","sources":["../../../node_modules/d3-geo/src/path/area.js"],"sourcesContent":["import adder from \"../adder\";\nimport {abs} from \"../math\";\nimport noop from \"../noop\";\n\nvar areaSum = adder(),\n    areaRingSum = 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.reset();\n  },\n  result: function() {\n    var area = areaSum / 2;\n    areaSum.reset();\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":["adder"],"mappings":";AAIcA,EACV;AAAcA,EACd;","x_google_ignoreList":[0]}

package/dist/index.es174.js

@@ -1,8 +1,3 @@
-import t from "./index.es152.js";
-function e(o) {
-  return t(o, Boolean);
-}
-export {
-  e as default
-};
+import r from "./index.es229.js";
+r();
 //# sourceMappingURL=index.es174.js.map

package/dist/index.es174.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es174.js","sources":["../../../node_modules/underscore/modules/compact.js"],"sourcesContent":["import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n  return filter(array, Boolean);\n}\n"],"names":["compact","array","filter"],"mappings":";AAGA,SAAwBA,EAAQC,GAAO;AAC9B,SAAAC,EAAOD,GAAO,OAAO;AAC9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es174.js","sources":["../../../node_modules/d3-geo/src/path/measure.js"],"sourcesContent":["import adder from \"../adder\";\nimport {sqrt} from \"../math\";\nimport noop from \"../noop\";\n\nvar lengthSum = adder(),\n    lengthRing,\n    x00,\n    y00,\n    x0,\n    y0;\n\nvar lengthStream = {\n  point: noop,\n  lineStart: function() {\n    lengthStream.point = lengthPointFirst;\n  },\n  lineEnd: function() {\n    if (lengthRing) lengthPoint(x00, y00);\n    lengthStream.point = noop;\n  },\n  polygonStart: function() {\n    lengthRing = true;\n  },\n  polygonEnd: function() {\n    lengthRing = null;\n  },\n  result: function() {\n    var length = +lengthSum;\n    lengthSum.reset();\n    return length;\n  }\n};\n\nfunction lengthPointFirst(x, y) {\n  lengthStream.point = lengthPoint;\n  x00 = x0 = x, y00 = y0 = y;\n}\n\nfunction lengthPoint(x, y) {\n  x0 -= x, y0 -= y;\n  lengthSum.add(sqrt(x0 * x0 + y0 * y0));\n  x0 = x, y0 = y;\n}\n\nexport default lengthStream;\n"],"names":["adder"],"mappings":";AAIgBA,EAAM;","x_google_ignoreList":[0]}

package/dist/index.es175.js

@@ -1,8 +1,35 @@
-import f from "./index.es228.js";
-function n(t, e) {
-  return f(t, e, !1);
+function e(t) {
+  return function(n) {
+    var r = new o();
+    for (var i in t)
+      r[i] = t[i];
+    return r.stream = n, r;
+  };
 }
+function o() {
+}
+o.prototype = {
+  constructor: o,
+  point: function(t, n) {
+    this.stream.point(t, n);
+  },
+  sphere: function() {
+    this.stream.sphere();
+  },
+  lineStart: function() {
+    this.stream.lineStart();
+  },
+  lineEnd: function() {
+    this.stream.lineEnd();
+  },
+  polygonStart: function() {
+    this.stream.polygonStart();
+  },
+  polygonEnd: function() {
+    this.stream.polygonEnd();
+  }
+};
 export {
-  n as default
+  e as transformer
 };
 //# sourceMappingURL=index.es175.js.map

package/dist/index.es175.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es175.js","sources":["../../../node_modules/underscore/modules/flatten.js"],"sourcesContent":["import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n  return _flatten(array, depth, false);\n}\n"],"names":["flatten","array","depth","_flatten"],"mappings":";AAIwB,SAAAA,EAAQC,GAAOC,GAAO;AACrC,SAAAC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es175.js","sources":["../../../node_modules/d3-geo/src/transform.js"],"sourcesContent":["export default function(methods) {\n  return {\n    stream: transformer(methods)\n  };\n}\n\nexport function transformer(methods) {\n  return function(stream) {\n    var s = new TransformStream;\n    for (var key in methods) s[key] = methods[key];\n    s.stream = stream;\n    return s;\n  };\n}\n\nfunction TransformStream() {}\n\nTransformStream.prototype = {\n  constructor: TransformStream,\n  point: function(x, y) { this.stream.point(x, y); },\n  sphere: function() { this.stream.sphere(); },\n  lineStart: function() { this.stream.lineStart(); },\n  lineEnd: function() { this.stream.lineEnd(); },\n  polygonStart: function() { this.stream.polygonStart(); },\n  polygonEnd: function() { this.stream.polygonEnd(); }\n};\n"],"names":["transformer","methods","stream","s","TransformStream","key","x","y"],"mappings":"AAMO,SAASA,EAAYC,GAAS;AACnC,SAAO,SAASC,GAAQ;AACtB,QAAIC,IAAI,IAAIC;AACZ,aAASC,KAAOJ;AAAW,MAAAE,EAAAE,CAAG,IAAIJ,EAAQI,CAAG;AAC7C,WAAAF,EAAE,SAASD,GACJC;AAAA,EAAA;AAEX;AAEA,SAASC,IAAkB;AAAC;AAE5BA,EAAgB,YAAY;AAAA,EAC1B,aAAaA;AAAA,EACb,OAAO,SAASE,GAAGC,GAAG;AAAO,SAAA,OAAO,MAAMD,GAAGC,CAAC;AAAA,EAAG;AAAA,EACjD,QAAQ,WAAW;AAAE,SAAK,OAAO;EAAU;AAAA,EAC3C,WAAW,WAAW;AAAE,SAAK,OAAO;EAAa;AAAA,EACjD,SAAS,WAAW;AAAE,SAAK,OAAO;EAAW;AAAA,EAC7C,cAAc,WAAW;AAAE,SAAK,OAAO;EAAgB;AAAA,EACvD,YAAY,WAAW;AAAE,SAAK,OAAO;EAAc;AACrD;","x_google_ignoreList":[0]}

package/dist/index.es176.js

@@ -1,16 +1,16 @@
-import b from "./index.es86.js";
-import q from "./index.es221.js";
-import B from "./index.es212.js";
-import r from "./index.es156.js";
-function w(l, p, f, g) {
-  b(p) || (g = f, f = p, p = !1), f != null && (f = q(f, g));
-  for (var s = [], h = [], o = 0, u = B(l); o < u; o++) {
-    var n = l[o], m = f ? f(n, o, l) : n;
-    p && !f ? ((!o || h !== m) && s.push(n), h = m) : f ? r(h, m) || (h.push(m), s.push(n)) : r(s, n) || s.push(n);
-  }
-  return s;
-}
+import { asin as t, sqrt as i } from "./index.es232.js";
+import { azimuthalInvert as a, azimuthalRaw as m } from "./index.es238.js";
+import "./index.es171.js";
+import "./index.es170.js";
+import "./index.es169.js";
+import "./index.es175.js";
+var o = m(function(r) {
+  return i(2 / (1 + r));
+});
+o.invert = a(function(r) {
+  return 2 * t(r / 2);
+});
 export {
-  w as default
+  o as azimuthalEqualAreaRaw
 };
 //# sourceMappingURL=index.es176.js.map

package/dist/index.es176.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es176.js","sources":["../../../node_modules/underscore/modules/uniq.js"],"sourcesContent":["import isBoolean from './isBoolean.js';\nimport cb from './_cb.js';\nimport getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce a duplicate-free version of the array. If the array has already\n// been sorted, you have the option of using a faster algorithm.\n// The faster algorithm will not work with an iteratee if the iteratee\n// is not a one-to-one function, so providing an iteratee will disable\n// the faster algorithm.\nexport default function uniq(array, isSorted, iteratee, context) {\n  if (!isBoolean(isSorted)) {\n    context = iteratee;\n    iteratee = isSorted;\n    isSorted = false;\n  }\n  if (iteratee != null) iteratee = cb(iteratee, context);\n  var result = [];\n  var seen = [];\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var value = array[i],\n        computed = iteratee ? iteratee(value, i, array) : value;\n    if (isSorted && !iteratee) {\n      if (!i || seen !== computed) result.push(value);\n      seen = computed;\n    } else if (iteratee) {\n      if (!contains(seen, computed)) {\n        seen.push(computed);\n        result.push(value);\n      }\n    } else if (!contains(result, value)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n"],"names":["uniq","array","isSorted","iteratee","context","isBoolean","cb","result","seen","i","length","getLength","value","computed","contains"],"mappings":";;;;AAUA,SAAwBA,EAAKC,GAAOC,GAAUC,GAAUC,GAAS;AAC3D,EAACC,EAAUH,CAAQ,MACXE,IAAAD,GACCA,IAAAD,GACAA,IAAA,KAETC,KAAY,SAAiBA,IAAAG,EAAGH,GAAUC,CAAO;AAG5C,WAFLG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AAClD,IAAAV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GACvCJ,IAAAK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es176.js","sources":["../../../node_modules/d3-geo/src/projection/azimuthalEqualArea.js"],"sourcesContent":["import {asin, sqrt} from \"../math\";\nimport {azimuthalRaw, azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport var azimuthalEqualAreaRaw = azimuthalRaw(function(cxcy) {\n  return sqrt(2 / (1 + cxcy));\n});\n\nazimuthalEqualAreaRaw.invert = azimuthalInvert(function(z) {\n  return 2 * asin(z / 2);\n});\n\nexport default function() {\n  return projection(azimuthalEqualAreaRaw)\n      .scale(124.75)\n      .clipAngle(180 - 1e-3);\n}\n"],"names":["azimuthalEqualAreaRaw","azimuthalRaw","cxcy","sqrt","azimuthalInvert","z","asin"],"mappings":";;;;;;AAIW,IAAAA,IAAwBC,EAAa,SAASC,GAAM;AACtD,SAAAC,EAAK,KAAK,IAAID,EAAK;AAC5B,CAAC;AAEDF,EAAsB,SAASI,EAAgB,SAASC,GAAG;AAClD,SAAA,IAAIC,EAAKD,IAAI,CAAC;AACvB,CAAC;","x_google_ignoreList":[0]}

package/dist/index.es177.js

@@ -1,18 +1,17 @@
-import u from "./index.es212.js";
-import f from "./index.es156.js";
-function v(o) {
-  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
-    var e = o[n];
-    if (!f(t, e)) {
-      var r;
-      for (r = 1; r < a && f(arguments[r], e); r++)
-        ;
-      r === a && t.push(e);
-    }
-  }
+import { acos as r, sin as a } from "./index.es232.js";
+import { azimuthalInvert as n, azimuthalRaw as o } from "./index.es238.js";
+import u from "./index.es239.js";
+var i = o(function(t) {
+  return (t = r(t)) && t / a(t);
+});
+i.invert = n(function(t) {
   return t;
+});
+function f() {
+  return u(i).scale(79.4188).clipAngle(180 - 1e-3);
 }
 export {
-  v as default
+  i as azimuthalEquidistantRaw,
+  f as default
 };
 //# sourceMappingURL=index.es177.js.map

package/dist/index.es177.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es177.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es177.js","sources":["../../../node_modules/d3-geo/src/projection/azimuthalEquidistant.js"],"sourcesContent":["import {acos, sin} from \"../math\";\nimport {azimuthalRaw, azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport var azimuthalEquidistantRaw = azimuthalRaw(function(c) {\n  return (c = acos(c)) && c / sin(c);\n});\n\nazimuthalEquidistantRaw.invert = azimuthalInvert(function(z) {\n  return z;\n});\n\nexport default function() {\n  return projection(azimuthalEquidistantRaw)\n      .scale(79.4188)\n      .clipAngle(180 - 1e-3);\n}\n"],"names":["azimuthalEquidistantRaw","azimuthalRaw","c","acos","sin","azimuthalInvert","z","geoAzimuthalEquidistant","projection"],"mappings":";;;AAIW,IAAAA,IAA0BC,EAAa,SAASC,GAAG;AAC5D,UAAQA,IAAIC,EAAKD,CAAC,MAAMA,IAAIE,EAAIF,CAAC;AACnC,CAAC;AAEDF,EAAwB,SAASK,EAAgB,SAASC,GAAG;AACpD,SAAAA;AACT,CAAC;AAEyB,SAAAC,IAAA;AACjB,SAAAC,EAAWR,CAAuB,EACpC,MAAM,OAAO,EACb,UAAU,MAAM,IAAI;AAC3B;","x_google_ignoreList":[0]}

package/dist/index.es178.js

@@ -1,12 +1,12 @@
-import f from "./index.es159.js";
-import p from "./index.es212.js";
-import u from "./index.es157.js";
-function n(t) {
-  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
-    m[r] = u(t, r);
-  return m;
+import "./index.es171.js";
+import "./index.es170.js";
+import "./index.es169.js";
+import "./index.es175.js";
+function r(t, i) {
+  return [t, i];
 }
+r.invert = r;
 export {
-  n as default
+  r as equirectangularRaw
 };
 //# sourceMappingURL=index.es178.js.map

package/dist/index.es178.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es178.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es178.js","sources":["../../../node_modules/d3-geo/src/projection/equirectangular.js"],"sourcesContent":["import projection from \"./index\";\n\nexport function equirectangularRaw(lambda, phi) {\n  return [lambda, phi];\n}\n\nequirectangularRaw.invert = equirectangularRaw;\n\nexport default function() {\n  return projection(equirectangularRaw)\n      .scale(152.63);\n}\n"],"names":["equirectangularRaw","lambda","phi"],"mappings":";;;;AAEgB,SAAAA,EAAmBC,GAAQC,GAAK;AACvC,SAAA,CAACD,GAAQC,CAAG;AACrB;AAEAF,EAAmB,SAASA;","x_google_ignoreList":[0]}

package/dist/index.es179.js

@@ -1,10 +1,31 @@
-import n from "./index.es212.js";
-function u(e, t) {
-  for (var o = {}, r = 0, f = n(e); r < f; r++)
-    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
-  return o;
+import { __exports as a } from "./index.es225.js";
+function i(r, s) {
+  for (var o = 0; o < s.length; o++) {
+    const e = s[o];
+    if (typeof e != "string" && !Array.isArray(e)) {
+      for (const t in e)
+        if (t !== "default" && !(t in r)) {
+          const n = Object.getOwnPropertyDescriptor(e, t);
+          n && Object.defineProperty(r, t, n.get ? n : {
+            enumerable: !0,
+            get: () => e[t]
+          });
+        }
+    }
+  }
+  return Object.freeze(Object.defineProperty(r, Symbol.toStringTag, { value: "Module" }));
 }
+var f = a.printMsg = function() {
+  console.log("This is a message from the demo package");
+};
+const p = /* @__PURE__ */ i({
+  __proto__: null,
+  default: a,
+  printMsg: f
+}, [a]);
 export {
-  u as default
+  a as default,
+  p as i,
+  f as printMsg
 };
 //# sourceMappingURL=index.es179.js.map

package/dist/index.es179.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es179.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es179.js","sources":["../../../node_modules/mapbox-gl/index.js"],"sourcesContent":["exports.printMsg = function() {\r\n    console.log(\"This is a message from the demo package\");\r\n  }"],"names":["printMsg","mapboxGl"],"mappings":";;;;;;;;;;;;;;;;;AAAA,IAAAA,IAAAC,EAAA,WAAmB,WAAW;AAC1B,UAAQ,IAAI,yCAAyC;AACvD;;;;;;","x_google_ignoreList":[0]}

package/dist/index.es180.js

@@ -1,10 +1,58 @@
-function u(n, a, r) {
-  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
-  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
-    e[f] = n;
-  return e;
+import * as l from "react";
+import { useContext as b, useState as E, useRef as c, useEffect as x, useImperativeHandle as w, useMemo as y } from "react";
+import { MountedMapsContext as L } from "./index.es190.js";
+import m from "./index.es218.js";
+import I from "./index.es219.js";
+import C from "./index.es220.js";
+import g from "./index.es221.js";
+const R = l.createContext(null);
+function A(e, f, d) {
+  const o = b(L), [i, p] = E(null), s = c(), { current: a } = c({ mapLib: null, map: null });
+  x(() => {
+    const v = e.mapLib;
+    let u = !0, n;
+    return Promise.resolve(v || d).then((r) => {
+      if (!u)
+        return;
+      if (!r)
+        throw new Error("Invalid mapLib");
+      const t = "Map" in r ? r : r.default;
+      if (!t.Map)
+        throw new Error("Invalid mapLib");
+      if (g(t, e), !t.supported || t.supported(e))
+        e.reuseMaps && (n = m.reuse(e, s.current)), n || (n = new m(t.Map, e, s.current)), a.map = I(n), a.mapLib = t, p(n), o == null || o.onMapMount(a.map, e.id);
+      else
+        throw new Error("Map is not supported by this browser");
+    }).catch((r) => {
+      const { onError: t } = e;
+      t ? t({
+        type: "error",
+        target: null,
+        originalEvent: null,
+        error: r
+      }) : console.error(r);
+    }), () => {
+      u = !1, n && (o == null || o.onMapUnmount(e.id), e.reuseMaps ? n.recycle() : n.destroy());
+    };
+  }, []), C(() => {
+    i && i.setProps(e);
+  }), w(f, () => a.map, [i]);
+  const M = y(() => ({
+    position: "relative",
+    width: "100%",
+    height: "100%",
+    ...e.style
+  }), [e.style]), h = {
+    height: "100%"
+  };
+  return l.createElement("div", { id: e.id, ref: s, style: M }, i && l.createElement(
+    R.Provider,
+    { value: a },
+    l.createElement("div", { "mapboxgl-children": "", style: h }, e.children)
+  ));
 }
 export {
-  u as default
+  R as MapContext,
+  A as default
 };
 //# sourceMappingURL=index.es180.js.map

package/dist/index.es180.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es180.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es180.js","sources":["../../../node_modules/react-map-gl/dist/esm/components/map.js"],"sourcesContent":["import * as React from 'react';\nimport { useState, useRef, useEffect, useContext, useMemo, useImperativeHandle } from 'react';\nimport { MountedMapsContext } from './use-map';\nimport Mapbox from '../mapbox/mapbox';\nimport createRef from '../mapbox/create-ref';\nimport useIsomorphicLayoutEffect from '../utils/use-isomorphic-layout-effect';\nimport setGlobals from '../utils/set-globals';\nexport const MapContext = React.createContext(null);\nexport default function Map(props, ref, defaultLib) {\n    const mountedMapsContext = useContext(MountedMapsContext);\n    const [mapInstance, setMapInstance] = useState(null);\n    const containerRef = useRef();\n    const { current: contextValue } = useRef({ mapLib: null, map: null });\n    useEffect(() => {\n        const mapLib = props.mapLib;\n        let isMounted = true;\n        let mapbox;\n        Promise.resolve(mapLib || defaultLib)\n            .then((module) => {\n            if (!isMounted) {\n                return;\n            }\n            if (!module) {\n                throw new Error('Invalid mapLib');\n            }\n            const mapboxgl = 'Map' in module ? module : module.default;\n            if (!mapboxgl.Map) {\n                throw new Error('Invalid mapLib');\n            }\n            // workerUrl & workerClass may change the result of supported()\n            // https://github.com/visgl/react-map-gl/discussions/2027\n            setGlobals(mapboxgl, props);\n            if (!mapboxgl.supported || mapboxgl.supported(props)) {\n                if (props.reuseMaps) {\n                    mapbox = Mapbox.reuse(props, containerRef.current);\n                }\n                if (!mapbox) {\n                    mapbox = new Mapbox(mapboxgl.Map, props, containerRef.current);\n                }\n                contextValue.map = createRef(mapbox);\n                contextValue.mapLib = mapboxgl;\n                setMapInstance(mapbox);\n                mountedMapsContext === null || mountedMapsContext === void 0 ? void 0 : mountedMapsContext.onMapMount(contextValue.map, props.id);\n            }\n            else {\n                throw new Error('Map is not supported by this browser');\n            }\n        })\n            .catch(error => {\n            const { onError } = props;\n            if (onError) {\n                onError({\n                    type: 'error',\n                    target: null,\n                    originalEvent: null,\n                    error\n                });\n            }\n            else {\n                console.error(error); // eslint-disable-line\n            }\n        });\n        return () => {\n            isMounted = false;\n            if (mapbox) {\n                mountedMapsContext === null || mountedMapsContext === void 0 ? void 0 : mountedMapsContext.onMapUnmount(props.id);\n                if (props.reuseMaps) {\n                    mapbox.recycle();\n                }\n                else {\n                    mapbox.destroy();\n                }\n            }\n        };\n    }, []);\n    useIsomorphicLayoutEffect(() => {\n        if (mapInstance) {\n            mapInstance.setProps(props);\n        }\n    });\n    useImperativeHandle(ref, () => contextValue.map, [mapInstance]);\n    const style = useMemo(() => ({\n        position: 'relative',\n        width: '100%',\n        height: '100%',\n        ...props.style\n    }), [props.style]);\n    const CHILD_CONTAINER_STYLE = {\n        height: '100%'\n    };\n    return (React.createElement(\"div\", { id: props.id, ref: containerRef, style: style }, mapInstance && (React.createElement(MapContext.Provider, { value: contextValue },\n        React.createElement(\"div\", { \"mapboxgl-children\": \"\", style: CHILD_CONTAINER_STYLE }, props.children)))));\n}\n//# sourceMappingURL=map.js.map"],"names":["MapContext","React","Map","props","ref","defaultLib","mountedMapsContext","useContext","MountedMapsContext","mapInstance","setMapInstance","useState","containerRef","useRef","contextValue","useEffect","mapLib","isMounted","mapbox","module","mapboxgl","setGlobals","Mapbox","createRef","error","onError","useIsomorphicLayoutEffect","useImperativeHandle","style","useMemo","CHILD_CONTAINER_STYLE"],"mappings":";;;;;;;AAOa,MAAAA,IAAaC,EAAM,cAAc,IAAI;AAC1B,SAAAC,EAAIC,GAAOC,GAAKC,GAAY;AAC1C,QAAAC,IAAqBC,EAAWC,CAAkB,GAClD,CAACC,GAAaC,CAAc,IAAIC,EAAS,IAAI,GAC7CC,IAAeC,KACf,EAAE,SAASC,EAAA,IAAiBD,EAAO,EAAE,QAAQ,MAAM,KAAK,KAAA,CAAM;AACpE,EAAAE,EAAU,MAAM;AACZ,UAAMC,IAASb,EAAM;AACrB,QAAIc,IAAY,IACZC;AACJ,mBAAQ,QAAQF,KAAUX,CAAU,EAC/B,KAAK,CAACc,MAAW;AAClB,UAAI,CAACF;AACD;AAEJ,UAAI,CAACE;AACK,cAAA,IAAI,MAAM,gBAAgB;AAEpC,YAAMC,IAAW,SAASD,IAASA,IAASA,EAAO;AAC/C,UAAA,CAACC,EAAS;AACJ,cAAA,IAAI,MAAM,gBAAgB;AAKpC,UADAC,EAAWD,GAAUjB,CAAK,GACtB,CAACiB,EAAS,aAAaA,EAAS,UAAUjB,CAAK;AAC/C,QAAIA,EAAM,cACNe,IAASI,EAAO,MAAMnB,GAAOS,EAAa,OAAO,IAEhDM,MACDA,IAAS,IAAII,EAAOF,EAAS,KAAKjB,GAAOS,EAAa,OAAO,IAEpDE,EAAA,MAAMS,EAAUL,CAAM,GACnCJ,EAAa,SAASM,GACtBV,EAAeQ,CAAM,GACEZ,KAAA,QAAiDA,EAAmB,WAAWQ,EAAa,KAAKX,EAAM,EAAE;AAAA;AAG1H,cAAA,IAAI,MAAM,sCAAsC;AAAA,IAC1D,CACH,EACI,MAAM,CAASqB,MAAA;AACV,YAAA,EAAE,SAAAC,EAAY,IAAAtB;AACpB,MAAIsB,IACQA,EAAA;AAAA,QACJ,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,eAAe;AAAA,QACf,OAAAD;AAAA,MAAA,CACH,IAGD,QAAQ,MAAMA,CAAK;AAAA,IACvB,CACH,GACM,MAAM;AACG,MAAAP,IAAA,IACRC,MACAZ,KAAuB,QAAiDA,EAAmB,aAAaH,EAAM,EAAE,GAC5GA,EAAM,YACNe,EAAO,QAAQ,IAGfA,EAAO,QAAQ;AAAA,IAEvB;AAAA,EAER,GAAG,CAAE,CAAA,GACLQ,EAA0B,MAAM;AAC5B,IAAIjB,KACAA,EAAY,SAASN,CAAK;AAAA,EAC9B,CACH,GACDwB,EAAoBvB,GAAK,MAAMU,EAAa,KAAK,CAACL,CAAW,CAAC;AACxD,QAAAmB,IAAQC,EAAQ,OAAO;AAAA,IACzB,UAAU;AAAA,IACV,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,GAAG1B,EAAM;AAAA,EACT,IAAA,CAACA,EAAM,KAAK,CAAC,GACX2B,IAAwB;AAAA,IAC1B,QAAQ;AAAA,EAAA;AAEZ,SAAQ7B,EAAM,cAAc,OAAO,EAAE,IAAIE,EAAM,IAAI,KAAKS,GAAc,OAAAgB,EAAgB,GAAAnB,KAAgBR,EAAM;AAAA,IAAcD,EAAW;AAAA,IAAU,EAAE,OAAOc,EAAa;AAAA,IACjKb,EAAM,cAAc,OAAO,EAAE,qBAAqB,IAAI,OAAO6B,EAAA,GAAyB3B,EAAM,QAAQ;AAAA,EAAA,CAAG;AAC/G;","x_google_ignoreList":[0]}