@performant-software/geospatial 3.1.24 → 3.1.25-beta.0

package/dist/index.es227.js

@@ -1,14 +1,15 @@
-import o from "./index.es132.js";
-import m from "./index.es38.js";
-import f from "./index.es96.js";
-import p from "./index.es109.js";
-import n from "./index.es137.js";
-import e from "./index.es135.js";
-import s from "./index.es223.js";
-function x(r, t, i) {
-  return r == null ? o : m(r) ? s(r, t, i) : f(r) && !p(r) ? n(r) : e(r);
+import i from "./index.es215.js";
+import a from "./index.es160.js";
+function g(f, t) {
+  return function(n, r, c) {
+    var o = t ? [[], []] : {};
+    return r = i(r, c), a(n, function(u, m) {
+      var p = r(u, m, n);
+      f(o, u, p);
+    }), o;
+  };
 }
 export {
-  x as default
+  g as default
 };
 //# sourceMappingURL=index.es227.js.map

package/dist/index.es227.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es227.js","sources":["../node_modules/underscore/modules/_baseIteratee.js"],"sourcesContent":["import identity from './identity.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isArray from './isArray.js';\nimport matcher from './matcher.js';\nimport property from './property.js';\nimport optimizeCb from './_optimizeCb.js';\n\n// An internal function to generate callbacks that can be applied to each\n// element in a collection, returning the desired result — either `_.identity`,\n// an arbitrary callback, a property matcher, or a property accessor.\nexport default function baseIteratee(value, context, argCount) {\n  if (value == null) return identity;\n  if (isFunction(value)) return optimizeCb(value, context, argCount);\n  if (isObject(value) && !isArray(value)) return matcher(value);\n  return property(value);\n}\n"],"names":["baseIteratee","value","context","argCount","identity","isFunction","optimizeCb","isObject","isArray","matcher","property"],"mappings":";;;;;;;AAWA,SAAwBA,EAAaC,GAAOC,GAASC,GAAU;AAC7D,SAAIF,KAAS,OAAaG,IACtBC,EAAWJ,CAAK,IAAUK,EAAWL,GAAOC,GAASC,CAAQ,IAC7DI,EAASN,CAAK,KAAK,CAACO,EAAQP,CAAK,IAAUQ,EAAQR,CAAK,IACrDS,EAAST,CAAK;AACvB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es227.js","sources":["../node_modules/underscore/modules/_group.js"],"sourcesContent":["import cb from './_cb.js';\nimport each from './each.js';\n\n// An internal function used for aggregate \"group by\" operations.\nexport default function group(behavior, partition) {\n  return function(obj, iteratee, context) {\n    var result = partition ? [[], []] : {};\n    iteratee = cb(iteratee, context);\n    each(obj, function(value, index) {\n      var key = iteratee(value, index, obj);\n      behavior(result, value, key);\n    });\n    return result;\n  };\n}\n"],"names":["group","behavior","partition","obj","iteratee","context","result","cb","each","value","index","key"],"mappings":";;AAIA,SAAwBA,EAAMC,GAAUC,GAAW;AACjD,SAAO,SAASC,GAAKC,GAAUC,GAAS;AACtC,QAAIC,IAASJ,IAAY,CAAC,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA;AACpC,WAAAE,IAAWG,EAAGH,GAAUC,CAAO,GAC/BG,EAAKL,GAAK,SAASM,GAAOC,GAAO;AAC/B,UAAIC,IAAMP,EAASK,GAAOC,GAAOP,CAAG;AACpC,MAAAF,EAASK,GAAQG,GAAOE,CAAG;AAAA,IAC7B,CAAC,GACML;AAAA,EACT;AACF;","x_google_ignoreList":[0]}

package/dist/index.es228.js

@@ -1,9 +1,5 @@
-import i from "./index.es219.js";
-import n from "./index.es96.js";
-function u(t, a, f, o, e) {
-  if (!(o instanceof a)) return t.apply(f, e);
-  var r = i(t.prototype), p = t.apply(r, e);
-  return n(p) ? p : r;
+function u(t, e, n) {
+  return e in n;
 }
 export {
   u as default

package/dist/index.es228.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es228.js","sources":["../node_modules/underscore/modules/_executeBound.js"],"sourcesContent":["import baseCreate from './_baseCreate.js';\nimport isObject from './isObject.js';\n\n// Internal function to execute `sourceFunc` bound to `context` with optional\n// `args`. Determines whether to execute a function as a constructor or as a\n// normal function.\nexport default function executeBound(sourceFunc, boundFunc, context, callingContext, args) {\n  if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);\n  var self = baseCreate(sourceFunc.prototype);\n  var result = sourceFunc.apply(self, args);\n  if (isObject(result)) return result;\n  return self;\n}\n"],"names":["executeBound","sourceFunc","boundFunc","context","callingContext","args","self","baseCreate","result","isObject"],"mappings":";;AAMA,SAAwBA,EAAaC,GAAYC,GAAWC,GAASC,GAAgBC,GAAM;AACzF,MAAI,EAAED,aAA0BF,WAAmBD,EAAW,MAAME,GAASE,CAAI;AACjF,MAAIC,IAAOC,EAAWN,EAAW,SAAS,GACtCO,IAASP,EAAW,MAAMK,GAAMD,CAAI;AACxC,SAAII,EAASD,CAAM,IAAUA,IACtBF;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es228.js","sources":["../node_modules/underscore/modules/_keyInObj.js"],"sourcesContent":["// Internal `_.pick` helper function to determine whether `key` is an enumerable\n// property name of `obj`.\nexport default function keyInObj(value, key, obj) {\n  return key in obj;\n}\n"],"names":["keyInObj","value","key","obj"],"mappings":"AAEA,SAAwBA,EAASC,GAAOC,GAAKC,GAAK;AAChD,SAAOD,KAAOC;AAChB;","x_google_ignoreList":[0]}

package/dist/index.es229.js

@@ -1,24 +1,8 @@
-import l from "./index.es213.js";
-import y from "./index.es232.js";
-import A from "./index.es109.js";
-import c from "./index.es40.js";
-function x(n, i, s, r) {
-  if (r = r || [], !i && i !== 0)
-    i = 1 / 0;
-  else if (i <= 0)
-    return r.concat(n);
-  for (var m = r.length, e = 0, a = l(n); e < a; e++) {
-    var f = n[e];
-    if (y(f) && (A(f) || c(f)))
-      if (i > 1)
-        x(f, i - 1, s, r), m = r.length;
-      else
-        for (var g = 0, o = f.length; g < o; ) r[m++] = f[g++];
-    else s || (r[m++] = f);
-  }
-  return r;
+import a from "./index.es41.js";
+function r(t, n) {
+  return t._chain ? a(n).chain() : n;
 }
 export {
-  x as default
+  r as default
 };
 //# sourceMappingURL=index.es229.js.map

package/dist/index.es229.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es229.js","sources":["../node_modules/underscore/modules/_flatten.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isArrayLike from './_isArrayLike.js';\nimport isArray from './isArray.js';\nimport isArguments from './isArguments.js';\n\n// Internal implementation of a recursive `flatten` function.\nexport default function flatten(input, depth, strict, output) {\n  output = output || [];\n  if (!depth && depth !== 0) {\n    depth = Infinity;\n  } else if (depth <= 0) {\n    return output.concat(input);\n  }\n  var idx = output.length;\n  for (var i = 0, length = getLength(input); i < length; i++) {\n    var value = input[i];\n    if (isArrayLike(value) && (isArray(value) || isArguments(value))) {\n      // Flatten current level of array or arguments object.\n      if (depth > 1) {\n        flatten(value, depth - 1, strict, output);\n        idx = output.length;\n      } else {\n        var j = 0, len = value.length;\n        while (j < len) output[idx++] = value[j++];\n      }\n    } else if (!strict) {\n      output[idx++] = value;\n    }\n  }\n  return output;\n}\n"],"names":["flatten","input","depth","strict","output","idx","i","length","getLength","value","isArrayLike","isArray","isArguments","j","len"],"mappings":";;;;AAMA,SAAwBA,EAAQC,GAAOC,GAAOC,GAAQC,GAAQ;AAE5D,MADAA,IAASA,KAAU,CAAA,GACf,CAACF,KAASA,MAAU;AACtB,IAAAA,IAAQ;AAAA,WACCA,KAAS;AAClB,WAAOE,EAAO,OAAOH,CAAK;AAG5B,WADII,IAAMD,EAAO,QACRE,IAAI,GAAGC,IAASC,EAAUP,CAAK,GAAGK,IAAIC,GAAQD,KAAK;AAC1D,QAAIG,IAAQR,EAAMK,CAAC;AACnB,QAAII,EAAYD,CAAK,MAAME,EAAQF,CAAK,KAAKG,EAAYH,CAAK;AAE5D,UAAIP,IAAQ;AACV,QAAAF,EAAQS,GAAOP,IAAQ,GAAGC,GAAQC,CAAM,GACxCC,IAAMD,EAAO;AAAA;AAGb,iBADIS,IAAI,GAAGC,IAAML,EAAM,QAChBI,IAAIC,IAAK,CAAAV,EAAOC,GAAK,IAAII,EAAMI,GAAG;AAAA,QAE7C,CAAYV,MACVC,EAAOC,GAAK,IAAII;AAAA,EAEpB;AACA,SAAOL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es229.js","sources":["../node_modules/underscore/modules/_chainResult.js"],"sourcesContent":["import _ from './underscore.js';\n\n// Helper function to continue chaining intermediate results.\nexport default function chainResult(instance, obj) {\n  return instance._chain ? _(obj).chain() : obj;\n}\n"],"names":["chainResult","instance","obj","_"],"mappings":";AAGA,SAAwBA,EAAYC,GAAUC,GAAK;AACjD,SAAOD,EAAS,SAASE,EAAED,CAAG,EAAE,UAAUA;AAC5C;","x_google_ignoreList":[0]}

package/dist/index.es23.js

@@ -1,5 +1,5 @@
 import { memo as m, useRef as u, useEffect as l } from "react";
-import { applyReactStyle as a } from "./index.es241.js";
+import { applyReactStyle as a } from "./index.es199.js";
 import { useControl as f } from "./index.es30.js";
 function r(t) {
   const i = f(({ mapLib: c }) => new c.ScaleControl(t), {

package/dist/index.es230.js

@@ -1,14 +1,151 @@
-import u from "./index.es222.js";
-import i from "./index.es213.js";
-function g(r) {
-  return function(t, e, f) {
-    e = u(e, f);
-    for (var o = i(t), n = r > 0 ? 0 : o - 1; n >= 0 && n < o; n += r)
-      if (e(t[n], n, t)) return n;
-    return -1;
-  };
+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 {
-  g as default
+  b as coordEach,
+  S as featureEach,
+  k as geomEach
 };
 //# sourceMappingURL=index.es230.js.map

package/dist/index.es230.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es230.js","sources":["../node_modules/underscore/modules/_createPredicateIndexFinder.js"],"sourcesContent":["import cb from './_cb.js';\nimport getLength from './_getLength.js';\n\n// Internal function to generate `_.findIndex` and `_.findLastIndex`.\nexport default function createPredicateIndexFinder(dir) {\n  return function(array, predicate, context) {\n    predicate = cb(predicate, context);\n    var length = getLength(array);\n    var index = dir > 0 ? 0 : length - 1;\n    for (; index >= 0 && index < length; index += dir) {\n      if (predicate(array[index], index, array)) return index;\n    }\n    return -1;\n  };\n}\n"],"names":["createPredicateIndexFinder","dir","array","predicate","context","cb","length","getLength","index"],"mappings":";;AAIA,SAAwBA,EAA2BC,GAAK;AACtD,SAAO,SAASC,GAAOC,GAAWC,GAAS;AACzC,IAAAD,IAAYE,EAAGF,GAAWC,CAAO;AAGjC,aAFIE,IAASC,EAAUL,CAAK,GACxBM,IAAQP,IAAM,IAAI,IAAIK,IAAS,GAC5BE,KAAS,KAAKA,IAAQF,GAAQE,KAASP;AAC5C,UAAIE,EAAUD,EAAMM,CAAK,GAAGA,GAAON,CAAK,EAAG,QAAOM;AAEpD,WAAO;AAAA,EACT;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es230.js","sources":["../../../node_modules/@turf/meta/dist/esm/index.js"],"sourcesContent":["// index.js\nimport { feature, point, lineString, isObject } from \"@turf/helpers\";\nfunction coordEach(geojson, callback, excludeWrapCoord) {\n  if (geojson === null) return;\n  var j, k, l, geometry, stopG, coords, geometryMaybeCollection, wrapShrink = 0, coordIndex = 0, isGeometryCollection, type = geojson.type, isFeatureCollection = type === \"FeatureCollection\", isFeature = type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (var featureIndex = 0; featureIndex < stop; featureIndex++) {\n    geometryMaybeCollection = isFeatureCollection ? geojson.features[featureIndex].geometry : isFeature ? geojson.geometry : geojson;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (var geomIndex = 0; geomIndex < stopG; geomIndex++) {\n      var multiFeatureIndex = 0;\n      var geometryIndex = 0;\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[geomIndex] : geometryMaybeCollection;\n      if (geometry === null) continue;\n      coords = geometry.coordinates;\n      var geomType = geometry.type;\n      wrapShrink = excludeWrapCoord && (geomType === \"Polygon\" || geomType === \"MultiPolygon\") ? 1 : 0;\n      switch (geomType) {\n        case null:\n          break;\n        case \"Point\":\n          if (callback(\n            coords,\n            coordIndex,\n            featureIndex,\n            multiFeatureIndex,\n            geometryIndex\n          ) === false)\n            return false;\n          coordIndex++;\n          multiFeatureIndex++;\n          break;\n        case \"LineString\":\n        case \"MultiPoint\":\n          for (j = 0; j < coords.length; j++) {\n            if (callback(\n              coords[j],\n              coordIndex,\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false)\n              return false;\n            coordIndex++;\n            if (geomType === \"MultiPoint\") multiFeatureIndex++;\n          }\n          if (geomType === \"LineString\") multiFeatureIndex++;\n          break;\n        case \"Polygon\":\n        case \"MultiLineString\":\n          for (j = 0; j < coords.length; j++) {\n            for (k = 0; k < coords[j].length - wrapShrink; k++) {\n              if (callback(\n                coords[j][k],\n                coordIndex,\n                featureIndex,\n                multiFeatureIndex,\n                geometryIndex\n              ) === false)\n                return false;\n              coordIndex++;\n            }\n            if (geomType === \"MultiLineString\") multiFeatureIndex++;\n            if (geomType === \"Polygon\") geometryIndex++;\n          }\n          if (geomType === \"Polygon\") multiFeatureIndex++;\n          break;\n        case \"MultiPolygon\":\n          for (j = 0; j < coords.length; j++) {\n            geometryIndex = 0;\n            for (k = 0; k < coords[j].length; k++) {\n              for (l = 0; l < coords[j][k].length - wrapShrink; l++) {\n                if (callback(\n                  coords[j][k][l],\n                  coordIndex,\n                  featureIndex,\n                  multiFeatureIndex,\n                  geometryIndex\n                ) === false)\n                  return false;\n                coordIndex++;\n              }\n              geometryIndex++;\n            }\n            multiFeatureIndex++;\n          }\n          break;\n        case \"GeometryCollection\":\n          for (j = 0; j < geometry.geometries.length; j++)\n            if (coordEach(geometry.geometries[j], callback, excludeWrapCoord) === false)\n              return false;\n          break;\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n  }\n}\nfunction coordReduce(geojson, callback, initialValue, excludeWrapCoord) {\n  var previousValue = initialValue;\n  coordEach(\n    geojson,\n    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (coordIndex === 0 && initialValue === void 0)\n        previousValue = currentCoord;\n      else\n        previousValue = callback(\n          previousValue,\n          currentCoord,\n          coordIndex,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    },\n    excludeWrapCoord\n  );\n  return previousValue;\n}\nfunction propEach(geojson, callback) {\n  var i;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      for (i = 0; i < geojson.features.length; i++) {\n        if (callback(geojson.features[i].properties, i) === false) break;\n      }\n      break;\n    case \"Feature\":\n      callback(geojson.properties, 0);\n      break;\n  }\n}\nfunction propReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  propEach(geojson, function(currentProperties, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentProperties;\n    else\n      previousValue = callback(previousValue, currentProperties, featureIndex);\n  });\n  return previousValue;\n}\nfunction featureEach(geojson, callback) {\n  if (geojson.type === \"Feature\") {\n    callback(geojson, 0);\n  } else if (geojson.type === \"FeatureCollection\") {\n    for (var i = 0; i < geojson.features.length; i++) {\n      if (callback(geojson.features[i], i) === false) break;\n    }\n  }\n}\nfunction featureReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  featureEach(geojson, function(currentFeature, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentFeature;\n    else previousValue = callback(previousValue, currentFeature, featureIndex);\n  });\n  return previousValue;\n}\nfunction coordAll(geojson) {\n  var coords = [];\n  coordEach(geojson, function(coord) {\n    coords.push(coord);\n  });\n  return coords;\n}\nfunction geomEach(geojson, callback) {\n  var i, j, g, geometry, stopG, geometryMaybeCollection, isGeometryCollection, featureProperties, featureBBox, featureId, featureIndex = 0, isFeatureCollection = geojson.type === \"FeatureCollection\", isFeature = geojson.type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (i = 0; i < stop; i++) {\n    geometryMaybeCollection = isFeatureCollection ? geojson.features[i].geometry : isFeature ? geojson.geometry : geojson;\n    featureProperties = isFeatureCollection ? geojson.features[i].properties : isFeature ? geojson.properties : {};\n    featureBBox = isFeatureCollection ? geojson.features[i].bbox : isFeature ? geojson.bbox : void 0;\n    featureId = isFeatureCollection ? geojson.features[i].id : isFeature ? geojson.id : void 0;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (g = 0; g < stopG; g++) {\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[g] : geometryMaybeCollection;\n      if (geometry === null) {\n        if (callback(\n          null,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        ) === false)\n          return false;\n        continue;\n      }\n      switch (geometry.type) {\n        case \"Point\":\n        case \"LineString\":\n        case \"MultiPoint\":\n        case \"Polygon\":\n        case \"MultiLineString\":\n        case \"MultiPolygon\": {\n          if (callback(\n            geometry,\n            featureIndex,\n            featureProperties,\n            featureBBox,\n            featureId\n          ) === false)\n            return false;\n          break;\n        }\n        case \"GeometryCollection\": {\n          for (j = 0; j < geometry.geometries.length; j++) {\n            if (callback(\n              geometry.geometries[j],\n              featureIndex,\n              featureProperties,\n              featureBBox,\n              featureId\n            ) === false)\n              return false;\n          }\n          break;\n        }\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n    featureIndex++;\n  }\n}\nfunction geomReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  geomEach(\n    geojson,\n    function(currentGeometry, featureIndex, featureProperties, featureBBox, featureId) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentGeometry;\n      else\n        previousValue = callback(\n          previousValue,\n          currentGeometry,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        );\n    }\n  );\n  return previousValue;\n}\nfunction flattenEach(geojson, callback) {\n  geomEach(geojson, function(geometry, featureIndex, properties, bbox, id) {\n    var type = geometry === null ? null : geometry.type;\n    switch (type) {\n      case null:\n      case \"Point\":\n      case \"LineString\":\n      case \"Polygon\":\n        if (callback(\n          feature(geometry, properties, { bbox, id }),\n          featureIndex,\n          0\n        ) === false)\n          return false;\n        return;\n    }\n    var geomType;\n    switch (type) {\n      case \"MultiPoint\":\n        geomType = \"Point\";\n        break;\n      case \"MultiLineString\":\n        geomType = \"LineString\";\n        break;\n      case \"MultiPolygon\":\n        geomType = \"Polygon\";\n        break;\n    }\n    for (var multiFeatureIndex = 0; multiFeatureIndex < geometry.coordinates.length; multiFeatureIndex++) {\n      var coordinate = geometry.coordinates[multiFeatureIndex];\n      var geom = {\n        type: geomType,\n        coordinates: coordinate\n      };\n      if (callback(feature(geom, properties), featureIndex, multiFeatureIndex) === false)\n        return false;\n    }\n  });\n}\nfunction flattenReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  flattenEach(\n    geojson,\n    function(currentFeature, featureIndex, multiFeatureIndex) {\n      if (featureIndex === 0 && multiFeatureIndex === 0 && initialValue === void 0)\n        previousValue = currentFeature;\n      else\n        previousValue = callback(\n          previousValue,\n          currentFeature,\n          featureIndex,\n          multiFeatureIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction segmentEach(geojson, callback) {\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    var segmentIndex = 0;\n    if (!feature2.geometry) return;\n    var type = feature2.geometry.type;\n    if (type === \"Point\" || type === \"MultiPoint\") return;\n    var previousCoords;\n    var previousFeatureIndex = 0;\n    var previousMultiIndex = 0;\n    var prevGeomIndex = 0;\n    if (coordEach(\n      feature2,\n      function(currentCoord, coordIndex, featureIndexCoord, multiPartIndexCoord, geometryIndex) {\n        if (previousCoords === void 0 || featureIndex > previousFeatureIndex || multiPartIndexCoord > previousMultiIndex || geometryIndex > prevGeomIndex) {\n          previousCoords = currentCoord;\n          previousFeatureIndex = featureIndex;\n          previousMultiIndex = multiPartIndexCoord;\n          prevGeomIndex = geometryIndex;\n          segmentIndex = 0;\n          return;\n        }\n        var currentSegment = lineString(\n          [previousCoords, currentCoord],\n          feature2.properties\n        );\n        if (callback(\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        ) === false)\n          return false;\n        segmentIndex++;\n        previousCoords = currentCoord;\n      }\n    ) === false)\n      return false;\n  });\n}\nfunction segmentReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  var started = false;\n  segmentEach(\n    geojson,\n    function(currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex) {\n      if (started === false && initialValue === void 0)\n        previousValue = currentSegment;\n      else\n        previousValue = callback(\n          previousValue,\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        );\n      started = true;\n    }\n  );\n  return previousValue;\n}\nfunction lineEach(geojson, callback) {\n  if (!geojson) throw new Error(\"geojson is required\");\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    if (feature2.geometry === null) return;\n    var type = feature2.geometry.type;\n    var coords = feature2.geometry.coordinates;\n    switch (type) {\n      case \"LineString\":\n        if (callback(feature2, featureIndex, multiFeatureIndex, 0, 0) === false)\n          return false;\n        break;\n      case \"Polygon\":\n        for (var geometryIndex = 0; geometryIndex < coords.length; geometryIndex++) {\n          if (callback(\n            lineString(coords[geometryIndex], feature2.properties),\n            featureIndex,\n            multiFeatureIndex,\n            geometryIndex\n          ) === false)\n            return false;\n        }\n        break;\n    }\n  });\n}\nfunction lineReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  lineEach(\n    geojson,\n    function(currentLine, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentLine;\n      else\n        previousValue = callback(\n          previousValue,\n          currentLine,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction findSegment(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var segmentIndex = options.segmentIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n      if (segmentIndex < 0) segmentIndex = coords.length + segmentIndex - 1;\n      return lineString(\n        [coords[segmentIndex], coords[segmentIndex + 1]],\n        properties,\n        options\n      );\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[geometryIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          coords[geometryIndex][segmentIndex],\n          coords[geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[multiFeatureIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          coords[multiFeatureIndex][segmentIndex],\n          coords[multiFeatureIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[multiFeatureIndex][geometryIndex].length - segmentIndex - 1;\n      return lineString(\n        [\n          coords[multiFeatureIndex][geometryIndex][segmentIndex],\n          coords[multiFeatureIndex][geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nfunction findPoint(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var coordIndex = options.coordIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n      return point(coords, properties, options);\n    case \"MultiPoint\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      return point(coords[multiFeatureIndex], properties, options);\n    case \"LineString\":\n      if (coordIndex < 0) coordIndex = coords.length + coordIndex;\n      return point(coords[coordIndex], properties, options);\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[geometryIndex].length + coordIndex;\n      return point(coords[geometryIndex][coordIndex], properties, options);\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex].length + coordIndex;\n      return point(coords[multiFeatureIndex][coordIndex], properties, options);\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex][geometryIndex].length - coordIndex;\n      return point(\n        coords[multiFeatureIndex][geometryIndex][coordIndex],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nexport {\n  coordAll,\n  coordEach,\n  coordReduce,\n  featureEach,\n  featureReduce,\n  findPoint,\n  findSegment,\n  flattenEach,\n  flattenReduce,\n  geomEach,\n  geomReduce,\n  lineEach,\n  lineReduce,\n  propEach,\n  propReduce,\n  segmentEach,\n  segmentReduce\n};\n//# sourceMappingURL=index.js.map"],"names":["coordEach","geojson","callback","excludeWrapCoord","j","k","l","geometry","stopG","coords","geometryMaybeCollection","wrapShrink","coordIndex","isGeometryCollection","type","isFeatureCollection","isFeature","stop","featureIndex","geomIndex","multiFeatureIndex","geometryIndex","geomType","featureEach","i","geomEach","g","featureProperties","featureBBox","featureId"],"mappings":"AAEA,SAASA,EAAUC,GAASC,GAAUC,GAAkB;AACtD,MAAIF,MAAY;AAEhB,aADIG,GAAGC,GAAGC,GAAGC,GAAUC,GAAOC,GAAQC,GAAyBC,IAAa,GAAGC,IAAa,GAAGC,GAAsBC,IAAOb,EAAQ,MAAMc,IAAsBD,MAAS,qBAAqBE,IAAYF,MAAS,WAAWG,IAAOF,IAAsBd,EAAQ,SAAS,SAAS,GAC5QiB,IAAe,GAAGA,IAAeD,GAAMC,KAAgB;AAC9D,MAAAR,IAA0BK,IAAsBd,EAAQ,SAASiB,CAAY,EAAE,WAAWF,IAAYf,EAAQ,WAAWA,GACzHY,IAAuBH,IAA0BA,EAAwB,SAAS,uBAAuB,IACzGF,IAAQK,IAAuBH,EAAwB,WAAW,SAAS;AAC3E,eAASS,IAAY,GAAGA,IAAYX,GAAOW,KAAa;AACtD,YAAIC,IAAoB,GACpBC,IAAgB;AAEpB,YADAd,IAAWM,IAAuBH,EAAwB,WAAWS,CAAS,IAAIT,GAC9EH,MAAa,MACjB;AAAA,UAAAE,IAASF,EAAS;AAClB,cAAIe,IAAWf,EAAS;AAExB,kBADAI,IAAaR,MAAqBmB,MAAa,aAAaA,MAAa,kBAAkB,IAAI,GACvFA,GAAA;AAAA,YACN,KAAK;AACH;AAAA,YACF,KAAK;AACH,kBAAIpB;AAAA,gBACFO;AAAA,gBACAG;AAAA,gBACAM;AAAA,gBACAE;AAAA,gBACAC;AAAA,cAAA,MACI;AACJ,uBAAO;AACT,cAAAT,KACAQ;AACA;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AACH,mBAAKhB,IAAI,GAAGA,IAAIK,EAAO,QAAQL,KAAK;AAClC,oBAAIF;AAAA,kBACFO,EAAOL,CAAC;AAAA,kBACRQ;AAAA,kBACAM;AAAA,kBACAE;AAAA,kBACAC;AAAA,gBAAA,MACI;AACJ,yBAAO;AACT,gBAAAT,KACIU,MAAa,gBAAcF;AAAA,cACjC;AACA,cAAIE,MAAa,gBAAcF;AAC/B;AAAA,YACF,KAAK;AAAA,YACL,KAAK;AACH,mBAAKhB,IAAI,GAAGA,IAAIK,EAAO,QAAQL,KAAK;AAClC,qBAAKC,IAAI,GAAGA,IAAII,EAAOL,CAAC,EAAE,SAASO,GAAYN,KAAK;AAClD,sBAAIH;AAAA,oBACFO,EAAOL,CAAC,EAAEC,CAAC;AAAA,oBACXO;AAAA,oBACAM;AAAA,oBACAE;AAAA,oBACAC;AAAA,kBAAA,MACI;AACJ,2BAAO;AACT,kBAAAT;AAAA,gBACF;AACA,gBAAIU,MAAa,qBAAmBF,KAChCE,MAAa,aAAWD;AAAA,cAC9B;AACA,cAAIC,MAAa,aAAWF;AAC5B;AAAA,YACF,KAAK;AACH,mBAAKhB,IAAI,GAAGA,IAAIK,EAAO,QAAQL,KAAK;AAElC,qBADAiB,IAAgB,GACXhB,IAAI,GAAGA,IAAII,EAAOL,CAAC,EAAE,QAAQC,KAAK;AACrC,uBAAKC,IAAI,GAAGA,IAAIG,EAAOL,CAAC,EAAEC,CAAC,EAAE,SAASM,GAAYL,KAAK;AACrD,wBAAIJ;AAAA,sBACFO,EAAOL,CAAC,EAAEC,CAAC,EAAEC,CAAC;AAAA,sBACdM;AAAA,sBACAM;AAAA,sBACAE;AAAA,sBACAC;AAAA,oBAAA,MACI;AACJ,6BAAO;AACT,oBAAAT;AAAA,kBACF;AACA,kBAAAS;AAAA,gBACF;AACA,gBAAAD;AAAA,cACF;AACA;AAAA,YACF,KAAK;AACH,mBAAKhB,IAAI,GAAGA,IAAIG,EAAS,WAAW,QAAQH;AAC1C,oBAAIJ,EAAUO,EAAS,WAAWH,CAAC,GAAGF,GAAUC,CAAgB,MAAM;AACpE,yBAAO;AACX;AAAA,YACF;AACE,oBAAM,IAAI,MAAM,uBAAuB;AAAA,UAAA;AAAA;AAAA,MAE7C;AAAA,IACF;AACF;AA6CA,SAASoB,EAAYtB,GAASC,GAAU;AACtC,MAAID,EAAQ,SAAS;AACnB,IAAAC,EAASD,GAAS,CAAC;AAAA,WACVA,EAAQ,SAAS;AAC1B,aAASuB,IAAI,GAAGA,IAAIvB,EAAQ,SAAS,UAC/BC,EAASD,EAAQ,SAASuB,CAAC,GAAGA,CAAC,MAAM,IADEA;AAC3C;AAGN;AAiBA,SAASC,EAASxB,GAASC,GAAU;AACnC,MAAIsB,GAAGpB,GAAGsB,GAAGnB,GAAUC,GAAOE,GAAyBG,GAAsBc,GAAmBC,GAAaC,GAAWX,IAAe,GAAGH,IAAsBd,EAAQ,SAAS,qBAAqBe,IAAYf,EAAQ,SAAS,WAAWgB,IAAOF,IAAsBd,EAAQ,SAAS,SAAS;AACrS,OAAKuB,IAAI,GAAGA,IAAIP,GAAMO,KAAK;AAOzB,SANAd,IAA0BK,IAAsBd,EAAQ,SAASuB,CAAC,EAAE,WAAWR,IAAYf,EAAQ,WAAWA,GAC9G0B,IAAoBZ,IAAsBd,EAAQ,SAASuB,CAAC,EAAE,aAAaR,IAAYf,EAAQ,aAAa,CAAA,GAC5G2B,IAAcb,IAAsBd,EAAQ,SAASuB,CAAC,EAAE,OAAOR,IAAYf,EAAQ,OAAO,QAC1F4B,IAAYd,IAAsBd,EAAQ,SAASuB,CAAC,EAAE,KAAKR,IAAYf,EAAQ,KAAK,QACpFY,IAAuBH,IAA0BA,EAAwB,SAAS,uBAAuB,IACzGF,IAAQK,IAAuBH,EAAwB,WAAW,SAAS,GACtEgB,IAAI,GAAGA,IAAIlB,GAAOkB,KAAK;AAE1B,UADAnB,IAAWM,IAAuBH,EAAwB,WAAWgB,CAAC,IAAIhB,GACtEH,MAAa,MAAM;AACrB,YAAIL;AAAA,UACF;AAAA,UACAgB;AAAA,UACAS;AAAA,UACAC;AAAA,UACAC;AAAA,QAAA,MACI;AACJ,iBAAO;AACT;AAAA,MACF;AACA,cAAQtB,EAAS,MAAA;AAAA,QACf,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK,gBAAgB;AACnB,cAAIL;AAAA,YACFK;AAAA,YACAW;AAAA,YACAS;AAAA,YACAC;AAAA,YACAC;AAAA,UAAA,MACI;AACJ,mBAAO;AACT;AAAA,QACF;AAAA,QACA,KAAK,sBAAsB;AACzB,eAAKzB,IAAI,GAAGA,IAAIG,EAAS,WAAW,QAAQH;AAC1C,gBAAIF;AAAA,cACFK,EAAS,WAAWH,CAAC;AAAA,cACrBc;AAAA,cACAS;AAAA,cACAC;AAAA,cACAC;AAAA,YAAA,MACI;AACJ,qBAAO;AAEX;AAAA,QACF;AAAA,QACA;AACE,gBAAM,IAAI,MAAM,uBAAuB;AAAA,MAAA;AAAA,IAE7C;AACA,IAAAX;AAAA,EACF;AACF;","x_google_ignoreList":[0]}

package/dist/index.es231.js

@@ -1,21 +1,10 @@
-import c from "./index.es213.js";
-import { slice as m } from "./index.es37.js";
-import p from "./index.es111.js";
-function M(o, l, u) {
-  return function(t, f, e) {
-    var r = 0, n = c(t);
-    if (typeof e == "number")
-      o > 0 ? r = e >= 0 ? e : Math.max(e + n, r) : n = e >= 0 ? Math.min(e + 1, n) : e + n + 1;
-    else if (u && e && n)
-      return e = u(t, f), t[e] === f ? e : -1;
-    if (f !== f)
-      return e = l(m.call(t, r, n), p), e >= 0 ? e + r : -1;
-    for (e = o > 0 ? r : n - 1; e >= 0 && e < n; e += o)
-      if (t[e] === f) return e;
-    return -1;
-  };
+import { bbox as c } from "./index.es69.js";
+import { point as p } from "./index.es67.js";
+function x(r, o = {}) {
+  const t = c(r), e = (t[0] + t[2]) / 2, n = (t[1] + t[3]) / 2;
+  return p([e, n], o.properties, o);
 }
 export {
-  M as default
+  x as center
 };
 //# sourceMappingURL=index.es231.js.map

package/dist/index.es231.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es231.js","sources":["../node_modules/underscore/modules/_createIndexFinder.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport { slice } from './_setup.js';\nimport isNaN from './isNaN.js';\n\n// Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.\nexport default function createIndexFinder(dir, predicateFind, sortedIndex) {\n  return function(array, item, idx) {\n    var i = 0, length = getLength(array);\n    if (typeof idx == 'number') {\n      if (dir > 0) {\n        i = idx >= 0 ? idx : Math.max(idx + length, i);\n      } else {\n        length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;\n      }\n    } else if (sortedIndex && idx && length) {\n      idx = sortedIndex(array, item);\n      return array[idx] === item ? idx : -1;\n    }\n    if (item !== item) {\n      idx = predicateFind(slice.call(array, i, length), isNaN);\n      return idx >= 0 ? idx + i : -1;\n    }\n    for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {\n      if (array[idx] === item) return idx;\n    }\n    return -1;\n  };\n}\n"],"names":["createIndexFinder","dir","predicateFind","sortedIndex","array","item","idx","i","length","getLength","slice","isNaN"],"mappings":";;;AAKA,SAAwBA,EAAkBC,GAAKC,GAAeC,GAAa;AACzE,SAAO,SAASC,GAAOC,GAAMC,GAAK;AAChC,QAAIC,IAAI,GAAGC,IAASC,EAAUL,CAAK;AACnC,QAAI,OAAOE,KAAO;AAChB,MAAIL,IAAM,IACRM,IAAID,KAAO,IAAIA,IAAM,KAAK,IAAIA,IAAME,GAAQD,CAAC,IAE7CC,IAASF,KAAO,IAAI,KAAK,IAAIA,IAAM,GAAGE,CAAM,IAAIF,IAAME,IAAS;AAAA,aAExDL,KAAeG,KAAOE;AAC/B,aAAAF,IAAMH,EAAYC,GAAOC,CAAI,GACtBD,EAAME,CAAG,MAAMD,IAAOC,IAAM;AAErC,QAAID,MAASA;AACX,aAAAC,IAAMJ,EAAcQ,EAAM,KAAKN,GAAOG,GAAGC,CAAM,GAAGG,CAAK,GAChDL,KAAO,IAAIA,IAAMC,IAAI;AAE9B,SAAKD,IAAML,IAAM,IAAIM,IAAIC,IAAS,GAAGF,KAAO,KAAKA,IAAME,GAAQF,KAAOL;AACpE,UAAIG,EAAME,CAAG,MAAMD,EAAM,QAAOC;AAElC,WAAO;AAAA,EACT;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es231.js","sources":["../node_modules/@turf/center/dist/esm/index.js"],"sourcesContent":["// index.ts\nimport { bbox } from \"@turf/bbox\";\nimport { point } from \"@turf/helpers\";\nfunction center(geojson, options = {}) {\n  const ext = bbox(geojson);\n  const x = (ext[0] + ext[2]) / 2;\n  const y = (ext[1] + ext[3]) / 2;\n  return point([x, y], options.properties, options);\n}\nvar turf_center_default = center;\nexport {\n  center,\n  turf_center_default as default\n};\n//# sourceMappingURL=index.js.map"],"names":["center","geojson","options","ext","bbox","x","y","point"],"mappings":";;AAGA,SAASA,EAAOC,GAASC,IAAU,IAAI;AACrC,QAAMC,IAAMC,EAAKH,CAAO,GAClBI,KAAKF,EAAI,CAAC,IAAIA,EAAI,CAAC,KAAK,GACxBG,KAAKH,EAAI,CAAC,IAAIA,EAAI,CAAC,KAAK;AAC9B,SAAOI,EAAM,CAACF,GAAGC,CAAC,GAAGJ,EAAQ,YAAYA,CAAO;AAClD;","x_google_ignoreList":[0]}

package/dist/index.es232.js

@@ -1,7 +1,8 @@
-import e from "./index.es249.js";
-import r from "./index.es213.js";
-const i = e(r);
+import { getDefaultExportFromCjs as r } from "./index.es80.js";
+import { __require as t } from "./index.es250.js";
+var s = t();
+const m = /* @__PURE__ */ r(s);
 export {
-  i as default
+  m as default
 };
 //# sourceMappingURL=index.es232.js.map

package/dist/index.es232.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es232.js","sources":["../node_modules/underscore/modules/_isArrayLike.js"],"sourcesContent":["import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getLength from './_getLength.js';\n\n// Internal helper for collection methods to determine whether a collection\n// should be iterated as an array or as an object.\n// Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength\n// Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094\nexport default createSizePropertyCheck(getLength);\n"],"names":["isArrayLike","createSizePropertyCheck","getLength"],"mappings":";;AAOA,MAAAA,IAAeC,EAAwBC,CAAS;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es232.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}

package/dist/index.es233.js

@@ -1,21 +1,4 @@
-import p from "./index.es232.js";
-import s from "./index.es117.js";
-import g from "./index.es223.js";
-function k(i) {
-  var l = function(r, a, n, f) {
-    var e = !p(r) && s(r), u = (e || r).length, t = i > 0 ? 0 : u - 1;
-    for (f || (n = r[e ? e[t] : t], t += i); t >= 0 && t < u; t += i) {
-      var c = e ? e[t] : t;
-      n = a(n, r[c], c, r);
-    }
-    return n;
-  };
-  return function(r, a, n, f) {
-    var e = arguments.length >= 3;
-    return l(r, g(a, f, 4), n, e);
-  };
-}
-export {
-  k as default
-};
+import r from "./index.es252.js";
+r();
+r();
 //# sourceMappingURL=index.es233.js.map

package/dist/index.es233.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es233.js","sources":["../node_modules/underscore/modules/_createReduce.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\nimport optimizeCb from './_optimizeCb.js';\n\n// Internal helper to create a reducing function, iterating left or right.\nexport default function createReduce(dir) {\n  // Wrap code that reassigns argument variables in a separate function than\n  // the one that accesses `arguments.length` to avoid a perf hit. (#1991)\n  var reducer = function(obj, iteratee, memo, initial) {\n    var _keys = !isArrayLike(obj) && keys(obj),\n        length = (_keys || obj).length,\n        index = dir > 0 ? 0 : length - 1;\n    if (!initial) {\n      memo = obj[_keys ? _keys[index] : index];\n      index += dir;\n    }\n    for (; index >= 0 && index < length; index += dir) {\n      var currentKey = _keys ? _keys[index] : index;\n      memo = iteratee(memo, obj[currentKey], currentKey, obj);\n    }\n    return memo;\n  };\n\n  return function(obj, iteratee, memo, context) {\n    var initial = arguments.length >= 3;\n    return reducer(obj, optimizeCb(iteratee, context, 4), memo, initial);\n  };\n}\n"],"names":["createReduce","dir","reducer","obj","iteratee","memo","initial","_keys","isArrayLike","keys","length","index","currentKey","context","optimizeCb"],"mappings":";;;AAKA,SAAwBA,EAAaC,GAAK;AAGxC,MAAIC,IAAU,SAASC,GAAKC,GAAUC,GAAMC,GAAS;AACnD,QAAIC,IAAQ,CAACC,EAAYL,CAAG,KAAKM,EAAKN,CAAG,GACrCO,KAAUH,KAASJ,GAAK,QACxBQ,IAAQV,IAAM,IAAI,IAAIS,IAAS;AAKnC,SAJKJ,MACHD,IAAOF,EAAII,IAAQA,EAAMI,CAAK,IAAIA,CAAK,GACvCA,KAASV,IAEJU,KAAS,KAAKA,IAAQD,GAAQC,KAASV,GAAK;AACjD,UAAIW,IAAaL,IAAQA,EAAMI,CAAK,IAAIA;AACxC,MAAAN,IAAOD,EAASC,GAAMF,EAAIS,CAAU,GAAGA,GAAYT,CAAG;AAAA,IACxD;AACA,WAAOE;AAAA,EACT;AAEA,SAAO,SAASF,GAAKC,GAAUC,GAAMQ,GAAS;AAC5C,QAAIP,IAAU,UAAU,UAAU;AAClC,WAAOJ,EAAQC,GAAKW,EAAWV,GAAUS,GAAS,CAAC,GAAGR,GAAMC,CAAO;AAAA,EACrE;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es233.js","sources":["../../../node_modules/d3-geo/src/area.js"],"sourcesContent":["import adder from \"./adder\";\nimport {atan2, cos, quarterPi, radians, sin, tau} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nexport var areaRingSum = adder();\n\nvar areaSum = adder(),\n    lambda00,\n    phi00,\n    lambda0,\n    cosPhi0,\n    sinPhi0;\n\nexport var areaStream = {\n  point: noop,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: function() {\n    areaRingSum.reset();\n    areaStream.lineStart = areaRingStart;\n    areaStream.lineEnd = areaRingEnd;\n  },\n  polygonEnd: function() {\n    var areaRing = +areaRingSum;\n    areaSum.add(areaRing < 0 ? tau + areaRing : areaRing);\n    this.lineStart = this.lineEnd = this.point = noop;\n  },\n  sphere: function() {\n    areaSum.add(tau);\n  }\n};\n\nfunction areaRingStart() {\n  areaStream.point = areaPointFirst;\n}\n\nfunction areaRingEnd() {\n  areaPoint(lambda00, phi00);\n}\n\nfunction areaPointFirst(lambda, phi) {\n  areaStream.point = areaPoint;\n  lambda00 = lambda, phi00 = phi;\n  lambda *= radians, phi *= radians;\n  lambda0 = lambda, cosPhi0 = cos(phi = phi / 2 + quarterPi), sinPhi0 = sin(phi);\n}\n\nfunction areaPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  phi = phi / 2 + quarterPi; // half the angular distance from south pole\n\n  // Spherical excess E for a spherical triangle with vertices: south pole,\n  // previous point, current point.  Uses a formula derived from Cagnoli’s\n  // theorem.  See Todhunter, Spherical Trig. (1871), Sec. 103, Eq. (2).\n  var dLambda = lambda - lambda0,\n      sdLambda = dLambda >= 0 ? 1 : -1,\n      adLambda = sdLambda * dLambda,\n      cosPhi = cos(phi),\n      sinPhi = sin(phi),\n      k = sinPhi0 * sinPhi,\n      u = cosPhi0 * cosPhi + k * cos(adLambda),\n      v = k * sdLambda * sin(adLambda);\n  areaRingSum.add(atan2(v, u));\n\n  // Advance the previous points.\n  lambda0 = lambda, cosPhi0 = cosPhi, sinPhi0 = sinPhi;\n}\n\nexport default function(object) {\n  areaSum.reset();\n  stream(object, areaStream);\n  return areaSum * 2;\n}\n"],"names":["adder"],"mappings":";AAKyBA,EAAA;AAEXA,EAAA;","x_google_ignoreList":[0]}

package/dist/index.es234.js

@@ -1,15 +1,4 @@
-import i from "./index.es222.js";
-import a from "./index.es161.js";
-function g(f, t) {
-  return function(n, r, c) {
-    var o = t ? [[], []] : {};
-    return r = i(r, c), a(n, function(u, m) {
-      var p = r(u, m, n);
-      f(o, u, p);
-    }), o;
-  };
-}
-export {
-  g as default
-};
+import r from "./index.es252.js";
+import "./index.es233.js";
+r();
 //# sourceMappingURL=index.es234.js.map

package/dist/index.es234.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es234.js","sources":["../node_modules/underscore/modules/_group.js"],"sourcesContent":["import cb from './_cb.js';\nimport each from './each.js';\n\n// An internal function used for aggregate \"group by\" operations.\nexport default function group(behavior, partition) {\n  return function(obj, iteratee, context) {\n    var result = partition ? [[], []] : {};\n    iteratee = cb(iteratee, context);\n    each(obj, function(value, index) {\n      var key = iteratee(value, index, obj);\n      behavior(result, value, key);\n    });\n    return result;\n  };\n}\n"],"names":["group","behavior","partition","obj","iteratee","context","result","cb","each","value","index","key"],"mappings":";;AAIA,SAAwBA,EAAMC,GAAUC,GAAW;AACjD,SAAO,SAASC,GAAKC,GAAUC,GAAS;AACtC,QAAIC,IAASJ,IAAY,CAAC,CAAA,GAAI,CAAA,CAAE,IAAI,CAAA;AACpC,WAAAE,IAAWG,EAAGH,GAAUC,CAAO,GAC/BG,EAAKL,GAAK,SAASM,GAAOC,GAAO;AAC/B,UAAIC,IAAMP,EAASK,GAAOC,GAAOP,CAAG;AACpC,MAAAF,EAASK,GAAQG,GAAOE,CAAG;AAAA,IAC7B,CAAC,GACML;AAAA,EACT;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es234.js","sources":["../../../node_modules/d3-geo/src/bounds.js"],"sourcesContent":["import adder from \"./adder\";\nimport {areaStream, areaRingSum} from \"./area\";\nimport {cartesian, cartesianCross, cartesianNormalizeInPlace, spherical} from \"./cartesian\";\nimport {abs, degrees, epsilon, radians} from \"./math\";\nimport stream from \"./stream\";\n\nvar lambda0, phi0, lambda1, phi1, // bounds\n    lambda2, // previous lambda-coordinate\n    lambda00, phi00, // first point\n    p0, // previous 3D point\n    deltaSum = adder(),\n    ranges,\n    range;\n\nvar boundsStream = {\n  point: boundsPoint,\n  lineStart: boundsLineStart,\n  lineEnd: boundsLineEnd,\n  polygonStart: function() {\n    boundsStream.point = boundsRingPoint;\n    boundsStream.lineStart = boundsRingStart;\n    boundsStream.lineEnd = boundsRingEnd;\n    deltaSum.reset();\n    areaStream.polygonStart();\n  },\n  polygonEnd: function() {\n    areaStream.polygonEnd();\n    boundsStream.point = boundsPoint;\n    boundsStream.lineStart = boundsLineStart;\n    boundsStream.lineEnd = boundsLineEnd;\n    if (areaRingSum < 0) lambda0 = -(lambda1 = 180), phi0 = -(phi1 = 90);\n    else if (deltaSum > epsilon) phi1 = 90;\n    else if (deltaSum < -epsilon) phi0 = -90;\n    range[0] = lambda0, range[1] = lambda1;\n  }\n};\n\nfunction boundsPoint(lambda, phi) {\n  ranges.push(range = [lambda0 = lambda, lambda1 = lambda]);\n  if (phi < phi0) phi0 = phi;\n  if (phi > phi1) phi1 = phi;\n}\n\nfunction linePoint(lambda, phi) {\n  var p = cartesian([lambda * radians, phi * radians]);\n  if (p0) {\n    var normal = cartesianCross(p0, p),\n        equatorial = [normal[1], -normal[0], 0],\n        inflection = cartesianCross(equatorial, normal);\n    cartesianNormalizeInPlace(inflection);\n    inflection = spherical(inflection);\n    var delta = lambda - lambda2,\n        sign = delta > 0 ? 1 : -1,\n        lambdai = inflection[0] * degrees * sign,\n        phii,\n        antimeridian = abs(delta) > 180;\n    if (antimeridian ^ (sign * lambda2 < lambdai && lambdai < sign * lambda)) {\n      phii = inflection[1] * degrees;\n      if (phii > phi1) phi1 = phii;\n    } else if (lambdai = (lambdai + 360) % 360 - 180, antimeridian ^ (sign * lambda2 < lambdai && lambdai < sign * lambda)) {\n      phii = -inflection[1] * degrees;\n      if (phii < phi0) phi0 = phii;\n    } else {\n      if (phi < phi0) phi0 = phi;\n      if (phi > phi1) phi1 = phi;\n    }\n    if (antimeridian) {\n      if (lambda < lambda2) {\n        if (angle(lambda0, lambda) > angle(lambda0, lambda1)) lambda1 = lambda;\n      } else {\n        if (angle(lambda, lambda1) > angle(lambda0, lambda1)) lambda0 = lambda;\n      }\n    } else {\n      if (lambda1 >= lambda0) {\n        if (lambda < lambda0) lambda0 = lambda;\n        if (lambda > lambda1) lambda1 = lambda;\n      } else {\n        if (lambda > lambda2) {\n          if (angle(lambda0, lambda) > angle(lambda0, lambda1)) lambda1 = lambda;\n        } else {\n          if (angle(lambda, lambda1) > angle(lambda0, lambda1)) lambda0 = lambda;\n        }\n      }\n    }\n  } else {\n    ranges.push(range = [lambda0 = lambda, lambda1 = lambda]);\n  }\n  if (phi < phi0) phi0 = phi;\n  if (phi > phi1) phi1 = phi;\n  p0 = p, lambda2 = lambda;\n}\n\nfunction boundsLineStart() {\n  boundsStream.point = linePoint;\n}\n\nfunction boundsLineEnd() {\n  range[0] = lambda0, range[1] = lambda1;\n  boundsStream.point = boundsPoint;\n  p0 = null;\n}\n\nfunction boundsRingPoint(lambda, phi) {\n  if (p0) {\n    var delta = lambda - lambda2;\n    deltaSum.add(abs(delta) > 180 ? delta + (delta > 0 ? 360 : -360) : delta);\n  } else {\n    lambda00 = lambda, phi00 = phi;\n  }\n  areaStream.point(lambda, phi);\n  linePoint(lambda, phi);\n}\n\nfunction boundsRingStart() {\n  areaStream.lineStart();\n}\n\nfunction boundsRingEnd() {\n  boundsRingPoint(lambda00, phi00);\n  areaStream.lineEnd();\n  if (abs(deltaSum) > epsilon) lambda0 = -(lambda1 = 180);\n  range[0] = lambda0, range[1] = lambda1;\n  p0 = null;\n}\n\n// Finds the left-right distance between two longitudes.\n// This is almost the same as (lambda1 - lambda0 + 360°) % 360°, except that we want\n// the distance between ±180° to be 360°.\nfunction angle(lambda0, lambda1) {\n  return (lambda1 -= lambda0) < 0 ? lambda1 + 360 : lambda1;\n}\n\nfunction rangeCompare(a, b) {\n  return a[0] - b[0];\n}\n\nfunction rangeContains(range, x) {\n  return range[0] <= range[1] ? range[0] <= x && x <= range[1] : x < range[0] || range[1] < x;\n}\n\nexport default function(feature) {\n  var i, n, a, b, merged, deltaMax, delta;\n\n  phi1 = lambda1 = -(lambda0 = phi0 = Infinity);\n  ranges = [];\n  stream(feature, boundsStream);\n\n  // First, sort ranges by their minimum longitudes.\n  if (n = ranges.length) {\n    ranges.sort(rangeCompare);\n\n    // Then, merge any ranges that overlap.\n    for (i = 1, a = ranges[0], merged = [a]; i < n; ++i) {\n      b = ranges[i];\n      if (rangeContains(a, b[0]) || rangeContains(a, b[1])) {\n        if (angle(a[0], b[1]) > angle(a[0], a[1])) a[1] = b[1];\n        if (angle(b[0], a[1]) > angle(a[0], a[1])) a[0] = b[0];\n      } else {\n        merged.push(a = b);\n      }\n    }\n\n    // Finally, find the largest gap between the merged ranges.\n    // The final bounding box will be the inverse of this gap.\n    for (deltaMax = -Infinity, n = merged.length - 1, i = 0, a = merged[n]; i <= n; a = b, ++i) {\n      b = merged[i];\n      if ((delta = angle(a[1], b[0])) > deltaMax) deltaMax = delta, lambda0 = b[0], lambda1 = a[1];\n    }\n  }\n\n  ranges = range = null;\n\n  return lambda0 === Infinity || phi0 === Infinity\n      ? [[NaN, NaN], [NaN, NaN]]\n      : [[lambda0, phi0], [lambda1, phi1]];\n}\n"],"names":["adder"],"mappings":";;AAUeA,EAAA;","x_google_ignoreList":[0]}

package/dist/index.es235.js

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

package/dist/index.es235.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es235.js","sources":["../node_modules/underscore/modules/_keyInObj.js"],"sourcesContent":["// Internal `_.pick` helper function to determine whether `key` is an enumerable\n// property name of `obj`.\nexport default function keyInObj(value, key, obj) {\n  return key in obj;\n}\n"],"names":["keyInObj","value","key","obj"],"mappings":"AAEA,SAAwBA,EAASC,GAAOC,GAAKC,GAAK;AAChD,SAAOD,KAAOC;AAChB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es235.js","sources":["../../../node_modules/d3-geo/src/rotation.js"],"sourcesContent":["import compose from \"./compose\";\nimport {asin, atan2, cos, degrees, pi, radians, sin, tau} from \"./math\";\n\nfunction rotationIdentity(lambda, phi) {\n  return [lambda > pi ? lambda - tau : lambda < -pi ? lambda + tau : lambda, phi];\n}\n\nrotationIdentity.invert = rotationIdentity;\n\nexport function rotateRadians(deltaLambda, deltaPhi, deltaGamma) {\n  return (deltaLambda %= tau) ? (deltaPhi || deltaGamma ? compose(rotationLambda(deltaLambda), rotationPhiGamma(deltaPhi, deltaGamma))\n    : rotationLambda(deltaLambda))\n    : (deltaPhi || deltaGamma ? rotationPhiGamma(deltaPhi, deltaGamma)\n    : rotationIdentity);\n}\n\nfunction forwardRotationLambda(deltaLambda) {\n  return function(lambda, phi) {\n    return lambda += deltaLambda, [lambda > pi ? lambda - tau : lambda < -pi ? lambda + tau : lambda, phi];\n  };\n}\n\nfunction rotationLambda(deltaLambda) {\n  var rotation = forwardRotationLambda(deltaLambda);\n  rotation.invert = forwardRotationLambda(-deltaLambda);\n  return rotation;\n}\n\nfunction rotationPhiGamma(deltaPhi, deltaGamma) {\n  var cosDeltaPhi = cos(deltaPhi),\n      sinDeltaPhi = sin(deltaPhi),\n      cosDeltaGamma = cos(deltaGamma),\n      sinDeltaGamma = sin(deltaGamma);\n\n  function rotation(lambda, phi) {\n    var cosPhi = cos(phi),\n        x = cos(lambda) * cosPhi,\n        y = sin(lambda) * cosPhi,\n        z = sin(phi),\n        k = z * cosDeltaPhi + x * sinDeltaPhi;\n    return [\n      atan2(y * cosDeltaGamma - k * sinDeltaGamma, x * cosDeltaPhi - z * sinDeltaPhi),\n      asin(k * cosDeltaGamma + y * sinDeltaGamma)\n    ];\n  }\n\n  rotation.invert = function(lambda, phi) {\n    var cosPhi = cos(phi),\n        x = cos(lambda) * cosPhi,\n        y = sin(lambda) * cosPhi,\n        z = sin(phi),\n        k = z * cosDeltaGamma - y * sinDeltaGamma;\n    return [\n      atan2(y * cosDeltaGamma + z * sinDeltaGamma, x * cosDeltaPhi + k * sinDeltaPhi),\n      asin(k * cosDeltaPhi - x * sinDeltaPhi)\n    ];\n  };\n\n  return rotation;\n}\n\nexport default function(rotate) {\n  rotate = rotateRadians(rotate[0] * radians, rotate[1] * radians, rotate.length > 2 ? rotate[2] * radians : 0);\n\n  function forward(coordinates) {\n    coordinates = rotate(coordinates[0] * radians, coordinates[1] * radians);\n    return coordinates[0] *= degrees, coordinates[1] *= degrees, coordinates;\n  }\n\n  forward.invert = function(coordinates) {\n    coordinates = rotate.invert(coordinates[0] * radians, coordinates[1] * radians);\n    return coordinates[0] *= degrees, coordinates[1] *= degrees, coordinates;\n  };\n\n  return forward;\n}\n"],"names":["rotationIdentity","lambda","phi","pi","tau","rotateRadians","deltaLambda","deltaPhi","deltaGamma","compose","rotationLambda","rotationPhiGamma","forwardRotationLambda","rotation","cosDeltaPhi","cos","sinDeltaPhi","sin","cosDeltaGamma","sinDeltaGamma","cosPhi","x","y","z","k","atan2","asin"],"mappings":";;AAGA,SAASA,EAAiBC,GAAQC,GAAK;AACrC,SAAO,CAACD,IAASE,IAAKF,IAASG,IAAMH,IAAS,CAACE,IAAKF,IAASG,IAAMH,GAAQC,CAAG;AAChF;AAEAF,EAAiB,SAASA;AAEnB,SAASK,EAAcC,GAAaC,GAAUC,GAAY;AAC/D,UAAQF,KAAeF,KAAQG,KAAYC,IAAaC,EAAQC,EAAeJ,CAAW,GAAGK,EAAiBJ,GAAUC,CAAU,CAAC,IAC/HE,EAAeJ,CAAW,IACzBC,KAAYC,IAAaG,EAAiBJ,GAAUC,CAAU,IAC/DR;AACN;AAEA,SAASY,EAAsBN,GAAa;AAC1C,SAAO,SAASL,GAAQC,GAAK;AAC3B,WAAOD,KAAUK,GAAa,CAACL,IAASE,IAAKF,IAASG,IAAMH,IAAS,CAACE,IAAKF,IAASG,IAAMH,GAAQC,CAAG;AAAA,EACvG;AACF;AAEA,SAASQ,EAAeJ,GAAa;AACnC,MAAIO,IAAWD,EAAsBN,CAAW;AAChD,SAAAO,EAAS,SAASD,EAAsB,CAACN,CAAW,GAC7CO;AACT;AAEA,SAASF,EAAiBJ,GAAUC,GAAY;AAC9C,MAAIM,IAAcC,EAAIR,CAAQ,GAC1BS,IAAcC,EAAIV,CAAQ,GAC1BW,IAAgBH,EAAIP,CAAU,GAC9BW,IAAgBF,EAAIT,CAAU;AAElC,WAASK,EAASZ,GAAQC,GAAK;AAC7B,QAAIkB,IAASL,EAAIb,CAAG,GAChBmB,IAAIN,EAAId,CAAM,IAAImB,GAClBE,IAAIL,EAAIhB,CAAM,IAAImB,GAClBG,IAAIN,EAAIf,CAAG,GACXsB,IAAID,IAAIT,IAAcO,IAAIL;AAC9B,WAAO;AAAA,MACLS,EAAMH,IAAIJ,IAAgBM,IAAIL,GAAeE,IAAIP,IAAcS,IAAIP,CAAW;AAAA,MAC9EU,EAAKF,IAAIN,IAAgBI,IAAIH,CAAa;AAAA,IAAA;AAAA,EAE9C;AAEA,SAAAN,EAAS,SAAS,SAASZ,GAAQC,GAAK;AACtC,QAAIkB,IAASL,EAAIb,CAAG,GAChBmB,IAAIN,EAAId,CAAM,IAAImB,GAClBE,IAAIL,EAAIhB,CAAM,IAAImB,GAClBG,IAAIN,EAAIf,CAAG,GACXsB,IAAID,IAAIL,IAAgBI,IAAIH;AAChC,WAAO;AAAA,MACLM,EAAMH,IAAIJ,IAAgBK,IAAIJ,GAAeE,IAAIP,IAAcU,IAAIR,CAAW;AAAA,MAC9EU,EAAKF,IAAIV,IAAcO,IAAIL,CAAW;AAAA,IAAA;AAAA,EAE1C,GAEOH;AACT;","x_google_ignoreList":[0]}

package/dist/index.es236.js

@@ -1,8 +1,4 @@
-import a from "./index.es41.js";
-function r(t, n) {
-  return t._chain ? a(n).chain() : n;
-}
-export {
-  r as default
-};
+import o from "./index.es274.js";
+import r from "./index.es275.js";
+r(o);
 //# sourceMappingURL=index.es236.js.map

package/dist/index.es236.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es236.js","sources":["../node_modules/underscore/modules/_chainResult.js"],"sourcesContent":["import _ from './underscore.js';\n\n// Helper function to continue chaining intermediate results.\nexport default function chainResult(instance, obj) {\n  return instance._chain ? _(obj).chain() : obj;\n}\n"],"names":["chainResult","instance","obj","_"],"mappings":";AAGA,SAAwBA,EAAYC,GAAUC,GAAK;AACjD,SAAOD,EAAS,SAASE,EAAED,CAAG,EAAE,UAAUA;AAC5C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es236.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]}