@performant-software/geospatial 2.1.0-beta.5 → 2.1.0-beta.50

package/dist/index.es179.js

@@ -1,4 +1,19 @@
-import r from "./index.es231.js";
-r();
-r();
+const s = [
+  "baseApiUrl",
+  "maxParallelImageRequests",
+  "workerClass",
+  "workerCount",
+  "workerUrl"
+];
+function a(e, l) {
+  for (const t of s)
+    t in l && (e[t] = l[t]);
+  const { RTLTextPlugin: o = "https://api.mapbox.com/mapbox-gl-js/plugins/mapbox-gl-rtl-text/v0.2.3/mapbox-gl-rtl-text.js" } = l;
+  o && e.getRTLTextPluginStatus && e.getRTLTextPluginStatus() === "unavailable" && e.setRTLTextPlugin(o, (t) => {
+    t && console.error(t);
+  }, !0);
+}
+export {
+  a as default
+};
 //# sourceMappingURL=index.es179.js.map

package/dist/index.es179.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es179.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]}
+{"version":3,"file":"index.es179.js","sources":["../../../node_modules/react-map-gl/dist/esm/utils/set-globals.js"],"sourcesContent":["const globalSettings = [\n    'baseApiUrl',\n    'maxParallelImageRequests',\n    'workerClass',\n    'workerCount',\n    'workerUrl'\n];\nexport default function setGlobals(mapLib, props) {\n    for (const key of globalSettings) {\n        if (key in props) {\n            mapLib[key] = props[key];\n        }\n    }\n    const { RTLTextPlugin = 'https://api.mapbox.com/mapbox-gl-js/plugins/mapbox-gl-rtl-text/v0.2.3/mapbox-gl-rtl-text.js' } = props;\n    if (RTLTextPlugin &&\n        mapLib.getRTLTextPluginStatus &&\n        mapLib.getRTLTextPluginStatus() === 'unavailable') {\n        mapLib.setRTLTextPlugin(RTLTextPlugin, (error) => {\n            if (error) {\n                // eslint-disable-next-line\n                console.error(error);\n            }\n        }, true);\n    }\n}\n//# sourceMappingURL=set-globals.js.map"],"names":["globalSettings","setGlobals","mapLib","props","key","RTLTextPlugin","error"],"mappings":"AAAA,MAAMA,IAAiB;AAAA,EACnB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACJ;AACwB,SAAAC,EAAWC,GAAQC,GAAO;AAC9C,aAAWC,KAAOJ;AACd,IAAII,KAAOD,MACAD,EAAAE,CAAG,IAAID,EAAMC,CAAG;AAGzB,QAAA,EAAE,eAAAC,IAAgB,8FAAkG,IAAAF;AAC1H,EAAIE,KACAH,EAAO,0BACPA,EAAO,6BAA6B,iBAC7BA,EAAA,iBAAiBG,GAAe,CAACC,MAAU;AAC9C,IAAIA,KAEA,QAAQ,MAAMA,CAAK;AAAA,KAExB,EAAI;AAEf;","x_google_ignoreList":[0]}

package/dist/index.es18.js

@@ -1,13 +1,31 @@
-import e from "./index.es199.js";
-import n from "./index.es200.js";
-var t = e("Arguments");
-(function() {
-  t(arguments) || (t = function(r) {
-    return n(r, "callee");
-  });
-})();
-const o = t;
+var o = "1.13.6", a = typeof self == "object" && self.self === self && self || typeof global == "object" && global.global === global && global || Function("return this")() || {}, r = Array.prototype, e = Object.prototype, i = typeof Symbol < "u" ? Symbol.prototype : null, n = r.push, s = r.slice, l = e.toString, p = e.hasOwnProperty, t = typeof ArrayBuffer < "u", y = typeof DataView < "u", f = Array.isArray, u = Object.keys, b = Object.create, v = t && ArrayBuffer.isView, g = isNaN, A = isFinite, c = !{ toString: null }.propertyIsEnumerable("toString"), O = [
+  "valueOf",
+  "isPrototypeOf",
+  "toString",
+  "propertyIsEnumerable",
+  "hasOwnProperty",
+  "toLocaleString"
+], S = Math.pow(2, 53) - 1;
 export {
-  o as default
+  r as ArrayProto,
+  S as MAX_ARRAY_INDEX,
+  e as ObjProto,
+  i as SymbolProto,
+  o as VERSION,
+  A as _isFinite,
+  g as _isNaN,
+  c as hasEnumBug,
+  p as hasOwnProperty,
+  b as nativeCreate,
+  f as nativeIsArray,
+  v as nativeIsView,
+  u as nativeKeys,
+  O as nonEnumerableProps,
+  n as push,
+  a as root,
+  s as slice,
+  t as supportsArrayBuffer,
+  y as supportsDataView,
+  l as toString
 };
 //# sourceMappingURL=index.es18.js.map

package/dist/index.es18.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es18.js","sources":["../../../node_modules/underscore/modules/isArguments.js"],"sourcesContent":["import tagTester from './_tagTester.js';\nimport has from './_has.js';\n\nvar isArguments = tagTester('Arguments');\n\n// Define a fallback version of the method in browsers (ahem, IE < 9), where\n// there isn't any inspectable \"Arguments\" type.\n(function() {\n  if (!isArguments(arguments)) {\n    isArguments = function(obj) {\n      return has(obj, 'callee');\n    };\n  }\n}());\n\nexport default isArguments;\n"],"names":["isArguments","tagTester","obj","has","isArguments$1"],"mappings":";;AAGA,IAAIA,IAAcC,EAAU,WAAW;AAAA,CAItC,WAAW;AACN,EAACD,EAAY,SAAS,MACxBA,IAAc,SAASE,GAAK;AACnB,WAAAC,EAAID,GAAK,QAAQ;AAAA,EAAA;AAG9B;AAEA,MAAAE,IAAeJ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es18.js","sources":["../../../node_modules/underscore/modules/_setup.js"],"sourcesContent":["// Current version.\nexport var VERSION = '1.13.6';\n\n// Establish the root object, `window` (`self`) in the browser, `global`\n// on the server, or `this` in some virtual machines. We use `self`\n// instead of `window` for `WebWorker` support.\nexport var root = (typeof self == 'object' && self.self === self && self) ||\n          (typeof global == 'object' && global.global === global && global) ||\n          Function('return this')() ||\n          {};\n\n// Save bytes in the minified (but not gzipped) version:\nexport var ArrayProto = Array.prototype, ObjProto = Object.prototype;\nexport var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;\n\n// Create quick reference variables for speed access to core prototypes.\nexport var push = ArrayProto.push,\n    slice = ArrayProto.slice,\n    toString = ObjProto.toString,\n    hasOwnProperty = ObjProto.hasOwnProperty;\n\n// Modern feature detection.\nexport var supportsArrayBuffer = typeof ArrayBuffer !== 'undefined',\n    supportsDataView = typeof DataView !== 'undefined';\n\n// All **ECMAScript 5+** native function implementations that we hope to use\n// are declared here.\nexport var nativeIsArray = Array.isArray,\n    nativeKeys = Object.keys,\n    nativeCreate = Object.create,\n    nativeIsView = supportsArrayBuffer && ArrayBuffer.isView;\n\n// Create references to these builtin functions because we override them.\nexport var _isNaN = isNaN,\n    _isFinite = isFinite;\n\n// Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.\nexport var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');\nexport var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',\n  'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n\n// The largest integer that can be represented exactly.\nexport var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;\n"],"names":["VERSION","root","ArrayProto","ObjProto","SymbolProto","push","slice","toString","hasOwnProperty","supportsArrayBuffer","supportsDataView","nativeIsArray","nativeKeys","nativeCreate","nativeIsView","_isNaN","_isFinite","hasEnumBug","nonEnumerableProps","MAX_ARRAY_INDEX"],"mappings":"AACO,IAAIA,IAAU,UAKVC,IAAQ,OAAO,QAAQ,YAAY,KAAK,SAAS,QAAQ,QACzD,OAAO,UAAU,YAAY,OAAO,WAAW,UAAU,UAC1D,SAAS,aAAa,EAAA,KACtB,CAAC,GAGAC,IAAa,MAAM,WAAWC,IAAW,OAAO,WAChDC,IAAc,OAAO,SAAW,MAAc,OAAO,YAAY,MAGjEC,IAAOH,EAAW,MACzBI,IAAQJ,EAAW,OACnBK,IAAWJ,EAAS,UACpBK,IAAiBL,EAAS,gBAGnBM,IAAsB,OAAO,cAAgB,KACpDC,IAAmB,OAAO,WAAa,KAIhCC,IAAgB,MAAM,SAC7BC,IAAa,OAAO,MACpBC,IAAe,OAAO,QACtBC,IAAeL,KAAuB,YAAY,QAG3CM,IAAS,OAChBC,IAAY,UAGLC,IAAa,CAAC,EAAC,UAAU,KAAI,EAAE,qBAAqB,UAAU,GAC9DC,IAAqB;AAAA,EAAC;AAAA,EAAW;AAAA,EAAiB;AAAA,EAC3D;AAAA,EAAwB;AAAA,EAAkB;AAAgB,GAGjDC,IAAkB,KAAK,IAAI,GAAG,EAAE,IAAI;","x_google_ignoreList":[0]}

package/dist/index.es180.js

@@ -1,4 +1,14 @@
-import r from "./index.es231.js";
-import "./index.es179.js";
-r();
+const r = /box|flex|grid|column|lineHeight|fontWeight|opacity|order|tabSize|zIndex/;
+function c(n, t) {
+  if (!n || !t)
+    return;
+  const o = n.style;
+  for (const e in t) {
+    const i = t[e];
+    Number.isFinite(i) && !r.test(e) ? o[e] = `${i}px` : o[e] = i;
+  }
+}
+export {
+  c as applyReactStyle
+};
 //# sourceMappingURL=index.es180.js.map

package/dist/index.es180.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es180.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]}
+{"version":3,"file":"index.es180.js","sources":["../../../node_modules/react-map-gl/dist/esm/utils/apply-react-style.js"],"sourcesContent":["// This is a simplified version of\n// https://github.com/facebook/react/blob/4131af3e4bf52f3a003537ec95a1655147c81270/src/renderers/dom/shared/CSSPropertyOperations.js#L62\nconst unitlessNumber = /box|flex|grid|column|lineHeight|fontWeight|opacity|order|tabSize|zIndex/;\nexport function applyReactStyle(element, styles) {\n    if (!element || !styles) {\n        return;\n    }\n    const style = element.style;\n    for (const key in styles) {\n        const value = styles[key];\n        if (Number.isFinite(value) && !unitlessNumber.test(key)) {\n            style[key] = `${value}px`;\n        }\n        else {\n            style[key] = value;\n        }\n    }\n}\n//# sourceMappingURL=apply-react-style.js.map"],"names":["unitlessNumber","applyReactStyle","element","styles","style","key","value"],"mappings":"AAEA,MAAMA,IAAiB;AACP,SAAAC,EAAgBC,GAASC,GAAQ;AACzC,MAAA,CAACD,KAAW,CAACC;AACb;AAEJ,QAAMC,IAAQF,EAAQ;AACtB,aAAWG,KAAOF,GAAQ;AAChB,UAAAG,IAAQH,EAAOE,CAAG;AACpB,IAAA,OAAO,SAASC,CAAK,KAAK,CAACN,EAAe,KAAKK,CAAG,IAC5CD,EAAAC,CAAG,IAAI,GAAGC,CAAK,OAGrBF,EAAMC,CAAG,IAAIC;AAAA,EAErB;AACJ;","x_google_ignoreList":[0]}

package/dist/index.es181.js

@@ -1,39 +1,34 @@
-import A from "./index.es244.js";
-import { pi as z, tau as p, atan2 as I, asin as P, cos as t, sin as i } from "./index.es234.js";
-function R(r, n) {
-  return [r > z ? r - p : r < -z ? r + p : r, n];
+function i(e, r) {
+  const t = Array.isArray(e) ? e[0] : e ? e.x : 0, s = Array.isArray(e) ? e[1] : e ? e.y : 0, n = Array.isArray(r) ? r[0] : r ? r.x : 0, f = Array.isArray(r) ? r[1] : r ? r.y : 0;
+  return t === n && s === f;
 }
-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)
-    ];
+function y(e, r) {
+  if (e === r)
+    return !0;
+  if (!e || !r)
+    return !1;
+  if (Array.isArray(e)) {
+    if (!Array.isArray(r) || e.length !== r.length)
+      return !1;
+    for (let t = 0; t < e.length; t++)
+      if (!y(e[t], r[t]))
+        return !1;
+    return !0;
+  } else if (Array.isArray(r))
+    return !1;
+  if (typeof e == "object" && typeof r == "object") {
+    const t = Object.keys(e), s = Object.keys(r);
+    if (t.length !== s.length)
+      return !1;
+    for (const n of t)
+      if (!r.hasOwnProperty(n) || !y(e[n], r[n]))
+        return !1;
+    return !0;
   }
-  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;
+  return !1;
 }
 export {
-  E as rotateRadians
+  i as arePointsEqual,
+  y as deepEqual
 };
 //# sourceMappingURL=index.es181.js.map

package/dist/index.es181.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es181.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]}
+{"version":3,"file":"index.es181.js","sources":["../../../node_modules/react-map-gl/dist/esm/utils/deep-equal.js"],"sourcesContent":["/**\n * Compare two points\n * @param a\n * @param b\n * @returns true if the points are equal\n */\nexport function arePointsEqual(a, b) {\n    const ax = Array.isArray(a) ? a[0] : a ? a.x : 0;\n    const ay = Array.isArray(a) ? a[1] : a ? a.y : 0;\n    const bx = Array.isArray(b) ? b[0] : b ? b.x : 0;\n    const by = Array.isArray(b) ? b[1] : b ? b.y : 0;\n    return ax === bx && ay === by;\n}\n/* eslint-disable complexity */\n/**\n * Compare any two objects\n * @param a\n * @param b\n * @returns true if the objects are deep equal\n */\nexport function deepEqual(a, b) {\n    if (a === b) {\n        return true;\n    }\n    if (!a || !b) {\n        return false;\n    }\n    if (Array.isArray(a)) {\n        if (!Array.isArray(b) || a.length !== b.length) {\n            return false;\n        }\n        for (let i = 0; i < a.length; i++) {\n            if (!deepEqual(a[i], b[i])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    else if (Array.isArray(b)) {\n        return false;\n    }\n    if (typeof a === 'object' && typeof b === 'object') {\n        const aKeys = Object.keys(a);\n        const bKeys = Object.keys(b);\n        if (aKeys.length !== bKeys.length) {\n            return false;\n        }\n        for (const key of aKeys) {\n            if (!b.hasOwnProperty(key)) {\n                return false;\n            }\n            if (!deepEqual(a[key], b[key])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    return false;\n}\n//# sourceMappingURL=deep-equal.js.map"],"names":["arePointsEqual","a","b","ax","ay","bx","by","deepEqual","i","aKeys","bKeys","key"],"mappings":"AAMgB,SAAAA,EAAeC,GAAGC,GAAG;AAC3B,QAAAC,IAAK,MAAM,QAAQF,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI,GACzCG,IAAK,MAAM,QAAQH,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI,GACzCI,IAAK,MAAM,QAAQH,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI,GACzCI,IAAK,MAAM,QAAQJ,CAAC,IAAIA,EAAE,CAAC,IAAIA,IAAIA,EAAE,IAAI;AACxC,SAAAC,MAAOE,KAAMD,MAAOE;AAC/B;AAQgB,SAAAC,EAAUN,GAAGC,GAAG;AAC5B,MAAID,MAAMC;AACC,WAAA;AAEP,MAAA,CAACD,KAAK,CAACC;AACA,WAAA;AAEP,MAAA,MAAM,QAAQD,CAAC,GAAG;AACd,QAAA,CAAC,MAAM,QAAQC,CAAC,KAAKD,EAAE,WAAWC,EAAE;AAC7B,aAAA;AAEX,aAASM,IAAI,GAAGA,IAAIP,EAAE,QAAQO;AACtB,UAAA,CAACD,EAAUN,EAAEO,CAAC,GAAGN,EAAEM,CAAC,CAAC;AACd,eAAA;AAGR,WAAA;AAAA,EAEF,WAAA,MAAM,QAAQN,CAAC;AACb,WAAA;AAEX,MAAI,OAAOD,KAAM,YAAY,OAAOC,KAAM,UAAU;AAC1C,UAAAO,IAAQ,OAAO,KAAKR,CAAC,GACrBS,IAAQ,OAAO,KAAKR,CAAC;AACvB,QAAAO,EAAM,WAAWC,EAAM;AAChB,aAAA;AAEX,eAAWC,KAAOF;AAIV,UAHA,CAACP,EAAE,eAAeS,CAAG,KAGrB,CAACJ,EAAUN,EAAEU,CAAG,GAAGT,EAAES,CAAG,CAAC;AAClB,eAAA;AAGR,WAAA;AAAA,EACX;AACO,SAAA;AACX;","x_google_ignoreList":[0]}

package/dist/index.es182.js

@@ -1,4 +1,8 @@
-import o from "./index.es253.js";
-import r from "./index.es254.js";
-r(o);
+function e(r, t) {
+  if (!r)
+    throw new Error(t);
+}
+export {
+  e as default
+};
 //# sourceMappingURL=index.es182.js.map

package/dist/index.es182.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es182.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]}
+{"version":3,"file":"index.es182.js","sources":["../../../node_modules/react-map-gl/dist/esm/utils/assert.js"],"sourcesContent":["export default function assert(condition, message) {\n    if (!condition) {\n        throw new Error(message);\n    }\n}\n//# sourceMappingURL=assert.js.map"],"names":["assert","condition","message"],"mappings":"AAAwB,SAAAA,EAAOC,GAAWC,GAAS;AAC/C,MAAI,CAACD;AACK,UAAA,IAAI,MAAMC,CAAO;AAE/B;","x_google_ignoreList":[0]}

package/dist/index.es183.js

@@ -1,26 +1,5 @@
-import Y from "./index.es231.js";
-import { cartesianCross as S, cartesian as T, cartesianNormalizeInPlace as U } from "./index.es233.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.es234.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;
-}
+var a = {};
 export {
-  l as default
+  a as __exports
 };
 //# sourceMappingURL=index.es183.js.map

package/dist/index.es183.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es183.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]}
+{"version":3,"file":"index.es183.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es184.js

@@ -1,3 +1,11 @@
-import r from "./index.es231.js";
-r();
+import i from "./index.es49.js";
+import { point as m } from "./index.es48.js";
+function x(t, r) {
+  r === void 0 && (r = {});
+  var e = i(t), a = (e[0] + e[2]) / 2, f = (e[1] + e[3]) / 2;
+  return m([a, f], r.properties, r);
+}
+export {
+  x as default
+};
 //# sourceMappingURL=index.es184.js.map

package/dist/index.es184.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es184.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]}
+{"version":3,"file":"index.es184.js","sources":["../../../node_modules/@turf/center/dist/es/index.js"],"sourcesContent":["import bbox from \"@turf/bbox\";\nimport { point, } from \"@turf/helpers\";\n/**\n * Takes a {@link Feature} or {@link FeatureCollection} and returns the absolute center point of all features.\n *\n * @name center\n * @param {GeoJSON} geojson GeoJSON to be centered\n * @param {Object} [options={}] Optional parameters\n * @param {Object} [options.properties={}] Translate GeoJSON Properties to Point\n * @param {Object} [options.bbox={}] Translate GeoJSON BBox to Point\n * @param {Object} [options.id={}] Translate GeoJSON Id to Point\n * @returns {Feature<Point>} a Point feature at the absolute center point of all input features\n * @example\n * var features = turf.points([\n *   [-97.522259, 35.4691],\n *   [-97.502754, 35.463455],\n *   [-97.508269, 35.463245]\n * ]);\n *\n * var center = turf.center(features);\n *\n * //addToMap\n * var addToMap = [features, center]\n * center.properties['marker-size'] = 'large';\n * center.properties['marker-color'] = '#000';\n */\nfunction center(geojson, options) {\n    if (options === void 0) { options = {}; }\n    var ext = bbox(geojson);\n    var x = (ext[0] + ext[2]) / 2;\n    var y = (ext[1] + ext[3]) / 2;\n    return point([x, y], options.properties, options);\n}\nexport default center;\n"],"names":["center","geojson","options","ext","bbox","x","y","point"],"mappings":";;AA0BA,SAASA,EAAOC,GAASC,GAAS;AAC9B,EAAIA,MAAY,WAAUA,IAAU,CAAA;AAChC,MAAAC,IAAMC,EAAKH,CAAO,GAClBI,KAAKF,EAAI,CAAC,IAAIA,EAAI,CAAC,KAAK,GACxBG,KAAKH,EAAI,CAAC,IAAIA,EAAI,CAAC,KAAK;AAC5B,SAAOI,EAAM,CAACF,GAAGC,CAAC,GAAGJ,EAAQ,YAAYA,CAAO;AACpD;","x_google_ignoreList":[0]}

package/dist/index.es185.js

@@ -1,4 +1,151 @@
-import r from "./index.es231.js";
-r();
-r();
+function b(e, o, r) {
+  if (e !== null)
+    for (var t, l, a, u, c, i, s, y = 0, f = 0, h, p = e.type, C = p === "FeatureCollection", v = p === "Feature", w = C ? e.features.length : 1, M = 0; M < w; M++) {
+      s = C ? e.features[M].geometry : v ? e.geometry : e, h = s ? s.type === "GeometryCollection" : !1, c = h ? s.geometries.length : 1;
+      for (var G = 0; G < c; G++) {
+        var n = 0, g = 0;
+        if (u = h ? s.geometries[G] : s, u !== null) {
+          i = u.coordinates;
+          var P = u.type;
+          switch (y = r && (P === "Polygon" || P === "MultiPolygon") ? 1 : 0, P) {
+            case null:
+              break;
+            case "Point":
+              if (o(
+                i,
+                f,
+                M,
+                n,
+                g
+              ) === !1)
+                return !1;
+              f++, n++;
+              break;
+            case "LineString":
+            case "MultiPoint":
+              for (t = 0; t < i.length; t++) {
+                if (o(
+                  i[t],
+                  f,
+                  M,
+                  n,
+                  g
+                ) === !1)
+                  return !1;
+                f++, P === "MultiPoint" && n++;
+              }
+              P === "LineString" && n++;
+              break;
+            case "Polygon":
+            case "MultiLineString":
+              for (t = 0; t < i.length; t++) {
+                for (l = 0; l < i[t].length - y; l++) {
+                  if (o(
+                    i[t][l],
+                    f,
+                    M,
+                    n,
+                    g
+                  ) === !1)
+                    return !1;
+                  f++;
+                }
+                P === "MultiLineString" && n++, P === "Polygon" && g++;
+              }
+              P === "Polygon" && n++;
+              break;
+            case "MultiPolygon":
+              for (t = 0; t < i.length; t++) {
+                for (g = 0, l = 0; l < i[t].length; l++) {
+                  for (a = 0; a < i[t][l].length - y; a++) {
+                    if (o(
+                      i[t][l][a],
+                      f,
+                      M,
+                      n,
+                      g
+                    ) === !1)
+                      return !1;
+                    f++;
+                  }
+                  g++;
+                }
+                n++;
+              }
+              break;
+            case "GeometryCollection":
+              for (t = 0; t < u.geometries.length; t++)
+                if (b(u.geometries[t], o, r) === !1)
+                  return !1;
+              break;
+            default:
+              throw new Error("Unknown Geometry Type");
+          }
+        }
+      }
+    }
+}
+function S(e, o) {
+  if (e.type === "Feature")
+    o(e, 0);
+  else if (e.type === "FeatureCollection")
+    for (var r = 0; r < e.features.length && o(e.features[r], r) !== !1; r++)
+      ;
+}
+function k(e, o) {
+  var r, t, l, a, u, c, i, s, y, f, h = 0, p = e.type === "FeatureCollection", C = e.type === "Feature", v = p ? e.features.length : 1;
+  for (r = 0; r < v; r++) {
+    for (c = p ? e.features[r].geometry : C ? e.geometry : e, s = p ? e.features[r].properties : C ? e.properties : {}, y = p ? e.features[r].bbox : C ? e.bbox : void 0, f = p ? e.features[r].id : C ? e.id : void 0, i = c ? c.type === "GeometryCollection" : !1, u = i ? c.geometries.length : 1, l = 0; l < u; l++) {
+      if (a = i ? c.geometries[l] : c, a === null) {
+        if (o(
+          null,
+          h,
+          s,
+          y,
+          f
+        ) === !1)
+          return !1;
+        continue;
+      }
+      switch (a.type) {
+        case "Point":
+        case "LineString":
+        case "MultiPoint":
+        case "Polygon":
+        case "MultiLineString":
+        case "MultiPolygon": {
+          if (o(
+            a,
+            h,
+            s,
+            y,
+            f
+          ) === !1)
+            return !1;
+          break;
+        }
+        case "GeometryCollection": {
+          for (t = 0; t < a.geometries.length; t++)
+            if (o(
+              a.geometries[t],
+              h,
+              s,
+              y,
+              f
+            ) === !1)
+              return !1;
+          break;
+        }
+        default:
+          throw new Error("Unknown Geometry Type");
+      }
+    }
+    h++;
+  }
+}
+export {
+  b as coordEach,
+  S as featureEach,
+  k as geomEach
+};
 //# sourceMappingURL=index.es185.js.map