@math.gl/polygon 3.5.6 → 3.6.0-alpha.2

package/dist/es5/polygon-utils.js

@@ -15,12 +15,14 @@ exports.WINDING = void 0;
 
 var _core = require("@math.gl/core");
 
-var WINDING = {
-  CLOCKWISE: 1,
-  COUNTER_CLOCKWISE: -1
-};
+var WINDING;
 exports.WINDING = WINDING;
 
+(function (WINDING) {
+  WINDING[WINDING["CLOCKWISE"] = 1] = "CLOCKWISE";
+  WINDING[WINDING["COUNTER_CLOCKWISE"] = -1] = "COUNTER_CLOCKWISE";
+})(WINDING || (exports.WINDING = WINDING = {}));
+
 function modifyPolygonWindingDirection(points, direction) {
   var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
   var windingDirection = getPolygonWindingDirection(points, options);

package/dist/es5/polygon-utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/polygon-utils.js"],"names":["WINDING","CLOCKWISE","COUNTER_CLOCKWISE","modifyPolygonWindingDirection","points","direction","options","windingDirection","getPolygonWindingDirection","reversePolygon","Math","sign","getPolygonSignedArea","start","end","length","dim","size","area","i","j","forEachSegmentInPolygon","visitor","isClosed","numPoints","endPointIndex","isClosedEx","numSwaps","floor","b1","b2","tmp","modifyPolygonWindingDirectionPoints","currentDirection","getPolygonWindingDirectionPoints","reverse","getPolygonSignedAreaPoints","forEachSegmentInPolygonPoints"],"mappings":";;;;;;;;;;;;;;;AAEA;;AAGO,IAAMA,OAAO,GAAG;AACrBC,EAAAA,SAAS,EAAE,CADU;AAErBC,EAAAA,iBAAiB,EAAE,CAAC;AAFC,CAAhB;;;AAMA,SAASC,6BAAT,CAAuCC,MAAvC,EAA+CC,SAA/C,EAAwE;AAAA,MAAdC,OAAc,uEAAJ,EAAI;AAC7E,MAAMC,gBAAgB,GAAGC,0BAA0B,CAACJ,MAAD,EAASE,OAAT,CAAnD;;AACA,MAAIC,gBAAgB,KAAKF,SAAzB,EAAoC;AAClCI,IAAAA,cAAc,CAACL,MAAD,EAASE,OAAT,CAAd;AACA,WAAO,IAAP;AACD;;AACD,SAAO,KAAP;AACD;;AAGM,SAASE,0BAAT,CAAoCJ,MAApC,EAA0D;AAAA,MAAdE,OAAc,uEAAJ,EAAI;AAC/D,SAAOI,IAAI,CAACC,IAAL,CAAUC,oBAAoB,CAACR,MAAD,EAASE,OAAT,CAA9B,CAAP;AACD;;AAGM,SAASM,oBAAT,CAA8BR,MAA9B,EAAoD;AAAA,MAAdE,OAAc,uEAAJ,EAAI;AAEzD,uBAAyCA,OAAzC,CAAOO,KAAP;AAAA,MAAOA,KAAP,+BAAe,CAAf;AAAA,qBAAyCP,OAAzC,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,6BAAwBV,MAAM,CAACW,MAA/B;AACA,MAAMC,GAAG,GAAGV,OAAO,CAACW,IAAR,IAAgB,CAA5B;AACA,MAAIC,IAAI,GAAG,CAAX;;AACA,OAAK,IAAIC,CAAC,GAAGN,KAAR,EAAeO,CAAC,GAAGN,GAAG,GAAGE,GAA9B,EAAmCG,CAAC,GAAGL,GAAvC,EAA4CK,CAAC,IAAIH,GAAjD,EAAsD;AACpDE,IAAAA,IAAI,IAAI,CAACd,MAAM,CAACe,CAAD,CAAN,GAAYf,MAAM,CAACgB,CAAD,CAAnB,KAA2BhB,MAAM,CAACe,CAAC,GAAG,CAAL,CAAN,GAAgBf,MAAM,CAACgB,CAAC,GAAG,CAAL,CAAjD,CAAR;AACAA,IAAAA,CAAC,GAAGD,CAAJ;AACD;;AACD,SAAOD,IAAI,GAAG,CAAd;AACD;;AAGM,SAASG,uBAAT,CAAiCjB,MAAjC,EAAyCkB,OAAzC,EAAgE;AAAA,MAAdhB,OAAc,uEAAJ,EAAI;AACrE,wBAA6DA,OAA7D,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAA6DP,OAA7D,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AAAA,sBAA6DT,OAA7D,CAAuCW,IAAvC;AAAA,MAAuCA,IAAvC,8BAA8C,CAA9C;AAAA,MAAiDM,QAAjD,GAA6DjB,OAA7D,CAAiDiB,QAAjD;AAEA,MAAMC,SAAS,GAAG,CAACV,GAAG,GAAGD,KAAP,IAAgBI,IAAlC;;AACA,OAAK,IAAIE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGK,SAAS,GAAG,CAAhC,EAAmC,EAAEL,CAArC,EAAwC;AACtCG,IAAAA,OAAO,CACLlB,MAAM,CAACS,KAAK,GAAGM,CAAC,GAAGF,IAAb,CADD,EAELb,MAAM,CAACS,KAAK,GAAGM,CAAC,GAAGF,IAAZ,GAAmB,CAApB,CAFD,EAGLb,MAAM,CAACS,KAAK,GAAG,CAACM,CAAC,GAAG,CAAL,IAAUF,IAAnB,CAHD,EAILb,MAAM,CAACS,KAAK,GAAG,CAACM,CAAC,GAAG,CAAL,IAAUF,IAAlB,GAAyB,CAA1B,CAJD,EAKLE,CALK,EAMLA,CAAC,GAAG,CANC,CAAP;AAQD;;AAED,MAAMM,aAAa,GAAGZ,KAAK,GAAG,CAACW,SAAS,GAAG,CAAb,IAAkBP,IAAhD;AACA,MAAMS,UAAU,GACdH,QAAQ,IACP,kBAAOnB,MAAM,CAACS,KAAD,CAAb,EAAsBT,MAAM,CAACqB,aAAD,CAA5B,KACC,kBAAOrB,MAAM,CAACS,KAAK,GAAG,CAAT,CAAb,EAA0BT,MAAM,CAACqB,aAAa,GAAG,CAAjB,CAAhC,CAHJ;;AAKA,MAAI,CAACC,UAAL,EAAiB;AACfJ,IAAAA,OAAO,CACLlB,MAAM,CAACqB,aAAD,CADD,EAELrB,MAAM,CAACqB,aAAa,GAAG,CAAjB,CAFD,EAGLrB,MAAM,CAACS,KAAD,CAHD,EAILT,MAAM,CAACS,KAAK,GAAG,CAAT,CAJD,EAKLW,SAAS,GAAG,CALP,EAML,CANK,CAAP;AAQD;AACF;;AAED,SAASf,cAAT,CAAwBL,MAAxB,EAAgCE,OAAhC,EAAyC;AACvC,wBAAmDA,OAAnD,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAAmDP,OAAnD,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AAAA,uBAAmDT,OAAnD,CAAuCW,IAAvC;AAAA,MAAuCA,IAAvC,+BAA8C,CAA9C;AAEA,MAAMO,SAAS,GAAG,CAACV,GAAG,GAAGD,KAAP,IAAgBI,IAAlC;AACA,MAAMU,QAAQ,GAAGjB,IAAI,CAACkB,KAAL,CAAWJ,SAAS,GAAG,CAAvB,CAAjB;;AACA,OAAK,IAAIL,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGQ,QAApB,EAA8B,EAAER,CAAhC,EAAmC;AACjC,QAAMU,EAAE,GAAGhB,KAAK,GAAGM,CAAC,GAAGF,IAAvB;AACA,QAAMa,EAAE,GAAGjB,KAAK,GAAG,CAACW,SAAS,GAAG,CAAZ,GAAgBL,CAAjB,IAAsBF,IAAzC;;AACA,SAAK,IAAIG,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGH,IAApB,EAA0B,EAAEG,CAA5B,EAA+B;AAC7B,UAAMW,GAAG,GAAG3B,MAAM,CAACyB,EAAE,GAAGT,CAAN,CAAlB;AACAhB,MAAAA,MAAM,CAACyB,EAAE,GAAGT,CAAN,CAAN,GAAiBhB,MAAM,CAAC0B,EAAE,GAAGV,CAAN,CAAvB;AACAhB,MAAAA,MAAM,CAAC0B,EAAE,GAAGV,CAAN,CAAN,GAAiBW,GAAjB;AACD;AACF;AACF;;AAGM,SAASC,mCAAT,CAA6C5B,MAA7C,EAAqDC,SAArD,EAA8E;AAAA,MAAdC,OAAc,uEAAJ,EAAI;AACnF,MAAM2B,gBAAgB,GAAGC,gCAAgC,CAAC9B,MAAD,EAASE,OAAT,CAAzD;;AACA,MAAI2B,gBAAgB,KAAK5B,SAAzB,EAAoC;AAClCD,IAAAA,MAAM,CAAC+B,OAAP;AACA,WAAO,IAAP;AACD;;AACD,SAAO,KAAP;AACD;;AAGM,SAASD,gCAAT,CAA0C9B,MAA1C,EAAgE;AAAA,MAAdE,OAAc,uEAAJ,EAAI;AACrE,SAAOI,IAAI,CAACC,IAAL,CAAUyB,0BAA0B,CAAChC,MAAD,EAASE,OAAT,CAApC,CAAP;AACD;;AAGM,SAAS8B,0BAAT,CAAoChC,MAApC,EAA0D;AAAA,MAAdE,OAAc,uEAAJ,EAAI;AAE/D,wBAAyCA,OAAzC,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAAyCP,OAAzC,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AACA,MAAIG,IAAI,GAAG,CAAX;;AACA,OAAK,IAAIC,CAAC,GAAGN,KAAR,EAAeO,CAAC,GAAGN,GAAG,GAAG,CAA9B,EAAiCK,CAAC,GAAGL,GAArC,EAA0C,EAAEK,CAA5C,EAA+C;AAC7CD,IAAAA,IAAI,IAAI,CAACd,MAAM,CAACe,CAAD,CAAN,CAAU,CAAV,IAAef,MAAM,CAACgB,CAAD,CAAN,CAAU,CAAV,CAAhB,KAAiChB,MAAM,CAACe,CAAD,CAAN,CAAU,CAAV,IAAef,MAAM,CAACgB,CAAD,CAAN,CAAU,CAAV,CAAhD,CAAR;AACAA,IAAAA,CAAC,GAAGD,CAAJ;AACD;;AACD,SAAOD,IAAI,GAAG,CAAd;AACD;;AAGM,SAASmB,6BAAT,CAAuCjC,MAAvC,EAA+CkB,OAA/C,EAAsE;AAAA,MAAdhB,OAAc,uEAAJ,EAAI;AAC3E,wBAAmDA,OAAnD,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAAmDP,OAAnD,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AAAA,MAAuCQ,QAAvC,GAAmDjB,OAAnD,CAAuCiB,QAAvC;;AACA,OAAK,IAAIJ,CAAC,GAAGN,KAAb,EAAoBM,CAAC,GAAGL,GAAG,GAAG,CAA9B,EAAiC,EAAEK,CAAnC,EAAsC;AACpCG,IAAAA,OAAO,CAAClB,MAAM,CAACe,CAAD,CAAP,EAAYf,MAAM,CAACe,CAAC,GAAG,CAAL,CAAlB,EAA2BA,CAA3B,EAA8BA,CAAC,GAAG,CAAlC,CAAP;AACD;;AAED,MAAMO,UAAU,GAAGH,QAAQ,IAAI,kBAAOnB,MAAM,CAACU,GAAG,GAAG,CAAP,CAAb,EAAwBV,MAAM,CAAC,CAAD,CAA9B,CAA/B;;AACA,MAAI,CAACsB,UAAL,EAAiB;AACfJ,IAAAA,OAAO,CAAClB,MAAM,CAACU,GAAG,GAAG,CAAP,CAAP,EAAkBV,MAAM,CAAC,CAAD,CAAxB,EAA6BU,GAAG,GAAG,CAAnC,EAAsC,CAAtC,CAAP;AACD;AACF","sourcesContent":["/* eslint-disable max-statements, max-depth, complexity, no-unused-expressions */\n\nimport {equals} from '@math.gl/core';\n\n/** @type {typeof import('./polygon-utils').WINDING} */\nexport const WINDING = {\n  CLOCKWISE: 1,\n  COUNTER_CLOCKWISE: -1\n};\n\n/** @type {typeof import('./polygon-utils').modifyPolygonWindingDirection} */\nexport function modifyPolygonWindingDirection(points, direction, options = {}) {\n  const windingDirection = getPolygonWindingDirection(points, options);\n  if (windingDirection !== direction) {\n    reversePolygon(points, options);\n    return true;\n  }\n  return false;\n}\n\n/** @type {typeof import('./polygon-utils').getPolygonWindingDirection} */\nexport function getPolygonWindingDirection(points, options = {}) {\n  return Math.sign(getPolygonSignedArea(points, options));\n}\n\n/** @type {typeof import('./polygon-utils').getPolygonSignedArea} */\nexport function getPolygonSignedArea(points, options = {}) {\n  // https://en.wikipedia.org/wiki/Shoelace_formula\n  const {start = 0, end = points.length} = options;\n  const dim = options.size || 2;\n  let area = 0;\n  for (let i = start, j = end - dim; i < end; i += dim) {\n    area += (points[i] - points[j]) * (points[i + 1] + points[j + 1]);\n    j = i;\n  }\n  return area / 2;\n}\n\n/** @type {typeof import('./polygon-utils').forEachSegmentInPolygon} */\nexport function forEachSegmentInPolygon(points, visitor, options = {}) {\n  const {start = 0, end = points.length, size = 2, isClosed} = options;\n\n  const numPoints = (end - start) / size;\n  for (let i = 0; i < numPoints - 1; ++i) {\n    visitor(\n      points[start + i * size],\n      points[start + i * size + 1],\n      points[start + (i + 1) * size],\n      points[start + (i + 1) * size + 1],\n      i,\n      i + 1\n    );\n  }\n\n  const endPointIndex = start + (numPoints - 1) * size;\n  const isClosedEx =\n    isClosed ||\n    (equals(points[start], points[endPointIndex]) &&\n      equals(points[start + 1], points[endPointIndex + 1]));\n\n  if (!isClosedEx) {\n    visitor(\n      points[endPointIndex],\n      points[endPointIndex + 1],\n      points[start],\n      points[start + 1],\n      numPoints - 1,\n      0\n    );\n  }\n}\n\nfunction reversePolygon(points, options) {\n  const {start = 0, end = points.length, size = 2} = options;\n\n  const numPoints = (end - start) / size;\n  const numSwaps = Math.floor(numPoints / 2);\n  for (let i = 0; i < numSwaps; ++i) {\n    const b1 = start + i * size;\n    const b2 = start + (numPoints - 1 - i) * size;\n    for (let j = 0; j < size; ++j) {\n      const tmp = points[b1 + j];\n      points[b1 + j] = points[b2 + j];\n      points[b2 + j] = tmp;\n    }\n  }\n}\n\n/** @type {typeof import('./polygon-utils').modifyPolygonWindingDirectionPoints} */\nexport function modifyPolygonWindingDirectionPoints(points, direction, options = {}) {\n  const currentDirection = getPolygonWindingDirectionPoints(points, options);\n  if (currentDirection !== direction) {\n    points.reverse();\n    return true;\n  }\n  return false;\n}\n\n/** @type {typeof import('./polygon-utils').getPolygonWindingDirectionPoints} */\nexport function getPolygonWindingDirectionPoints(points, options = {}) {\n  return Math.sign(getPolygonSignedAreaPoints(points, options));\n}\n\n/** @type {typeof import('./polygon-utils').getPolygonSignedAreaPoints} */\nexport function getPolygonSignedAreaPoints(points, options = {}) {\n  // https://en.wikipedia.org/wiki/Shoelace_formula\n  const {start = 0, end = points.length} = options;\n  let area = 0;\n  for (let i = start, j = end - 1; i < end; ++i) {\n    area += (points[i][0] - points[j][0]) * (points[i][1] + points[j][1]);\n    j = i;\n  }\n  return area / 2;\n}\n\n/** @type {typeof import('./polygon-utils').forEachSegmentInPolygonPoints} */\nexport function forEachSegmentInPolygonPoints(points, visitor, options = {}) {\n  const {start = 0, end = points.length, isClosed} = options;\n  for (let i = start; i < end - 1; ++i) {\n    visitor(points[i], points[i + 1], i, i + 1);\n  }\n\n  const isClosedEx = isClosed || equals(points[end - 1], points[0]);\n  if (!isClosedEx) {\n    visitor(points[end - 1], points[0], end - 1, 0);\n  }\n}\n"],"file":"polygon-utils.js"}
+{"version":3,"sources":["../../src/polygon-utils.ts"],"names":["WINDING","modifyPolygonWindingDirection","points","direction","options","windingDirection","getPolygonWindingDirection","reversePolygon","Math","sign","getPolygonSignedArea","start","end","length","dim","size","area","i","j","forEachSegmentInPolygon","visitor","isClosed","numPoints","endPointIndex","isClosedEx","numSwaps","floor","b1","b2","tmp","modifyPolygonWindingDirectionPoints","currentDirection","getPolygonWindingDirectionPoints","reverse","getPolygonSignedAreaPoints","forEachSegmentInPolygonPoints"],"mappings":";;;;;;;;;;;;;;;AAEA;;IAGYA,O;;;WAAAA,O;AAAAA,EAAAA,O,CAAAA,O;AAAAA,EAAAA,O,CAAAA,O;GAAAA,O,uBAAAA,O;;AA0CL,SAASC,6BAAT,CACLC,MADK,EAELC,SAFK,EAII;AAAA,MADTC,OACS,uEADgB,EAChB;AACT,MAAMC,gBAAgB,GAAGC,0BAA0B,CAACJ,MAAD,EAASE,OAAT,CAAnD;;AACA,MAAIC,gBAAgB,KAAKF,SAAzB,EAAoC;AAClCI,IAAAA,cAAc,CAACL,MAAD,EAASE,OAAT,CAAd;AACA,WAAO,IAAP;AACD;;AACD,SAAO,KAAP;AACD;;AAQM,SAASE,0BAAT,CACLJ,MADK,EAGG;AAAA,MADRE,OACQ,uEADiB,EACjB;AACR,SAAOI,IAAI,CAACC,IAAL,CAAUC,oBAAoB,CAACR,MAAD,EAASE,OAAT,CAA9B,CAAP;AACD;;AASM,SAASM,oBAAT,CAA8BR,MAA9B,EAAyF;AAAA,MAArCE,OAAqC,uEAAZ,EAAY;AAC9F,uBAAyCA,OAAzC,CAAOO,KAAP;AAAA,MAAOA,KAAP,+BAAe,CAAf;AAAA,qBAAyCP,OAAzC,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,6BAAwBV,MAAM,CAACW,MAA/B;AACA,MAAMC,GAAG,GAAGV,OAAO,CAACW,IAAR,IAAgB,CAA5B;AACA,MAAIC,IAAI,GAAG,CAAX;;AACA,OAAK,IAAIC,CAAC,GAAGN,KAAR,EAAeO,CAAC,GAAGN,GAAG,GAAGE,GAA9B,EAAmCG,CAAC,GAAGL,GAAvC,EAA4CK,CAAC,IAAIH,GAAjD,EAAsD;AACpDE,IAAAA,IAAI,IAAI,CAACd,MAAM,CAACe,CAAD,CAAN,GAAYf,MAAM,CAACgB,CAAD,CAAnB,KAA2BhB,MAAM,CAACe,CAAC,GAAG,CAAL,CAAN,GAAgBf,MAAM,CAACgB,CAAC,GAAG,CAAL,CAAjD,CAAR;AACAA,IAAAA,CAAC,GAAGD,CAAJ;AACD;;AACD,SAAOD,IAAI,GAAG,CAAd;AACD;;AAQM,SAASG,uBAAT,CACLjB,MADK,EAELkB,OAFK,EAIC;AAAA,MADNhB,OACM,uEADmB,EACnB;AACN,wBAA6DA,OAA7D,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAA6DP,OAA7D,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AAAA,sBAA6DT,OAA7D,CAAuCW,IAAvC;AAAA,MAAuCA,IAAvC,8BAA8C,CAA9C;AAAA,MAAiDM,QAAjD,GAA6DjB,OAA7D,CAAiDiB,QAAjD;AAEA,MAAMC,SAAS,GAAG,CAACV,GAAG,GAAGD,KAAP,IAAgBI,IAAlC;;AACA,OAAK,IAAIE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGK,SAAS,GAAG,CAAhC,EAAmC,EAAEL,CAArC,EAAwC;AACtCG,IAAAA,OAAO,CACLlB,MAAM,CAACS,KAAK,GAAGM,CAAC,GAAGF,IAAb,CADD,EAELb,MAAM,CAACS,KAAK,GAAGM,CAAC,GAAGF,IAAZ,GAAmB,CAApB,CAFD,EAGLb,MAAM,CAACS,KAAK,GAAG,CAACM,CAAC,GAAG,CAAL,IAAUF,IAAnB,CAHD,EAILb,MAAM,CAACS,KAAK,GAAG,CAACM,CAAC,GAAG,CAAL,IAAUF,IAAlB,GAAyB,CAA1B,CAJD,EAKLE,CALK,EAMLA,CAAC,GAAG,CANC,CAAP;AAQD;;AAED,MAAMM,aAAa,GAAGZ,KAAK,GAAG,CAACW,SAAS,GAAG,CAAb,IAAkBP,IAAhD;AACA,MAAMS,UAAU,GACdH,QAAQ,IACP,kBAAOnB,MAAM,CAACS,KAAD,CAAb,EAAsBT,MAAM,CAACqB,aAAD,CAA5B,KACC,kBAAOrB,MAAM,CAACS,KAAK,GAAG,CAAT,CAAb,EAA0BT,MAAM,CAACqB,aAAa,GAAG,CAAjB,CAAhC,CAHJ;;AAKA,MAAI,CAACC,UAAL,EAAiB;AACfJ,IAAAA,OAAO,CACLlB,MAAM,CAACqB,aAAD,CADD,EAELrB,MAAM,CAACqB,aAAa,GAAG,CAAjB,CAFD,EAGLrB,MAAM,CAACS,KAAD,CAHD,EAILT,MAAM,CAACS,KAAK,GAAG,CAAT,CAJD,EAKLW,SAAS,GAAG,CALP,EAML,CANK,CAAP;AAQD;AACF;;AAED,SAASf,cAAT,CACEL,MADF,EAEEE,OAFF,EAGQ;AACN,wBAAmDA,OAAnD,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAAmDP,OAAnD,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AAAA,uBAAmDT,OAAnD,CAAuCW,IAAvC;AAAA,MAAuCA,IAAvC,+BAA8C,CAA9C;AAEA,MAAMO,SAAS,GAAG,CAACV,GAAG,GAAGD,KAAP,IAAgBI,IAAlC;AACA,MAAMU,QAAQ,GAAGjB,IAAI,CAACkB,KAAL,CAAWJ,SAAS,GAAG,CAAvB,CAAjB;;AACA,OAAK,IAAIL,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGQ,QAApB,EAA8B,EAAER,CAAhC,EAAmC;AACjC,QAAMU,EAAE,GAAGhB,KAAK,GAAGM,CAAC,GAAGF,IAAvB;AACA,QAAMa,EAAE,GAAGjB,KAAK,GAAG,CAACW,SAAS,GAAG,CAAZ,GAAgBL,CAAjB,IAAsBF,IAAzC;;AACA,SAAK,IAAIG,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGH,IAApB,EAA0B,EAAEG,CAA5B,EAA+B;AAC7B,UAAMW,GAAG,GAAG3B,MAAM,CAACyB,EAAE,GAAGT,CAAN,CAAlB;AACAhB,MAAAA,MAAM,CAACyB,EAAE,GAAGT,CAAN,CAAN,GAAiBhB,MAAM,CAAC0B,EAAE,GAAGV,CAAN,CAAvB;AACAhB,MAAAA,MAAM,CAAC0B,EAAE,GAAGV,CAAN,CAAN,GAAiBW,GAAjB;AACD;AACF;AACF;;AAUM,SAASC,mCAAT,CACL5B,MADK,EAELC,SAFK,EAII;AAAA,MADTC,OACS,uEADgB,EAChB;AACT,MAAM2B,gBAAgB,GAAGC,gCAAgC,CAAC9B,MAAD,EAASE,OAAT,CAAzD;;AACA,MAAI2B,gBAAgB,KAAK5B,SAAzB,EAAoC;AAClCD,IAAAA,MAAM,CAAC+B,OAAP;AACA,WAAO,IAAP;AACD;;AACD,SAAO,KAAP;AACD;;AAQM,SAASD,gCAAT,CACL9B,MADK,EAGG;AAAA,MADRE,OACQ,uEADiB,EACjB;AACR,SAAOI,IAAI,CAACC,IAAL,CAAUyB,0BAA0B,CAAChC,MAAD,EAASE,OAAT,CAApC,CAAP;AACD;;AAQM,SAAS8B,0BAAT,CACLhC,MADK,EAGG;AAAA,MADRE,OACQ,uEADiB,EACjB;AAER,wBAAyCA,OAAzC,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAAyCP,OAAzC,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AACA,MAAIG,IAAI,GAAG,CAAX;;AACA,OAAK,IAAIC,CAAC,GAAGN,KAAR,EAAeO,CAAC,GAAGN,GAAG,GAAG,CAA9B,EAAiCK,CAAC,GAAGL,GAArC,EAA0C,EAAEK,CAA5C,EAA+C;AAC7CD,IAAAA,IAAI,IAAI,CAACd,MAAM,CAACe,CAAD,CAAN,CAAU,CAAV,IAAef,MAAM,CAACgB,CAAD,CAAN,CAAU,CAAV,CAAhB,KAAiChB,MAAM,CAACe,CAAD,CAAN,CAAU,CAAV,IAAef,MAAM,CAACgB,CAAD,CAAN,CAAU,CAAV,CAAhD,CAAR;AACAA,IAAAA,CAAC,GAAGD,CAAJ;AACD;;AACD,SAAOD,IAAI,GAAG,CAAd;AACD;;AAQM,SAASmB,6BAAT,CACLjC,MADK,EAELkB,OAFK,EAIC;AAAA,MADNhB,OACM,uEADmB,EACnB;AACN,wBAAmDA,OAAnD,CAAOO,KAAP;AAAA,MAAOA,KAAP,gCAAe,CAAf;AAAA,sBAAmDP,OAAnD,CAAkBQ,GAAlB;AAAA,MAAkBA,GAAlB,8BAAwBV,MAAM,CAACW,MAA/B;AAAA,MAAuCQ,QAAvC,GAAmDjB,OAAnD,CAAuCiB,QAAvC;;AACA,OAAK,IAAIJ,CAAC,GAAGN,KAAb,EAAoBM,CAAC,GAAGL,GAAG,GAAG,CAA9B,EAAiC,EAAEK,CAAnC,EAAsC;AACpCG,IAAAA,OAAO,CAAClB,MAAM,CAACe,CAAD,CAAP,EAAYf,MAAM,CAACe,CAAC,GAAG,CAAL,CAAlB,EAA2BA,CAA3B,EAA8BA,CAAC,GAAG,CAAlC,CAAP;AACD;;AAED,MAAMO,UAAU,GAAGH,QAAQ,IAAI,kBAAOnB,MAAM,CAACU,GAAG,GAAG,CAAP,CAAb,EAAwBV,MAAM,CAAC,CAAD,CAA9B,CAA/B;;AACA,MAAI,CAACsB,UAAL,EAAiB;AACfJ,IAAAA,OAAO,CAAClB,MAAM,CAACU,GAAG,GAAG,CAAP,CAAP,EAAkBV,MAAM,CAAC,CAAD,CAAxB,EAA6BU,GAAG,GAAG,CAAnC,EAAsC,CAAtC,CAAP;AACD;AACF","sourcesContent":["/* eslint-disable max-statements, max-depth, complexity, no-unused-expressions */\n\nimport {equals} from '@math.gl/core';\nimport type {NumericArray} from '@math.gl/core';\n\nexport enum WINDING {\n  CLOCKWISE = 1,\n  COUNTER_CLOCKWISE = -1\n}\n\n/** Polygon representation where each point is represented as a separate array of positions. */\ntype PointsArray = NumericArray[];\n\n/** Segment visitor callback type for polygons defined with flat arrays, */\ntype SegmentVisitorFlat = (\n  p1x: number,\n  p1y: number,\n  p2x: number,\n  p2y: number,\n  i1: number,\n  i2: number\n) => void;\n\n/** Segment visitor callback type for polygons defined with array of points. */\nexport type SegmentVisitorPoints = (\n  p1: NumericArray,\n  p2: NumericArray,\n  i1: number,\n  i2: number\n) => void;\n\n/** Parameters of a polygon. */\ntype PolygonParams = {\n  start?: number; // Start index of the polygon in the array of positions. Defaults to 0.\n  end?: number; // End index of the polygon in the array of positions. Defaults to number of positions.\n  size?: number; // Size of a point, 2 (XZ) or 3 (XYZ). Defaults to 2. Affects only polygons stored in flat arrays.\n  isClosed?: boolean; // Indicates that the first point of the polygon is equal to the last point, and additional checks should be ommited.\n};\n\n/**\n * Checks winding direction of the polygon and reverses the polygon in case of opposite winding direction.\n * Note: points are modified in-place.\n * @param points An array that represents points of the polygon.\n * @param direction Requested winding direction. 1 is for clockwise, -1 for counterclockwise winding direction.\n * @param options Parameters of the polygon.\n * @return Returns true if the winding direction was changed.\n */\nexport function modifyPolygonWindingDirection(\n  points: NumericArray,\n  direction: number,\n  options: PolygonParams = {}\n): boolean {\n  const windingDirection = getPolygonWindingDirection(points, options);\n  if (windingDirection !== direction) {\n    reversePolygon(points, options);\n    return true;\n  }\n  return false;\n}\n\n/**\n * Returns winding direction of the polygon.\n * @param points An array that represents points of the polygon.\n * @param options Parameters of the polygon.\n * @returns Winding direction of the polygon.\n */\nexport function getPolygonWindingDirection(\n  points: NumericArray,\n  options: PolygonParams = {}\n): number {\n  return Math.sign(getPolygonSignedArea(points, options));\n}\n\n/**\n * Returns signed area of the polygon.\n * @param points An array that represents points of the polygon.\n * @param options Parameters of the polygon.\n * @returns Signed area of the polygon.\n * https://en.wikipedia.org/wiki/Shoelace_formula\n */\nexport function getPolygonSignedArea(points: NumericArray, options: PolygonParams = {}): number {\n  const {start = 0, end = points.length} = options;\n  const dim = options.size || 2;\n  let area = 0;\n  for (let i = start, j = end - dim; i < end; i += dim) {\n    area += (points[i] - points[j]) * (points[i + 1] + points[j + 1]);\n    j = i;\n  }\n  return area / 2;\n}\n\n/**\n * Calls the visitor callback for each segment in the polygon.\n * @param points An array that represents points of the polygon\n * @param visitor A callback to call for each segment.\n * @param options Parameters of the polygon.\n */\nexport function forEachSegmentInPolygon(\n  points: NumericArray,\n  visitor: SegmentVisitorFlat,\n  options: PolygonParams = {}\n): void {\n  const {start = 0, end = points.length, size = 2, isClosed} = options;\n\n  const numPoints = (end - start) / size;\n  for (let i = 0; i < numPoints - 1; ++i) {\n    visitor(\n      points[start + i * size],\n      points[start + i * size + 1],\n      points[start + (i + 1) * size],\n      points[start + (i + 1) * size + 1],\n      i,\n      i + 1\n    );\n  }\n\n  const endPointIndex = start + (numPoints - 1) * size;\n  const isClosedEx =\n    isClosed ||\n    (equals(points[start], points[endPointIndex]) &&\n      equals(points[start + 1], points[endPointIndex + 1]));\n\n  if (!isClosedEx) {\n    visitor(\n      points[endPointIndex],\n      points[endPointIndex + 1],\n      points[start],\n      points[start + 1],\n      numPoints - 1,\n      0\n    );\n  }\n}\n\nfunction reversePolygon(\n  points: NumericArray,\n  options: {start?: number; end?: number; size?: number}\n): void {\n  const {start = 0, end = points.length, size = 2} = options;\n\n  const numPoints = (end - start) / size;\n  const numSwaps = Math.floor(numPoints / 2);\n  for (let i = 0; i < numSwaps; ++i) {\n    const b1 = start + i * size;\n    const b2 = start + (numPoints - 1 - i) * size;\n    for (let j = 0; j < size; ++j) {\n      const tmp = points[b1 + j];\n      points[b1 + j] = points[b2 + j];\n      points[b2 + j] = tmp;\n    }\n  }\n}\n\n/**\n * Checks winding direction of the polygon and reverses the polygon in case of opposite winding direction.\n * Note: points are modified in-place.\n * @param points Array of points that represent the polygon.\n * @param direction Requested winding direction. 1 is for clockwise, -1 for counterclockwise winding direction.\n * @param options Parameters of the polygon.\n * @return Returns true if the winding direction was changed.\n */\nexport function modifyPolygonWindingDirectionPoints(\n  points: PointsArray,\n  direction: number,\n  options: PolygonParams = {}\n): boolean {\n  const currentDirection = getPolygonWindingDirectionPoints(points, options);\n  if (currentDirection !== direction) {\n    points.reverse();\n    return true;\n  }\n  return false;\n}\n\n/**\n * Returns winding direction of the polygon.\n * @param points Array of points that represent the polygon.\n * @param options Parameters of the polygon.\n * @returns Winding direction of the polygon.\n */\nexport function getPolygonWindingDirectionPoints(\n  points: PointsArray,\n  options: PolygonParams = {}\n): number {\n  return Math.sign(getPolygonSignedAreaPoints(points, options));\n}\n\n/**\n * Returns signed area of the polygon.\n * @param points Array of points that represent the polygon.\n * @param options Parameters of the polygon.\n * @returns Signed area of the polygon.\n */\nexport function getPolygonSignedAreaPoints(\n  points: PointsArray,\n  options: PolygonParams = {}\n): number {\n  // https://en.wikipedia.org/wiki/Shoelace_formula\n  const {start = 0, end = points.length} = options;\n  let area = 0;\n  for (let i = start, j = end - 1; i < end; ++i) {\n    area += (points[i][0] - points[j][0]) * (points[i][1] + points[j][1]);\n    j = i;\n  }\n  return area / 2;\n}\n\n/**\n * Calls visitor callback for each segment in the polygon.\n * @param points Array of points that represent the polygon.\n * @param visitor A callback to call for each segment.\n * @param options Parameters of the polygon.\n */\nexport function forEachSegmentInPolygonPoints(\n  points: PointsArray,\n  visitor: SegmentVisitorPoints,\n  options: PolygonParams = {}\n): void {\n  const {start = 0, end = points.length, isClosed} = options;\n  for (let i = start; i < end - 1; ++i) {\n    visitor(points[i], points[i + 1], i, i + 1);\n  }\n\n  const isClosedEx = isClosed || equals(points[end - 1], points[0]);\n  if (!isClosedEx) {\n    visitor(points[end - 1], points[0], end - 1, 0);\n  }\n}\n"],"file":"polygon-utils.js"}

package/dist/es5/polygon.js

@@ -11,6 +11,8 @@ var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/cl
 
 var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
 
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
 var _core = require("@math.gl/core");
 
 var _polygonUtils = require("./polygon-utils");
@@ -19,6 +21,9 @@ var Polygon = function () {
   function Polygon(points) {
     var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
     (0, _classCallCheck2.default)(this, Polygon);
+    (0, _defineProperty2.default)(this, "points", void 0);
+    (0, _defineProperty2.default)(this, "isFlatArray", void 0);
+    (0, _defineProperty2.default)(this, "options", void 0);
     this.points = points;
     this.isFlatArray = !(0, _core.isArray)(points[0]);
     this.options = {

package/dist/es5/polygon.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/polygon.js"],"names":["Polygon","points","options","isFlatArray","start","end","length","size","isClosed","Object","freeze","Math","abs","getSignedArea","sign","visitor","x1","y1","x2","y2","i1","i2","direction"],"mappings":";;;;;;;;;;;;;AAGA;;AAEA;;IASqBA,O;AACnB,mBAAYC,MAAZ,EAAkC;AAAA,QAAdC,OAAc,uEAAJ,EAAI;AAAA;AAChC,SAAKD,MAAL,GAAcA,MAAd;AACA,SAAKE,WAAL,GAAmB,CAAC,mBAAQF,MAAM,CAAC,CAAD,CAAd,CAApB;AAEA,SAAKC,OAAL,GAAe;AACbE,MAAAA,KAAK,EAAEF,OAAO,CAACE,KAAR,IAAiB,CADX;AAEbC,MAAAA,GAAG,EAAEH,OAAO,CAACG,GAAR,IAAeJ,MAAM,CAACK,MAFd;AAGbC,MAAAA,IAAI,EAAEL,OAAO,CAACK,IAAR,IAAgB,CAHT;AAIbC,MAAAA,QAAQ,EAAEN,OAAO,CAACM;AAJL,KAAf;AAOAC,IAAAA,MAAM,CAACC,MAAP,CAAc,IAAd;AACD;;;;WAED,yBAAgB;AACd,UAAI,KAAKP,WAAT,EAAsB,OAAO,wCAAqB,KAAKF,MAA1B,EAAkC,KAAKC,OAAvC,CAAP;AAEtB,aAAO,8CAA2B,KAAKD,MAAhC,EAAwC,KAAKC,OAA7C,CAAP;AACD;;;WAED,mBAAU;AACR,aAAOS,IAAI,CAACC,GAAL,CAAS,KAAKC,aAAL,EAAT,CAAP;AACD;;;WAED,+BAAsB;AACpB,aAAOF,IAAI,CAACG,IAAL,CAAU,KAAKD,aAAL,EAAV,CAAP;AACD;;;WAED,wBAAeE,OAAf,EAAwB;AACtB,UAAI,KAAKZ,WAAT,EAAsB;AACpB,mDACE,KAAKF,MADP,EAGE,UAACe,EAAD,EAAKC,EAAL,EAASC,EAAT,EAAaC,EAAb,EAAiBC,EAAjB,EAAqBC,EAArB,EAA4B;AAE1BN,UAAAA,OAAO,CAAC,CAACC,EAAD,EAAKC,EAAL,CAAD,EAAW,CAACC,EAAD,EAAKC,EAAL,CAAX,EAAqBC,EAArB,EAAyBC,EAAzB,CAAP;AACD,SANH,EAOE,KAAKnB,OAPP;AASD,OAVD,MAUO;AACL,yDAA8B,KAAKD,MAAnC,EAA2Cc,OAA3C,EAAoD,KAAKb,OAAzD;AACD;AACF;;;WAED,gCAAuBoB,SAAvB,EAAkC;AAChC,UAAI,KAAKnB,WAAT,EAAsB;AACpB,eAAO,iDAA8B,KAAKF,MAAnC,EAA2CqB,SAA3C,EAAsD,KAAKpB,OAA3D,CAAP;AACD;;AACD,aAAO,uDAAoC,KAAKD,MAAzC,EAAiDqB,SAAjD,EAA4D,KAAKpB,OAAjE,CAAP;AACD","sourcesContent":["/* eslint-disable no-undef */\n/* eslint-disable no-console */\n\nimport {isArray} from '@math.gl/core';\n\nimport {\n  getPolygonSignedArea,\n  forEachSegmentInPolygon,\n  modifyPolygonWindingDirection,\n  getPolygonSignedAreaPoints,\n  forEachSegmentInPolygonPoints,\n  modifyPolygonWindingDirectionPoints\n} from './polygon-utils';\n\nexport default class Polygon {\n  constructor(points, options = {}) {\n    this.points = points;\n    this.isFlatArray = !isArray(points[0]);\n\n    this.options = {\n      start: options.start || 0,\n      end: options.end || points.length,\n      size: options.size || 2,\n      isClosed: options.isClosed\n    };\n\n    Object.freeze(this);\n  }\n\n  getSignedArea() {\n    if (this.isFlatArray) return getPolygonSignedArea(this.points, this.options);\n\n    return getPolygonSignedAreaPoints(this.points, this.options);\n  }\n\n  getArea() {\n    return Math.abs(this.getSignedArea());\n  }\n\n  getWindingDirection() {\n    return Math.sign(this.getSignedArea());\n  }\n\n  forEachSegment(visitor) {\n    if (this.isFlatArray) {\n      forEachSegmentInPolygon(\n        this.points,\n        // eslint-disable-next-line max-params\n        (x1, y1, x2, y2, i1, i2) => {\n          // TODO @igorDykhta original visitor uses arrays for each point, but with flat arrays performance degrades if we allocate points for each segment\n          visitor([x1, y1], [x2, y2], i1, i2);\n        },\n        this.options\n      );\n    } else {\n      forEachSegmentInPolygonPoints(this.points, visitor, this.options);\n    }\n  }\n\n  modifyWindingDirection(direction) {\n    if (this.isFlatArray) {\n      return modifyPolygonWindingDirection(this.points, direction, this.options);\n    }\n    return modifyPolygonWindingDirectionPoints(this.points, direction, this.options);\n  }\n}\n"],"file":"polygon.js"}
+{"version":3,"sources":["../../src/polygon.ts"],"names":["Polygon","points","options","isFlatArray","start","end","length","size","isClosed","Object","freeze","Math","abs","getSignedArea","sign","visitor","x1","y1","x2","y2","i1","i2","direction"],"mappings":";;;;;;;;;;;;;;;AACA;;AAIA;;IAgBqBA,O;AAKnB,mBAAYC,MAAZ,EAA6E;AAAA,QAA9BC,OAA8B,uEAAJ,EAAI;AAAA;AAAA;AAAA;AAAA;AAC3E,SAAKD,MAAL,GAAcA,MAAd;AACA,SAAKE,WAAL,GAAmB,CAAC,mBAAQF,MAAM,CAAC,CAAD,CAAd,CAApB;AAEA,SAAKC,OAAL,GAAe;AACbE,MAAAA,KAAK,EAAEF,OAAO,CAACE,KAAR,IAAiB,CADX;AAEbC,MAAAA,GAAG,EAAEH,OAAO,CAACG,GAAR,IAAeJ,MAAM,CAACK,MAFd;AAGbC,MAAAA,IAAI,EAAEL,OAAO,CAACK,IAAR,IAAgB,CAHT;AAIbC,MAAAA,QAAQ,EAAEN,OAAO,CAACM;AAJL,KAAf;AAOAC,IAAAA,MAAM,CAACC,MAAP,CAAc,IAAd;AACD;;;;WAMD,yBAAwB;AACtB,UAAI,KAAKP,WAAT,EAAsB,OAAO,wCAAqB,KAAKF,MAA1B,EAAkD,KAAKC,OAAvD,CAAP;AAEtB,aAAO,8CAA2B,KAAKD,MAAhC,EAAsD,KAAKC,OAA3D,CAAP;AACD;;;WAMD,mBAAkB;AAChB,aAAOS,IAAI,CAACC,GAAL,CAAS,KAAKC,aAAL,EAAT,CAAP;AACD;;;WAMD,+BAA8B;AAC5B,aAAOF,IAAI,CAACG,IAAL,CAAU,KAAKD,aAAL,EAAV,CAAP;AACD;;;WAMD,wBAAeE,OAAf,EAAoD;AAClD,UAAI,KAAKZ,WAAT,EAAsB;AACpB,mDACE,KAAKF,MADP,EAGE,UAACe,EAAD,EAAKC,EAAL,EAASC,EAAT,EAAaC,EAAb,EAAiBC,EAAjB,EAAqBC,EAArB,EAA4B;AAE1BN,UAAAA,OAAO,CAAC,CAACC,EAAD,EAAKC,EAAL,CAAD,EAAW,CAACC,EAAD,EAAKC,EAAL,CAAX,EAAqBC,EAArB,EAAyBC,EAAzB,CAAP;AACD,SANH,EAOE,KAAKnB,OAPP;AASD,OAVD,MAUO;AACL,yDAA8B,KAAKD,MAAnC,EAAyDc,OAAzD,EAAkE,KAAKb,OAAvE;AACD;AACF;;;WAOD,gCAAuBoB,SAAvB,EAAmD;AACjD,UAAI,KAAKnB,WAAT,EAAsB;AACpB,eAAO,iDAA8B,KAAKF,MAAnC,EAA2DqB,SAA3D,EAAsE,KAAKpB,OAA3E,CAAP;AACD;;AACD,aAAO,uDAAoC,KAAKD,MAAzC,EAA+DqB,SAA/D,EAA0E,KAAKpB,OAA/E,CAAP;AACD","sourcesContent":["/* eslint-disable no-undef, no-console */\nimport {isArray} from '@math.gl/core';\nimport type {SegmentVisitorPoints} from './polygon-utils';\nimport type {NumericArray} from '@math.gl/core';\n\nimport {\n  getPolygonSignedArea,\n  forEachSegmentInPolygon,\n  modifyPolygonWindingDirection,\n  getPolygonSignedAreaPoints,\n  forEachSegmentInPolygonPoints,\n  modifyPolygonWindingDirectionPoints\n} from './polygon-utils';\n\nexport type PolygonOptions = {\n  start?: number;\n  end?: number;\n  size?: number;\n  isClosed?: boolean;\n};\n\nexport default class Polygon {\n  points: NumericArray | number[][];\n  isFlatArray: boolean;\n  options: PolygonOptions;\n\n  constructor(points: NumericArray | number[][], options: PolygonOptions = {}) {\n    this.points = points;\n    this.isFlatArray = !isArray(points[0]);\n\n    this.options = {\n      start: options.start || 0,\n      end: options.end || points.length,\n      size: options.size || 2,\n      isClosed: options.isClosed\n    };\n\n    Object.freeze(this);\n  }\n\n  /**\n   * Returns signed area of the polygon.\n   * @returns Signed area of the polygon.\n   */\n  getSignedArea(): number {\n    if (this.isFlatArray) return getPolygonSignedArea(this.points as NumericArray, this.options);\n\n    return getPolygonSignedAreaPoints(this.points as number[][], this.options);\n  }\n\n  /**\n   * Returns absolute area of the polygon.\n   * @returns Absolute area of the polygon.\n   */\n  getArea(): number {\n    return Math.abs(this.getSignedArea());\n  }\n\n  /**\n   * Returns winding direction of the polygon.\n   * @returns Winding direction of the polygon. 1 is for clockwise, -1 for counterclockwise winding direction.\n   */\n  getWindingDirection(): number {\n    return Math.sign(this.getSignedArea());\n  }\n\n  /**\n   * Calls the visitor callback for each segment in the polygon.\n   * @param visitor A callback to call for each segment.\n   */\n  forEachSegment(visitor: SegmentVisitorPoints): void {\n    if (this.isFlatArray) {\n      forEachSegmentInPolygon(\n        this.points as NumericArray,\n        // eslint-disable-next-line max-params\n        (x1, y1, x2, y2, i1, i2) => {\n          // TODO @igorDykhta original visitor uses arrays for each point, but with flat arrays performance degrades if we allocate points for each segment\n          visitor([x1, y1], [x2, y2], i1, i2);\n        },\n        this.options\n      );\n    } else {\n      forEachSegmentInPolygonPoints(this.points as number[][], visitor, this.options);\n    }\n  }\n\n  /**\n   * Checks winding direction of the polygon and reverses the polygon in case of opposite winding direction.\n   * @param direction Requested winding direction. 1 is for clockwise, -1 for counterclockwise winding direction.\n   * @return Returns true if the winding direction was changed.\n   */\n  modifyWindingDirection(direction: number): boolean {\n    if (this.isFlatArray) {\n      return modifyPolygonWindingDirection(this.points as NumericArray, direction, this.options);\n    }\n    return modifyPolygonWindingDirectionPoints(this.points as number[][], direction, this.options);\n  }\n}\n"],"file":"polygon.js"}

package/dist/es5/utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/utils.js"],"names":["push","target","source","size","length","startIndex","isDuplicate","i","copy","getPointAtIndex","positions","index","offset","out","startI"],"mappings":";;;;;;;;;AAAO,SAASA,IAAT,CAAcC,MAAd,EAAsBC,MAAtB,EAA8B;AACnC,MAAMC,IAAI,GAAGD,MAAM,CAACE,MAApB;AACA,MAAMC,UAAU,GAAGJ,MAAM,CAACG,MAA1B;;AAGA,MAAIC,UAAU,GAAG,CAAjB,EAAoB;AAClB,QAAIC,WAAW,GAAG,IAAlB;;AACA,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7B,UAAIN,MAAM,CAACI,UAAU,GAAGF,IAAb,GAAoBI,CAArB,CAAN,KAAkCL,MAAM,CAACK,CAAD,CAA5C,EAAiD;AAC/CD,QAAAA,WAAW,GAAG,KAAd;AACA;AACD;AACF;;AACD,QAAIA,WAAJ,EAAiB;AACf,aAAO,KAAP;AACD;AACF;;AAED,OAAK,IAAIC,EAAC,GAAG,CAAb,EAAgBA,EAAC,GAAGJ,IAApB,EAA0BI,EAAC,EAA3B,EAA+B;AAC7BN,IAAAA,MAAM,CAACI,UAAU,GAAGE,EAAd,CAAN,GAAyBL,MAAM,CAACK,EAAD,CAA/B;AACD;;AACD,SAAO,IAAP;AACD;;AAEM,SAASC,IAAT,CAAcP,MAAd,EAAsBC,MAAtB,EAA8B;AACnC,MAAMC,IAAI,GAAGD,MAAM,CAACE,MAApB;;AACA,OAAK,IAAIG,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7BN,IAAAA,MAAM,CAACM,CAAD,CAAN,GAAYL,MAAM,CAACK,CAAD,CAAlB;AACD;AACF;;AAEM,SAASE,eAAT,CAAyBC,SAAzB,EAAoCC,KAApC,EAA2CR,IAA3C,EAAiDS,MAAjD,EAAmE;AAAA,MAAVC,GAAU,uEAAJ,EAAI;AACxE,MAAMC,MAAM,GAAGF,MAAM,GAAGD,KAAK,GAAGR,IAAhC;;AACA,OAAK,IAAII,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7BM,IAAAA,GAAG,CAACN,CAAD,CAAH,GAASG,SAAS,CAACI,MAAM,GAAGP,CAAV,CAAlB;AACD;;AACD,SAAOM,GAAP;AACD","sourcesContent":["export function push(target, source) {\n  const size = source.length;\n  const startIndex = target.length;\n\n  // dedupe, if source is the same point as the last vertex\n  if (startIndex > 0) {\n    let isDuplicate = true;\n    for (let i = 0; i < size; i++) {\n      if (target[startIndex - size + i] !== source[i]) {\n        isDuplicate = false;\n        break;\n      }\n    }\n    if (isDuplicate) {\n      return false;\n    }\n  }\n\n  for (let i = 0; i < size; i++) {\n    target[startIndex + i] = source[i];\n  }\n  return true;\n}\n\nexport function copy(target, source) {\n  const size = source.length;\n  for (let i = 0; i < size; i++) {\n    target[i] = source[i];\n  }\n}\n\nexport function getPointAtIndex(positions, index, size, offset, out = []) {\n  const startI = offset + index * size;\n  for (let i = 0; i < size; i++) {\n    out[i] = positions[startI + i];\n  }\n  return out;\n}\n"],"file":"utils.js"}
+{"version":3,"sources":["../../src/utils.ts"],"names":["push","target","source","size","length","startIndex","isDuplicate","i","copy","getPointAtIndex","positions","index","offset","out","startI"],"mappings":";;;;;;;;;AAEO,SAASA,IAAT,CAAcC,MAAd,EAAgCC,MAAhC,EAA2D;AAChE,MAAMC,IAAI,GAAGD,MAAM,CAACE,MAApB;AACA,MAAMC,UAAU,GAAGJ,MAAM,CAACG,MAA1B;;AAGA,MAAIC,UAAU,GAAG,CAAjB,EAAoB;AAClB,QAAIC,WAAW,GAAG,IAAlB;;AACA,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7B,UAAIN,MAAM,CAACI,UAAU,GAAGF,IAAb,GAAoBI,CAArB,CAAN,KAAkCL,MAAM,CAACK,CAAD,CAA5C,EAAiD;AAC/CD,QAAAA,WAAW,GAAG,KAAd;AACA;AACD;AACF;;AACD,QAAIA,WAAJ,EAAiB;AACf,aAAO,KAAP;AACD;AACF;;AAED,OAAK,IAAIC,EAAC,GAAG,CAAb,EAAgBA,EAAC,GAAGJ,IAApB,EAA0BI,EAAC,EAA3B,EAA+B;AAC7BN,IAAAA,MAAM,CAACI,UAAU,GAAGE,EAAd,CAAN,GAAyBL,MAAM,CAACK,EAAD,CAA/B;AACD;;AACD,SAAO,IAAP;AACD;;AAEM,SAASC,IAAT,CAAcP,MAAd,EAAgCC,MAAhC,EAAsE;AAC3E,MAAMC,IAAI,GAAGD,MAAM,CAACE,MAApB;;AACA,OAAK,IAAIG,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7BN,IAAAA,MAAM,CAACM,CAAD,CAAN,GAAYL,MAAM,CAACK,CAAD,CAAlB;AACD;AACF;;AAEM,SAASE,eAAT,CACLC,SADK,EAELC,KAFK,EAGLR,IAHK,EAILS,MAJK,EAMK;AAAA,MADVC,GACU,uEADM,EACN;AACV,MAAMC,MAAM,GAAGF,MAAM,GAAGD,KAAK,GAAGR,IAAhC;;AACA,OAAK,IAAII,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7BM,IAAAA,GAAG,CAACN,CAAD,CAAH,GAASG,SAAS,CAACI,MAAM,GAAGP,CAAV,CAAlB;AACD;;AACD,SAAOM,GAAP;AACD","sourcesContent":["import type {NumericArray} from '@math.gl/core';\n\nexport function push(target: number[], source: number[]): boolean {\n  const size = source.length;\n  const startIndex = target.length;\n\n  // dedupe, if source is the same point as the last vertex\n  if (startIndex > 0) {\n    let isDuplicate = true;\n    for (let i = 0; i < size; i++) {\n      if (target[startIndex - size + i] !== source[i]) {\n        isDuplicate = false;\n        break;\n      }\n    }\n    if (isDuplicate) {\n      return false;\n    }\n  }\n\n  for (let i = 0; i < size; i++) {\n    target[startIndex + i] = source[i];\n  }\n  return true;\n}\n\nexport function copy(target: number[], source: Readonly<NumericArray>): void {\n  const size = source.length;\n  for (let i = 0; i < size; i++) {\n    target[i] = source[i];\n  }\n}\n\nexport function getPointAtIndex(\n  positions: NumericArray,\n  index: number,\n  size: number,\n  offset: number,\n  out: number[] = []\n): number[] {\n  const startI = offset + index * size;\n  for (let i = 0; i < size; i++) {\n    out[i] = positions[startI + i];\n  }\n  return out;\n}\n"],"file":"utils.js"}

package/dist/esm/cut-by-grid.js

@@ -1,6 +1,6 @@
 import { bitCode, intersect } from './lineclip';
 import { getPointAtIndex, copy, push } from './utils';
-export function cutPolylineByGrid(positions, options = {}) {
+export function cutPolylineByGrid(positions, options) {
   const {
     size = 2,
     broken = false,
@@ -8,7 +8,7 @@ export function cutPolylineByGrid(positions, options = {}) {
     gridOffset = [0, 0],
     startIndex = 0,
     endIndex = positions.length
-  } = options;
+  } = options || {};
   const numPoints = (endIndex - startIndex) / size;
   let part = [];
   const result = [part];
@@ -62,7 +62,7 @@ function concatInPlace(arr1, arr2) {
   return arr1;
 }
 
-export function cutPolygonByGrid(positions, holeIndices, options = {}) {
+export function cutPolygonByGrid(positions, holeIndices = null, options) {
   if (!positions.length) {
     return [];
   }
@@ -72,11 +72,11 @@ export function cutPolygonByGrid(positions, holeIndices, options = {}) {
     gridResolution = 10,
     gridOffset = [0, 0],
     edgeTypes = false
-  } = options;
+  } = options || {};
   const result = [];
   const queue = [{
     pos: positions,
-    types: edgeTypes && new Array(positions.length / size).fill(TYPE_BORDER),
+    types: edgeTypes ? new Array(positions.length / size).fill(TYPE_BORDER) : null,
     holes: holeIndices || []
   }];
   const bbox = [[], []];

package/dist/esm/cut-by-grid.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/cut-by-grid.js"],"names":["bitCode","intersect","getPointAtIndex","copy","push","cutPolylineByGrid","positions","options","size","broken","gridResolution","gridOffset","startIndex","endIndex","length","numPoints","part","result","a","b","codeB","cell","getGridCell","scratchPoint","i","codeAlt","moveToNeighborCell","TYPE_INSIDE","TYPE_BORDER","concatInPlace","arr1","arr2","cutPolygonByGrid","holeIndices","edgeTypes","queue","pos","types","Array","fill","holes","bbox","shift","getBoundingBox","code","parts","bisectPolygon","polygonLow","polygonHigh","polygon","edge","resultLow","resultHigh","typesLow","typesHigh","p","side","type","prev","prevSide","Math","sign","prevType","lowPointCount","highPointCount","out","left","floor","bottom","minX","Infinity","maxX","minY","maxY","x","y"],"mappings":"AACA,SAAQA,OAAR,EAAiBC,SAAjB,QAAiC,YAAjC;AACA,SAAQC,eAAR,EAAyBC,IAAzB,EAA+BC,IAA/B,QAA0C,SAA1C;AAEA,OAAO,SAASC,iBAAT,CAA2BC,SAA3B,EAAsCC,OAAO,GAAG,EAAhD,EAAoD;AACzD,QAAM;AACJC,IAAAA,IAAI,GAAG,CADH;AAEJC,IAAAA,MAAM,GAAG,KAFL;AAGJC,IAAAA,cAAc,GAAG,EAHb;AAIJC,IAAAA,UAAU,GAAG,CAAC,CAAD,EAAI,CAAJ,CAJT;AAKJC,IAAAA,UAAU,GAAG,CALT;AAMJC,IAAAA,QAAQ,GAAGP,SAAS,CAACQ;AANjB,MAOFP,OAPJ;AAQA,QAAMQ,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,MAAIQ,IAAI,GAAG,EAAX;AACA,QAAMC,MAAM,GAAG,CAACD,IAAD,CAAf;AACA,QAAME,CAAC,GAAGhB,eAAe,CAACI,SAAD,EAAY,CAAZ,EAAeE,IAAf,EAAqBI,UAArB,CAAzB;AACA,MAAIO,CAAJ;AACA,MAAIC,KAAJ;AACA,QAAMC,IAAI,GAAGC,WAAW,CAACJ,CAAD,EAAIR,cAAJ,EAAoBC,UAApB,EAAgC,EAAhC,CAAxB;AACA,QAAMY,YAAY,GAAG,EAArB;AACAnB,EAAAA,IAAI,CAACY,IAAD,EAAOE,CAAP,CAAJ;;AAEA,OAAK,IAAIM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClCL,IAAAA,CAAC,GAAGjB,eAAe,CAACI,SAAD,EAAYkB,CAAZ,EAAehB,IAAf,EAAqBI,UAArB,EAAiCO,CAAjC,CAAnB;AACAC,IAAAA,KAAK,GAAGpB,OAAO,CAACmB,CAAD,EAAIE,IAAJ,CAAf;;AAEA,WAAOD,KAAP,EAAc;AAEZnB,MAAAA,SAAS,CAACiB,CAAD,EAAIC,CAAJ,EAAOC,KAAP,EAAcC,IAAd,EAAoBE,YAApB,CAAT;AACA,YAAME,OAAO,GAAGzB,OAAO,CAACuB,YAAD,EAAeF,IAAf,CAAvB;;AACA,UAAII,OAAJ,EAAa;AACXxB,QAAAA,SAAS,CAACiB,CAAD,EAAIK,YAAJ,EAAkBE,OAAlB,EAA2BJ,IAA3B,EAAiCE,YAAjC,CAAT;AACAH,QAAAA,KAAK,GAAGK,OAAR;AACD;;AACDrB,MAAAA,IAAI,CAACY,IAAD,EAAOO,YAAP,CAAJ;AAEApB,MAAAA,IAAI,CAACe,CAAD,EAAIK,YAAJ,CAAJ;AAEAG,MAAAA,kBAAkB,CAACL,IAAD,EAAOX,cAAP,EAAuBU,KAAvB,CAAlB;;AACA,UAAIX,MAAM,IAAIO,IAAI,CAACF,MAAL,GAAcN,IAA5B,EAAkC;AAChCQ,QAAAA,IAAI,GAAG,EAAP;AACAC,QAAAA,MAAM,CAACb,IAAP,CAAYY,IAAZ;AACAZ,QAAAA,IAAI,CAACY,IAAD,EAAOE,CAAP,CAAJ;AACD;;AAEDE,MAAAA,KAAK,GAAGpB,OAAO,CAACmB,CAAD,EAAIE,IAAJ,CAAf;AACD;;AAEDjB,IAAAA,IAAI,CAACY,IAAD,EAAOG,CAAP,CAAJ;AACAhB,IAAAA,IAAI,CAACe,CAAD,EAAIC,CAAJ,CAAJ;AACD;;AAED,SAAOV,MAAM,GAAGQ,MAAH,GAAYA,MAAM,CAAC,CAAD,CAA/B;AACD;AAED,MAAMU,WAAW,GAAG,CAApB;AACA,MAAMC,WAAW,GAAG,CAApB;;AAEA,SAASC,aAAT,CAAuBC,IAAvB,EAA6BC,IAA7B,EAAmC;AACjC,OAAK,IAAIP,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGO,IAAI,CAACjB,MAAzB,EAAiCU,CAAC,EAAlC,EAAsC;AACpCM,IAAAA,IAAI,CAAC1B,IAAL,CAAU2B,IAAI,CAACP,CAAD,CAAd;AACD;;AACD,SAAOM,IAAP;AACD;;AAED,OAAO,SAASE,gBAAT,CAA0B1B,SAA1B,EAAqC2B,WAArC,EAAkD1B,OAAO,GAAG,EAA5D,EAAgE;AACrE,MAAI,CAACD,SAAS,CAACQ,MAAf,EAAuB;AAErB,WAAO,EAAP;AACD;;AACD,QAAM;AAACN,IAAAA,IAAI,GAAG,CAAR;AAAWE,IAAAA,cAAc,GAAG,EAA5B;AAAgCC,IAAAA,UAAU,GAAG,CAAC,CAAD,EAAI,CAAJ,CAA7C;AAAqDuB,IAAAA,SAAS,GAAG;AAAjE,MAA0E3B,OAAhF;AACA,QAAMU,MAAM,GAAG,EAAf;AACA,QAAMkB,KAAK,GAAG,CACZ;AACEC,IAAAA,GAAG,EAAE9B,SADP;AAEE+B,IAAAA,KAAK,EAAEH,SAAS,IAAI,IAAII,KAAJ,CAAUhC,SAAS,CAACQ,MAAV,GAAmBN,IAA7B,EAAmC+B,IAAnC,CAAwCX,WAAxC,CAFtB;AAGEY,IAAAA,KAAK,EAAEP,WAAW,IAAI;AAHxB,GADY,CAAd;AAOA,QAAMQ,IAAI,GAAG,CAAC,EAAD,EAAK,EAAL,CAAb;AACA,MAAIpB,IAAI,GAAG,EAAX;;AAGA,SAAOc,KAAK,CAACrB,MAAb,EAAqB;AACnB,UAAM;AAACsB,MAAAA,GAAD;AAAMC,MAAAA,KAAN;AAAaG,MAAAA;AAAb,QAAsBL,KAAK,CAACO,KAAN,EAA5B;AAGAC,IAAAA,cAAc,CAACP,GAAD,EAAM5B,IAAN,EAAYgC,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACtB,MAA5B,EAAoC2B,IAApC,CAAd;AACApB,IAAAA,IAAI,GAAGC,WAAW,CAACmB,IAAI,CAAC,CAAD,CAAL,EAAU/B,cAAV,EAA0BC,UAA1B,EAAsCU,IAAtC,CAAlB;AACA,UAAMuB,IAAI,GAAG5C,OAAO,CAACyC,IAAI,CAAC,CAAD,CAAL,EAAUpB,IAAV,CAApB;;AAEA,QAAIuB,IAAJ,EAAU;AAER,UAAIC,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa7B,IAAb,EAAmB,CAAnB,EAAsBgC,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACtB,MAAtC,EAA8CO,IAA9C,EAAoDuB,IAApD,CAAzB;AACA,YAAMG,UAAU,GAAG;AAACX,QAAAA,GAAG,EAAES,KAAK,CAAC,CAAD,CAAL,CAAST,GAAf;AAAoBC,QAAAA,KAAK,EAAEQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAApC;AAA2CG,QAAAA,KAAK,EAAE;AAAlD,OAAnB;AACA,YAAMQ,WAAW,GAAG;AAACZ,QAAAA,GAAG,EAAES,KAAK,CAAC,CAAD,CAAL,CAAST,GAAf;AAAoBC,QAAAA,KAAK,EAAEQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAApC;AAA2CG,QAAAA,KAAK,EAAE;AAAlD,OAApB;AACAL,MAAAA,KAAK,CAAC/B,IAAN,CAAW2C,UAAX,EAAuBC,WAAvB;;AAGA,WAAK,IAAIxB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGgB,KAAK,CAAC1B,MAA1B,EAAkCU,CAAC,EAAnC,EAAuC;AACrCqB,QAAAA,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa7B,IAAb,EAAmBgC,KAAK,CAAChB,CAAD,CAAxB,EAA6BgB,KAAK,CAAChB,CAAC,GAAG,CAAL,CAAL,IAAgBY,GAAG,CAACtB,MAAjD,EAAyDO,IAAzD,EAA+DuB,IAA/D,CAArB;;AAEA,YAAIC,KAAK,CAAC,CAAD,CAAT,EAAc;AACZE,UAAAA,UAAU,CAACP,KAAX,CAAiBpC,IAAjB,CAAsB2C,UAAU,CAACX,GAAX,CAAetB,MAArC;AACAiC,UAAAA,UAAU,CAACX,GAAX,GAAiBP,aAAa,CAACkB,UAAU,CAACX,GAAZ,EAAiBS,KAAK,CAAC,CAAD,CAAL,CAAST,GAA1B,CAA9B;;AACA,cAAIF,SAAJ,EAAe;AACba,YAAAA,UAAU,CAACV,KAAX,GAAmBR,aAAa,CAACkB,UAAU,CAACV,KAAZ,EAAmBQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAA5B,CAAhC;AACD;AACF;;AACD,YAAIQ,KAAK,CAAC,CAAD,CAAT,EAAc;AACZG,UAAAA,WAAW,CAACR,KAAZ,CAAkBpC,IAAlB,CAAuB4C,WAAW,CAACZ,GAAZ,CAAgBtB,MAAvC;AACAkC,UAAAA,WAAW,CAACZ,GAAZ,GAAkBP,aAAa,CAACmB,WAAW,CAACZ,GAAb,EAAkBS,KAAK,CAAC,CAAD,CAAL,CAAST,GAA3B,CAA/B;;AACA,cAAIF,SAAJ,EAAe;AACbc,YAAAA,WAAW,CAACX,KAAZ,GAAoBR,aAAa,CAACmB,WAAW,CAACX,KAAb,EAAoBQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAA7B,CAAjC;AACD;AACF;AACF;AACF,KA1BD,MA0BO;AAEL,YAAMY,OAAO,GAAG;AAAC3C,QAAAA,SAAS,EAAE8B;AAAZ,OAAhB;;AACA,UAAIF,SAAJ,EAAe;AACbe,QAAAA,OAAO,CAACf,SAAR,GAAoBG,KAApB;AACD;;AACD,UAAIG,KAAK,CAAC1B,MAAV,EAAkB;AAChBmC,QAAAA,OAAO,CAAChB,WAAR,GAAsBO,KAAtB;AACD;;AAEDvB,MAAAA,MAAM,CAACb,IAAP,CAAY6C,OAAZ;AACD;AACF;;AACD,SAAOhC,MAAP;AACD;;AAMD,SAAS6B,aAAT,CAAuBxC,SAAvB,EAAkC4B,SAAlC,EAA6C1B,IAA7C,EAAmDI,UAAnD,EAA+DC,QAA/D,EAAyE4B,IAAzE,EAA+ES,IAA/E,EAAqF;AACnF,QAAMnC,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,QAAM2C,SAAS,GAAG,EAAlB;AACA,QAAMC,UAAU,GAAG,EAAnB;AACA,QAAMC,QAAQ,GAAG,EAAjB;AACA,QAAMC,SAAS,GAAG,EAAlB;AACA,QAAM/B,YAAY,GAAG,EAArB;AAEA,MAAIgC,CAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,QAAMC,IAAI,GAAGxD,eAAe,CAACI,SAAD,EAAYS,SAAS,GAAG,CAAxB,EAA2BP,IAA3B,EAAiCI,UAAjC,CAA5B;AACA,MAAI+C,QAAQ,GAAGC,IAAI,CAACC,IAAL,CAAUX,IAAI,GAAG,CAAP,GAAWQ,IAAI,CAAC,CAAD,CAAJ,GAAUjB,IAAI,CAAC,CAAD,CAAzB,GAA+BiB,IAAI,CAAC,CAAD,CAAJ,GAAUjB,IAAI,CAAC,CAAD,CAAvD,CAAf;AACA,MAAIqB,QAAQ,GAAG5B,SAAS,IAAIA,SAAS,CAACnB,SAAS,GAAG,CAAb,CAArC;AACA,MAAIgD,aAAa,GAAG,CAApB;AACA,MAAIC,cAAc,GAAG,CAArB;;AAEA,OAAK,IAAIxC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClC+B,IAAAA,CAAC,GAAGrD,eAAe,CAACI,SAAD,EAAYkB,CAAZ,EAAehB,IAAf,EAAqBI,UAArB,EAAiC2C,CAAjC,CAAnB;AACAC,IAAAA,IAAI,GAAGI,IAAI,CAACC,IAAL,CAAUX,IAAI,GAAG,CAAP,GAAWK,CAAC,CAAC,CAAD,CAAD,GAAOd,IAAI,CAAC,CAAD,CAAtB,GAA4Bc,CAAC,CAAC,CAAD,CAAD,GAAOd,IAAI,CAAC,CAAD,CAAjD,CAAP;AACAgB,IAAAA,IAAI,GAAGvB,SAAS,IAAIA,SAAS,CAACtB,UAAU,GAAGJ,IAAb,GAAoBgB,CAArB,CAA7B;;AAGA,QAAIgC,IAAI,IAAIG,QAAR,IAAoBA,QAAQ,KAAKH,IAArC,EAA2C;AACzCvD,MAAAA,SAAS,CAACyD,IAAD,EAAOH,CAAP,EAAUL,IAAV,EAAgBT,IAAhB,EAAsBlB,YAAtB,CAAT;AACAnB,MAAAA,IAAI,CAAC+C,SAAD,EAAY5B,YAAZ,CAAJ,IAAiC8B,QAAQ,CAACjD,IAAT,CAAc0D,QAAd,CAAjC;AACA1D,MAAAA,IAAI,CAACgD,UAAD,EAAa7B,YAAb,CAAJ,IAAkC+B,SAAS,CAAClD,IAAV,CAAe0D,QAAf,CAAlC;AACD;;AAED,QAAIN,IAAI,IAAI,CAAZ,EAAe;AACbpD,MAAAA,IAAI,CAAC+C,SAAD,EAAYI,CAAZ,CAAJ,IAAsBF,QAAQ,CAACjD,IAAT,CAAcqD,IAAd,CAAtB;AACAM,MAAAA,aAAa,IAAIP,IAAjB;AACD,KAHD,MAGO,IAAIH,QAAQ,CAACvC,MAAb,EAAqB;AAC1BuC,MAAAA,QAAQ,CAACA,QAAQ,CAACvC,MAAT,GAAkB,CAAnB,CAAR,GAAgCa,WAAhC;AACD;;AACD,QAAI6B,IAAI,IAAI,CAAZ,EAAe;AACbpD,MAAAA,IAAI,CAACgD,UAAD,EAAaG,CAAb,CAAJ,IAAuBD,SAAS,CAAClD,IAAV,CAAeqD,IAAf,CAAvB;AACAO,MAAAA,cAAc,IAAIR,IAAlB;AACD,KAHD,MAGO,IAAIF,SAAS,CAACxC,MAAd,EAAsB;AAC3BwC,MAAAA,SAAS,CAACA,SAAS,CAACxC,MAAV,GAAmB,CAApB,CAAT,GAAkCa,WAAlC;AACD;;AAEDxB,IAAAA,IAAI,CAACuD,IAAD,EAAOH,CAAP,CAAJ;AACAI,IAAAA,QAAQ,GAAGH,IAAX;AACAM,IAAAA,QAAQ,GAAGL,IAAX;AACD;;AAED,SAAO,CACLM,aAAa,GAAG;AAAC3B,IAAAA,GAAG,EAAEe,SAAN;AAAiBd,IAAAA,KAAK,EAAEH,SAAS,IAAImB;AAArC,GAAH,GAAoD,IAD5D,EAELW,cAAc,GAAG;AAAC5B,IAAAA,GAAG,EAAEgB,UAAN;AAAkBf,IAAAA,KAAK,EAAEH,SAAS,IAAIoB;AAAtC,GAAH,GAAsD,IAF/D,CAAP;AAID;;AAED,SAAShC,WAAT,CAAqBiC,CAArB,EAAwB7C,cAAxB,EAAwCC,UAAxC,EAAoDsD,GAApD,EAAyD;AACvD,QAAMC,IAAI,GAAGN,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO5C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CAA9F;AACA,QAAMyD,MAAM,GACVR,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO5C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CADnF;AAEAsD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAT;AACAD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAT;AACAH,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAI,GAAGxD,cAAhB;AACAuD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAM,GAAG1D,cAAlB;AACA,SAAOuD,GAAP;AACD;;AAED,SAASvC,kBAAT,CAA4BL,IAA5B,EAAkCX,cAAlC,EAAkDwC,IAAlD,EAAwD;AACtD,MAAIA,IAAI,GAAG,CAAX,EAAc;AAEZ7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJD,MAIO,IAAIwC,IAAI,GAAG,CAAX,EAAc;AAEnB7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIwC,IAAI,GAAG,CAAX,EAAc;AAEnB7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIwC,IAAI,GAAG,CAAX,EAAc;AAEnB7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD;AACF;;AAED,SAASiC,cAAT,CAAwBrC,SAAxB,EAAmCE,IAAnC,EAAyCK,QAAzC,EAAmDoD,GAAnD,EAAwD;AACtD,MAAII,IAAI,GAAGC,QAAX;AACA,MAAIC,IAAI,GAAG,CAACD,QAAZ;AACA,MAAIE,IAAI,GAAGF,QAAX;AACA,MAAIG,IAAI,GAAG,CAACH,QAAZ;;AAEA,OAAK,IAAI9C,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGX,QAApB,EAA8BW,CAAC,IAAIhB,IAAnC,EAAyC;AACvC,UAAMkE,CAAC,GAAGpE,SAAS,CAACkB,CAAD,CAAnB;AACA,UAAMmD,CAAC,GAAGrE,SAAS,CAACkB,CAAC,GAAG,CAAL,CAAnB;AACA6C,IAAAA,IAAI,GAAGK,CAAC,GAAGL,IAAJ,GAAWK,CAAX,GAAeL,IAAtB;AACAE,IAAAA,IAAI,GAAGG,CAAC,GAAGH,IAAJ,GAAWG,CAAX,GAAeH,IAAtB;AACAC,IAAAA,IAAI,GAAGG,CAAC,GAAGH,IAAJ,GAAWG,CAAX,GAAeH,IAAtB;AACAC,IAAAA,IAAI,GAAGE,CAAC,GAAGF,IAAJ,GAAWE,CAAX,GAAeF,IAAtB;AACD;;AAEDR,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYI,IAAZ;AACAJ,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYO,IAAZ;AACAP,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYM,IAAZ;AACAN,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYQ,IAAZ;AACA,SAAOR,GAAP;AACD","sourcesContent":["/* eslint-disable max-statements, max-depth, complexity, no-unused-expressions */\nimport {bitCode, intersect} from './lineclip';\nimport {getPointAtIndex, copy, push} from './utils';\n\nexport function cutPolylineByGrid(positions, options = {}) {\n  const {\n    size = 2,\n    broken = false,\n    gridResolution = 10,\n    gridOffset = [0, 0],\n    startIndex = 0,\n    endIndex = positions.length\n  } = options;\n  const numPoints = (endIndex - startIndex) / size;\n  let part = [];\n  const result = [part];\n  const a = getPointAtIndex(positions, 0, size, startIndex);\n  let b;\n  let codeB;\n  const cell = getGridCell(a, gridResolution, gridOffset, []);\n  const scratchPoint = [];\n  push(part, a);\n\n  for (let i = 1; i < numPoints; i++) {\n    b = getPointAtIndex(positions, i, size, startIndex, b);\n    codeB = bitCode(b, cell);\n\n    while (codeB) {\n      // find the intersection with the current cell\n      intersect(a, b, codeB, cell, scratchPoint);\n      const codeAlt = bitCode(scratchPoint, cell);\n      if (codeAlt) {\n        intersect(a, scratchPoint, codeAlt, cell, scratchPoint);\n        codeB = codeAlt;\n      }\n      push(part, scratchPoint);\n      // move to the next cell\n      copy(a, scratchPoint);\n\n      moveToNeighborCell(cell, gridResolution, codeB);\n      if (broken && part.length > size) {\n        part = [];\n        result.push(part);\n        push(part, a);\n      }\n\n      codeB = bitCode(b, cell);\n    }\n\n    push(part, b);\n    copy(a, b);\n  }\n\n  return broken ? result : result[0];\n}\n\nconst TYPE_INSIDE = 0;\nconst TYPE_BORDER = 1;\n\nfunction concatInPlace(arr1, arr2) {\n  for (let i = 0; i < arr2.length; i++) {\n    arr1.push(arr2[i]);\n  }\n  return arr1;\n}\n\nexport function cutPolygonByGrid(positions, holeIndices, options = {}) {\n  if (!positions.length) {\n    // input is empty\n    return [];\n  }\n  const {size = 2, gridResolution = 10, gridOffset = [0, 0], edgeTypes = false} = options;\n  const result = [];\n  const queue = [\n    {\n      pos: positions,\n      types: edgeTypes && new Array(positions.length / size).fill(TYPE_BORDER),\n      holes: holeIndices || []\n    }\n  ];\n  const bbox = [[], []];\n  let cell = [];\n\n  // Recursively bisect polygon until every part fit in a single grid cell\n  while (queue.length) {\n    const {pos, types, holes} = queue.shift();\n\n    // Get the bounding box of the outer polygon\n    getBoundingBox(pos, size, holes[0] || pos.length, bbox);\n    cell = getGridCell(bbox[0], gridResolution, gridOffset, cell);\n    const code = bitCode(bbox[1], cell);\n\n    if (code) {\n      // Split the outer ring at the boundary\n      let parts = bisectPolygon(pos, types, size, 0, holes[0] || pos.length, cell, code);\n      const polygonLow = {pos: parts[0].pos, types: parts[0].types, holes: []};\n      const polygonHigh = {pos: parts[1].pos, types: parts[1].types, holes: []};\n      queue.push(polygonLow, polygonHigh);\n\n      // Split each hole at the boundary\n      for (let i = 0; i < holes.length; i++) {\n        parts = bisectPolygon(pos, types, size, holes[i], holes[i + 1] || pos.length, cell, code);\n\n        if (parts[0]) {\n          polygonLow.holes.push(polygonLow.pos.length);\n          polygonLow.pos = concatInPlace(polygonLow.pos, parts[0].pos);\n          if (edgeTypes) {\n            polygonLow.types = concatInPlace(polygonLow.types, parts[0].types);\n          }\n        }\n        if (parts[1]) {\n          polygonHigh.holes.push(polygonHigh.pos.length);\n          polygonHigh.pos = concatInPlace(polygonHigh.pos, parts[1].pos);\n          if (edgeTypes) {\n            polygonHigh.types = concatInPlace(polygonHigh.types, parts[1].types);\n          }\n        }\n      }\n    } else {\n      // Polygon fits in a single cell, no more processing required\n      const polygon = {positions: pos};\n      if (edgeTypes) {\n        polygon.edgeTypes = types;\n      }\n      if (holes.length) {\n        polygon.holeIndices = holes;\n      }\n\n      result.push(polygon);\n    }\n  }\n  return result;\n}\n\n// edgeTypes:\n// TYPE_BORDER - edge from the original polygon\n// TYPE_INSIDE - inside the original polygon\n// eslint-disable-next-line max-params\nfunction bisectPolygon(positions, edgeTypes, size, startIndex, endIndex, bbox, edge) {\n  const numPoints = (endIndex - startIndex) / size;\n  const resultLow = [];\n  const resultHigh = [];\n  const typesLow = [];\n  const typesHigh = [];\n  const scratchPoint = [];\n\n  let p;\n  let side;\n  let type;\n  const prev = getPointAtIndex(positions, numPoints - 1, size, startIndex);\n  let prevSide = Math.sign(edge & 8 ? prev[1] - bbox[3] : prev[0] - bbox[2]);\n  let prevType = edgeTypes && edgeTypes[numPoints - 1];\n  let lowPointCount = 0;\n  let highPointCount = 0;\n\n  for (let i = 0; i < numPoints; i++) {\n    p = getPointAtIndex(positions, i, size, startIndex, p);\n    side = Math.sign(edge & 8 ? p[1] - bbox[3] : p[0] - bbox[2]);\n    type = edgeTypes && edgeTypes[startIndex / size + i];\n\n    // if segment goes through the boundary, add an intersection\n    if (side && prevSide && prevSide !== side) {\n      intersect(prev, p, edge, bbox, scratchPoint);\n      push(resultLow, scratchPoint) && typesLow.push(prevType);\n      push(resultHigh, scratchPoint) && typesHigh.push(prevType);\n    }\n\n    if (side <= 0) {\n      push(resultLow, p) && typesLow.push(type);\n      lowPointCount -= side;\n    } else if (typesLow.length) {\n      typesLow[typesLow.length - 1] = TYPE_INSIDE;\n    }\n    if (side >= 0) {\n      push(resultHigh, p) && typesHigh.push(type);\n      highPointCount += side;\n    } else if (typesHigh.length) {\n      typesHigh[typesHigh.length - 1] = TYPE_INSIDE;\n    }\n\n    copy(prev, p);\n    prevSide = side;\n    prevType = type;\n  }\n\n  return [\n    lowPointCount ? {pos: resultLow, types: edgeTypes && typesLow} : null,\n    highPointCount ? {pos: resultHigh, types: edgeTypes && typesHigh} : null\n  ];\n}\n\nfunction getGridCell(p, gridResolution, gridOffset, out) {\n  const left = Math.floor((p[0] - gridOffset[0]) / gridResolution) * gridResolution + gridOffset[0];\n  const bottom =\n    Math.floor((p[1] - gridOffset[1]) / gridResolution) * gridResolution + gridOffset[1];\n  out[0] = left;\n  out[1] = bottom;\n  out[2] = left + gridResolution;\n  out[3] = bottom + gridResolution;\n  return out;\n}\n\nfunction moveToNeighborCell(cell, gridResolution, edge) {\n  if (edge & 8) {\n    // top\n    cell[1] += gridResolution;\n    cell[3] += gridResolution;\n  } else if (edge & 4) {\n    // bottom\n    cell[1] -= gridResolution;\n    cell[3] -= gridResolution;\n  } else if (edge & 2) {\n    // right\n    cell[0] += gridResolution;\n    cell[2] += gridResolution;\n  } else if (edge & 1) {\n    // left\n    cell[0] -= gridResolution;\n    cell[2] -= gridResolution;\n  }\n}\n\nfunction getBoundingBox(positions, size, endIndex, out) {\n  let minX = Infinity;\n  let maxX = -Infinity;\n  let minY = Infinity;\n  let maxY = -Infinity;\n\n  for (let i = 0; i < endIndex; i += size) {\n    const x = positions[i];\n    const y = positions[i + 1];\n    minX = x < minX ? x : minX;\n    maxX = x > maxX ? x : maxX;\n    minY = y < minY ? y : minY;\n    maxY = y > maxY ? y : maxY;\n  }\n\n  out[0][0] = minX;\n  out[0][1] = minY;\n  out[1][0] = maxX;\n  out[1][1] = maxY;\n  return out;\n}\n"],"file":"cut-by-grid.js"}
+{"version":3,"sources":["../../src/cut-by-grid.ts"],"names":["bitCode","intersect","getPointAtIndex","copy","push","cutPolylineByGrid","positions","options","size","broken","gridResolution","gridOffset","startIndex","endIndex","length","numPoints","part","result","a","b","codeB","cell","getGridCell","scratchPoint","i","codeAlt","moveToNeighborCell","TYPE_INSIDE","TYPE_BORDER","concatInPlace","arr1","arr2","cutPolygonByGrid","holeIndices","edgeTypes","queue","pos","types","Array","fill","holes","bbox","shift","getBoundingBox","code","parts","bisectPolygon","polygonLow","polygonHigh","polygon","edge","resultLow","resultHigh","typesLow","typesHigh","p","side","type","prev","prevSide","Math","sign","prevType","lowPointCount","highPointCount","out","left","floor","bottom","minX","Infinity","maxX","minY","maxY","x","y"],"mappings":"AACA,SAAQA,OAAR,EAAiBC,SAAjB,QAA8C,YAA9C;AACA,SAAQC,eAAR,EAAyBC,IAAzB,EAA+BC,IAA/B,QAA0C,SAA1C;AAUA,OAAO,SAASC,iBAAT,CACLC,SADK,EAELC,OAFK,EAUkB;AACvB,QAAM;AACJC,IAAAA,IAAI,GAAG,CADH;AAEJC,IAAAA,MAAM,GAAG,KAFL;AAGJC,IAAAA,cAAc,GAAG,EAHb;AAIJC,IAAAA,UAAU,GAAG,CAAC,CAAD,EAAI,CAAJ,CAJT;AAKJC,IAAAA,UAAU,GAAG,CALT;AAMJC,IAAAA,QAAQ,GAAGP,SAAS,CAACQ;AANjB,MAOFP,OAAO,IAAI,EAPf;AAQA,QAAMQ,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,MAAIQ,IAAc,GAAG,EAArB;AACA,QAAMC,MAAkB,GAAG,CAACD,IAAD,CAA3B;AACA,QAAME,CAAW,GAAGhB,eAAe,CAACI,SAAD,EAAY,CAAZ,EAAeE,IAAf,EAAqBI,UAArB,CAAnC;AACA,MAAIO,CAAJ;AACA,MAAIC,KAAJ;AACA,QAAMC,IAAiB,GAAGC,WAAW,CAACJ,CAAD,EAAIR,cAAJ,EAAoBC,UAApB,EAAgC,EAAhC,CAArC;AACA,QAAMY,YAAsB,GAAG,EAA/B;AACAnB,EAAAA,IAAI,CAACY,IAAD,EAAOE,CAAP,CAAJ;;AAEA,OAAK,IAAIM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClCL,IAAAA,CAAC,GAAGjB,eAAe,CAACI,SAAD,EAAYkB,CAAZ,EAAehB,IAAf,EAAqBI,UAArB,EAAiCO,CAAjC,CAAnB;AACAC,IAAAA,KAAK,GAAGpB,OAAO,CAACmB,CAAD,EAAIE,IAAJ,CAAf;;AAEA,WAAOD,KAAP,EAAc;AAEZnB,MAAAA,SAAS,CAACiB,CAAD,EAAIC,CAAJ,EAAOC,KAAP,EAAcC,IAAd,EAAoBE,YAApB,CAAT;AACA,YAAME,OAAO,GAAGzB,OAAO,CAACuB,YAAD,EAAeF,IAAf,CAAvB;;AACA,UAAII,OAAJ,EAAa;AACXxB,QAAAA,SAAS,CAACiB,CAAD,EAAIK,YAAJ,EAAkBE,OAAlB,EAA2BJ,IAA3B,EAAiCE,YAAjC,CAAT;AACAH,QAAAA,KAAK,GAAGK,OAAR;AACD;;AACDrB,MAAAA,IAAI,CAACY,IAAD,EAAOO,YAAP,CAAJ;AAEApB,MAAAA,IAAI,CAACe,CAAD,EAAIK,YAAJ,CAAJ;AAEAG,MAAAA,kBAAkB,CAACL,IAAD,EAAOX,cAAP,EAAuBU,KAAvB,CAAlB;;AACA,UAAIX,MAAM,IAAIO,IAAI,CAACF,MAAL,GAAcN,IAA5B,EAAkC;AAChCQ,QAAAA,IAAI,GAAG,EAAP;AACAC,QAAAA,MAAM,CAACb,IAAP,CAAYY,IAAZ;AACAZ,QAAAA,IAAI,CAACY,IAAD,EAAOE,CAAP,CAAJ;AACD;;AAEDE,MAAAA,KAAK,GAAGpB,OAAO,CAACmB,CAAD,EAAIE,IAAJ,CAAf;AACD;;AAEDjB,IAAAA,IAAI,CAACY,IAAD,EAAOG,CAAP,CAAJ;AACAhB,IAAAA,IAAI,CAACe,CAAD,EAAIC,CAAJ,CAAJ;AACD;;AAED,SAAOV,MAAM,GAAGQ,MAAH,GAAYA,MAAM,CAAC,CAAD,CAA/B;AACD;AAED,MAAMU,WAAW,GAAG,CAApB;AACA,MAAMC,WAAW,GAAG,CAApB;;AAEA,SAASC,aAAT,CAAuBC,IAAvB,EAAuCC,IAAvC,EAAiE;AAC/D,OAAK,IAAIP,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGO,IAAI,CAACjB,MAAzB,EAAiCU,CAAC,EAAlC,EAAsC;AACpCM,IAAAA,IAAI,CAAC1B,IAAL,CAAU2B,IAAI,CAACP,CAAD,CAAd;AACD;;AACD,SAAOM,IAAP;AACD;;AAED,OAAO,SAASE,gBAAT,CACL1B,SADK,EAEL2B,WAA4B,GAAG,IAF1B,EAGL1B,OAHK,EASM;AACX,MAAI,CAACD,SAAS,CAACQ,MAAf,EAAuB;AAErB,WAAO,EAAP;AACD;;AACD,QAAM;AAACN,IAAAA,IAAI,GAAG,CAAR;AAAWE,IAAAA,cAAc,GAAG,EAA5B;AAAgCC,IAAAA,UAAU,GAAG,CAAC,CAAD,EAAI,CAAJ,CAA7C;AAAqDuB,IAAAA,SAAS,GAAG;AAAjE,MAA0E3B,OAAO,IAAI,EAA3F;AACA,QAAMU,MAAiB,GAAG,EAA1B;AACA,QAAMkB,KAA0D,GAAG,CACjE;AACEC,IAAAA,GAAG,EAAE9B,SADP;AAEE+B,IAAAA,KAAK,EAAEH,SAAS,GAAI,IAAII,KAAJ,CAAUhC,SAAS,CAACQ,MAAV,GAAmBN,IAA7B,EAAmC+B,IAAnC,CAAwCX,WAAxC,CAAJ,GAAwE,IAF1F;AAGEY,IAAAA,KAAK,EAAEP,WAAW,IAAI;AAHxB,GADiE,CAAnE;AAOA,QAAMQ,IAAgB,GAAG,CAAC,EAAD,EAAK,EAAL,CAAzB;AAEA,MAAIpB,IAAiB,GAAG,EAAxB;;AAGA,SAAOc,KAAK,CAACrB,MAAb,EAAqB;AACnB,UAAM;AAACsB,MAAAA,GAAD;AAAMC,MAAAA,KAAN;AAAaG,MAAAA;AAAb,QAAsBL,KAAK,CAACO,KAAN,EAA5B;AAGAC,IAAAA,cAAc,CAACP,GAAD,EAAM5B,IAAN,EAAYgC,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACtB,MAA5B,EAAoC2B,IAApC,CAAd;AACApB,IAAAA,IAAI,GAAGC,WAAW,CAACmB,IAAI,CAAC,CAAD,CAAL,EAAU/B,cAAV,EAA0BC,UAA1B,EAAsCU,IAAtC,CAAlB;AACA,UAAMuB,IAAI,GAAG5C,OAAO,CAACyC,IAAI,CAAC,CAAD,CAAL,EAAUpB,IAAV,CAApB;;AAEA,QAAIuB,IAAJ,EAAU;AAER,UAAIC,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa7B,IAAb,EAAmB,CAAnB,EAAsBgC,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACtB,MAAtC,EAA8CO,IAA9C,EAAoDuB,IAApD,CAAzB;AACA,YAAMG,UAAU,GAAG;AAACX,QAAAA,GAAG,EAAES,KAAK,CAAC,CAAD,CAAL,CAAST,GAAf;AAAoBC,QAAAA,KAAK,EAAEQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAApC;AAA2CG,QAAAA,KAAK,EAAE;AAAlD,OAAnB;AACA,YAAMQ,WAAW,GAAG;AAACZ,QAAAA,GAAG,EAAES,KAAK,CAAC,CAAD,CAAL,CAAST,GAAf;AAAoBC,QAAAA,KAAK,EAAEQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAApC;AAA2CG,QAAAA,KAAK,EAAE;AAAlD,OAApB;AACAL,MAAAA,KAAK,CAAC/B,IAAN,CAAW2C,UAAX,EAAuBC,WAAvB;;AAGA,WAAK,IAAIxB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGgB,KAAK,CAAC1B,MAA1B,EAAkCU,CAAC,EAAnC,EAAuC;AACrCqB,QAAAA,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa7B,IAAb,EAAmBgC,KAAK,CAAChB,CAAD,CAAxB,EAA6BgB,KAAK,CAAChB,CAAC,GAAG,CAAL,CAAL,IAAgBY,GAAG,CAACtB,MAAjD,EAAyDO,IAAzD,EAA+DuB,IAA/D,CAArB;;AAEA,YAAIC,KAAK,CAAC,CAAD,CAAT,EAAc;AACZE,UAAAA,UAAU,CAACP,KAAX,CAAiBpC,IAAjB,CAAsB2C,UAAU,CAACX,GAAX,CAAetB,MAArC;AACAiC,UAAAA,UAAU,CAACX,GAAX,GAAiBP,aAAa,CAACkB,UAAU,CAACX,GAAZ,EAAiBS,KAAK,CAAC,CAAD,CAAL,CAAST,GAA1B,CAA9B;;AACA,cAAIF,SAAJ,EAAe;AACba,YAAAA,UAAU,CAACV,KAAX,GAAmBR,aAAa,CAACkB,UAAU,CAACV,KAAZ,EAAmBQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAA5B,CAAhC;AACD;AACF;;AACD,YAAIQ,KAAK,CAAC,CAAD,CAAT,EAAc;AACZG,UAAAA,WAAW,CAACR,KAAZ,CAAkBpC,IAAlB,CAAuB4C,WAAW,CAACZ,GAAZ,CAAgBtB,MAAvC;AACAkC,UAAAA,WAAW,CAACZ,GAAZ,GAAkBP,aAAa,CAACmB,WAAW,CAACZ,GAAb,EAAkBS,KAAK,CAAC,CAAD,CAAL,CAAST,GAA3B,CAA/B;;AACA,cAAIF,SAAJ,EAAe;AACbc,YAAAA,WAAW,CAACX,KAAZ,GAAoBR,aAAa,CAACmB,WAAW,CAACX,KAAb,EAAoBQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAA7B,CAAjC;AACD;AACF;AACF;AACF,KA1BD,MA0BO;AAEL,YAAMY,OAAgB,GAAG;AAAC3C,QAAAA,SAAS,EAAE8B;AAAZ,OAAzB;;AACA,UAAIF,SAAJ,EAAe;AACbe,QAAAA,OAAO,CAACf,SAAR,GAAoBG,KAApB;AACD;;AACD,UAAIG,KAAK,CAAC1B,MAAV,EAAkB;AAChBmC,QAAAA,OAAO,CAAChB,WAAR,GAAsBO,KAAtB;AACD;;AAEDvB,MAAAA,MAAM,CAACb,IAAP,CAAY6C,OAAZ;AACD;AACF;;AACD,SAAOhC,MAAP;AACD;;AAMD,SAAS6B,aAAT,CACExC,SADF,EAEE4B,SAFF,EAGE1B,IAHF,EAIEI,UAJF,EAKEC,QALF,EAME4B,IANF,EAOES,IAPF,EAQE;AACA,QAAMnC,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,QAAM2C,SAAmB,GAAG,EAA5B;AACA,QAAMC,UAAoB,GAAG,EAA7B;AACA,QAAMC,QAAkB,GAAG,EAA3B;AACA,QAAMC,SAAmB,GAAG,EAA5B;AACA,QAAM/B,YAAsB,GAAG,EAA/B;AAEA,MAAIgC,CAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,QAAMC,IAAI,GAAGxD,eAAe,CAACI,SAAD,EAAYS,SAAS,GAAG,CAAxB,EAA2BP,IAA3B,EAAiCI,UAAjC,CAA5B;AACA,MAAI+C,QAAQ,GAAGC,IAAI,CAACC,IAAL,CAAUX,IAAI,GAAG,CAAP,GAAWQ,IAAI,CAAC,CAAD,CAAJ,GAAUjB,IAAI,CAAC,CAAD,CAAzB,GAA+BiB,IAAI,CAAC,CAAD,CAAJ,GAAUjB,IAAI,CAAC,CAAD,CAAvD,CAAf;AACA,MAAIqB,QAAQ,GAAG5B,SAAS,IAAIA,SAAS,CAACnB,SAAS,GAAG,CAAb,CAArC;AACA,MAAIgD,aAAa,GAAG,CAApB;AACA,MAAIC,cAAc,GAAG,CAArB;;AAEA,OAAK,IAAIxC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClC+B,IAAAA,CAAC,GAAGrD,eAAe,CAACI,SAAD,EAAYkB,CAAZ,EAAehB,IAAf,EAAqBI,UAArB,EAAiC2C,CAAjC,CAAnB;AACAC,IAAAA,IAAI,GAAGI,IAAI,CAACC,IAAL,CAAUX,IAAI,GAAG,CAAP,GAAWK,CAAC,CAAC,CAAD,CAAD,GAAOd,IAAI,CAAC,CAAD,CAAtB,GAA4Bc,CAAC,CAAC,CAAD,CAAD,GAAOd,IAAI,CAAC,CAAD,CAAjD,CAAP;AACAgB,IAAAA,IAAI,GAAGvB,SAAS,IAAIA,SAAS,CAACtB,UAAU,GAAGJ,IAAb,GAAoBgB,CAArB,CAA7B;;AAGA,QAAIgC,IAAI,IAAIG,QAAR,IAAoBA,QAAQ,KAAKH,IAArC,EAA2C;AACzCvD,MAAAA,SAAS,CAACyD,IAAD,EAAOH,CAAP,EAAUL,IAAV,EAAgBT,IAAhB,EAAsBlB,YAAtB,CAAT;AACAnB,MAAAA,IAAI,CAAC+C,SAAD,EAAY5B,YAAZ,CAAJ,IAAiC8B,QAAQ,CAACjD,IAAT,CAAc0D,QAAd,CAAjC;AACA1D,MAAAA,IAAI,CAACgD,UAAD,EAAa7B,YAAb,CAAJ,IAAkC+B,SAAS,CAAClD,IAAV,CAAe0D,QAAf,CAAlC;AACD;;AAED,QAAIN,IAAI,IAAI,CAAZ,EAAe;AACbpD,MAAAA,IAAI,CAAC+C,SAAD,EAAYI,CAAZ,CAAJ,IAAsBF,QAAQ,CAACjD,IAAT,CAAcqD,IAAd,CAAtB;AACAM,MAAAA,aAAa,IAAIP,IAAjB;AACD,KAHD,MAGO,IAAIH,QAAQ,CAACvC,MAAb,EAAqB;AAC1BuC,MAAAA,QAAQ,CAACA,QAAQ,CAACvC,MAAT,GAAkB,CAAnB,CAAR,GAAgCa,WAAhC;AACD;;AACD,QAAI6B,IAAI,IAAI,CAAZ,EAAe;AACbpD,MAAAA,IAAI,CAACgD,UAAD,EAAaG,CAAb,CAAJ,IAAuBD,SAAS,CAAClD,IAAV,CAAeqD,IAAf,CAAvB;AACAO,MAAAA,cAAc,IAAIR,IAAlB;AACD,KAHD,MAGO,IAAIF,SAAS,CAACxC,MAAd,EAAsB;AAC3BwC,MAAAA,SAAS,CAACA,SAAS,CAACxC,MAAV,GAAmB,CAApB,CAAT,GAAkCa,WAAlC;AACD;;AAEDxB,IAAAA,IAAI,CAACuD,IAAD,EAAOH,CAAP,CAAJ;AACAI,IAAAA,QAAQ,GAAGH,IAAX;AACAM,IAAAA,QAAQ,GAAGL,IAAX;AACD;;AAED,SAAO,CACLM,aAAa,GAAG;AAAC3B,IAAAA,GAAG,EAAEe,SAAN;AAAiBd,IAAAA,KAAK,EAAEH,SAAS,IAAImB;AAArC,GAAH,GAAoD,IAD5D,EAELW,cAAc,GAAG;AAAC5B,IAAAA,GAAG,EAAEgB,UAAN;AAAkBf,IAAAA,KAAK,EAAEH,SAAS,IAAIoB;AAAtC,GAAH,GAAsD,IAF/D,CAAP;AAID;;AAED,SAAShC,WAAT,CACEiC,CADF,EAEE7C,cAFF,EAGEC,UAHF,EAIEsD,GAJF,EAKe;AACb,QAAMC,IAAI,GAAGN,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO5C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CAA9F;AACA,QAAMyD,MAAM,GACVR,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO5C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CADnF;AAEAsD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAT;AACAD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAT;AACAH,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAI,GAAGxD,cAAhB;AACAuD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAM,GAAG1D,cAAlB;AACA,SAAOuD,GAAP;AACD;;AAED,SAASvC,kBAAT,CAA4BL,IAA5B,EAA4CX,cAA5C,EAAoEwC,IAApE,EAAwF;AACtF,MAAIA,IAAI,GAAG,CAAX,EAAc;AAEZ7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJD,MAIO,IAAIwC,IAAI,GAAG,CAAX,EAAc;AAEnB7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIwC,IAAI,GAAG,CAAX,EAAc;AAEnB7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIwC,IAAI,GAAG,CAAX,EAAc;AAEnB7B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD;AACF;;AAED,SAASiC,cAAT,CACErC,SADF,EAEEE,IAFF,EAGEK,QAHF,EAIEoD,GAJF,EAKc;AACZ,MAAII,IAAI,GAAGC,QAAX;AACA,MAAIC,IAAI,GAAG,CAACD,QAAZ;AACA,MAAIE,IAAI,GAAGF,QAAX;AACA,MAAIG,IAAI,GAAG,CAACH,QAAZ;;AAEA,OAAK,IAAI9C,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGX,QAApB,EAA8BW,CAAC,IAAIhB,IAAnC,EAAyC;AACvC,UAAMkE,CAAC,GAAGpE,SAAS,CAACkB,CAAD,CAAnB;AACA,UAAMmD,CAAC,GAAGrE,SAAS,CAACkB,CAAC,GAAG,CAAL,CAAnB;AACA6C,IAAAA,IAAI,GAAGK,CAAC,GAAGL,IAAJ,GAAWK,CAAX,GAAeL,IAAtB;AACAE,IAAAA,IAAI,GAAGG,CAAC,GAAGH,IAAJ,GAAWG,CAAX,GAAeH,IAAtB;AACAC,IAAAA,IAAI,GAAGG,CAAC,GAAGH,IAAJ,GAAWG,CAAX,GAAeH,IAAtB;AACAC,IAAAA,IAAI,GAAGE,CAAC,GAAGF,IAAJ,GAAWE,CAAX,GAAeF,IAAtB;AACD;;AAEDR,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYI,IAAZ;AACAJ,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYO,IAAZ;AACAP,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYM,IAAZ;AACAN,EAAAA,GAAG,CAAC,CAAD,CAAH,CAAO,CAAP,IAAYQ,IAAZ;AACA,SAAOR,GAAP;AACD","sourcesContent":["/* eslint-disable max-statements, max-depth, complexity, no-unused-expressions */\nimport {bitCode, intersect, BoundingBox} from './lineclip';\nimport {getPointAtIndex, copy, push} from './utils';\n\nimport type {NumericArray} from '@math.gl/core';\n\nexport type Polygon = {\n  positions: number[];\n  holeIndices?: number[];\n  edgeTypes?: number[];\n};\n\nexport function cutPolylineByGrid(\n  positions: NumericArray,\n  options?: {\n    size?: number;\n    broken?: boolean;\n    gridResolution?: number;\n    gridOffset?: [number, number];\n    startIndex?: number;\n    endIndex?: number;\n  }\n): number[] | number[][] {\n  const {\n    size = 2,\n    broken = false,\n    gridResolution = 10,\n    gridOffset = [0, 0],\n    startIndex = 0,\n    endIndex = positions.length\n  } = options || {};\n  const numPoints = (endIndex - startIndex) / size;\n  let part: number[] = [];\n  const result: number[][] = [part];\n  const a: number[] = getPointAtIndex(positions, 0, size, startIndex);\n  let b: number[];\n  let codeB: number;\n  const cell: BoundingBox = getGridCell(a, gridResolution, gridOffset, []);\n  const scratchPoint: number[] = [];\n  push(part, a);\n\n  for (let i = 1; i < numPoints; i++) {\n    b = getPointAtIndex(positions, i, size, startIndex, b);\n    codeB = bitCode(b, cell);\n\n    while (codeB) {\n      // find the intersection with the current cell\n      intersect(a, b, codeB, cell, scratchPoint);\n      const codeAlt = bitCode(scratchPoint, cell);\n      if (codeAlt) {\n        intersect(a, scratchPoint, codeAlt, cell, scratchPoint);\n        codeB = codeAlt;\n      }\n      push(part, scratchPoint);\n      // move to the next cell\n      copy(a, scratchPoint);\n\n      moveToNeighborCell(cell, gridResolution, codeB);\n      if (broken && part.length > size) {\n        part = [];\n        result.push(part);\n        push(part, a);\n      }\n\n      codeB = bitCode(b, cell);\n    }\n\n    push(part, b);\n    copy(a, b);\n  }\n\n  return broken ? result : result[0];\n}\n\nconst TYPE_INSIDE = 0;\nconst TYPE_BORDER = 1;\n\nfunction concatInPlace(arr1: number[], arr2: number[]): number[] {\n  for (let i = 0; i < arr2.length; i++) {\n    arr1.push(arr2[i]);\n  }\n  return arr1;\n}\n\nexport function cutPolygonByGrid(\n  positions: number[],\n  holeIndices: number[] | null = null,\n  options?: {\n    size?: number;\n    gridResolution?: number;\n    gridOffset?: [number, number];\n    edgeTypes?: boolean;\n  }\n): Polygon[] {\n  if (!positions.length) {\n    // input is empty\n    return [];\n  }\n  const {size = 2, gridResolution = 10, gridOffset = [0, 0], edgeTypes = false} = options || {};\n  const result: Polygon[] = [];\n  const queue: {pos: number[]; types: number[]; holes: number[]}[] = [\n    {\n      pos: positions,\n      types: edgeTypes ? (new Array(positions.length / size).fill(TYPE_BORDER) as number[]) : null,\n      holes: holeIndices || []\n    }\n  ];\n  const bbox: number[][] = [[], []];\n  // @ts-ignore\n  let cell: BoundingBox = [];\n\n  // Recursively bisect polygon until every part fit in a single grid cell\n  while (queue.length) {\n    const {pos, types, holes} = queue.shift();\n\n    // Get the bounding box of the outer polygon\n    getBoundingBox(pos, size, holes[0] || pos.length, bbox);\n    cell = getGridCell(bbox[0], gridResolution, gridOffset, cell);\n    const code = bitCode(bbox[1], cell);\n\n    if (code) {\n      // Split the outer ring at the boundary\n      let parts = bisectPolygon(pos, types, size, 0, holes[0] || pos.length, cell, code);\n      const polygonLow = {pos: parts[0].pos, types: parts[0].types, holes: []};\n      const polygonHigh = {pos: parts[1].pos, types: parts[1].types, holes: []};\n      queue.push(polygonLow, polygonHigh);\n\n      // Split each hole at the boundary\n      for (let i = 0; i < holes.length; i++) {\n        parts = bisectPolygon(pos, types, size, holes[i], holes[i + 1] || pos.length, cell, code);\n\n        if (parts[0]) {\n          polygonLow.holes.push(polygonLow.pos.length);\n          polygonLow.pos = concatInPlace(polygonLow.pos, parts[0].pos);\n          if (edgeTypes) {\n            polygonLow.types = concatInPlace(polygonLow.types, parts[0].types);\n          }\n        }\n        if (parts[1]) {\n          polygonHigh.holes.push(polygonHigh.pos.length);\n          polygonHigh.pos = concatInPlace(polygonHigh.pos, parts[1].pos);\n          if (edgeTypes) {\n            polygonHigh.types = concatInPlace(polygonHigh.types, parts[1].types);\n          }\n        }\n      }\n    } else {\n      // Polygon fits in a single cell, no more processing required\n      const polygon: Polygon = {positions: pos};\n      if (edgeTypes) {\n        polygon.edgeTypes = types;\n      }\n      if (holes.length) {\n        polygon.holeIndices = holes;\n      }\n\n      result.push(polygon);\n    }\n  }\n  return result;\n}\n\n// edgeTypes:\n// TYPE_BORDER - edge from the original polygon\n// TYPE_INSIDE - inside the original polygon\n// eslint-disable-next-line max-params\nfunction bisectPolygon(\n  positions: NumericArray,\n  edgeTypes: number[] | undefined,\n  size: number,\n  startIndex: number,\n  endIndex: number,\n  bbox: BoundingBox,\n  edge: number\n) {\n  const numPoints = (endIndex - startIndex) / size;\n  const resultLow: number[] = [];\n  const resultHigh: number[] = [];\n  const typesLow: number[] = [];\n  const typesHigh: number[] = [];\n  const scratchPoint: number[] = [];\n\n  let p: number[];\n  let side: number;\n  let type: number;\n  const prev = getPointAtIndex(positions, numPoints - 1, size, startIndex);\n  let prevSide = Math.sign(edge & 8 ? prev[1] - bbox[3] : prev[0] - bbox[2]);\n  let prevType = edgeTypes && edgeTypes[numPoints - 1];\n  let lowPointCount = 0;\n  let highPointCount = 0;\n\n  for (let i = 0; i < numPoints; i++) {\n    p = getPointAtIndex(positions, i, size, startIndex, p);\n    side = Math.sign(edge & 8 ? p[1] - bbox[3] : p[0] - bbox[2]);\n    type = edgeTypes && edgeTypes[startIndex / size + i];\n\n    // if segment goes through the boundary, add an intersection\n    if (side && prevSide && prevSide !== side) {\n      intersect(prev, p, edge, bbox, scratchPoint);\n      push(resultLow, scratchPoint) && typesLow.push(prevType);\n      push(resultHigh, scratchPoint) && typesHigh.push(prevType);\n    }\n\n    if (side <= 0) {\n      push(resultLow, p) && typesLow.push(type);\n      lowPointCount -= side;\n    } else if (typesLow.length) {\n      typesLow[typesLow.length - 1] = TYPE_INSIDE;\n    }\n    if (side >= 0) {\n      push(resultHigh, p) && typesHigh.push(type);\n      highPointCount += side;\n    } else if (typesHigh.length) {\n      typesHigh[typesHigh.length - 1] = TYPE_INSIDE;\n    }\n\n    copy(prev, p);\n    prevSide = side;\n    prevType = type;\n  }\n\n  return [\n    lowPointCount ? {pos: resultLow, types: edgeTypes && typesLow} : null,\n    highPointCount ? {pos: resultHigh, types: edgeTypes && typesHigh} : null\n  ];\n}\n\nfunction getGridCell(\n  p: number[],\n  gridResolution: number,\n  gridOffset: [number, number],\n  out: number[]\n): BoundingBox {\n  const left = Math.floor((p[0] - gridOffset[0]) / gridResolution) * gridResolution + gridOffset[0];\n  const bottom =\n    Math.floor((p[1] - gridOffset[1]) / gridResolution) * gridResolution + gridOffset[1];\n  out[0] = left;\n  out[1] = bottom;\n  out[2] = left + gridResolution;\n  out[3] = bottom + gridResolution;\n  return out as BoundingBox;\n}\n\nfunction moveToNeighborCell(cell: number[], gridResolution: number, edge: number): void {\n  if (edge & 8) {\n    // top\n    cell[1] += gridResolution;\n    cell[3] += gridResolution;\n  } else if (edge & 4) {\n    // bottom\n    cell[1] -= gridResolution;\n    cell[3] -= gridResolution;\n  } else if (edge & 2) {\n    // right\n    cell[0] += gridResolution;\n    cell[2] += gridResolution;\n  } else if (edge & 1) {\n    // left\n    cell[0] -= gridResolution;\n    cell[2] -= gridResolution;\n  }\n}\n\nfunction getBoundingBox(\n  positions: NumericArray,\n  size: number,\n  endIndex: number,\n  out: number[][]\n): number[][] {\n  let minX = Infinity;\n  let maxX = -Infinity;\n  let minY = Infinity;\n  let maxY = -Infinity;\n\n  for (let i = 0; i < endIndex; i += size) {\n    const x = positions[i];\n    const y = positions[i + 1];\n    minX = x < minX ? x : minX;\n    maxX = x > maxX ? x : maxX;\n    minY = y < minY ? y : minY;\n    maxY = y > maxY ? y : maxY;\n  }\n\n  out[0][0] = minX;\n  out[0][1] = minY;\n  out[1][0] = maxX;\n  out[1][1] = maxY;\n  return out;\n}\n"],"file":"cut-by-grid.js"}

package/dist/esm/cut-by-mercator-bounds.js

@@ -1,13 +1,13 @@
 import { cutPolylineByGrid, cutPolygonByGrid } from './cut-by-grid';
 import { getPointAtIndex, push } from './utils';
 const DEFAULT_MAX_LATITUDE = 85.051129;
-export function cutPolylineByMercatorBounds(positions, options = {}) {
+export function cutPolylineByMercatorBounds(positions, options) {
   const {
     size = 2,
     startIndex = 0,
     endIndex = positions.length,
     normalize = true
-  } = options;
+  } = options || {};
   const newPositions = positions.slice(startIndex, endIndex);
   wrapLongitudesForShortestPath(newPositions, size, 0, endIndex - startIndex);
   const parts = cutPolylineByGrid(newPositions, {
@@ -25,12 +25,12 @@ export function cutPolylineByMercatorBounds(positions, options = {}) {
 
   return parts;
 }
-export function cutPolygonByMercatorBounds(positions, holeIndices, options = {}) {
+export function cutPolygonByMercatorBounds(positions, holeIndices = null, options) {
   const {
     size = 2,
     normalize = true,
     edgeTypes = false
-  } = options;
+  } = options || {};
   holeIndices = holeIndices || [];
   const newPositions = [];
   const newHoleIndices = [];
@@ -51,7 +51,7 @@ export function cutPolygonByMercatorBounds(positions, holeIndices, options = {})
     }
 
     wrapLongitudesForShortestPath(newPositions, size, targetStartIndex, targetIndex);
-    insertPoleVertices(newPositions, size, targetStartIndex, targetIndex, options.maxLatitude);
+    insertPoleVertices(newPositions, size, targetStartIndex, targetIndex, options === null || options === void 0 ? void 0 : options.maxLatitude);
     srcStartIndex = srcEndIndex;
     newHoleIndices[ringIndex] = targetIndex;
   }

package/dist/esm/cut-by-mercator-bounds.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/cut-by-mercator-bounds.js"],"names":["cutPolylineByGrid","cutPolygonByGrid","getPointAtIndex","push","DEFAULT_MAX_LATITUDE","cutPolylineByMercatorBounds","positions","options","size","startIndex","endIndex","length","normalize","newPositions","slice","wrapLongitudesForShortestPath","parts","broken","gridResolution","gridOffset","part","shiftLongitudesIntoRange","cutPolygonByMercatorBounds","holeIndices","edgeTypes","newHoleIndices","srcStartIndex","targetIndex","ringIndex","srcEndIndex","targetStartIndex","splitIndex","findSplitIndex","i","insertPoleVertices","maxLatitude","pop","maxLat","pointIndex","lat","Math","abs","firstLng","lastLng","p","round","sign","prevLng","lng","delta","refLng","pointCount"],"mappings":"AAAA,SAAQA,iBAAR,EAA2BC,gBAA3B,QAAkD,eAAlD;AACA,SAAQC,eAAR,EAAyBC,IAAzB,QAAoC,SAApC;AAGA,MAAMC,oBAAoB,GAAG,SAA7B;AAGA,OAAO,SAASC,2BAAT,CAAqCC,SAArC,EAAgDC,OAAO,GAAG,EAA1D,EAA8D;AACnE,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWC,IAAAA,UAAU,GAAG,CAAxB;AAA2BC,IAAAA,QAAQ,GAAGJ,SAAS,CAACK,MAAhD;AAAwDC,IAAAA,SAAS,GAAG;AAApE,MAA4EL,OAAlF;AAGA,QAAMM,YAAY,GAAGP,SAAS,CAACQ,KAAV,CAAgBL,UAAhB,EAA4BC,QAA5B,CAArB;AACAK,EAAAA,6BAA6B,CAACF,YAAD,EAAeL,IAAf,EAAqB,CAArB,EAAwBE,QAAQ,GAAGD,UAAnC,CAA7B;AAEA,QAAMO,KAAK,GAAGhB,iBAAiB,CAACa,YAAD,EAAe;AAC5CL,IAAAA,IAD4C;AAE5CS,IAAAA,MAAM,EAAE,IAFoC;AAG5CC,IAAAA,cAAc,EAAE,GAH4B;AAI5CC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR;AAJgC,GAAf,CAA/B;;AAOA,MAAIP,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AACxBK,MAAAA,wBAAwB,CAACD,IAAD,EAAOZ,IAAP,CAAxB;AACD;AACF;;AACD,SAAOQ,KAAP;AACD;AAGD,OAAO,SAASM,0BAAT,CAAoChB,SAApC,EAA+CiB,WAA/C,EAA4DhB,OAAO,GAAG,EAAtE,EAA0E;AAC/E,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWI,IAAAA,SAAS,GAAG,IAAvB;AAA6BY,IAAAA,SAAS,GAAG;AAAzC,MAAkDjB,OAAxD;AACAgB,EAAAA,WAAW,GAAGA,WAAW,IAAI,EAA7B;AACA,QAAMV,YAAY,GAAG,EAArB;AACA,QAAMY,cAAc,GAAG,EAAvB;AACA,MAAIC,aAAa,GAAG,CAApB;AACA,MAAIC,WAAW,GAAG,CAAlB;;AAEA,OAAK,IAAIC,SAAS,GAAG,CAArB,EAAwBA,SAAS,IAAIL,WAAW,CAACZ,MAAjD,EAAyDiB,SAAS,EAAlE,EAAsE;AAEpE,UAAMC,WAAW,GAAGN,WAAW,CAACK,SAAD,CAAX,IAA0BtB,SAAS,CAACK,MAAxD;AAEA,UAAMmB,gBAAgB,GAAGH,WAAzB;AAKA,UAAMI,UAAU,GAAGC,cAAc,CAAC1B,SAAD,EAAYE,IAAZ,EAAkBkB,aAAlB,EAAiCG,WAAjC,CAAjC;;AACA,SAAK,IAAII,CAAC,GAAGF,UAAb,EAAyBE,CAAC,GAAGJ,WAA7B,EAA0CI,CAAC,EAA3C,EAA+C;AAC7CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,CAAD,CAAvC;AACD;;AACD,SAAK,IAAIA,CAAC,GAAGP,aAAb,EAA4BO,CAAC,GAAGF,UAAhC,EAA4CE,CAAC,EAA7C,EAAiD;AAC/CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,CAAD,CAAvC;AACD;;AAGDlB,IAAAA,6BAA6B,CAACF,YAAD,EAAeL,IAAf,EAAqBsB,gBAArB,EAAuCH,WAAvC,CAA7B;AAGAO,IAAAA,kBAAkB,CAACrB,YAAD,EAAeL,IAAf,EAAqBsB,gBAArB,EAAuCH,WAAvC,EAAoDpB,OAAO,CAAC4B,WAA5D,CAAlB;AAEAT,IAAAA,aAAa,GAAGG,WAAhB;AACAJ,IAAAA,cAAc,CAACG,SAAD,CAAd,GAA4BD,WAA5B;AACD;;AACDF,EAAAA,cAAc,CAACW,GAAf;AAEA,QAAMpB,KAAK,GAAGf,gBAAgB,CAACY,YAAD,EAAeY,cAAf,EAA+B;AAC3DjB,IAAAA,IAD2D;AAE3DU,IAAAA,cAAc,EAAE,GAF2C;AAG3DC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR,CAH+C;AAI3DK,IAAAA;AAJ2D,GAA/B,CAA9B;;AAOA,MAAIZ,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AACxBK,MAAAA,wBAAwB,CAACD,IAAI,CAACd,SAAN,EAAiBE,IAAjB,CAAxB;AACD;AACF;;AACD,SAAOQ,KAAP;AACD;;AAKD,SAASgB,cAAT,CAAwB1B,SAAxB,EAAmCE,IAAnC,EAAyCC,UAAzC,EAAqDC,QAArD,EAA+D;AAC7D,MAAI2B,MAAM,GAAG,CAAC,CAAd;AACA,MAAIC,UAAU,GAAG,CAAC,CAAlB;;AACA,OAAK,IAAIL,CAAC,GAAGxB,UAAU,GAAG,CAA1B,EAA6BwB,CAAC,GAAGvB,QAAjC,EAA2CuB,CAAC,IAAIzB,IAAhD,EAAsD;AACpD,UAAM+B,GAAG,GAAGC,IAAI,CAACC,GAAL,CAASnC,SAAS,CAAC2B,CAAD,CAAlB,CAAZ;;AACA,QAAIM,GAAG,GAAGF,MAAV,EAAkB;AAChBA,MAAAA,MAAM,GAAGE,GAAT;AACAD,MAAAA,UAAU,GAAGL,CAAC,GAAG,CAAjB;AACD;AACF;;AACD,SAAOK,UAAP;AACD;;AAWD,SAASJ,kBAAT,CACE5B,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKEyB,WAAW,GAAG/B,oBALhB,EAME;AAEA,QAAMsC,QAAQ,GAAGpC,SAAS,CAACG,UAAD,CAA1B;AACA,QAAMkC,OAAO,GAAGrC,SAAS,CAACI,QAAQ,GAAGF,IAAZ,CAAzB;;AACA,MAAIgC,IAAI,CAACC,GAAL,CAASC,QAAQ,GAAGC,OAApB,IAA+B,GAAnC,EAAwC;AAGtC,UAAMC,CAAC,GAAG1C,eAAe,CAACI,SAAD,EAAY,CAAZ,EAAeE,IAAf,EAAqBC,UAArB,CAAzB;AAEAmC,IAAAA,CAAC,CAAC,CAAD,CAAD,IAAQJ,IAAI,CAACK,KAAL,CAAW,CAACF,OAAO,GAAGD,QAAX,IAAuB,GAAlC,IAAyC,GAAjD;AACAvC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOJ,IAAI,CAACM,IAAL,CAAUF,CAAC,CAAC,CAAD,CAAX,IAAkBT,WAAzB;AACAhC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOF,QAAP;AACAvC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AACD;AACF;;AAED,SAAS7B,6BAAT,CAAuCT,SAAvC,EAAkDE,IAAlD,EAAwDC,UAAxD,EAAoEC,QAApE,EAA8E;AAC5E,MAAIqC,OAAO,GAAGzC,SAAS,CAAC,CAAD,CAAvB;AACA,MAAI0C,GAAJ;;AACA,OAAK,IAAIf,CAAC,GAAGxB,UAAb,EAAyBwB,CAAC,GAAGvB,QAA7B,EAAuCuB,CAAC,IAAIzB,IAA5C,EAAkD;AAChDwC,IAAAA,GAAG,GAAG1C,SAAS,CAAC2B,CAAD,CAAf;AACA,UAAMgB,KAAK,GAAGD,GAAG,GAAGD,OAApB;;AACA,QAAIE,KAAK,GAAG,GAAR,IAAeA,KAAK,GAAG,CAAC,GAA5B,EAAiC;AAC/BD,MAAAA,GAAG,IAAIR,IAAI,CAACK,KAAL,CAAWI,KAAK,GAAG,GAAnB,IAA0B,GAAjC;AACD;;AACD3C,IAAAA,SAAS,CAAC2B,CAAD,CAAT,GAAec,OAAO,GAAGC,GAAzB;AACD;AACF;;AAED,SAAS3B,wBAAT,CAAkCf,SAAlC,EAA6CE,IAA7C,EAAmD;AACjD,MAAI0C,MAAJ;AACA,QAAMC,UAAU,GAAG7C,SAAS,CAACK,MAAV,GAAmBH,IAAtC;;AAIA,OAAK,IAAIyB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGkB,UAApB,EAAgClB,CAAC,EAAjC,EAAqC;AACnCiB,IAAAA,MAAM,GAAG5C,SAAS,CAAC2B,CAAC,GAAGzB,IAAL,CAAlB;;AACA,QAAI,CAAC0C,MAAM,GAAG,GAAV,IAAiB,GAAjB,KAAyB,CAA7B,EAAgC;AAC9B;AACD;AACF;;AAED,QAAMD,KAAK,GAAG,CAACT,IAAI,CAACK,KAAL,CAAWK,MAAM,GAAG,GAApB,CAAD,GAA4B,GAA1C;;AACA,MAAID,KAAK,KAAK,CAAd,EAAiB;AACf;AACD;;AACD,OAAK,IAAIhB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGkB,UAApB,EAAgClB,CAAC,EAAjC,EAAqC;AACnC3B,IAAAA,SAAS,CAAC2B,CAAC,GAAGzB,IAAL,CAAT,IAAuByC,KAAvB;AACD;AACF","sourcesContent":["import {cutPolylineByGrid, cutPolygonByGrid} from './cut-by-grid';\nimport {getPointAtIndex, push} from './utils';\n\n// https://en.wikipedia.org/wiki/Web_Mercator_projection\nconst DEFAULT_MAX_LATITUDE = 85.051129;\n\n// https://user-images.githubusercontent.com/2059298/78465769-938b7a00-76ae-11ea-9b95-1f4c26425ab9.png\nexport function cutPolylineByMercatorBounds(positions, options = {}) {\n  const {size = 2, startIndex = 0, endIndex = positions.length, normalize = true} = options;\n\n  // Remap longitudes so that each segment takes the shorter path\n  const newPositions = positions.slice(startIndex, endIndex);\n  wrapLongitudesForShortestPath(newPositions, size, 0, endIndex - startIndex);\n\n  const parts = cutPolylineByGrid(newPositions, {\n    size,\n    broken: true,\n    gridResolution: 360,\n    gridOffset: [-180, -180]\n  });\n\n  if (normalize) {\n    // Each part is guaranteed to be in a single copy of the world\n    // Map longitudes back to [-180, 180]\n    for (const part of parts) {\n      shiftLongitudesIntoRange(part, size);\n    }\n  }\n  return parts;\n}\n\n// https://user-images.githubusercontent.com/2059298/78465770-94241080-76ae-11ea-809a-6a8534dac1d9.png\nexport function cutPolygonByMercatorBounds(positions, holeIndices, options = {}) {\n  const {size = 2, normalize = true, edgeTypes = false} = options;\n  holeIndices = holeIndices || [];\n  const newPositions = [];\n  const newHoleIndices = [];\n  let srcStartIndex = 0;\n  let targetIndex = 0;\n\n  for (let ringIndex = 0; ringIndex <= holeIndices.length; ringIndex++) {\n    // srcStartIndex/srcEndIndex define the ring in the original positions\n    const srcEndIndex = holeIndices[ringIndex] || positions.length;\n    // targetStartIndex/targetIndex define the ring in newPositions\n    const targetStartIndex = targetIndex;\n\n    // In case the ring contains a pole (e.g. Antarctica), we'll have to insert vertices\n    // The insertion point is defined by the vertex closest to the pole\n    // Split the the ring by the insertion point when copying to newPositions\n    const splitIndex = findSplitIndex(positions, size, srcStartIndex, srcEndIndex);\n    for (let i = splitIndex; i < srcEndIndex; i++) {\n      newPositions[targetIndex++] = positions[i];\n    }\n    for (let i = srcStartIndex; i < splitIndex; i++) {\n      newPositions[targetIndex++] = positions[i];\n    }\n\n    // Remap longitudes so that each segment takes the shorter path\n    wrapLongitudesForShortestPath(newPositions, size, targetStartIndex, targetIndex);\n\n    // Handle the case when the ring contains a pole\n    insertPoleVertices(newPositions, size, targetStartIndex, targetIndex, options.maxLatitude);\n\n    srcStartIndex = srcEndIndex;\n    newHoleIndices[ringIndex] = targetIndex;\n  }\n  newHoleIndices.pop();\n\n  const parts = cutPolygonByGrid(newPositions, newHoleIndices, {\n    size,\n    gridResolution: 360,\n    gridOffset: [-180, -180],\n    edgeTypes\n  });\n\n  if (normalize) {\n    // Each part is guaranteed to be in a single copy of the world\n    // Map longitudes back to [-180, 180]\n    for (const part of parts) {\n      shiftLongitudesIntoRange(part.positions, size);\n    }\n  }\n  return parts;\n}\n\n/* Helpers */\n\n// See comments for insertPoleVertices\nfunction findSplitIndex(positions, size, startIndex, endIndex) {\n  let maxLat = -1;\n  let pointIndex = -1;\n  for (let i = startIndex + 1; i < endIndex; i += size) {\n    const lat = Math.abs(positions[i]);\n    if (lat > maxLat) {\n      maxLat = lat;\n      pointIndex = i - 1;\n    }\n  }\n  return pointIndex;\n}\n\n// https://user-images.githubusercontent.com/2059298/78857483-5987e400-79de-11ea-98fc-0631287a8431.png\n//\n// If the polygon contains a pole, to tesselate it correctly, we need to insert the edge\n// of map into the polygon. This requires adding two vertices that represent the pole, by\n// drawing a perpendicular line to the Mercator map edge from a selected vertex on the ring.\n//\n// We select the insertion position carefully so that the inserted line segments do not\n// intersect with the ring itself. This is ensured by findSplitIndex, which returns the\n// vertex closest to the pole.\nfunction insertPoleVertices(\n  positions,\n  size,\n  startIndex,\n  endIndex,\n  maxLatitude = DEFAULT_MAX_LATITUDE\n) {\n  // Check if the ring contains a pole\n  const firstLng = positions[startIndex];\n  const lastLng = positions[endIndex - size];\n  if (Math.abs(firstLng - lastLng) > 180) {\n    // The ring does not make a round trip\n    // Add the nearest pole to the vertices so that the polygon tesselates correctly\n    const p = getPointAtIndex(positions, 0, size, startIndex);\n    // Copy the first vertex to the world of the last vertex\n    p[0] += Math.round((lastLng - firstLng) / 360) * 360;\n    push(positions, p);\n    // Project the copied vertex to the edge of the map\n    p[1] = Math.sign(p[1]) * maxLatitude;\n    push(positions, p);\n    // Project the first vertex to the edge of the map\n    p[0] = firstLng;\n    push(positions, p);\n  }\n}\n\nfunction wrapLongitudesForShortestPath(positions, size, startIndex, endIndex) {\n  let prevLng = positions[0];\n  let lng;\n  for (let i = startIndex; i < endIndex; i += size) {\n    lng = positions[i];\n    const delta = lng - prevLng;\n    if (delta > 180 || delta < -180) {\n      lng -= Math.round(delta / 360) * 360;\n    }\n    positions[i] = prevLng = lng;\n  }\n}\n\nfunction shiftLongitudesIntoRange(positions, size) {\n  let refLng;\n  const pointCount = positions.length / size;\n\n  // Find a longitude that is not on the edge of a world\n  // Which we will use to determine which world copy it is\n  for (let i = 0; i < pointCount; i++) {\n    refLng = positions[i * size];\n    if ((refLng + 180) % 360 !== 0) {\n      break;\n    }\n  }\n\n  const delta = -Math.round(refLng / 360) * 360;\n  if (delta === 0) {\n    return;\n  }\n  for (let i = 0; i < pointCount; i++) {\n    positions[i * size] += delta;\n  }\n}\n"],"file":"cut-by-mercator-bounds.js"}
+{"version":3,"sources":["../../src/cut-by-mercator-bounds.ts"],"names":["cutPolylineByGrid","cutPolygonByGrid","getPointAtIndex","push","DEFAULT_MAX_LATITUDE","cutPolylineByMercatorBounds","positions","options","size","startIndex","endIndex","length","normalize","newPositions","slice","wrapLongitudesForShortestPath","parts","broken","gridResolution","gridOffset","part","shiftLongitudesIntoRange","cutPolygonByMercatorBounds","holeIndices","edgeTypes","newHoleIndices","srcStartIndex","targetIndex","ringIndex","srcEndIndex","targetStartIndex","splitIndex","findSplitIndex","i","insertPoleVertices","maxLatitude","pop","maxLat","pointIndex","lat","Math","abs","firstLng","lastLng","p","round","sign","prevLng","lng","delta","refLng","pointCount"],"mappings":"AAAA,SAAQA,iBAAR,EAA2BC,gBAA3B,QAAkD,eAAlD;AACA,SAAQC,eAAR,EAAyBC,IAAzB,QAAoC,SAApC;AAKA,MAAMC,oBAAoB,GAAG,SAA7B;AAGA,OAAO,SAASC,2BAAT,CACLC,SADK,EAELC,OAFK,EAQO;AACZ,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWC,IAAAA,UAAU,GAAG,CAAxB;AAA2BC,IAAAA,QAAQ,GAAGJ,SAAS,CAACK,MAAhD;AAAwDC,IAAAA,SAAS,GAAG;AAApE,MAA4EL,OAAO,IAAI,EAA7F;AAGA,QAAMM,YAAY,GAAGP,SAAS,CAACQ,KAAV,CAAgBL,UAAhB,EAA4BC,QAA5B,CAArB;AACAK,EAAAA,6BAA6B,CAACF,YAAD,EAAeL,IAAf,EAAqB,CAArB,EAAwBE,QAAQ,GAAGD,UAAnC,CAA7B;AAEA,QAAMO,KAAK,GAAGhB,iBAAiB,CAACa,YAAD,EAAe;AAC5CL,IAAAA,IAD4C;AAE5CS,IAAAA,MAAM,EAAE,IAFoC;AAG5CC,IAAAA,cAAc,EAAE,GAH4B;AAI5CC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR;AAJgC,GAAf,CAA/B;;AAOA,MAAIP,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AACxBK,MAAAA,wBAAwB,CAACD,IAAD,EAAOZ,IAAP,CAAxB;AACD;AACF;;AACD,SAAOQ,KAAP;AACD;AAGD,OAAO,SAASM,0BAAT,CACLhB,SADK,EAELiB,WAA4B,GAAG,IAF1B,EAGLhB,OAHK,EASM;AACX,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWI,IAAAA,SAAS,GAAG,IAAvB;AAA6BY,IAAAA,SAAS,GAAG;AAAzC,MAAkDjB,OAAO,IAAI,EAAnE;AACAgB,EAAAA,WAAW,GAAGA,WAAW,IAAI,EAA7B;AACA,QAAMV,YAAsB,GAAG,EAA/B;AACA,QAAMY,cAAwB,GAAG,EAAjC;AACA,MAAIC,aAAa,GAAG,CAApB;AACA,MAAIC,WAAW,GAAG,CAAlB;;AAEA,OAAK,IAAIC,SAAS,GAAG,CAArB,EAAwBA,SAAS,IAAIL,WAAW,CAACZ,MAAjD,EAAyDiB,SAAS,EAAlE,EAAsE;AAEpE,UAAMC,WAAW,GAAGN,WAAW,CAACK,SAAD,CAAX,IAA0BtB,SAAS,CAACK,MAAxD;AAEA,UAAMmB,gBAAgB,GAAGH,WAAzB;AAKA,UAAMI,UAAU,GAAGC,cAAc,CAAC1B,SAAD,EAAYE,IAAZ,EAAkBkB,aAAlB,EAAiCG,WAAjC,CAAjC;;AACA,SAAK,IAAII,CAAC,GAAGF,UAAb,EAAyBE,CAAC,GAAGJ,WAA7B,EAA0CI,CAAC,EAA3C,EAA+C;AAC7CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,CAAD,CAAvC;AACD;;AACD,SAAK,IAAIA,CAAC,GAAGP,aAAb,EAA4BO,CAAC,GAAGF,UAAhC,EAA4CE,CAAC,EAA7C,EAAiD;AAC/CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,CAAD,CAAvC;AACD;;AAGDlB,IAAAA,6BAA6B,CAACF,YAAD,EAAeL,IAAf,EAAqBsB,gBAArB,EAAuCH,WAAvC,CAA7B;AAGAO,IAAAA,kBAAkB,CAACrB,YAAD,EAAeL,IAAf,EAAqBsB,gBAArB,EAAuCH,WAAvC,EAAoDpB,OAApD,aAAoDA,OAApD,uBAAoDA,OAAO,CAAE4B,WAA7D,CAAlB;AAEAT,IAAAA,aAAa,GAAGG,WAAhB;AACAJ,IAAAA,cAAc,CAACG,SAAD,CAAd,GAA4BD,WAA5B;AACD;;AACDF,EAAAA,cAAc,CAACW,GAAf;AAEA,QAAMpB,KAAK,GAAGf,gBAAgB,CAACY,YAAD,EAAeY,cAAf,EAA+B;AAC3DjB,IAAAA,IAD2D;AAE3DU,IAAAA,cAAc,EAAE,GAF2C;AAG3DC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR,CAH+C;AAI3DK,IAAAA;AAJ2D,GAA/B,CAA9B;;AAOA,MAAIZ,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AACxBK,MAAAA,wBAAwB,CAACD,IAAI,CAACd,SAAN,EAAiBE,IAAjB,CAAxB;AACD;AACF;;AACD,SAAOQ,KAAP;AACD;;AAKD,SAASgB,cAAT,CACE1B,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKU;AACR,MAAI2B,MAAM,GAAG,CAAC,CAAd;AACA,MAAIC,UAAU,GAAG,CAAC,CAAlB;;AACA,OAAK,IAAIL,CAAC,GAAGxB,UAAU,GAAG,CAA1B,EAA6BwB,CAAC,GAAGvB,QAAjC,EAA2CuB,CAAC,IAAIzB,IAAhD,EAAsD;AACpD,UAAM+B,GAAG,GAAGC,IAAI,CAACC,GAAL,CAASnC,SAAS,CAAC2B,CAAD,CAAlB,CAAZ;;AACA,QAAIM,GAAG,GAAGF,MAAV,EAAkB;AAChBA,MAAAA,MAAM,GAAGE,GAAT;AACAD,MAAAA,UAAU,GAAGL,CAAC,GAAG,CAAjB;AACD;AACF;;AACD,SAAOK,UAAP;AACD;;AAWD,SAASJ,kBAAT,CACE5B,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKEyB,WAAmB,GAAG/B,oBALxB,EAMQ;AAEN,QAAMsC,QAAQ,GAAGpC,SAAS,CAACG,UAAD,CAA1B;AACA,QAAMkC,OAAO,GAAGrC,SAAS,CAACI,QAAQ,GAAGF,IAAZ,CAAzB;;AACA,MAAIgC,IAAI,CAACC,GAAL,CAASC,QAAQ,GAAGC,OAApB,IAA+B,GAAnC,EAAwC;AAGtC,UAAMC,CAAC,GAAG1C,eAAe,CAACI,SAAD,EAAY,CAAZ,EAAeE,IAAf,EAAqBC,UAArB,CAAzB;AAEAmC,IAAAA,CAAC,CAAC,CAAD,CAAD,IAAQJ,IAAI,CAACK,KAAL,CAAW,CAACF,OAAO,GAAGD,QAAX,IAAuB,GAAlC,IAAyC,GAAjD;AACAvC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOJ,IAAI,CAACM,IAAL,CAAUF,CAAC,CAAC,CAAD,CAAX,IAAkBT,WAAzB;AACAhC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOF,QAAP;AACAvC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AACD;AACF;;AAED,SAAS7B,6BAAT,CACET,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKQ;AACN,MAAIqC,OAAe,GAAGzC,SAAS,CAAC,CAAD,CAA/B;AACA,MAAI0C,GAAJ;;AACA,OAAK,IAAIf,CAAC,GAAGxB,UAAb,EAAyBwB,CAAC,GAAGvB,QAA7B,EAAuCuB,CAAC,IAAIzB,IAA5C,EAAkD;AAChDwC,IAAAA,GAAG,GAAG1C,SAAS,CAAC2B,CAAD,CAAf;AACA,UAAMgB,KAAK,GAAGD,GAAG,GAAGD,OAApB;;AACA,QAAIE,KAAK,GAAG,GAAR,IAAeA,KAAK,GAAG,CAAC,GAA5B,EAAiC;AAC/BD,MAAAA,GAAG,IAAIR,IAAI,CAACK,KAAL,CAAWI,KAAK,GAAG,GAAnB,IAA0B,GAAjC;AACD;;AACD3C,IAAAA,SAAS,CAAC2B,CAAD,CAAT,GAAec,OAAO,GAAGC,GAAzB;AACD;AACF;;AAED,SAAS3B,wBAAT,CAAkCf,SAAlC,EAA2DE,IAA3D,EAA+E;AAC7E,MAAI0C,MAAJ;AACA,QAAMC,UAAU,GAAG7C,SAAS,CAACK,MAAV,GAAmBH,IAAtC;;AAIA,OAAK,IAAIyB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGkB,UAApB,EAAgClB,CAAC,EAAjC,EAAqC;AACnCiB,IAAAA,MAAM,GAAG5C,SAAS,CAAC2B,CAAC,GAAGzB,IAAL,CAAlB;;AACA,QAAI,CAAC0C,MAAM,GAAG,GAAV,IAAiB,GAAjB,KAAyB,CAA7B,EAAgC;AAC9B;AACD;AACF;;AAED,QAAMD,KAAK,GAAG,CAACT,IAAI,CAACK,KAAL,CAAWK,MAAM,GAAG,GAApB,CAAD,GAA4B,GAA1C;;AACA,MAAID,KAAK,KAAK,CAAd,EAAiB;AACf;AACD;;AACD,OAAK,IAAIhB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGkB,UAApB,EAAgClB,CAAC,EAAjC,EAAqC;AACnC3B,IAAAA,SAAS,CAAC2B,CAAC,GAAGzB,IAAL,CAAT,IAAuByC,KAAvB;AACD;AACF","sourcesContent":["import {cutPolylineByGrid, cutPolygonByGrid} from './cut-by-grid';\nimport {getPointAtIndex, push} from './utils';\nimport type {Polygon} from './cut-by-grid';\nimport type {NumericArray} from '@math.gl/core';\n\n// https://en.wikipedia.org/wiki/Web_Mercator_projection\nconst DEFAULT_MAX_LATITUDE = 85.051129;\n\n/** https://user-images.githubusercontent.com/2059298/78465769-938b7a00-76ae-11ea-9b95-1f4c26425ab9.png */\nexport function cutPolylineByMercatorBounds(\n  positions: NumericArray,\n  options?: {\n    size?: number;\n    startIndex?: number;\n    endIndex?: number;\n    normalize?: boolean;\n  }\n): number[][] {\n  const {size = 2, startIndex = 0, endIndex = positions.length, normalize = true} = options || {};\n\n  // Remap longitudes so that each segment takes the shorter path\n  const newPositions = positions.slice(startIndex, endIndex);\n  wrapLongitudesForShortestPath(newPositions, size, 0, endIndex - startIndex);\n\n  const parts = cutPolylineByGrid(newPositions, {\n    size,\n    broken: true,\n    gridResolution: 360,\n    gridOffset: [-180, -180]\n  }) as number[][];\n\n  if (normalize) {\n    // Each part is guaranteed to be in a single copy of the world\n    // Map longitudes back to [-180, 180]\n    for (const part of parts) {\n      shiftLongitudesIntoRange(part, size);\n    }\n  }\n  return parts;\n}\n\n/** https://user-images.githubusercontent.com/2059298/78465770-94241080-76ae-11ea-809a-6a8534dac1d9.png */\nexport function cutPolygonByMercatorBounds(\n  positions: number[],\n  holeIndices: number[] | null = null,\n  options?: {\n    size?: number;\n    normalize?: boolean;\n    maxLatitude?: number;\n    edgeTypes?: boolean;\n  }\n): Polygon[] {\n  const {size = 2, normalize = true, edgeTypes = false} = options || {};\n  holeIndices = holeIndices || [];\n  const newPositions: number[] = [];\n  const newHoleIndices: number[] = [];\n  let srcStartIndex = 0;\n  let targetIndex = 0;\n\n  for (let ringIndex = 0; ringIndex <= holeIndices.length; ringIndex++) {\n    // srcStartIndex/srcEndIndex define the ring in the original positions\n    const srcEndIndex = holeIndices[ringIndex] || positions.length;\n    // targetStartIndex/targetIndex define the ring in newPositions\n    const targetStartIndex = targetIndex;\n\n    // In case the ring contains a pole (e.g. Antarctica), we'll have to insert vertices\n    // The insertion point is defined by the vertex closest to the pole\n    // Split the the ring by the insertion point when copying to newPositions\n    const splitIndex = findSplitIndex(positions, size, srcStartIndex, srcEndIndex);\n    for (let i = splitIndex; i < srcEndIndex; i++) {\n      newPositions[targetIndex++] = positions[i];\n    }\n    for (let i = srcStartIndex; i < splitIndex; i++) {\n      newPositions[targetIndex++] = positions[i];\n    }\n\n    // Remap longitudes so that each segment takes the shorter path\n    wrapLongitudesForShortestPath(newPositions, size, targetStartIndex, targetIndex);\n\n    // Handle the case when the ring contains a pole\n    insertPoleVertices(newPositions, size, targetStartIndex, targetIndex, options?.maxLatitude);\n\n    srcStartIndex = srcEndIndex;\n    newHoleIndices[ringIndex] = targetIndex;\n  }\n  newHoleIndices.pop();\n\n  const parts = cutPolygonByGrid(newPositions, newHoleIndices, {\n    size,\n    gridResolution: 360,\n    gridOffset: [-180, -180],\n    edgeTypes\n  });\n\n  if (normalize) {\n    // Each part is guaranteed to be in a single copy of the world\n    // Map longitudes back to [-180, 180]\n    for (const part of parts) {\n      shiftLongitudesIntoRange(part.positions, size);\n    }\n  }\n  return parts;\n}\n\n/* Helpers */\n\n// See comments for insertPoleVertices\nfunction findSplitIndex(\n  positions: number[],\n  size: number,\n  startIndex: number,\n  endIndex: number\n): number {\n  let maxLat = -1;\n  let pointIndex = -1;\n  for (let i = startIndex + 1; i < endIndex; i += size) {\n    const lat = Math.abs(positions[i]);\n    if (lat > maxLat) {\n      maxLat = lat;\n      pointIndex = i - 1;\n    }\n  }\n  return pointIndex;\n}\n\n// https://user-images.githubusercontent.com/2059298/78857483-5987e400-79de-11ea-98fc-0631287a8431.png\n//\n// If the polygon contains a pole, to tesselate it correctly, we need to insert the edge\n// of map into the polygon. This requires adding two vertices that represent the pole, by\n// drawing a perpendicular line to the Mercator map edge from a selected vertex on the ring.\n//\n// We select the insertion position carefully so that the inserted line segments do not\n// intersect with the ring itself. This is ensured by findSplitIndex, which returns the\n// vertex closest to the pole.\nfunction insertPoleVertices(\n  positions: number[],\n  size: number,\n  startIndex: number,\n  endIndex: number,\n  maxLatitude: number = DEFAULT_MAX_LATITUDE\n): void {\n  // Check if the ring contains a pole\n  const firstLng = positions[startIndex];\n  const lastLng = positions[endIndex - size];\n  if (Math.abs(firstLng - lastLng) > 180) {\n    // The ring does not make a round trip\n    // Add the nearest pole to the vertices so that the polygon tesselates correctly\n    const p = getPointAtIndex(positions, 0, size, startIndex);\n    // Copy the first vertex to the world of the last vertex\n    p[0] += Math.round((lastLng - firstLng) / 360) * 360;\n    push(positions, p);\n    // Project the copied vertex to the edge of the map\n    p[1] = Math.sign(p[1]) * maxLatitude;\n    push(positions, p);\n    // Project the first vertex to the edge of the map\n    p[0] = firstLng;\n    push(positions, p);\n  }\n}\n\nfunction wrapLongitudesForShortestPath(\n  positions: NumericArray,\n  size: number,\n  startIndex: number,\n  endIndex: number\n): void {\n  let prevLng: number = positions[0];\n  let lng: number;\n  for (let i = startIndex; i < endIndex; i += size) {\n    lng = positions[i];\n    const delta = lng - prevLng;\n    if (delta > 180 || delta < -180) {\n      lng -= Math.round(delta / 360) * 360;\n    }\n    positions[i] = prevLng = lng;\n  }\n}\n\nfunction shiftLongitudesIntoRange(positions: NumericArray, size: number): void {\n  let refLng: number;\n  const pointCount = positions.length / size;\n\n  // Find a longitude that is not on the edge of a world\n  // Which we will use to determine which world copy it is\n  for (let i = 0; i < pointCount; i++) {\n    refLng = positions[i * size];\n    if ((refLng + 180) % 360 !== 0) {\n      break;\n    }\n  }\n\n  const delta = -Math.round(refLng / 360) * 360;\n  if (delta === 0) {\n    return;\n  }\n  for (let i = 0; i < pointCount; i++) {\n    positions[i * size] += delta;\n  }\n}\n"],"file":"cut-by-mercator-bounds.js"}

package/dist/esm/earcut.js

@@ -1,9 +1,8 @@
 import { getPolygonSignedArea } from './polygon-utils';
-export function earcut(data, holeIndices, dim, areas) {
-  dim = dim || 2;
+export function earcut(positions, holeIndices, dim = 2, areas) {
   const hasHoles = holeIndices && holeIndices.length;
-  const outerLen = hasHoles ? holeIndices[0] * dim : data.length;
-  let outerNode = linkedList(data, 0, outerLen, dim, true, areas && areas[0]);
+  const outerLen = hasHoles ? holeIndices[0] * dim : positions.length;
+  let outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0]);
   const triangles = [];
   if (!outerNode || outerNode.next === outerNode.prev) return triangles;
   let invSize;
@@ -13,15 +12,15 @@ export function earcut(data, holeIndices, dim, areas) {
   let minY;
   let x;
   let y;
-  if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim, areas);
+  if (hasHoles) outerNode = eliminateHoles(positions, holeIndices, outerNode, dim, areas);
 
-  if (data.length > 80 * dim) {
-    minX = maxX = data[0];
-    minY = maxY = data[1];
+  if (positions.length > 80 * dim) {
+    minX = maxX = positions[0];
+    minY = maxY = positions[1];
 
     for (let i = dim; i < outerLen; i += dim) {
-      x = data[i];
-      y = data[i + 1];
+      x = positions[i];
+      y = positions[i + 1];
       if (x < minX) minX = x;
       if (y < minY) minY = y;
       if (x > maxX) maxX = x;