@performant-software/geospatial 3.0.5 → 3.0.6-beta.0

package/dist/index.es209.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es209.js","sources":["../../../node_modules/underscore/modules/_isBufferLike.js"],"sourcesContent":["import createSizePropertyCheck from './_createSizePropertyCheck.js';\nimport getByteLength from './_getByteLength.js';\n\n// Internal helper to determine whether we should spend extensive checks against\n// `ArrayBuffer` et al.\nexport default createSizePropertyCheck(getByteLength);\n"],"names":["isBufferLike","createSizePropertyCheck","getByteLength"],"mappings":";;AAKA,MAAeA,IAAAC,EAAwBC,CAAa;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es209.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;AAAmB,WAAAD,EAAW,MAAME,GAASE,CAAI;AAC7E,MAAAC,IAAOC,EAAWN,EAAW,SAAS,GACtCO,IAASP,EAAW,MAAMK,GAAMD,CAAI;AACxC,SAAII,EAASD,CAAM,IAAUA,IACtBF;AACT;","x_google_ignoreList":[0]}

package/dist/index.es210.js

@@ -1,6 +1,26 @@
-import t from "./index.es236.js";
-const o = t("length");
+import l from "./index.es194.js";
+import y from "./index.es213.js";
+import A from "./index.es95.js";
+import c from "./index.es27.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;
+}
 export {
-  o as default
+  x as default
 };
 //# sourceMappingURL=index.es210.js.map

package/dist/index.es210.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es210.js","sources":["../../../node_modules/underscore/modules/_getLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `length` property of an object.\nexport default shallowProperty('length');\n"],"names":["getLength","shallowProperty"],"mappings":";AAGA,MAAeA,IAAAC,EAAgB,QAAQ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es210.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;AAExD,MADJA,IAASA,KAAU,IACf,CAACF,KAASA,MAAU;AACd,IAAAA,IAAA;AAAA,WACCA,KAAS;AACX,WAAAE,EAAO,OAAOH,CAAK;AAGnB,WADLI,IAAMD,EAAO,QACRE,IAAI,GAAGC,IAASC,EAAUP,CAAK,GAAGK,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAQR,EAAMK,CAAC;AACf,QAAAI,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;AAAY,UAAAV,EAAAC,GAAK,IAAII,EAAMI,GAAG;AAAA;AAE7C,MAAYV,MACVC,EAAOC,GAAK,IAAII;AAAA,EAEpB;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es211.js

@@ -1,6 +1,15 @@
-import t from "./index.es236.js";
-const o = t("byteLength");
+import u from "./index.es203.js";
+import i from "./index.es194.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;
+  };
+}
 export {
-  o as default
+  g as default
 };
 //# sourceMappingURL=index.es211.js.map

package/dist/index.es211.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es211.js","sources":["../../../node_modules/underscore/modules/_getByteLength.js"],"sourcesContent":["import shallowProperty from './_shallowProperty.js';\n\n// Internal helper to obtain the `byteLength` property of an object.\nexport default shallowProperty('byteLength');\n"],"names":["getByteLength","shallowProperty"],"mappings":";AAGA,MAAeA,IAAAC,EAAgB,YAAY;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es211.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;AAC/C,SAAA,SAASC,GAAOC,GAAWC,GAAS;AAC7B,IAAAD,IAAAE,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;AAAU,eAAAM;AAE7C,WAAA;AAAA,EAAA;AAEX;","x_google_ignoreList":[0]}

package/dist/index.es212.js

@@ -1,12 +1,22 @@
-import e from "./index.es211.js";
-function i(t) {
-  return new Uint8Array(
-    t.buffer || t,
-    t.byteOffset || 0,
-    e(t)
-  );
+import c from "./index.es194.js";
+import { slice as m } from "./index.es24.js";
+import p from "./index.es97.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;
+  };
 }
 export {
-  i as default
+  M as default
 };
 //# sourceMappingURL=index.es212.js.map

package/dist/index.es212.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es212.js","sources":["../../../node_modules/underscore/modules/_toBufferView.js"],"sourcesContent":["import getByteLength from './_getByteLength.js';\n\n// Internal function to wrap or shallow-copy an ArrayBuffer,\n// typed array or DataView to a new view, reusing the buffer.\nexport default function toBufferView(bufferSource) {\n  return new Uint8Array(\n    bufferSource.buffer || bufferSource,\n    bufferSource.byteOffset || 0,\n    getByteLength(bufferSource)\n  );\n}\n"],"names":["toBufferView","bufferSource","getByteLength"],"mappings":";AAIA,SAAwBA,EAAaC,GAAc;AACjD,SAAO,IAAI;AAAA,IACTA,EAAa,UAAUA;AAAA,IACvBA,EAAa,cAAc;AAAA,IAC3BC,EAAcD,CAAY;AAAA,EAAA;AAE9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es212.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":";;;AAKwB,SAAAA,EAAkBC,GAAKC,GAAeC,GAAa;AAClE,SAAA,SAASC,GAAOC,GAAMC,GAAK;AAChC,QAAIC,IAAI,GAAGC,IAASC,EAAUL,CAAK;AAC/B,QAAA,OAAOE,KAAO;AAChB,MAAIL,IAAM,IACRM,IAAID,KAAO,IAAIA,IAAM,KAAK,IAAIA,IAAME,GAAQD,CAAC,IAEpCC,IAAAF,KAAO,IAAI,KAAK,IAAIA,IAAM,GAAGE,CAAM,IAAIF,IAAME,IAAS;AAAA,aAExDL,KAAeG,KAAOE;AACzB,aAAAF,IAAAH,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;AAEzB,SAAAD,IAAML,IAAM,IAAIM,IAAIC,IAAS,GAAGF,KAAO,KAAKA,IAAME,GAAQF,KAAOL;AAChE,UAAAG,EAAME,CAAG,MAAMD;AAAa,eAAAC;AAE3B,WAAA;AAAA,EAAA;AAEX;","x_google_ignoreList":[0]}

package/dist/index.es213.js

@@ -1,25 +1,7 @@
-import o from "./index.es210.js";
-import f from "./index.es25.js";
-import m from "./index.es104.js";
-function v(e) {
-  var l = o(e);
-  return function(r) {
-    if (r == null)
-      return !1;
-    var s = m(r);
-    if (o(s))
-      return !1;
-    for (var a = 0; a < l; a++)
-      if (!f(r[e[a]]))
-        return !1;
-    return e !== u || !f(r[t]);
-  };
-}
-var t = "forEach", c = "has", n = ["clear", "delete"], i = ["get", c, "set"], d = n.concat(t, i), u = n.concat(i), M = ["add"].concat(n, t, c);
+import e from "./index.es237.js";
+import r from "./index.es194.js";
+const i = e(r);
 export {
-  v as ie11fingerprint,
-  d as mapMethods,
-  M as setMethods,
-  u as weakMapMethods
+  i as default
 };
 //# sourceMappingURL=index.es213.js.map

package/dist/index.es213.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es213.js","sources":["../../../node_modules/underscore/modules/_methodFingerprint.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport isFunction from './isFunction.js';\nimport allKeys from './allKeys.js';\n\n// Since the regular `Object.prototype.toString` type tests don't work for\n// some types in IE 11, we use a fingerprinting heuristic instead, based\n// on the methods. It's not great, but it's the best we got.\n// The fingerprint method lists are defined below.\nexport function ie11fingerprint(methods) {\n  var length = getLength(methods);\n  return function(obj) {\n    if (obj == null) return false;\n    // `Map`, `WeakMap` and `Set` have no enumerable keys.\n    var keys = allKeys(obj);\n    if (getLength(keys)) return false;\n    for (var i = 0; i < length; i++) {\n      if (!isFunction(obj[methods[i]])) return false;\n    }\n    // If we are testing against `WeakMap`, we need to ensure that\n    // `obj` doesn't have a `forEach` method in order to distinguish\n    // it from a regular `Map`.\n    return methods !== weakMapMethods || !isFunction(obj[forEachName]);\n  };\n}\n\n// In the interest of compact minification, we write\n// each string in the fingerprints only once.\nvar forEachName = 'forEach',\n    hasName = 'has',\n    commonInit = ['clear', 'delete'],\n    mapTail = ['get', hasName, 'set'];\n\n// `Map`, `WeakMap` and `Set` each have slightly different\n// combinations of the above sublists.\nexport var mapMethods = commonInit.concat(forEachName, mapTail),\n    weakMapMethods = commonInit.concat(mapTail),\n    setMethods = ['add'].concat(commonInit, forEachName, hasName);\n"],"names":["ie11fingerprint","methods","length","getLength","obj","keys","allKeys","i","isFunction","weakMapMethods","forEachName","hasName","commonInit","mapTail","mapMethods","setMethods"],"mappings":";;;AAQO,SAASA,EAAgBC,GAAS;AACnC,MAAAC,IAASC,EAAUF,CAAO;AAC9B,SAAO,SAASG,GAAK;AACnB,QAAIA,KAAO;AAAa,aAAA;AAEpB,QAAAC,IAAOC,EAAQF,CAAG;AACtB,QAAID,EAAUE,CAAI;AAAU,aAAA;AAC5B,aAASE,IAAI,GAAGA,IAAIL,GAAQK;AAC1B,UAAI,CAACC,EAAWJ,EAAIH,EAAQM,CAAC,CAAC,CAAC;AAAU,eAAA;AAK3C,WAAON,MAAYQ,KAAkB,CAACD,EAAWJ,EAAIM,CAAW,CAAC;AAAA,EAAA;AAErE;AAIA,IAAIA,IAAc,WACdC,IAAU,OACVC,IAAa,CAAC,SAAS,QAAQ,GAC/BC,IAAU,CAAC,OAAOF,GAAS,KAAK,GAIzBG,IAAaF,EAAW,OAAOF,GAAaG,CAAO,GAC1DJ,IAAiBG,EAAW,OAAOC,CAAO,GAC1CE,IAAa,CAAC,KAAK,EAAE,OAAOH,GAAYF,GAAaC,CAAO;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es213.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,MAAeA,IAAAC,EAAwBC,CAAS;","x_google_ignoreList":[0]}

package/dist/index.es214.js

@@ -1,25 +1,21 @@
-import { ObjProto as p, nonEnumerableProps as a } from "./index.es24.js";
-import i from "./index.es25.js";
-import f from "./index.es208.js";
-function e(n) {
-  for (var r = {}, c = n.length, o = 0; o < c; ++o)
-    r[n[o]] = !0;
-  return {
-    contains: function(u) {
-      return r[u] === !0;
-    },
-    push: function(u) {
-      return r[u] = !0, n.push(u);
+import p from "./index.es213.js";
+import s from "./index.es103.js";
+import g from "./index.es204.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);
   };
-}
-function l(n, r) {
-  r = e(r);
-  var c = a.length, o = n.constructor, u = i(o) && o.prototype || p, t = "constructor";
-  for (f(n, t) && !r.contains(t) && r.push(t); c--; )
-    t = a[c], t in n && n[t] !== u[t] && !r.contains(t) && r.push(t);
 }
 export {
-  l as default
+  k as default
 };
 //# sourceMappingURL=index.es214.js.map

package/dist/index.es214.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es214.js","sources":["../../../node_modules/underscore/modules/_collectNonEnumProps.js"],"sourcesContent":["import { nonEnumerableProps, ObjProto } from './_setup.js';\nimport isFunction from './isFunction.js';\nimport has from './_has.js';\n\n// Internal helper to create a simple lookup structure.\n// `collectNonEnumProps` used to depend on `_.contains`, but this led to\n// circular imports. `emulatedSet` is a one-off solution that only works for\n// arrays of strings.\nfunction emulatedSet(keys) {\n  var hash = {};\n  for (var l = keys.length, i = 0; i < l; ++i) hash[keys[i]] = true;\n  return {\n    contains: function(key) { return hash[key] === true; },\n    push: function(key) {\n      hash[key] = true;\n      return keys.push(key);\n    }\n  };\n}\n\n// Internal helper. Checks `keys` for the presence of keys in IE < 9 that won't\n// be iterated by `for key in ...` and thus missed. Extends `keys` in place if\n// needed.\nexport default function collectNonEnumProps(obj, keys) {\n  keys = emulatedSet(keys);\n  var nonEnumIdx = nonEnumerableProps.length;\n  var constructor = obj.constructor;\n  var proto = (isFunction(constructor) && constructor.prototype) || ObjProto;\n\n  // Constructor is a special case.\n  var prop = 'constructor';\n  if (has(obj, prop) && !keys.contains(prop)) keys.push(prop);\n\n  while (nonEnumIdx--) {\n    prop = nonEnumerableProps[nonEnumIdx];\n    if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {\n      keys.push(prop);\n    }\n  }\n}\n"],"names":["emulatedSet","keys","hash","l","i","key","collectNonEnumProps","obj","nonEnumIdx","nonEnumerableProps","constructor","proto","isFunction","ObjProto","prop","has"],"mappings":";;;AAQA,SAASA,EAAYC,GAAM;AAEzB,WADIC,IAAO,CAAA,GACFC,IAAIF,EAAK,QAAQG,IAAI,GAAGA,IAAID,GAAG,EAAEC;AAAQ,IAAAF,EAAAD,EAAKG,CAAC,CAAC,IAAI;AACtD,SAAA;AAAA,IACL,UAAU,SAASC,GAAK;AAAS,aAAAH,EAAKG,CAAG,MAAM;AAAA,IAAM;AAAA,IACrD,MAAM,SAASA,GAAK;AAClB,aAAAH,EAAKG,CAAG,IAAI,IACLJ,EAAK,KAAKI,CAAG;AAAA,IACtB;AAAA,EAAA;AAEJ;AAKwB,SAAAC,EAAoBC,GAAKN,GAAM;AACrD,EAAAA,IAAOD,EAAYC,CAAI;AACvB,MAAIO,IAAaC,EAAmB,QAChCC,IAAcH,EAAI,aAClBI,IAASC,EAAWF,CAAW,KAAKA,EAAY,aAAcG,GAG9DC,IAAO;AAGX,OAFIC,EAAIR,GAAKO,CAAI,KAAK,CAACb,EAAK,SAASa,CAAI,KAAGb,EAAK,KAAKa,CAAI,GAEnDN;AACL,IAAAM,IAAOL,EAAmBD,CAAU,GAChCM,KAAQP,KAAOA,EAAIO,CAAI,MAAMH,EAAMG,CAAI,KAAK,CAACb,EAAK,SAASa,CAAI,KACjEb,EAAK,KAAKa,CAAI;AAGpB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es214.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,GAC9BA,KAAAV,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;AACO,WAAAE;AAAA,EAAA;AAGT,SAAO,SAASF,GAAKC,GAAUC,GAAMQ,GAAS;AACxC,QAAAP,IAAU,UAAU,UAAU;AAC3B,WAAAJ,EAAQC,GAAKW,EAAWV,GAAUS,GAAS,CAAC,GAAGR,GAAMC,CAAO;AAAA,EAAA;AAEvE;","x_google_ignoreList":[0]}

package/dist/index.es215.js

@@ -1,17 +1,15 @@
-function c(v, e) {
-  return function(r) {
-    var f = arguments.length;
-    if (e && (r = Object(r)), f < 2 || r == null)
-      return r;
-    for (var t = 1; t < f; t++)
-      for (var u = arguments[t], g = v(u), l = g.length, n = 0; n < l; n++) {
-        var a = g[n];
-        (!e || r[a] === void 0) && (r[a] = u[a]);
-      }
-    return r;
+import i from "./index.es203.js";
+import a from "./index.es147.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 {
-  c as default
+  g as default
 };
 //# sourceMappingURL=index.es215.js.map

package/dist/index.es215.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es215.js","sources":["../../../node_modules/underscore/modules/_createAssigner.js"],"sourcesContent":["// An internal function for creating assigner functions.\nexport default function createAssigner(keysFunc, defaults) {\n  return function(obj) {\n    var length = arguments.length;\n    if (defaults) obj = Object(obj);\n    if (length < 2 || obj == null) return obj;\n    for (var index = 1; index < length; index++) {\n      var source = arguments[index],\n          keys = keysFunc(source),\n          l = keys.length;\n      for (var i = 0; i < l; i++) {\n        var key = keys[i];\n        if (!defaults || obj[key] === void 0) obj[key] = source[key];\n      }\n    }\n    return obj;\n  };\n}\n"],"names":["createAssigner","keysFunc","defaults","obj","length","index","source","keys","i","key"],"mappings":"AACwB,SAAAA,EAAeC,GAAUC,GAAU;AACzD,SAAO,SAASC,GAAK;AACnB,QAAIC,IAAS,UAAU;AAEnB,QADAF,MAAUC,IAAM,OAAOA,CAAG,IAC1BC,IAAS,KAAKD,KAAO;AAAa,aAAAA;AACtC,aAASE,IAAQ,GAAGA,IAAQD,GAAQC;AAIlC,eAHIC,IAAS,UAAUD,CAAK,GACxBE,IAAON,EAASK,CAAM,GACtB,IAAIC,EAAK,QACJC,IAAI,GAAGA,IAAI,GAAGA,KAAK;AACtB,YAAAC,IAAMF,EAAKC,CAAC;AAChB,SAAI,CAACN,KAAYC,EAAIM,CAAG,MAAM,YAAYN,EAAAM,CAAG,IAAIH,EAAOG,CAAG;AAAA,MAC7D;AAEK,WAAAN;AAAA,EAAA;AAEX;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es215.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":";;AAIwB,SAAAA,EAAMC,GAAUC,GAAW;AAC1C,SAAA,SAASC,GAAKC,GAAUC,GAAS;AAClC,QAAAC,IAASJ,IAAY,CAAC,IAAI,CAAE,CAAA,IAAI,CAAA;AACzB,WAAAE,IAAAG,EAAGH,GAAUC,CAAO,GAC1BG,EAAAL,GAAK,SAASM,GAAOC,GAAO;AAC/B,UAAIC,IAAMP,EAASK,GAAOC,GAAOP,CAAG;AAC3B,MAAAF,EAAAK,GAAQG,GAAOE,CAAG;AAAA,IAAA,CAC5B,GACML;AAAA,EAAA;AAEX;","x_google_ignoreList":[0]}

package/dist/index.es216.js

@@ -1,20 +1,7 @@
-import o from "./index.es82.js";
-import { nativeCreate as e } from "./index.es24.js";
-function u() {
-  return function() {
-  };
-}
-function f(r) {
-  if (!o(r))
-    return {};
-  if (e)
-    return e(r);
-  var t = u();
-  t.prototype = r;
-  var n = new t();
-  return t.prototype = null, n;
+function u(t, e, n) {
+  return e in n;
 }
 export {
-  f as default
+  u as default
 };
 //# sourceMappingURL=index.es216.js.map

package/dist/index.es216.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es216.js","sources":["../../../node_modules/underscore/modules/_baseCreate.js"],"sourcesContent":["import isObject from './isObject.js';\nimport { nativeCreate } from './_setup.js';\n\n// Create a naked function reference for surrogate-prototype-swapping.\nfunction ctor() {\n  return function(){};\n}\n\n// An internal function for creating a new object that inherits from another.\nexport default function baseCreate(prototype) {\n  if (!isObject(prototype)) return {};\n  if (nativeCreate) return nativeCreate(prototype);\n  var Ctor = ctor();\n  Ctor.prototype = prototype;\n  var result = new Ctor;\n  Ctor.prototype = null;\n  return result;\n}\n"],"names":["ctor","baseCreate","prototype","isObject","nativeCreate","Ctor","result"],"mappings":";;AAIA,SAASA,IAAO;AACd,SAAO,WAAU;AAAA,EAAA;AACnB;AAGA,SAAwBC,EAAWC,GAAW;AACxC,MAAA,CAACC,EAASD,CAAS;AAAG,WAAO;AAC7B,MAAAE;AAAc,WAAOA,EAAaF,CAAS;AAC/C,MAAIG,IAAOL;AACX,EAAAK,EAAK,YAAYH;AACjB,MAAII,IAAS,IAAID;AACjB,SAAAA,EAAK,YAAY,MACVC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es216.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":"AAEwB,SAAAA,EAASC,GAAOC,GAAKC,GAAK;AAChD,SAAOD,KAAOC;AAChB;","x_google_ignoreList":[0]}

package/dist/index.es217.js

@@ -1,9 +1,8 @@
-import o from "./index.es28.js";
-import "./index.es32.js";
-function e(t) {
-  return o.toPath(t);
+import a from "./index.es28.js";
+function r(t, n) {
+  return t._chain ? a(n).chain() : n;
 }
 export {
-  e as default
+  r as default
 };
 //# sourceMappingURL=index.es217.js.map

package/dist/index.es217.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es217.js","sources":["../../../node_modules/underscore/modules/_toPath.js"],"sourcesContent":["import _ from './underscore.js';\nimport './toPath.js';\n\n// Internal wrapper for `_.toPath` to enable minification.\n// Similar to `cb` for `_.iteratee`.\nexport default function toPath(path) {\n  return _.toPath(path);\n}\n"],"names":["toPath","path","_"],"mappings":";;AAKA,SAAwBA,EAAOC,GAAM;AAC5B,SAAAC,EAAE,OAAOD,CAAI;AACtB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es217.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":";AAGwB,SAAAA,EAAYC,GAAUC,GAAK;AACjD,SAAOD,EAAS,SAASE,EAAED,CAAG,EAAE,MAAU,IAAAA;AAC5C;","x_google_ignoreList":[0]}

package/dist/index.es218.js

@@ -1,12 +1,5 @@
-function l(e, n) {
-  for (var t = n.length, r = 0; r < t; r++) {
-    if (e == null)
-      return;
-    e = e[n[r]];
-  }
-  return t ? e : void 0;
-}
+var a = {};
 export {
-  l as default
+  a as __exports
 };
 //# sourceMappingURL=index.es218.js.map

package/dist/index.es218.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es218.js","sources":["../../../node_modules/underscore/modules/_deepGet.js"],"sourcesContent":["// Internal function to obtain a nested property in `obj` along `path`.\nexport default function deepGet(obj, path) {\n  var length = path.length;\n  for (var i = 0; i < length; i++) {\n    if (obj == null) return void 0;\n    obj = obj[path[i]];\n  }\n  return length ? obj : void 0;\n}\n"],"names":["deepGet","obj","path","length","i"],"mappings":"AACwB,SAAAA,EAAQC,GAAKC,GAAM;AAEzC,WADIC,IAASD,EAAK,QACTE,IAAI,GAAGA,IAAID,GAAQC,KAAK;AAC/B,QAAIH,KAAO;AAAa;AAClB,IAAAA,IAAAA,EAAIC,EAAKE,CAAC,CAAC;AAAA,EACnB;AACA,SAAOD,IAASF,IAAM;AACxB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es218.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es219.js

@@ -1,10 +1,11 @@
-import t from "./index.es28.js";
-import o from "./index.es224.js";
-import a from "./index.es33.js";
-function n(e, r, i) {
-  return t.iteratee !== a ? t.iteratee(e, r) : o(e, r, i);
+import i from "./index.es57.js";
+import { point as m } from "./index.es55.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 {
-  n as default
+  x as default
 };
 //# sourceMappingURL=index.es219.js.map

package/dist/index.es219.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es219.js","sources":["../../../node_modules/underscore/modules/_cb.js"],"sourcesContent":["import _ from './underscore.js';\nimport baseIteratee from './_baseIteratee.js';\nimport iteratee from './iteratee.js';\n\n// The function we call internally to generate a callback. It invokes\n// `_.iteratee` if overridden, otherwise `baseIteratee`.\nexport default function cb(value, context, argCount) {\n  if (_.iteratee !== iteratee) return _.iteratee(value, context);\n  return baseIteratee(value, context, argCount);\n}\n"],"names":["cb","value","context","argCount","_","iteratee","baseIteratee"],"mappings":";;;AAMwB,SAAAA,EAAGC,GAAOC,GAASC,GAAU;AACnD,SAAIC,EAAE,aAAaC,IAAiBD,EAAE,SAASH,GAAOC,CAAO,IACtDI,EAAaL,GAAOC,GAASC,CAAQ;AAC9C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es219.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.es220.js

@@ -1,25 +1,151 @@
-function a(r, e, l) {
-  if (e === void 0)
-    return r;
-  switch (l ?? 3) {
-    case 1:
-      return function(n) {
-        return r.call(e, n);
-      };
-    case 3:
-      return function(n, u, i) {
-        return r.call(e, n, u, i);
-      };
-    case 4:
-      return function(n, u, i, t) {
-        return r.call(e, n, u, i, t);
-      };
+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++;
   }
-  return function() {
-    return r.apply(e, arguments);
-  };
 }
 export {
-  a as default
+  b as coordEach,
+  S as featureEach,
+  k as geomEach
 };
 //# sourceMappingURL=index.es220.js.map