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

package/dist/esm/lineclip.js

@@ -1,10 +1,10 @@
 import { push, copy, getPointAtIndex } from './utils';
-export function clipPolyline(positions, bbox, options = {}) {
+export function clipPolyline(positions, bbox, options) {
   const {
     size = 2,
     startIndex = 0,
     endIndex = positions.length
-  } = options;
+  } = options || {};
   const numPoints = (endIndex - startIndex) / size;
   const result = [];
   let part = [];
@@ -57,14 +57,14 @@ export function clipPolyline(positions, bbox, options = {}) {
   if (part.length) result.push(part);
   return result;
 }
-export function clipPolygon(positions, bbox, options = {}) {
+export function clipPolygon(positions, bbox, options) {
   const {
     size = 2,
     endIndex = positions.length
-  } = options;
+  } = options || {};
   let {
     startIndex = 0
-  } = options;
+  } = options || {};
   let numPoints = (endIndex - startIndex) / size;
   let result;
   let p;

package/dist/esm/lineclip.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/lineclip.js"],"names":["push","copy","getPointAtIndex","clipPolyline","positions","bbox","options","size","startIndex","endIndex","length","numPoints","result","part","a","b","codeA","codeB","lastCode","i","bitCode","intersect","clipPolygon","p","prev","inside","prevInside","edge","out","t","snap","code"],"mappings":"AAwBA,SAAQA,IAAR,EAAcC,IAAd,EAAoBC,eAApB,QAA0C,SAA1C;AAIA,OAAO,SAASC,YAAT,CAAsBC,SAAtB,EAAiCC,IAAjC,EAAuCC,OAAO,GAAG,EAAjD,EAAqD;AAC1D,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWC,IAAAA,UAAU,GAAG,CAAxB;AAA2BC,IAAAA,QAAQ,GAAGL,SAAS,CAACM;AAAhD,MAA0DJ,OAAhE;AACA,QAAMK,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BD,IAA5C;AACA,QAAMK,MAAM,GAAG,EAAf;AACA,MAAIC,IAAI,GAAG,EAAX;AACA,MAAIC,CAAJ;AACA,MAAIC,CAAJ;AACA,MAAIC,KAAK,GAAG,CAAC,CAAb;AACA,MAAIC,KAAJ;AACA,MAAIC,QAAJ;;AAEA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGR,SAApB,EAA+BQ,CAAC,EAAhC,EAAoC;AAClCL,IAAAA,CAAC,GAAGZ,eAAe,CAACE,SAAD,EAAYe,CAAC,GAAG,CAAhB,EAAmBZ,IAAnB,EAAyBC,UAAzB,EAAqCM,CAArC,CAAnB;AACAC,IAAAA,CAAC,GAAGb,eAAe,CAACE,SAAD,EAAYe,CAAZ,EAAeZ,IAAf,EAAqBC,UAArB,EAAiCO,CAAjC,CAAnB;;AACA,QAAIC,KAAK,GAAG,CAAZ,EAAe;AACbA,MAAAA,KAAK,GAAGI,OAAO,CAACN,CAAD,EAAIT,IAAJ,CAAf;AACD;;AACDY,IAAAA,KAAK,GAAGC,QAAQ,GAAGE,OAAO,CAACL,CAAD,EAAIV,IAAJ,CAA1B;;AAGA,WAAO,IAAP,EAAa;AACX,UAAI,EAAEW,KAAK,GAAGC,KAAV,CAAJ,EAAsB;AAEpBjB,QAAAA,IAAI,CAACa,IAAD,EAAOC,CAAP,CAAJ;;AAEA,YAAIG,KAAK,KAAKC,QAAd,EAAwB;AAEtBlB,UAAAA,IAAI,CAACa,IAAD,EAAOE,CAAP,CAAJ;;AAEA,cAAII,CAAC,GAAGR,SAAS,GAAG,CAApB,EAAuB;AAErBC,YAAAA,MAAM,CAACZ,IAAP,CAAYa,IAAZ;AACAA,YAAAA,IAAI,GAAG,EAAP;AACD;AACF,SATD,MASO,IAAIM,CAAC,KAAKR,SAAS,GAAG,CAAtB,EAAyB;AAC9BX,UAAAA,IAAI,CAACa,IAAD,EAAOE,CAAP,CAAJ;AACD;;AACD;AACD,OAjBD,MAiBO,IAAIC,KAAK,GAAGC,KAAZ,EAAmB;AAExB;AACD,OAHM,MAGA,IAAID,KAAJ,EAAW;AAEhBK,QAAAA,SAAS,CAACP,CAAD,EAAIC,CAAJ,EAAOC,KAAP,EAAcX,IAAd,EAAoBS,CAApB,CAAT;AACAE,QAAAA,KAAK,GAAGI,OAAO,CAACN,CAAD,EAAIT,IAAJ,CAAf;AACD,OAJM,MAIA;AAELgB,QAAAA,SAAS,CAACP,CAAD,EAAIC,CAAJ,EAAOE,KAAP,EAAcZ,IAAd,EAAoBU,CAApB,CAAT;AACAE,QAAAA,KAAK,GAAGG,OAAO,CAACL,CAAD,EAAIV,IAAJ,CAAf;AACD;AACF;;AAEDW,IAAAA,KAAK,GAAGE,QAAR;AACD;;AAED,MAAIL,IAAI,CAACH,MAAT,EAAiBE,MAAM,CAACZ,IAAP,CAAYa,IAAZ;AAEjB,SAAOD,MAAP;AACD;AAID,OAAO,SAASU,WAAT,CAAqBlB,SAArB,EAAgCC,IAAhC,EAAsCC,OAAO,GAAG,EAAhD,EAAoD;AACzD,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWE,IAAAA,QAAQ,GAAGL,SAAS,CAACM;AAAhC,MAA0CJ,OAAhD;AACA,MAAI;AAACE,IAAAA,UAAU,GAAG;AAAd,MAAmBF,OAAvB;AACA,MAAIK,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BD,IAA1C;AACA,MAAIK,MAAJ;AACA,MAAIW,CAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,MAAJ;AACA,MAAIC,UAAJ;;AAGA,OAAK,IAAIC,IAAI,GAAG,CAAhB,EAAmBA,IAAI,IAAI,CAA3B,EAA8BA,IAAI,IAAI,CAAtC,EAAyC;AACvCf,IAAAA,MAAM,GAAG,EAAT;AACAY,IAAAA,IAAI,GAAGtB,eAAe,CAACE,SAAD,EAAYO,SAAS,GAAG,CAAxB,EAA2BJ,IAA3B,EAAiCC,UAAjC,EAA6CgB,IAA7C,CAAtB;AACAE,IAAAA,UAAU,GAAG,EAAEN,OAAO,CAACI,IAAD,EAAOnB,IAAP,CAAP,GAAsBsB,IAAxB,CAAb;;AAEA,SAAK,IAAIR,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGR,SAApB,EAA+BQ,CAAC,EAAhC,EAAoC;AAClCI,MAAAA,CAAC,GAAGrB,eAAe,CAACE,SAAD,EAAYe,CAAZ,EAAeZ,IAAf,EAAqBC,UAArB,EAAiCe,CAAjC,CAAnB;AACAE,MAAAA,MAAM,GAAG,EAAEL,OAAO,CAACG,CAAD,EAAIlB,IAAJ,CAAP,GAAmBsB,IAArB,CAAT;AAGA,UAAIF,MAAM,KAAKC,UAAf,EAA2B1B,IAAI,CAACY,MAAD,EAASS,SAAS,CAACG,IAAD,EAAOD,CAAP,EAAUI,IAAV,EAAgBtB,IAAhB,CAAlB,CAAJ;AAE3B,UAAIoB,MAAJ,EAAYzB,IAAI,CAACY,MAAD,EAASW,CAAT,CAAJ;AAEZtB,MAAAA,IAAI,CAACuB,IAAD,EAAOD,CAAP,CAAJ;AACAG,MAAAA,UAAU,GAAGD,MAAb;AACD;;AAGDrB,IAAAA,SAAS,GAAGQ,MAAZ;AACAJ,IAAAA,UAAU,GAAG,CAAb;AACAG,IAAAA,SAAS,GAAGC,MAAM,CAACF,MAAP,GAAgBH,IAA5B;AAEA,QAAI,CAACI,SAAL,EAAgB;AACjB;;AAED,SAAOC,MAAP;AACD;AAID,OAAO,SAASS,SAAT,CAAmBP,CAAnB,EAAsBC,CAAtB,EAAyBY,IAAzB,EAA+BtB,IAA/B,EAAqCuB,GAAG,GAAG,EAA3C,EAA+C;AACpD,MAAIC,CAAJ;AAIA,MAAIC,IAAJ;;AACA,MAAIH,IAAI,GAAG,CAAX,EAAc;AAEZE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJD,MAIO,IAAIH,IAAI,GAAG,CAAX,EAAc;AAEnBE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJM,MAIA,IAAIH,IAAI,GAAG,CAAX,EAAc;AAEnBE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJM,MAIA,IAAIH,IAAI,GAAG,CAAX,EAAc;AAEnBE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJM,MAIA;AACL,WAAO,IAAP;AACD;;AACD,OAAK,IAAIX,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGL,CAAC,CAACJ,MAAtB,EAA8BS,CAAC,EAA/B,EAAmC;AACjCS,IAAAA,GAAG,CAACT,CAAD,CAAH,GAAS,CAACW,IAAI,GAAG,CAAR,MAAeX,CAAf,GAAmBd,IAAI,CAACyB,IAAD,CAAvB,GAAgCD,CAAC,IAAId,CAAC,CAACI,CAAD,CAAD,GAAOL,CAAC,CAACK,CAAD,CAAZ,CAAD,GAAoBL,CAAC,CAACK,CAAD,CAA9D;AACD;;AACD,SAAOS,GAAP;AACD;AASD,OAAO,SAASR,OAAT,CAAiBG,CAAjB,EAAoBlB,IAApB,EAA0B;AAC/B,MAAI0B,IAAI,GAAG,CAAX;AAEA,MAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR,CAApB,KAEK,IAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR;AAEzB,MAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR,CAApB,KAEK,IAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR;AAEzB,SAAOA,IAAP;AACD","sourcesContent":["/*\n  Adapted from https://github.com/mapbox/lineclip to work with flat arrays\n  and 3d positions\n\n  ISC License\n\n  Copyright (c) 2015, Mapbox\n\n  Permission to use, copy, modify, and/or distribute this software for any purpose\n  with or without fee is hereby granted, provided that the above copyright notice\n  and this permission notice appear in all copies.\n\n  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n  OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n  THIS SOFTWARE.\n\n */\n\n/* eslint-disable max-statements, max-depth */\n\nimport {push, copy, getPointAtIndex} from './utils';\n\n// Cohen-Sutherland line clipping algorithm, adapted to efficiently\n// handle polylines rather than just segments\nexport function clipPolyline(positions, bbox, options = {}) {\n  const {size = 2, startIndex = 0, endIndex = positions.length} = options;\n  const numPoints = (endIndex - startIndex) / size;\n  const result = [];\n  let part = [];\n  let a;\n  let b;\n  let codeA = -1;\n  let codeB;\n  let lastCode;\n\n  for (let i = 1; i < numPoints; i++) {\n    a = getPointAtIndex(positions, i - 1, size, startIndex, a);\n    b = getPointAtIndex(positions, i, size, startIndex, b);\n    if (codeA < 0) {\n      codeA = bitCode(a, bbox);\n    }\n    codeB = lastCode = bitCode(b, bbox);\n\n    // eslint-disable-next-line no-constant-condition\n    while (true) {\n      if (!(codeA | codeB)) {\n        // accept\n        push(part, a);\n\n        if (codeB !== lastCode) {\n          // segment went outside\n          push(part, b);\n\n          if (i < numPoints - 1) {\n            // start a new line\n            result.push(part);\n            part = [];\n          }\n        } else if (i === numPoints - 1) {\n          push(part, b);\n        }\n        break;\n      } else if (codeA & codeB) {\n        // trivial reject\n        break;\n      } else if (codeA) {\n        // a outside, intersect with clip edge\n        intersect(a, b, codeA, bbox, a);\n        codeA = bitCode(a, bbox);\n      } else {\n        // b outside\n        intersect(a, b, codeB, bbox, b);\n        codeB = bitCode(b, bbox);\n      }\n    }\n\n    codeA = lastCode;\n  }\n\n  if (part.length) result.push(part);\n\n  return result;\n}\n\n// Sutherland-Hodgeman polygon clipping algorithm\n// polygon must be closed (first vertex == last vertex)\nexport function clipPolygon(positions, bbox, options = {}) {\n  const {size = 2, endIndex = positions.length} = options;\n  let {startIndex = 0} = options;\n  let numPoints = (endIndex - startIndex) / size;\n  let result;\n  let p;\n  let prev;\n  let inside;\n  let prevInside;\n\n  // clip against each side of the clip rectangle\n  for (let edge = 1; edge <= 8; edge *= 2) {\n    result = [];\n    prev = getPointAtIndex(positions, numPoints - 1, size, startIndex, prev);\n    prevInside = !(bitCode(prev, bbox) & edge);\n\n    for (let i = 0; i < numPoints; i++) {\n      p = getPointAtIndex(positions, i, size, startIndex, p);\n      inside = !(bitCode(p, bbox) & edge);\n\n      // if segment goes through the clip window, add an intersection\n      if (inside !== prevInside) push(result, intersect(prev, p, edge, bbox));\n\n      if (inside) push(result, p); // add a point if it's inside\n\n      copy(prev, p);\n      prevInside = inside;\n    }\n\n    // close loop\n    positions = result;\n    startIndex = 0;\n    numPoints = result.length / size;\n\n    if (!numPoints) break;\n  }\n\n  return result;\n}\n\n// intersect a segment against one of the 4 lines that make up the bbox\n\nexport function intersect(a, b, edge, bbox, out = []) {\n  let t;\n  // Forces out[snapI] to be on the bbox edge\n  // Interpolation introduces precision issue which may cause lineclip to be\n  // stuck in an infinite loop\n  let snap;\n  if (edge & 8) {\n    // top\n    t = (bbox[3] - a[1]) / (b[1] - a[1]);\n    snap = 3;\n  } else if (edge & 4) {\n    // bottom\n    t = (bbox[1] - a[1]) / (b[1] - a[1]);\n    snap = 1;\n  } else if (edge & 2) {\n    // right\n    t = (bbox[2] - a[0]) / (b[0] - a[0]);\n    snap = 2;\n  } else if (edge & 1) {\n    // left\n    t = (bbox[0] - a[0]) / (b[0] - a[0]);\n    snap = 0;\n  } else {\n    return null;\n  }\n  for (let i = 0; i < a.length; i++) {\n    out[i] = (snap & 1) === i ? bbox[snap] : t * (b[i] - a[i]) + a[i];\n  }\n  return out;\n}\n\n// bit code reflects the point position relative to the bbox:\n\n//         left  mid  right\n//    top  1001  1000  1010\n//    mid  0001  0000  0010\n// bottom  0101  0100  0110\n\nexport function bitCode(p, bbox) {\n  let code = 0;\n\n  if (p[0] < bbox[0]) code |= 1;\n  // left\n  else if (p[0] > bbox[2]) code |= 2; // right\n\n  if (p[1] < bbox[1]) code |= 4;\n  // bottom\n  else if (p[1] > bbox[3]) code |= 8; // top\n\n  return code;\n}\n"],"file":"lineclip.js"}
+{"version":3,"sources":["../../src/lineclip.ts"],"names":["push","copy","getPointAtIndex","clipPolyline","positions","bbox","options","size","startIndex","endIndex","length","numPoints","result","part","a","b","codeA","codeB","lastCode","i","bitCode","intersect","clipPolygon","p","prev","inside","prevInside","edge","out","t","snap","code"],"mappings":"AAwBA,SAAQA,IAAR,EAAcC,IAAd,EAAoBC,eAApB,QAA0C,SAA1C;AAQA,OAAO,SAASC,YAAT,CACLC,SADK,EAELC,IAFK,EAGLC,OAHK,EAQO;AACZ,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWC,IAAAA,UAAU,GAAG,CAAxB;AAA2BC,IAAAA,QAAQ,GAAGL,SAAS,CAACM;AAAhD,MAA0DJ,OAAO,IAAI,EAA3E;AACA,QAAMK,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BD,IAA5C;AACA,QAAMK,MAAM,GAAG,EAAf;AACA,MAAIC,IAAI,GAAG,EAAX;AACA,MAAIC,CAAJ;AACA,MAAIC,CAAJ;AACA,MAAIC,KAAK,GAAG,CAAC,CAAb;AACA,MAAIC,KAAJ;AACA,MAAIC,QAAJ;;AAEA,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGR,SAApB,EAA+BQ,CAAC,EAAhC,EAAoC;AAClCL,IAAAA,CAAC,GAAGZ,eAAe,CAACE,SAAD,EAAYe,CAAC,GAAG,CAAhB,EAAmBZ,IAAnB,EAAyBC,UAAzB,EAAqCM,CAArC,CAAnB;AACAC,IAAAA,CAAC,GAAGb,eAAe,CAACE,SAAD,EAAYe,CAAZ,EAAeZ,IAAf,EAAqBC,UAArB,EAAiCO,CAAjC,CAAnB;;AACA,QAAIC,KAAK,GAAG,CAAZ,EAAe;AACbA,MAAAA,KAAK,GAAGI,OAAO,CAACN,CAAD,EAAIT,IAAJ,CAAf;AACD;;AACDY,IAAAA,KAAK,GAAGC,QAAQ,GAAGE,OAAO,CAACL,CAAD,EAAIV,IAAJ,CAA1B;;AAGA,WAAO,IAAP,EAAa;AACX,UAAI,EAAEW,KAAK,GAAGC,KAAV,CAAJ,EAAsB;AAEpBjB,QAAAA,IAAI,CAACa,IAAD,EAAOC,CAAP,CAAJ;;AAEA,YAAIG,KAAK,KAAKC,QAAd,EAAwB;AAEtBlB,UAAAA,IAAI,CAACa,IAAD,EAAOE,CAAP,CAAJ;;AAEA,cAAII,CAAC,GAAGR,SAAS,GAAG,CAApB,EAAuB;AAErBC,YAAAA,MAAM,CAACZ,IAAP,CAAYa,IAAZ;AACAA,YAAAA,IAAI,GAAG,EAAP;AACD;AACF,SATD,MASO,IAAIM,CAAC,KAAKR,SAAS,GAAG,CAAtB,EAAyB;AAC9BX,UAAAA,IAAI,CAACa,IAAD,EAAOE,CAAP,CAAJ;AACD;;AACD;AACD,OAjBD,MAiBO,IAAIC,KAAK,GAAGC,KAAZ,EAAmB;AAExB;AACD,OAHM,MAGA,IAAID,KAAJ,EAAW;AAEhBK,QAAAA,SAAS,CAACP,CAAD,EAAIC,CAAJ,EAAOC,KAAP,EAAcX,IAAd,EAAoBS,CAApB,CAAT;AACAE,QAAAA,KAAK,GAAGI,OAAO,CAACN,CAAD,EAAIT,IAAJ,CAAf;AACD,OAJM,MAIA;AAELgB,QAAAA,SAAS,CAACP,CAAD,EAAIC,CAAJ,EAAOE,KAAP,EAAcZ,IAAd,EAAoBU,CAApB,CAAT;AACAE,QAAAA,KAAK,GAAGG,OAAO,CAACL,CAAD,EAAIV,IAAJ,CAAf;AACD;AACF;;AAEDW,IAAAA,KAAK,GAAGE,QAAR;AACD;;AAED,MAAIL,IAAI,CAACH,MAAT,EAAiBE,MAAM,CAACZ,IAAP,CAAYa,IAAZ;AAEjB,SAAOD,MAAP;AACD;AAMD,OAAO,SAASU,WAAT,CACLlB,SADK,EAELC,IAFK,EAGLC,OAHK,EAQK;AACV,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWE,IAAAA,QAAQ,GAAGL,SAAS,CAACM;AAAhC,MAA0CJ,OAAO,IAAI,EAA3D;AACA,MAAI;AAACE,IAAAA,UAAU,GAAG;AAAd,MAAmBF,OAAO,IAAI,EAAlC;AACA,MAAIK,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BD,IAA1C;AACA,MAAIK,MAAJ;AACA,MAAIW,CAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,MAAJ;AACA,MAAIC,UAAJ;;AAGA,OAAK,IAAIC,IAAI,GAAG,CAAhB,EAAmBA,IAAI,IAAI,CAA3B,EAA8BA,IAAI,IAAI,CAAtC,EAAyC;AACvCf,IAAAA,MAAM,GAAG,EAAT;AACAY,IAAAA,IAAI,GAAGtB,eAAe,CAACE,SAAD,EAAYO,SAAS,GAAG,CAAxB,EAA2BJ,IAA3B,EAAiCC,UAAjC,EAA6CgB,IAA7C,CAAtB;AACAE,IAAAA,UAAU,GAAG,EAAEN,OAAO,CAACI,IAAD,EAAOnB,IAAP,CAAP,GAAsBsB,IAAxB,CAAb;;AAEA,SAAK,IAAIR,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGR,SAApB,EAA+BQ,CAAC,EAAhC,EAAoC;AAClCI,MAAAA,CAAC,GAAGrB,eAAe,CAACE,SAAD,EAAYe,CAAZ,EAAeZ,IAAf,EAAqBC,UAArB,EAAiCe,CAAjC,CAAnB;AACAE,MAAAA,MAAM,GAAG,EAAEL,OAAO,CAACG,CAAD,EAAIlB,IAAJ,CAAP,GAAmBsB,IAArB,CAAT;AAGA,UAAIF,MAAM,KAAKC,UAAf,EAA2B1B,IAAI,CAACY,MAAD,EAASS,SAAS,CAACG,IAAD,EAAOD,CAAP,EAAUI,IAAV,EAAgBtB,IAAhB,CAAlB,CAAJ;AAE3B,UAAIoB,MAAJ,EAAYzB,IAAI,CAACY,MAAD,EAASW,CAAT,CAAJ;AAEZtB,MAAAA,IAAI,CAACuB,IAAD,EAAOD,CAAP,CAAJ;AACAG,MAAAA,UAAU,GAAGD,MAAb;AACD;;AAGDrB,IAAAA,SAAS,GAAGQ,MAAZ;AACAJ,IAAAA,UAAU,GAAG,CAAb;AACAG,IAAAA,SAAS,GAAGC,MAAM,CAACF,MAAP,GAAgBH,IAA5B;AAEA,QAAI,CAACI,SAAL,EAAgB;AACjB;;AAED,SAAOC,MAAP;AACD;AAID,OAAO,SAASS,SAAT,CACLP,CADK,EAELC,CAFK,EAGLY,IAHK,EAILtB,IAJK,EAKLuB,GAAa,GAAG,EALX,EAMK;AACV,MAAIC,CAAJ;AAIA,MAAIC,IAAJ;;AACA,MAAIH,IAAI,GAAG,CAAX,EAAc;AAEZE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJD,MAIO,IAAIH,IAAI,GAAG,CAAX,EAAc;AAEnBE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJM,MAIA,IAAIH,IAAI,GAAG,CAAX,EAAc;AAEnBE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJM,MAIA,IAAIH,IAAI,GAAG,CAAX,EAAc;AAEnBE,IAAAA,CAAC,GAAG,CAACxB,IAAI,CAAC,CAAD,CAAJ,GAAUS,CAAC,CAAC,CAAD,CAAZ,KAAoBC,CAAC,CAAC,CAAD,CAAD,GAAOD,CAAC,CAAC,CAAD,CAA5B,CAAJ;AACAgB,IAAAA,IAAI,GAAG,CAAP;AACD,GAJM,MAIA;AACL,WAAO,IAAP;AACD;;AACD,OAAK,IAAIX,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGL,CAAC,CAACJ,MAAtB,EAA8BS,CAAC,EAA/B,EAAmC;AACjCS,IAAAA,GAAG,CAACT,CAAD,CAAH,GAAS,CAACW,IAAI,GAAG,CAAR,MAAeX,CAAf,GAAmBd,IAAI,CAACyB,IAAD,CAAvB,GAAgCD,CAAC,IAAId,CAAC,CAACI,CAAD,CAAD,GAAOL,CAAC,CAACK,CAAD,CAAZ,CAAD,GAAoBL,CAAC,CAACK,CAAD,CAA9D;AACD;;AACD,SAAOS,GAAP;AACD;AASD,OAAO,SAASR,OAAT,CAAiBG,CAAjB,EAA8BlB,IAA9B,EAAyD;AAC9D,MAAI0B,IAAI,GAAG,CAAX;AAEA,MAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR,CAApB,KAEK,IAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR;AAEzB,MAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR,CAApB,KAEK,IAAIR,CAAC,CAAC,CAAD,CAAD,GAAOlB,IAAI,CAAC,CAAD,CAAf,EAAoB0B,IAAI,IAAI,CAAR;AAEzB,SAAOA,IAAP;AACD","sourcesContent":["/*\n  Adapted from https://github.com/mapbox/lineclip to work with flat arrays\n  and 3d positions\n\n  ISC License\n\n  Copyright (c) 2015, Mapbox\n\n  Permission to use, copy, modify, and/or distribute this software for any purpose\n  with or without fee is hereby granted, provided that the above copyright notice\n  and this permission notice appear in all copies.\n\n  THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\n  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND\n  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\n  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS\n  OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER\n  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF\n  THIS SOFTWARE.\n\n */\n\n/* eslint-disable max-statements, max-depth, complexity */\n\nimport {push, copy, getPointAtIndex} from './utils';\n\ntype BoundingBox = [number, number, number, number];\n\n/**\n * Cohen-Sutherland line clipping algorithm, adapted to efficiently\n * handle polylines rather than just segments\n */\nexport function clipPolyline(\n  positions: number[],\n  bbox: BoundingBox,\n  options?: {\n    size?: number;\n    startIndex?: number;\n    endIndex?: number;\n  }\n): number[][] {\n  const {size = 2, startIndex = 0, endIndex = positions.length} = options || {};\n  const numPoints = (endIndex - startIndex) / size;\n  const result = [];\n  let part = [];\n  let a;\n  let b;\n  let codeA = -1;\n  let codeB;\n  let lastCode;\n\n  for (let i = 1; i < numPoints; i++) {\n    a = getPointAtIndex(positions, i - 1, size, startIndex, a);\n    b = getPointAtIndex(positions, i, size, startIndex, b);\n    if (codeA < 0) {\n      codeA = bitCode(a, bbox);\n    }\n    codeB = lastCode = bitCode(b, bbox);\n\n    // eslint-disable-next-line no-constant-condition\n    while (true) {\n      if (!(codeA | codeB)) {\n        // accept\n        push(part, a);\n\n        if (codeB !== lastCode) {\n          // segment went outside\n          push(part, b);\n\n          if (i < numPoints - 1) {\n            // start a new line\n            result.push(part);\n            part = [];\n          }\n        } else if (i === numPoints - 1) {\n          push(part, b);\n        }\n        break;\n      } else if (codeA & codeB) {\n        // trivial reject\n        break;\n      } else if (codeA) {\n        // a outside, intersect with clip edge\n        intersect(a, b, codeA, bbox, a);\n        codeA = bitCode(a, bbox);\n      } else {\n        // b outside\n        intersect(a, b, codeB, bbox, b);\n        codeB = bitCode(b, bbox);\n      }\n    }\n\n    codeA = lastCode;\n  }\n\n  if (part.length) result.push(part);\n\n  return result;\n}\n\n/**\n * Sutherland-Hodgeman polygon clipping algorithm\n * polygon must be closed (first vertex == last vertex)\n */\nexport function clipPolygon(\n  positions: number[],\n  bbox: BoundingBox,\n  options?: {\n    size?: number;\n    startIndex?: number;\n    endIndex?: number;\n  }\n): number[] {\n  const {size = 2, endIndex = positions.length} = options || {};\n  let {startIndex = 0} = options || {};\n  let numPoints = (endIndex - startIndex) / size;\n  let result;\n  let p;\n  let prev;\n  let inside;\n  let prevInside;\n\n  // clip against each side of the clip rectangle\n  for (let edge = 1; edge <= 8; edge *= 2) {\n    result = [];\n    prev = getPointAtIndex(positions, numPoints - 1, size, startIndex, prev);\n    prevInside = !(bitCode(prev, bbox) & edge);\n\n    for (let i = 0; i < numPoints; i++) {\n      p = getPointAtIndex(positions, i, size, startIndex, p);\n      inside = !(bitCode(p, bbox) & edge);\n\n      // if segment goes through the clip window, add an intersection\n      if (inside !== prevInside) push(result, intersect(prev, p, edge, bbox));\n\n      if (inside) push(result, p); // add a point if it's inside\n\n      copy(prev, p);\n      prevInside = inside;\n    }\n\n    // close loop\n    positions = result;\n    startIndex = 0;\n    numPoints = result.length / size;\n\n    if (!numPoints) break;\n  }\n\n  return result;\n}\n\n/** intersect a segment against one of the 4 lines that make up the bbox */\n\nexport function intersect(\n  a: number[],\n  b: number[],\n  edge: number,\n  bbox: BoundingBox,\n  out: number[] = []\n): number[] {\n  let t;\n  // Forces out[snapI] to be on the bbox edge\n  // Interpolation introduces precision issue which may cause lineclip to be\n  // stuck in an infinite loop\n  let snap;\n  if (edge & 8) {\n    // top\n    t = (bbox[3] - a[1]) / (b[1] - a[1]);\n    snap = 3;\n  } else if (edge & 4) {\n    // bottom\n    t = (bbox[1] - a[1]) / (b[1] - a[1]);\n    snap = 1;\n  } else if (edge & 2) {\n    // right\n    t = (bbox[2] - a[0]) / (b[0] - a[0]);\n    snap = 2;\n  } else if (edge & 1) {\n    // left\n    t = (bbox[0] - a[0]) / (b[0] - a[0]);\n    snap = 0;\n  } else {\n    return null;\n  }\n  for (let i = 0; i < a.length; i++) {\n    out[i] = (snap & 1) === i ? bbox[snap] : t * (b[i] - a[i]) + a[i];\n  }\n  return out;\n}\n\n/**\n * bit code reflects the point position relative to the bbox:\n *         left  mid  right\n *    top  1001  1000  1010\n *    mid  0001  0000  0010\n * bottom  0101  0100  0110\n */\nexport function bitCode(p: number[], bbox: BoundingBox): number {\n  let code = 0;\n\n  if (p[0] < bbox[0]) code |= 1;\n  // left\n  else if (p[0] > bbox[2]) code |= 2; // right\n\n  if (p[1] < bbox[1]) code |= 4;\n  // bottom\n  else if (p[1] > bbox[3]) code |= 8; // top\n\n  return code;\n}\n"],"file":"lineclip.js"}

package/dist/esm/polygon-utils.js

@@ -1,8 +1,11 @@
 import { equals } from '@math.gl/core';
-export const WINDING = {
-  CLOCKWISE: 1,
-  COUNTER_CLOCKWISE: -1
-};
+export let WINDING;
+
+(function (WINDING) {
+  WINDING[WINDING["CLOCKWISE"] = 1] = "CLOCKWISE";
+  WINDING[WINDING["COUNTER_CLOCKWISE"] = -1] = "COUNTER_CLOCKWISE";
+})(WINDING || (WINDING = {}));
+
 export function modifyPolygonWindingDirection(points, direction, options = {}) {
   const windingDirection = getPolygonWindingDirection(points, options);
 

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

@@ -1 +1 @@
-{"version":3,"sources":["../../src/polygon-utils.js"],"names":["equals","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,SAAQA,MAAR,QAAqB,eAArB;AAGA,OAAO,MAAMC,OAAO,GAAG;AACrBC,EAAAA,SAAS,EAAE,CADU;AAErBC,EAAAA,iBAAiB,EAAE,CAAC;AAFC,CAAhB;AAMP,OAAO,SAASC,6BAAT,CAAuCC,MAAvC,EAA+CC,SAA/C,EAA0DC,OAAO,GAAG,EAApE,EAAwE;AAC7E,QAAMC,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;AAGD,OAAO,SAASE,0BAAT,CAAoCJ,MAApC,EAA4CE,OAAO,GAAG,EAAtD,EAA0D;AAC/D,SAAOI,IAAI,CAACC,IAAL,CAAUC,oBAAoB,CAACR,MAAD,EAASE,OAAT,CAA9B,CAAP;AACD;AAGD,OAAO,SAASM,oBAAT,CAA8BR,MAA9B,EAAsCE,OAAO,GAAG,EAAhD,EAAoD;AAEzD,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW;AAAzB,MAAmCT,OAAzC;AACA,QAAMU,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;AAGD,OAAO,SAASG,uBAAT,CAAiCjB,MAAjC,EAAyCkB,OAAzC,EAAkDhB,OAAO,GAAG,EAA5D,EAAgE;AACrE,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW,MAAzB;AAAiCE,IAAAA,IAAI,GAAG,CAAxC;AAA2CM,IAAAA;AAA3C,MAAuDjB,OAA7D;AAEA,QAAMkB,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,QAAMM,aAAa,GAAGZ,KAAK,GAAG,CAACW,SAAS,GAAG,CAAb,IAAkBP,IAAhD;AACA,QAAMS,UAAU,GACdH,QAAQ,IACPxB,MAAM,CAACK,MAAM,CAACS,KAAD,CAAP,EAAgBT,MAAM,CAACqB,aAAD,CAAtB,CAAN,IACC1B,MAAM,CAACK,MAAM,CAACS,KAAK,GAAG,CAAT,CAAP,EAAoBT,MAAM,CAACqB,aAAa,GAAG,CAAjB,CAA1B,CAHV;;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,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW,MAAzB;AAAiCE,IAAAA,IAAI,GAAG;AAAxC,MAA6CX,OAAnD;AAEA,QAAMkB,SAAS,GAAG,CAACV,GAAG,GAAGD,KAAP,IAAgBI,IAAlC;AACA,QAAMU,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,UAAMU,EAAE,GAAGhB,KAAK,GAAGM,CAAC,GAAGF,IAAvB;AACA,UAAMa,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,YAAMW,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;;AAGD,OAAO,SAASC,mCAAT,CAA6C5B,MAA7C,EAAqDC,SAArD,EAAgEC,OAAO,GAAG,EAA1E,EAA8E;AACnF,QAAM2B,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;AAGD,OAAO,SAASD,gCAAT,CAA0C9B,MAA1C,EAAkDE,OAAO,GAAG,EAA5D,EAAgE;AACrE,SAAOI,IAAI,CAACC,IAAL,CAAUyB,0BAA0B,CAAChC,MAAD,EAASE,OAAT,CAApC,CAAP;AACD;AAGD,OAAO,SAAS8B,0BAAT,CAAoChC,MAApC,EAA4CE,OAAO,GAAG,EAAtD,EAA0D;AAE/D,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW;AAAzB,MAAmCT,OAAzC;AACA,MAAIY,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;AAGD,OAAO,SAASmB,6BAAT,CAAuCjC,MAAvC,EAA+CkB,OAA/C,EAAwDhB,OAAO,GAAG,EAAlE,EAAsE;AAC3E,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW,MAAzB;AAAiCQ,IAAAA;AAAjC,MAA6CjB,OAAnD;;AACA,OAAK,IAAIa,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,QAAMO,UAAU,GAAGH,QAAQ,IAAIxB,MAAM,CAACK,MAAM,CAACU,GAAG,GAAG,CAAP,CAAP,EAAkBV,MAAM,CAAC,CAAD,CAAxB,CAArC;;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":["equals","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,SAAQA,MAAR,QAAqB,eAArB;AAGA,WAAYC,OAAZ;;WAAYA,O;AAAAA,EAAAA,O,CAAAA,O;AAAAA,EAAAA,O,CAAAA,O;GAAAA,O,KAAAA,O;;AA0CZ,OAAO,SAASC,6BAAT,CACLC,MADK,EAELC,SAFK,EAGLC,OAAsB,GAAG,EAHpB,EAII;AACT,QAAMC,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;AAQD,OAAO,SAASE,0BAAT,CACLJ,MADK,EAELE,OAAsB,GAAG,EAFpB,EAGG;AACR,SAAOI,IAAI,CAACC,IAAL,CAAUC,oBAAoB,CAACR,MAAD,EAASE,OAAT,CAA9B,CAAP;AACD;AASD,OAAO,SAASM,oBAAT,CAA8BR,MAA9B,EAAoDE,OAAsB,GAAG,EAA7E,EAAyF;AAC9F,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW;AAAzB,MAAmCT,OAAzC;AACA,QAAMU,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;AAQD,OAAO,SAASG,uBAAT,CACLjB,MADK,EAELkB,OAFK,EAGLhB,OAAsB,GAAG,EAHpB,EAIC;AACN,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW,MAAzB;AAAiCE,IAAAA,IAAI,GAAG,CAAxC;AAA2CM,IAAAA;AAA3C,MAAuDjB,OAA7D;AAEA,QAAMkB,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,QAAMM,aAAa,GAAGZ,KAAK,GAAG,CAACW,SAAS,GAAG,CAAb,IAAkBP,IAAhD;AACA,QAAMS,UAAU,GACdH,QAAQ,IACPtB,MAAM,CAACG,MAAM,CAACS,KAAD,CAAP,EAAgBT,MAAM,CAACqB,aAAD,CAAtB,CAAN,IACCxB,MAAM,CAACG,MAAM,CAACS,KAAK,GAAG,CAAT,CAAP,EAAoBT,MAAM,CAACqB,aAAa,GAAG,CAAjB,CAA1B,CAHV;;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,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW,MAAzB;AAAiCE,IAAAA,IAAI,GAAG;AAAxC,MAA6CX,OAAnD;AAEA,QAAMkB,SAAS,GAAG,CAACV,GAAG,GAAGD,KAAP,IAAgBI,IAAlC;AACA,QAAMU,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,UAAMU,EAAE,GAAGhB,KAAK,GAAGM,CAAC,GAAGF,IAAvB;AACA,UAAMa,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,YAAMW,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;;AAUD,OAAO,SAASC,mCAAT,CACL5B,MADK,EAELC,SAFK,EAGLC,OAAsB,GAAG,EAHpB,EAII;AACT,QAAM2B,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;AAQD,OAAO,SAASD,gCAAT,CACL9B,MADK,EAELE,OAAsB,GAAG,EAFpB,EAGG;AACR,SAAOI,IAAI,CAACC,IAAL,CAAUyB,0BAA0B,CAAChC,MAAD,EAASE,OAAT,CAApC,CAAP;AACD;AAQD,OAAO,SAAS8B,0BAAT,CACLhC,MADK,EAELE,OAAsB,GAAG,EAFpB,EAGG;AAER,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW;AAAzB,MAAmCT,OAAzC;AACA,MAAIY,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;AAQD,OAAO,SAASmB,6BAAT,CACLjC,MADK,EAELkB,OAFK,EAGLhB,OAAsB,GAAG,EAHpB,EAIC;AACN,QAAM;AAACO,IAAAA,KAAK,GAAG,CAAT;AAAYC,IAAAA,GAAG,GAAGV,MAAM,CAACW,MAAzB;AAAiCQ,IAAAA;AAAjC,MAA6CjB,OAAnD;;AACA,OAAK,IAAIa,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,QAAMO,UAAU,GAAGH,QAAQ,IAAItB,MAAM,CAACG,MAAM,CAACU,GAAG,GAAG,CAAP,CAAP,EAAkBV,MAAM,CAAC,CAAD,CAAxB,CAArC;;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(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/**\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/esm/polygon.js

@@ -1,7 +1,14 @@
+import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
 import { isArray } from '@math.gl/core';
 import { getPolygonSignedArea, forEachSegmentInPolygon, modifyPolygonWindingDirection, getPolygonSignedAreaPoints, forEachSegmentInPolygonPoints, modifyPolygonWindingDirectionPoints } from './polygon-utils';
 export default class Polygon {
   constructor(points, options = {}) {
+    _defineProperty(this, "points", void 0);
+
+    _defineProperty(this, "isFlatArray", void 0);
+
+    _defineProperty(this, "options", void 0);
+
     this.points = points;
     this.isFlatArray = !isArray(points[0]);
     this.options = {

package/dist/esm/polygon.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/polygon.js"],"names":["isArray","getPolygonSignedArea","forEachSegmentInPolygon","modifyPolygonWindingDirection","getPolygonSignedAreaPoints","forEachSegmentInPolygonPoints","modifyPolygonWindingDirectionPoints","Polygon","constructor","points","options","isFlatArray","start","end","length","size","isClosed","Object","freeze","getSignedArea","getArea","Math","abs","getWindingDirection","sign","forEachSegment","visitor","x1","y1","x2","y2","i1","i2","modifyWindingDirection","direction"],"mappings":"AAGA,SAAQA,OAAR,QAAsB,eAAtB;AAEA,SACEC,oBADF,EAEEC,uBAFF,EAGEC,6BAHF,EAIEC,0BAJF,EAKEC,6BALF,EAMEC,mCANF,QAOO,iBAPP;AASA,eAAe,MAAMC,OAAN,CAAc;AAC3BC,EAAAA,WAAW,CAACC,MAAD,EAASC,OAAO,GAAG,EAAnB,EAAuB;AAChC,SAAKD,MAAL,GAAcA,MAAd;AACA,SAAKE,WAAL,GAAmB,CAACX,OAAO,CAACS,MAAM,CAAC,CAAD,CAAP,CAA3B;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;;AAEDC,EAAAA,aAAa,GAAG;AACd,QAAI,KAAKR,WAAT,EAAsB,OAAOV,oBAAoB,CAAC,KAAKQ,MAAN,EAAc,KAAKC,OAAnB,CAA3B;AAEtB,WAAON,0BAA0B,CAAC,KAAKK,MAAN,EAAc,KAAKC,OAAnB,CAAjC;AACD;;AAEDU,EAAAA,OAAO,GAAG;AACR,WAAOC,IAAI,CAACC,GAAL,CAAS,KAAKH,aAAL,EAAT,CAAP;AACD;;AAEDI,EAAAA,mBAAmB,GAAG;AACpB,WAAOF,IAAI,CAACG,IAAL,CAAU,KAAKL,aAAL,EAAV,CAAP;AACD;;AAEDM,EAAAA,cAAc,CAACC,OAAD,EAAU;AACtB,QAAI,KAAKf,WAAT,EAAsB;AACpBT,MAAAA,uBAAuB,CACrB,KAAKO,MADgB,EAGrB,CAACkB,EAAD,EAAKC,EAAL,EAASC,EAAT,EAAaC,EAAb,EAAiBC,EAAjB,EAAqBC,EAArB,KAA4B;AAE1BN,QAAAA,OAAO,CAAC,CAACC,EAAD,EAAKC,EAAL,CAAD,EAAW,CAACC,EAAD,EAAKC,EAAL,CAAX,EAAqBC,EAArB,EAAyBC,EAAzB,CAAP;AACD,OANoB,EAOrB,KAAKtB,OAPgB,CAAvB;AASD,KAVD,MAUO;AACLL,MAAAA,6BAA6B,CAAC,KAAKI,MAAN,EAAciB,OAAd,EAAuB,KAAKhB,OAA5B,CAA7B;AACD;AACF;;AAEDuB,EAAAA,sBAAsB,CAACC,SAAD,EAAY;AAChC,QAAI,KAAKvB,WAAT,EAAsB;AACpB,aAAOR,6BAA6B,CAAC,KAAKM,MAAN,EAAcyB,SAAd,EAAyB,KAAKxB,OAA9B,CAApC;AACD;;AACD,WAAOJ,mCAAmC,CAAC,KAAKG,MAAN,EAAcyB,SAAd,EAAyB,KAAKxB,OAA9B,CAA1C;AACD;;AAlD0B","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":["isArray","getPolygonSignedArea","forEachSegmentInPolygon","modifyPolygonWindingDirection","getPolygonSignedAreaPoints","forEachSegmentInPolygonPoints","modifyPolygonWindingDirectionPoints","Polygon","constructor","points","options","isFlatArray","start","end","length","size","isClosed","Object","freeze","getSignedArea","getArea","Math","abs","getWindingDirection","sign","forEachSegment","visitor","x1","y1","x2","y2","i1","i2","modifyWindingDirection","direction"],"mappings":";AACA,SAAQA,OAAR,QAAsB,eAAtB;AAGA,SACEC,oBADF,EAEEC,uBAFF,EAGEC,6BAHF,EAIEC,0BAJF,EAKEC,6BALF,EAMEC,mCANF,QAOO,iBAPP;AAgBA,eAAe,MAAMC,OAAN,CAAc;AAK3BC,EAAAA,WAAW,CAACC,MAAD,EAA0BC,OAAuB,GAAG,EAApD,EAAwD;AAAA;;AAAA;;AAAA;;AACjE,SAAKD,MAAL,GAAcA,MAAd;AACA,SAAKE,WAAL,GAAmB,CAACX,OAAO,CAACS,MAAM,CAAC,CAAD,CAAP,CAA3B;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;;AAMDC,EAAAA,aAAa,GAAW;AACtB,QAAI,KAAKR,WAAT,EAAsB,OAAOV,oBAAoB,CAAC,KAAKQ,MAAN,EAAc,KAAKC,OAAnB,CAA3B;AAEtB,WAAON,0BAA0B,CAAC,KAAKK,MAAN,EAAc,KAAKC,OAAnB,CAAjC;AACD;;AAMDU,EAAAA,OAAO,GAAW;AAChB,WAAOC,IAAI,CAACC,GAAL,CAAS,KAAKH,aAAL,EAAT,CAAP;AACD;;AAMDI,EAAAA,mBAAmB,GAAW;AAC5B,WAAOF,IAAI,CAACG,IAAL,CAAU,KAAKL,aAAL,EAAV,CAAP;AACD;;AAMDM,EAAAA,cAAc,CAACC,OAAD,EAAsC;AAClD,QAAI,KAAKf,WAAT,EAAsB;AACpBT,MAAAA,uBAAuB,CACrB,KAAKO,MADgB,EAGrB,CAACkB,EAAD,EAAKC,EAAL,EAASC,EAAT,EAAaC,EAAb,EAAiBC,EAAjB,EAAqBC,EAArB,KAA4B;AAE1BN,QAAAA,OAAO,CAAC,CAACC,EAAD,EAAKC,EAAL,CAAD,EAAW,CAACC,EAAD,EAAKC,EAAL,CAAX,EAAqBC,EAArB,EAAyBC,EAAzB,CAAP;AACD,OANoB,EAOrB,KAAKtB,OAPgB,CAAvB;AASD,KAVD,MAUO;AACLL,MAAAA,6BAA6B,CAAC,KAAKI,MAAN,EAAciB,OAAd,EAAuB,KAAKhB,OAA5B,CAA7B;AACD;AACF;;AAODuB,EAAAA,sBAAsB,CAACC,SAAD,EAA6B;AACjD,QAAI,KAAKvB,WAAT,EAAsB;AACpB,aAAOR,6BAA6B,CAAC,KAAKM,MAAN,EAAcyB,SAAd,EAAyB,KAAKxB,OAA9B,CAApC;AACD;;AACD,WAAOJ,mCAAmC,CAAC,KAAKG,MAAN,EAAcyB,SAAd,EAAyB,KAAKxB,OAA9B,CAA1C;AACD;;AA3E0B","sourcesContent":["/* eslint-disable no-undef, no-console */\nimport {isArray} from '@math.gl/core';\nimport type {SegmentVisitorPoints} from './polygon-utils';\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; // : number[];\n  isFlatArray: boolean;\n  options: PolygonOptions;\n\n  constructor(points /* : 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, this.options);\n\n    return getPolygonSignedAreaPoints(this.points, 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,\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  /**\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, direction, this.options);\n    }\n    return modifyPolygonWindingDirectionPoints(this.points, direction, this.options);\n  }\n}\n"],"file":"polygon.js"}

package/dist/esm/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":"AAAA,OAAO,SAASA,IAAT,CAAcC,MAAd,EAAsBC,MAAtB,EAA8B;AACnC,QAAMC,IAAI,GAAGD,MAAM,CAACE,MAApB;AACA,QAAMC,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,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7BN,IAAAA,MAAM,CAACI,UAAU,GAAGE,CAAd,CAAN,GAAyBL,MAAM,CAACK,CAAD,CAA/B;AACD;;AACD,SAAO,IAAP;AACD;AAED,OAAO,SAASC,IAAT,CAAcP,MAAd,EAAsBC,MAAtB,EAA8B;AACnC,QAAMC,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;AAED,OAAO,SAASE,eAAT,CAAyBC,SAAzB,EAAoCC,KAApC,EAA2CR,IAA3C,EAAiDS,MAAjD,EAAyDC,GAAG,GAAG,EAA/D,EAAmE;AACxE,QAAMC,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":"AAAA,OAAO,SAASA,IAAT,CAAcC,MAAd,EAAsBC,MAAtB,EAA8B;AACnC,QAAMC,IAAI,GAAGD,MAAM,CAACE,MAApB;AACA,QAAMC,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,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGJ,IAApB,EAA0BI,CAAC,EAA3B,EAA+B;AAC7BN,IAAAA,MAAM,CAACI,UAAU,GAAGE,CAAd,CAAN,GAAyBL,MAAM,CAACK,CAAD,CAA/B;AACD;;AACD,SAAO,IAAP;AACD;AAED,OAAO,SAASC,IAAT,CAAcP,MAAd,EAAsBC,MAAtB,EAA8B;AACnC,QAAMC,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;AAED,OAAO,SAASE,eAAT,CAAyBC,SAAzB,EAAoCC,KAApC,EAA2CR,IAA3C,EAAiDS,MAAjD,EAAyDC,GAAG,GAAG,EAA/D,EAAmE;AACxE,QAAMC,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"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+export { default as Polygon } from './polygon';
+export { getPolygonSignedArea, getPolygonWindingDirection, forEachSegmentInPolygon, modifyPolygonWindingDirection, WINDING } from './polygon-utils';
+export { earcut } from './earcut';
+export { clipPolygon, clipPolyline } from './lineclip';
+export { cutPolygonByGrid, cutPolylineByGrid } from './cut-by-grid';
+export { cutPolylineByMercatorBounds, cutPolygonByMercatorBounds } from './cut-by-mercator-bounds';
+export { default as _Polygon } from './polygon';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,OAAO,IAAI,OAAO,EAAC,MAAM,WAAW,CAAC;AAE7C,OAAO,EACL,oBAAoB,EACpB,0BAA0B,EAC1B,uBAAuB,EACvB,6BAA6B,EAC7B,OAAO,EACR,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EAAC,MAAM,EAAC,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAC,WAAW,EAAE,YAAY,EAAC,MAAM,YAAY,CAAC;AAErD,OAAO,EAAC,gBAAgB,EAAE,iBAAiB,EAAC,MAAM,eAAe,CAAC;AAElE,OAAO,EAAC,2BAA2B,EAAE,0BAA0B,EAAC,MAAM,0BAA0B,CAAC;AAGjG,OAAO,EAAC,OAAO,IAAI,QAAQ,EAAC,MAAM,WAAW,CAAC"}

package/dist/index.js

@@ -0,0 +1,8 @@
+export { default as Polygon } from './polygon';
+export { getPolygonSignedArea, getPolygonWindingDirection, forEachSegmentInPolygon, modifyPolygonWindingDirection, WINDING } from './polygon-utils';
+export { earcut } from './earcut';
+export { clipPolygon, clipPolyline } from './lineclip';
+export { cutPolygonByGrid, cutPolylineByGrid } from './cut-by-grid';
+export { cutPolylineByMercatorBounds, cutPolygonByMercatorBounds } from './cut-by-mercator-bounds';
+// DEPRECATED
+export { default as _Polygon } from './polygon';

package/dist/lineclip.d.ts

@@ -0,0 +1,31 @@
+declare type BoundingBox = [number, number, number, number];
+/**
+ * Cohen-Sutherland line clipping algorithm, adapted to efficiently
+ * handle polylines rather than just segments
+ */
+export declare function clipPolyline(positions: number[], bbox: BoundingBox, options?: {
+    size?: number;
+    startIndex?: number;
+    endIndex?: number;
+}): number[][];
+/**
+ * Sutherland-Hodgeman polygon clipping algorithm
+ * polygon must be closed (first vertex == last vertex)
+ */
+export declare function clipPolygon(positions: number[], bbox: BoundingBox, options?: {
+    size?: number;
+    startIndex?: number;
+    endIndex?: number;
+}): number[];
+/** intersect a segment against one of the 4 lines that make up the bbox */
+export declare function intersect(a: number[], b: number[], edge: number, bbox: BoundingBox, out?: number[]): number[];
+/**
+ * bit code reflects the point position relative to the bbox:
+ *         left  mid  right
+ *    top  1001  1000  1010
+ *    mid  0001  0000  0010
+ * bottom  0101  0100  0110
+ */
+export declare function bitCode(p: number[], bbox: BoundingBox): number;
+export {};
+//# sourceMappingURL=lineclip.d.ts.map

package/dist/lineclip.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineclip.d.ts","sourceRoot":"","sources":["../src/lineclip.ts"],"names":[],"mappings":"AA0BA,aAAK,WAAW,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAEpD;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,SAAS,EAAE,MAAM,EAAE,EACnB,IAAI,EAAE,WAAW,EACjB,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GACA,MAAM,EAAE,EAAE,CA0DZ;AAED;;;GAGG;AACH,wBAAgB,WAAW,CACzB,SAAS,EAAE,MAAM,EAAE,EACnB,IAAI,EAAE,WAAW,EACjB,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GACA,MAAM,EAAE,CAsCV;AAED,2EAA2E;AAE3E,wBAAgB,SAAS,CACvB,CAAC,EAAE,MAAM,EAAE,EACX,CAAC,EAAE,MAAM,EAAE,EACX,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,WAAW,EACjB,GAAG,GAAE,MAAM,EAAO,GACjB,MAAM,EAAE,CA6BV;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,WAAW,GAAG,MAAM,CAY9D"}

package/dist/lineclip.js

@@ -0,0 +1,178 @@
+/*
+  Adapted from https://github.com/mapbox/lineclip to work with flat arrays
+  and 3d positions
+
+  ISC License
+
+  Copyright (c) 2015, Mapbox
+
+  Permission to use, copy, modify, and/or distribute this software for any purpose
+  with or without fee is hereby granted, provided that the above copyright notice
+  and this permission notice appear in all copies.
+
+  THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
+  FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
+  OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+  TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
+  THIS SOFTWARE.
+
+ */
+/* eslint-disable max-statements, max-depth, complexity */
+import { push, copy, getPointAtIndex } from './utils';
+/**
+ * Cohen-Sutherland line clipping algorithm, adapted to efficiently
+ * handle polylines rather than just segments
+ */
+export function clipPolyline(positions, bbox, options) {
+    const { size = 2, startIndex = 0, endIndex = positions.length } = options || {};
+    const numPoints = (endIndex - startIndex) / size;
+    const result = [];
+    let part = [];
+    let a;
+    let b;
+    let codeA = -1;
+    let codeB;
+    let lastCode;
+    for (let i = 1; i < numPoints; i++) {
+        a = getPointAtIndex(positions, i - 1, size, startIndex, a);
+        b = getPointAtIndex(positions, i, size, startIndex, b);
+        if (codeA < 0) {
+            codeA = bitCode(a, bbox);
+        }
+        codeB = lastCode = bitCode(b, bbox);
+        // eslint-disable-next-line no-constant-condition
+        while (true) {
+            if (!(codeA | codeB)) {
+                // accept
+                push(part, a);
+                if (codeB !== lastCode) {
+                    // segment went outside
+                    push(part, b);
+                    if (i < numPoints - 1) {
+                        // start a new line
+                        result.push(part);
+                        part = [];
+                    }
+                }
+                else if (i === numPoints - 1) {
+                    push(part, b);
+                }
+                break;
+            }
+            else if (codeA & codeB) {
+                // trivial reject
+                break;
+            }
+            else if (codeA) {
+                // a outside, intersect with clip edge
+                intersect(a, b, codeA, bbox, a);
+                codeA = bitCode(a, bbox);
+            }
+            else {
+                // b outside
+                intersect(a, b, codeB, bbox, b);
+                codeB = bitCode(b, bbox);
+            }
+        }
+        codeA = lastCode;
+    }
+    if (part.length)
+        result.push(part);
+    return result;
+}
+/**
+ * Sutherland-Hodgeman polygon clipping algorithm
+ * polygon must be closed (first vertex == last vertex)
+ */
+export function clipPolygon(positions, bbox, options) {
+    const { size = 2, endIndex = positions.length } = options || {};
+    let { startIndex = 0 } = options || {};
+    let numPoints = (endIndex - startIndex) / size;
+    let result;
+    let p;
+    let prev;
+    let inside;
+    let prevInside;
+    // clip against each side of the clip rectangle
+    for (let edge = 1; edge <= 8; edge *= 2) {
+        result = [];
+        prev = getPointAtIndex(positions, numPoints - 1, size, startIndex, prev);
+        prevInside = !(bitCode(prev, bbox) & edge);
+        for (let i = 0; i < numPoints; i++) {
+            p = getPointAtIndex(positions, i, size, startIndex, p);
+            inside = !(bitCode(p, bbox) & edge);
+            // if segment goes through the clip window, add an intersection
+            if (inside !== prevInside)
+                push(result, intersect(prev, p, edge, bbox));
+            if (inside)
+                push(result, p); // add a point if it's inside
+            copy(prev, p);
+            prevInside = inside;
+        }
+        // close loop
+        positions = result;
+        startIndex = 0;
+        numPoints = result.length / size;
+        if (!numPoints)
+            break;
+    }
+    return result;
+}
+/** intersect a segment against one of the 4 lines that make up the bbox */
+export function intersect(a, b, edge, bbox, out = []) {
+    let t;
+    // Forces out[snapI] to be on the bbox edge
+    // Interpolation introduces precision issue which may cause lineclip to be
+    // stuck in an infinite loop
+    let snap;
+    if (edge & 8) {
+        // top
+        t = (bbox[3] - a[1]) / (b[1] - a[1]);
+        snap = 3;
+    }
+    else if (edge & 4) {
+        // bottom
+        t = (bbox[1] - a[1]) / (b[1] - a[1]);
+        snap = 1;
+    }
+    else if (edge & 2) {
+        // right
+        t = (bbox[2] - a[0]) / (b[0] - a[0]);
+        snap = 2;
+    }
+    else if (edge & 1) {
+        // left
+        t = (bbox[0] - a[0]) / (b[0] - a[0]);
+        snap = 0;
+    }
+    else {
+        return null;
+    }
+    for (let i = 0; i < a.length; i++) {
+        out[i] = (snap & 1) === i ? bbox[snap] : t * (b[i] - a[i]) + a[i];
+    }
+    return out;
+}
+/**
+ * bit code reflects the point position relative to the bbox:
+ *         left  mid  right
+ *    top  1001  1000  1010
+ *    mid  0001  0000  0010
+ * bottom  0101  0100  0110
+ */
+export function bitCode(p, bbox) {
+    let code = 0;
+    if (p[0] < bbox[0])
+        code |= 1;
+    // left
+    else if (p[0] > bbox[2])
+        code |= 2; // right
+    if (p[1] < bbox[1])
+        code |= 4;
+    // bottom
+    else if (p[1] > bbox[3])
+        code |= 8; // top
+    return code;
+}

package/dist/{es5/polygon-utils.d.ts → polygon-utils.d.ts}

@@ -1,34 +1,21 @@
-import {NumberArray} from '@math.gl/core/';
-
-export const WINDING: {
-  CLOCKWISE: number;
-  COUNTER_CLOCKWISE: number;
+import type { NumericArray } from '@math.gl/core';
+export declare enum WINDING {
+    CLOCKWISE = 1,
+    COUNTER_CLOCKWISE = -1
+}
+/** Polygon representation where each point is represented as a separate array of positions. */
+declare type PointsArray = NumericArray[];
+/** Segment visitor callback type for polygons defined with flat arrays, */
+declare type SegmentVisitorFlat = (p1x: number, p1y: number, p2x: number, p2y: number, i1: number, i2: number) => void;
+/** Segment visitor callback type for polygons defined with array of points. */
+export declare type SegmentVisitorPoints = (p1: NumericArray, p2: NumericArray, i1: number, i2: number) => void;
+/** Parameters of a polygon. */
+declare type PolygonParams = {
+    start?: number;
+    end?: number;
+    size?: number;
+    isClosed?: boolean;
 };
-
-// Polygon representation where each point is represented as a separate array of positions.
-type PointsArray = NumberArray[];
-
-// Segment visitor callback type for polygons defined with flat arrays,
-type SegmentVisitorFlat = (
-  p1x: number,
-  p1y: number,
-  p2x: number,
-  p2y: number,
-  i1: number,
-  i2: number
-) => void;
-
-// Segment visitor callback type for polygons defined with array of points.
-export type SegmentVisitorPoints = (p1: NumberArray, p2: NumberArray, i1: number, i2: number) => void;
-
-// Parameters of a polygon.
-type PolygonParams = {
-  start?: number; // Start index of the polygon in the array of positions. Defaults to 0.
-  end?: number; // End index of the polygon in the array of positions. Defaults to number of positions.
-  size?: number; // Size of a point, 2 (XZ) or 3 (XYZ). Defaults to 2. Affects only polygons stored in flat arrays.
-  isClosed?: boolean; // Indicates that the first point of the polygon is equal to the last point, and additional checks should be ommited.
-};
-
 /**
  * Checks winding direction of the polygon and reverses the polygon in case of opposite winding direction.
  * Note: points are modified in-place.
@@ -37,40 +24,29 @@ type PolygonParams = {
  * @param options Parameters of the polygon.
  * @return Returns true if the winding direction was changed.
  */
-export function modifyPolygonWindingDirection(
-  points: NumberArray,
-  direction: number,
-  options?: PolygonParams
-): boolean;
-
+export declare function modifyPolygonWindingDirection(points: NumericArray, direction: number, options?: PolygonParams): boolean;
 /**
  * Returns winding direction of the polygon.
  * @param points An array that represents points of the polygon.
  * @param options Parameters of the polygon.
  * @returns Winding direction of the polygon.
  */
-export function getPolygonWindingDirection(points: NumberArray, options?: PolygonParams): number;
-
+export declare function getPolygonWindingDirection(points: NumericArray, options?: PolygonParams): number;
 /**
  * Returns signed area of the polygon.
  * @param points An array that represents points of the polygon.
  * @param options Parameters of the polygon.
  * @returns Signed area of the polygon.
+ * https://en.wikipedia.org/wiki/Shoelace_formula
  */
-export function getPolygonSignedArea(points: NumberArray, options?: PolygonParams): number;
-
+export declare function getPolygonSignedArea(points: NumericArray, options?: PolygonParams): number;
 /**
  * Calls the visitor callback for each segment in the polygon.
  * @param points An array that represents points of the polygon
  * @param visitor A callback to call for each segment.
  * @param options Parameters of the polygon.
  */
-export function forEachSegmentInPolygon(
-  points: NumberArray,
-  visitor: SegmentVisitorFlat,
-  options?: PolygonParams
-): void;
-
+export declare function forEachSegmentInPolygon(points: NumericArray, visitor: SegmentVisitorFlat, options?: PolygonParams): void;
 /**
  * Checks winding direction of the polygon and reverses the polygon in case of opposite winding direction.
  * Note: points are modified in-place.
@@ -79,39 +55,27 @@ export function forEachSegmentInPolygon(
  * @param options Parameters of the polygon.
  * @return Returns true if the winding direction was changed.
  */
-export function modifyPolygonWindingDirectionPoints(
-  points: PointsArray,
-  direction: number,
-  options?: PolygonParams
-): boolean;
-
+export declare function modifyPolygonWindingDirectionPoints(points: PointsArray, direction: number, options?: PolygonParams): boolean;
 /**
  * Returns winding direction of the polygon.
  * @param points Array of points that represent the polygon.
  * @param options Parameters of the polygon.
  * @returns Winding direction of the polygon.
  */
-export function getPolygonWindingDirectionPoints(
-  points: PointsArray,
-  options?: PolygonParams
-): number;
-
+export declare function getPolygonWindingDirectionPoints(points: PointsArray, options?: PolygonParams): number;
 /**
  * Returns signed area of the polygon.
  * @param points Array of points that represent the polygon.
  * @param options Parameters of the polygon.
  * @returns Signed area of the polygon.
  */
-export function getPolygonSignedAreaPoints(points: PointsArray, options?: PolygonParams): number;
-
+export declare function getPolygonSignedAreaPoints(points: PointsArray, options?: PolygonParams): number;
 /**
  * Calls visitor callback for each segment in the polygon.
  * @param points Array of points that represent the polygon.
  * @param visitor A callback to call for each segment.
  * @param options Parameters of the polygon.
  */
-export function forEachSegmentInPolygonPoints(
-  points: PointsArray,
-  visitor: SegmentVisitorPoints,
-  options?: PolygonParams
-): void;
+export declare function forEachSegmentInPolygonPoints(points: PointsArray, visitor: SegmentVisitorPoints, options?: PolygonParams): void;
+export {};
+//# sourceMappingURL=polygon-utils.d.ts.map

package/dist/polygon-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"polygon-utils.d.ts","sourceRoot":"","sources":["../src/polygon-utils.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAEhD,oBAAY,OAAO;IACjB,SAAS,IAAI;IACb,iBAAiB,KAAK;CACvB;AAED,+FAA+F;AAC/F,aAAK,WAAW,GAAG,YAAY,EAAE,CAAC;AAElC,2EAA2E;AAC3E,aAAK,kBAAkB,GAAG,CACxB,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,KACP,IAAI,CAAC;AAEV,+EAA+E;AAC/E,oBAAY,oBAAoB,GAAG,CACjC,EAAE,EAAE,YAAY,EAChB,EAAE,EAAE,YAAY,EAChB,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,KACP,IAAI,CAAC;AAEV,+BAA+B;AAC/B,aAAK,aAAa,GAAG;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,6BAA6B,CAC3C,MAAM,EAAE,YAAY,EACpB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,aAAkB,GAC1B,OAAO,CAOT;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,YAAY,EACpB,OAAO,GAAE,aAAkB,GAC1B,MAAM,CAER;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,YAAY,EAAE,OAAO,GAAE,aAAkB,GAAG,MAAM,CAS9F;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,MAAM,EAAE,YAAY,EACpB,OAAO,EAAE,kBAAkB,EAC3B,OAAO,GAAE,aAAkB,GAC1B,IAAI,CA+BN;AAkBD;;;;;;;GAOG;AACH,wBAAgB,mCAAmC,CACjD,MAAM,EAAE,WAAW,EACnB,SAAS,EAAE,MAAM,EACjB,OAAO,GAAE,aAAkB,GAC1B,OAAO,CAOT;AAED;;;;;GAKG;AACH,wBAAgB,gCAAgC,CAC9C,MAAM,EAAE,WAAW,EACnB,OAAO,GAAE,aAAkB,GAC1B,MAAM,CAER;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CACxC,MAAM,EAAE,WAAW,EACnB,OAAO,GAAE,aAAkB,GAC1B,MAAM,CASR;AAED;;;;;GAKG;AACH,wBAAgB,6BAA6B,CAC3C,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,oBAAoB,EAC7B,OAAO,GAAE,aAAkB,GAC1B,IAAI,CAUN"}