@math.gl/polygon 3.6.3 → 4.0.0-alpha.2

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

@@ -1,276 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.cutPolylineByGrid = cutPolylineByGrid;
-exports.cutPolygonByGrid = cutPolygonByGrid;
-
-var _lineclip = require("./lineclip");
-
-var _utils = require("./utils");
-
-function cutPolylineByGrid(positions, options) {
-  var _ref = options || {},
-      _ref$size = _ref.size,
-      size = _ref$size === void 0 ? 2 : _ref$size,
-      _ref$broken = _ref.broken,
-      broken = _ref$broken === void 0 ? false : _ref$broken,
-      _ref$gridResolution = _ref.gridResolution,
-      gridResolution = _ref$gridResolution === void 0 ? 10 : _ref$gridResolution,
-      _ref$gridOffset = _ref.gridOffset,
-      gridOffset = _ref$gridOffset === void 0 ? [0, 0] : _ref$gridOffset,
-      _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;
-
-  var numPoints = (endIndex - startIndex) / size;
-  var part = [];
-  var result = [part];
-  var a = (0, _utils.getPointAtIndex)(positions, 0, size, startIndex);
-  var b;
-  var codeB;
-  var cell = getGridCell(a, gridResolution, gridOffset, []);
-  var scratchPoint = [];
-  (0, _utils.push)(part, a);
-
-  for (var i = 1; i < numPoints; i++) {
-    b = (0, _utils.getPointAtIndex)(positions, i, size, startIndex, b);
-    codeB = (0, _lineclip.bitCode)(b, cell);
-
-    while (codeB) {
-      (0, _lineclip.intersect)(a, b, codeB, cell, scratchPoint);
-      var codeAlt = (0, _lineclip.bitCode)(scratchPoint, cell);
-
-      if (codeAlt) {
-        (0, _lineclip.intersect)(a, scratchPoint, codeAlt, cell, scratchPoint);
-        codeB = codeAlt;
-      }
-
-      (0, _utils.push)(part, scratchPoint);
-      (0, _utils.copy)(a, scratchPoint);
-      moveToNeighborCell(cell, gridResolution, codeB);
-
-      if (broken && part.length > size) {
-        part = [];
-        result.push(part);
-        (0, _utils.push)(part, a);
-      }
-
-      codeB = (0, _lineclip.bitCode)(b, cell);
-    }
-
-    (0, _utils.push)(part, b);
-    (0, _utils.copy)(a, b);
-  }
-
-  return broken ? result : result[0];
-}
-
-var TYPE_INSIDE = 0;
-var TYPE_BORDER = 1;
-
-function concatInPlace(arr1, arr2) {
-  for (var i = 0; i < arr2.length; i++) {
-    arr1.push(arr2[i]);
-  }
-
-  return arr1;
-}
-
-function cutPolygonByGrid(positions) {
-  var holeIndices = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
-  var options = arguments.length > 2 ? arguments[2] : undefined;
-
-  if (!positions.length) {
-    return [];
-  }
-
-  var _ref2 = options || {},
-      _ref2$size = _ref2.size,
-      size = _ref2$size === void 0 ? 2 : _ref2$size,
-      _ref2$gridResolution = _ref2.gridResolution,
-      gridResolution = _ref2$gridResolution === void 0 ? 10 : _ref2$gridResolution,
-      _ref2$gridOffset = _ref2.gridOffset,
-      gridOffset = _ref2$gridOffset === void 0 ? [0, 0] : _ref2$gridOffset,
-      _ref2$edgeTypes = _ref2.edgeTypes,
-      edgeTypes = _ref2$edgeTypes === void 0 ? false : _ref2$edgeTypes;
-
-  var result = [];
-  var queue = [{
-    pos: positions,
-    types: edgeTypes ? new Array(positions.length / size).fill(TYPE_BORDER) : null,
-    holes: holeIndices || []
-  }];
-  var bbox = [[], []];
-  var cell = [];
-
-  while (queue.length) {
-    var _queue$shift = queue.shift(),
-        pos = _queue$shift.pos,
-        types = _queue$shift.types,
-        holes = _queue$shift.holes;
-
-    getBoundingBox(pos, size, holes[0] || pos.length, bbox);
-    cell = getGridCell(bbox[0], gridResolution, gridOffset, cell);
-    var code = (0, _lineclip.bitCode)(bbox[1], cell);
-
-    if (code) {
-      var parts = bisectPolygon(pos, types, size, 0, holes[0] || pos.length, cell, code);
-      var polygonLow = {
-        pos: parts[0].pos,
-        types: parts[0].types,
-        holes: []
-      };
-      var polygonHigh = {
-        pos: parts[1].pos,
-        types: parts[1].types,
-        holes: []
-      };
-      queue.push(polygonLow, polygonHigh);
-
-      for (var i = 0; i < holes.length; i++) {
-        parts = bisectPolygon(pos, types, size, holes[i], holes[i + 1] || pos.length, cell, code);
-
-        if (parts[0]) {
-          polygonLow.holes.push(polygonLow.pos.length);
-          polygonLow.pos = concatInPlace(polygonLow.pos, parts[0].pos);
-
-          if (edgeTypes) {
-            polygonLow.types = concatInPlace(polygonLow.types, parts[0].types);
-          }
-        }
-
-        if (parts[1]) {
-          polygonHigh.holes.push(polygonHigh.pos.length);
-          polygonHigh.pos = concatInPlace(polygonHigh.pos, parts[1].pos);
-
-          if (edgeTypes) {
-            polygonHigh.types = concatInPlace(polygonHigh.types, parts[1].types);
-          }
-        }
-      }
-    } else {
-      var polygon = {
-        positions: pos
-      };
-
-      if (edgeTypes) {
-        polygon.edgeTypes = types;
-      }
-
-      if (holes.length) {
-        polygon.holeIndices = holes;
-      }
-
-      result.push(polygon);
-    }
-  }
-
-  return result;
-}
-
-function bisectPolygon(positions, edgeTypes, size, startIndex, endIndex, bbox, edge) {
-  var numPoints = (endIndex - startIndex) / size;
-  var resultLow = [];
-  var resultHigh = [];
-  var typesLow = [];
-  var typesHigh = [];
-  var scratchPoint = [];
-  var p;
-  var side;
-  var type;
-  var prev = (0, _utils.getPointAtIndex)(positions, numPoints - 1, size, startIndex);
-  var prevSide = Math.sign(edge & 8 ? prev[1] - bbox[3] : prev[0] - bbox[2]);
-  var prevType = edgeTypes && edgeTypes[numPoints - 1];
-  var lowPointCount = 0;
-  var highPointCount = 0;
-
-  for (var i = 0; i < numPoints; i++) {
-    p = (0, _utils.getPointAtIndex)(positions, i, size, startIndex, p);
-    side = Math.sign(edge & 8 ? p[1] - bbox[3] : p[0] - bbox[2]);
-    type = edgeTypes && edgeTypes[startIndex / size + i];
-
-    if (side && prevSide && prevSide !== side) {
-      (0, _lineclip.intersect)(prev, p, edge, bbox, scratchPoint);
-      (0, _utils.push)(resultLow, scratchPoint) && typesLow.push(prevType);
-      (0, _utils.push)(resultHigh, scratchPoint) && typesHigh.push(prevType);
-    }
-
-    if (side <= 0) {
-      (0, _utils.push)(resultLow, p) && typesLow.push(type);
-      lowPointCount -= side;
-    } else if (typesLow.length) {
-      typesLow[typesLow.length - 1] = TYPE_INSIDE;
-    }
-
-    if (side >= 0) {
-      (0, _utils.push)(resultHigh, p) && typesHigh.push(type);
-      highPointCount += side;
-    } else if (typesHigh.length) {
-      typesHigh[typesHigh.length - 1] = TYPE_INSIDE;
-    }
-
-    (0, _utils.copy)(prev, p);
-    prevSide = side;
-    prevType = type;
-  }
-
-  return [lowPointCount ? {
-    pos: resultLow,
-    types: edgeTypes && typesLow
-  } : null, highPointCount ? {
-    pos: resultHigh,
-    types: edgeTypes && typesHigh
-  } : null];
-}
-
-function getGridCell(p, gridResolution, gridOffset, out) {
-  var left = Math.floor((p[0] - gridOffset[0]) / gridResolution) * gridResolution + gridOffset[0];
-  var bottom = Math.floor((p[1] - gridOffset[1]) / gridResolution) * gridResolution + gridOffset[1];
-  out[0] = left;
-  out[1] = bottom;
-  out[2] = left + gridResolution;
-  out[3] = bottom + gridResolution;
-  return out;
-}
-
-function moveToNeighborCell(cell, gridResolution, edge) {
-  if (edge & 8) {
-    cell[1] += gridResolution;
-    cell[3] += gridResolution;
-  } else if (edge & 4) {
-    cell[1] -= gridResolution;
-    cell[3] -= gridResolution;
-  } else if (edge & 2) {
-    cell[0] += gridResolution;
-    cell[2] += gridResolution;
-  } else if (edge & 1) {
-    cell[0] -= gridResolution;
-    cell[2] -= gridResolution;
-  }
-}
-
-function getBoundingBox(positions, size, endIndex, out) {
-  var minX = Infinity;
-  var maxX = -Infinity;
-  var minY = Infinity;
-  var maxY = -Infinity;
-
-  for (var i = 0; i < endIndex; i += size) {
-    var x = positions[i];
-    var y = positions[i + 1];
-    minX = x < minX ? x : minX;
-    maxX = x > maxX ? x : maxX;
-    minY = y < minY ? y : minY;
-    maxY = y > maxY ? y : maxY;
-  }
-
-  out[0][0] = minX;
-  out[0][1] = minY;
-  out[1][0] = maxX;
-  out[1][1] = maxY;
-  return out;
-}
-//# sourceMappingURL=cut-by-grid.js.map

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

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/cut-by-grid.ts"],"names":["cutPolylineByGrid","positions","options","size","broken","gridResolution","gridOffset","startIndex","endIndex","length","numPoints","part","result","a","b","codeB","cell","getGridCell","scratchPoint","i","codeAlt","moveToNeighborCell","push","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;;AACA;;AAUO,SAASA,iBAAT,CACLC,SADK,EAELC,OAFK,EAUkB;AACvB,aAOIA,OAAO,IAAI,EAPf;AAAA,uBACEC,IADF;AAAA,MACEA,IADF,0BACS,CADT;AAAA,yBAEEC,MAFF;AAAA,MAEEA,MAFF,4BAEW,KAFX;AAAA,iCAGEC,cAHF;AAAA,MAGEA,cAHF,oCAGmB,EAHnB;AAAA,6BAIEC,UAJF;AAAA,MAIEA,UAJF,gCAIe,CAAC,CAAD,EAAI,CAAJ,CAJf;AAAA,6BAKEC,UALF;AAAA,MAKEA,UALF,gCAKe,CALf;AAAA,2BAMEC,QANF;AAAA,MAMEA,QANF,8BAMaP,SAAS,CAACQ,MANvB;;AAQA,MAAMC,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,MAAIQ,IAAc,GAAG,EAArB;AACA,MAAMC,MAAkB,GAAG,CAACD,IAAD,CAA3B;AACA,MAAME,CAAW,GAAG,4BAAgBZ,SAAhB,EAA2B,CAA3B,EAA8BE,IAA9B,EAAoCI,UAApC,CAApB;AACA,MAAIO,CAAJ;AACA,MAAIC,KAAJ;AACA,MAAMC,IAAiB,GAAGC,WAAW,CAACJ,CAAD,EAAIR,cAAJ,EAAoBC,UAApB,EAAgC,EAAhC,CAArC;AACA,MAAMY,YAAsB,GAAG,EAA/B;AACA,mBAAKP,IAAL,EAAWE,CAAX;;AAEA,OAAK,IAAIM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClCL,IAAAA,CAAC,GAAG,4BAAgBb,SAAhB,EAA2BkB,CAA3B,EAA8BhB,IAA9B,EAAoCI,UAApC,EAAgDO,CAAhD,CAAJ;AACAC,IAAAA,KAAK,GAAG,uBAAQD,CAAR,EAAWE,IAAX,CAAR;;AAEA,WAAOD,KAAP,EAAc;AAEZ,+BAAUF,CAAV,EAAaC,CAAb,EAAgBC,KAAhB,EAAuBC,IAAvB,EAA6BE,YAA7B;AACA,UAAME,OAAO,GAAG,uBAAQF,YAAR,EAAsBF,IAAtB,CAAhB;;AACA,UAAII,OAAJ,EAAa;AACX,iCAAUP,CAAV,EAAaK,YAAb,EAA2BE,OAA3B,EAAoCJ,IAApC,EAA0CE,YAA1C;AACAH,QAAAA,KAAK,GAAGK,OAAR;AACD;;AACD,uBAAKT,IAAL,EAAWO,YAAX;AAEA,uBAAKL,CAAL,EAAQK,YAAR;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,CAACU,IAAP,CAAYX,IAAZ;AACA,yBAAKA,IAAL,EAAWE,CAAX;AACD;;AAEDE,MAAAA,KAAK,GAAG,uBAAQD,CAAR,EAAWE,IAAX,CAAR;AACD;;AAED,qBAAKL,IAAL,EAAWG,CAAX;AACA,qBAAKD,CAAL,EAAQC,CAAR;AACD;;AAED,SAAOV,MAAM,GAAGQ,MAAH,GAAYA,MAAM,CAAC,CAAD,CAA/B;AACD;;AAED,IAAMW,WAAW,GAAG,CAApB;AACA,IAAMC,WAAW,GAAG,CAApB;;AAEA,SAASC,aAAT,CAAuBC,IAAvB,EAAuCC,IAAvC,EAAiE;AAC/D,OAAK,IAAIR,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGQ,IAAI,CAAClB,MAAzB,EAAiCU,CAAC,EAAlC,EAAsC;AACpCO,IAAAA,IAAI,CAACJ,IAAL,CAAUK,IAAI,CAACR,CAAD,CAAd;AACD;;AACD,SAAOO,IAAP;AACD;;AAEM,SAASE,gBAAT,CACL3B,SADK,EASM;AAAA,MAPX4B,WAOW,uEAPkC,IAOlC;AAAA,MANX3B,OAMW;;AACX,MAAI,CAACD,SAAS,CAACQ,MAAf,EAAuB;AAErB,WAAO,EAAP;AACD;;AACD,cAAgFP,OAAO,IAAI,EAA3F;AAAA,yBAAOC,IAAP;AAAA,MAAOA,IAAP,2BAAc,CAAd;AAAA,mCAAiBE,cAAjB;AAAA,MAAiBA,cAAjB,qCAAkC,EAAlC;AAAA,+BAAsCC,UAAtC;AAAA,MAAsCA,UAAtC,iCAAmD,CAAC,CAAD,EAAI,CAAJ,CAAnD;AAAA,8BAA2DwB,SAA3D;AAAA,MAA2DA,SAA3D,gCAAuE,KAAvE;;AACA,MAAMlB,MAAiB,GAAG,EAA1B;AACA,MAAMmB,KAAsF,GAAG,CAC7F;AACEC,IAAAA,GAAG,EAAE/B,SADP;AAEEgC,IAAAA,KAAK,EAAEH,SAAS,GAAI,IAAII,KAAJ,CAAUjC,SAAS,CAACQ,MAAV,GAAmBN,IAA7B,EAAmCgC,IAAnC,CAAwCX,WAAxC,CAAJ,GAAwE,IAF1F;AAGEY,IAAAA,KAAK,EAAEP,WAAW,IAAI;AAHxB,GAD6F,CAA/F;AAOA,MAAMQ,IAAgB,GAAG,CAAC,EAAD,EAAK,EAAL,CAAzB;AAEA,MAAIrB,IAAiB,GAAG,EAAxB;;AAGA,SAAOe,KAAK,CAACtB,MAAb,EAAqB;AACnB,uBAA4BsB,KAAK,CAACO,KAAN,EAA5B;AAAA,QAAON,GAAP,gBAAOA,GAAP;AAAA,QAAYC,KAAZ,gBAAYA,KAAZ;AAAA,QAAmBG,KAAnB,gBAAmBA,KAAnB;;AAGAG,IAAAA,cAAc,CAACP,GAAD,EAAM7B,IAAN,EAAYiC,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACvB,MAA5B,EAAoC4B,IAApC,CAAd;AACArB,IAAAA,IAAI,GAAGC,WAAW,CAACoB,IAAI,CAAC,CAAD,CAAL,EAAUhC,cAAV,EAA0BC,UAA1B,EAAsCU,IAAtC,CAAlB;AACA,QAAMwB,IAAI,GAAG,uBAAQH,IAAI,CAAC,CAAD,CAAZ,EAAiBrB,IAAjB,CAAb;;AAEA,QAAIwB,IAAJ,EAAU;AAER,UAAIC,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa9B,IAAb,EAAmB,CAAnB,EAAsBiC,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACvB,MAAtC,EAA8CO,IAA9C,EAAoDwB,IAApD,CAAzB;AACA,UAAMG,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,UAAMQ,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,CAACT,IAAN,CAAWqB,UAAX,EAAuBC,WAAvB;;AAGA,WAAK,IAAIzB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGiB,KAAK,CAAC3B,MAA1B,EAAkCU,CAAC,EAAnC,EAAuC;AACrCsB,QAAAA,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa9B,IAAb,EAAmBiC,KAAK,CAACjB,CAAD,CAAxB,EAA6BiB,KAAK,CAACjB,CAAC,GAAG,CAAL,CAAL,IAAgBa,GAAG,CAACvB,MAAjD,EAAyDO,IAAzD,EAA+DwB,IAA/D,CAArB;;AAEA,YAAIC,KAAK,CAAC,CAAD,CAAT,EAAc;AACZE,UAAAA,UAAU,CAACP,KAAX,CAAiBd,IAAjB,CAAsBqB,UAAU,CAACX,GAAX,CAAevB,MAArC;AACAkC,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,CAAkBd,IAAlB,CAAuBsB,WAAW,CAACZ,GAAZ,CAAgBvB,MAAvC;AACAmC,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,UAAMY,OAAgB,GAAG;AAAC5C,QAAAA,SAAS,EAAE+B;AAAZ,OAAzB;;AACA,UAAIF,SAAJ,EAAe;AACbe,QAAAA,OAAO,CAACf,SAAR,GAAoBG,KAApB;AACD;;AACD,UAAIG,KAAK,CAAC3B,MAAV,EAAkB;AAChBoC,QAAAA,OAAO,CAAChB,WAAR,GAAsBO,KAAtB;AACD;;AAEDxB,MAAAA,MAAM,CAACU,IAAP,CAAYuB,OAAZ;AACD;AACF;;AACD,SAAOjC,MAAP;AACD;;AAMD,SAAS8B,aAAT,CACEzC,SADF,EAEE6B,SAFF,EAGE3B,IAHF,EAIEI,UAJF,EAKEC,QALF,EAME6B,IANF,EAOES,IAPF,EAWI;AACF,MAAMpC,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,MAAM4C,SAAmB,GAAG,EAA5B;AACA,MAAMC,UAAoB,GAAG,EAA7B;AACA,MAAMC,QAAkB,GAAG,EAA3B;AACA,MAAMC,SAAmB,GAAG,EAA5B;AACA,MAAMhC,YAAsB,GAAG,EAA/B;AAEA,MAAIiC,CAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,MAAMC,IAAI,GAAG,4BAAgBrD,SAAhB,EAA2BS,SAAS,GAAG,CAAvC,EAA0CP,IAA1C,EAAgDI,UAAhD,CAAb;AACA,MAAIgD,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,CAACpB,SAAS,GAAG,CAAb,CAArC;AACA,MAAIiD,aAAa,GAAG,CAApB;AACA,MAAIC,cAAc,GAAG,CAArB;;AAEA,OAAK,IAAIzC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClCgC,IAAAA,CAAC,GAAG,4BAAgBlD,SAAhB,EAA2BkB,CAA3B,EAA8BhB,IAA9B,EAAoCI,UAApC,EAAgD4C,CAAhD,CAAJ;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,CAACvB,UAAU,GAAGJ,IAAb,GAAoBgB,CAArB,CAA7B;;AAGA,QAAIiC,IAAI,IAAIG,QAAR,IAAoBA,QAAQ,KAAKH,IAArC,EAA2C;AACzC,+BAAUE,IAAV,EAAgBH,CAAhB,EAAmBL,IAAnB,EAAyBT,IAAzB,EAA+BnB,YAA/B;AACA,uBAAK6B,SAAL,EAAgB7B,YAAhB,KAAiC+B,QAAQ,CAAC3B,IAAT,CAAcoC,QAAd,CAAjC;AACA,uBAAKV,UAAL,EAAiB9B,YAAjB,KAAkCgC,SAAS,CAAC5B,IAAV,CAAeoC,QAAf,CAAlC;AACD;;AAED,QAAIN,IAAI,IAAI,CAAZ,EAAe;AACb,uBAAKL,SAAL,EAAgBI,CAAhB,KAAsBF,QAAQ,CAAC3B,IAAT,CAAc+B,IAAd,CAAtB;AACAM,MAAAA,aAAa,IAAIP,IAAjB;AACD,KAHD,MAGO,IAAIH,QAAQ,CAACxC,MAAb,EAAqB;AAC1BwC,MAAAA,QAAQ,CAACA,QAAQ,CAACxC,MAAT,GAAkB,CAAnB,CAAR,GAAgCc,WAAhC;AACD;;AACD,QAAI6B,IAAI,IAAI,CAAZ,EAAe;AACb,uBAAKJ,UAAL,EAAiBG,CAAjB,KAAuBD,SAAS,CAAC5B,IAAV,CAAe+B,IAAf,CAAvB;AACAO,MAAAA,cAAc,IAAIR,IAAlB;AACD,KAHD,MAGO,IAAIF,SAAS,CAACzC,MAAd,EAAsB;AAC3ByC,MAAAA,SAAS,CAACA,SAAS,CAACzC,MAAV,GAAmB,CAApB,CAAT,GAAkCc,WAAlC;AACD;;AAED,qBAAK+B,IAAL,EAAWH,CAAX;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,SAASjC,WAAT,CACEkC,CADF,EAEE9C,cAFF,EAGEC,UAHF,EAIEuD,GAJF,EAKe;AACb,MAAMC,IAAI,GAAGN,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO7C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CAA9F;AACA,MAAM0D,MAAM,GACVR,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO7C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CADnF;AAEAuD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAT;AACAD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAT;AACAH,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAI,GAAGzD,cAAhB;AACAwD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAM,GAAG3D,cAAlB;AACA,SAAOwD,GAAP;AACD;;AAED,SAASxC,kBAAT,CAA4BL,IAA5B,EAA4CX,cAA5C,EAAoEyC,IAApE,EAAwF;AACtF,MAAIA,IAAI,GAAG,CAAX,EAAc;AAEZ9B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJD,MAIO,IAAIyC,IAAI,GAAG,CAAX,EAAc;AAEnB9B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIyC,IAAI,GAAG,CAAX,EAAc;AAEnB9B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIyC,IAAI,GAAG,CAAX,EAAc;AAEnB9B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD;AACF;;AAED,SAASkC,cAAT,CACEtC,SADF,EAEEE,IAFF,EAGEK,QAHF,EAIEqD,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,IAAI/C,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGX,QAApB,EAA8BW,CAAC,IAAIhB,IAAnC,EAAyC;AACvC,QAAMmE,CAAC,GAAGrE,SAAS,CAACkB,CAAD,CAAnB;AACA,QAAMoD,CAAC,GAAGtE,SAAS,CAACkB,CAAC,GAAG,CAAL,CAAnB;AACA8C,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: Readonly<NumericArray>;\n  holeIndices?: Readonly<NumericArray>;\n  edgeTypes?: Readonly<NumericArray>;\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: Readonly<NumericArray>,\n  holeIndices: Readonly<NumericArray> | 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: Readonly<NumericArray>; types: number[]; holes: Readonly<NumericArray>}[] = [\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: Readonly<NumericArray>,\n  edgeTypes: number[] | undefined,\n  size: number,\n  startIndex: number,\n  endIndex: number,\n  bbox: BoundingBox,\n  edge: number\n): {\n  pos: number[];\n  types?: 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: Readonly<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/es5/cut-by-mercator-bounds.js

@@ -1,194 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.cutPolylineByMercatorBounds = cutPolylineByMercatorBounds;
-exports.cutPolygonByMercatorBounds = cutPolygonByMercatorBounds;
-
-var _cutByGrid = require("./cut-by-grid");
-
-var _utils = require("./utils");
-
-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) {
-  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);
-  var parts = (0, _cutByGrid.cutPolylineByGrid)(newPositions, {
-    size: size,
-    broken: true,
-    gridResolution: 360,
-    gridOffset: [-180, -180]
-  });
-
-  if (normalize) {
-    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) {
-  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 || [];
-  var newPositions = [];
-  var newHoleIndices = [];
-  var srcStartIndex = 0;
-  var targetIndex = 0;
-
-  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 (var i = splitIndex; i < srcEndIndex; i++) {
-      newPositions[targetIndex++] = positions[i];
-    }
-
-    for (var _i = srcStartIndex; _i < splitIndex; _i++) {
-      newPositions[targetIndex++] = positions[_i];
-    }
-
-    wrapLongitudesForShortestPath(newPositions, size, targetStartIndex, targetIndex);
-    insertPoleVertices(newPositions, size, targetStartIndex, targetIndex, options === null || options === void 0 ? void 0 : options.maxLatitude);
-    srcStartIndex = srcEndIndex;
-    newHoleIndices[ringIndex] = targetIndex;
-  }
-
-  newHoleIndices.pop();
-  var parts = (0, _cutByGrid.cutPolygonByGrid)(newPositions, newHoleIndices, {
-    size: size,
-    gridResolution: 360,
-    gridOffset: [-180, -180],
-    edgeTypes: edgeTypes
-  });
-
-  if (normalize) {
-    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();
-    }
-  }
-
-  return parts;
-}
-
-function findSplitIndex(positions, size, startIndex, endIndex) {
-  var maxLat = -1;
-  var pointIndex = -1;
-
-  for (var i = startIndex + 1; i < endIndex; i += size) {
-    var lat = Math.abs(positions[i]);
-
-    if (lat > maxLat) {
-      maxLat = lat;
-      pointIndex = i - 1;
-    }
-  }
-
-  return pointIndex;
-}
-
-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) {
-    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;
-    (0, _utils.push)(positions, p);
-    p[0] = firstLng;
-    (0, _utils.push)(positions, p);
-  }
-}
-
-function wrapLongitudesForShortestPath(positions, size, startIndex, endIndex) {
-  var prevLng = positions[0];
-  var lng;
-
-  for (var i = startIndex; i < endIndex; i += size) {
-    lng = positions[i];
-    var delta = lng - prevLng;
-
-    if (delta > 180 || delta < -180) {
-      lng -= Math.round(delta / 360) * 360;
-    }
-
-    positions[i] = prevLng = lng;
-  }
-}
-
-function shiftLongitudesIntoRange(positions, size) {
-  var refLng;
-  var pointCount = positions.length / size;
-
-  for (var i = 0; i < pointCount; i++) {
-    refLng = positions[i * size];
-
-    if ((refLng + 180) % 360 !== 0) {
-      break;
-    }
-  }
-
-  var delta = -Math.round(refLng / 360) * 360;
-
-  if (delta === 0) {
-    return;
-  }
-
-  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 +0,0 @@
-{"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,uEAPkC,IAOlC;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;AAExBC,QAAAA,wBAAwB,CAACD,IAAI,CAACd,SAAN,EAAiBE,IAAjB,CAAxB;AACD;AANY;AAAA;AAAA;AAAA;AAAA;AAOd;;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: Readonly<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: Readonly<NumericArray>,\n  holeIndices: Readonly<NumericArray> | 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      // @ts-expect-error (mutates readonly array) May mutate newPositions, which is created by us\n      shiftLongitudesIntoRange(part.positions, size);\n    }\n  }\n  return parts;\n}\n\n/* Helpers */\n\n// See comments for insertPoleVertices\nfunction findSplitIndex(\n  positions: Readonly<NumericArray>,\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"}