@math.gl/polygon 3.6.0-alpha.1 → 3.6.0-alpha.4

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

@@ -10,56 +10,82 @@ var _cutByGrid = require("./cut-by-grid");
 
 var _utils = require("./utils");
 
-const DEFAULT_MAX_LATITUDE = 85.051129;
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+
+var DEFAULT_MAX_LATITUDE = 85.051129;
 
 function cutPolylineByMercatorBounds(positions, options) {
-  const {
-    size = 2,
-    startIndex = 0,
-    endIndex = positions.length,
-    normalize = true
-  } = options || {};
-  const newPositions = positions.slice(startIndex, endIndex);
+  var _ref = options || {},
+      _ref$size = _ref.size,
+      size = _ref$size === void 0 ? 2 : _ref$size,
+      _ref$startIndex = _ref.startIndex,
+      startIndex = _ref$startIndex === void 0 ? 0 : _ref$startIndex,
+      _ref$endIndex = _ref.endIndex,
+      endIndex = _ref$endIndex === void 0 ? positions.length : _ref$endIndex,
+      _ref$normalize = _ref.normalize,
+      normalize = _ref$normalize === void 0 ? true : _ref$normalize;
+
+  var newPositions = positions.slice(startIndex, endIndex);
   wrapLongitudesForShortestPath(newPositions, size, 0, endIndex - startIndex);
-  const parts = (0, _cutByGrid.cutPolylineByGrid)(newPositions, {
-    size,
+  var parts = (0, _cutByGrid.cutPolylineByGrid)(newPositions, {
+    size: size,
     broken: true,
     gridResolution: 360,
     gridOffset: [-180, -180]
   });
 
   if (normalize) {
-    for (const part of parts) {
-      shiftLongitudesIntoRange(part, size);
+    var _iterator = _createForOfIteratorHelper(parts),
+        _step;
+
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var part = _step.value;
+        shiftLongitudesIntoRange(part, size);
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
     }
   }
 
   return parts;
 }
 
-function cutPolygonByMercatorBounds(positions, holeIndices = null, options) {
-  const {
-    size = 2,
-    normalize = true,
-    edgeTypes = false
-  } = options || {};
+function cutPolygonByMercatorBounds(positions) {
+  var holeIndices = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
+  var options = arguments.length > 2 ? arguments[2] : undefined;
+
+  var _ref2 = options || {},
+      _ref2$size = _ref2.size,
+      size = _ref2$size === void 0 ? 2 : _ref2$size,
+      _ref2$normalize = _ref2.normalize,
+      normalize = _ref2$normalize === void 0 ? true : _ref2$normalize,
+      _ref2$edgeTypes = _ref2.edgeTypes,
+      edgeTypes = _ref2$edgeTypes === void 0 ? false : _ref2$edgeTypes;
+
   holeIndices = holeIndices || [];
-  const newPositions = [];
-  const newHoleIndices = [];
-  let srcStartIndex = 0;
-  let targetIndex = 0;
+  var newPositions = [];
+  var newHoleIndices = [];
+  var srcStartIndex = 0;
+  var targetIndex = 0;
 
-  for (let ringIndex = 0; ringIndex <= holeIndices.length; ringIndex++) {
-    const srcEndIndex = holeIndices[ringIndex] || positions.length;
-    const targetStartIndex = targetIndex;
-    const splitIndex = findSplitIndex(positions, size, srcStartIndex, srcEndIndex);
+  for (var ringIndex = 0; ringIndex <= holeIndices.length; ringIndex++) {
+    var srcEndIndex = holeIndices[ringIndex] || positions.length;
+    var targetStartIndex = targetIndex;
+    var splitIndex = findSplitIndex(positions, size, srcStartIndex, srcEndIndex);
 
-    for (let i = splitIndex; i < srcEndIndex; i++) {
+    for (var i = splitIndex; i < srcEndIndex; i++) {
       newPositions[targetIndex++] = positions[i];
     }
 
-    for (let i = srcStartIndex; i < splitIndex; i++) {
-      newPositions[targetIndex++] = positions[i];
+    for (var _i = srcStartIndex; _i < splitIndex; _i++) {
+      newPositions[targetIndex++] = positions[_i];
     }
 
     wrapLongitudesForShortestPath(newPositions, size, targetStartIndex, targetIndex);
@@ -69,16 +95,26 @@ function cutPolygonByMercatorBounds(positions, holeIndices = null, options) {
   }
 
   newHoleIndices.pop();
-  const parts = (0, _cutByGrid.cutPolygonByGrid)(newPositions, newHoleIndices, {
-    size,
+  var parts = (0, _cutByGrid.cutPolygonByGrid)(newPositions, newHoleIndices, {
+    size: size,
     gridResolution: 360,
     gridOffset: [-180, -180],
-    edgeTypes
+    edgeTypes: edgeTypes
   });
 
   if (normalize) {
-    for (const part of parts) {
-      shiftLongitudesIntoRange(part.positions, size);
+    var _iterator2 = _createForOfIteratorHelper(parts),
+        _step2;
+
+    try {
+      for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
+        var part = _step2.value;
+        shiftLongitudesIntoRange(part.positions, size);
+      }
+    } catch (err) {
+      _iterator2.e(err);
+    } finally {
+      _iterator2.f();
     }
   }
 
@@ -86,11 +122,11 @@ function cutPolygonByMercatorBounds(positions, holeIndices = null, options) {
 }
 
 function findSplitIndex(positions, size, startIndex, endIndex) {
-  let maxLat = -1;
-  let pointIndex = -1;
+  var maxLat = -1;
+  var pointIndex = -1;
 
-  for (let i = startIndex + 1; i < endIndex; i += size) {
-    const lat = Math.abs(positions[i]);
+  for (var i = startIndex + 1; i < endIndex; i += size) {
+    var lat = Math.abs(positions[i]);
 
     if (lat > maxLat) {
       maxLat = lat;
@@ -101,12 +137,13 @@ function findSplitIndex(positions, size, startIndex, endIndex) {
   return pointIndex;
 }
 
-function insertPoleVertices(positions, size, startIndex, endIndex, maxLatitude = DEFAULT_MAX_LATITUDE) {
-  const firstLng = positions[startIndex];
-  const lastLng = positions[endIndex - size];
+function insertPoleVertices(positions, size, startIndex, endIndex) {
+  var maxLatitude = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : DEFAULT_MAX_LATITUDE;
+  var firstLng = positions[startIndex];
+  var lastLng = positions[endIndex - size];
 
   if (Math.abs(firstLng - lastLng) > 180) {
-    const p = (0, _utils.getPointAtIndex)(positions, 0, size, startIndex);
+    var p = (0, _utils.getPointAtIndex)(positions, 0, size, startIndex);
     p[0] += Math.round((lastLng - firstLng) / 360) * 360;
     (0, _utils.push)(positions, p);
     p[1] = Math.sign(p[1]) * maxLatitude;
@@ -117,12 +154,12 @@ function insertPoleVertices(positions, size, startIndex, endIndex, maxLatitude =
 }
 
 function wrapLongitudesForShortestPath(positions, size, startIndex, endIndex) {
-  let prevLng = positions[0];
-  let lng;
+  var prevLng = positions[0];
+  var lng;
 
-  for (let i = startIndex; i < endIndex; i += size) {
+  for (var i = startIndex; i < endIndex; i += size) {
     lng = positions[i];
-    const delta = lng - prevLng;
+    var delta = lng - prevLng;
 
     if (delta > 180 || delta < -180) {
       lng -= Math.round(delta / 360) * 360;
@@ -133,10 +170,10 @@ function wrapLongitudesForShortestPath(positions, size, startIndex, endIndex) {
 }
 
 function shiftLongitudesIntoRange(positions, size) {
-  let refLng;
-  const pointCount = positions.length / size;
+  var refLng;
+  var pointCount = positions.length / size;
 
-  for (let i = 0; i < pointCount; i++) {
+  for (var i = 0; i < pointCount; i++) {
     refLng = positions[i * size];
 
     if ((refLng + 180) % 360 !== 0) {
@@ -144,14 +181,14 @@ function shiftLongitudesIntoRange(positions, size) {
     }
   }
 
-  const delta = -Math.round(refLng / 360) * 360;
+  var delta = -Math.round(refLng / 360) * 360;
 
   if (delta === 0) {
     return;
   }
 
-  for (let i = 0; i < pointCount; i++) {
-    positions[i * size] += delta;
+  for (var _i2 = 0; _i2 < pointCount; _i2++) {
+    positions[_i2 * size] += delta;
   }
 }
 //# sourceMappingURL=cut-by-mercator-bounds.js.map

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

@@ -1 +1 @@
-{"version":3,"sources":["../../src/cut-by-mercator-bounds.ts"],"names":["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;;AACA;;AAIA,MAAMA,oBAAoB,GAAG,SAA7B;;AAGO,SAASC,2BAAT,CACLC,SADK,EAELC,OAFK,EAQU;AACf,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,GAAG,kCAAkBH,YAAlB,EAAgC;AAC5CL,IAAAA,IAD4C;AAE5CS,IAAAA,MAAM,EAAE,IAFoC;AAG5CC,IAAAA,cAAc,EAAE,GAH4B;AAI5CC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR;AAJgC,GAAhC,CAAd;;AAOA,MAAIP,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AACxBK,MAAAA,wBAAwB,CAACD,IAAD,EAAOZ,IAAP,CAAxB;AACD;AACF;;AAED,SAAOQ,KAAP;AACD;;AAGM,SAASM,0BAAT,CACLhB,SADK,EAELiB,WAAiC,GAAG,IAF/B,EAGLhB,OAHK,EASW;AAChB,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,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,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,GAAG,iCAAiBH,YAAjB,EAA+BY,cAA/B,EAA+C;AAC3DjB,IAAAA,IAD2D;AAE3DU,IAAAA,cAAc,EAAE,GAF2C;AAG3DC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR,CAH+C;AAI3DK,IAAAA;AAJ2D,GAA/C,CAAd;;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,GAAG,4BAAgBtC,SAAhB,EAA2B,CAA3B,EAA8BE,IAA9B,EAAoCC,UAApC,CAAV;AAEAmC,IAAAA,CAAC,CAAC,CAAD,CAAD,IAAQJ,IAAI,CAACK,KAAL,CAAW,CAACF,OAAO,GAAGD,QAAX,IAAuB,GAAlC,IAAyC,GAAjD;AACA,qBAAKpC,SAAL,EAAgBsC,CAAhB;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOJ,IAAI,CAACM,IAAL,CAAUF,CAAC,CAAC,CAAD,CAAX,IAAkBT,WAAzB;AACA,qBAAK7B,SAAL,EAAgBsC,CAAhB;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOF,QAAP;AACA,qBAAKpC,SAAL,EAAgBsC,CAAhB;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';\nimport type {Polygon} from './cut-by-grid';\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: Array<number>,\n  options?: {\n    size?: number;\n    startIndex?: number;\n    endIndex?: number;\n    normalize?: boolean;\n  }\n): Array<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  });\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  // @ts-expect-error\n  return parts;\n}\n\n/** https://user-images.githubusercontent.com/2059298/78465770-94241080-76ae-11ea-809a-6a8534dac1d9.png */\nexport function cutPolygonByMercatorBounds(\n  positions: Array<number>,\n  holeIndices: Array<number> | null = null,\n  options?: {\n    size?: number;\n    normalize?: boolean;\n    maxLatitude?: number;\n    edgeTypes?: boolean;\n  }\n): Array<Polygon> {\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":["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;;AACA;;;;;;;;AAKA,IAAMA,oBAAoB,GAAG,SAA7B;;AAGO,SAASC,2BAAT,CACLC,SADK,EAELC,OAFK,EAQO;AACZ,aAAkFA,OAAO,IAAI,EAA7F;AAAA,uBAAOC,IAAP;AAAA,MAAOA,IAAP,0BAAc,CAAd;AAAA,6BAAiBC,UAAjB;AAAA,MAAiBA,UAAjB,gCAA8B,CAA9B;AAAA,2BAAiCC,QAAjC;AAAA,MAAiCA,QAAjC,8BAA4CJ,SAAS,CAACK,MAAtD;AAAA,4BAA8DC,SAA9D;AAAA,MAA8DA,SAA9D,+BAA0E,IAA1E;;AAGA,MAAMC,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,MAAMO,KAAK,GAAG,kCAAkBH,YAAlB,EAAgC;AAC5CL,IAAAA,IAAI,EAAJA,IAD4C;AAE5CS,IAAAA,MAAM,EAAE,IAFoC;AAG5CC,IAAAA,cAAc,EAAE,GAH4B;AAI5CC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR;AAJgC,GAAhC,CAAd;;AAOA,MAAIP,SAAJ,EAAe;AAAA,+CAGMI,KAHN;AAAA;;AAAA;AAGb,0DAA0B;AAAA,YAAfI,IAAe;AACxBC,QAAAA,wBAAwB,CAACD,IAAD,EAAOZ,IAAP,CAAxB;AACD;AALY;AAAA;AAAA;AAAA;AAAA;AAMd;;AACD,SAAOQ,KAAP;AACD;;AAGM,SAASM,0BAAT,CACLhB,SADK,EASM;AAAA,MAPXiB,WAOW,uEAPoB,IAOpB;AAAA,MANXhB,OAMW;;AACX,cAAwDA,OAAO,IAAI,EAAnE;AAAA,yBAAOC,IAAP;AAAA,MAAOA,IAAP,2BAAc,CAAd;AAAA,8BAAiBI,SAAjB;AAAA,MAAiBA,SAAjB,gCAA6B,IAA7B;AAAA,8BAAmCY,SAAnC;AAAA,MAAmCA,SAAnC,gCAA+C,KAA/C;;AACAD,EAAAA,WAAW,GAAGA,WAAW,IAAI,EAA7B;AACA,MAAMV,YAAsB,GAAG,EAA/B;AACA,MAAMY,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,QAAMC,WAAW,GAAGN,WAAW,CAACK,SAAD,CAAX,IAA0BtB,SAAS,CAACK,MAAxD;AAEA,QAAMmB,gBAAgB,GAAGH,WAAzB;AAKA,QAAMI,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,EAAC,GAAGP,aAAb,EAA4BO,EAAC,GAAGF,UAAhC,EAA4CE,EAAC,EAA7C,EAAiD;AAC/CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,EAAD,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,MAAMpB,KAAK,GAAG,iCAAiBH,YAAjB,EAA+BY,cAA/B,EAA+C;AAC3DjB,IAAAA,IAAI,EAAJA,IAD2D;AAE3DU,IAAAA,cAAc,EAAE,GAF2C;AAG3DC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR,CAH+C;AAI3DK,IAAAA,SAAS,EAATA;AAJ2D,GAA/C,CAAd;;AAOA,MAAIZ,SAAJ,EAAe;AAAA,gDAGMI,KAHN;AAAA;;AAAA;AAGb,6DAA0B;AAAA,YAAfI,IAAe;AACxBC,QAAAA,wBAAwB,CAACD,IAAI,CAACd,SAAN,EAAiBE,IAAjB,CAAxB;AACD;AALY;AAAA;AAAA;AAAA;AAAA;AAMd;;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,QAAM+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,EAMQ;AAAA,MADNyB,WACM,uEADgB/B,oBAChB;AAEN,MAAMsC,QAAQ,GAAGpC,SAAS,CAACG,UAAD,CAA1B;AACA,MAAMkC,OAAO,GAAGrC,SAAS,CAACI,QAAQ,GAAGF,IAAZ,CAAzB;;AACA,MAAIgC,IAAI,CAACC,GAAL,CAASC,QAAQ,GAAGC,OAApB,IAA+B,GAAnC,EAAwC;AAGtC,QAAMC,CAAC,GAAG,4BAAgBtC,SAAhB,EAA2B,CAA3B,EAA8BE,IAA9B,EAAoCC,UAApC,CAAV;AAEAmC,IAAAA,CAAC,CAAC,CAAD,CAAD,IAAQJ,IAAI,CAACK,KAAL,CAAW,CAACF,OAAO,GAAGD,QAAX,IAAuB,GAAlC,IAAyC,GAAjD;AACA,qBAAKpC,SAAL,EAAgBsC,CAAhB;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOJ,IAAI,CAACM,IAAL,CAAUF,CAAC,CAAC,CAAD,CAAX,IAAkBT,WAAzB;AACA,qBAAK7B,SAAL,EAAgBsC,CAAhB;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOF,QAAP;AACA,qBAAKpC,SAAL,EAAgBsC,CAAhB;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,QAAMgB,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,MAAMC,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,MAAMD,KAAK,GAAG,CAACT,IAAI,CAACK,KAAL,CAAWK,MAAM,GAAG,GAApB,CAAD,GAA4B,GAA1C;;AACA,MAAID,KAAK,KAAK,CAAd,EAAiB;AACf;AACD;;AACD,OAAK,IAAIhB,GAAC,GAAG,CAAb,EAAgBA,GAAC,GAAGkB,UAApB,EAAgClB,GAAC,EAAjC,EAAqC;AACnC3B,IAAAA,SAAS,CAAC2B,GAAC,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/es5/earcut.js

@@ -7,26 +7,28 @@ exports.earcut = earcut;
 
 var _polygonUtils = require("./polygon-utils");
 
-function earcut(positions, holeIndices, dim = 2, areas) {
-  const hasHoles = holeIndices && holeIndices.length;
-  const outerLen = hasHoles ? holeIndices[0] * dim : positions.length;
-  let outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0]);
-  const triangles = [];
+function earcut(positions, holeIndices) {
+  var dim = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 2;
+  var areas = arguments.length > 3 ? arguments[3] : undefined;
+  var hasHoles = holeIndices && holeIndices.length;
+  var outerLen = hasHoles ? holeIndices[0] * dim : positions.length;
+  var outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0]);
+  var triangles = [];
   if (!outerNode || outerNode.next === outerNode.prev) return triangles;
-  let invSize;
-  let maxX;
-  let maxY;
-  let minX;
-  let minY;
-  let x;
-  let y;
+  var invSize;
+  var maxX;
+  var maxY;
+  var minX;
+  var minY;
+  var x;
+  var y;
   if (hasHoles) outerNode = eliminateHoles(positions, holeIndices, outerNode, dim, areas);
 
   if (positions.length > 80 * dim) {
     minX = maxX = positions[0];
     minY = maxY = positions[1];
 
-    for (let i = dim; i < outerLen; i += dim) {
+    for (var i = dim; i < outerLen; i += dim) {
       x = positions[i];
       y = positions[i + 1];
       if (x < minX) minX = x;
@@ -44,21 +46,25 @@ function earcut(positions, holeIndices, dim = 2, areas) {
 }
 
 function linkedList(data, start, end, dim, clockwise, area) {
-  let i;
-  let last;
+  var i;
+  var last;
 
   if (area === undefined) {
     area = (0, _polygonUtils.getPolygonSignedArea)(data, {
-      start,
-      end,
+      start: start,
+      end: end,
       size: dim
     });
   }
 
   if (clockwise === area < 0) {
-    for (i = start; i < end; i += dim) last = insertNode(i, data[i], data[i + 1], last);
+    for (i = start; i < end; i += dim) {
+      last = insertNode(i, data[i], data[i + 1], last);
+    }
   } else {
-    for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], last);
+    for (i = end - dim; i >= start; i -= dim) {
+      last = insertNode(i, data[i], data[i + 1], last);
+    }
   }
 
   if (last && equals(last, last.next)) {
@@ -72,8 +78,8 @@ function linkedList(data, start, end, dim, clockwise, area) {
 function filterPoints(start, end) {
   if (!start) return start;
   if (!end) end = start;
-  let p = start;
-  let again;
+  var p = start;
+  var again;
 
   do {
     again = false;
@@ -94,9 +100,9 @@ function filterPoints(start, end) {
 function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
   if (!ear) return;
   if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
-  let stop = ear;
-  let prev;
-  let next;
+  var stop = ear;
+  var prev;
+  var next;
 
   while (ear.prev !== ear.next) {
     prev = ear.prev;
@@ -130,11 +136,11 @@ function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
 }
 
 function isEar(ear) {
-  const a = ear.prev;
-  const b = ear;
-  const c = ear.next;
+  var a = ear.prev;
+  var b = ear;
+  var c = ear.next;
   if (area(a, b, c) >= 0) return false;
-  let p = ear.next.next;
+  var p = ear.next.next;
 
   while (p !== ear.prev) {
     if (pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
@@ -145,18 +151,18 @@ function isEar(ear) {
 }
 
 function isEarHashed(ear, minX, minY, invSize) {
-  const a = ear.prev;
-  const b = ear;
-  const c = ear.next;
+  var a = ear.prev;
+  var b = ear;
+  var c = ear.next;
   if (area(a, b, c) >= 0) return false;
-  const minTX = a.x < b.x ? a.x < c.x ? a.x : c.x : b.x < c.x ? b.x : c.x;
-  const minTY = a.y < b.y ? a.y < c.y ? a.y : c.y : b.y < c.y ? b.y : c.y;
-  const maxTX = a.x > b.x ? a.x > c.x ? a.x : c.x : b.x > c.x ? b.x : c.x;
-  const maxTY = a.y > b.y ? a.y > c.y ? a.y : c.y : b.y > c.y ? b.y : c.y;
-  const minZ = zOrder(minTX, minTY, minX, minY, invSize);
-  const maxZ = zOrder(maxTX, maxTY, minX, minY, invSize);
-  let p = ear.prevZ;
-  let n = ear.nextZ;
+  var minTX = a.x < b.x ? a.x < c.x ? a.x : c.x : b.x < c.x ? b.x : c.x;
+  var minTY = a.y < b.y ? a.y < c.y ? a.y : c.y : b.y < c.y ? b.y : c.y;
+  var maxTX = a.x > b.x ? a.x > c.x ? a.x : c.x : b.x > c.x ? b.x : c.x;
+  var maxTY = a.y > b.y ? a.y > c.y ? a.y : c.y : b.y > c.y ? b.y : c.y;
+  var minZ = zOrder(minTX, minTY, minX, minY, invSize);
+  var maxZ = zOrder(maxTX, maxTY, minX, minY, invSize);
+  var p = ear.prevZ;
+  var n = ear.nextZ;
 
   while (p && p.z >= minZ && n && n.z <= maxZ) {
     if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
@@ -179,11 +185,11 @@ function isEarHashed(ear, minX, minY, invSize) {
 }
 
 function cureLocalIntersections(start, triangles, dim) {
-  let p = start;
+  var p = start;
 
   do {
-    const a = p.prev;
-    const b = p.next.next;
+    var a = p.prev;
+    var b = p.next.next;
 
     if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
       triangles.push(a.i / dim);
@@ -201,14 +207,14 @@ function cureLocalIntersections(start, triangles, dim) {
 }
 
 function splitEarcut(start, triangles, dim, minX, minY, invSize) {
-  let a = start;
+  var a = start;
 
   do {
-    let b = a.next.next;
+    var b = a.next.next;
 
     while (b !== a.prev) {
       if (a.i !== b.i && isValidDiagonal(a, b)) {
-        let c = splitPolygon(a, b);
+        var c = splitPolygon(a, b);
         a = filterPoints(a, a.next);
         c = filterPoints(c, c.next);
         earcutLinked(a, triangles, dim, minX, minY, invSize);
@@ -224,12 +230,12 @@ function splitEarcut(start, triangles, dim, minX, minY, invSize) {
 }
 
 function eliminateHoles(data, holeIndices, outerNode, dim, areas) {
-  const queue = [];
-  let i;
-  let len;
-  let start;
-  let end;
-  let list;
+  var queue = [];
+  var i;
+  var len;
+  var start;
+  var end;
+  var list;
 
   for (i = 0, len = holeIndices.length; i < len; i++) {
     start = holeIndices[i] * dim;
@@ -257,22 +263,22 @@ function eliminateHole(hole, outerNode) {
   outerNode = findHoleBridge(hole, outerNode);
 
   if (outerNode) {
-    const b = splitPolygon(outerNode, hole);
+    var b = splitPolygon(outerNode, hole);
     filterPoints(outerNode, outerNode.next);
     filterPoints(b, b.next);
   }
 }
 
 function findHoleBridge(hole, outerNode) {
-  let p = outerNode;
-  const hx = hole.x;
-  const hy = hole.y;
-  let qx = -Infinity;
-  let m;
+  var p = outerNode;
+  var hx = hole.x;
+  var hy = hole.y;
+  var qx = -Infinity;
+  var m;
 
   do {
     if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
-      const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
+      var x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
 
       if (x <= hx && x > qx) {
         qx = x;
@@ -291,11 +297,11 @@ function findHoleBridge(hole, outerNode) {
 
   if (!m) return null;
   if (hx === qx) return m;
-  const stop = m;
-  const mx = m.x;
-  const my = m.y;
-  let tanMin = Infinity;
-  let tan;
+  var stop = m;
+  var mx = m.x;
+  var my = m.y;
+  var tanMin = Infinity;
+  var tan;
   p = m;
 
   do {
@@ -319,7 +325,7 @@ function sectorContainsSector(m, p) {
 }
 
 function indexCurve(start, minX, minY, invSize) {
-  let p = start;
+  var p = start;
 
   do {
     if (p.z === null) p.z = zOrder(p.x, p.y, minX, minY, invSize);
@@ -334,15 +340,15 @@ function indexCurve(start, minX, minY, invSize) {
 }
 
 function sortLinked(list) {
-  let e;
-  let i;
-  let inSize = 1;
-  let numMerges;
-  let p;
-  let pSize;
-  let q;
-  let qSize;
-  let tail;
+  var e;
+  var i;
+  var inSize = 1;
+  var numMerges;
+  var p;
+  var pSize;
+  var q;
+  var qSize;
+  var tail;
 
   do {
     p = list;
@@ -404,8 +410,8 @@ function zOrder(x, y, minX, minY, invSize) {
 }
 
 function getLeftmost(start) {
-  let p = start;
-  let leftmost = start;
+  var p = start;
+  var leftmost = start;
 
   do {
     if (p.x < leftmost.x || p.x === leftmost.x && p.y < leftmost.y) leftmost = p;
@@ -432,10 +438,10 @@ function equals(p1, p2) {
 }
 
 function intersects(p1, q1, p2, q2) {
-  const o1 = sign(area(p1, q1, p2));
-  const o2 = sign(area(p1, q1, q2));
-  const o3 = sign(area(p2, q2, p1));
-  const o4 = sign(area(p2, q2, q1));
+  var o1 = sign(area(p1, q1, p2));
+  var o2 = sign(area(p1, q1, q2));
+  var o3 = sign(area(p2, q2, p1));
+  var o4 = sign(area(p2, q2, q1));
   if (o1 !== o2 && o3 !== o4) return true;
   if (o1 === 0 && onSegment(p1, p2, q1)) return true;
   if (o2 === 0 && onSegment(p1, q2, q1)) return true;
@@ -453,7 +459,7 @@ function sign(num) {
 }
 
 function intersectsPolygon(a, b) {
-  let p = a;
+  var p = a;
 
   do {
     if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i && intersects(p, p.next, a, b)) return true;
@@ -468,10 +474,10 @@ function locallyInside(a, b) {
 }
 
 function middleInside(a, b) {
-  let p = a;
-  let inside = false;
-  const px = (a.x + b.x) / 2;
-  const py = (a.y + b.y) / 2;
+  var p = a;
+  var inside = false;
+  var px = (a.x + b.x) / 2;
+  var py = (a.y + b.y) / 2;
 
   do {
     if (p.y > py !== p.next.y > py && p.next.y !== p.y && px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x) inside = !inside;
@@ -482,10 +488,10 @@ function middleInside(a, b) {
 }
 
 function splitPolygon(a, b) {
-  const a2 = new Node(a.i, a.x, a.y);
-  const b2 = new Node(b.i, b.x, b.y);
-  const an = a.next;
-  const bp = b.prev;
+  var a2 = new Node(a.i, a.x, a.y);
+  var b2 = new Node(b.i, b.x, b.y);
+  var an = a.next;
+  var bp = b.prev;
   a.next = b;
   b.prev = a;
   a2.next = an;
@@ -498,7 +504,7 @@ function splitPolygon(a, b) {
 }
 
 function insertNode(i, x, y, last) {
-  const p = new Node(i, x, y);
+  var p = new Node(i, x, y);
 
   if (!last) {
     p.prev = p;