@performant-software/geospatial 3.1.28-beta.0 → 3.1.29

package/dist/index.cjs423.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs423.js","sources":["../../../node_modules/lodash-es/toNumber.js"],"sourcesContent":["import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n"],"names":["NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","toNumber","value","isSymbol","isObject","other","baseTrim","isBinary"],"mappings":"gHAKA,IAAIA,EAAM,IAGNC,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAe,SAyBnB,SAASC,EAASC,EAAO,CACvB,GAAI,OAAOA,GAAS,SAClB,OAAOA,EAET,GAAIC,EAASD,CAAK,EAChB,OAAON,EAET,GAAIQ,EAASF,CAAK,EAAG,CACnB,IAAIG,EAAQ,OAAOH,EAAM,SAAW,WAAaA,EAAM,UAAYA,EACnEA,EAAQE,EAASC,CAAK,EAAKA,EAAQ,GAAMA,CAC3C,CACA,GAAI,OAAOH,GAAS,SAClB,OAAOA,IAAU,EAAIA,EAAQ,CAACA,EAEhCA,EAAQI,EAASJ,CAAK,EACtB,IAAIK,EAAWT,EAAW,KAAKI,CAAK,EACpC,OAAQK,GAAYR,EAAU,KAAKG,CAAK,EACpCF,EAAaE,EAAM,MAAM,CAAC,EAAGK,EAAW,EAAI,CAAC,EAC5CV,EAAW,KAAKK,CAAK,EAAIN,EAAM,CAACM,CACvC","x_google_ignoreList":[0]}

package/dist/index.cjs424.js

@@ -0,0 +1,2 @@
+"use strict";function t(n,s){return n===s||n!==n&&s!==s}module.exports=t;
+//# sourceMappingURL=index.cjs424.js.map

package/dist/index.cjs424.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs424.js","sources":["../../../node_modules/lodash-es/eq.js"],"sourcesContent":["/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n"],"names":["eq","value","other"],"mappings":"aAgCA,SAASA,EAAGC,EAAOC,EAAO,CACxB,OAAOD,IAAUC,GAAUD,IAAUA,GAASC,IAAUA,CAC1D","x_google_ignoreList":[0]}

package/dist/index.cjs425.js

@@ -0,0 +1,2 @@
+"use strict";const e=require("./index.cjs426.js"),s=require("./index.cjs427.js");var t=Object.prototype,n=t.hasOwnProperty,o=t.propertyIsEnumerable,a=e(function(){return arguments}())?e:function(r){return s(r)&&n.call(r,"callee")&&!o.call(r,"callee")};module.exports=a;
+//# sourceMappingURL=index.cjs425.js.map

package/dist/index.cjs425.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs425.js","sources":["../../../node_modules/lodash-es/isArguments.js"],"sourcesContent":["import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\n"],"names":["objectProto","hasOwnProperty","propertyIsEnumerable","isArguments","baseIsArguments","value","isObjectLike"],"mappings":"iFAIA,IAAIA,EAAc,OAAO,UAGrBC,EAAiBD,EAAY,eAG7BE,EAAuBF,EAAY,qBAoBnCG,EAAcC,EAAgB,UAAW,CAAE,OAAO,SAAW,GAAG,EAAIA,EAAkB,SAASC,EAAO,CACxG,OAAOC,EAAaD,CAAK,GAAKJ,EAAe,KAAKI,EAAO,QAAQ,GAC/D,CAACH,EAAqB,KAAKG,EAAO,QAAQ,CAC9C","x_google_ignoreList":[0]}

package/dist/index.cjs426.js

@@ -0,0 +1,2 @@
+"use strict";const r=require("./index.cjs436.js"),s=require("./index.cjs427.js");var t="[object Arguments]";function n(e){return s(e)&&r(e)==t}module.exports=n;
+//# sourceMappingURL=index.cjs426.js.map

package/dist/index.cjs426.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs426.js","sources":["../../../node_modules/lodash-es/_baseIsArguments.js"],"sourcesContent":["import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nexport default baseIsArguments;\n"],"names":["argsTag","baseIsArguments","value","isObjectLike","baseGetTag"],"mappings":"iFAIA,IAAIA,EAAU,qBASd,SAASC,EAAgBC,EAAO,CAC9B,OAAOC,EAAaD,CAAK,GAAKE,EAAWF,CAAK,GAAKF,CACrD","x_google_ignoreList":[0]}

package/dist/index.cjs427.js

@@ -0,0 +1,2 @@
+"use strict";function e(t){return t!=null&&typeof t=="object"}module.exports=e;
+//# sourceMappingURL=index.cjs427.js.map

package/dist/index.cjs427.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs427.js","sources":["../../../node_modules/lodash-es/isObjectLike.js"],"sourcesContent":["/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n"],"names":["isObjectLike","value"],"mappings":"aAwBA,SAASA,EAAaC,EAAO,CAC3B,OAAOA,GAAS,MAAQ,OAAOA,GAAS,QAC1C","x_google_ignoreList":[0]}

package/dist/index.cjs428.js

@@ -0,0 +1,2 @@
+"use strict";var r=Array.isArray;module.exports=r;
+//# sourceMappingURL=index.cjs428.js.map

package/dist/index.cjs428.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs428.js","sources":["../../../node_modules/lodash-es/isArray.js"],"sourcesContent":["/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nexport default isArray;\n"],"names":["isArray"],"mappings":"aAuBA,IAAIA,EAAU,MAAM","x_google_ignoreList":[0]}

package/dist/index.cjs429.js

@@ -0,0 +1,2 @@
+"use strict";const r=require("./index.cjs430.js"),t=require("./index.cjs431.js");function i(n){return n!=null&&t(n.length)&&!r(n)}module.exports=i;
+//# sourceMappingURL=index.cjs429.js.map

package/dist/index.cjs429.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs429.js","sources":["../../../node_modules/lodash-es/isArrayLike.js"],"sourcesContent":["import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n"],"names":["isArrayLike","value","isLength","isFunction"],"mappings":"iFA4BA,SAASA,EAAYC,EAAO,CAC1B,OAAOA,GAAS,MAAQC,EAASD,EAAM,MAAM,GAAK,CAACE,EAAWF,CAAK,CACrE","x_google_ignoreList":[0]}

package/dist/index.cjs43.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs218.js"),t=require("./index.cjs39.js"),e=require("./index.cjs224.js"),i=t.isIE11?e.ie11fingerprint(e.weakMapMethods):r("WeakMap");module.exports=i;
+"use strict";const r=require("./index.cjs235.js"),t=require("./index.cjs39.js"),e=require("./index.cjs241.js"),i=t.isIE11?e.ie11fingerprint(e.weakMapMethods):r("WeakMap");module.exports=i;
 //# sourceMappingURL=index.cjs43.js.map

package/dist/index.cjs430.js

@@ -0,0 +1,2 @@
+"use strict";const e=require("./index.cjs436.js"),c=require("./index.cjs421.js");var r="[object AsyncFunction]",o="[object Function]",a="[object GeneratorFunction]",i="[object Proxy]";function s(n){if(!c(n))return!1;var t=e(n);return t==o||t==a||t==r||t==i}module.exports=s;
+//# sourceMappingURL=index.cjs430.js.map

package/dist/index.cjs430.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs430.js","sources":["../../../node_modules/lodash-es/isFunction.js"],"sourcesContent":["import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n"],"names":["asyncTag","funcTag","genTag","proxyTag","isFunction","value","isObject","tag","baseGetTag"],"mappings":"iFAIA,IAAIA,EAAW,yBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAW,iBAmBf,SAASC,EAAWC,EAAO,CACzB,GAAI,CAACC,EAASD,CAAK,EACjB,MAAO,GAIT,IAAIE,EAAMC,EAAWH,CAAK,EAC1B,OAAOE,GAAON,GAAWM,GAAOL,GAAUK,GAAOP,GAAYO,GAAOJ,CACtE","x_google_ignoreList":[0]}

package/dist/index.cjs431.js

@@ -0,0 +1,2 @@
+"use strict";var r=9007199254740991;function n(t){return typeof t=="number"&&t>-1&&t%1==0&&t<=r}module.exports=n;
+//# sourceMappingURL=index.cjs431.js.map

package/dist/index.cjs431.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs431.js","sources":["../../../node_modules/lodash-es/isLength.js"],"sourcesContent":["/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n"],"names":["MAX_SAFE_INTEGER","isLength","value"],"mappings":"aACA,IAAIA,EAAmB,iBA4BvB,SAASC,EAASC,EAAO,CACvB,OAAO,OAAOA,GAAS,UACrBA,EAAQ,IAAMA,EAAQ,GAAK,GAAKA,GAASF,CAC7C","x_google_ignoreList":[0]}

package/dist/index.cjs432.js

@@ -0,0 +1,2 @@
+"use strict";const t=require("./index.cjs433.js"),f=require("./index.cjs434.js");var o=typeof exports=="object"&&exports&&!exports.nodeType&&exports,e=o&&typeof module=="object"&&module&&!module.nodeType&&module,s=e&&e.exports===o,r=s?t.Buffer:void 0,u=r?r.isBuffer:void 0,v=u||f;module.exports=v;
+//# sourceMappingURL=index.cjs432.js.map

package/dist/index.cjs432.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs432.js","sources":["../../../node_modules/lodash-es/isBuffer.js"],"sourcesContent":["import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n"],"names":["freeExports","freeModule","moduleExports","Buffer","root","nativeIsBuffer","isBuffer","stubFalse"],"mappings":"iFAIA,IAAIA,EAAc,OAAO,SAAW,UAAY,SAAW,CAAC,QAAQ,UAAY,QAG5EC,EAAaD,GAAe,OAAO,QAAU,UAAY,QAAU,CAAC,OAAO,UAAY,OAGvFE,EAAgBD,GAAcA,EAAW,UAAYD,EAGrDG,EAASD,EAAgBE,EAAK,OAAS,OAGvCC,EAAiBF,EAASA,EAAO,SAAW,OAmB5CG,EAAWD,GAAkBE","x_google_ignoreList":[0]}

package/dist/index.cjs433.js

@@ -0,0 +1,2 @@
+"use strict";const e=require("./index.cjs533.js");var t=typeof self=="object"&&self&&self.Object===Object&&self,r=e||t||Function("return this")();module.exports=r;
+//# sourceMappingURL=index.cjs433.js.map

package/dist/index.cjs433.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs433.js","sources":["../../../node_modules/lodash-es/_root.js"],"sourcesContent":["import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n"],"names":["freeSelf","root","freeGlobal"],"mappings":"kDAGA,IAAIA,EAAW,OAAO,MAAQ,UAAY,MAAQ,KAAK,SAAW,QAAU,KAGxEC,EAAOC,GAAcF,GAAY,SAAS,aAAa,EAAA","x_google_ignoreList":[0]}

package/dist/index.cjs434.js

@@ -0,0 +1,2 @@
+"use strict";function s(){return!1}module.exports=s;
+//# sourceMappingURL=index.cjs434.js.map

package/dist/index.cjs434.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs434.js","sources":["../../../node_modules/lodash-es/stubFalse.js"],"sourcesContent":["/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nexport default stubFalse;\n"],"names":["stubFalse"],"mappings":"aAaA,SAASA,GAAY,CACnB,MAAO,EACT","x_google_ignoreList":[0]}

package/dist/index.cjs435.js

@@ -0,0 +1,2 @@
+"use strict";const c=require("./index.cjs534.js"),i=require("./index.cjs427.js");function r(s,n,u,e,t){return s===n?!0:s==null||n==null||!i(s)&&!i(n)?s!==s&&n!==n:c(s,n,u,e,r,t)}module.exports=r;
+//# sourceMappingURL=index.cjs435.js.map

package/dist/index.cjs435.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs435.js","sources":["../../../node_modules/lodash-es/_baseIsEqual.js"],"sourcesContent":["import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nexport default baseIsEqual;\n"],"names":["baseIsEqual","value","other","bitmask","customizer","stack","isObjectLike","baseIsEqualDeep"],"mappings":"iFAiBA,SAASA,EAAYC,EAAOC,EAAOC,EAASC,EAAYC,EAAO,CAC7D,OAAIJ,IAAUC,EACL,GAELD,GAAS,MAAQC,GAAS,MAAS,CAACI,EAAaL,CAAK,GAAK,CAACK,EAAaJ,CAAK,EACzED,IAAUA,GAASC,IAAUA,EAE/BK,EAAgBN,EAAOC,EAAOC,EAASC,EAAYJ,EAAaK,CAAK,CAC9E","x_google_ignoreList":[0]}

package/dist/index.cjs436.js

@@ -0,0 +1,2 @@
+"use strict";const e=require("./index.cjs528.js"),r=require("./index.cjs529.js"),i=require("./index.cjs530.js");var o="[object Null]",g="[object Undefined]",n=e?e.toStringTag:void 0;function c(t){return t==null?t===void 0?g:o:n&&n in Object(t)?r(t):i(t)}module.exports=c;
+//# sourceMappingURL=index.cjs436.js.map

package/dist/index.cjs436.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs436.js","sources":["../../../node_modules/lodash-es/_baseGetTag.js"],"sourcesContent":["import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nexport default baseGetTag;\n"],"names":["nullTag","undefinedTag","symToStringTag","Symbol","baseGetTag","value","getRawTag","objectToString"],"mappings":"gHAKA,IAAIA,EAAU,gBACVC,EAAe,qBAGfC,EAAiBC,EAASA,EAAO,YAAc,OASnD,SAASC,EAAWC,EAAO,CACzB,OAAIA,GAAS,KACJA,IAAU,OAAYJ,EAAeD,EAEtCE,GAAkBA,KAAkB,OAAOG,CAAK,EACpDC,EAAUD,CAAK,EACfE,EAAeF,CAAK,CAC1B","x_google_ignoreList":[0]}

package/dist/index.cjs437.js

@@ -0,0 +1,2 @@
+"use strict";const r=require("./index.cjs438.js"),a=require("./index.cjs439.js"),e=require("./index.cjs440.js");var s=e&&e.isMap,i=s?a(s):r;module.exports=i;
+//# sourceMappingURL=index.cjs437.js.map

package/dist/index.cjs437.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs437.js","sources":["../../../node_modules/lodash-es/isMap.js"],"sourcesContent":["import baseIsMap from './_baseIsMap.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nexport default isMap;\n"],"names":["nodeIsMap","nodeUtil","isMap","baseUnary","baseIsMap"],"mappings":"gHAKA,IAAIA,EAAYC,GAAYA,EAAS,MAmBjCC,EAAQF,EAAYG,EAAUH,CAAS,EAAII","x_google_ignoreList":[0]}

package/dist/index.cjs438.js

@@ -0,0 +1,2 @@
+"use strict";const t=require("./index.cjs522.js"),r=require("./index.cjs427.js");var s="[object Map]";function a(e){return r(e)&&t(e)==s}module.exports=a;
+//# sourceMappingURL=index.cjs438.js.map

package/dist/index.cjs438.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs438.js","sources":["../../../node_modules/lodash-es/_baseIsMap.js"],"sourcesContent":["import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nexport default baseIsMap;\n"],"names":["mapTag","baseIsMap","value","isObjectLike","getTag"],"mappings":"iFAIA,IAAIA,EAAS,eASb,SAASC,EAAUC,EAAO,CACxB,OAAOC,EAAaD,CAAK,GAAKE,EAAOF,CAAK,GAAKF,CACjD","x_google_ignoreList":[0]}

package/dist/index.cjs439.js

@@ -0,0 +1,2 @@
+"use strict";function t(n){return function(r){return n(r)}}module.exports=t;
+//# sourceMappingURL=index.cjs439.js.map

package/dist/index.cjs439.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs439.js","sources":["../../../node_modules/lodash-es/_baseUnary.js"],"sourcesContent":["/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nexport default baseUnary;\n"],"names":["baseUnary","func","value"],"mappings":"aAOA,SAASA,EAAUC,EAAM,CACvB,OAAO,SAASC,EAAO,CACrB,OAAOD,EAAKC,CAAK,CACnB,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs44.js

@@ -1,2 +1,2 @@
-"use strict";const t=require("./index.cjs218.js"),r=require("./index.cjs39.js"),e=require("./index.cjs224.js"),s=r.isIE11?e.ie11fingerprint(e.setMethods):t("Set");module.exports=s;
+"use strict";const t=require("./index.cjs235.js"),r=require("./index.cjs39.js"),e=require("./index.cjs241.js"),s=r.isIE11?e.ie11fingerprint(e.setMethods):t("Set");module.exports=s;
 //# sourceMappingURL=index.cjs44.js.map

package/dist/index.cjs440.js

@@ -0,0 +1,2 @@
+"use strict";const i=require("./index.cjs533.js");var o=typeof exports=="object"&&exports&&!exports.nodeType&&exports,e=o&&typeof module=="object"&&module&&!module.nodeType&&module,n=e&&e.exports===o,r=n&&i.process,s=function(){try{var t=e&&e.require&&e.require("util").types;return t||r&&r.binding&&r.binding("util")}catch{}}();module.exports=s;
+//# sourceMappingURL=index.cjs440.js.map

package/dist/index.cjs440.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs440.js","sources":["../../../node_modules/lodash-es/_nodeUtil.js"],"sourcesContent":["import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nexport default nodeUtil;\n"],"names":["freeExports","freeModule","moduleExports","freeProcess","freeGlobal","nodeUtil","types"],"mappings":"kDAGA,IAAIA,EAAc,OAAO,SAAW,UAAY,SAAW,CAAC,QAAQ,UAAY,QAG5EC,EAAaD,GAAe,OAAO,QAAU,UAAY,QAAU,CAAC,OAAO,UAAY,OAGvFE,EAAgBD,GAAcA,EAAW,UAAYD,EAGrDG,EAAcD,GAAiBE,EAAW,QAG1CC,EAAY,UAAW,CACzB,GAAI,CAEF,IAAIC,EAAQL,GAAcA,EAAW,SAAWA,EAAW,QAAQ,MAAM,EAAE,MAE3E,OAAIK,GAKGH,GAAeA,EAAY,SAAWA,EAAY,QAAQ,MAAM,CACzE,MAAY,CAAC,CACf,EAAA","x_google_ignoreList":[0]}

package/dist/index.cjs441.js

@@ -0,0 +1,2 @@
+"use strict";const r=require("./index.cjs442.js"),t=require("./index.cjs439.js"),e=require("./index.cjs440.js");var s=e&&e.isSet,i=s?t(s):r;module.exports=i;
+//# sourceMappingURL=index.cjs441.js.map

package/dist/index.cjs441.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs441.js","sources":["../../../node_modules/lodash-es/isSet.js"],"sourcesContent":["import baseIsSet from './_baseIsSet.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nexport default isSet;\n"],"names":["nodeIsSet","nodeUtil","isSet","baseUnary","baseIsSet"],"mappings":"gHAKA,IAAIA,EAAYC,GAAYA,EAAS,MAmBjCC,EAAQF,EAAYG,EAAUH,CAAS,EAAII","x_google_ignoreList":[0]}

package/dist/index.cjs442.js

@@ -0,0 +1,2 @@
+"use strict";const t=require("./index.cjs522.js"),r=require("./index.cjs427.js");var s="[object Set]";function c(e){return r(e)&&t(e)==s}module.exports=c;
+//# sourceMappingURL=index.cjs442.js.map

package/dist/index.cjs442.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs442.js","sources":["../../../node_modules/lodash-es/_baseIsSet.js"],"sourcesContent":["import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nexport default baseIsSet;\n"],"names":["setTag","baseIsSet","value","isObjectLike","getTag"],"mappings":"iFAIA,IAAIA,EAAS,eASb,SAASC,EAAUC,EAAO,CACxB,OAAOC,EAAaD,CAAK,GAAKE,EAAOF,CAAK,GAAKF,CACjD","x_google_ignoreList":[0]}

package/dist/index.cjs443.js

@@ -0,0 +1,2 @@
+"use strict";const t=require("./index.cjs436.js"),o=require("./index.cjs427.js");var s="[object Symbol]";function r(e){return typeof e=="symbol"||o(e)&&t(e)==s}module.exports=r;
+//# sourceMappingURL=index.cjs443.js.map

package/dist/index.cjs443.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs443.js","sources":["../../../node_modules/lodash-es/isSymbol.js"],"sourcesContent":["import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nexport default isSymbol;\n"],"names":["symbolTag","isSymbol","value","isObjectLike","baseGetTag"],"mappings":"iFAIA,IAAIA,EAAY,kBAmBhB,SAASC,EAASC,EAAO,CACvB,OAAO,OAAOA,GAAS,UACpBC,EAAaD,CAAK,GAAKE,EAAWF,CAAK,GAAKF,CACjD","x_google_ignoreList":[0]}

package/dist/index.cjs444.js

@@ -0,0 +1,2 @@
+"use strict";const s=require("./index.cjs445.js"),a=require("./index.cjs439.js"),r=require("./index.cjs440.js");var e=r&&r.isTypedArray,y=e?a(e):s;module.exports=y;
+//# sourceMappingURL=index.cjs444.js.map

package/dist/index.cjs444.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs444.js","sources":["../../../node_modules/lodash-es/isTypedArray.js"],"sourcesContent":["import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n"],"names":["nodeIsTypedArray","nodeUtil","isTypedArray","baseUnary","baseIsTypedArray"],"mappings":"gHAKA,IAAIA,EAAmBC,GAAYA,EAAS,aAmBxCC,EAAeF,EAAmBG,EAAUH,CAAgB,EAAII","x_google_ignoreList":[0]}

package/dist/index.cjs445.js

@@ -0,0 +1,2 @@
+"use strict";const e=require("./index.cjs436.js"),r=require("./index.cjs431.js"),o=require("./index.cjs427.js");var c="[object Arguments]",g="[object Array]",b="[object Boolean]",n="[object Date]",j="[object Error]",T="[object Function]",i="[object Map]",s="[object Number]",y="[object Object]",u="[object RegExp]",A="[object Set]",p="[object String]",f="[object WeakMap]",l="[object ArrayBuffer]",d="[object DataView]",m="[object Float32Array]",I="[object Float64Array]",U="[object Int8Array]",k="[object Int16Array]",q="[object Int32Array]",w="[object Uint8Array]",x="[object Uint8ClampedArray]",B="[object Uint16Array]",F="[object Uint32Array]",t={};t[m]=t[I]=t[U]=t[k]=t[q]=t[w]=t[x]=t[B]=t[F]=!0;t[c]=t[g]=t[l]=t[b]=t[d]=t[n]=t[j]=t[T]=t[i]=t[s]=t[y]=t[u]=t[A]=t[p]=t[f]=!1;function M(a){return o(a)&&r(a.length)&&!!t[e(a)]}module.exports=M;
+//# sourceMappingURL=index.cjs445.js.map

package/dist/index.cjs445.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs445.js","sources":["../../../node_modules/lodash-es/_baseIsTypedArray.js"],"sourcesContent":["import baseGetTag from './_baseGetTag.js';\nimport isLength from './isLength.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nexport default baseIsTypedArray;\n"],"names":["argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","typedArrayTags","baseIsTypedArray","value","isObjectLike","isLength","baseGetTag"],"mappings":"gHAKA,IAAIA,EAAU,qBACVC,EAAW,iBACXC,EAAU,mBACVC,EAAU,gBACVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAa,mBAEbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBAGZC,EAAiB,CAAA,EACrBA,EAAeT,CAAU,EAAIS,EAAeR,CAAU,EACtDQ,EAAeP,CAAO,EAAIO,EAAeN,CAAQ,EACjDM,EAAeL,CAAQ,EAAIK,EAAeJ,CAAQ,EAClDI,EAAeH,CAAe,EAAIG,EAAeF,CAAS,EAC1DE,EAAeD,CAAS,EAAI,GAC5BC,EAAexB,CAAO,EAAIwB,EAAevB,CAAQ,EACjDuB,EAAeX,CAAc,EAAIW,EAAetB,CAAO,EACvDsB,EAAeV,CAAW,EAAIU,EAAerB,CAAO,EACpDqB,EAAepB,CAAQ,EAAIoB,EAAenB,CAAO,EACjDmB,EAAelB,CAAM,EAAIkB,EAAejB,CAAS,EACjDiB,EAAehB,CAAS,EAAIgB,EAAef,CAAS,EACpDe,EAAed,CAAM,EAAIc,EAAeb,CAAS,EACjDa,EAAeZ,CAAU,EAAI,GAS7B,SAASa,EAAiBC,EAAO,CAC/B,OAAOC,EAAaD,CAAK,GACvBE,EAASF,EAAM,MAAM,GAAK,CAAC,CAACF,EAAeK,EAAWH,CAAK,CAAC,CAChE","x_google_ignoreList":[0]}

package/dist/index.cjs446.js

@@ -0,0 +1,2 @@
+"use strict";const e=require("./index.cjs447.js"),s=require("./index.cjs448.js"),i=require("./index.cjs429.js");function n(r){return i(r)?e(r):s(r)}module.exports=n;
+//# sourceMappingURL=index.cjs446.js.map

package/dist/index.cjs446.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs446.js","sources":["../../../node_modules/lodash-es/keys.js"],"sourcesContent":["import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n"],"names":["keys","object","isArrayLike","arrayLikeKeys","baseKeys"],"mappings":"gHAgCA,SAASA,EAAKC,EAAQ,CACpB,OAAOC,EAAYD,CAAM,EAAIE,EAAcF,CAAM,EAAIG,EAASH,CAAM,CACtE","x_google_ignoreList":[0]}

package/dist/index.cjs447.js

@@ -0,0 +1,2 @@
+"use strict";const p=require("./index.cjs535.js"),h=require("./index.cjs425.js"),u=require("./index.cjs428.js"),g=require("./index.cjs432.js"),a=require("./index.cjs536.js"),b=require("./index.cjs444.js");var q=Object.prototype,A=q.hasOwnProperty;function d(t,O){var e=u(t),s=!e&&h(t),i=!e&&!s&&g(t),o=!e&&!s&&!i&&b(t),f=e||s||i||o,n=f?p(t.length,String):[],c=n.length;for(var r in t)A.call(t,r)&&!(f&&(r=="length"||i&&(r=="offset"||r=="parent")||o&&(r=="buffer"||r=="byteLength"||r=="byteOffset")||a(r,c)))&&n.push(r);return n}module.exports=d;
+//# sourceMappingURL=index.cjs447.js.map

package/dist/index.cjs447.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs447.js","sources":["../../../node_modules/lodash-es/_arrayLikeKeys.js"],"sourcesContent":["import baseTimes from './_baseTimes.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isIndex from './_isIndex.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default arrayLikeKeys;\n"],"names":["objectProto","hasOwnProperty","arrayLikeKeys","value","inherited","isArr","isArray","isArg","isArguments","isBuff","isBuffer","isType","isTypedArray","skipIndexes","result","baseTimes","length","key","isIndex"],"mappings":"6MAQA,IAAIA,EAAc,OAAO,UAGrBC,EAAiBD,EAAY,eAUjC,SAASE,EAAcC,EAAOC,EAAW,CACvC,IAAIC,EAAQC,EAAQH,CAAK,EACrBI,EAAQ,CAACF,GAASG,EAAYL,CAAK,EACnCM,EAAS,CAACJ,GAAS,CAACE,GAASG,EAASP,CAAK,EAC3CQ,EAAS,CAACN,GAAS,CAACE,GAAS,CAACE,GAAUG,EAAaT,CAAK,EAC1DU,EAAcR,GAASE,GAASE,GAAUE,EAC1CG,EAASD,EAAcE,EAAUZ,EAAM,OAAQ,MAAM,EAAI,GACzDa,EAASF,EAAO,OAEpB,QAASG,KAAOd,EACIF,EAAe,KAAKE,EAAOc,CAAG,GAC5C,EAAEJ,IAECI,GAAO,UAENR,IAAWQ,GAAO,UAAYA,GAAO,WAErCN,IAAWM,GAAO,UAAYA,GAAO,cAAgBA,GAAO,eAE7DC,EAAQD,EAAKD,CAAM,KAExBF,EAAO,KAAKG,CAAG,EAGnB,OAAOH,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs448.js

@@ -0,0 +1,2 @@
+"use strict";const s=require("./index.cjs516.js"),o=require("./index.cjs550.js");var n=Object.prototype,a=n.hasOwnProperty;function i(r){if(!s(r))return o(r);var e=[];for(var t in Object(r))a.call(r,t)&&t!="constructor"&&e.push(t);return e}module.exports=i;
+//# sourceMappingURL=index.cjs448.js.map

package/dist/index.cjs448.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs448.js","sources":["../../../node_modules/lodash-es/_baseKeys.js"],"sourcesContent":["import isPrototype from './_isPrototype.js';\nimport nativeKeys from './_nativeKeys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default baseKeys;\n"],"names":["objectProto","hasOwnProperty","baseKeys","object","isPrototype","nativeKeys","result","key"],"mappings":"iFAIA,IAAIA,EAAc,OAAO,UAGrBC,EAAiBD,EAAY,eASjC,SAASE,EAASC,EAAQ,CACxB,GAAI,CAACC,EAAYD,CAAM,EACrB,OAAOE,EAAWF,CAAM,EAE1B,IAAIG,EAAS,CAAA,EACb,QAASC,KAAO,OAAOJ,CAAM,EACvBF,EAAe,KAAKE,EAAQI,CAAG,GAAKA,GAAO,eAC7CD,EAAO,KAAKC,CAAG,EAGnB,OAAOD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs449.js

@@ -0,0 +1,2 @@
+"use strict";function r(){return[]}module.exports=r;
+//# sourceMappingURL=index.cjs449.js.map

package/dist/index.cjs449.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs449.js","sources":["../../../node_modules/lodash-es/stubArray.js"],"sourcesContent":["/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n"],"names":["stubArray"],"mappings":"aAkBA,SAASA,GAAY,CACnB,MAAO,CAAA,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs450.js

@@ -0,0 +1,2 @@
+"use strict";const r=require("./index.cjs554.js");var t=/^\s+/;function c(e){return e&&e.slice(0,r(e)+1).replace(t,"")}module.exports=c;
+//# sourceMappingURL=index.cjs450.js.map

package/dist/index.cjs450.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs450.js","sources":["../../../node_modules/lodash-es/_baseTrim.js"],"sourcesContent":["import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n"],"names":["reTrimStart","baseTrim","string","trimmedEndIndex"],"mappings":"kDAGA,IAAIA,EAAc,OASlB,SAASC,EAASC,EAAQ,CACxB,OAAOA,GACHA,EAAO,MAAM,EAAGC,EAAgBD,CAAM,EAAI,CAAC,EAAE,QAAQF,EAAa,EAAE,CAE1E","x_google_ignoreList":[0]}

package/dist/index.cjs451.js

@@ -0,0 +1,2 @@
+"use strict";function e(n,t){return n<t?-1:n>t?1:n>=t?0:NaN}module.exports=e;
+//# sourceMappingURL=index.cjs451.js.map

package/dist/index.cjs451.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs451.js","sources":["../../../node_modules/d3-geo/node_modules/d3-array/src/ascending.js"],"sourcesContent":["export default function(a, b) {\n  return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n"],"names":["ascending","a","b"],"mappings":"aAAA,SAAAA,EAAwBC,EAAGC,EAAG,CAC5B,OAAOD,EAAIC,EAAI,GAAKD,EAAIC,EAAI,EAAID,GAAKC,EAAI,EAAI,GAC/C","x_google_ignoreList":[0]}

package/dist/index.cjs452.js

@@ -0,0 +1,2 @@
+"use strict";const s=require("./index.cjs451.js");function i(e){return e.length===1&&(e=c(e)),{left:function(r,f,n,t){for(n==null&&(n=0),t==null&&(t=r.length);n<t;){var u=n+t>>>1;e(r[u],f)<0?n=u+1:t=u}return n},right:function(r,f,n,t){for(n==null&&(n=0),t==null&&(t=r.length);n<t;){var u=n+t>>>1;e(r[u],f)>0?t=u:n=u+1}return n}}}function c(e){return function(r,f){return s(e(r),f)}}module.exports=i;
+//# sourceMappingURL=index.cjs452.js.map

package/dist/index.cjs452.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs452.js","sources":["../../../node_modules/d3-geo/node_modules/d3-array/src/bisector.js"],"sourcesContent":["import ascending from \"./ascending\";\n\nexport default function(compare) {\n  if (compare.length === 1) compare = ascendingComparator(compare);\n  return {\n    left: function(a, x, lo, hi) {\n      if (lo == null) lo = 0;\n      if (hi == null) hi = a.length;\n      while (lo < hi) {\n        var mid = lo + hi >>> 1;\n        if (compare(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      }\n      return lo;\n    },\n    right: function(a, x, lo, hi) {\n      if (lo == null) lo = 0;\n      if (hi == null) hi = a.length;\n      while (lo < hi) {\n        var mid = lo + hi >>> 1;\n        if (compare(a[mid], x) > 0) hi = mid;\n        else lo = mid + 1;\n      }\n      return lo;\n    }\n  };\n}\n\nfunction ascendingComparator(f) {\n  return function(d, x) {\n    return ascending(f(d), x);\n  };\n}\n"],"names":["bisector","compare","ascendingComparator","a","x","lo","hi","mid","f","d","ascending"],"mappings":"kDAEA,SAAAA,EAAwBC,EAAS,CAC/B,OAAIA,EAAQ,SAAW,IAAGA,EAAUC,EAAoBD,CAAO,GACxD,CACL,KAAM,SAASE,EAAGC,EAAGC,EAAIC,EAAI,CAG3B,IAFID,GAAM,OAAMA,EAAK,GACjBC,GAAM,OAAMA,EAAKH,EAAE,QAChBE,EAAKC,GAAI,CACd,IAAIC,EAAMF,EAAKC,IAAO,EAClBL,EAAQE,EAAEI,CAAG,EAAGH,CAAC,EAAI,IAAQG,EAAM,EAClCD,EAAKC,CACZ,CACA,OAAOF,CACT,EACA,MAAO,SAASF,EAAGC,EAAGC,EAAIC,EAAI,CAG5B,IAFID,GAAM,OAAMA,EAAK,GACjBC,GAAM,OAAMA,EAAKH,EAAE,QAChBE,EAAKC,GAAI,CACd,IAAIC,EAAMF,EAAKC,IAAO,EAClBL,EAAQE,EAAEI,CAAG,EAAGH,CAAC,EAAI,EAAGE,EAAKC,IACvBA,EAAM,CAClB,CACA,OAAOF,CACT,CAAA,CAEJ,CAEA,SAASH,EAAoBM,EAAG,CAC9B,OAAO,SAASC,EAAGL,EAAG,CACpB,OAAOM,EAAUF,EAAEC,CAAC,EAAGL,CAAC,CAC1B,CACF","x_google_ignoreList":[0]}

package/dist/index.cjs453.js

@@ -0,0 +1,2 @@
+"use strict";const N=require("./index.cjs272.js"),C=Math.pow(2,-52),j=new Uint32Array(512);class Y{static from(t,i=Q,h=V){const o=t.length,l=new Float64Array(o*2);for(let n=0;n<o;n++){const r=t[n];l[2*n]=i(r),l[2*n+1]=h(r)}return new Y(l)}constructor(t){const i=t.length>>1;if(i>0&&typeof t[0]!="number")throw new Error("Expected coords to contain numbers.");this.coords=t;const h=Math.max(2*i-5,0);this._triangles=new Uint32Array(h*3),this._halfedges=new Int32Array(h*3),this._hashSize=Math.ceil(Math.sqrt(i)),this._hullPrev=new Uint32Array(i),this._hullNext=new Uint32Array(i),this._hullTri=new Uint32Array(i),this._hullHash=new Int32Array(this._hashSize),this._ids=new Uint32Array(i),this._dists=new Float64Array(i),this.trianglesLen=0,this._cx=0,this._cy=0,this._hullStart=0,this.hull=this._triangles,this.triangles=this._triangles,this.halfedges=this._halfedges,this.update()}update(){const{coords:t,_hullPrev:i,_hullNext:h,_hullTri:o,_hullHash:l}=this,n=t.length>>1;let r=1/0,f=1/0,g=-1/0,b=-1/0;for(let e=0;e<n;e++){const u=t[2*e],a=t[2*e+1];u<r&&(r=u),a<f&&(f=a),u>g&&(g=u),a>b&&(b=a),this._ids[e]=e}const x=(r+g)/2,m=(f+b)/2;let c=0,y=0,d=0;for(let e=0,u=1/0;e<n;e++){const a=X(x,m,t[2*e],t[2*e+1]);a<u&&(c=e,u=a)}const T=t[2*c],M=t[2*c+1];for(let e=0,u=1/0;e<n;e++){if(e===c)continue;const a=X(T,M,t[2*e],t[2*e+1]);a<u&&a>0&&(y=e,u=a)}let U=t[2*y],k=t[2*y+1],G=1/0;for(let e=0;e<n;e++){if(e===c||e===y)continue;const u=B(T,M,U,k,t[2*e],t[2*e+1]);u<G&&(d=e,G=u)}let D=t[2*d],E=t[2*d+1];if(G===1/0){for(let a=0;a<n;a++)this._dists[a]=t[2*a]-t[0]||t[2*a+1]-t[1];L(this._ids,this._dists,0,n-1);const e=new Uint32Array(n);let u=0;for(let a=0,w=-1/0;a<n;a++){const A=this._ids[a],S=this._dists[A];S>w&&(e[u++]=A,w=S)}this.hull=e.subarray(0,u),this.triangles=new Uint32Array(0),this.halfedges=new Int32Array(0);return}if(N.orient2d(T,M,U,k,D,E)<0){const e=y,u=U,a=k;y=d,U=D,k=E,d=e,D=u,E=a}const v=J(T,M,U,k,D,E);this._cx=v.x,this._cy=v.y;for(let e=0;e<n;e++)this._dists[e]=X(t[2*e],t[2*e+1],v.x,v.y);L(this._ids,this._dists,0,n-1),this._hullStart=c;let P=3;h[c]=i[d]=y,h[y]=i[c]=d,h[d]=i[y]=c,o[c]=0,o[y]=1,o[d]=2,l.fill(-1),l[this._hashKey(T,M)]=c,l[this._hashKey(U,k)]=y,l[this._hashKey(D,E)]=d,this.trianglesLen=0,this._addTriangle(c,y,d,-1,-1,-1);for(let e=0,u=0,a=0;e<this._ids.length;e++){const w=this._ids[e],A=t[2*w],S=t[2*w+1];if(e>0&&Math.abs(A-u)<=C&&Math.abs(S-a)<=C||(u=A,a=S,w===c||w===y||w===d))continue;let z=0;for(let H=0,F=this._hashKey(A,S);H<this._hashSize&&(z=l[(F+H)%this._hashSize],!(z!==-1&&z!==h[z]));H++);z=i[z];let _=z,p;for(;p=h[_],N.orient2d(A,S,t[2*_],t[2*_+1],t[2*p],t[2*p+1])>=0;)if(_=p,_===z){_=-1;break}if(_===-1)continue;let K=this._addTriangle(_,w,h[_],-1,-1,o[_]);o[w]=this._legalize(K+2),o[_]=K,P++;let I=h[_];for(;p=h[I],N.orient2d(A,S,t[2*I],t[2*I+1],t[2*p],t[2*p+1])<0;)K=this._addTriangle(I,w,p,o[w],-1,o[I]),o[w]=this._legalize(K+2),h[I]=I,P--,I=p;if(_===z)for(;p=i[_],N.orient2d(A,S,t[2*p],t[2*p+1],t[2*_],t[2*_+1])<0;)K=this._addTriangle(p,w,_,-1,o[_],o[p]),this._legalize(K+2),o[p]=K,h[_]=_,P--,_=p;this._hullStart=i[w]=_,h[_]=i[I]=w,h[w]=I,l[this._hashKey(A,S)]=w,l[this._hashKey(t[2*_],t[2*_+1])]=_}this.hull=new Uint32Array(P);for(let e=0,u=this._hullStart;e<P;e++)this.hull[e]=u,u=h[u];this.triangles=this._triangles.subarray(0,this.trianglesLen),this.halfedges=this._halfedges.subarray(0,this.trianglesLen)}_hashKey(t,i){return Math.floor(O(t-this._cx,i-this._cy)*this._hashSize)%this._hashSize}_legalize(t){const{_triangles:i,_halfedges:h,coords:o}=this;let l=0,n=0;for(;;){const r=h[t],f=t-t%3;if(n=f+(t+2)%3,r===-1){if(l===0)break;t=j[--l];continue}const g=r-r%3,b=f+(t+1)%3,x=g+(r+2)%3,m=i[n],c=i[t],y=i[b],d=i[x];if(R(o[2*m],o[2*m+1],o[2*c],o[2*c+1],o[2*y],o[2*y+1],o[2*d],o[2*d+1])){i[t]=d,i[r]=m;const M=h[x];if(M===-1){let k=this._hullStart;do{if(this._hullTri[k]===x){this._hullTri[k]=t;break}k=this._hullPrev[k]}while(k!==this._hullStart)}this._link(t,M),this._link(r,h[n]),this._link(n,x);const U=g+(r+1)%3;l<j.length&&(j[l++]=U)}else{if(l===0)break;t=j[--l]}}return n}_link(t,i){this._halfedges[t]=i,i!==-1&&(this._halfedges[i]=t)}_addTriangle(t,i,h,o,l,n){const r=this.trianglesLen;return this._triangles[r]=t,this._triangles[r+1]=i,this._triangles[r+2]=h,this._link(r,o),this._link(r+1,l),this._link(r+2,n),this.trianglesLen+=3,r}}function O(s,t){const i=s/(Math.abs(s)+Math.abs(t));return(t>0?3-i:1+i)/4}function X(s,t,i,h){const o=s-i,l=t-h;return o*o+l*l}function R(s,t,i,h,o,l,n,r){const f=s-n,g=t-r,b=i-n,x=h-r,m=o-n,c=l-r,y=f*f+g*g,d=b*b+x*x,T=m*m+c*c;return f*(x*T-d*c)-g*(b*T-d*m)+y*(b*c-x*m)<0}function B(s,t,i,h,o,l){const n=i-s,r=h-t,f=o-s,g=l-t,b=n*n+r*r,x=f*f+g*g,m=.5/(n*g-r*f),c=(g*b-r*x)*m,y=(n*x-f*b)*m;return c*c+y*y}function J(s,t,i,h,o,l){const n=i-s,r=h-t,f=o-s,g=l-t,b=n*n+r*r,x=f*f+g*g,m=.5/(n*g-r*f),c=s+(g*b-r*x)*m,y=t+(n*x-f*b)*m;return{x:c,y}}function L(s,t,i,h){if(h-i<=20)for(let o=i+1;o<=h;o++){const l=s[o],n=t[l];let r=o-1;for(;r>=i&&t[s[r]]>n;)s[r+1]=s[r--];s[r+1]=l}else{const o=i+h>>1;let l=i+1,n=h;q(s,o,l),t[s[i]]>t[s[h]]&&q(s,i,h),t[s[l]]>t[s[h]]&&q(s,l,h),t[s[i]]>t[s[l]]&&q(s,i,l);const r=s[l],f=t[r];for(;;){do l++;while(t[s[l]]<f);do n--;while(t[s[n]]>f);if(n<l)break;q(s,l,n)}s[i+1]=s[n],s[n]=r,h-l+1>=n-i?(L(s,t,l,h),L(s,t,i,n-1)):(L(s,t,i,n-1),L(s,t,l,h))}}function q(s,t,i){const h=s[t];s[t]=s[i],s[i]=h}function Q(s){return s[0]}function V(s){return s[1]}module.exports=Y;
+//# sourceMappingURL=index.cjs453.js.map

package/dist/index.cjs453.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs453.js","sources":["../../../node_modules/delaunator/index.js"],"sourcesContent":["\nconst EPSILON = Math.pow(2, -52);\nconst EDGE_STACK = new Uint32Array(512);\n\nimport {orient2d} from 'robust-predicates';\n\n/** @template {ArrayLike<number>} T */\nexport default class Delaunator {\n\n    /**\n     * Constructs a delaunay triangulation object given an array of points (`[x, y]` by default).\n     * `getX` and `getY` are optional functions of the form `(point) => value` for custom point formats.\n     *\n     * @template P\n     * @param {P[]} points\n     * @param {(p: P) => number} [getX]\n     * @param {(p: P) => number} [getY]\n     */\n    // @ts-expect-error TS2322\n    static from(points, getX = defaultGetX, getY = defaultGetY) {\n        const n = points.length;\n        const coords = new Float64Array(n * 2);\n\n        for (let i = 0; i < n; i++) {\n            const p = points[i];\n            coords[2 * i] = getX(p);\n            coords[2 * i + 1] = getY(p);\n        }\n\n        return new Delaunator(coords);\n    }\n\n    /**\n     * Constructs a delaunay triangulation object given an array of point coordinates of the form:\n     * `[x0, y0, x1, y1, ...]` (use a typed array for best performance). Duplicate points are skipped.\n     *\n     * @param {T} coords\n     */\n    constructor(coords) {\n        const n = coords.length >> 1;\n        if (n > 0 && typeof coords[0] !== 'number') throw new Error('Expected coords to contain numbers.');\n\n        this.coords = coords;\n\n        // arrays that will store the triangulation graph\n        const maxTriangles = Math.max(2 * n - 5, 0);\n        /** @private */ this._triangles = new Uint32Array(maxTriangles * 3);\n        /** @private */ this._halfedges = new Int32Array(maxTriangles * 3);\n\n        // temporary arrays for tracking the edges of the advancing convex hull\n        /** @private */ this._hashSize = Math.ceil(Math.sqrt(n));\n        /** @private */ this._hullPrev = new Uint32Array(n); // edge to prev edge\n        /** @private */ this._hullNext = new Uint32Array(n); // edge to next edge\n        /** @private */ this._hullTri = new Uint32Array(n); // edge to adjacent triangle\n        /** @private */ this._hullHash = new Int32Array(this._hashSize); // angular edge hash\n\n        // temporary arrays for sorting points\n        /** @private */ this._ids = new Uint32Array(n);\n        /** @private */ this._dists = new Float64Array(n);\n\n        /** @private */ this.trianglesLen = 0;\n        /** @private */ this._cx = 0;\n        /** @private */ this._cy = 0;\n        /** @private */ this._hullStart = 0;\n\n\n        /** A `Uint32Array` array of indices that reference points on the convex hull of the input data, counter-clockwise. */\n        this.hull = this._triangles;\n        /** A `Uint32Array` array of triangle vertex indices (each group of three numbers forms a triangle). All triangles are directed counterclockwise. */\n        this.triangles = this._triangles;\n        /**\n         * A `Int32Array` array of triangle half-edge indices that allows you to traverse the triangulation.\n         * `i`-th half-edge in the array corresponds to vertex `triangles[i]` the half-edge is coming from.\n         * `halfedges[i]` is the index of a twin half-edge in an adjacent triangle (or `-1` for outer half-edges on the convex hull).\n         */\n        this.halfedges = this._halfedges;\n\n        this.update();\n    }\n\n    /**\n     * Updates the triangulation if you modified `delaunay.coords` values in place, avoiding expensive memory allocations.\n     * Useful for iterative relaxation algorithms such as Lloyd's.\n     */\n    update() {\n        const {coords, _hullPrev: hullPrev, _hullNext: hullNext, _hullTri: hullTri, _hullHash: hullHash} =  this;\n        const n = coords.length >> 1;\n\n        // populate an array of point indices; calculate input data bbox\n        let minX = Infinity;\n        let minY = Infinity;\n        let maxX = -Infinity;\n        let maxY = -Infinity;\n\n        for (let i = 0; i < n; i++) {\n            const x = coords[2 * i];\n            const y = coords[2 * i + 1];\n            if (x < minX) minX = x;\n            if (y < minY) minY = y;\n            if (x > maxX) maxX = x;\n            if (y > maxY) maxY = y;\n            this._ids[i] = i;\n        }\n        const cx = (minX + maxX) / 2;\n        const cy = (minY + maxY) / 2;\n\n        let i0 = 0, i1 = 0, i2 = 0;\n\n        // pick a seed point close to the center\n        for (let i = 0, minDist = Infinity; i < n; i++) {\n            const d = dist(cx, cy, coords[2 * i], coords[2 * i + 1]);\n            if (d < minDist) {\n                i0 = i;\n                minDist = d;\n            }\n        }\n        const i0x = coords[2 * i0];\n        const i0y = coords[2 * i0 + 1];\n\n        // find the point closest to the seed\n        for (let i = 0, minDist = Infinity; i < n; i++) {\n            if (i === i0) continue;\n            const d = dist(i0x, i0y, coords[2 * i], coords[2 * i + 1]);\n            if (d < minDist && d > 0) {\n                i1 = i;\n                minDist = d;\n            }\n        }\n        let i1x = coords[2 * i1];\n        let i1y = coords[2 * i1 + 1];\n\n        let minRadius = Infinity;\n\n        // find the third point which forms the smallest circumcircle with the first two\n        for (let i = 0; i < n; i++) {\n            if (i === i0 || i === i1) continue;\n            const r = circumradius(i0x, i0y, i1x, i1y, coords[2 * i], coords[2 * i + 1]);\n            if (r < minRadius) {\n                i2 = i;\n                minRadius = r;\n            }\n        }\n        let i2x = coords[2 * i2];\n        let i2y = coords[2 * i2 + 1];\n\n        if (minRadius === Infinity) {\n            // order collinear points by dx (or dy if all x are identical)\n            // and return the list as a hull\n            for (let i = 0; i < n; i++) {\n                this._dists[i] = (coords[2 * i] - coords[0]) || (coords[2 * i + 1] - coords[1]);\n            }\n            quicksort(this._ids, this._dists, 0, n - 1);\n            const hull = new Uint32Array(n);\n            let j = 0;\n            for (let i = 0, d0 = -Infinity; i < n; i++) {\n                const id = this._ids[i];\n                const d = this._dists[id];\n                if (d > d0) {\n                    hull[j++] = id;\n                    d0 = d;\n                }\n            }\n            this.hull = hull.subarray(0, j);\n            this.triangles = new Uint32Array(0);\n            this.halfedges = new Int32Array(0);\n            return;\n        }\n\n        // swap the order of the seed points for counter-clockwise orientation\n        if (orient2d(i0x, i0y, i1x, i1y, i2x, i2y) < 0) {\n            const i = i1;\n            const x = i1x;\n            const y = i1y;\n            i1 = i2;\n            i1x = i2x;\n            i1y = i2y;\n            i2 = i;\n            i2x = x;\n            i2y = y;\n        }\n\n        const center = circumcenter(i0x, i0y, i1x, i1y, i2x, i2y);\n        this._cx = center.x;\n        this._cy = center.y;\n\n        for (let i = 0; i < n; i++) {\n            this._dists[i] = dist(coords[2 * i], coords[2 * i + 1], center.x, center.y);\n        }\n\n        // sort the points by distance from the seed triangle circumcenter\n        quicksort(this._ids, this._dists, 0, n - 1);\n\n        // set up the seed triangle as the starting hull\n        this._hullStart = i0;\n        let hullSize = 3;\n\n        hullNext[i0] = hullPrev[i2] = i1;\n        hullNext[i1] = hullPrev[i0] = i2;\n        hullNext[i2] = hullPrev[i1] = i0;\n\n        hullTri[i0] = 0;\n        hullTri[i1] = 1;\n        hullTri[i2] = 2;\n\n        hullHash.fill(-1);\n        hullHash[this._hashKey(i0x, i0y)] = i0;\n        hullHash[this._hashKey(i1x, i1y)] = i1;\n        hullHash[this._hashKey(i2x, i2y)] = i2;\n\n        this.trianglesLen = 0;\n        this._addTriangle(i0, i1, i2, -1, -1, -1);\n\n        for (let k = 0, xp = 0, yp = 0; k < this._ids.length; k++) {\n            const i = this._ids[k];\n            const x = coords[2 * i];\n            const y = coords[2 * i + 1];\n\n            // skip near-duplicate points\n            if (k > 0 && Math.abs(x - xp) <= EPSILON && Math.abs(y - yp) <= EPSILON) continue;\n            xp = x;\n            yp = y;\n\n            // skip seed triangle points\n            if (i === i0 || i === i1 || i === i2) continue;\n\n            // find a visible edge on the convex hull using edge hash\n            let start = 0;\n            for (let j = 0, key = this._hashKey(x, y); j < this._hashSize; j++) {\n                start = hullHash[(key + j) % this._hashSize];\n                if (start !== -1 && start !== hullNext[start]) break;\n            }\n\n            start = hullPrev[start];\n            let e = start, q;\n            while (q = hullNext[e], orient2d(x, y, coords[2 * e], coords[2 * e + 1], coords[2 * q], coords[2 * q + 1]) >= 0) {\n                e = q;\n                if (e === start) {\n                    e = -1;\n                    break;\n                }\n            }\n            if (e === -1) continue; // likely a near-duplicate point; skip it\n\n            // add the first triangle from the point\n            let t = this._addTriangle(e, i, hullNext[e], -1, -1, hullTri[e]);\n\n            // recursively flip triangles from the point until they satisfy the Delaunay condition\n            hullTri[i] = this._legalize(t + 2);\n            hullTri[e] = t; // keep track of boundary triangles on the hull\n            hullSize++;\n\n            // walk forward through the hull, adding more triangles and flipping recursively\n            let n = hullNext[e];\n            while (q = hullNext[n], orient2d(x, y, coords[2 * n], coords[2 * n + 1], coords[2 * q], coords[2 * q + 1]) < 0) {\n                t = this._addTriangle(n, i, q, hullTri[i], -1, hullTri[n]);\n                hullTri[i] = this._legalize(t + 2);\n                hullNext[n] = n; // mark as removed\n                hullSize--;\n                n = q;\n            }\n\n            // walk backward from the other side, adding more triangles and flipping\n            if (e === start) {\n                while (q = hullPrev[e], orient2d(x, y, coords[2 * q], coords[2 * q + 1], coords[2 * e], coords[2 * e + 1]) < 0) {\n                    t = this._addTriangle(q, i, e, -1, hullTri[e], hullTri[q]);\n                    this._legalize(t + 2);\n                    hullTri[q] = t;\n                    hullNext[e] = e; // mark as removed\n                    hullSize--;\n                    e = q;\n                }\n            }\n\n            // update the hull indices\n            this._hullStart = hullPrev[i] = e;\n            hullNext[e] = hullPrev[n] = i;\n            hullNext[i] = n;\n\n            // save the two new edges in the hash table\n            hullHash[this._hashKey(x, y)] = i;\n            hullHash[this._hashKey(coords[2 * e], coords[2 * e + 1])] = e;\n        }\n\n        this.hull = new Uint32Array(hullSize);\n        for (let i = 0, e = this._hullStart; i < hullSize; i++) {\n            this.hull[i] = e;\n            e = hullNext[e];\n        }\n\n        // trim typed triangle mesh arrays\n        this.triangles = this._triangles.subarray(0, this.trianglesLen);\n        this.halfedges = this._halfedges.subarray(0, this.trianglesLen);\n    }\n\n    /**\n     * Calculate an angle-based key for the edge hash used for advancing convex hull.\n     *\n     * @param {number} x\n     * @param {number} y\n     * @private\n     */\n    _hashKey(x, y) {\n        return Math.floor(pseudoAngle(x - this._cx, y - this._cy) * this._hashSize) % this._hashSize;\n    }\n\n    /**\n     * Flip an edge in a pair of triangles if it doesn't satisfy the Delaunay condition.\n     *\n     * @param {number} a\n     * @private\n     */\n    _legalize(a) {\n        const {_triangles: triangles, _halfedges: halfedges, coords} = this;\n\n        let i = 0;\n        let ar = 0;\n\n        // recursion eliminated with a fixed-size stack\n        while (true) {\n            const b = halfedges[a];\n\n            /* if the pair of triangles doesn't satisfy the Delaunay condition\n             * (p1 is inside the circumcircle of [p0, pl, pr]), flip them,\n             * then do the same check/flip recursively for the new pair of triangles\n             *\n             *           pl                    pl\n             *          /||\\                  /  \\\n             *       al/ || \\bl            al/    \\a\n             *        /  ||  \\              /      \\\n             *       /  a||b  \\    flip    /___ar___\\\n             *     p0\\   ||   /p1   =>   p0\\---bl---/p1\n             *        \\  ||  /              \\      /\n             *       ar\\ || /br             b\\    /br\n             *          \\||/                  \\  /\n             *           pr                    pr\n             */\n            const a0 = a - a % 3;\n            ar = a0 + (a + 2) % 3;\n\n            if (b === -1) { // convex hull edge\n                if (i === 0) break;\n                a = EDGE_STACK[--i];\n                continue;\n            }\n\n            const b0 = b - b % 3;\n            const al = a0 + (a + 1) % 3;\n            const bl = b0 + (b + 2) % 3;\n\n            const p0 = triangles[ar];\n            const pr = triangles[a];\n            const pl = triangles[al];\n            const p1 = triangles[bl];\n\n            const illegal = inCircle(\n                coords[2 * p0], coords[2 * p0 + 1],\n                coords[2 * pr], coords[2 * pr + 1],\n                coords[2 * pl], coords[2 * pl + 1],\n                coords[2 * p1], coords[2 * p1 + 1]);\n\n            if (illegal) {\n                triangles[a] = p1;\n                triangles[b] = p0;\n\n                const hbl = halfedges[bl];\n\n                // edge swapped on the other side of the hull (rare); fix the half-edge reference\n                if (hbl === -1) {\n                    let e = this._hullStart;\n                    do {\n                        if (this._hullTri[e] === bl) {\n                            this._hullTri[e] = a;\n                            break;\n                        }\n                        e = this._hullPrev[e];\n                    } while (e !== this._hullStart);\n                }\n                this._link(a, hbl);\n                this._link(b, halfedges[ar]);\n                this._link(ar, bl);\n\n                const br = b0 + (b + 1) % 3;\n\n                // don't worry about hitting the cap: it can only happen on extremely degenerate input\n                if (i < EDGE_STACK.length) {\n                    EDGE_STACK[i++] = br;\n                }\n            } else {\n                if (i === 0) break;\n                a = EDGE_STACK[--i];\n            }\n        }\n\n        return ar;\n    }\n\n    /**\n     * Link two half-edges to each other.\n     * @param {number} a\n     * @param {number} b\n     * @private\n     */\n    _link(a, b) {\n        this._halfedges[a] = b;\n        if (b !== -1) this._halfedges[b] = a;\n    }\n\n    /**\n     * Add a new triangle given vertex indices and adjacent half-edge ids.\n     *\n     * @param {number} i0\n     * @param {number} i1\n     * @param {number} i2\n     * @param {number} a\n     * @param {number} b\n     * @param {number} c\n     * @private\n     */\n    _addTriangle(i0, i1, i2, a, b, c) {\n        const t = this.trianglesLen;\n\n        this._triangles[t] = i0;\n        this._triangles[t + 1] = i1;\n        this._triangles[t + 2] = i2;\n\n        this._link(t, a);\n        this._link(t + 1, b);\n        this._link(t + 2, c);\n\n        this.trianglesLen += 3;\n\n        return t;\n    }\n}\n\n/**\n * Monotonically increases with real angle, but doesn't need expensive trigonometry.\n *\n * @param {number} dx\n * @param {number} dy\n */\nfunction pseudoAngle(dx, dy) {\n    const p = dx / (Math.abs(dx) + Math.abs(dy));\n    return (dy > 0 ? 3 - p : 1 + p) / 4; // [0..1]\n}\n\n/**\n * Squared distance between two points.\n *\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n */\nfunction dist(ax, ay, bx, by) {\n    const dx = ax - bx;\n    const dy = ay - by;\n    return dx * dx + dy * dy;\n}\n\n/**\n * Check whether point P is inside a circle formed by points A, B, C.\n *\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n * @param {number} cx\n * @param {number} cy\n * @param {number} px\n * @param {number} py\n */\nfunction inCircle(ax, ay, bx, by, cx, cy, px, py) {\n    const dx = ax - px;\n    const dy = ay - py;\n    const ex = bx - px;\n    const ey = by - py;\n    const fx = cx - px;\n    const fy = cy - py;\n\n    const ap = dx * dx + dy * dy;\n    const bp = ex * ex + ey * ey;\n    const cp = fx * fx + fy * fy;\n\n    return dx * (ey * cp - bp * fy) -\n           dy * (ex * cp - bp * fx) +\n           ap * (ex * fy - ey * fx) < 0;\n}\n\n/**\n * Squared radius of the circle formed by points A, B, C.\n *\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n * @param {number} cx\n * @param {number} cy\n */\nfunction circumradius(ax, ay, bx, by, cx, cy) {\n    const dx = bx - ax;\n    const dy = by - ay;\n    const ex = cx - ax;\n    const ey = cy - ay;\n\n    const bl = dx * dx + dy * dy;\n    const cl = ex * ex + ey * ey;\n    const d = 0.5 / (dx * ey - dy * ex);\n\n    const x = (ey * bl - dy * cl) * d;\n    const y = (dx * cl - ex * bl) * d;\n\n    return x * x + y * y;\n}\n\n/**\n * Get coordinates of a circumcenter for points A, B, C.\n *\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n * @param {number} cx\n * @param {number} cy\n */\nfunction circumcenter(ax, ay, bx, by, cx, cy) {\n    const dx = bx - ax;\n    const dy = by - ay;\n    const ex = cx - ax;\n    const ey = cy - ay;\n\n    const bl = dx * dx + dy * dy;\n    const cl = ex * ex + ey * ey;\n    const d = 0.5 / (dx * ey - dy * ex);\n\n    const x = ax + (ey * bl - dy * cl) * d;\n    const y = ay + (dx * cl - ex * bl) * d;\n\n    return {x, y};\n}\n\n/**\n * Sort points by distance via an array of point indices and an array of calculated distances.\n *\n * @param {Uint32Array} ids\n * @param {Float64Array} dists\n * @param {number} left\n * @param {number} right\n */\nfunction quicksort(ids, dists, left, right) {\n    if (right - left <= 20) {\n        for (let i = left + 1; i <= right; i++) {\n            const temp = ids[i];\n            const tempDist = dists[temp];\n            let j = i - 1;\n            while (j >= left && dists[ids[j]] > tempDist) ids[j + 1] = ids[j--];\n            ids[j + 1] = temp;\n        }\n    } else {\n        const median = (left + right) >> 1;\n        let i = left + 1;\n        let j = right;\n        swap(ids, median, i);\n        if (dists[ids[left]] > dists[ids[right]]) swap(ids, left, right);\n        if (dists[ids[i]] > dists[ids[right]]) swap(ids, i, right);\n        if (dists[ids[left]] > dists[ids[i]]) swap(ids, left, i);\n\n        const temp = ids[i];\n        const tempDist = dists[temp];\n        while (true) {\n            do i++; while (dists[ids[i]] < tempDist);\n            do j--; while (dists[ids[j]] > tempDist);\n            if (j < i) break;\n            swap(ids, i, j);\n        }\n        ids[left + 1] = ids[j];\n        ids[j] = temp;\n\n        if (right - i + 1 >= j - left) {\n            quicksort(ids, dists, i, right);\n            quicksort(ids, dists, left, j - 1);\n        } else {\n            quicksort(ids, dists, left, j - 1);\n            quicksort(ids, dists, i, right);\n        }\n    }\n}\n\n/**\n * @param {Uint32Array} arr\n * @param {number} i\n * @param {number} j\n */\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\n/** @param {[number, number]} p */\nfunction defaultGetX(p) {\n    return p[0];\n}\n/** @param {[number, number]} p */\nfunction defaultGetY(p) {\n    return p[1];\n}\n"],"names":["EPSILON","EDGE_STACK","Delaunator","points","getX","defaultGetX","getY","defaultGetY","n","coords","i","p","maxTriangles","hullPrev","hullNext","hullTri","hullHash","minX","minY","maxX","maxY","x","y","cx","cy","i0","i1","i2","minDist","d","dist","i0x","i0y","i1x","i1y","minRadius","r","circumradius","i2x","i2y","quicksort","hull","j","d0","id","orient2d","center","circumcenter","hullSize","k","xp","yp","start","key","e","q","t","pseudoAngle","a","triangles","halfedges","ar","b","a0","b0","al","bl","p0","pr","pl","p1","inCircle","hbl","br","c","dx","dy","ax","ay","bx","by","px","py","ex","ey","fx","fy","ap","bp","cp","cl","ids","dists","left","right","temp","tempDist","median","swap","arr","tmp"],"mappings":"kDACMA,EAAU,KAAK,IAAI,EAAG,GAAG,EACzBC,EAAa,IAAI,YAAY,GAAG,EAKtC,MAAqBC,CAAW,CAY5B,OAAO,KAAKC,EAAQC,EAAOC,EAAaC,EAAOC,EAAa,CACxD,MAAMC,EAAIL,EAAO,OACXM,EAAS,IAAI,aAAaD,EAAI,CAAC,EAErC,QAASE,EAAI,EAAGA,EAAIF,EAAGE,IAAK,CACxB,MAAMC,EAAIR,EAAOO,CAAC,EAClBD,EAAO,EAAIC,CAAC,EAAIN,EAAKO,CAAC,EACtBF,EAAO,EAAIC,EAAI,CAAC,EAAIJ,EAAKK,CAAC,CAC9B,CAEA,OAAO,IAAIT,EAAWO,CAAM,CAChC,CAQA,YAAYA,EAAQ,CAChB,MAAMD,EAAIC,EAAO,QAAU,EAC3B,GAAID,EAAI,GAAK,OAAOC,EAAO,CAAC,GAAM,SAAU,MAAM,IAAI,MAAM,qCAAqC,EAEjG,KAAK,OAASA,EAGd,MAAMG,EAAe,KAAK,IAAI,EAAIJ,EAAI,EAAG,CAAC,EAC1B,KAAK,WAAa,IAAI,YAAYI,EAAe,CAAC,EAClD,KAAK,WAAa,IAAI,WAAWA,EAAe,CAAC,EAGjD,KAAK,UAAY,KAAK,KAAK,KAAK,KAAKJ,CAAC,CAAC,EACvC,KAAK,UAAY,IAAI,YAAYA,CAAC,EAClC,KAAK,UAAY,IAAI,YAAYA,CAAC,EAClC,KAAK,SAAW,IAAI,YAAYA,CAAC,EACjC,KAAK,UAAY,IAAI,WAAW,KAAK,SAAS,EAG9C,KAAK,KAAO,IAAI,YAAYA,CAAC,EAC7B,KAAK,OAAS,IAAI,aAAaA,CAAC,EAEhC,KAAK,aAAe,EACpB,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,WAAa,EAIlC,KAAK,KAAO,KAAK,WAEjB,KAAK,UAAY,KAAK,WAMtB,KAAK,UAAY,KAAK,WAEtB,KAAK,OAAA,CACT,CAMA,QAAS,CACL,KAAM,CAAC,OAAAC,EAAQ,UAAWI,EAAU,UAAWC,EAAU,SAAUC,EAAS,UAAWC,CAAA,EAAa,KAC9F,EAAIP,EAAO,QAAU,EAG3B,IAAIQ,EAAO,IACPC,EAAO,IACPC,EAAO,KACPC,EAAO,KAEX,QAASV,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACxB,MAAMW,EAAIZ,EAAO,EAAIC,CAAC,EAChBY,EAAIb,EAAO,EAAIC,EAAI,CAAC,EACtBW,EAAIJ,IAAMA,EAAOI,GACjBC,EAAIJ,IAAMA,EAAOI,GACjBD,EAAIF,IAAMA,EAAOE,GACjBC,EAAIF,IAAMA,EAAOE,GACrB,KAAK,KAAKZ,CAAC,EAAIA,CACnB,CACA,MAAMa,GAAMN,EAAOE,GAAQ,EACrBK,GAAMN,EAAOE,GAAQ,EAE3B,IAAIK,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAGzB,QAASjB,EAAI,EAAGkB,EAAU,IAAUlB,EAAI,EAAGA,IAAK,CAC5C,MAAMmB,EAAIC,EAAKP,EAAIC,EAAIf,EAAO,EAAIC,CAAC,EAAGD,EAAO,EAAIC,EAAI,CAAC,CAAC,EACnDmB,EAAID,IACJH,EAAKf,EACLkB,EAAUC,EAElB,CACA,MAAME,EAAMtB,EAAO,EAAIgB,CAAE,EACnBO,EAAMvB,EAAO,EAAIgB,EAAK,CAAC,EAG7B,QAASf,EAAI,EAAGkB,EAAU,IAAUlB,EAAI,EAAGA,IAAK,CAC5C,GAAIA,IAAMe,EAAI,SACd,MAAMI,EAAIC,EAAKC,EAAKC,EAAKvB,EAAO,EAAIC,CAAC,EAAGD,EAAO,EAAIC,EAAI,CAAC,CAAC,EACrDmB,EAAID,GAAWC,EAAI,IACnBH,EAAKhB,EACLkB,EAAUC,EAElB,CACA,IAAII,EAAMxB,EAAO,EAAIiB,CAAE,EACnBQ,EAAMzB,EAAO,EAAIiB,EAAK,CAAC,EAEvBS,EAAY,IAGhB,QAASzB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CACxB,GAAIA,IAAMe,GAAMf,IAAMgB,EAAI,SAC1B,MAAMU,EAAIC,EAAaN,EAAKC,EAAKC,EAAKC,EAAKzB,EAAO,EAAIC,CAAC,EAAGD,EAAO,EAAIC,EAAI,CAAC,CAAC,EACvE0B,EAAID,IACJR,EAAKjB,EACLyB,EAAYC,EAEpB,CACA,IAAIE,EAAM7B,EAAO,EAAIkB,CAAE,EACnBY,EAAM9B,EAAO,EAAIkB,EAAK,CAAC,EAE3B,GAAIQ,IAAc,IAAU,CAGxB,QAASzB,EAAI,EAAGA,EAAI,EAAGA,IACnB,KAAK,OAAOA,CAAC,EAAKD,EAAO,EAAIC,CAAC,EAAID,EAAO,CAAC,GAAOA,EAAO,EAAIC,EAAI,CAAC,EAAID,EAAO,CAAC,EAEjF+B,EAAU,KAAK,KAAM,KAAK,OAAQ,EAAG,EAAI,CAAC,EAC1C,MAAMC,EAAO,IAAI,YAAY,CAAC,EAC9B,IAAIC,EAAI,EACR,QAAShC,EAAI,EAAGiC,EAAK,KAAWjC,EAAI,EAAGA,IAAK,CACxC,MAAMkC,EAAK,KAAK,KAAKlC,CAAC,EAChBmB,EAAI,KAAK,OAAOe,CAAE,EACpBf,EAAIc,IACJF,EAAKC,GAAG,EAAIE,EACZD,EAAKd,EAEb,CACA,KAAK,KAAOY,EAAK,SAAS,EAAGC,CAAC,EAC9B,KAAK,UAAY,IAAI,YAAY,CAAC,EAClC,KAAK,UAAY,IAAI,WAAW,CAAC,EACjC,MACJ,CAGA,GAAIG,EAAAA,SAASd,EAAKC,EAAKC,EAAKC,EAAKI,EAAKC,CAAG,EAAI,EAAG,CAC5C,MAAM7B,EAAIgB,EACJL,EAAIY,EACJX,EAAIY,EACVR,EAAKC,EACLM,EAAMK,EACNJ,EAAMK,EACNZ,EAAKjB,EACL4B,EAAMjB,EACNkB,EAAMjB,CACV,CAEA,MAAMwB,EAASC,EAAahB,EAAKC,EAAKC,EAAKC,EAAKI,EAAKC,CAAG,EACxD,KAAK,IAAMO,EAAO,EAClB,KAAK,IAAMA,EAAO,EAElB,QAASpC,EAAI,EAAGA,EAAI,EAAGA,IACnB,KAAK,OAAOA,CAAC,EAAIoB,EAAKrB,EAAO,EAAIC,CAAC,EAAGD,EAAO,EAAIC,EAAI,CAAC,EAAGoC,EAAO,EAAGA,EAAO,CAAC,EAI9EN,EAAU,KAAK,KAAM,KAAK,OAAQ,EAAG,EAAI,CAAC,EAG1C,KAAK,WAAaf,EAClB,IAAIuB,EAAW,EAEflC,EAASW,CAAE,EAAIZ,EAASc,CAAE,EAAID,EAC9BZ,EAASY,CAAE,EAAIb,EAASY,CAAE,EAAIE,EAC9Bb,EAASa,CAAE,EAAId,EAASa,CAAE,EAAID,EAE9BV,EAAQU,CAAE,EAAI,EACdV,EAAQW,CAAE,EAAI,EACdX,EAAQY,CAAE,EAAI,EAEdX,EAAS,KAAK,EAAE,EAChBA,EAAS,KAAK,SAASe,EAAKC,CAAG,CAAC,EAAIP,EACpCT,EAAS,KAAK,SAASiB,EAAKC,CAAG,CAAC,EAAIR,EACpCV,EAAS,KAAK,SAASsB,EAAKC,CAAG,CAAC,EAAIZ,EAEpC,KAAK,aAAe,EACpB,KAAK,aAAaF,EAAIC,EAAIC,EAAI,GAAI,GAAI,EAAE,EAExC,QAASsB,EAAI,EAAGC,EAAK,EAAGC,EAAK,EAAGF,EAAI,KAAK,KAAK,OAAQA,IAAK,CACvD,MAAMvC,EAAI,KAAK,KAAKuC,CAAC,EACf5B,EAAIZ,EAAO,EAAIC,CAAC,EAChBY,EAAIb,EAAO,EAAIC,EAAI,CAAC,EAQ1B,GALIuC,EAAI,GAAK,KAAK,IAAI5B,EAAI6B,CAAE,GAAKlD,GAAW,KAAK,IAAIsB,EAAI6B,CAAE,GAAKnD,IAChEkD,EAAK7B,EACL8B,EAAK7B,EAGDZ,IAAMe,GAAMf,IAAMgB,GAAMhB,IAAMiB,GAAI,SAGtC,IAAIyB,EAAQ,EACZ,QAASV,EAAI,EAAGW,EAAM,KAAK,SAAShC,EAAGC,CAAC,EAAGoB,EAAI,KAAK,YAChDU,EAAQpC,GAAUqC,EAAMX,GAAK,KAAK,SAAS,EACvC,EAAAU,IAAU,IAAMA,IAAUtC,EAASsC,CAAK,IAFeV,IAE3D,CAGJU,EAAQvC,EAASuC,CAAK,EACtB,IAAIE,EAAIF,EAAOG,EACf,KAAOA,EAAIzC,EAASwC,CAAC,EAAGT,EAAAA,SAASxB,EAAGC,EAAGb,EAAO,EAAI6C,CAAC,EAAG7C,EAAO,EAAI6C,EAAI,CAAC,EAAG7C,EAAO,EAAI8C,CAAC,EAAG9C,EAAO,EAAI8C,EAAI,CAAC,CAAC,GAAK,GAE1G,GADAD,EAAIC,EACAD,IAAMF,EAAO,CACbE,EAAI,GACJ,KACJ,CAEJ,GAAIA,IAAM,GAAI,SAGd,IAAIE,EAAI,KAAK,aAAaF,EAAG5C,EAAGI,EAASwC,CAAC,EAAG,GAAI,GAAIvC,EAAQuC,CAAC,CAAC,EAG/DvC,EAAQL,CAAC,EAAI,KAAK,UAAU8C,EAAI,CAAC,EACjCzC,EAAQuC,CAAC,EAAIE,EACbR,IAGA,IAAIxC,EAAIM,EAASwC,CAAC,EAClB,KAAOC,EAAIzC,EAASN,CAAC,EAAGqC,EAAAA,SAASxB,EAAGC,EAAGb,EAAO,EAAID,CAAC,EAAGC,EAAO,EAAID,EAAI,CAAC,EAAGC,EAAO,EAAI8C,CAAC,EAAG9C,EAAO,EAAI8C,EAAI,CAAC,CAAC,EAAI,GACzGC,EAAI,KAAK,aAAahD,EAAGE,EAAG6C,EAAGxC,EAAQL,CAAC,EAAG,GAAIK,EAAQP,CAAC,CAAC,EACzDO,EAAQL,CAAC,EAAI,KAAK,UAAU8C,EAAI,CAAC,EACjC1C,EAASN,CAAC,EAAIA,EACdwC,IACAxC,EAAI+C,EAIR,GAAID,IAAMF,EACN,KAAOG,EAAI1C,EAASyC,CAAC,EAAGT,EAAAA,SAASxB,EAAGC,EAAGb,EAAO,EAAI8C,CAAC,EAAG9C,EAAO,EAAI8C,EAAI,CAAC,EAAG9C,EAAO,EAAI6C,CAAC,EAAG7C,EAAO,EAAI6C,EAAI,CAAC,CAAC,EAAI,GACzGE,EAAI,KAAK,aAAaD,EAAG7C,EAAG4C,EAAG,GAAIvC,EAAQuC,CAAC,EAAGvC,EAAQwC,CAAC,CAAC,EACzD,KAAK,UAAUC,EAAI,CAAC,EACpBzC,EAAQwC,CAAC,EAAIC,EACb1C,EAASwC,CAAC,EAAIA,EACdN,IACAM,EAAIC,EAKZ,KAAK,WAAa1C,EAASH,CAAC,EAAI4C,EAChCxC,EAASwC,CAAC,EAAIzC,EAASL,CAAC,EAAIE,EAC5BI,EAASJ,CAAC,EAAIF,EAGdQ,EAAS,KAAK,SAASK,EAAGC,CAAC,CAAC,EAAIZ,EAChCM,EAAS,KAAK,SAASP,EAAO,EAAI6C,CAAC,EAAG7C,EAAO,EAAI6C,EAAI,CAAC,CAAC,CAAC,EAAIA,CAChE,CAEA,KAAK,KAAO,IAAI,YAAYN,CAAQ,EACpC,QAAStC,EAAI,EAAG4C,EAAI,KAAK,WAAY5C,EAAIsC,EAAUtC,IAC/C,KAAK,KAAKA,CAAC,EAAI4C,EACfA,EAAIxC,EAASwC,CAAC,EAIlB,KAAK,UAAY,KAAK,WAAW,SAAS,EAAG,KAAK,YAAY,EAC9D,KAAK,UAAY,KAAK,WAAW,SAAS,EAAG,KAAK,YAAY,CAClE,CASA,SAASjC,EAAGC,EAAG,CACX,OAAO,KAAK,MAAMmC,EAAYpC,EAAI,KAAK,IAAKC,EAAI,KAAK,GAAG,EAAI,KAAK,SAAS,EAAI,KAAK,SACvF,CAQA,UAAUoC,EAAG,CACT,KAAM,CAAC,WAAYC,EAAW,WAAYC,EAAW,OAAAnD,GAAU,KAE/D,IAAIC,EAAI,EACJmD,EAAK,EAGT,OAAa,CACT,MAAMC,EAAIF,EAAUF,CAAC,EAiBfK,EAAKL,EAAIA,EAAI,EAGnB,GAFAG,EAAKE,GAAML,EAAI,GAAK,EAEhBI,IAAM,GAAI,CACV,GAAIpD,IAAM,EAAG,MACbgD,EAAIzD,EAAW,EAAES,CAAC,EAClB,QACJ,CAEA,MAAMsD,EAAKF,EAAIA,EAAI,EACbG,EAAKF,GAAML,EAAI,GAAK,EACpBQ,EAAKF,GAAMF,EAAI,GAAK,EAEpBK,EAAKR,EAAUE,CAAE,EACjBO,EAAKT,EAAUD,CAAC,EAChBW,EAAKV,EAAUM,CAAE,EACjBK,EAAKX,EAAUO,CAAE,EAQvB,GANgBK,EACZ9D,EAAO,EAAI0D,CAAE,EAAG1D,EAAO,EAAI0D,EAAK,CAAC,EACjC1D,EAAO,EAAI2D,CAAE,EAAG3D,EAAO,EAAI2D,EAAK,CAAC,EACjC3D,EAAO,EAAI4D,CAAE,EAAG5D,EAAO,EAAI4D,EAAK,CAAC,EACjC5D,EAAO,EAAI6D,CAAE,EAAG7D,EAAO,EAAI6D,EAAK,CAAC,CAAA,EAExB,CACTX,EAAUD,CAAC,EAAIY,EACfX,EAAUG,CAAC,EAAIK,EAEf,MAAMK,EAAMZ,EAAUM,CAAE,EAGxB,GAAIM,IAAQ,GAAI,CACZ,IAAIlB,EAAI,KAAK,WACb,EAAG,CACC,GAAI,KAAK,SAASA,CAAC,IAAMY,EAAI,CACzB,KAAK,SAASZ,CAAC,EAAII,EACnB,KACJ,CACAJ,EAAI,KAAK,UAAUA,CAAC,CACxB,OAASA,IAAM,KAAK,WACxB,CACA,KAAK,MAAMI,EAAGc,CAAG,EACjB,KAAK,MAAMV,EAAGF,EAAUC,CAAE,CAAC,EAC3B,KAAK,MAAMA,EAAIK,CAAE,EAEjB,MAAMO,EAAKT,GAAMF,EAAI,GAAK,EAGtBpD,EAAIT,EAAW,SACfA,EAAWS,GAAG,EAAI+D,EAE1B,KAAO,CACH,GAAI/D,IAAM,EAAG,MACbgD,EAAIzD,EAAW,EAAES,CAAC,CACtB,CACJ,CAEA,OAAOmD,CACX,CAQA,MAAMH,EAAGI,EAAG,CACR,KAAK,WAAWJ,CAAC,EAAII,EACjBA,IAAM,KAAI,KAAK,WAAWA,CAAC,EAAIJ,EACvC,CAaA,aAAajC,EAAIC,EAAIC,EAAI+B,EAAGI,EAAGY,EAAG,CAC9B,MAAMlB,EAAI,KAAK,aAEf,YAAK,WAAWA,CAAC,EAAI/B,EACrB,KAAK,WAAW+B,EAAI,CAAC,EAAI9B,EACzB,KAAK,WAAW8B,EAAI,CAAC,EAAI7B,EAEzB,KAAK,MAAM6B,EAAGE,CAAC,EACf,KAAK,MAAMF,EAAI,EAAGM,CAAC,EACnB,KAAK,MAAMN,EAAI,EAAGkB,CAAC,EAEnB,KAAK,cAAgB,EAEdlB,CACX,CACJ,CAQA,SAASC,EAAYkB,EAAIC,EAAI,CACzB,MAAMjE,EAAIgE,GAAM,KAAK,IAAIA,CAAE,EAAI,KAAK,IAAIC,CAAE,GAC1C,OAAQA,EAAK,EAAI,EAAIjE,EAAI,EAAIA,GAAK,CACtC,CAUA,SAASmB,EAAK+C,EAAIC,EAAIC,EAAIC,EAAI,CAC1B,MAAML,EAAKE,EAAKE,EACVH,EAAKE,EAAKE,EAChB,OAAOL,EAAKA,EAAKC,EAAKA,CAC1B,CAcA,SAASL,EAASM,EAAIC,EAAIC,EAAIC,EAAIzD,EAAIC,EAAIyD,EAAIC,EAAI,CAC9C,MAAMP,EAAKE,EAAKI,EACVL,EAAKE,EAAKI,EACVC,EAAKJ,EAAKE,EACVG,EAAKJ,EAAKE,EACVG,EAAK9D,EAAK0D,EACVK,EAAK9D,EAAK0D,EAEVK,EAAKZ,EAAKA,EAAKC,EAAKA,EACpBY,EAAKL,EAAKA,EAAKC,EAAKA,EACpBK,EAAKJ,EAAKA,EAAKC,EAAKA,EAE1B,OAAOX,GAAMS,EAAKK,EAAKD,EAAKF,GACrBV,GAAMO,EAAKM,EAAKD,EAAKH,GACrBE,GAAMJ,EAAKG,EAAKF,EAAKC,GAAM,CACtC,CAYA,SAAShD,EAAawC,EAAIC,EAAIC,EAAIC,EAAIzD,EAAIC,EAAI,CAC1C,MAAMmD,EAAKI,EAAKF,EACVD,EAAKI,EAAKF,EACVK,EAAK5D,EAAKsD,EACVO,EAAK5D,EAAKsD,EAEVZ,EAAKS,EAAKA,EAAKC,EAAKA,EACpBc,EAAKP,EAAKA,EAAKC,EAAKA,EACpBvD,EAAI,IAAO8C,EAAKS,EAAKR,EAAKO,GAE1B9D,GAAK+D,EAAKlB,EAAKU,EAAKc,GAAM7D,EAC1B,GAAK8C,EAAKe,EAAKP,EAAKjB,GAAMrC,EAEhC,OAAOR,EAAIA,EAAI,EAAI,CACvB,CAYA,SAAS0B,EAAa8B,EAAIC,EAAIC,EAAIC,EAAIzD,EAAIC,EAAI,CAC1C,MAAMmD,EAAKI,EAAKF,EACVD,EAAKI,EAAKF,EACVK,EAAK5D,EAAKsD,EACVO,EAAK5D,EAAKsD,EAEVZ,EAAKS,EAAKA,EAAKC,EAAKA,EACpBc,EAAKP,EAAKA,EAAKC,EAAKA,EACpBvD,EAAI,IAAO8C,EAAKS,EAAKR,EAAKO,GAE1B9D,EAAIwD,GAAMO,EAAKlB,EAAKU,EAAKc,GAAM7D,EAC/B,EAAIiD,GAAMH,EAAKe,EAAKP,EAAKjB,GAAMrC,EAErC,MAAO,CAAC,EAAAR,EAAG,CAAA,CACf,CAUA,SAASmB,EAAUmD,EAAKC,EAAOC,EAAMC,EAAO,CACxC,GAAIA,EAAQD,GAAQ,GAChB,QAASnF,EAAImF,EAAO,EAAGnF,GAAKoF,EAAOpF,IAAK,CACpC,MAAMqF,EAAOJ,EAAIjF,CAAC,EACZsF,EAAWJ,EAAMG,CAAI,EAC3B,IAAIrD,EAAIhC,EAAI,EACZ,KAAOgC,GAAKmD,GAAQD,EAAMD,EAAIjD,CAAC,CAAC,EAAIsD,GAAUL,EAAIjD,EAAI,CAAC,EAAIiD,EAAIjD,GAAG,EAClEiD,EAAIjD,EAAI,CAAC,EAAIqD,CACjB,KACG,CACH,MAAME,EAAUJ,EAAOC,GAAU,EACjC,IAAIpF,EAAImF,EAAO,EACXnD,EAAIoD,EACRI,EAAKP,EAAKM,EAAQvF,CAAC,EACfkF,EAAMD,EAAIE,CAAI,CAAC,EAAID,EAAMD,EAAIG,CAAK,CAAC,GAAGI,EAAKP,EAAKE,EAAMC,CAAK,EAC3DF,EAAMD,EAAIjF,CAAC,CAAC,EAAIkF,EAAMD,EAAIG,CAAK,CAAC,GAAGI,EAAKP,EAAKjF,EAAGoF,CAAK,EACrDF,EAAMD,EAAIE,CAAI,CAAC,EAAID,EAAMD,EAAIjF,CAAC,CAAC,GAAGwF,EAAKP,EAAKE,EAAMnF,CAAC,EAEvD,MAAMqF,EAAOJ,EAAIjF,CAAC,EACZsF,EAAWJ,EAAMG,CAAI,EAC3B,OAAa,CACT,GAAGrF,UAAYkF,EAAMD,EAAIjF,CAAC,CAAC,EAAIsF,GAC/B,GAAGtD,UAAYkD,EAAMD,EAAIjD,CAAC,CAAC,EAAIsD,GAC/B,GAAItD,EAAIhC,EAAG,MACXwF,EAAKP,EAAKjF,EAAGgC,CAAC,CAClB,CACAiD,EAAIE,EAAO,CAAC,EAAIF,EAAIjD,CAAC,EACrBiD,EAAIjD,CAAC,EAAIqD,EAELD,EAAQpF,EAAI,GAAKgC,EAAImD,GACrBrD,EAAUmD,EAAKC,EAAOlF,EAAGoF,CAAK,EAC9BtD,EAAUmD,EAAKC,EAAOC,EAAMnD,EAAI,CAAC,IAEjCF,EAAUmD,EAAKC,EAAOC,EAAMnD,EAAI,CAAC,EACjCF,EAAUmD,EAAKC,EAAOlF,EAAGoF,CAAK,EAEtC,CACJ,CAOA,SAASI,EAAKC,EAAKzF,EAAGgC,EAAG,CACrB,MAAM0D,EAAMD,EAAIzF,CAAC,EACjByF,EAAIzF,CAAC,EAAIyF,EAAIzD,CAAC,EACdyD,EAAIzD,CAAC,EAAI0D,CACb,CAGA,SAAS/F,EAAYM,EAAG,CACpB,OAAOA,EAAE,CAAC,CACd,CAEA,SAASJ,EAAYI,EAAG,CACpB,OAAOA,EAAE,CAAC,CACd","x_google_ignoreList":[0]}

package/dist/index.cjs454.js

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const x=require("./index.cjs557.js"),M=require("./index.cjs558.js"),q=require("./index.cjs196.js"),p=require("./index.cjs270.js");function P(n,e,o=!0){const[t,s]=n,[[r,i],[c,l]]=e;return o&&(t===r&&s===i||t===c&&s===l)||(t-r)*(t-c)>0||(s-i)*(s-l)>0?!1:x.orient2d(r,i,c,l,t,s)===0}function y(n){const e=new M(n.length);for(const[o,t]of n)e.add(o,t);return e.finish(),{tree:e,points:n}}function m(n,{tree:e,points:o}){const t=[];for(let s=0;s<n.length;s++){const r=n[s],i=n[(s+1)%n.length],[c,l]=r,[a,g]=i;t.push(r);const d=e.range(Math.min(c,a),Math.min(l,g),Math.max(c,a),Math.max(l,g));if(d.length===0)continue;const f=[];for(const u of d){const[h,b]=o[u];P([h,b],[r,i])&&f.push(o[u])}f.length===1?t.push(f[0]):f.length>1&&(f.sort(([u,h],[b,L])=>(u-c)**2+(h-l)**2-((b-c)**2+(L-l)**2)),t.push(...f))}return t}function D(n,e,o=y(e)){return n.map(t=>m(t,o))}function k(n,e){const o=p.distance(...n),t=Math.ceil(o/e)-1,s=p.lineAngle(n);let r=n[0];const i=[r];for(let c=1;c<=t;c++)r=p.stepDistanceAngle(r,e,s),i.push(r);return i}function R(n,e){n=p.closeRing(n);let o=[];for(let t=0;t<n.length-1;t++)o=o.concat(k([n[t],n[t+1]],e));return o}function v(n,e){return n.map(o=>R(o,e))}function A(n,e){const o=[];for(let t=n[0]+e,s=0;t<=n[2];s++,t+=e)for(let r=n[1]+e,i=0;r<=n[3];i++,r+=e)o.push([t,r]);return o}function B(n){const e=n.map(t=>{const s=p.closeRing(t),r=s.length-1,i=new Float64Array(s.length*2);for(let c=0;c<s.length;c++)i[c*2]=s[c][0],i[c*2+1]=s[c][1];return{coords:i,length:r}}),o=q.computeBbox(n);return{closedRings:e,bbox:o}}function I(n,e,o){if(n<o.bbox[0]||e<o.bbox[1]||n>o.bbox[2]||e>o.bbox[3])return!1;let t=0;const s=o.closedRings;for(let r=0;r<s.length;r++){const i=s[r].coords,c=s[r].length;let l=i[0]-n,a=i[1]-e;for(let g=0;g<c;g++){const d=(g+1)*2,f=i[d]-n,u=i[d+1]-e;if(a===0&&u===0){if(f<=0&&l>=0||l<=0&&f>=0)return 0}else if(u>=0&&a<=0||u<=0&&a>=0){const h=x.orient2d(l,f,a,u,0,0);if(h===0)return 0;(h>0&&u>0&&a<=0||h<0&&u<=0&&a>0)&&t++}l=f,a=u}}return t%2!==0}function F(n,e,o){return o.some(t=>I(n,e,t))}exports.bboxToGridPoints=A;exports.buildKDBushPointIndex=y;exports.coordsInPolygonForInsidenessCheck=I;exports.coordsInPolygonsForInsidenessCheck=F;exports.interpolatePolygon=v;exports.interpolateRing=R;exports.pointOnLine=P;exports.preprocessPolygonForInsideCheck=B;exports.splitPolygonLines=D;exports.splitRingLines=m;
+//# sourceMappingURL=index.cjs454.js.map

package/dist/index.cjs454.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs454.js","sources":["../../../node_modules/@allmaps/triangulate/dist/shared.js"],"sourcesContent":["import { orient2d } from 'robust-predicates';\nimport KDBush from 'kdbush';\nimport { distance, stepDistanceAngle, lineAngle, closeRing, computeBbox } from '@allmaps/stdlib';\n// Split lines using points\nexport function pointOnLine(point, line, exclude = true) {\n    const [x, y] = point;\n    const [[x0, y0], [x1, y1]] = line;\n    if (exclude) {\n        if (x === x0 && y === y0)\n            return false;\n        if (x === x1 && y === y1)\n            return false;\n    }\n    if ((x - x0) * (x - x1) > 0)\n        return false;\n    if ((y - y0) * (y - y1) > 0)\n        return false;\n    return orient2d(x0, y0, x1, y1, x, y) === 0;\n}\nexport function buildKDBushPointIndex(points) {\n    const tree = new KDBush(points.length);\n    for (const [x, y] of points)\n        tree.add(x, y);\n    tree.finish();\n    return { tree, points };\n}\nexport function splitRingLines(ring, { tree, points }) {\n    const result = [];\n    for (let i = 0; i < ring.length; i++) {\n        const p0 = ring[i];\n        const p1 = ring[(i + 1) % ring.length];\n        const [x0, y0] = p0;\n        const [x1, y1] = p1;\n        result.push(p0);\n        const ids = tree.range(Math.min(x0, x1), Math.min(y0, y1), Math.max(x0, x1), Math.max(y0, y1));\n        if (ids.length === 0)\n            continue;\n        const hits = [];\n        for (const id of ids) {\n            const [x, y] = points[id];\n            if (pointOnLine([x, y], [p0, p1]))\n                hits.push(points[id]);\n        }\n        if (hits.length === 1) {\n            result.push(hits[0]);\n        }\n        else if (hits.length > 1) {\n            hits.sort(([ax, ay], [bx, by]) => (ax - x0) ** 2 + (ay - y0) ** 2 - ((bx - x0) ** 2 + (by - y0) ** 2));\n            result.push(...hits);\n        }\n    }\n    return result;\n}\nexport function splitPolygonLines(polygon, points, index = buildKDBushPointIndex(points)) {\n    return polygon.map((ring) => splitRingLines(ring, index));\n}\n// Interpolate line using distance\n// Return an array of points containing the first line point,\n// and betwen the first and last line point other points every `dist`\nfunction interpolateLine(line, dist) {\n    const lineDistance = distance(...line);\n    // Note: ciel - 1 instead of floor, such that for round numbers we don't include the last step\n    const steps = Math.ceil(lineDistance / dist) - 1;\n    const angle = lineAngle(line);\n    let currentPoint = line[0];\n    const result = [currentPoint];\n    for (let step = 1; step <= steps; step++) {\n        currentPoint = stepDistanceAngle(currentPoint, dist, angle);\n        result.push(currentPoint);\n    }\n    // Note: the last nextpoint, which is also line[1], is not pushed\n    return result;\n}\n// Return an array of points containing the ring points,\n// and between every pair of ring points other points every `dist`\nexport function interpolateRing(ring, dist) {\n    ring = closeRing(ring);\n    let result = [];\n    for (let i = 0; i < ring.length - 1; i++) {\n        result = result.concat(interpolateLine([ring[i], ring[i + 1]], dist));\n    }\n    return result;\n}\nexport function interpolatePolygon(polygon, dist) {\n    return polygon.map((ring) => interpolateRing(ring, dist));\n}\n// Grid\nexport function bboxToGridPoints(bbox, gridSize) {\n    const grid = [];\n    for (let x = bbox[0] + gridSize, i = 0; x <= bbox[2]; i++, x += gridSize) {\n        for (let y = bbox[1] + gridSize, j = 0; y <= bbox[3]; j++, y += gridSize) {\n            grid.push([x, y]);\n        }\n    }\n    return grid;\n}\n// Point inside triangle\nexport function preprocessPolygonForInsideCheck(polygon) {\n    const closedRings = polygon.map((ring) => {\n        const closedRing = closeRing(ring);\n        const ringLength = closedRing.length - 1;\n        // Flat typed array: [x0, y0, x1, y1, ...] — avoids nested array pointer chasing\n        const coords = new Float64Array(closedRing.length * 2);\n        for (let i = 0; i < closedRing.length; i++) {\n            coords[i * 2] = closedRing[i][0];\n            coords[i * 2 + 1] = closedRing[i][1];\n        }\n        return { coords, length: ringLength };\n    });\n    const bbox = computeBbox(polygon);\n    return { closedRings, bbox };\n}\n// Improved from point-in-polygon-hao package\n// https://github.com/rowanwins/point-in-polygon-hao/blob/938b2be31d326c52c8f6cffbbb1c59bae4d609bc/src/index.js\n// Returns true if point is inside of polygon with holes\n//\n// Speedups:\n// - Reuse preprocessed polygon\n// - Avoid point allocation (and it's garbage collection) and use coordinates\nexport function coordsInPolygonForInsidenessCheck(x, y, polygonForInsidenessCheck) {\n    if (x < polygonForInsidenessCheck.bbox[0] ||\n        y < polygonForInsidenessCheck.bbox[1] ||\n        x > polygonForInsidenessCheck.bbox[2] ||\n        y > polygonForInsidenessCheck.bbox[3])\n        return false;\n    let k = 0;\n    const closedRings = polygonForInsidenessCheck.closedRings;\n    for (let i = 0; i < closedRings.length; i++) {\n        const coords = closedRings[i].coords;\n        const length = closedRings[i].length;\n        let u1 = coords[0] - x;\n        let v1 = coords[1] - y;\n        for (let ii = 0; ii < length; ii++) {\n            const base = (ii + 1) * 2;\n            const u2 = coords[base] - x;\n            const v2 = coords[base + 1] - y;\n            if (v1 === 0 && v2 === 0) {\n                if ((u2 <= 0 && u1 >= 0) || (u1 <= 0 && u2 >= 0))\n                    return 0;\n            }\n            else if ((v2 >= 0 && v1 <= 0) || (v2 <= 0 && v1 >= 0)) {\n                const f = orient2d(u1, u2, v1, v2, 0, 0);\n                if (f === 0)\n                    return 0;\n                if ((f > 0 && v2 > 0 && v1 <= 0) || (f < 0 && v2 <= 0 && v1 > 0))\n                    k++;\n            }\n            u1 = u2;\n            v1 = v2;\n        }\n    }\n    return k % 2 !== 0;\n}\nexport function coordsInPolygonsForInsidenessCheck(x, y, polygonsForInsidenessChecks) {\n    return polygonsForInsidenessChecks.some((polygonForInsidenessChecks) => coordsInPolygonForInsidenessCheck(x, y, polygonForInsidenessChecks));\n}\n"],"names":["pointOnLine","point","line","exclude","x","y","x0","y0","x1","y1","orient2d","buildKDBushPointIndex","points","tree","KDBush","splitRingLines","ring","result","i","p0","p1","ids","hits","id","ax","ay","bx","by","splitPolygonLines","polygon","index","interpolateLine","dist","lineDistance","distance","steps","angle","lineAngle","currentPoint","step","stepDistanceAngle","interpolateRing","closeRing","interpolatePolygon","bboxToGridPoints","bbox","gridSize","grid","j","preprocessPolygonForInsideCheck","closedRings","closedRing","ringLength","coords","computeBbox","coordsInPolygonForInsidenessCheck","polygonForInsidenessCheck","k","length","u1","v1","ii","base","u2","v2","f","coordsInPolygonsForInsidenessCheck","polygonsForInsidenessChecks","polygonForInsidenessChecks"],"mappings":"kNAIO,SAASA,EAAYC,EAAOC,EAAMC,EAAU,GAAM,CACrD,KAAM,CAACC,EAAGC,CAAC,EAAIJ,EACT,CAAC,CAACK,EAAIC,CAAE,EAAG,CAACC,EAAIC,CAAE,CAAC,EAAIP,EAS7B,OARIC,IACIC,IAAME,GAAMD,IAAME,GAElBH,IAAMI,GAAMH,IAAMI,KAGrBL,EAAIE,IAAOF,EAAII,GAAM,IAErBH,EAAIE,IAAOF,EAAII,GAAM,EACf,GACJC,EAAAA,SAASJ,EAAIC,EAAIC,EAAIC,EAAIL,EAAGC,CAAC,IAAM,CAC9C,CACO,SAASM,EAAsBC,EAAQ,CAC1C,MAAMC,EAAO,IAAIC,EAAOF,EAAO,MAAM,EACrC,SAAW,CAACR,EAAGC,CAAC,IAAKO,EACjBC,EAAK,IAAIT,EAAGC,CAAC,EACjB,OAAAQ,EAAK,OAAA,EACE,CAAE,KAAAA,EAAM,OAAAD,CAAA,CACnB,CACO,SAASG,EAAeC,EAAM,CAAE,KAAAH,EAAM,OAAAD,GAAU,CACnD,MAAMK,EAAS,CAAA,EACf,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAQE,IAAK,CAClC,MAAMC,EAAKH,EAAKE,CAAC,EACXE,EAAKJ,GAAME,EAAI,GAAKF,EAAK,MAAM,EAC/B,CAACV,EAAIC,CAAE,EAAIY,EACX,CAACX,EAAIC,CAAE,EAAIW,EACjBH,EAAO,KAAKE,CAAE,EACd,MAAME,EAAMR,EAAK,MAAM,KAAK,IAAIP,EAAIE,CAAE,EAAG,KAAK,IAAID,EAAIE,CAAE,EAAG,KAAK,IAAIH,EAAIE,CAAE,EAAG,KAAK,IAAID,EAAIE,CAAE,CAAC,EAC7F,GAAIY,EAAI,SAAW,EACf,SACJ,MAAMC,EAAO,CAAA,EACb,UAAWC,KAAMF,EAAK,CAClB,KAAM,CAACjB,EAAGC,CAAC,EAAIO,EAAOW,CAAE,EACpBvB,EAAY,CAACI,EAAGC,CAAC,EAAG,CAACc,EAAIC,CAAE,CAAC,GAC5BE,EAAK,KAAKV,EAAOW,CAAE,CAAC,CAC5B,CACID,EAAK,SAAW,EAChBL,EAAO,KAAKK,EAAK,CAAC,CAAC,EAEdA,EAAK,OAAS,IACnBA,EAAK,KAAK,CAAC,CAACE,EAAIC,CAAE,EAAG,CAACC,EAAIC,CAAE,KAAOH,EAAKlB,IAAO,GAAKmB,EAAKlB,IAAO,IAAMmB,EAAKpB,IAAO,GAAKqB,EAAKpB,IAAO,EAAE,EACrGU,EAAO,KAAK,GAAGK,CAAI,EAE3B,CACA,OAAOL,CACX,CACO,SAASW,EAAkBC,EAASjB,EAAQkB,EAAQnB,EAAsBC,CAAM,EAAG,CACtF,OAAOiB,EAAQ,IAAKb,GAASD,EAAeC,EAAMc,CAAK,CAAC,CAC5D,CAIA,SAASC,EAAgB7B,EAAM8B,EAAM,CACjC,MAAMC,EAAeC,WAAS,GAAGhC,CAAI,EAE/BiC,EAAQ,KAAK,KAAKF,EAAeD,CAAI,EAAI,EACzCI,EAAQC,EAAAA,UAAUnC,CAAI,EAC5B,IAAIoC,EAAepC,EAAK,CAAC,EACzB,MAAMe,EAAS,CAACqB,CAAY,EAC5B,QAASC,EAAO,EAAGA,GAAQJ,EAAOI,IAC9BD,EAAeE,EAAAA,kBAAkBF,EAAcN,EAAMI,CAAK,EAC1DnB,EAAO,KAAKqB,CAAY,EAG5B,OAAOrB,CACX,CAGO,SAASwB,EAAgBzB,EAAMgB,EAAM,CACxChB,EAAO0B,EAAAA,UAAU1B,CAAI,EACrB,IAAIC,EAAS,CAAA,EACb,QAASC,EAAI,EAAGA,EAAIF,EAAK,OAAS,EAAGE,IACjCD,EAASA,EAAO,OAAOc,EAAgB,CAACf,EAAKE,CAAC,EAAGF,EAAKE,EAAI,CAAC,CAAC,EAAGc,CAAI,CAAC,EAExE,OAAOf,CACX,CACO,SAAS0B,EAAmBd,EAASG,EAAM,CAC9C,OAAOH,EAAQ,IAAKb,GAASyB,EAAgBzB,EAAMgB,CAAI,CAAC,CAC5D,CAEO,SAASY,EAAiBC,EAAMC,EAAU,CAC7C,MAAMC,EAAO,CAAA,EACb,QAAS3C,EAAIyC,EAAK,CAAC,EAAIC,EAAU5B,EAAI,EAAGd,GAAKyC,EAAK,CAAC,EAAG3B,IAAKd,GAAK0C,EAC5D,QAASzC,EAAIwC,EAAK,CAAC,EAAIC,EAAUE,EAAI,EAAG3C,GAAKwC,EAAK,CAAC,EAAGG,IAAK3C,GAAKyC,EAC5DC,EAAK,KAAK,CAAC3C,EAAGC,CAAC,CAAC,EAGxB,OAAO0C,CACX,CAEO,SAASE,EAAgCpB,EAAS,CACrD,MAAMqB,EAAcrB,EAAQ,IAAKb,GAAS,CACtC,MAAMmC,EAAaT,EAAAA,UAAU1B,CAAI,EAC3BoC,EAAaD,EAAW,OAAS,EAEjCE,EAAS,IAAI,aAAaF,EAAW,OAAS,CAAC,EACrD,QAASjC,EAAI,EAAGA,EAAIiC,EAAW,OAAQjC,IACnCmC,EAAOnC,EAAI,CAAC,EAAIiC,EAAWjC,CAAC,EAAE,CAAC,EAC/BmC,EAAOnC,EAAI,EAAI,CAAC,EAAIiC,EAAWjC,CAAC,EAAE,CAAC,EAEvC,MAAO,CAAE,OAAAmC,EAAQ,OAAQD,CAAA,CAC7B,CAAC,EACKP,EAAOS,EAAAA,YAAYzB,CAAO,EAChC,MAAO,CAAE,YAAAqB,OAAaL,CAAA,CAC1B,CAQO,SAASU,EAAkCnD,EAAGC,EAAGmD,EAA2B,CAC/E,GAAIpD,EAAIoD,EAA0B,KAAK,CAAC,GACpCnD,EAAImD,EAA0B,KAAK,CAAC,GACpCpD,EAAIoD,EAA0B,KAAK,CAAC,GACpCnD,EAAImD,EAA0B,KAAK,CAAC,EACpC,MAAO,GACX,IAAIC,EAAI,EACR,MAAMP,EAAcM,EAA0B,YAC9C,QAAStC,EAAI,EAAGA,EAAIgC,EAAY,OAAQhC,IAAK,CACzC,MAAMmC,EAASH,EAAYhC,CAAC,EAAE,OACxBwC,EAASR,EAAYhC,CAAC,EAAE,OAC9B,IAAIyC,EAAKN,EAAO,CAAC,EAAIjD,EACjBwD,EAAKP,EAAO,CAAC,EAAIhD,EACrB,QAASwD,EAAK,EAAGA,EAAKH,EAAQG,IAAM,CAChC,MAAMC,GAAQD,EAAK,GAAK,EAClBE,EAAKV,EAAOS,CAAI,EAAI1D,EACpB4D,EAAKX,EAAOS,EAAO,CAAC,EAAIzD,EAC9B,GAAIuD,IAAO,GAAKI,IAAO,GACnB,GAAKD,GAAM,GAAKJ,GAAM,GAAOA,GAAM,GAAKI,GAAM,EAC1C,MAAO,WAELC,GAAM,GAAKJ,GAAM,GAAOI,GAAM,GAAKJ,GAAM,EAAI,CACnD,MAAMK,EAAIvD,EAAAA,SAASiD,EAAII,EAAIH,EAAII,EAAI,EAAG,CAAC,EACvC,GAAIC,IAAM,EACN,MAAO,IACNA,EAAI,GAAKD,EAAK,GAAKJ,GAAM,GAAOK,EAAI,GAAKD,GAAM,GAAKJ,EAAK,IAC1DH,GACR,CACAE,EAAKI,EACLH,EAAKI,CACT,CACJ,CACA,OAAOP,EAAI,IAAM,CACrB,CACO,SAASS,EAAmC9D,EAAGC,EAAG8D,EAA6B,CAClF,OAAOA,EAA4B,KAAMC,GAA+Bb,EAAkCnD,EAAGC,EAAG+D,CAA0B,CAAC,CAC/I","x_google_ignoreList":[0]}

package/dist/index.cjs455.js

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function d({width:r,height:i},t,h,a){const c=h*t.originalWidth,n=a*t.originalHeight,e=h*t.originalWidth+t.width*t.scaleFactor>r?r-h*t.originalWidth:t.width*t.scaleFactor,o=a*t.originalHeight+t.height*t.scaleFactor>i?i-a*t.originalHeight:t.height*t.scaleFactor;let s=t.width,g=t.height;return c+t.width*t.scaleFactor>r&&(s=Math.floor((r-c+t.scaleFactor-1)/t.scaleFactor)),n+t.height*t.scaleFactor>i&&(g=Math.floor((i-n+t.scaleFactor-1)/t.scaleFactor)),{region:{x:c,y:n,width:e,height:o},size:{width:s,height:g}}}function l({width:r,height:i},t=768){const h=Math.max(r,i)/t,a=Math.ceil(Math.log(h)/Math.log(2));return{scaleFactors:Array.from({length:a},(c,n)=>2**n),width:t}}function u({width:r,height:i},t,h){const a=t.height||t.width,c=t.width*h,n=a*h;return{scaleFactor:h,width:t.width,height:a,originalWidth:c,originalHeight:n,columns:Math.ceil(r/c),rows:Math.ceil(i/n)}}function f(r,i){return i.map(t=>t.scaleFactors.map(h=>u(r,t,h))).flat()}function w(r){return!!r.some(i=>i.width&&i.scaleFactors&&i.scaleFactors.length)}function F(r,i,t){if(!i||!w(i))if(t)i=[l(r)];else throw new Error("Image does not support tiles or custom regions and sizes.");return f(r,i)}exports.getTileImageRequest=d;exports.getTileZoomLevels=F;
+//# sourceMappingURL=index.cjs455.js.map

package/dist/index.cjs455.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs455.js","sources":["../../../node_modules/@allmaps/iiif-parser/dist/lib/tiles.js"],"sourcesContent":["export function getTileImageRequest({ width: imageWidth, height: imageHeight }, zoomLevel, column, row) {\n    // See https://iiif.io/api/image/3.0/implementation/#3-tile-region-parameter-calculation\n    const regionX = column * zoomLevel.originalWidth;\n    const regionY = row * zoomLevel.originalHeight;\n    const regionWidth = column * zoomLevel.originalWidth + zoomLevel.width * zoomLevel.scaleFactor >\n        imageWidth\n        ? imageWidth - column * zoomLevel.originalWidth\n        : zoomLevel.width * zoomLevel.scaleFactor;\n    const regionHeight = row * zoomLevel.originalHeight + zoomLevel.height * zoomLevel.scaleFactor >\n        imageHeight\n        ? imageHeight - row * zoomLevel.originalHeight\n        : zoomLevel.height * zoomLevel.scaleFactor;\n    let tileWidth = zoomLevel.width;\n    let tileHeight = zoomLevel.height;\n    if (regionX + zoomLevel.width * zoomLevel.scaleFactor > imageWidth) {\n        tileWidth = Math.floor((imageWidth - regionX + zoomLevel.scaleFactor - 1) / zoomLevel.scaleFactor);\n    }\n    if (regionY + zoomLevel.height * zoomLevel.scaleFactor > imageHeight) {\n        tileHeight = Math.floor((imageHeight - regionY + zoomLevel.scaleFactor - 1) /\n            zoomLevel.scaleFactor);\n    }\n    return {\n        region: {\n            x: regionX,\n            y: regionY,\n            width: regionWidth,\n            height: regionHeight\n        },\n        size: {\n            width: tileWidth,\n            height: tileHeight\n        }\n    };\n}\nfunction getDefaultTileset({ width: imageWidth, height: imageHeight }, tileWidth = 768) {\n    const maxTilesPerSide = Math.max(imageWidth, imageHeight) / tileWidth;\n    const maxExponent = Math.ceil(Math.log(maxTilesPerSide) / Math.log(2));\n    // let maxTileSide\n    // if (parsedImage.maxWidth) {\n    //   maxTileSide = parsedImage.maxWidth\n    // }\n    // if (parsedImage.maxHeight) {\n    //   maxTileSide = maxTileSide\n    //     ? Math.min(maxTileSide, parsedImage.maxHeight)\n    //     : parsedImage.maxHeight\n    // }\n    // if (parsedImage.maxArea) {\n    //   maxTileSide = maxTileSide\n    //     ? Math.min(maxTileSide, Math.sqrt(parsedImage.maxArea))\n    //     : Math.sqrt(parsedImage.maxArea)\n    // }\n    return {\n        scaleFactors: Array.from({ length: maxExponent }, (_, exponent) => 2 ** exponent),\n        // .filter((scaleFactor) => {\n        //   if (maxTileSide) {\n        //     return tileWidth * scaleFactor <= maxTileSide\n        //   } else {\n        //     return true\n        //   }\n        // }),\n        width: tileWidth\n    };\n}\nfunction getTileZoomLevelFromScaleFactor({ width: imageWidth, height: imageHeight }, tileset, scaleFactor) {\n    const height = tileset.height || tileset.width;\n    const originalWidth = tileset.width * scaleFactor;\n    const originalHeight = height * scaleFactor;\n    return {\n        scaleFactor,\n        width: tileset.width,\n        height,\n        originalWidth,\n        originalHeight,\n        columns: Math.ceil(imageWidth / originalWidth),\n        rows: Math.ceil(imageHeight / originalHeight)\n    };\n}\nfunction getTileZoomLevelsFromTilesets(imageSize, tilesets) {\n    return tilesets\n        .map((tileset) => tileset.scaleFactors.map((scaleFactor) => getTileZoomLevelFromScaleFactor(imageSize, tileset, scaleFactor)))\n        .flat();\n}\nfunction hasValidTileset(tilesets) {\n    if (tilesets.some((tileset) => tileset.width && tileset.scaleFactors && tileset.scaleFactors.length)) {\n        return true;\n    }\n    return false;\n}\nexport function getTileZoomLevels(imageSize, tilesets, supportsAnyRegionAndSize) {\n    if (!tilesets || !hasValidTileset(tilesets)) {\n        if (supportsAnyRegionAndSize) {\n            tilesets = [getDefaultTileset(imageSize)];\n        }\n        else {\n            throw new Error('Image does not support tiles or custom regions and sizes.');\n        }\n    }\n    return getTileZoomLevelsFromTilesets(imageSize, tilesets);\n}\n"],"names":["getTileImageRequest","imageWidth","imageHeight","zoomLevel","column","row","regionX","regionY","regionWidth","regionHeight","tileWidth","tileHeight","getDefaultTileset","maxTilesPerSide","maxExponent","_","exponent","getTileZoomLevelFromScaleFactor","tileset","scaleFactor","height","originalWidth","originalHeight","getTileZoomLevelsFromTilesets","imageSize","tilesets","hasValidTileset","getTileZoomLevels","supportsAnyRegionAndSize"],"mappings":"gFAAO,SAASA,EAAoB,CAAE,MAAOC,EAAY,OAAQC,GAAeC,EAAWC,EAAQC,EAAK,CAEpG,MAAMC,EAAUF,EAASD,EAAU,cAC7BI,EAAUF,EAAMF,EAAU,eAC1BK,EAAcJ,EAASD,EAAU,cAAgBA,EAAU,MAAQA,EAAU,YAC/EF,EACEA,EAAaG,EAASD,EAAU,cAChCA,EAAU,MAAQA,EAAU,YAC5BM,EAAeJ,EAAMF,EAAU,eAAiBA,EAAU,OAASA,EAAU,YAC/ED,EACEA,EAAcG,EAAMF,EAAU,eAC9BA,EAAU,OAASA,EAAU,YACnC,IAAIO,EAAYP,EAAU,MACtBQ,EAAaR,EAAU,OAC3B,OAAIG,EAAUH,EAAU,MAAQA,EAAU,YAAcF,IACpDS,EAAY,KAAK,OAAOT,EAAaK,EAAUH,EAAU,YAAc,GAAKA,EAAU,WAAW,GAEjGI,EAAUJ,EAAU,OAASA,EAAU,YAAcD,IACrDS,EAAa,KAAK,OAAOT,EAAcK,EAAUJ,EAAU,YAAc,GACrEA,EAAU,WAAW,GAEtB,CACH,OAAQ,CACJ,EAAGG,EACH,EAAGC,EACH,MAAOC,EACP,OAAQC,CAAA,EAEZ,KAAM,CACF,MAAOC,EACP,OAAQC,CAAA,CACZ,CAER,CACA,SAASC,EAAkB,CAAE,MAAOX,EAAY,OAAQC,CAAA,EAAeQ,EAAY,IAAK,CACpF,MAAMG,EAAkB,KAAK,IAAIZ,EAAYC,CAAW,EAAIQ,EACtDI,EAAc,KAAK,KAAK,KAAK,IAAID,CAAe,EAAI,KAAK,IAAI,CAAC,CAAC,EAerE,MAAO,CACH,aAAc,MAAM,KAAK,CAAE,OAAQC,GAAe,CAACC,EAAGC,IAAa,GAAKA,CAAQ,EAQhF,MAAON,CAAA,CAEf,CACA,SAASO,EAAgC,CAAE,MAAOhB,EAAY,OAAQC,CAAA,EAAegB,EAASC,EAAa,CACvG,MAAMC,EAASF,EAAQ,QAAUA,EAAQ,MACnCG,EAAgBH,EAAQ,MAAQC,EAChCG,EAAiBF,EAASD,EAChC,MAAO,CACH,YAAAA,EACA,MAAOD,EAAQ,MACf,OAAAE,EACA,cAAAC,EACA,eAAAC,EACA,QAAS,KAAK,KAAKrB,EAAaoB,CAAa,EAC7C,KAAM,KAAK,KAAKnB,EAAcoB,CAAc,CAAA,CAEpD,CACA,SAASC,EAA8BC,EAAWC,EAAU,CACxD,OAAOA,EACF,IAAKP,GAAYA,EAAQ,aAAa,IAAKC,GAAgBF,EAAgCO,EAAWN,EAASC,CAAW,CAAC,CAAC,EAC5H,KAAA,CACT,CACA,SAASO,EAAgBD,EAAU,CAC/B,MAAI,EAAAA,EAAS,KAAMP,GAAYA,EAAQ,OAASA,EAAQ,cAAgBA,EAAQ,aAAa,MAAM,CAIvG,CACO,SAASS,EAAkBH,EAAWC,EAAUG,EAA0B,CAC7E,GAAI,CAACH,GAAY,CAACC,EAAgBD,CAAQ,EACtC,GAAIG,EACAH,EAAW,CAACb,EAAkBY,CAAS,CAAC,MAGxC,OAAM,IAAI,MAAM,2DAA2D,EAGnF,OAAOD,EAA8BC,EAAWC,CAAQ,CAC5D","x_google_ignoreList":[0]}

package/dist/index.cjs456.js

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("./index.cjs455.js");function I(o,d,u="cover"){if(u==="cover"||u==="contain"){const l=d.width/o.width,e=d.height/o.height,w=u==="cover"?Math.max(l,e):Math.min(l,e),r=o.width*w,s=o.height*w;return{width:r,height:s}}else throw new Error('Mode must be either "cover" or "contain"')}const y=.8,E=1.5;function F(o,d,u="cover",{sizes:l,tileZoomLevels:e,supportsAnyRegionAndSize:w,maxWidth:r,maxHeight:s,maxArea:M}){let{width:t,height:h}=I(o,d,u);if(r&&t>r&&(h=h/t*r,t=r),s&&h>s&&(t=t/h*s,h=s),M&&t*h>M){const n=h/t,i=Math.floor(Math.sqrt(M/n))*n;t=Math.floor(i)/n,h=t*n}const R=o.width/o.height;if(t=Math.floor(t),h=Math.round(t/R),l){let n;for(const f of l){const i=f.width/t;if(i>=y&&i<=E){n=f;break}}if(n)return{size:n}}if(w)return{size:{width:Math.round(t),height:Math.round(h)}};if(e){const n=o.width/t,f=e.map(({scaleFactor:c},a)=>({index:a,scaleFactor:c,diff:Math.abs(c-n)})).sort((c,a)=>c.diff-a.diff),i=e[f[0].index],p=Math.ceil(o.width/(i.scaleFactor*e[0].width)),q=Math.ceil(o.height/(i.scaleFactor*e[0].height)),g=[];for(let c=0;c<q;c++){const a=[];for(let b=0;b<p;b++){const T=v.getTileImageRequest(o,i,b,c);a.push(T)}g.push(a)}return g}throw new Error("Unable to create thumbnail")}exports.getImageRequest=F;
+//# sourceMappingURL=index.cjs456.js.map

package/dist/index.cjs456.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs456.js","sources":["../../../node_modules/@allmaps/iiif-parser/dist/lib/image-requests.js"],"sourcesContent":["import { getTileImageRequest } from './tiles.js';\nfunction getImageRequestSize(imageSize, containerSize, mode = 'cover') {\n    if (mode === 'cover' || mode === 'contain') {\n        const widthRatio = containerSize.width / imageSize.width;\n        const heightRatio = containerSize.height / imageSize.height;\n        const ratio = mode === 'cover'\n            ? Math.max(widthRatio, heightRatio)\n            : Math.min(widthRatio, heightRatio);\n        const width = imageSize.width * ratio;\n        const height = imageSize.height * ratio;\n        return {\n            width,\n            height\n        };\n    }\n    else {\n        throw new Error('Mode must be either \"cover\" or \"contain\"');\n    }\n}\nconst maxThumbnailDownscale = 0.8;\nconst maxThumbnailUpscale = 1.5;\nexport function getImageRequest(imageSize, containerSize, mode = 'cover', { sizes, tileZoomLevels, supportsAnyRegionAndSize, maxWidth, maxHeight, maxArea }) {\n    let { width, height } = getImageRequestSize(imageSize, containerSize, mode);\n    if (maxWidth && width > maxWidth) {\n        height = (height / width) * maxWidth;\n        width = maxWidth;\n    }\n    if (maxHeight && height > maxHeight) {\n        width = (width / height) * maxHeight;\n        height = maxHeight;\n    }\n    if (maxArea && width * height > maxArea) {\n        const aspectRatio = height / width;\n        const thumbnailMaxWidth = Math.floor(Math.sqrt(maxArea / aspectRatio));\n        const thumbnailMaxHeight = thumbnailMaxWidth * aspectRatio;\n        width = Math.floor(thumbnailMaxHeight) / aspectRatio;\n        height = width * aspectRatio;\n    }\n    const aspectRatio = imageSize.width / imageSize.height;\n    width = Math.floor(width);\n    height = Math.round(width / aspectRatio);\n    if (sizes) {\n        let matchingSize;\n        for (const size of sizes) {\n            const scaleFactor = size.width / width;\n            if (scaleFactor >= maxThumbnailDownscale &&\n                scaleFactor <= maxThumbnailUpscale) {\n                matchingSize = size;\n                break;\n            }\n        }\n        if (matchingSize) {\n            return {\n                size: matchingSize\n            };\n        }\n    }\n    if (supportsAnyRegionAndSize) {\n        // TODO: can request smaller region than full\n        return {\n            size: {\n                width: Math.round(width),\n                height: Math.round(height)\n            }\n        };\n    }\n    if (tileZoomLevels) {\n        // TODO: take maxThumbnailDownscale and maxThumbnailUpscale into account\n        const ratio = imageSize.width / width;\n        const nearestZoomLevels = tileZoomLevels\n            .map(({ scaleFactor }, index) => ({\n            index,\n            scaleFactor,\n            diff: Math.abs(scaleFactor - ratio)\n        }))\n            .sort((a, b) => a.diff - b.diff);\n        const zoomLevel = tileZoomLevels[nearestZoomLevels[0].index];\n        const tilesX = Math.ceil(imageSize.width / (zoomLevel.scaleFactor * tileZoomLevels[0].width));\n        const tilesY = Math.ceil(imageSize.height / (zoomLevel.scaleFactor * tileZoomLevels[0].height));\n        const thumbnailTiles = [];\n        for (let y = 0; y < tilesY; y++) {\n            const thumbnailRow = [];\n            for (let x = 0; x < tilesX; x++) {\n                const thumbnailTile = getTileImageRequest(imageSize, zoomLevel, x, y);\n                thumbnailRow.push(thumbnailTile);\n            }\n            thumbnailTiles.push(thumbnailRow);\n        }\n        return thumbnailTiles;\n    }\n    throw new Error('Unable to create thumbnail');\n}\n"],"names":["getImageRequestSize","imageSize","containerSize","mode","widthRatio","heightRatio","ratio","width","height","maxThumbnailDownscale","maxThumbnailUpscale","getImageRequest","sizes","tileZoomLevels","supportsAnyRegionAndSize","maxWidth","maxHeight","maxArea","aspectRatio","thumbnailMaxHeight","matchingSize","size","scaleFactor","nearestZoomLevels","index","a","b","zoomLevel","tilesX","tilesY","thumbnailTiles","y","thumbnailRow","x","thumbnailTile","getTileImageRequest"],"mappings":"qHACA,SAASA,EAAoBC,EAAWC,EAAeC,EAAO,QAAS,CACnE,GAAIA,IAAS,SAAWA,IAAS,UAAW,CACxC,MAAMC,EAAaF,EAAc,MAAQD,EAAU,MAC7CI,EAAcH,EAAc,OAASD,EAAU,OAC/CK,EAAQH,IAAS,QACjB,KAAK,IAAIC,EAAYC,CAAW,EAChC,KAAK,IAAID,EAAYC,CAAW,EAChCE,EAAQN,EAAU,MAAQK,EAC1BE,EAASP,EAAU,OAASK,EAClC,MAAO,CACH,MAAAC,EACA,OAAAC,CAAA,CAER,KAEI,OAAM,IAAI,MAAM,0CAA0C,CAElE,CACA,MAAMC,EAAwB,GACxBC,EAAsB,IACrB,SAASC,EAAgBV,EAAWC,EAAeC,EAAO,QAAS,CAAE,MAAAS,EAAO,eAAAC,EAAgB,yBAAAC,EAA0B,SAAAC,EAAU,UAAAC,EAAW,QAAAC,CAAA,EAAW,CACzJ,GAAI,CAAE,MAAAV,EAAO,OAAAC,CAAA,EAAWR,EAAoBC,EAAWC,EAAeC,CAAI,EAS1E,GARIY,GAAYR,EAAQQ,IACpBP,EAAUA,EAASD,EAASQ,EAC5BR,EAAQQ,GAERC,GAAaR,EAASQ,IACtBT,EAASA,EAAQC,EAAUQ,EAC3BR,EAASQ,GAETC,GAAWV,EAAQC,EAASS,EAAS,CACrC,MAAMC,EAAcV,EAASD,EAEvBY,EADoB,KAAK,MAAM,KAAK,KAAKF,EAAUC,CAAW,CAAC,EACtBA,EAC/CX,EAAQ,KAAK,MAAMY,CAAkB,EAAID,EACzCV,EAASD,EAAQW,CACrB,CACA,MAAMA,EAAcjB,EAAU,MAAQA,EAAU,OAGhD,GAFAM,EAAQ,KAAK,MAAMA,CAAK,EACxBC,EAAS,KAAK,MAAMD,EAAQW,CAAW,EACnCN,EAAO,CACP,IAAIQ,EACJ,UAAWC,KAAQT,EAAO,CACtB,MAAMU,EAAcD,EAAK,MAAQd,EACjC,GAAIe,GAAeb,GACfa,GAAeZ,EAAqB,CACpCU,EAAeC,EACf,KACJ,CACJ,CACA,GAAID,EACA,MAAO,CACH,KAAMA,CAAA,CAGlB,CACA,GAAIN,EAEA,MAAO,CACH,KAAM,CACF,MAAO,KAAK,MAAMP,CAAK,EACvB,OAAQ,KAAK,MAAMC,CAAM,CAAA,CAC7B,EAGR,GAAIK,EAAgB,CAEhB,MAAMP,EAAQL,EAAU,MAAQM,EAC1BgB,EAAoBV,EACrB,IAAI,CAAC,CAAE,YAAAS,CAAA,EAAeE,KAAW,CAClC,MAAAA,EACA,YAAAF,EACA,KAAM,KAAK,IAAIA,EAAchB,CAAK,CAAA,EACpC,EACG,KAAK,CAACmB,EAAGC,IAAMD,EAAE,KAAOC,EAAE,IAAI,EAC7BC,EAAYd,EAAeU,EAAkB,CAAC,EAAE,KAAK,EACrDK,EAAS,KAAK,KAAK3B,EAAU,OAAS0B,EAAU,YAAcd,EAAe,CAAC,EAAE,MAAM,EACtFgB,EAAS,KAAK,KAAK5B,EAAU,QAAU0B,EAAU,YAAcd,EAAe,CAAC,EAAE,OAAO,EACxFiB,EAAiB,CAAA,EACvB,QAASC,EAAI,EAAGA,EAAIF,EAAQE,IAAK,CAC7B,MAAMC,EAAe,CAAA,EACrB,QAASC,EAAI,EAAGA,EAAIL,EAAQK,IAAK,CAC7B,MAAMC,EAAgBC,EAAAA,oBAAoBlC,EAAW0B,EAAWM,EAAGF,CAAC,EACpEC,EAAa,KAAKE,CAAa,CACnC,CACAJ,EAAe,KAAKE,CAAY,CACpC,CACA,OAAOF,CACX,CACA,MAAM,IAAI,MAAM,4BAA4B,CAChD","x_google_ignoreList":[0]}

package/dist/index.cjs457.js

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index.cjs211.js"),u=require("./index.cjs212.js"),A=["regionByPx","sizeByWh"];function y(e){const t=e.match(f.image1ProfileUriRegex);if(t&&t.groups)return parseInt(t.groups.level)}function p(e){const t=e.match(u.image2ProfileUriRegex);if(t&&t.groups)return parseInt(t.groups.level)}function m(e){return{maxWidth:e?.maxWidth,maxHeight:e?.maxHeight,maxArea:e?.maxArea,supportsAnyRegionAndSize:A.every(t=>e?.supports&&e?.supports?.includes(t))}}function s(e,t){t?.forEach(r=>e.add(r.toLowerCase()))}function c(e){const t=new Set(["jpg"]);return"profile"in e&&Array.isArray(e.profile)&&e.profile.forEach(r=>{typeof r!="string"&&s(t,r.formats)}),"extraFormats"in e&&s(t,e.extraFormats),"preferredFormats"in e&&s(t,e.preferredFormats),Array.from(t)}function g(e){if("type"in e&&e.type==="ImageService3")return 3;if("type"in e&&e.type==="ImageService2"||"@type"in e&&e["@type"]==="ImageService2"||"@context"in e&&e["@context"]===u.Image2ContextString)return 2;if("@context"in e&&(e["@context"]===f.Image1ContextString||e["@context"]===f.Image1ContextStringIncorrect))return 1;if("profile"in e){let t;return Array.isArray(e.profile)?t=e.profile[0]:t=e.profile,t.match(f.image1ProfileUriRegex)?1:t.match(u.image2ProfileUriRegex)?2:3}else throw new Error("Unsupported IIIF Image Service")}function F(e){if("type"in e||"@type"in e){const t=e.profile;let r=!1;return t==="level0"||typeof t=="string"&&t.endsWith("level0.json")?"extraFeatures"in e&&(r=A.every(i=>e.extraFeatures&&e.extraFeatures.includes(i))):r=!0,{maxWidth:"maxWidth"in e?e.maxWidth:void 0,maxHeight:"maxHeight"in e?e.maxHeight:void 0,maxArea:"maxArea"in e?e.maxArea:void 0,supportsAnyRegionAndSize:r}}else if(Array.isArray(e.profile)){let t=!1,r=Number.NEGATIVE_INFINITY,i=Number.NEGATIVE_INFINITY,n=Number.NEGATIVE_INFINITY;return e.profile.forEach(l=>{if(typeof l=="string"){const o=p(l);o&&(t=t||o>=1)}else{const{maxWidth:o,maxHeight:a,maxArea:x,supportsAnyRegionAndSize:h}=m(l);o!==void 0&&(i=Math.max(o,i)),a!==void 0&&(r=Math.max(a,r)),x!==void 0&&(n=Math.max(x,n)),t=t||h}}),{maxWidth:i>=0?i:void 0,maxHeight:r>=0?r:void 0,maxArea:n>=0?n:void 0,supportsAnyRegionAndSize:t}}else if("profile"in e&&e.profile){const t=y(e.profile),r=p(e.profile);return t?{supportsAnyRegionAndSize:t>=1}:r?{supportsAnyRegionAndSize:r>=1}:{supportsAnyRegionAndSize:!1}}else throw new Error("Invalid Image")}exports.getMajorIiifVersionFromImageService=g;exports.getProfileProperties=F;exports.getSupportedFormats=c;
+//# sourceMappingURL=index.cjs457.js.map

package/dist/index.cjs457.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.cjs457.js","sources":["../../../node_modules/@allmaps/iiif-parser/dist/lib/profile.js"],"sourcesContent":["import { image1ProfileUriRegex, Image1ContextString, Image1ContextStringIncorrect } from '../schemas/image.1.js';\nimport { image2ProfileUriRegex, Image2ContextString } from '../schemas/image.2.js';\nconst anyRegionAndSizeFeatures = ['regionByPx', 'sizeByWh'];\nfunction parseImage1ProfileUri(uri) {\n    const match = uri.match(image1ProfileUriRegex);\n    if (match && match.groups) {\n        const level = parseInt(match.groups.level);\n        return level;\n    }\n}\nfunction parseImage2ProfileUri(uri) {\n    const match = uri.match(image2ProfileUriRegex);\n    if (match && match.groups) {\n        const level = parseInt(match.groups.level);\n        return level;\n    }\n}\nfunction parseImage2ProfileDescription(parsedProfileDescription) {\n    return {\n        maxWidth: parsedProfileDescription?.maxWidth,\n        maxHeight: parsedProfileDescription?.maxHeight,\n        maxArea: parsedProfileDescription?.maxArea,\n        supportsAnyRegionAndSize: anyRegionAndSizeFeatures.every((feature) => parsedProfileDescription?.supports &&\n            parsedProfileDescription?.supports?.includes(feature))\n    };\n}\nfunction addFormats(formats, values) {\n    values?.forEach((format) => formats.add(format.toLowerCase()));\n}\nexport function getSupportedFormats(parsedImage) {\n    const formats = new Set(['jpg']);\n    if ('profile' in parsedImage && Array.isArray(parsedImage.profile)) {\n        parsedImage.profile.forEach((profile) => {\n            if (typeof profile !== 'string') {\n                addFormats(formats, profile.formats);\n            }\n        });\n    }\n    if ('extraFormats' in parsedImage) {\n        addFormats(formats, parsedImage.extraFormats);\n    }\n    if ('preferredFormats' in parsedImage) {\n        addFormats(formats, parsedImage.preferredFormats);\n    }\n    return Array.from(formats);\n}\nexport function getMajorIiifVersionFromImageService(imageService) {\n    if ('type' in imageService && imageService.type === 'ImageService3') {\n        return 3;\n    }\n    else if (('type' in imageService && imageService.type === 'ImageService2') ||\n        ('@type' in imageService && imageService['@type'] === 'ImageService2') ||\n        ('@context' in imageService &&\n            imageService['@context'] === Image2ContextString)) {\n        return 2;\n    }\n    else if ('@context' in imageService &&\n        (imageService['@context'] === Image1ContextString ||\n            imageService['@context'] === Image1ContextStringIncorrect)) {\n        return 1;\n    }\n    else if ('profile' in imageService) {\n        let profile;\n        if (Array.isArray(imageService.profile)) {\n            profile = imageService.profile[0];\n        }\n        else {\n            profile = imageService.profile;\n        }\n        if (profile.match(image1ProfileUriRegex)) {\n            return 1;\n        }\n        else if (profile.match(image2ProfileUriRegex)) {\n            return 2;\n        }\n        else {\n            return 3;\n        }\n    }\n    else {\n        throw new Error('Unsupported IIIF Image Service');\n    }\n}\nexport function getProfileProperties(parsedImage) {\n    // TODO: this function is very messy and needs cleaning up.\n    // Probably also needs a better way to keep ImageService and ImageInfo apart.\n    if ('type' in parsedImage || '@type' in parsedImage) {\n        const profile = parsedImage.profile;\n        let supportsAnyRegionAndSize = false;\n        if (profile === 'level0' ||\n            (typeof profile === 'string' && profile.endsWith('level0.json'))) {\n            if ('extraFeatures' in parsedImage) {\n                supportsAnyRegionAndSize = anyRegionAndSizeFeatures.every((feature) => parsedImage.extraFeatures &&\n                    parsedImage.extraFeatures.includes(feature));\n            }\n        }\n        else {\n            supportsAnyRegionAndSize = true;\n        }\n        return {\n            maxWidth: 'maxWidth' in parsedImage ? parsedImage.maxWidth : undefined,\n            maxHeight: 'maxHeight' in parsedImage ? parsedImage.maxHeight : undefined,\n            maxArea: 'maxArea' in parsedImage ? parsedImage.maxArea : undefined,\n            supportsAnyRegionAndSize\n        };\n    }\n    else if (Array.isArray(parsedImage.profile)) {\n        let supportsAnyRegionAndSize = false;\n        let maxHeight = Number.NEGATIVE_INFINITY;\n        let maxWidth = Number.NEGATIVE_INFINITY;\n        let maxArea = Number.NEGATIVE_INFINITY;\n        parsedImage.profile.forEach((profile) => {\n            if (typeof profile === 'string') {\n                const profileLevel = parseImage2ProfileUri(profile);\n                if (profileLevel) {\n                    supportsAnyRegionAndSize =\n                        supportsAnyRegionAndSize || profileLevel >= 1;\n                }\n            }\n            else {\n                const { maxWidth: profileMaxWidth, maxHeight: profileMaxHeight, maxArea: profileMaxArea, supportsAnyRegionAndSize: profileSupportsAnyRegionAndSize } = parseImage2ProfileDescription(profile);\n                if (profileMaxWidth !== undefined) {\n                    maxWidth = Math.max(profileMaxWidth, maxWidth);\n                }\n                if (profileMaxHeight !== undefined) {\n                    maxHeight = Math.max(profileMaxHeight, maxHeight);\n                }\n                if (profileMaxArea !== undefined) {\n                    maxArea = Math.max(profileMaxArea, maxArea);\n                }\n                supportsAnyRegionAndSize =\n                    supportsAnyRegionAndSize || profileSupportsAnyRegionAndSize;\n            }\n        });\n        return {\n            maxWidth: maxWidth >= 0 ? maxWidth : undefined,\n            maxHeight: maxHeight >= 0 ? maxHeight : undefined,\n            maxArea: maxArea >= 0 ? maxArea : undefined,\n            supportsAnyRegionAndSize\n        };\n    }\n    else if ('profile' in parsedImage && parsedImage.profile) {\n        const profileLevel1 = parseImage1ProfileUri(parsedImage.profile);\n        const profileLevel2 = parseImage2ProfileUri(parsedImage.profile);\n        if (profileLevel1) {\n            return {\n                supportsAnyRegionAndSize: profileLevel1 >= 1\n            };\n        }\n        else if (profileLevel2) {\n            return {\n                supportsAnyRegionAndSize: profileLevel2 >= 1\n            };\n        }\n        else {\n            return {\n                supportsAnyRegionAndSize: false\n            };\n        }\n    }\n    else {\n        throw new Error('Invalid Image');\n    }\n}\n"],"names":["anyRegionAndSizeFeatures","parseImage1ProfileUri","uri","match","image1ProfileUriRegex","parseImage2ProfileUri","image2ProfileUriRegex","parseImage2ProfileDescription","parsedProfileDescription","feature","addFormats","formats","values","format","getSupportedFormats","parsedImage","profile","getMajorIiifVersionFromImageService","imageService","Image2ContextString","Image1ContextString","Image1ContextStringIncorrect","getProfileProperties","supportsAnyRegionAndSize","maxHeight","maxWidth","maxArea","profileLevel","profileMaxWidth","profileMaxHeight","profileMaxArea","profileSupportsAnyRegionAndSize","profileLevel1","profileLevel2"],"mappings":"oJAEMA,EAA2B,CAAC,aAAc,UAAU,EAC1D,SAASC,EAAsBC,EAAK,CAChC,MAAMC,EAAQD,EAAI,MAAME,uBAAqB,EAC7C,GAAID,GAASA,EAAM,OAEf,OADc,SAASA,EAAM,OAAO,KAAK,CAGjD,CACA,SAASE,EAAsBH,EAAK,CAChC,MAAMC,EAAQD,EAAI,MAAMI,uBAAqB,EAC7C,GAAIH,GAASA,EAAM,OAEf,OADc,SAASA,EAAM,OAAO,KAAK,CAGjD,CACA,SAASI,EAA8BC,EAA0B,CAC7D,MAAO,CACH,SAAUA,GAA0B,SACpC,UAAWA,GAA0B,UACrC,QAASA,GAA0B,QACnC,yBAA0BR,EAAyB,MAAOS,GAAYD,GAA0B,UAC5FA,GAA0B,UAAU,SAASC,CAAO,CAAC,CAAA,CAEjE,CACA,SAASC,EAAWC,EAASC,EAAQ,CACjCA,GAAQ,QAASC,GAAWF,EAAQ,IAAIE,EAAO,YAAA,CAAa,CAAC,CACjE,CACO,SAASC,EAAoBC,EAAa,CAC7C,MAAMJ,EAAU,IAAI,IAAI,CAAC,KAAK,CAAC,EAC/B,MAAI,YAAaI,GAAe,MAAM,QAAQA,EAAY,OAAO,GAC7DA,EAAY,QAAQ,QAASC,GAAY,CACjC,OAAOA,GAAY,UACnBN,EAAWC,EAASK,EAAQ,OAAO,CAE3C,CAAC,EAED,iBAAkBD,GAClBL,EAAWC,EAASI,EAAY,YAAY,EAE5C,qBAAsBA,GACtBL,EAAWC,EAASI,EAAY,gBAAgB,EAE7C,MAAM,KAAKJ,CAAO,CAC7B,CACO,SAASM,EAAoCC,EAAc,CAC9D,GAAI,SAAUA,GAAgBA,EAAa,OAAS,gBAChD,MAAO,MAED,SAAUA,GAAgBA,EAAa,OAAS,iBACrD,UAAWA,GAAgBA,EAAa,OAAO,IAAM,iBACrD,aAAcA,GACXA,EAAa,UAAU,IAAMC,sBACjC,MAAO,GACX,GACS,aAAcD,IAClBA,EAAa,UAAU,IAAME,EAAAA,qBAC1BF,EAAa,UAAU,IAAMG,EAAAA,8BACjC,MAAO,GACX,GACS,YAAaH,EAAc,CAChC,IAAIF,EAOJ,OANI,MAAM,QAAQE,EAAa,OAAO,EAClCF,EAAUE,EAAa,QAAQ,CAAC,EAGhCF,EAAUE,EAAa,QAEvBF,EAAQ,MAAMZ,EAAAA,qBAAqB,EAC5B,EAEFY,EAAQ,MAAMV,EAAAA,qBAAqB,EACjC,EAGA,CAEf,KAEI,OAAM,IAAI,MAAM,gCAAgC,CAExD,CACO,SAASgB,EAAqBP,EAAa,CAG9C,GAAI,SAAUA,GAAe,UAAWA,EAAa,CACjD,MAAMC,EAAUD,EAAY,QAC5B,IAAIQ,EAA2B,GAC/B,OAAIP,IAAY,UACX,OAAOA,GAAY,UAAYA,EAAQ,SAAS,aAAa,EAC1D,kBAAmBD,IACnBQ,EAA2BvB,EAAyB,MAAOS,GAAYM,EAAY,eAC/EA,EAAY,cAAc,SAASN,CAAO,CAAC,GAInDc,EAA2B,GAExB,CACH,SAAU,aAAcR,EAAcA,EAAY,SAAW,OAC7D,UAAW,cAAeA,EAAcA,EAAY,UAAY,OAChE,QAAS,YAAaA,EAAcA,EAAY,QAAU,OAC1D,yBAAAQ,CAAA,CAER,SACS,MAAM,QAAQR,EAAY,OAAO,EAAG,CACzC,IAAIQ,EAA2B,GAC3BC,EAAY,OAAO,kBACnBC,EAAW,OAAO,kBAClBC,EAAU,OAAO,kBACrB,OAAAX,EAAY,QAAQ,QAASC,GAAY,CACrC,GAAI,OAAOA,GAAY,SAAU,CAC7B,MAAMW,EAAetB,EAAsBW,CAAO,EAC9CW,IACAJ,EACIA,GAA4BI,GAAgB,EAExD,KACK,CACD,KAAM,CAAE,SAAUC,EAAiB,UAAWC,EAAkB,QAASC,EAAgB,yBAA0BC,GAAoCxB,EAA8BS,CAAO,EACxLY,IAAoB,SACpBH,EAAW,KAAK,IAAIG,EAAiBH,CAAQ,GAE7CI,IAAqB,SACrBL,EAAY,KAAK,IAAIK,EAAkBL,CAAS,GAEhDM,IAAmB,SACnBJ,EAAU,KAAK,IAAII,EAAgBJ,CAAO,GAE9CH,EACIA,GAA4BQ,CACpC,CACJ,CAAC,EACM,CACH,SAAUN,GAAY,EAAIA,EAAW,OACrC,UAAWD,GAAa,EAAIA,EAAY,OACxC,QAASE,GAAW,EAAIA,EAAU,OAClC,yBAAAH,CAAA,CAER,SACS,YAAaR,GAAeA,EAAY,QAAS,CACtD,MAAMiB,EAAgB/B,EAAsBc,EAAY,OAAO,EACzDkB,EAAgB5B,EAAsBU,EAAY,OAAO,EAC/D,OAAIiB,EACO,CACH,yBAA0BA,GAAiB,CAAA,EAG1CC,EACE,CACH,yBAA0BA,GAAiB,CAAA,EAIxC,CACH,yBAA0B,EAAA,CAGtC,KAEI,OAAM,IAAI,MAAM,eAAe,CAEvC","x_google_ignoreList":[0]}