@performant-software/geospatial 3.1.3 → 3.1.4-beta.0

package/dist/index.cjs21.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("react"),i=require("./index.cjs205.js"),l=require("./index.cjs25.js");function r(t){const e=l.useControl(({mapLib:n})=>new n.NavigationControl(t),{position:t.position});return o.useEffect(()=>{i.applyReactStyle(e._container,t.style)},[t.style]),null}const a=o.memo(r);exports.NavigationControl=a;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const o=require("react"),i=require("./index.cjs190.js"),l=require("./index.cjs25.js");function r(t){const e=l.useControl(({mapLib:n})=>new n.NavigationControl(t),{position:t.position});return o.useEffect(()=>{i.applyReactStyle(e._container,t.style)},[t.style]),null}const a=o.memo(r);exports.NavigationControl=a;
 //# sourceMappingURL=index.cjs21.js.map

package/dist/index.cjs210.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e={exports:{}};exports.__module=e;
+"use strict";const e=require("./index.cjs112.js"),s=require("./index.cjs209.js"),r=e(s);module.exports=r;
 //# sourceMappingURL=index.cjs210.js.map

package/dist/index.cjs210.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs210.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"index.cjs210.js","sources":["../node_modules/underscore/modules/_unescapeMap.js"],"sourcesContent":["import invert from './invert.js';\nimport escapeMap from './_escapeMap.js';\n\n// Internal list of HTML entities for unescaping.\nexport default invert(escapeMap);\n"],"names":["unescapeMap","invert","escapeMap"],"mappings":"iFAIAA,EAAeC,EAAOC,CAAS","x_google_ignoreList":[0]}

package/dist/index.cjs211.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs36.js");function u(t){var r="[object "+t+"]";return function(e){return n.toString.call(e)===r}}module.exports=u;
+"use strict";const i=require("./index.cjs123.js"),n=require("./index.cjs37.js"),s=require("./index.cjs87.js"),c=require("./index.cjs100.js"),o=require("./index.cjs128.js"),u=require("./index.cjs126.js"),q=require("./index.cjs207.js");function f(r,t,e){return r==null?i:n(r)?q(r,t,e):s(r)&&!c(r)?o(r):u(r)}module.exports=f;
 //# sourceMappingURL=index.cjs211.js.map

package/dist/index.cjs211.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs211.js","sources":["../node_modules/underscore/modules/_tagTester.js"],"sourcesContent":["import { toString } from './_setup.js';\n\n// Internal function for creating a `toString`-based type tester.\nexport default function tagTester(name) {\n  var tag = '[object ' + name + ']';\n  return function(obj) {\n    return toString.call(obj) === tag;\n  };\n}\n"],"names":["tagTester","name","tag","obj","toString"],"mappings":"iDAGA,SAAwBA,EAAUC,EAAM,CACtC,IAAIC,EAAM,WAAaD,EAAO,IAC9B,OAAO,SAASE,EAAK,CACnB,OAAOC,WAAS,KAAKD,CAAG,IAAMD,CAChC,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs211.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":"0OAWA,SAAwBA,EAAaC,EAAOC,EAASC,EAAU,CAC7D,OAAIF,GAAS,KAAaG,EACtBC,EAAWJ,CAAK,EAAUK,EAAWL,EAAOC,EAASC,CAAQ,EAC7DI,EAASN,CAAK,GAAK,CAACO,EAAQP,CAAK,EAAUQ,EAAQR,CAAK,EACrDS,EAAST,CAAK,CACvB","x_google_ignoreList":[0]}

package/dist/index.cjs212.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs36.js");function s(r,t){return r!=null&&e.hasOwnProperty.call(r,t)}module.exports=s;
+"use strict";const a=require("./index.cjs203.js"),o=require("./index.cjs87.js");function u(e,n,p,s,t){if(!(s instanceof n))return e.apply(p,t);var r=a(e.prototype),i=e.apply(r,t);return o(i)?i:r}module.exports=u;
 //# sourceMappingURL=index.cjs212.js.map

package/dist/index.cjs212.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs212.js","sources":["../node_modules/underscore/modules/_has.js"],"sourcesContent":["import { hasOwnProperty } from './_setup.js';\n\n// Internal function to check whether `key` is an own property name of `obj`.\nexport default function has(obj, key) {\n  return obj != null && hasOwnProperty.call(obj, key);\n}\n"],"names":["has","obj","key","hasOwnProperty"],"mappings":"iDAGA,SAAwBA,EAAIC,EAAKC,EAAK,CACpC,OAAOD,GAAO,MAAQE,EAAAA,eAAe,KAAKF,EAAKC,CAAG,CACpD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs212.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":"gFAMA,SAAwBA,EAAaC,EAAYC,EAAWC,EAASC,EAAgBC,EAAM,CACzF,GAAI,EAAED,aAA0BF,UAAmBD,EAAW,MAAME,EAASE,CAAI,EACjF,IAAIC,EAAOC,EAAWN,EAAW,SAAS,EACtCO,EAASP,EAAW,MAAMK,EAAMD,CAAI,EACxC,OAAII,EAASD,CAAM,EAAUA,EACtBF,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs213.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs259.js"),t=require("./index.cjs215.js"),r=e(t);module.exports=r;
+"use strict";const a=require("./index.cjs197.js"),l=require("./index.cjs216.js"),x=require("./index.cjs100.js"),L=require("./index.cjs39.js");function q(i,n,c,r){if(r=r||[],!n&&n!==0)n=1/0;else if(n<=0)return r.concat(i);for(var s=r.length,f=0,y=a(i);f<y;f++){var e=i[f];if(l(e)&&(x(e)||L(e)))if(n>1)q(e,n-1,c,r),s=r.length;else for(var g=0,A=e.length;g<A;)r[s++]=e[g++];else c||(r[s++]=e)}return r}module.exports=q;
 //# sourceMappingURL=index.cjs213.js.map

package/dist/index.cjs213.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs213.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":"iFAKAA,EAAeC,EAAwBC,CAAa","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs213.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":"8IAMA,SAAwBA,EAAQC,EAAOC,EAAOC,EAAQC,EAAQ,CAE5D,GADAA,EAASA,GAAU,CAAA,EACf,CAACF,GAASA,IAAU,EACtBA,EAAQ,YACCA,GAAS,EAClB,OAAOE,EAAO,OAAOH,CAAK,EAG5B,QADII,EAAMD,EAAO,OACRE,EAAI,EAAGC,EAASC,EAAUP,CAAK,EAAGK,EAAIC,EAAQD,IAAK,CAC1D,IAAIG,EAAQR,EAAMK,CAAC,EACnB,GAAII,EAAYD,CAAK,IAAME,EAAQF,CAAK,GAAKG,EAAYH,CAAK,GAE5D,GAAIP,EAAQ,EACVF,EAAQS,EAAOP,EAAQ,EAAGC,EAAQC,CAAM,EACxCC,EAAMD,EAAO,WAGb,SADIS,EAAI,EAAGC,EAAML,EAAM,OAChBI,EAAIC,GAAKV,EAAOC,GAAK,EAAII,EAAMI,GAAG,OAEjCV,IACVC,EAAOC,GAAK,EAAII,EAEpB,CACA,OAAOL,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs214.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs260.js"),e=t("length");module.exports=e;
+"use strict";const i=require("./index.cjs206.js"),o=require("./index.cjs197.js");function s(r){return function(n,t,c){t=i(t,c);for(var u=o(n),e=r>0?0:u-1;e>=0&&e<u;e+=r)if(t(n[e],e,n))return e;return-1}}module.exports=s;
 //# sourceMappingURL=index.cjs214.js.map

package/dist/index.cjs214.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs214.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":"kDAGAA,EAAeC,EAAgB,QAAQ","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs214.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":"iFAIA,SAAwBA,EAA2BC,EAAK,CACtD,OAAO,SAASC,EAAOC,EAAWC,EAAS,CACzCD,EAAYE,EAAGF,EAAWC,CAAO,EAGjC,QAFIE,EAASC,EAAUL,CAAK,EACxBM,EAAQP,EAAM,EAAI,EAAIK,EAAS,EAC5BE,GAAS,GAAKA,EAAQF,EAAQE,GAASP,EAC5C,GAAIE,EAAUD,EAAMM,CAAK,EAAGA,EAAON,CAAK,EAAG,OAAOM,EAEpD,MAAO,EACT,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs215.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs260.js"),e=t("byteLength");module.exports=e;
+"use strict";const o=require("./index.cjs197.js"),l=require("./index.cjs36.js"),h=require("./index.cjs102.js");function g(s,f,c){return function(t,u,e){var r=0,n=o(t);if(typeof e=="number")s>0?r=e>=0?e:Math.max(e+n,r):n=e>=0?Math.min(e+1,n):e+n+1;else if(c&&e&&n)return e=c(t,u),t[e]===u?e:-1;if(u!==u)return e=f(l.slice.call(t,r,n),h),e>=0?e+r:-1;for(e=s>0?r:n-1;e>=0&&e<n;e+=s)if(t[e]===u)return e;return-1}}module.exports=g;
 //# sourceMappingURL=index.cjs215.js.map

package/dist/index.cjs215.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs215.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":"kDAGAA,EAAeC,EAAgB,YAAY","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs215.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":"+GAKA,SAAwBA,EAAkBC,EAAKC,EAAeC,EAAa,CACzE,OAAO,SAASC,EAAOC,EAAMC,EAAK,CAChC,IAAIC,EAAI,EAAGC,EAASC,EAAUL,CAAK,EACnC,GAAI,OAAOE,GAAO,SACZL,EAAM,EACRM,EAAID,GAAO,EAAIA,EAAM,KAAK,IAAIA,EAAME,EAAQD,CAAC,EAE7CC,EAASF,GAAO,EAAI,KAAK,IAAIA,EAAM,EAAGE,CAAM,EAAIF,EAAME,EAAS,UAExDL,GAAeG,GAAOE,EAC/B,OAAAF,EAAMH,EAAYC,EAAOC,CAAI,EACtBD,EAAME,CAAG,IAAMD,EAAOC,EAAM,GAErC,GAAID,IAASA,EACX,OAAAC,EAAMJ,EAAcQ,EAAAA,MAAM,KAAKN,EAAOG,EAAGC,CAAM,EAAGG,CAAK,EAChDL,GAAO,EAAIA,EAAMC,EAAI,GAE9B,IAAKD,EAAML,EAAM,EAAIM,EAAIC,EAAS,EAAGF,GAAO,GAAKA,EAAME,EAAQF,GAAOL,EACpE,GAAIG,EAAME,CAAG,IAAMD,EAAM,OAAOC,EAElC,MAAO,EACT,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs216.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs215.js");function n(t){return new Uint8Array(t.buffer||t,t.byteOffset||0,e(t))}module.exports=n;
+"use strict";const e=require("./index.cjs237.js"),r=require("./index.cjs197.js"),t=e(r);module.exports=t;
 //# sourceMappingURL=index.cjs216.js.map

package/dist/index.cjs216.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs216.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":"kDAIA,SAAwBA,EAAaC,EAAc,CACjD,OAAO,IAAI,WACTA,EAAa,QAAUA,EACvBA,EAAa,YAAc,EAC3BC,EAAcD,CAAY,CAAA,CAE9B","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs216.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":"iFAOAA,EAAeC,EAAwBC,CAAS","x_google_ignoreList":[0]}

package/dist/index.cjs217.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index.cjs214.js"),i=require("./index.cjs37.js"),h=require("./index.cjs109.js");function d(t){var f=s(t);return function(e){if(e==null)return!1;var l=h(e);if(s(l))return!1;for(var r=0;r<f;r++)if(!i(e[t[r]]))return!1;return t!==u||!i(e[a])}}var a="forEach",o="has",n=["clear","delete"],c=["get",o,"set"],M=n.concat(a,c),u=n.concat(c),g=["add"].concat(n,a,o);exports.ie11fingerprint=d;exports.mapMethods=M;exports.setMethods=g;exports.weakMapMethods=u;
+"use strict";const g=require("./index.cjs216.js"),l=require("./index.cjs108.js"),v=require("./index.cjs207.js");function h(i){var f=function(e,u,n,s){var t=!g(e)&&l(e),c=(t||e).length,r=i>0?0:c-1;for(s||(n=e[t?t[r]:r],r+=i);r>=0&&r<c;r+=i){var a=t?t[r]:r;n=u(n,e[a],a,e)}return n};return function(e,u,n,s){var t=arguments.length>=3;return f(e,v(u,s,4),n,t)}}module.exports=h;
 //# sourceMappingURL=index.cjs217.js.map

package/dist/index.cjs217.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs217.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":"kLAQO,SAASA,EAAgBC,EAAS,CACvC,IAAIC,EAASC,EAAUF,CAAO,EAC9B,OAAO,SAASG,EAAK,CACnB,GAAIA,GAAO,KAAM,MAAO,GAExB,IAAIC,EAAOC,EAAQF,CAAG,EACtB,GAAID,EAAUE,CAAI,EAAG,MAAO,GAC5B,QAASE,EAAI,EAAGA,EAAIL,EAAQK,IAC1B,GAAI,CAACC,EAAWJ,EAAIH,EAAQM,CAAC,CAAC,CAAC,EAAG,MAAO,GAK3C,OAAON,IAAYQ,GAAkB,CAACD,EAAWJ,EAAIM,CAAW,CAAC,CACnE,CACF,CAIA,IAAIA,EAAc,UACdC,EAAU,MACVC,EAAa,CAAC,QAAS,QAAQ,EAC/BC,EAAU,CAAC,MAAOF,EAAS,KAAK,EAIzBG,EAAaF,EAAW,OAAOF,EAAaG,CAAO,EAC1DJ,EAAiBG,EAAW,OAAOC,CAAO,EAC1CE,EAAa,CAAC,KAAK,EAAE,OAAOH,EAAYF,EAAaC,CAAO","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs217.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":"gHAKA,SAAwBA,EAAaC,EAAK,CAGxC,IAAIC,EAAU,SAASC,EAAKC,EAAUC,EAAMC,EAAS,CACnD,IAAIC,EAAQ,CAACC,EAAYL,CAAG,GAAKM,EAAKN,CAAG,EACrCO,GAAUH,GAASJ,GAAK,OACxBQ,EAAQV,EAAM,EAAI,EAAIS,EAAS,EAKnC,IAJKJ,IACHD,EAAOF,EAAII,EAAQA,EAAMI,CAAK,EAAIA,CAAK,EACvCA,GAASV,GAEJU,GAAS,GAAKA,EAAQD,EAAQC,GAASV,EAAK,CACjD,IAAIW,EAAaL,EAAQA,EAAMI,CAAK,EAAIA,EACxCN,EAAOD,EAASC,EAAMF,EAAIS,CAAU,EAAGA,EAAYT,CAAG,CACxD,CACA,OAAOE,CACT,EAEA,OAAO,SAASF,EAAKC,EAAUC,EAAMQ,EAAS,CAC5C,IAAIP,EAAU,UAAU,QAAU,EAClC,OAAOJ,EAAQC,EAAKW,EAAWV,EAAUS,EAAS,CAAC,EAAGR,EAAMC,CAAO,CACrE,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs218.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs36.js"),s=require("./index.cjs37.js"),i=require("./index.cjs212.js");function a(t){for(var n={},c=t.length,o=0;o<c;++o)n[t[o]]=!0;return{contains:function(u){return n[u]===!0},push:function(u){return n[u]=!0,t.push(u)}}}function p(t,n){n=a(n);var c=e.nonEnumerableProps.length,o=t.constructor,u=s(o)&&o.prototype||e.ObjProto,r="constructor";for(i(t,r)&&!n.contains(r)&&n.push(r);c--;)r=e.nonEnumerableProps[c],r in t&&t[r]!==u[r]&&!n.contains(r)&&n.push(r)}module.exports=p;
+"use strict";const f=require("./index.cjs206.js"),p=require("./index.cjs152.js");function q(t,o){return function(n,r,s){var u=o?[[],[]]:{};return r=f(r,s),p(n,function(c,e){var i=r(c,e,n);t(u,c,i)}),u}}module.exports=q;
 //# sourceMappingURL=index.cjs218.js.map

package/dist/index.cjs218.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs218.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":"8GAQA,SAASA,EAAYC,EAAM,CAEzB,QADIC,EAAO,CAAA,EACFC,EAAIF,EAAK,OAAQG,EAAI,EAAGA,EAAID,EAAG,EAAEC,EAAGF,EAAKD,EAAKG,CAAC,CAAC,EAAI,GAC7D,MAAO,CACL,SAAU,SAASC,EAAK,CAAE,OAAOH,EAAKG,CAAG,IAAM,EAAM,EACrD,KAAM,SAASA,EAAK,CAClB,OAAAH,EAAKG,CAAG,EAAI,GACLJ,EAAK,KAAKI,CAAG,CACtB,CAAA,CAEJ,CAKA,SAAwBC,EAAoBC,EAAKN,EAAM,CACrDA,EAAOD,EAAYC,CAAI,EACvB,IAAIO,EAAaC,EAAAA,mBAAmB,OAChCC,EAAcH,EAAI,YAClBI,EAASC,EAAWF,CAAW,GAAKA,EAAY,WAAcG,EAAAA,SAG9DC,EAAO,cAGX,IAFIC,EAAIR,EAAKO,CAAI,GAAK,CAACb,EAAK,SAASa,CAAI,GAAGb,EAAK,KAAKa,CAAI,EAEnDN,KACLM,EAAOL,EAAAA,mBAAmBD,CAAU,EAChCM,KAAQP,GAAOA,EAAIO,CAAI,IAAMH,EAAMG,CAAI,GAAK,CAACb,EAAK,SAASa,CAAI,GACjEb,EAAK,KAAKa,CAAI,CAGpB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs218.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":"iFAIA,SAAwBA,EAAMC,EAAUC,EAAW,CACjD,OAAO,SAASC,EAAKC,EAAUC,EAAS,CACtC,IAAIC,EAASJ,EAAY,CAAC,CAAA,EAAI,CAAA,CAAE,EAAI,CAAA,EACpC,OAAAE,EAAWG,EAAGH,EAAUC,CAAO,EAC/BG,EAAKL,EAAK,SAASM,EAAOC,EAAO,CAC/B,IAAIC,EAAMP,EAASK,EAAOC,EAAOP,CAAG,EACpCF,EAASK,EAAQG,EAAOE,CAAG,CAC7B,CAAC,EACML,CACT,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs219.js

@@ -1,2 +1,2 @@
-"use strict";function i(v,e){return function(r){var u=arguments.length;if(e&&(r=Object(r)),u<2||r==null)return r;for(var t=1;t<u;t++)for(var f=arguments[t],g=v(f),c=g.length,n=0;n<c;n++){var a=g[n];(!e||r[a]===void 0)&&(r[a]=f[a])}return r}}module.exports=i;
+"use strict";function t(r,e,n){return e in n}module.exports=t;
 //# sourceMappingURL=index.cjs219.js.map

package/dist/index.cjs219.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs219.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","l","i","key"],"mappings":"aACA,SAAwBA,EAAeC,EAAUC,EAAU,CACzD,OAAO,SAASC,EAAK,CACnB,IAAIC,EAAS,UAAU,OAEvB,GADIF,IAAUC,EAAM,OAAOA,CAAG,GAC1BC,EAAS,GAAKD,GAAO,KAAM,OAAOA,EACtC,QAASE,EAAQ,EAAGA,EAAQD,EAAQC,IAIlC,QAHIC,EAAS,UAAUD,CAAK,EACxBE,EAAON,EAASK,CAAM,EACtBE,EAAID,EAAK,OACJE,EAAI,EAAGA,EAAID,EAAGC,IAAK,CAC1B,IAAIC,EAAMH,EAAKE,CAAC,GACZ,CAACP,GAAYC,EAAIO,CAAG,IAAM,UAAQP,EAAIO,CAAG,EAAIJ,EAAOI,CAAG,EAC7D,CAEF,OAAOP,CACT,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs219.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,EAAOC,EAAKC,EAAK,CAChD,OAAOD,KAAOC,CAChB","x_google_ignoreList":[0]}

package/dist/index.cjs22.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("react"),l=require("./index.cjs205.js"),a=require("./index.cjs25.js");function r(t){const e=a.useControl(({mapLib:u})=>new u.ScaleControl(t),{position:t.position}),i=n.useRef(t),c=i.current;i.current=t;const{style:o}=t;return t.maxWidth!==void 0&&t.maxWidth!==c.maxWidth&&(e.options.maxWidth=t.maxWidth),t.unit!==void 0&&t.unit!==c.unit&&e.setUnit(t.unit),n.useEffect(()=>{l.applyReactStyle(e._container,o)},[o]),null}n.memo(r);
+"use strict";const n=require("react"),l=require("./index.cjs190.js"),a=require("./index.cjs25.js");function r(t){const e=a.useControl(({mapLib:u})=>new u.ScaleControl(t),{position:t.position}),i=n.useRef(t),c=i.current;i.current=t;const{style:o}=t;return t.maxWidth!==void 0&&t.maxWidth!==c.maxWidth&&(e.options.maxWidth=t.maxWidth),t.unit!==void 0&&t.unit!==c.unit&&e.setUnit(t.unit),n.useEffect(()=>{l.applyReactStyle(e._container,o)},[o]),null}n.memo(r);
 //# sourceMappingURL=index.cjs22.js.map

package/dist/index.cjs220.js

@@ -1,2 +1,2 @@
-"use strict";const u=require("./index.cjs87.js"),t=require("./index.cjs36.js");function i(){return function(){}}function s(e){if(!u(e))return{};if(t.nativeCreate)return t.nativeCreate(e);var r=i();r.prototype=e;var n=new r;return r.prototype=null,n}module.exports=s;
+"use strict";const r=require("./index.cjs40.js");function c(n,e){return n._chain?r(e).chain():e}module.exports=c;
 //# sourceMappingURL=index.cjs220.js.map

package/dist/index.cjs220.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs220.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":"+EAIA,SAASA,GAAO,CACd,OAAO,UAAU,CAAC,CACpB,CAGA,SAAwBC,EAAWC,EAAW,CAC5C,GAAI,CAACC,EAASD,CAAS,QAAU,CAAA,EACjC,GAAIE,EAAAA,aAAc,OAAOA,EAAAA,aAAaF,CAAS,EAC/C,IAAIG,EAAOL,EAAA,EACXK,EAAK,UAAYH,EACjB,IAAII,EAAS,IAAID,EACjB,OAAAA,EAAK,UAAY,KACVC,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs220.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":"iDAGA,SAAwBA,EAAYC,EAAUC,EAAK,CACjD,OAAOD,EAAS,OAASE,EAAED,CAAG,EAAE,QAAUA,CAC5C","x_google_ignoreList":[0]}

package/dist/index.cjs221.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs40.js");require("./index.cjs44.js");function e(r){return t.toPath(r)}module.exports=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function G(e,f,o){if(e!==null)for(var r,i,a,c,u,t,s,y=0,l=0,h,p=e.type,C=p==="FeatureCollection",M=p==="Feature",w=C?e.features.length:1,g=0;g<w;g++){s=C?e.features[g].geometry:M?e.geometry:e,h=s?s.type==="GeometryCollection":!1,u=h?s.geometries.length:1;for(var b=0;b<u;b++){var n=0,P=0;if(c=h?s.geometries[b]:s,c!==null){t=c.coordinates;var v=c.type;switch(y=0,v){case null:break;case"Point":if(f(t,l,g,n,P)===!1)return!1;l++,n++;break;case"LineString":case"MultiPoint":for(r=0;r<t.length;r++){if(f(t[r],l,g,n,P)===!1)return!1;l++,v==="MultiPoint"&&n++}v==="LineString"&&n++;break;case"Polygon":case"MultiLineString":for(r=0;r<t.length;r++){for(i=0;i<t[r].length-y;i++){if(f(t[r][i],l,g,n,P)===!1)return!1;l++}v==="MultiLineString"&&n++,v==="Polygon"&&P++}v==="Polygon"&&n++;break;case"MultiPolygon":for(r=0;r<t.length;r++){for(P=0,i=0;i<t[r].length;i++){for(a=0;a<t[r][i].length-y;a++){if(f(t[r][i][a],l,g,n,P)===!1)return!1;l++}P++}n++}break;case"GeometryCollection":for(r=0;r<c.geometries.length;r++)if(G(c.geometries[r],f)===!1)return!1;break;default:throw new Error("Unknown Geometry Type")}}}}}function S(e,f){if(e.type==="Feature")f(e,0);else if(e.type==="FeatureCollection")for(var o=0;o<e.features.length&&f(e.features[o],o)!==!1;o++);}function E(e,f){var o,r,i,a,c,u,t,s,y,l,h=0,p=e.type==="FeatureCollection",C=e.type==="Feature",M=p?e.features.length:1;for(o=0;o<M;o++){for(u=p?e.features[o].geometry:C?e.geometry:e,s=p?e.features[o].properties:C?e.properties:{},y=p?e.features[o].bbox:C?e.bbox:void 0,l=p?e.features[o].id:C?e.id:void 0,t=u?u.type==="GeometryCollection":!1,c=t?u.geometries.length:1,i=0;i<c;i++){if(a=t?u.geometries[i]:u,a===null){if(f(null,h,s,y,l)===!1)return!1;continue}switch(a.type){case"Point":case"LineString":case"MultiPoint":case"Polygon":case"MultiLineString":case"MultiPolygon":{if(f(a,h,s,y,l)===!1)return!1;break}case"GeometryCollection":{for(r=0;r<a.geometries.length;r++)if(f(a.geometries[r],h,s,y,l)===!1)return!1;break}default:throw new Error("Unknown Geometry Type")}}h++}}exports.coordEach=G;exports.featureEach=S;exports.geomEach=E;
 //# sourceMappingURL=index.cjs221.js.map

package/dist/index.cjs221.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs221.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":"6EAKA,SAAwBA,EAAOC,EAAM,CACnC,OAAOC,EAAE,OAAOD,CAAI,CACtB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs221.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":"gFAEA,SAASA,EAAUC,EAASC,EAAUC,EAAkB,CACtD,GAAIF,IAAY,KAEhB,QADIG,EAAGC,EAAGC,EAAGC,EAAUC,EAAOC,EAAQC,EAAyBC,EAAa,EAAGC,EAAa,EAAGC,EAAsBC,EAAOb,EAAQ,KAAMc,EAAsBD,IAAS,oBAAqBE,EAAYF,IAAS,UAAWG,EAAOF,EAAsBd,EAAQ,SAAS,OAAS,EAC5QiB,EAAe,EAAGA,EAAeD,EAAMC,IAAgB,CAC9DR,EAA0BK,EAAsBd,EAAQ,SAASiB,CAAY,EAAE,SAAWF,EAAYf,EAAQ,SAAWA,EACzHY,EAAuBH,EAA0BA,EAAwB,OAAS,qBAAuB,GACzGF,EAAQK,EAAuBH,EAAwB,WAAW,OAAS,EAC3E,QAASS,EAAY,EAAGA,EAAYX,EAAOW,IAAa,CACtD,IAAIC,EAAoB,EACpBC,EAAgB,EAEpB,GADAd,EAAWM,EAAuBH,EAAwB,WAAWS,CAAS,EAAIT,EAC9EH,IAAa,KACjB,CAAAE,EAASF,EAAS,YAClB,IAAIe,EAAWf,EAAS,KAExB,OADAI,EAA+F,EACvFW,EAAA,CACN,KAAK,KACH,MACF,IAAK,QACH,GAAIpB,EACFO,EACAG,EACAM,EACAE,EACAC,CAAA,IACI,GACJ,MAAO,GACTT,IACAQ,IACA,MACF,IAAK,aACL,IAAK,aACH,IAAKhB,EAAI,EAAGA,EAAIK,EAAO,OAAQL,IAAK,CAClC,GAAIF,EACFO,EAAOL,CAAC,EACRQ,EACAM,EACAE,EACAC,CAAA,IACI,GACJ,MAAO,GACTT,IACIU,IAAa,cAAcF,GACjC,CACIE,IAAa,cAAcF,IAC/B,MACF,IAAK,UACL,IAAK,kBACH,IAAKhB,EAAI,EAAGA,EAAIK,EAAO,OAAQL,IAAK,CAClC,IAAKC,EAAI,EAAGA,EAAII,EAAOL,CAAC,EAAE,OAASO,EAAYN,IAAK,CAClD,GAAIH,EACFO,EAAOL,CAAC,EAAEC,CAAC,EACXO,EACAM,EACAE,EACAC,CAAA,IACI,GACJ,MAAO,GACTT,GACF,CACIU,IAAa,mBAAmBF,IAChCE,IAAa,WAAWD,GAC9B,CACIC,IAAa,WAAWF,IAC5B,MACF,IAAK,eACH,IAAKhB,EAAI,EAAGA,EAAIK,EAAO,OAAQL,IAAK,CAElC,IADAiB,EAAgB,EACXhB,EAAI,EAAGA,EAAII,EAAOL,CAAC,EAAE,OAAQC,IAAK,CACrC,IAAKC,EAAI,EAAGA,EAAIG,EAAOL,CAAC,EAAEC,CAAC,EAAE,OAASM,EAAYL,IAAK,CACrD,GAAIJ,EACFO,EAAOL,CAAC,EAAEC,CAAC,EAAEC,CAAC,EACdM,EACAM,EACAE,EACAC,CAAA,IACI,GACJ,MAAO,GACTT,GACF,CACAS,GACF,CACAD,GACF,CACA,MACF,IAAK,qBACH,IAAKhB,EAAI,EAAGA,EAAIG,EAAS,WAAW,OAAQH,IAC1C,GAAIJ,EAAUO,EAAS,WAAWH,CAAC,EAAGF,CAA0B,IAAM,GACpE,MAAO,GACX,MACF,QACE,MAAM,IAAI,MAAM,uBAAuB,CAAA,EAE7C,CACF,CACF,CA6CA,SAASqB,EAAYtB,EAASC,EAAU,CACtC,GAAID,EAAQ,OAAS,UACnBC,EAASD,EAAS,CAAC,UACVA,EAAQ,OAAS,oBAC1B,QAASuB,EAAI,EAAGA,EAAIvB,EAAQ,SAAS,QAC/BC,EAASD,EAAQ,SAASuB,CAAC,EAAGA,CAAC,IAAM,GADEA,IAC3C,CAGN,CAiBA,SAASC,EAASxB,EAASC,EAAU,CACnC,IAAIsB,EAAGpB,EAAGsB,EAAGnB,EAAUC,EAAOE,EAAyBG,EAAsBc,EAAmBC,EAAaC,EAAWX,EAAe,EAAGH,EAAsBd,EAAQ,OAAS,oBAAqBe,EAAYf,EAAQ,OAAS,UAAWgB,EAAOF,EAAsBd,EAAQ,SAAS,OAAS,EACrS,IAAKuB,EAAI,EAAGA,EAAIP,EAAMO,IAAK,CAOzB,IANAd,EAA0BK,EAAsBd,EAAQ,SAASuB,CAAC,EAAE,SAAWR,EAAYf,EAAQ,SAAWA,EAC9G0B,EAAoBZ,EAAsBd,EAAQ,SAASuB,CAAC,EAAE,WAAaR,EAAYf,EAAQ,WAAa,CAAA,EAC5G2B,EAAcb,EAAsBd,EAAQ,SAASuB,CAAC,EAAE,KAAOR,EAAYf,EAAQ,KAAO,OAC1F4B,EAAYd,EAAsBd,EAAQ,SAASuB,CAAC,EAAE,GAAKR,EAAYf,EAAQ,GAAK,OACpFY,EAAuBH,EAA0BA,EAAwB,OAAS,qBAAuB,GACzGF,EAAQK,EAAuBH,EAAwB,WAAW,OAAS,EACtEgB,EAAI,EAAGA,EAAIlB,EAAOkB,IAAK,CAE1B,GADAnB,EAAWM,EAAuBH,EAAwB,WAAWgB,CAAC,EAAIhB,EACtEH,IAAa,KAAM,CACrB,GAAIL,EACF,KACAgB,EACAS,EACAC,EACAC,CAAA,IACI,GACJ,MAAO,GACT,QACF,CACA,OAAQtB,EAAS,KAAA,CACf,IAAK,QACL,IAAK,aACL,IAAK,aACL,IAAK,UACL,IAAK,kBACL,IAAK,eAAgB,CACnB,GAAIL,EACFK,EACAW,EACAS,EACAC,EACAC,CAAA,IACI,GACJ,MAAO,GACT,KACF,CACA,IAAK,qBAAsB,CACzB,IAAKzB,EAAI,EAAGA,EAAIG,EAAS,WAAW,OAAQH,IAC1C,GAAIF,EACFK,EAAS,WAAWH,CAAC,EACrBc,EACAS,EACAC,EACAC,CAAA,IACI,GACJ,MAAO,GAEX,KACF,CACA,QACE,MAAM,IAAI,MAAM,uBAAuB,CAAA,CAE7C,CACAX,GACF,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs222.js

@@ -1,2 +1,2 @@
-"use strict";function u(e,t){for(var n=t.length,r=0;r<n;r++){if(e==null)return;e=e[t[r]]}return n?e:void 0}module.exports=u;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index.cjs68.js"),i=require("./index.cjs66.js");function s(n,t={}){const e=c.bbox(n),r=(e[0]+e[2])/2,o=(e[1]+e[3])/2;return i.point([r,o],t.properties,t)}exports.center=s;
 //# sourceMappingURL=index.cjs222.js.map

package/dist/index.cjs222.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs222.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":"aACA,SAAwBA,EAAQC,EAAKC,EAAM,CAEzC,QADIC,EAASD,EAAK,OACTE,EAAI,EAAGA,EAAID,EAAQC,IAAK,CAC/B,GAAIH,GAAO,KAAM,OACjBA,EAAMA,EAAIC,EAAKE,CAAC,CAAC,CACnB,CACA,OAAOD,EAASF,EAAM,MACxB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs222.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":"kJAGA,SAASA,EAAOC,EAASC,EAAU,GAAI,CACrC,MAAMC,EAAMC,EAAAA,KAAKH,CAAO,EAClBI,GAAKF,EAAI,CAAC,EAAIA,EAAI,CAAC,GAAK,EACxBG,GAAKH,EAAI,CAAC,EAAIA,EAAI,CAAC,GAAK,EAC9B,OAAOI,EAAAA,MAAM,CAACF,EAAGC,CAAC,EAAGJ,EAAQ,WAAYA,CAAO,CAClD","x_google_ignoreList":[0]}

package/dist/index.cjs223.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs40.js"),s=require("./index.cjs228.js"),n=require("./index.cjs45.js");function u(e,r,i){return t.iteratee!==n?t.iteratee(e,r):s(e,r,i)}module.exports=u;
+"use strict";const s=require("./index.cjs74.js"),r=require("./index.cjs241.js");var t=r.__require();const e=s.getDefaultExportFromCjs(t);module.exports=e;
 //# sourceMappingURL=index.cjs223.js.map

package/dist/index.cjs223.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs223.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":"8GAMA,SAAwBA,EAAGC,EAAOC,EAASC,EAAU,CACnD,OAAIC,EAAE,WAAaC,EAAiBD,EAAE,SAASH,EAAOC,CAAO,EACtDI,EAAaL,EAAOC,EAASC,CAAQ,CAC9C","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs223.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/index.cjs224.js

@@ -1,2 +1,2 @@
-"use strict";function s(r,e,t){if(e===void 0)return r;switch(t??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,l){return r.call(e,n,u,i,l)}}return function(){return r.apply(e,arguments)}}module.exports=s;
+"use strict";const e=require("./index.cjs243.js");e();e();
 //# sourceMappingURL=index.cjs224.js.map

package/dist/index.cjs224.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs224.js","sources":["../node_modules/underscore/modules/_optimizeCb.js"],"sourcesContent":["// Internal function that returns an efficient (for current engines) version\n// of the passed-in callback, to be repeatedly applied in other Underscore\n// functions.\nexport default function optimizeCb(func, context, argCount) {\n  if (context === void 0) return func;\n  switch (argCount == null ? 3 : argCount) {\n    case 1: return function(value) {\n      return func.call(context, value);\n    };\n    // The 2-argument case is omitted because we’re not using it.\n    case 3: return function(value, index, collection) {\n      return func.call(context, value, index, collection);\n    };\n    case 4: return function(accumulator, value, index, collection) {\n      return func.call(context, accumulator, value, index, collection);\n    };\n  }\n  return function() {\n    return func.apply(context, arguments);\n  };\n}\n"],"names":["optimizeCb","func","context","argCount","value","index","collection","accumulator"],"mappings":"aAGA,SAAwBA,EAAWC,EAAMC,EAASC,EAAU,CAC1D,GAAID,IAAY,OAAQ,OAAOD,EAC/B,OAAQE,GAAmB,EAAI,CAC7B,IAAK,GAAG,OAAO,SAASC,EAAO,CAC7B,OAAOH,EAAK,KAAKC,EAASE,CAAK,CACjC,EAEA,IAAK,GAAG,OAAO,SAASA,EAAOC,EAAOC,EAAY,CAChD,OAAOL,EAAK,KAAKC,EAASE,EAAOC,EAAOC,CAAU,CACpD,EACA,IAAK,GAAG,OAAO,SAASC,EAAaH,EAAOC,EAAOC,EAAY,CAC7D,OAAOL,EAAK,KAAKC,EAASK,EAAaH,EAAOC,EAAOC,CAAU,CACjE,CAAA,CAEF,OAAO,UAAW,CAChB,OAAOL,EAAK,MAAMC,EAAS,SAAS,CACtC,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs224.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":"kDAKyBA,EAAA,EAEXA,EAAA","x_google_ignoreList":[0]}

package/dist/index.cjs225.js

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs108.js");function n(r){var t=function(e){return r[e]},c="(?:"+p(r).join("|")+")",u=RegExp(c),a=RegExp(c,"g");return function(e){return e=e==null?"":""+e,u.test(e)?e.replace(a,t):e}}module.exports=n;
+"use strict";const e=require("./index.cjs243.js");require("./index.cjs224.js");e();
 //# sourceMappingURL=index.cjs225.js.map

package/dist/index.cjs225.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs225.js","sources":["../node_modules/underscore/modules/_createEscaper.js"],"sourcesContent":["import keys from './keys.js';\n\n// Internal helper to generate functions for escaping and unescaping strings\n// to/from HTML interpolation.\nexport default function createEscaper(map) {\n  var escaper = function(match) {\n    return map[match];\n  };\n  // Regexes for identifying a key that needs to be escaped.\n  var source = '(?:' + keys(map).join('|') + ')';\n  var testRegexp = RegExp(source);\n  var replaceRegexp = RegExp(source, 'g');\n  return function(string) {\n    string = string == null ? '' : '' + string;\n    return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;\n  };\n}\n"],"names":["createEscaper","map","escaper","match","source","keys","testRegexp","replaceRegexp","string"],"mappings":"kDAIA,SAAwBA,EAAcC,EAAK,CACzC,IAAIC,EAAU,SAASC,EAAO,CAC5B,OAAOF,EAAIE,CAAK,CAClB,EAEIC,EAAS,MAAQC,EAAKJ,CAAG,EAAE,KAAK,GAAG,EAAI,IACvCK,EAAa,OAAOF,CAAM,EAC1BG,EAAgB,OAAOH,EAAQ,GAAG,EACtC,OAAO,SAASI,EAAQ,CACtB,OAAAA,EAASA,GAAU,KAAO,GAAK,GAAKA,EAC7BF,EAAW,KAAKE,CAAM,EAAIA,EAAO,QAAQD,EAAeL,CAAO,EAAIM,CAC5E,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs225.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":"+EAUeA,EAAA","x_google_ignoreList":[0]}

package/dist/index.cjs226.js

@@ -1,2 +1,2 @@
-"use strict";const t={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#x27;","`":"&#x60;"};module.exports=t;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const z=require("./index.cjs256.js"),n=require("./index.cjs246.js");function R(o,t){return[o>n.pi?o-n.tau:o<-n.pi?o+n.tau:o,t]}R.invert=R;function P(o,t,r){return(o%=n.tau)?t||r?z(q(o),x(t,r)):q(o):t||r?x(t,r):R}function k(o){return function(t,r){return t+=o,[t>n.pi?t-n.tau:t<-n.pi?t+n.tau:t,r]}}function q(o){var t=k(o);return t.invert=k(-o),t}function x(o,t){var r=n.cos(o),y=n.sin(o),p=n.cos(t),D=n.sin(t);function g(i,s){var u=n.cos(s),c=n.cos(i)*u,e=n.sin(i)*u,f=n.sin(s),v=f*r+c*y;return[n.atan2(e*p-v*D,c*r-f*y),n.asin(v*p+e*D)]}return g.invert=function(i,s){var u=n.cos(s),c=n.cos(i)*u,e=n.sin(i)*u,f=n.sin(s),v=f*p-e*D;return[n.atan2(e*p+f*D,c*r+v*y),n.asin(v*r-c*y)]},g}exports.rotateRadians=P;
 //# sourceMappingURL=index.cjs226.js.map

package/dist/index.cjs226.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs226.js","sources":["../node_modules/underscore/modules/_escapeMap.js"],"sourcesContent":["// Internal list of HTML entities for escaping.\nexport default {\n  '&': '&amp;',\n  '<': '&lt;',\n  '>': '&gt;',\n  '\"': '&quot;',\n  \"'\": '&#x27;',\n  '`': '&#x60;'\n};\n"],"names":["escapeMap"],"mappings":"aACA,MAAAA,EAAe,CACb,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SACL,IAAK,QACP","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs226.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":"oJAGA,SAASA,EAAiBC,EAAQC,EAAK,CACrC,MAAO,CAACD,EAASE,KAAKF,EAASG,EAAAA,IAAMH,EAAS,CAACE,EAAAA,GAAKF,EAASG,MAAMH,EAAQC,CAAG,CAChF,CAEAF,EAAiB,OAASA,EAEnB,SAASK,EAAcC,EAAaC,EAAUC,EAAY,CAC/D,OAAQF,GAAeF,EAAAA,KAAQG,GAAYC,EAAaC,EAAQC,EAAeJ,CAAW,EAAGK,EAAiBJ,EAAUC,CAAU,CAAC,EAC/HE,EAAeJ,CAAW,EACzBC,GAAYC,EAAaG,EAAiBJ,EAAUC,CAAU,EAC/DR,CACN,CAEA,SAASY,EAAsBN,EAAa,CAC1C,OAAO,SAASL,EAAQC,EAAK,CAC3B,OAAOD,GAAUK,EAAa,CAACL,EAASE,EAAAA,GAAKF,EAASG,EAAAA,IAAMH,EAAS,CAACE,EAAAA,GAAKF,EAASG,EAAAA,IAAMH,EAAQC,CAAG,CACvG,CACF,CAEA,SAASQ,EAAeJ,EAAa,CACnC,IAAIO,EAAWD,EAAsBN,CAAW,EAChD,OAAAO,EAAS,OAASD,EAAsB,CAACN,CAAW,EAC7CO,CACT,CAEA,SAASF,EAAiBJ,EAAUC,EAAY,CAC9C,IAAIM,EAAcC,EAAAA,IAAIR,CAAQ,EAC1BS,EAAcC,EAAAA,IAAIV,CAAQ,EAC1BW,EAAgBH,EAAAA,IAAIP,CAAU,EAC9BW,EAAgBF,EAAAA,IAAIT,CAAU,EAElC,SAASK,EAASZ,EAAQC,EAAK,CAC7B,IAAIkB,EAASL,MAAIb,CAAG,EAChBmB,EAAIN,EAAAA,IAAId,CAAM,EAAImB,EAClBE,EAAIL,EAAAA,IAAIhB,CAAM,EAAImB,EAClBG,EAAIN,MAAIf,CAAG,EACXsB,EAAID,EAAIT,EAAcO,EAAIL,EAC9B,MAAO,CACLS,QAAMH,EAAIJ,EAAgBM,EAAIL,EAAeE,EAAIP,EAAcS,EAAIP,CAAW,EAC9EU,EAAAA,KAAKF,EAAIN,EAAgBI,EAAIH,CAAa,CAAA,CAE9C,CAEA,OAAAN,EAAS,OAAS,SAASZ,EAAQC,EAAK,CACtC,IAAIkB,EAASL,MAAIb,CAAG,EAChBmB,EAAIN,EAAAA,IAAId,CAAM,EAAImB,EAClBE,EAAIL,EAAAA,IAAIhB,CAAM,EAAImB,EAClBG,EAAIN,MAAIf,CAAG,EACXsB,EAAID,EAAIL,EAAgBI,EAAIH,EAChC,MAAO,CACLM,QAAMH,EAAIJ,EAAgBK,EAAIJ,EAAeE,EAAIP,EAAcU,EAAIR,CAAW,EAC9EU,EAAAA,KAAKF,EAAIV,EAAcO,EAAIL,CAAW,CAAA,CAE1C,EAEOH,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs227.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs112.js"),s=require("./index.cjs226.js"),r=e(s);module.exports=r;
+"use strict";const e=require("./index.cjs265.js"),r=require("./index.cjs266.js");r(e);
 //# sourceMappingURL=index.cjs227.js.map

package/dist/index.cjs227.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs227.js","sources":["../node_modules/underscore/modules/_unescapeMap.js"],"sourcesContent":["import invert from './invert.js';\nimport escapeMap from './_escapeMap.js';\n\n// Internal list of HTML entities for unescaping.\nexport default invert(escapeMap);\n"],"names":["unescapeMap","invert","escapeMap"],"mappings":"iFAIAA,EAAeC,EAAOC,CAAS","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs227.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":"iFAGsBA,EAASC,CAAS","x_google_ignoreList":[0]}

package/dist/index.cjs228.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs123.js"),n=require("./index.cjs37.js"),s=require("./index.cjs87.js"),c=require("./index.cjs100.js"),o=require("./index.cjs128.js"),u=require("./index.cjs126.js"),q=require("./index.cjs224.js");function f(r,t,e){return r==null?i:n(r)?q(r,t,e):s(r)&&!c(r)?o(r):u(r)}module.exports=f;
+"use strict";const Q=require("./index.cjs243.js"),e=require("./index.cjs245.js"),r=require("./index.cjs246.js");var w=Q();function R(x,g){var a=g[0],i=g[1],O=[r.sin(a),-r.cos(a),0],v=0,y=0;w.reset();for(var f=0,P=x.length;f<P;++f)if(q=(t=x[f]).length)for(var t,q,n=t[q-1],C=n[0],B=n[1]/2+r.quarterPi,E=r.sin(B),F=r.cos(B),z=0;z<q;++z,C=I,E=H,F=J,n=c){var c=t[z],I=c[0],G=c[1]/2+r.quarterPi,H=r.sin(G),J=r.cos(G),s=I-C,N=s>=0?1:-1,l=N*s,o=l>r.pi,K=E*H;if(w.add(r.atan2(K*N*r.sin(l),F*J+K*r.cos(l))),v+=o?s+N*r.tau:s,o^C>=a^I>=a){var u=e.cartesianCross(e.cartesian(n),e.cartesian(c));e.cartesianNormalizeInPlace(u);var L=e.cartesianCross(O,u);e.cartesianNormalizeInPlace(L);var M=(o^s>=0?-1:1)*r.asin(L[2]);(i>M||i===M&&(u[0]||u[1]))&&(y+=o^s>=0?1:-1)}}return(v<-r.epsilon||v<r.epsilon&&w<-r.epsilon)^y&1}module.exports=R;
 //# sourceMappingURL=index.cjs228.js.map

package/dist/index.cjs228.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs228.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":"0OAWA,SAAwBA,EAAaC,EAAOC,EAASC,EAAU,CAC7D,OAAIF,GAAS,KAAaG,EACtBC,EAAWJ,CAAK,EAAUK,EAAWL,EAAOC,EAASC,CAAQ,EAC7DI,EAASN,CAAK,GAAK,CAACO,EAAQP,CAAK,EAAUQ,EAAQR,CAAK,EACrDS,EAAST,CAAK,CACvB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs228.js","sources":["../../../node_modules/d3-geo/src/polygonContains.js"],"sourcesContent":["import adder from \"./adder\";\nimport {cartesian, cartesianCross, cartesianNormalizeInPlace} from \"./cartesian\";\nimport {asin, atan2, cos, epsilon, pi, quarterPi, sin, tau} from \"./math\";\n\nvar sum = adder();\n\nexport default function(polygon, point) {\n  var lambda = point[0],\n      phi = point[1],\n      normal = [sin(lambda), -cos(lambda), 0],\n      angle = 0,\n      winding = 0;\n\n  sum.reset();\n\n  for (var i = 0, n = polygon.length; i < n; ++i) {\n    if (!(m = (ring = polygon[i]).length)) continue;\n    var ring,\n        m,\n        point0 = ring[m - 1],\n        lambda0 = point0[0],\n        phi0 = point0[1] / 2 + quarterPi,\n        sinPhi0 = sin(phi0),\n        cosPhi0 = cos(phi0);\n\n    for (var j = 0; j < m; ++j, lambda0 = lambda1, sinPhi0 = sinPhi1, cosPhi0 = cosPhi1, point0 = point1) {\n      var point1 = ring[j],\n          lambda1 = point1[0],\n          phi1 = point1[1] / 2 + quarterPi,\n          sinPhi1 = sin(phi1),\n          cosPhi1 = cos(phi1),\n          delta = lambda1 - lambda0,\n          sign = delta >= 0 ? 1 : -1,\n          absDelta = sign * delta,\n          antimeridian = absDelta > pi,\n          k = sinPhi0 * sinPhi1;\n\n      sum.add(atan2(k * sign * sin(absDelta), cosPhi0 * cosPhi1 + k * cos(absDelta)));\n      angle += antimeridian ? delta + sign * tau : delta;\n\n      // Are the longitudes either side of the point’s meridian (lambda),\n      // and are the latitudes smaller than the parallel (phi)?\n      if (antimeridian ^ lambda0 >= lambda ^ lambda1 >= lambda) {\n        var arc = cartesianCross(cartesian(point0), cartesian(point1));\n        cartesianNormalizeInPlace(arc);\n        var intersection = cartesianCross(normal, arc);\n        cartesianNormalizeInPlace(intersection);\n        var phiArc = (antimeridian ^ delta >= 0 ? -1 : 1) * asin(intersection[2]);\n        if (phi > phiArc || phi === phiArc && (arc[0] || arc[1])) {\n          winding += antimeridian ^ delta >= 0 ? 1 : -1;\n        }\n      }\n    }\n  }\n\n  // First, determine whether the South pole is inside or outside:\n  //\n  // It is inside if:\n  // * the polygon winds around it in a clockwise direction.\n  // * the polygon does not (cumulatively) wind around it, but has a negative\n  //   (counter-clockwise) area.\n  //\n  // Second, count the (signed) number of times a segment crosses a lambda\n  // from the point to the South pole.  If it is zero, then the point is the\n  // same side as the South pole.\n\n  return (angle < -epsilon || angle < epsilon && sum < -epsilon) ^ (winding & 1);\n}\n"],"names":["sum","adder","polygonContains","polygon","point","lambda","phi","normal","sin","cos","angle","winding","i","n","m","ring","point0","lambda0","phi0","quarterPi","sinPhi0","cosPhi0","j","lambda1","sinPhi1","cosPhi1","point1","phi1","delta","sign","absDelta","antimeridian","pi","k","atan2","tau","arc","cartesianCross","cartesian","cartesianNormalizeInPlace","intersection","phiArc","asin","epsilon"],"mappings":"gHAIA,IAAIA,EAAMC,EAAA,EAEV,SAAAC,EAAwBC,EAASC,EAAO,CACtC,IAAIC,EAASD,EAAM,CAAC,EAChBE,EAAMF,EAAM,CAAC,EACbG,EAAS,CAACC,EAAAA,IAAIH,CAAM,EAAG,CAACI,EAAAA,IAAIJ,CAAM,EAAG,CAAC,EACtCK,EAAQ,EACRC,EAAU,EAEdX,EAAI,MAAA,EAEJ,QAASY,EAAI,EAAGC,EAAIV,EAAQ,OAAQS,EAAIC,EAAG,EAAED,EAC3C,GAAME,GAAKC,EAAOZ,EAAQS,CAAC,GAAG,OAS9B,QARIG,EACAD,EACAE,EAASD,EAAKD,EAAI,CAAC,EACnBG,EAAUD,EAAO,CAAC,EAClBE,EAAOF,EAAO,CAAC,EAAI,EAAIG,EAAAA,UACvBC,EAAUZ,MAAIU,CAAI,EAClBG,EAAUZ,EAAAA,IAAIS,CAAI,EAEbI,EAAI,EAAGA,EAAIR,EAAG,EAAEQ,EAAGL,EAAUM,EAASH,EAAUI,EAASH,EAAUI,EAAST,EAASU,EAAQ,CACpG,IAAIA,EAASX,EAAKO,CAAC,EACfC,EAAUG,EAAO,CAAC,EAClBC,EAAOD,EAAO,CAAC,EAAI,EAAIP,EAAAA,UACvBK,EAAUhB,MAAImB,CAAI,EAClBF,EAAUhB,EAAAA,IAAIkB,CAAI,EAClBC,EAAQL,EAAUN,EAClBY,EAAOD,GAAS,EAAI,EAAI,GACxBE,EAAWD,EAAOD,EAClBG,EAAeD,EAAWE,KAC1BC,EAAIb,EAAUI,EAOlB,GALAxB,EAAI,IAAIkC,EAAAA,MAAMD,EAAIJ,EAAOrB,EAAAA,IAAIsB,CAAQ,EAAGT,EAAUI,EAAUQ,EAAIxB,EAAAA,IAAIqB,CAAQ,CAAC,CAAC,EAC9EpB,GAASqB,EAAeH,EAAQC,EAAOM,EAAAA,IAAMP,EAIzCG,EAAed,GAAWZ,EAASkB,GAAWlB,EAAQ,CACxD,IAAI+B,EAAMC,EAAAA,eAAeC,EAAAA,UAAUtB,CAAM,EAAGsB,EAAAA,UAAUZ,CAAM,CAAC,EAC7Da,EAAAA,0BAA0BH,CAAG,EAC7B,IAAII,EAAeH,EAAAA,eAAe9B,EAAQ6B,CAAG,EAC7CG,EAAAA,0BAA0BC,CAAY,EACtC,IAAIC,GAAUV,EAAeH,GAAS,EAAI,GAAK,GAAKc,EAAAA,KAAKF,EAAa,CAAC,CAAC,GACpElC,EAAMmC,GAAUnC,IAAQmC,IAAWL,EAAI,CAAC,GAAKA,EAAI,CAAC,MACpDzB,GAAWoB,EAAeH,GAAS,EAAI,EAAI,GAE/C,CACF,CAcF,OAAQlB,EAAQ,CAACiC,EAAAA,SAAWjC,EAAQiC,EAAAA,SAAW3C,EAAM,CAAC2C,WAAYhC,EAAU,CAC9E","x_google_ignoreList":[0]}

package/dist/index.cjs229.js

@@ -1,2 +1,2 @@
-"use strict";const a=require("./index.cjs220.js"),o=require("./index.cjs87.js");function u(e,n,p,s,t){if(!(s instanceof n))return e.apply(p,t);var r=a(e.prototype),i=e.apply(r,t);return o(i)?i:r}module.exports=u;
+"use strict";const e=require("./index.cjs243.js");e();
 //# sourceMappingURL=index.cjs229.js.map

package/dist/index.cjs229.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs229.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":"gFAMA,SAAwBA,EAAaC,EAAYC,EAAWC,EAASC,EAAgBC,EAAM,CACzF,GAAI,EAAED,aAA0BF,UAAmBD,EAAW,MAAME,EAASE,CAAI,EACjF,IAAIC,EAAOC,EAAWN,EAAW,SAAS,EACtCO,EAASP,EAAW,MAAMK,EAAMD,CAAI,EACxC,OAAII,EAASD,CAAM,EAAUA,EACtBF,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs229.js","sources":["../../../node_modules/d3-geo/src/length.js"],"sourcesContent":["import adder from \"./adder\";\nimport {abs, atan2, cos, radians, sin, sqrt} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nvar lengthSum = adder(),\n    lambda0,\n    sinPhi0,\n    cosPhi0;\n\nvar lengthStream = {\n  sphere: noop,\n  point: noop,\n  lineStart: lengthLineStart,\n  lineEnd: noop,\n  polygonStart: noop,\n  polygonEnd: noop\n};\n\nfunction lengthLineStart() {\n  lengthStream.point = lengthPointFirst;\n  lengthStream.lineEnd = lengthLineEnd;\n}\n\nfunction lengthLineEnd() {\n  lengthStream.point = lengthStream.lineEnd = noop;\n}\n\nfunction lengthPointFirst(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  lambda0 = lambda, sinPhi0 = sin(phi), cosPhi0 = cos(phi);\n  lengthStream.point = lengthPoint;\n}\n\nfunction lengthPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var sinPhi = sin(phi),\n      cosPhi = cos(phi),\n      delta = abs(lambda - lambda0),\n      cosDelta = cos(delta),\n      sinDelta = sin(delta),\n      x = cosPhi * sinDelta,\n      y = cosPhi0 * sinPhi - sinPhi0 * cosPhi * cosDelta,\n      z = sinPhi0 * sinPhi + cosPhi0 * cosPhi * cosDelta;\n  lengthSum.add(atan2(sqrt(x * x + y * y), z));\n  lambda0 = lambda, sinPhi0 = sinPhi, cosPhi0 = cosPhi;\n}\n\nexport default function(object) {\n  lengthSum.reset();\n  stream(object, lengthStream);\n  return +lengthSum;\n}\n"],"names":["adder"],"mappings":"kDAKgBA,EAAA","x_google_ignoreList":[0]}

package/dist/index.cjs23.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("react"),r=require("./index.cjs205.js"),l=require("./index.cjs25.js");function c(e){const n=l.useControl(({mapLib:o})=>new o.TerrainControl(e),{position:e.position});return t.useEffect(()=>{r.applyReactStyle(n._container,e.style)},[e.style]),null}t.memo(c);
+"use strict";const t=require("react"),r=require("./index.cjs190.js"),l=require("./index.cjs25.js");function c(e){const n=l.useControl(({mapLib:o})=>new o.TerrainControl(e),{position:e.position});return t.useEffect(()=>{r.applyReactStyle(n._container,e.style)},[e.style]),null}t.memo(c);
 //# sourceMappingURL=index.cjs23.js.map

package/dist/index.cjs230.js

@@ -1,2 +1,2 @@
-"use strict";const a=require("./index.cjs214.js"),l=require("./index.cjs233.js"),x=require("./index.cjs100.js"),L=require("./index.cjs39.js");function q(i,n,c,r){if(r=r||[],!n&&n!==0)n=1/0;else if(n<=0)return r.concat(i);for(var s=r.length,f=0,y=a(i);f<y;f++){var e=i[f];if(l(e)&&(x(e)||L(e)))if(n>1)q(e,n-1,c,r),s=r.length;else for(var g=0,A=e.length;g<A;)r[s++]=e[g++];else c||(r[s++]=e)}return r}module.exports=q;
+"use strict";const e=require("./index.cjs243.js");e();e();
 //# sourceMappingURL=index.cjs230.js.map

package/dist/index.cjs230.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs230.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":"8IAMA,SAAwBA,EAAQC,EAAOC,EAAOC,EAAQC,EAAQ,CAE5D,GADAA,EAASA,GAAU,CAAA,EACf,CAACF,GAASA,IAAU,EACtBA,EAAQ,YACCA,GAAS,EAClB,OAAOE,EAAO,OAAOH,CAAK,EAG5B,QADII,EAAMD,EAAO,OACRE,EAAI,EAAGC,EAASC,EAAUP,CAAK,EAAGK,EAAIC,EAAQD,IAAK,CAC1D,IAAIG,EAAQR,EAAMK,CAAC,EACnB,GAAII,EAAYD,CAAK,IAAME,EAAQF,CAAK,GAAKG,EAAYH,CAAK,GAE5D,GAAIP,EAAQ,EACVF,EAAQS,EAAOP,EAAQ,EAAGC,EAAQC,CAAM,EACxCC,EAAMD,EAAO,WAGb,SADIS,EAAI,EAAGC,EAAML,EAAM,OAChBI,EAAIC,GAAKV,EAAOC,GAAK,EAAII,EAAMI,GAAG,OAEjCV,IACVC,EAAOC,GAAK,EAAII,EAEpB,CACA,OAAOL,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs230.js","sources":["../../../node_modules/d3-geo/src/path/area.js"],"sourcesContent":["import adder from \"../adder\";\nimport {abs} from \"../math\";\nimport noop from \"../noop\";\n\nvar areaSum = adder(),\n    areaRingSum = adder(),\n    x00,\n    y00,\n    x0,\n    y0;\n\nvar areaStream = {\n  point: noop,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: function() {\n    areaStream.lineStart = areaRingStart;\n    areaStream.lineEnd = areaRingEnd;\n  },\n  polygonEnd: function() {\n    areaStream.lineStart = areaStream.lineEnd = areaStream.point = noop;\n    areaSum.add(abs(areaRingSum));\n    areaRingSum.reset();\n  },\n  result: function() {\n    var area = areaSum / 2;\n    areaSum.reset();\n    return area;\n  }\n};\n\nfunction areaRingStart() {\n  areaStream.point = areaPointFirst;\n}\n\nfunction areaPointFirst(x, y) {\n  areaStream.point = areaPoint;\n  x00 = x0 = x, y00 = y0 = y;\n}\n\nfunction areaPoint(x, y) {\n  areaRingSum.add(y0 * x - x0 * y);\n  x0 = x, y0 = y;\n}\n\nfunction areaRingEnd() {\n  areaPoint(x00, y00);\n}\n\nexport default areaStream;\n"],"names":["adder"],"mappings":"kDAIcA,IACIA","x_google_ignoreList":[0]}

package/dist/index.cjs231.js

@@ -1,2 +1,2 @@
-"use strict";const i=require("./index.cjs223.js"),o=require("./index.cjs214.js");function s(r){return function(n,t,c){t=i(t,c);for(var u=o(n),e=r>0?0:u-1;e>=0&&e<u;e+=r)if(t(n[e],e,n))return e;return-1}}module.exports=s;
+"use strict";const e=require("./index.cjs243.js");e();
 //# sourceMappingURL=index.cjs231.js.map

package/dist/index.cjs231.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs231.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":"iFAIA,SAAwBA,EAA2BC,EAAK,CACtD,OAAO,SAASC,EAAOC,EAAWC,EAAS,CACzCD,EAAYE,EAAGF,EAAWC,CAAO,EAGjC,QAFIE,EAASC,EAAUL,CAAK,EACxBM,EAAQP,EAAM,EAAI,EAAIK,EAAS,EAC5BE,GAAS,GAAKA,EAAQF,EAAQE,GAASP,EAC5C,GAAIE,EAAUD,EAAMM,CAAK,EAAGA,EAAON,CAAK,EAAG,OAAOM,EAEpD,MAAO,EACT,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs231.js","sources":["../../../node_modules/d3-geo/src/path/measure.js"],"sourcesContent":["import adder from \"../adder\";\nimport {sqrt} from \"../math\";\nimport noop from \"../noop\";\n\nvar lengthSum = adder(),\n    lengthRing,\n    x00,\n    y00,\n    x0,\n    y0;\n\nvar lengthStream = {\n  point: noop,\n  lineStart: function() {\n    lengthStream.point = lengthPointFirst;\n  },\n  lineEnd: function() {\n    if (lengthRing) lengthPoint(x00, y00);\n    lengthStream.point = noop;\n  },\n  polygonStart: function() {\n    lengthRing = true;\n  },\n  polygonEnd: function() {\n    lengthRing = null;\n  },\n  result: function() {\n    var length = +lengthSum;\n    lengthSum.reset();\n    return length;\n  }\n};\n\nfunction lengthPointFirst(x, y) {\n  lengthStream.point = lengthPoint;\n  x00 = x0 = x, y00 = y0 = y;\n}\n\nfunction lengthPoint(x, y) {\n  x0 -= x, y0 -= y;\n  lengthSum.add(sqrt(x0 * x0 + y0 * y0));\n  x0 = x, y0 = y;\n}\n\nexport default lengthStream;\n"],"names":["adder"],"mappings":"kDAIgBA,EAAA","x_google_ignoreList":[0]}

package/dist/index.cjs232.js

@@ -1,2 +1,2 @@
-"use strict";const o=require("./index.cjs214.js"),l=require("./index.cjs36.js"),h=require("./index.cjs102.js");function g(s,f,c){return function(t,u,e){var r=0,n=o(t);if(typeof e=="number")s>0?r=e>=0?e:Math.max(e+n,r):n=e>=0?Math.min(e+1,n):e+n+1;else if(c&&e&&n)return e=c(t,u),t[e]===u?e:-1;if(u!==u)return e=f(l.slice.call(t,r,n),h),e>=0?e+r:-1;for(e=s>0?r:n-1;e>=0&&e<n;e+=s)if(t[e]===u)return e;return-1}}module.exports=g;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function i(t){return function(n){var r=new o;for(var e in t)r[e]=t[e];return r.stream=n,r}}function o(){}o.prototype={constructor:o,point:function(t,n){this.stream.point(t,n)},sphere:function(){this.stream.sphere()},lineStart:function(){this.stream.lineStart()},lineEnd:function(){this.stream.lineEnd()},polygonStart:function(){this.stream.polygonStart()},polygonEnd:function(){this.stream.polygonEnd()}};exports.transformer=i;
 //# sourceMappingURL=index.cjs232.js.map

package/dist/index.cjs232.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs232.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":"+GAKA,SAAwBA,EAAkBC,EAAKC,EAAeC,EAAa,CACzE,OAAO,SAASC,EAAOC,EAAMC,EAAK,CAChC,IAAIC,EAAI,EAAGC,EAASC,EAAUL,CAAK,EACnC,GAAI,OAAOE,GAAO,SACZL,EAAM,EACRM,EAAID,GAAO,EAAIA,EAAM,KAAK,IAAIA,EAAME,EAAQD,CAAC,EAE7CC,EAASF,GAAO,EAAI,KAAK,IAAIA,EAAM,EAAGE,CAAM,EAAIF,EAAME,EAAS,UAExDL,GAAeG,GAAOE,EAC/B,OAAAF,EAAMH,EAAYC,EAAOC,CAAI,EACtBD,EAAME,CAAG,IAAMD,EAAOC,EAAM,GAErC,GAAID,IAASA,EACX,OAAAC,EAAMJ,EAAcQ,EAAAA,MAAM,KAAKN,EAAOG,EAAGC,CAAM,EAAGG,CAAK,EAChDL,GAAO,EAAIA,EAAMC,EAAI,GAE9B,IAAKD,EAAML,EAAM,EAAIM,EAAIC,EAAS,EAAGF,GAAO,GAAKA,EAAME,EAAQF,GAAOL,EACpE,GAAIG,EAAME,CAAG,IAAMD,EAAM,OAAOC,EAElC,MAAO,EACT,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs232.js","sources":["../../../node_modules/d3-geo/src/transform.js"],"sourcesContent":["export default function(methods) {\n  return {\n    stream: transformer(methods)\n  };\n}\n\nexport function transformer(methods) {\n  return function(stream) {\n    var s = new TransformStream;\n    for (var key in methods) s[key] = methods[key];\n    s.stream = stream;\n    return s;\n  };\n}\n\nfunction TransformStream() {}\n\nTransformStream.prototype = {\n  constructor: TransformStream,\n  point: function(x, y) { this.stream.point(x, y); },\n  sphere: function() { this.stream.sphere(); },\n  lineStart: function() { this.stream.lineStart(); },\n  lineEnd: function() { this.stream.lineEnd(); },\n  polygonStart: function() { this.stream.polygonStart(); },\n  polygonEnd: function() { this.stream.polygonEnd(); }\n};\n"],"names":["transformer","methods","stream","s","TransformStream","key","x","y"],"mappings":"gFAMO,SAASA,EAAYC,EAAS,CACnC,OAAO,SAASC,EAAQ,CACtB,IAAIC,EAAI,IAAIC,EACZ,QAASC,KAAOJ,EAASE,EAAEE,CAAG,EAAIJ,EAAQI,CAAG,EAC7C,OAAAF,EAAE,OAASD,EACJC,CACT,CACF,CAEA,SAASC,GAAkB,CAAC,CAE5BA,EAAgB,UAAY,CAC1B,YAAaA,EACb,MAAO,SAASE,EAAGC,EAAG,CAAE,KAAK,OAAO,MAAMD,EAAGC,CAAC,CAAG,EACjD,OAAQ,UAAW,CAAE,KAAK,OAAO,OAAA,CAAU,EAC3C,UAAW,UAAW,CAAE,KAAK,OAAO,UAAA,CAAa,EACjD,QAAS,UAAW,CAAE,KAAK,OAAO,QAAA,CAAW,EAC7C,aAAc,UAAW,CAAE,KAAK,OAAO,aAAA,CAAgB,EACvD,WAAY,UAAW,CAAE,KAAK,OAAO,WAAA,CAAc,CACrD","x_google_ignoreList":[0]}