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

package/dist/cut-by-grid.d.ts

@@ -12,6 +12,9 @@ export declare function cutPolylineByGrid(positions: NumericArray, options?: {
     startIndex?: number;
     endIndex?: number;
 }): number[] | number[][];
+/**
+ * Cuts a polygon by a pre-defined grid
+ */
 export declare function cutPolygonByGrid(positions: Readonly<NumericArray>, holeIndices?: Readonly<NumericArray> | null, options?: {
     size?: number;
     gridResolution?: number;

package/dist/cut-by-grid.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cut-by-grid.d.ts","sourceRoot":"","sources":["../src/cut-by-grid.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAEhD,oBAAY,OAAO,GAAG;IACpB,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IAClC,WAAW,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACrC,SAAS,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;CACpC,CAAC;AAEF,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,YAAY,EACvB,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GACA,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAkDvB;AAYD,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,EACjC,WAAW,GAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,IAAW,EACjD,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,GACA,OAAO,EAAE,CAmEX"}
+{"version":3,"file":"cut-by-grid.d.ts","sourceRoot":"","sources":["../src/cut-by-grid.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAEhD,oBAAY,OAAO,GAAG;IACpB,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IAClC,WAAW,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACrC,SAAS,CAAC,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;CACpC,CAAC;AAEF,wBAAgB,iBAAiB,CAC/B,SAAS,EAAE,YAAY,EACvB,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,GACA,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAkDvB;AAmBD;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,EACjC,WAAW,GAAE,QAAQ,CAAC,YAAY,CAAC,GAAG,IAAW,EACjD,OAAO,CAAC,EAAE;IACR,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,UAAU,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,SAAS,CAAC,EAAE,OAAO,CAAC;CACrB,GACA,OAAO,EAAE,CAmEX"}

package/dist/{esm/cut-by-grid.js → cut-by-grid.js}

@@ -1,5 +1,5 @@
-import { bitCode, intersect } from './lineclip';
-import { getPointAtIndex, copy, push } from './utils';
+import { bitCode, intersect } from "./lineclip.js";
+import { getPointAtIndex, copy, push } from "./utils.js";
 export function cutPolylineByGrid(positions, options) {
   const {
     size = 2,
@@ -53,15 +53,6 @@ export function cutPolylineByGrid(positions, options) {
 }
 const TYPE_INSIDE = 0;
 const TYPE_BORDER = 1;
-
-function concatInPlace(arr1, arr2) {
-  for (let i = 0; i < arr2.length; i++) {
-    arr1.push(arr2[i]);
-  }
-
-  return arr1;
-}
-
 export function cutPolygonByGrid(positions, holeIndices = null, options) {
   if (!positions.length) {
     return [];
@@ -249,4 +240,12 @@ function getBoundingBox(positions, size, endIndex, out) {
   out[1][1] = maxY;
   return out;
 }
+
+function concatInPlace(arr1, arr2) {
+  for (let i = 0; i < arr2.length; i++) {
+    arr1.push(arr2[i]);
+  }
+
+  return arr1;
+}
 //# sourceMappingURL=cut-by-grid.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/cut-by-grid.ts"],"names":["bitCode","intersect","getPointAtIndex","copy","push","cutPolylineByGrid","positions","options","size","broken","gridResolution","gridOffset","startIndex","endIndex","length","numPoints","part","result","a","b","codeB","cell","getGridCell","scratchPoint","i","codeAlt","moveToNeighborCell","TYPE_INSIDE","TYPE_BORDER","cutPolygonByGrid","holeIndices","edgeTypes","queue","pos","types","Array","fill","holes","bbox","shift","getBoundingBox","code","parts","bisectPolygon","polygonLow","polygonHigh","concatInPlace","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","arr1","arr2"],"mappings":"SACQA,O,EAASC,S;SACTC,e,EAAiBC,I,EAAMC,I;AAU/B,OAAO,SAASC,iBAAT,CACLC,SADK,EAELC,OAFK,EAUkB;AACvB,QAAM;AACJC,IAAAA,IAAI,GAAG,CADH;AAEJC,IAAAA,MAAM,GAAG,KAFL;AAGJC,IAAAA,cAAc,GAAG,EAHb;AAIJC,IAAAA,UAAU,GAAG,CAAC,CAAD,EAAI,CAAJ,CAJT;AAKJC,IAAAA,UAAU,GAAG,CALT;AAMJC,IAAAA,QAAQ,GAAGP,SAAS,CAACQ;AANjB,MAOFP,OAAO,IAAI,EAPf;AAQA,QAAMQ,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,MAAIQ,IAAc,GAAG,EAArB;AACA,QAAMC,MAAkB,GAAG,CAACD,IAAD,CAA3B;AACA,QAAME,CAAW,GAAGhB,eAAe,CAACI,SAAD,EAAY,CAAZ,EAAeE,IAAf,EAAqBI,UAArB,CAAnC;AACA,MAAIO,CAAJ;AACA,MAAIC,KAAJ;AACA,QAAMC,IAAiB,GAAGC,WAAW,CAACJ,CAAD,EAAIR,cAAJ,EAAoBC,UAApB,EAAgC,EAAhC,CAArC;AACA,QAAMY,YAAsB,GAAG,EAA/B;AACAnB,EAAAA,IAAI,CAACY,IAAD,EAAOE,CAAP,CAAJ;;AAEA,OAAK,IAAIM,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClCL,IAAAA,CAAC,GAAGjB,eAAe,CAACI,SAAD,EAAYkB,CAAZ,EAAehB,IAAf,EAAqBI,UAArB,EAAiCO,CAAjC,CAAnB;AACAC,IAAAA,KAAK,GAAGpB,OAAO,CAACmB,CAAD,EAAIE,IAAJ,CAAf;;AAEA,WAAOD,KAAP,EAAc;AAEZnB,MAAAA,SAAS,CAACiB,CAAD,EAAIC,CAAJ,EAAOC,KAAP,EAAcC,IAAd,EAAoBE,YAApB,CAAT;AACA,YAAME,OAAO,GAAGzB,OAAO,CAACuB,YAAD,EAAeF,IAAf,CAAvB;;AACA,UAAII,OAAJ,EAAa;AACXxB,QAAAA,SAAS,CAACiB,CAAD,EAAIK,YAAJ,EAAkBE,OAAlB,EAA2BJ,IAA3B,EAAiCE,YAAjC,CAAT;AACAH,QAAAA,KAAK,GAAGK,OAAR;AACD;;AACDrB,MAAAA,IAAI,CAACY,IAAD,EAAOO,YAAP,CAAJ;AAEApB,MAAAA,IAAI,CAACe,CAAD,EAAIK,YAAJ,CAAJ;AAEAG,MAAAA,kBAAkB,CAACL,IAAD,EAAOX,cAAP,EAAuBU,KAAvB,CAAlB;;AACA,UAAIX,MAAM,IAAIO,IAAI,CAACF,MAAL,GAAcN,IAA5B,EAAkC;AAChCQ,QAAAA,IAAI,GAAG,EAAP;AACAC,QAAAA,MAAM,CAACb,IAAP,CAAYY,IAAZ;AACAZ,QAAAA,IAAI,CAACY,IAAD,EAAOE,CAAP,CAAJ;AACD;;AAEDE,MAAAA,KAAK,GAAGpB,OAAO,CAACmB,CAAD,EAAIE,IAAJ,CAAf;AACD;;AAEDjB,IAAAA,IAAI,CAACY,IAAD,EAAOG,CAAP,CAAJ;AACAhB,IAAAA,IAAI,CAACe,CAAD,EAAIC,CAAJ,CAAJ;AACD;;AAED,SAAOV,MAAM,GAAGQ,MAAH,GAAYA,MAAM,CAAC,CAAD,CAA/B;AACD;AAED,MAAMU,WAAW,GAAG,CAApB;AACA,MAAMC,WAAW,GAAG,CAApB;AAmBA,OAAO,SAASC,gBAAT,CACLvB,SADK,EAELwB,WAA0C,GAAG,IAFxC,EAGLvB,OAHK,EASM;AACX,MAAI,CAACD,SAAS,CAACQ,MAAf,EAAuB;AAErB,WAAO,EAAP;AACD;;AACD,QAAM;AAACN,IAAAA,IAAI,GAAG,CAAR;AAAWE,IAAAA,cAAc,GAAG,EAA5B;AAAgCC,IAAAA,UAAU,GAAG,CAAC,CAAD,EAAI,CAAJ,CAA7C;AAAqDoB,IAAAA,SAAS,GAAG;AAAjE,MAA0ExB,OAAO,IAAI,EAA3F;AACA,QAAMU,MAAiB,GAAG,EAA1B;AACA,QAAMe,KAAmB,GAAG,CAC1B;AACEC,IAAAA,GAAG,EAAE3B,SADP;AAEE4B,IAAAA,KAAK,EAAEH,SAAS,GAAI,IAAII,KAAJ,CAAU7B,SAAS,CAACQ,MAAV,GAAmBN,IAA7B,EAAmC4B,IAAnC,CAAwCR,WAAxC,CAAJ,GAAwE,IAF1F;AAGES,IAAAA,KAAK,EAAEP,WAAW,IAAI;AAHxB,GAD0B,CAA5B;AAOA,QAAMQ,IAAgB,GAAG,CAAC,EAAD,EAAK,EAAL,CAAzB;AAEA,MAAIjB,IAAiB,GAAG,EAAxB;;AAGA,SAAOW,KAAK,CAAClB,MAAb,EAAqB;AACnB,UAAM;AAACmB,MAAAA,GAAD;AAAMC,MAAAA,KAAN;AAAaG,MAAAA;AAAb,QAAsBL,KAAK,CAACO,KAAN,EAA5B;AAGAC,IAAAA,cAAc,CAACP,GAAD,EAAMzB,IAAN,EAAY6B,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACnB,MAA5B,EAAoCwB,IAApC,CAAd;AACAjB,IAAAA,IAAI,GAAGC,WAAW,CAACgB,IAAI,CAAC,CAAD,CAAL,EAAU5B,cAAV,EAA0BC,UAA1B,EAAsCU,IAAtC,CAAlB;AACA,UAAMoB,IAAI,GAAGzC,OAAO,CAACsC,IAAI,CAAC,CAAD,CAAL,EAAUjB,IAAV,CAApB;;AAEA,QAAIoB,IAAJ,EAAU;AAER,UAAIC,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa1B,IAAb,EAAmB,CAAnB,EAAsB6B,KAAK,CAAC,CAAD,CAAL,IAAYJ,GAAG,CAACnB,MAAtC,EAA8CO,IAA9C,EAAoDoB,IAApD,CAAzB;AACA,YAAMG,UAA6B,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,OAAtC;AACA,YAAMQ,WAA8B,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,OAAvC;AACAL,MAAAA,KAAK,CAAC5B,IAAN,CAAWwC,UAAX,EAAuBC,WAAvB;;AAGA,WAAK,IAAIrB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGa,KAAK,CAACvB,MAA1B,EAAkCU,CAAC,EAAnC,EAAuC;AACrCkB,QAAAA,KAAK,GAAGC,aAAa,CAACV,GAAD,EAAMC,KAAN,EAAa1B,IAAb,EAAmB6B,KAAK,CAACb,CAAD,CAAxB,EAA6Ba,KAAK,CAACb,CAAC,GAAG,CAAL,CAAL,IAAgBS,GAAG,CAACnB,MAAjD,EAAyDO,IAAzD,EAA+DoB,IAA/D,CAArB;;AAEA,YAAIC,KAAK,CAAC,CAAD,CAAT,EAAc;AACZE,UAAAA,UAAU,CAACP,KAAX,CAAiBjC,IAAjB,CAAsBwC,UAAU,CAACX,GAAX,CAAenB,MAArC;AACA8B,UAAAA,UAAU,CAACX,GAAX,GAAiBa,aAAa,CAACF,UAAU,CAACX,GAAZ,EAAiBS,KAAK,CAAC,CAAD,CAAL,CAAST,GAA1B,CAA9B;;AACA,cAAIF,SAAJ,EAAe;AACba,YAAAA,UAAU,CAACV,KAAX,GAAmBY,aAAa,CAACF,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,CAAkBjC,IAAlB,CAAuByC,WAAW,CAACZ,GAAZ,CAAgBnB,MAAvC;AACA+B,UAAAA,WAAW,CAACZ,GAAZ,GAAkBa,aAAa,CAACD,WAAW,CAACZ,GAAb,EAAkBS,KAAK,CAAC,CAAD,CAAL,CAAST,GAA3B,CAA/B;;AACA,cAAIF,SAAJ,EAAe;AACbc,YAAAA,WAAW,CAACX,KAAZ,GAAoBY,aAAa,CAACD,WAAW,CAACX,KAAb,EAAoBQ,KAAK,CAAC,CAAD,CAAL,CAASR,KAA7B,CAAjC;AACD;AACF;AACF;AACF,KA1BD,MA0BO;AAEL,YAAMa,OAAgB,GAAG;AAACzC,QAAAA,SAAS,EAAE2B;AAAZ,OAAzB;;AACA,UAAIF,SAAJ,EAAe;AACbgB,QAAAA,OAAO,CAAChB,SAAR,GAAoBG,KAApB;AACD;;AACD,UAAIG,KAAK,CAACvB,MAAV,EAAkB;AAChBiC,QAAAA,OAAO,CAACjB,WAAR,GAAsBO,KAAtB;AACD;;AAEDpB,MAAAA,MAAM,CAACb,IAAP,CAAY2C,OAAZ;AACD;AACF;;AACD,SAAO9B,MAAP;AACD;;AAMD,SAAS0B,aAAT,CACErC,SADF,EAEEyB,SAFF,EAGEvB,IAHF,EAIEI,UAJF,EAKEC,QALF,EAMEyB,IANF,EAOEU,IAPF,EAWI;AACF,QAAMjC,SAAS,GAAG,CAACF,QAAQ,GAAGD,UAAZ,IAA0BJ,IAA5C;AACA,QAAMyC,SAAmB,GAAG,EAA5B;AACA,QAAMC,UAAoB,GAAG,EAA7B;AACA,QAAMC,QAAkB,GAAG,EAA3B;AACA,QAAMC,SAAmB,GAAG,EAA5B;AACA,QAAM7B,YAAsB,GAAG,EAA/B;AAEA,MAAI8B,CAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,QAAMC,IAAI,GAAGtD,eAAe,CAACI,SAAD,EAAYS,SAAS,GAAG,CAAxB,EAA2BP,IAA3B,EAAiCI,UAAjC,CAA5B;AACA,MAAI6C,QAAQ,GAAGC,IAAI,CAACC,IAAL,CAAUX,IAAI,GAAG,CAAP,GAAWQ,IAAI,CAAC,CAAD,CAAJ,GAAUlB,IAAI,CAAC,CAAD,CAAzB,GAA+BkB,IAAI,CAAC,CAAD,CAAJ,GAAUlB,IAAI,CAAC,CAAD,CAAvD,CAAf;AACA,MAAIsB,QAAQ,GAAG7B,SAAS,IAAIA,SAAS,CAAChB,SAAS,GAAG,CAAb,CAArC;AACA,MAAI8C,aAAa,GAAG,CAApB;AACA,MAAIC,cAAc,GAAG,CAArB;;AAEA,OAAK,IAAItC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,SAApB,EAA+BS,CAAC,EAAhC,EAAoC;AAClC6B,IAAAA,CAAC,GAAGnD,eAAe,CAACI,SAAD,EAAYkB,CAAZ,EAAehB,IAAf,EAAqBI,UAArB,EAAiCyC,CAAjC,CAAnB;AACAC,IAAAA,IAAI,GAAGI,IAAI,CAACC,IAAL,CAAUX,IAAI,GAAG,CAAP,GAAWK,CAAC,CAAC,CAAD,CAAD,GAAOf,IAAI,CAAC,CAAD,CAAtB,GAA4Be,CAAC,CAAC,CAAD,CAAD,GAAOf,IAAI,CAAC,CAAD,CAAjD,CAAP;AACAiB,IAAAA,IAAI,GAAGxB,SAAS,IAAIA,SAAS,CAACnB,UAAU,GAAGJ,IAAb,GAAoBgB,CAArB,CAA7B;;AAGA,QAAI8B,IAAI,IAAIG,QAAR,IAAoBA,QAAQ,KAAKH,IAArC,EAA2C;AACzCrD,MAAAA,SAAS,CAACuD,IAAD,EAAOH,CAAP,EAAUL,IAAV,EAAgBV,IAAhB,EAAsBf,YAAtB,CAAT;AACAnB,MAAAA,IAAI,CAAC6C,SAAD,EAAY1B,YAAZ,CAAJ,IAAiC4B,QAAQ,CAAC/C,IAAT,CAAcwD,QAAd,CAAjC;AACAxD,MAAAA,IAAI,CAAC8C,UAAD,EAAa3B,YAAb,CAAJ,IAAkC6B,SAAS,CAAChD,IAAV,CAAewD,QAAf,CAAlC;AACD;;AAED,QAAIN,IAAI,IAAI,CAAZ,EAAe;AACblD,MAAAA,IAAI,CAAC6C,SAAD,EAAYI,CAAZ,CAAJ,IAAsBF,QAAQ,CAAC/C,IAAT,CAAcmD,IAAd,CAAtB;AACAM,MAAAA,aAAa,IAAIP,IAAjB;AACD,KAHD,MAGO,IAAIH,QAAQ,CAACrC,MAAb,EAAqB;AAC1BqC,MAAAA,QAAQ,CAACA,QAAQ,CAACrC,MAAT,GAAkB,CAAnB,CAAR,GAAgCa,WAAhC;AACD;;AACD,QAAI2B,IAAI,IAAI,CAAZ,EAAe;AACblD,MAAAA,IAAI,CAAC8C,UAAD,EAAaG,CAAb,CAAJ,IAAuBD,SAAS,CAAChD,IAAV,CAAemD,IAAf,CAAvB;AACAO,MAAAA,cAAc,IAAIR,IAAlB;AACD,KAHD,MAGO,IAAIF,SAAS,CAACtC,MAAd,EAAsB;AAC3BsC,MAAAA,SAAS,CAACA,SAAS,CAACtC,MAAV,GAAmB,CAApB,CAAT,GAAkCa,WAAlC;AACD;;AAEDxB,IAAAA,IAAI,CAACqD,IAAD,EAAOH,CAAP,CAAJ;AACAI,IAAAA,QAAQ,GAAGH,IAAX;AACAM,IAAAA,QAAQ,GAAGL,IAAX;AACD;;AAED,SAAO,CACLM,aAAa,GAAG;AAAC5B,IAAAA,GAAG,EAAEgB,SAAN;AAAiBf,IAAAA,KAAK,EAAEH,SAAS,IAAIoB;AAArC,GAAH,GAAoD,IAD5D,EAELW,cAAc,GAAG;AAAC7B,IAAAA,GAAG,EAAEiB,UAAN;AAAkBhB,IAAAA,KAAK,EAAEH,SAAS,IAAIqB;AAAtC,GAAH,GAAsD,IAF/D,CAAP;AAID;;AAED,SAAS9B,WAAT,CACE+B,CADF,EAEE3C,cAFF,EAGEC,UAHF,EAIEoD,GAJF,EAKe;AACb,QAAMC,IAAI,GAAGN,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO1C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CAA9F;AACA,QAAMuD,MAAM,GACVR,IAAI,CAACO,KAAL,CAAW,CAACZ,CAAC,CAAC,CAAD,CAAD,GAAO1C,UAAU,CAAC,CAAD,CAAlB,IAAyBD,cAApC,IAAsDA,cAAtD,GAAuEC,UAAU,CAAC,CAAD,CADnF;AAEAoD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAT;AACAD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAT;AACAH,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASC,IAAI,GAAGtD,cAAhB;AACAqD,EAAAA,GAAG,CAAC,CAAD,CAAH,GAASG,MAAM,GAAGxD,cAAlB;AACA,SAAOqD,GAAP;AACD;;AAED,SAASrC,kBAAT,CAA4BL,IAA5B,EAA4CX,cAA5C,EAAoEsC,IAApE,EAAwF;AACtF,MAAIA,IAAI,GAAG,CAAX,EAAc;AAEZ3B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJD,MAIO,IAAIsC,IAAI,GAAG,CAAX,EAAc;AAEnB3B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIsC,IAAI,GAAG,CAAX,EAAc;AAEnB3B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD,GAJM,MAIA,IAAIsC,IAAI,GAAG,CAAX,EAAc;AAEnB3B,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACAW,IAAAA,IAAI,CAAC,CAAD,CAAJ,IAAWX,cAAX;AACD;AACF;;AAED,SAAS8B,cAAT,CACElC,SADF,EAEEE,IAFF,EAGEK,QAHF,EAIEkD,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,IAAI5C,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGX,QAApB,EAA8BW,CAAC,IAAIhB,IAAnC,EAAyC;AACvC,UAAMgE,CAAC,GAAGlE,SAAS,CAACkB,CAAD,CAAnB;AACA,UAAMiD,CAAC,GAAGnE,SAAS,CAACkB,CAAC,GAAG,CAAL,CAAnB;AACA2C,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;;AAED,SAASjB,aAAT,CAAuB4B,IAAvB,EAAuCC,IAAvC,EAAiE;AAC/D,OAAK,IAAInD,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGmD,IAAI,CAAC7D,MAAzB,EAAiCU,CAAC,EAAlC,EAAsC;AACpCkD,IAAAA,IAAI,CAACtE,IAAL,CAAUuE,IAAI,CAACnD,CAAD,CAAd;AACD;;AACD,SAAOkD,IAAP;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\n/** Internal helper type during cutting, name TBD */\ntype PolygonCut = {\n  pos: Readonly<NumericArray>;\n  types: number[];\n  holes: Readonly<NumericArray>;\n};\n\n/** Internal helper type during cutting, name TBD */\ntype MutablePolygonCut = {\n  pos: number[];\n  types: number[];\n  holes: number[];\n};\n\n/**\n * Cuts a polygon by a pre-defined grid\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: PolygonCut[] = [\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: MutablePolygonCut = {pos: parts[0].pos, types: parts[0].types, holes: []};\n      const polygonHigh: MutablePolygonCut = {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\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"],"file":"cut-by-grid.js"}

package/dist/{esm/cut-by-mercator-bounds.js → cut-by-mercator-bounds.js}

@@ -1,5 +1,5 @@
-import { cutPolylineByGrid, cutPolygonByGrid } from './cut-by-grid';
-import { getPointAtIndex, push } from './utils';
+import { cutPolylineByGrid, cutPolygonByGrid } from "./cut-by-grid.js";
+import { getPointAtIndex, push } from "./utils.js";
 const DEFAULT_MAX_LATITUDE = 85.051129;
 export function cutPolylineByMercatorBounds(positions, options) {
   const {

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/cut-by-mercator-bounds.ts"],"names":["cutPolylineByGrid","cutPolygonByGrid","getPointAtIndex","push","DEFAULT_MAX_LATITUDE","cutPolylineByMercatorBounds","positions","options","size","startIndex","endIndex","length","normalize","newPositions","slice","wrapLongitudesForShortestPath","parts","broken","gridResolution","gridOffset","part","shiftLongitudesIntoRange","cutPolygonByMercatorBounds","holeIndices","edgeTypes","newHoleIndices","srcStartIndex","targetIndex","ringIndex","srcEndIndex","targetStartIndex","splitIndex","findSplitIndex","i","insertPoleVertices","maxLatitude","pop","maxLat","pointIndex","lat","Math","abs","firstLng","lastLng","p","round","sign","prevLng","lng","delta","refLng","pointCount"],"mappings":"SAAQA,iB,EAAmBC,gB;SACnBC,e,EAAiBC,I;AAKzB,MAAMC,oBAAoB,GAAG,SAA7B;AAGA,OAAO,SAASC,2BAAT,CACLC,SADK,EAELC,OAFK,EAQO;AACZ,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWC,IAAAA,UAAU,GAAG,CAAxB;AAA2BC,IAAAA,QAAQ,GAAGJ,SAAS,CAACK,MAAhD;AAAwDC,IAAAA,SAAS,GAAG;AAApE,MAA4EL,OAAO,IAAI,EAA7F;AAGA,QAAMM,YAAY,GAAGP,SAAS,CAACQ,KAAV,CAAgBL,UAAhB,EAA4BC,QAA5B,CAArB;AACAK,EAAAA,6BAA6B,CAACF,YAAD,EAAeL,IAAf,EAAqB,CAArB,EAAwBE,QAAQ,GAAGD,UAAnC,CAA7B;AAEA,QAAMO,KAAK,GAAGhB,iBAAiB,CAACa,YAAD,EAAe;AAC5CL,IAAAA,IAD4C;AAE5CS,IAAAA,MAAM,EAAE,IAFoC;AAG5CC,IAAAA,cAAc,EAAE,GAH4B;AAI5CC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR;AAJgC,GAAf,CAA/B;;AAOA,MAAIP,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AACxBK,MAAAA,wBAAwB,CAACD,IAAD,EAAOZ,IAAP,CAAxB;AACD;AACF;;AACD,SAAOQ,KAAP;AACD;AAGD,OAAO,SAASM,0BAAT,CACLhB,SADK,EAELiB,WAA0C,GAAG,IAFxC,EAGLhB,OAHK,EASM;AACX,QAAM;AAACC,IAAAA,IAAI,GAAG,CAAR;AAAWI,IAAAA,SAAS,GAAG,IAAvB;AAA6BY,IAAAA,SAAS,GAAG;AAAzC,MAAkDjB,OAAO,IAAI,EAAnE;AACAgB,EAAAA,WAAW,GAAGA,WAAW,IAAI,EAA7B;AACA,QAAMV,YAAsB,GAAG,EAA/B;AACA,QAAMY,cAAwB,GAAG,EAAjC;AACA,MAAIC,aAAa,GAAG,CAApB;AACA,MAAIC,WAAW,GAAG,CAAlB;;AAEA,OAAK,IAAIC,SAAS,GAAG,CAArB,EAAwBA,SAAS,IAAIL,WAAW,CAACZ,MAAjD,EAAyDiB,SAAS,EAAlE,EAAsE;AAEpE,UAAMC,WAAW,GAAGN,WAAW,CAACK,SAAD,CAAX,IAA0BtB,SAAS,CAACK,MAAxD;AAEA,UAAMmB,gBAAgB,GAAGH,WAAzB;AAKA,UAAMI,UAAU,GAAGC,cAAc,CAAC1B,SAAD,EAAYE,IAAZ,EAAkBkB,aAAlB,EAAiCG,WAAjC,CAAjC;;AACA,SAAK,IAAII,CAAC,GAAGF,UAAb,EAAyBE,CAAC,GAAGJ,WAA7B,EAA0CI,CAAC,EAA3C,EAA+C;AAC7CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,CAAD,CAAvC;AACD;;AACD,SAAK,IAAIA,CAAC,GAAGP,aAAb,EAA4BO,CAAC,GAAGF,UAAhC,EAA4CE,CAAC,EAA7C,EAAiD;AAC/CpB,MAAAA,YAAY,CAACc,WAAW,EAAZ,CAAZ,GAA8BrB,SAAS,CAAC2B,CAAD,CAAvC;AACD;;AAGDlB,IAAAA,6BAA6B,CAACF,YAAD,EAAeL,IAAf,EAAqBsB,gBAArB,EAAuCH,WAAvC,CAA7B;AAGAO,IAAAA,kBAAkB,CAACrB,YAAD,EAAeL,IAAf,EAAqBsB,gBAArB,EAAuCH,WAAvC,EAAoDpB,OAApD,aAAoDA,OAApD,uBAAoDA,OAAO,CAAE4B,WAA7D,CAAlB;AAEAT,IAAAA,aAAa,GAAGG,WAAhB;AACAJ,IAAAA,cAAc,CAACG,SAAD,CAAd,GAA4BD,WAA5B;AACD;;AACDF,EAAAA,cAAc,CAACW,GAAf;AAEA,QAAMpB,KAAK,GAAGf,gBAAgB,CAACY,YAAD,EAAeY,cAAf,EAA+B;AAC3DjB,IAAAA,IAD2D;AAE3DU,IAAAA,cAAc,EAAE,GAF2C;AAG3DC,IAAAA,UAAU,EAAE,CAAC,CAAC,GAAF,EAAO,CAAC,GAAR,CAH+C;AAI3DK,IAAAA;AAJ2D,GAA/B,CAA9B;;AAOA,MAAIZ,SAAJ,EAAe;AAGb,SAAK,MAAMQ,IAAX,IAAmBJ,KAAnB,EAA0B;AAExBK,MAAAA,wBAAwB,CAACD,IAAI,CAACd,SAAN,EAAiBE,IAAjB,CAAxB;AACD;AACF;;AACD,SAAOQ,KAAP;AACD;;AAKD,SAASgB,cAAT,CACE1B,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKU;AACR,MAAI2B,MAAM,GAAG,CAAC,CAAd;AACA,MAAIC,UAAU,GAAG,CAAC,CAAlB;;AACA,OAAK,IAAIL,CAAC,GAAGxB,UAAU,GAAG,CAA1B,EAA6BwB,CAAC,GAAGvB,QAAjC,EAA2CuB,CAAC,IAAIzB,IAAhD,EAAsD;AACpD,UAAM+B,GAAG,GAAGC,IAAI,CAACC,GAAL,CAASnC,SAAS,CAAC2B,CAAD,CAAlB,CAAZ;;AACA,QAAIM,GAAG,GAAGF,MAAV,EAAkB;AAChBA,MAAAA,MAAM,GAAGE,GAAT;AACAD,MAAAA,UAAU,GAAGL,CAAC,GAAG,CAAjB;AACD;AACF;;AACD,SAAOK,UAAP;AACD;;AAWD,SAASJ,kBAAT,CACE5B,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKEyB,WAAmB,GAAG/B,oBALxB,EAMQ;AAEN,QAAMsC,QAAQ,GAAGpC,SAAS,CAACG,UAAD,CAA1B;AACA,QAAMkC,OAAO,GAAGrC,SAAS,CAACI,QAAQ,GAAGF,IAAZ,CAAzB;;AACA,MAAIgC,IAAI,CAACC,GAAL,CAASC,QAAQ,GAAGC,OAApB,IAA+B,GAAnC,EAAwC;AAGtC,UAAMC,CAAC,GAAG1C,eAAe,CAACI,SAAD,EAAY,CAAZ,EAAeE,IAAf,EAAqBC,UAArB,CAAzB;AAEAmC,IAAAA,CAAC,CAAC,CAAD,CAAD,IAAQJ,IAAI,CAACK,KAAL,CAAW,CAACF,OAAO,GAAGD,QAAX,IAAuB,GAAlC,IAAyC,GAAjD;AACAvC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOJ,IAAI,CAACM,IAAL,CAAUF,CAAC,CAAC,CAAD,CAAX,IAAkBT,WAAzB;AACAhC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AAEAA,IAAAA,CAAC,CAAC,CAAD,CAAD,GAAOF,QAAP;AACAvC,IAAAA,IAAI,CAACG,SAAD,EAAYsC,CAAZ,CAAJ;AACD;AACF;;AAED,SAAS7B,6BAAT,CACET,SADF,EAEEE,IAFF,EAGEC,UAHF,EAIEC,QAJF,EAKQ;AACN,MAAIqC,OAAe,GAAGzC,SAAS,CAAC,CAAD,CAA/B;AACA,MAAI0C,GAAJ;;AACA,OAAK,IAAIf,CAAC,GAAGxB,UAAb,EAAyBwB,CAAC,GAAGvB,QAA7B,EAAuCuB,CAAC,IAAIzB,IAA5C,EAAkD;AAChDwC,IAAAA,GAAG,GAAG1C,SAAS,CAAC2B,CAAD,CAAf;AACA,UAAMgB,KAAK,GAAGD,GAAG,GAAGD,OAApB;;AACA,QAAIE,KAAK,GAAG,GAAR,IAAeA,KAAK,GAAG,CAAC,GAA5B,EAAiC;AAC/BD,MAAAA,GAAG,IAAIR,IAAI,CAACK,KAAL,CAAWI,KAAK,GAAG,GAAnB,IAA0B,GAAjC;AACD;;AACD3C,IAAAA,SAAS,CAAC2B,CAAD,CAAT,GAAec,OAAO,GAAGC,GAAzB;AACD;AACF;;AAED,SAAS3B,wBAAT,CAAkCf,SAAlC,EAA2DE,IAA3D,EAA+E;AAC7E,MAAI0C,MAAJ;AACA,QAAMC,UAAU,GAAG7C,SAAS,CAACK,MAAV,GAAmBH,IAAtC;;AAIA,OAAK,IAAIyB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGkB,UAApB,EAAgClB,CAAC,EAAjC,EAAqC;AACnCiB,IAAAA,MAAM,GAAG5C,SAAS,CAAC2B,CAAC,GAAGzB,IAAL,CAAlB;;AACA,QAAI,CAAC0C,MAAM,GAAG,GAAV,IAAiB,GAAjB,KAAyB,CAA7B,EAAgC;AAC9B;AACD;AACF;;AAED,QAAMD,KAAK,GAAG,CAACT,IAAI,CAACK,KAAL,CAAWK,MAAM,GAAG,GAApB,CAAD,GAA4B,GAA1C;;AACA,MAAID,KAAK,KAAK,CAAd,EAAiB;AACf;AACD;;AACD,OAAK,IAAIhB,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGkB,UAApB,EAAgClB,CAAC,EAAjC,EAAqC;AACnC3B,IAAAA,SAAS,CAAC2B,CAAC,GAAGzB,IAAL,CAAT,IAAuByC,KAAvB;AACD;AACF","sourcesContent":["import {cutPolylineByGrid, cutPolygonByGrid} from './cut-by-grid';\nimport {getPointAtIndex, push} from './utils';\nimport type {Polygon} from './cut-by-grid';\nimport type {NumericArray} from '@math.gl/core';\n\n// https://en.wikipedia.org/wiki/Web_Mercator_projection\nconst DEFAULT_MAX_LATITUDE = 85.051129;\n\n/** https://user-images.githubusercontent.com/2059298/78465769-938b7a00-76ae-11ea-9b95-1f4c26425ab9.png */\nexport function cutPolylineByMercatorBounds(\n  positions: 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"}

package/dist/earcut.d.ts

@@ -1,3 +1,5 @@
+import type { NumericArray } from '@math.gl/core';
+import { Plane2D } from './polygon-utils';
 /**
  * Computes a triangulation of a polygon
  * @param positions a flat array of the vertex positions that define the polygon.
@@ -7,5 +9,5 @@
  * @returns array of indices into the `positions` array that describes the triangulation of the polygon
  * Adapted from https://github.com/mapbox/earcut
  */
-export declare function earcut(positions: number[], holeIndices?: number[], dim?: number, areas?: number[]): number[];
+export declare function earcut(positions: NumericArray, holeIndices?: NumericArray, dim?: number, areas?: NumericArray, plane?: Plane2D): number[];
 //# sourceMappingURL=earcut.d.ts.map

package/dist/earcut.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"earcut.d.ts","sourceRoot":"","sources":["../src/earcut.ts"],"names":[],"mappings":"AA4BA;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CACpB,SAAS,EAAE,MAAM,EAAE,EACnB,WAAW,CAAC,EAAE,MAAM,EAAE,EACtB,GAAG,GAAE,MAAU,EACf,KAAK,CAAC,EAAE,MAAM,EAAE,GACf,MAAM,EAAE,CAwCV"}
+{"version":3,"file":"earcut.d.ts","sourceRoot":"","sources":["../src/earcut.ts"],"names":[],"mappings":"AA4BA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,eAAe,CAAC;AAChD,OAAO,EAAiC,OAAO,EAAC,MAAM,iBAAiB,CAAC;AAExE;;;;;;;;GAQG;AACH,wBAAgB,MAAM,CACpB,SAAS,EAAE,YAAY,EACvB,WAAW,CAAC,EAAE,YAAY,EAC1B,GAAG,GAAE,MAAU,EACf,KAAK,CAAC,EAAE,YAAY,EACpB,KAAK,GAAE,OAAc,GACpB,MAAM,EAAE,CAwCV"}

package/dist/{esm/earcut.js → earcut.js}

@@ -1,8 +1,9 @@
-import { getPolygonSignedArea } from './polygon-utils';
-export function earcut(positions, holeIndices, dim = 2, areas) {
+import _defineProperty from "@babel/runtime/helpers/esm/defineProperty";
+import { getPolygonSignedArea, DimIndex } from "./polygon-utils.js";
+export function earcut(positions, holeIndices, dim = 2, areas, plane = 'xy') {
   const hasHoles = holeIndices && holeIndices.length;
   const outerLen = hasHoles ? holeIndices[0] * dim : positions.length;
-  let outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0]);
+  let outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0], plane);
   const triangles = [];
   if (!outerNode || outerNode.next === outerNode.prev) return triangles;
   let invSize;
@@ -12,7 +13,7 @@ export function earcut(positions, holeIndices, dim = 2, areas) {
   let minY;
   let x;
   let y;
-  if (hasHoles) outerNode = eliminateHoles(positions, holeIndices, outerNode, dim, areas);
+  if (hasHoles) outerNode = eliminateHoles(positions, holeIndices, outerNode, dim, areas, plane);
 
   if (positions.length > 80 * dim) {
     minX = maxX = positions[0];
@@ -28,14 +29,14 @@ export function earcut(positions, holeIndices, dim = 2, areas) {
     }
 
     invSize = Math.max(maxX - minX, maxY - minY);
-    invSize = invSize !== 0 ? 1 / invSize : 0;
+    invSize = invSize !== 0 ? 32767 / invSize : 0;
   }
 
-  earcutLinked(outerNode, triangles, dim, minX, minY, invSize);
+  earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
   return triangles;
 }
 
-function linkedList(data, start, end, dim, clockwise, area) {
+function linkedList(data, start, end, dim, clockwise, area, plane) {
   let i;
   let last;
 
@@ -43,14 +44,18 @@ function linkedList(data, start, end, dim, clockwise, area) {
     area = getPolygonSignedArea(data, {
       start,
       end,
-      size: dim
+      size: dim,
+      plane
     });
   }
 
+  let i0 = DimIndex[plane[0]];
+  let i1 = DimIndex[plane[1]];
+
   if (clockwise === area < 0) {
-    for (i = start; i < end; i += dim) last = insertNode(i, data[i], data[i + 1], last);
+    for (i = start; i < end; i += dim) last = insertNode(i, data[i + i0], data[i + i1], last);
   } else {
-    for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], last);
+    for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i + i0], data[i + i1], last);
   }
 
   if (last && equals(last, last.next)) {
@@ -95,9 +100,9 @@ function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
     next = ear.next;
 
     if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
-      triangles.push(prev.i / dim);
-      triangles.push(ear.i / dim);
-      triangles.push(next.i / dim);
+      triangles.push(prev.i / dim | 0);
+      triangles.push(ear.i / dim | 0);
+      triangles.push(next.i / dim | 0);
       removeNode(ear);
       ear = next.next;
       stop = next.next;
@@ -126,10 +131,20 @@ function isEar(ear) {
   const b = ear;
   const c = ear.next;
   if (area(a, b, c) >= 0) return false;
-  let p = ear.next.next;
-
-  while (p !== ear.prev) {
-    if (pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+  const ax = a.x;
+  const bx = b.x;
+  const cx = c.x;
+  const ay = a.y;
+  const by = b.y;
+  const cy = c.y;
+  const x0 = ax < bx ? ax < cx ? ax : cx : bx < cx ? bx : cx;
+  const y0 = ay < by ? ay < cy ? ay : cy : by < cy ? by : cy;
+  const x1 = ax > bx ? ax > cx ? ax : cx : bx > cx ? bx : cx;
+  const y1 = ay > by ? ay > cy ? ay : cy : by > cy ? by : cy;
+  let p = c.next;
+
+  while (p !== a) {
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
     p = p.next;
   }
 
@@ -141,29 +156,35 @@ function isEarHashed(ear, minX, minY, invSize) {
   const b = ear;
   const c = ear.next;
   if (area(a, b, c) >= 0) return false;
-  const minTX = a.x < b.x ? a.x < c.x ? a.x : c.x : b.x < c.x ? b.x : c.x;
-  const minTY = a.y < b.y ? a.y < c.y ? a.y : c.y : b.y < c.y ? b.y : c.y;
-  const maxTX = a.x > b.x ? a.x > c.x ? a.x : c.x : b.x > c.x ? b.x : c.x;
-  const maxTY = a.y > b.y ? a.y > c.y ? a.y : c.y : b.y > c.y ? b.y : c.y;
-  const minZ = zOrder(minTX, minTY, minX, minY, invSize);
-  const maxZ = zOrder(maxTX, maxTY, minX, minY, invSize);
+  const ax = a.x;
+  const bx = b.x;
+  const cx = c.x;
+  const ay = a.y;
+  const by = b.y;
+  const cy = c.y;
+  const x0 = ax < bx ? ax < cx ? ax : cx : bx < cx ? bx : cx;
+  const y0 = ay < by ? ay < cy ? ay : cy : by < cy ? by : cy;
+  const x1 = ax > bx ? ax > cx ? ax : cx : bx > cx ? bx : cx;
+  const y1 = ay > by ? ay > cy ? ay : cy : by > cy ? by : cy;
+  const minZ = zOrder(x0, y0, minX, minY, invSize);
+  const maxZ = zOrder(x1, y1, minX, minY, invSize);
   let p = ear.prevZ;
   let n = ear.nextZ;
 
   while (p && p.z >= minZ && n && n.z <= maxZ) {
-    if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
     p = p.prevZ;
-    if (n !== ear.prev && n !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
+    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c && pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
     n = n.nextZ;
   }
 
   while (p && p.z >= minZ) {
-    if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
     p = p.prevZ;
   }
 
   while (n && n.z <= maxZ) {
-    if (n !== ear.prev && n !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
+    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c && pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
     n = n.nextZ;
   }
 
@@ -178,9 +199,9 @@ function cureLocalIntersections(start, triangles, dim) {
     const b = p.next.next;
 
     if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
-      triangles.push(a.i / dim);
-      triangles.push(p.i / dim);
-      triangles.push(b.i / dim);
+      triangles.push(a.i / dim | 0);
+      triangles.push(p.i / dim | 0);
+      triangles.push(b.i / dim | 0);
       removeNode(p);
       removeNode(p.next);
       p = start = b;
@@ -203,8 +224,8 @@ function splitEarcut(start, triangles, dim, minX, minY, invSize) {
         let c = splitPolygon(a, b);
         a = filterPoints(a, a.next);
         c = filterPoints(c, c.next);
-        earcutLinked(a, triangles, dim, minX, minY, invSize);
-        earcutLinked(c, triangles, dim, minX, minY, invSize);
+        earcutLinked(a, triangles, dim, minX, minY, invSize, 0);
+        earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
         return;
       }
 
@@ -215,7 +236,7 @@ function splitEarcut(start, triangles, dim, minX, minY, invSize) {
   } while (a !== start);
 }
 
-function eliminateHoles(data, holeIndices, outerNode, dim, areas) {
+function eliminateHoles(data, holeIndices, outerNode, dim, areas, plane) {
   const queue = [];
   let i;
   let len;
@@ -226,7 +247,7 @@ function eliminateHoles(data, holeIndices, outerNode, dim, areas) {
   for (i = 0, len = holeIndices.length; i < len; i++) {
     start = holeIndices[i] * dim;
     end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
-    list = linkedList(data, start, end, dim, false, areas && areas[i + 1]);
+    list = linkedList(data, start, end, dim, false, areas && areas[i + 1], plane);
     if (list === list.next) list.steiner = true;
     queue.push(getLeftmost(list));
   }
@@ -234,8 +255,7 @@ function eliminateHoles(data, holeIndices, outerNode, dim, areas) {
   queue.sort(compareX);
 
   for (i = 0; i < queue.length; i++) {
-    eliminateHole(queue[i], outerNode);
-    outerNode = filterPoints(outerNode, outerNode.next);
+    outerNode = eliminateHole(queue[i], outerNode);
   }
 
   return outerNode;
@@ -246,13 +266,15 @@ function compareX(a, b) {
 }
 
 function eliminateHole(hole, outerNode) {
-  outerNode = findHoleBridge(hole, outerNode);
+  const bridge = findHoleBridge(hole, outerNode);
 
-  if (outerNode) {
-    const b = splitPolygon(outerNode, hole);
-    filterPoints(outerNode, outerNode.next);
-    filterPoints(b, b.next);
+  if (!bridge) {
+    return outerNode;
   }
+
+  const bridgeReverse = splitPolygon(bridge, hole);
+  filterPoints(bridgeReverse, bridgeReverse.next);
+  return filterPoints(bridge, bridge.next);
 }
 
 function findHoleBridge(hole, outerNode) {
@@ -268,13 +290,8 @@ function findHoleBridge(hole, outerNode) {
 
       if (x <= hx && x > qx) {
         qx = x;
-
-        if (x === hx) {
-          if (hy === p.y) return p;
-          if (hy === p.next.y) return p.next;
-        }
-
         m = p.x < p.next.x ? p : p.next;
+        if (x === hx) return m;
       }
     }
 
@@ -282,7 +299,6 @@ function findHoleBridge(hole, outerNode) {
   } while (p !== outerNode);
 
   if (!m) return null;
-  if (hx === qx) return m;
   const stop = m;
   const mx = m.x;
   const my = m.y;
@@ -314,7 +330,7 @@ function indexCurve(start, minX, minY, invSize) {
   let p = start;
 
   do {
-    if (p.z === null) p.z = zOrder(p.x, p.y, minX, minY, invSize);
+    if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);
     p.prevZ = p.prev;
     p.nextZ = p.next;
     p = p.next;
@@ -382,8 +398,8 @@ function sortLinked(list) {
 }
 
 function zOrder(x, y, minX, minY, invSize) {
-  x = 32767 * (x - minX) * invSize;
-  y = 32767 * (y - minY) * invSize;
+  x = (x - minX) * invSize | 0;
+  y = (y - minY) * invSize | 0;
   x = (x | x << 8) & 0x00ff00ff;
   x = (x | x << 4) & 0x0f0f0f0f;
   x = (x | x << 2) & 0x33333333;
@@ -408,7 +424,7 @@ function getLeftmost(start) {
 }
 
 function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
-  return (cx - px) * (ay - py) - (ax - px) * (cy - py) >= 0 && (ax - px) * (by - py) - (bx - px) * (ay - py) >= 0 && (bx - px) * (cy - py) - (cx - px) * (by - py) >= 0;
+  return (cx - px) * (ay - py) >= (ax - px) * (cy - py) && (ax - px) * (by - py) >= (bx - px) * (ay - py) && (bx - px) * (cy - py) >= (cx - px) * (by - py);
 }
 
 function isValidDiagonal(a, b) {
@@ -474,8 +490,8 @@ function middleInside(a, b) {
 }
 
 function splitPolygon(a, b) {
-  const a2 = new Node(a.i, a.x, a.y);
-  const b2 = new Node(b.i, b.x, b.y);
+  const a2 = new Vertex(a.i, a.x, a.y);
+  const b2 = new Vertex(b.i, b.x, b.y);
   const an = a.next;
   const bp = b.prev;
   a.next = b;
@@ -490,7 +506,7 @@ function splitPolygon(a, b) {
 }
 
 function insertNode(i, x, y, last) {
-  const p = new Node(i, x, y);
+  const p = new Vertex(i, x, y);
 
   if (!last) {
     p.prev = p;
@@ -512,15 +528,30 @@ function removeNode(p) {
   if (p.nextZ) p.nextZ.prevZ = p.prevZ;
 }
 
-function Node(i, x, y) {
-  this.i = i;
-  this.x = x;
-  this.y = y;
-  this.prev = null;
-  this.next = null;
-  this.z = null;
-  this.prevZ = null;
-  this.nextZ = null;
-  this.steiner = false;
+class Vertex {
+  constructor(i, x, y) {
+    _defineProperty(this, "i", void 0);
+
+    _defineProperty(this, "x", void 0);
+
+    _defineProperty(this, "y", void 0);
+
+    _defineProperty(this, "prev", null);
+
+    _defineProperty(this, "next", null);
+
+    _defineProperty(this, "z", 0);
+
+    _defineProperty(this, "prevZ", null);
+
+    _defineProperty(this, "nextZ", null);
+
+    _defineProperty(this, "steiner", false);
+
+    this.i = i;
+    this.x = x;
+    this.y = y;
+  }
+
 }
 //# sourceMappingURL=earcut.js.map

package/dist/earcut.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/earcut.ts"],"names":["getPolygonSignedArea","DimIndex","earcut","positions","holeIndices","dim","areas","plane","hasHoles","length","outerLen","outerNode","linkedList","triangles","next","prev","invSize","maxX","maxY","minX","minY","x","y","eliminateHoles","i","Math","max","earcutLinked","data","start","end","clockwise","area","last","undefined","size","i0","i1","insertNode","equals","removeNode","filterPoints","p","again","steiner","ear","pass","indexCurve","stop","isEarHashed","isEar","push","cureLocalIntersections","splitEarcut","a","b","c","ax","bx","cx","ay","by","cy","x0","y0","x1","y1","pointInTriangle","minZ","zOrder","maxZ","prevZ","n","nextZ","z","intersects","locallyInside","isValidDiagonal","splitPolygon","queue","len","list","getLeftmost","sort","compareX","eliminateHole","hole","bridge","findHoleBridge","bridgeReverse","hx","hy","qx","Infinity","m","mx","my","tanMin","tan","abs","sectorContainsSector","sortLinked","e","inSize","numMerges","pSize","q","qSize","tail","leftmost","px","py","intersectsPolygon","middleInside","r","p1","p2","q1","q2","o1","sign","o2","o3","o4","onSegment","min","num","inside","a2","Vertex","b2","an","bp","constructor"],"mappings":";SA6BQA,oB,EAAsBC,Q;AAW9B,OAAO,SAASC,MAAT,CACLC,SADK,EAELC,WAFK,EAGLC,GAAW,GAAG,CAHT,EAILC,KAJK,EAKLC,KAAc,GAAG,IALZ,EAMK;AACV,QAAMC,QAAQ,GAAGJ,WAAW,IAAIA,WAAW,CAACK,MAA5C;AACA,QAAMC,QAAQ,GAAGF,QAAQ,GAAGJ,WAAW,CAAC,CAAD,CAAX,GAAiBC,GAApB,GAA0BF,SAAS,CAACM,MAA7D;AACA,MAAIE,SAAS,GAAGC,UAAU,CAACT,SAAD,EAAY,CAAZ,EAAeO,QAAf,EAAyBL,GAAzB,EAA8B,IAA9B,EAAoCC,KAAK,IAAIA,KAAK,CAAC,CAAD,CAAlD,EAAuDC,KAAvD,CAA1B;AACA,QAAMM,SAAS,GAAG,EAAlB;AAEA,MAAI,CAACF,SAAD,IAAcA,SAAS,CAACG,IAAV,KAAmBH,SAAS,CAACI,IAA/C,EAAqD,OAAOF,SAAP;AAErD,MAAIG,OAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,IAAJ;AACA,MAAIC,CAAJ;AACA,MAAIC,CAAJ;AAEA,MAAId,QAAJ,EAAcG,SAAS,GAAGY,cAAc,CAACpB,SAAD,EAAYC,WAAZ,EAAyBO,SAAzB,EAAoCN,GAApC,EAAyCC,KAAzC,EAAgDC,KAAhD,CAA1B;;AAGd,MAAIJ,SAAS,CAACM,MAAV,GAAmB,KAAKJ,GAA5B,EAAiC;AAC/Bc,IAAAA,IAAI,GAAGF,IAAI,GAAGd,SAAS,CAAC,CAAD,CAAvB;AACAiB,IAAAA,IAAI,GAAGF,IAAI,GAAGf,SAAS,CAAC,CAAD,CAAvB;;AAEA,SAAK,IAAIqB,CAAC,GAAGnB,GAAb,EAAkBmB,CAAC,GAAGd,QAAtB,EAAgCc,CAAC,IAAInB,GAArC,EAA0C;AACxCgB,MAAAA,CAAC,GAAGlB,SAAS,CAACqB,CAAD,CAAb;AACAF,MAAAA,CAAC,GAAGnB,SAAS,CAACqB,CAAC,GAAG,CAAL,CAAb;AACA,UAAIH,CAAC,GAAGF,IAAR,EAAcA,IAAI,GAAGE,CAAP;AACd,UAAIC,CAAC,GAAGF,IAAR,EAAcA,IAAI,GAAGE,CAAP;AACd,UAAID,CAAC,GAAGJ,IAAR,EAAcA,IAAI,GAAGI,CAAP;AACd,UAAIC,CAAC,GAAGJ,IAAR,EAAcA,IAAI,GAAGI,CAAP;AACf;;AAGDN,IAAAA,OAAO,GAAGS,IAAI,CAACC,GAAL,CAAST,IAAI,GAAGE,IAAhB,EAAsBD,IAAI,GAAGE,IAA7B,CAAV;AACAJ,IAAAA,OAAO,GAAGA,OAAO,KAAK,CAAZ,GAAgB,QAAQA,OAAxB,GAAkC,CAA5C;AACD;;AAEDW,EAAAA,YAAY,CAAChB,SAAD,EAAYE,SAAZ,EAAuBR,GAAvB,EAA4Bc,IAA5B,EAAkCC,IAAlC,EAAwCJ,OAAxC,EAAiD,CAAjD,CAAZ;AAEA,SAAOH,SAAP;AACD;;AAGD,SAASD,UAAT,CACEgB,IADF,EAEEC,KAFF,EAGEC,GAHF,EAIEzB,GAJF,EAKE0B,SALF,EAMEC,IANF,EAOEzB,KAPF,EAQU;AACR,MAAIiB,CAAJ;AACA,MAAIS,IAAJ;;AACA,MAAID,IAAI,KAAKE,SAAb,EAAwB;AACtBF,IAAAA,IAAI,GAAGhC,oBAAoB,CAAC4B,IAAD,EAAO;AAACC,MAAAA,KAAD;AAAQC,MAAAA,GAAR;AAAaK,MAAAA,IAAI,EAAE9B,GAAnB;AAAwBE,MAAAA;AAAxB,KAAP,CAA3B;AACD;;AAED,MAAI6B,EAAE,GAAGnC,QAAQ,CAACM,KAAK,CAAC,CAAD,CAAN,CAAjB;AACA,MAAI8B,EAAE,GAAGpC,QAAQ,CAACM,KAAK,CAAC,CAAD,CAAN,CAAjB;;AAIA,MAAIwB,SAAS,KAAKC,IAAI,GAAG,CAAzB,EAA4B;AAC1B,SAAKR,CAAC,GAAGK,KAAT,EAAgBL,CAAC,GAAGM,GAApB,EAAyBN,CAAC,IAAInB,GAA9B,EAAmC4B,IAAI,GAAGK,UAAU,CAACd,CAAD,EAAII,IAAI,CAACJ,CAAC,GAAGY,EAAL,CAAR,EAAkBR,IAAI,CAACJ,CAAC,GAAGa,EAAL,CAAtB,EAAgCJ,IAAhC,CAAjB;AACpC,GAFD,MAEO;AACL,SAAKT,CAAC,GAAGM,GAAG,GAAGzB,GAAf,EAAoBmB,CAAC,IAAIK,KAAzB,EAAgCL,CAAC,IAAInB,GAArC,EACE4B,IAAI,GAAGK,UAAU,CAACd,CAAD,EAAII,IAAI,CAACJ,CAAC,GAAGY,EAAL,CAAR,EAAkBR,IAAI,CAACJ,CAAC,GAAGa,EAAL,CAAtB,EAAgCJ,IAAhC,CAAjB;AACH;;AAED,MAAIA,IAAI,IAAIM,MAAM,CAACN,IAAD,EAAOA,IAAI,CAACnB,IAAZ,CAAlB,EAAqC;AACnC0B,IAAAA,UAAU,CAACP,IAAD,CAAV;AACAA,IAAAA,IAAI,GAAGA,IAAI,CAACnB,IAAZ;AACD;;AAED,SAAOmB,IAAP;AACD;;AAGD,SAASQ,YAAT,CAAsBZ,KAAtB,EAA6BC,GAA7B,EAAmC;AACjC,MAAI,CAACD,KAAL,EAAY,OAAOA,KAAP;AACZ,MAAI,CAACC,GAAL,EAAUA,GAAG,GAAGD,KAAN;AAEV,MAAIa,CAAC,GAAGb,KAAR;AACA,MAAIc,KAAJ;;AACA,KAAG;AACDA,IAAAA,KAAK,GAAG,KAAR;;AAEA,QAAI,CAACD,CAAC,CAACE,OAAH,KAAeL,MAAM,CAACG,CAAD,EAAIA,CAAC,CAAC5B,IAAN,CAAN,IAAqBkB,IAAI,CAACU,CAAC,CAAC3B,IAAH,EAAS2B,CAAT,EAAYA,CAAC,CAAC5B,IAAd,CAAJ,KAA4B,CAAhE,CAAJ,EAAwE;AACtE0B,MAAAA,UAAU,CAACE,CAAD,CAAV;AACAA,MAAAA,CAAC,GAAGZ,GAAG,GAAGY,CAAC,CAAC3B,IAAZ;AACA,UAAI2B,CAAC,KAAKA,CAAC,CAAC5B,IAAZ,EAAkB;AAClB6B,MAAAA,KAAK,GAAG,IAAR;AACD,KALD,MAKO;AACLD,MAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD;AACF,GAXD,QAWS6B,KAAK,IAAID,CAAC,KAAKZ,GAXxB;;AAaA,SAAOA,GAAP;AACD;;AAGD,SAASH,YAAT,CAAsBkB,GAAtB,EAA2BhC,SAA3B,EAAsCR,GAAtC,EAA2Cc,IAA3C,EAAiDC,IAAjD,EAAuDJ,OAAvD,EAAgE8B,IAAhE,EAAuE;AACrE,MAAI,CAACD,GAAL,EAAU;AAGV,MAAI,CAACC,IAAD,IAAS9B,OAAb,EAAsB+B,UAAU,CAACF,GAAD,EAAM1B,IAAN,EAAYC,IAAZ,EAAkBJ,OAAlB,CAAV;AAEtB,MAAIgC,IAAI,GAAGH,GAAX;AACA,MAAI9B,IAAJ;AACA,MAAID,IAAJ;;AAGA,SAAO+B,GAAG,CAAC9B,IAAJ,KAAa8B,GAAG,CAAC/B,IAAxB,EAA8B;AAC5BC,IAAAA,IAAI,GAAG8B,GAAG,CAAC9B,IAAX;AACAD,IAAAA,IAAI,GAAG+B,GAAG,CAAC/B,IAAX;;AAEA,QAAIE,OAAO,GAAGiC,WAAW,CAACJ,GAAD,EAAM1B,IAAN,EAAYC,IAAZ,EAAkBJ,OAAlB,CAAd,GAA2CkC,KAAK,CAACL,GAAD,CAA3D,EAAkE;AAEhEhC,MAAAA,SAAS,CAACsC,IAAV,CAAgBpC,IAAI,CAACS,CAAL,GAASnB,GAAV,GAAiB,CAAhC;AACAQ,MAAAA,SAAS,CAACsC,IAAV,CAAgBN,GAAG,CAACrB,CAAJ,GAAQnB,GAAT,GAAgB,CAA/B;AACAQ,MAAAA,SAAS,CAACsC,IAAV,CAAgBrC,IAAI,CAACU,CAAL,GAASnB,GAAV,GAAiB,CAAhC;AAEAmC,MAAAA,UAAU,CAACK,GAAD,CAAV;AAGAA,MAAAA,GAAG,GAAG/B,IAAI,CAACA,IAAX;AACAkC,MAAAA,IAAI,GAAGlC,IAAI,CAACA,IAAZ;AAEA;AACD;;AAED+B,IAAAA,GAAG,GAAG/B,IAAN;;AAGA,QAAI+B,GAAG,KAAKG,IAAZ,EAAkB;AAEhB,UAAI,CAACF,IAAL,EAAW;AACTnB,QAAAA,YAAY,CAACc,YAAY,CAACI,GAAD,CAAb,EAAoBhC,SAApB,EAA+BR,GAA/B,EAAoCc,IAApC,EAA0CC,IAA1C,EAAgDJ,OAAhD,EAAyD,CAAzD,CAAZ;AAGD,OAJD,MAIO,IAAI8B,IAAI,KAAK,CAAb,EAAgB;AACrBD,QAAAA,GAAG,GAAGO,sBAAsB,CAACX,YAAY,CAACI,GAAD,CAAb,EAAoBhC,SAApB,EAA+BR,GAA/B,CAA5B;AACAsB,QAAAA,YAAY,CAACkB,GAAD,EAAMhC,SAAN,EAAiBR,GAAjB,EAAsBc,IAAtB,EAA4BC,IAA5B,EAAkCJ,OAAlC,EAA2C,CAA3C,CAAZ;AAGD,OALM,MAKA,IAAI8B,IAAI,KAAK,CAAb,EAAgB;AACrBO,QAAAA,WAAW,CAACR,GAAD,EAAMhC,SAAN,EAAiBR,GAAjB,EAAsBc,IAAtB,EAA4BC,IAA5B,EAAkCJ,OAAlC,CAAX;AACD;;AAED;AACD;AACF;AACF;;AAGD,SAASkC,KAAT,CAAeL,GAAf,EAAoB;AAClB,QAAMS,CAAC,GAAGT,GAAG,CAAC9B,IAAd;AACA,QAAMwC,CAAC,GAAGV,GAAV;AACA,QAAMW,CAAC,GAAGX,GAAG,CAAC/B,IAAd;AAEA,MAAIkB,IAAI,CAACsB,CAAD,EAAIC,CAAJ,EAAOC,CAAP,CAAJ,IAAiB,CAArB,EAAwB,OAAO,KAAP;AAGxB,QAAMC,EAAE,GAAGH,CAAC,CAACjC,CAAb;AACA,QAAMqC,EAAE,GAAGH,CAAC,CAAClC,CAAb;AACA,QAAMsC,EAAE,GAAGH,CAAC,CAACnC,CAAb;AACA,QAAMuC,EAAE,GAAGN,CAAC,CAAChC,CAAb;AACA,QAAMuC,EAAE,GAAGN,CAAC,CAACjC,CAAb;AACA,QAAMwC,EAAE,GAAGN,CAAC,CAAClC,CAAb;AAGA,QAAMyC,EAAE,GAAGN,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AACA,QAAMK,EAAE,GAAGJ,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AACA,QAAMG,EAAE,GAAGR,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AACA,QAAMO,EAAE,GAAGN,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AAEA,MAAIpB,CAAC,GAAGc,CAAC,CAAC1C,IAAV;;AACA,SAAO4B,CAAC,KAAKY,CAAb,EAAgB;AACd,QACEZ,CAAC,CAACrB,CAAF,IAAO0C,EAAP,IACArB,CAAC,CAACrB,CAAF,IAAO4C,EADP,IAEAvB,CAAC,CAACpB,CAAF,IAAO0C,EAFP,IAGAtB,CAAC,CAACpB,CAAF,IAAO4C,EAHP,IAIAC,eAAe,CAACV,EAAD,EAAKG,EAAL,EAASF,EAAT,EAAaG,EAAb,EAAiBF,EAAjB,EAAqBG,EAArB,EAAyBpB,CAAC,CAACrB,CAA3B,EAA8BqB,CAAC,CAACpB,CAAhC,CAJf,IAKAU,IAAI,CAACU,CAAC,CAAC3B,IAAH,EAAS2B,CAAT,EAAYA,CAAC,CAAC5B,IAAd,CAAJ,IAA2B,CAN7B,EAQE,OAAO,KAAP;AACF4B,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD;;AAED,SAAO,IAAP;AACD;;AAED,SAASmC,WAAT,CAAqBJ,GAArB,EAA0B1B,IAA1B,EAAgCC,IAAhC,EAAsCJ,OAAtC,EAA+C;AAC7C,QAAMsC,CAAC,GAAGT,GAAG,CAAC9B,IAAd;AACA,QAAMwC,CAAC,GAAGV,GAAV;AACA,QAAMW,CAAC,GAAGX,GAAG,CAAC/B,IAAd;AAEA,MAAIkB,IAAI,CAACsB,CAAD,EAAIC,CAAJ,EAAOC,CAAP,CAAJ,IAAiB,CAArB,EAAwB,OAAO,KAAP;AAExB,QAAMC,EAAE,GAAGH,CAAC,CAACjC,CAAb;AACA,QAAMqC,EAAE,GAAGH,CAAC,CAAClC,CAAb;AACA,QAAMsC,EAAE,GAAGH,CAAC,CAACnC,CAAb;AACA,QAAMuC,EAAE,GAAGN,CAAC,CAAChC,CAAb;AACA,QAAMuC,EAAE,GAAGN,CAAC,CAACjC,CAAb;AACA,QAAMwC,EAAE,GAAGN,CAAC,CAAClC,CAAb;AAGA,QAAMyC,EAAE,GAAGN,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AACA,QAAMK,EAAE,GAAGJ,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AACA,QAAMG,EAAE,GAAGR,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AACA,QAAMO,EAAE,GAAGN,EAAE,GAAGC,EAAL,GAAWD,EAAE,GAAGE,EAAL,GAAUF,EAAV,GAAeE,EAA1B,GAAgCD,EAAE,GAAGC,EAAL,GAAUD,EAAV,GAAeC,EAA1D;AAGA,QAAMM,IAAI,GAAGC,MAAM,CAACN,EAAD,EAAKC,EAAL,EAAS7C,IAAT,EAAeC,IAAf,EAAqBJ,OAArB,CAAnB;AACA,QAAMsD,IAAI,GAAGD,MAAM,CAACJ,EAAD,EAAKC,EAAL,EAAS/C,IAAT,EAAeC,IAAf,EAAqBJ,OAArB,CAAnB;AAEA,MAAI0B,CAAC,GAAGG,GAAG,CAAC0B,KAAZ;AACA,MAAIC,CAAC,GAAG3B,GAAG,CAAC4B,KAAZ;;AAGA,SAAO/B,CAAC,IAAIA,CAAC,CAACgC,CAAF,IAAON,IAAZ,IAAoBI,CAApB,IAAyBA,CAAC,CAACE,CAAF,IAAOJ,IAAvC,EAA6C;AAC3C,QACE5B,CAAC,CAACrB,CAAF,IAAO0C,EAAP,IACArB,CAAC,CAACrB,CAAF,IAAO4C,EADP,IAEAvB,CAAC,CAACpB,CAAF,IAAO0C,EAFP,IAGAtB,CAAC,CAACpB,CAAF,IAAO4C,EAHP,IAIAxB,CAAC,KAAKY,CAJN,IAKAZ,CAAC,KAAKc,CALN,IAMAW,eAAe,CAACV,EAAD,EAAKG,EAAL,EAASF,EAAT,EAAaG,EAAb,EAAiBF,EAAjB,EAAqBG,EAArB,EAAyBpB,CAAC,CAACrB,CAA3B,EAA8BqB,CAAC,CAACpB,CAAhC,CANf,IAOAU,IAAI,CAACU,CAAC,CAAC3B,IAAH,EAAS2B,CAAT,EAAYA,CAAC,CAAC5B,IAAd,CAAJ,IAA2B,CAR7B,EAUE,OAAO,KAAP;AACF4B,IAAAA,CAAC,GAAGA,CAAC,CAAC6B,KAAN;AAEA,QACEC,CAAC,CAACnD,CAAF,IAAO0C,EAAP,IACAS,CAAC,CAACnD,CAAF,IAAO4C,EADP,IAEAO,CAAC,CAAClD,CAAF,IAAO0C,EAFP,IAGAQ,CAAC,CAAClD,CAAF,IAAO4C,EAHP,IAIAM,CAAC,KAAKlB,CAJN,IAKAkB,CAAC,KAAKhB,CALN,IAMAW,eAAe,CAACV,EAAD,EAAKG,EAAL,EAASF,EAAT,EAAaG,EAAb,EAAiBF,EAAjB,EAAqBG,EAArB,EAAyBU,CAAC,CAACnD,CAA3B,EAA8BmD,CAAC,CAAClD,CAAhC,CANf,IAOAU,IAAI,CAACwC,CAAC,CAACzD,IAAH,EAASyD,CAAT,EAAYA,CAAC,CAAC1D,IAAd,CAAJ,IAA2B,CAR7B,EAUE,OAAO,KAAP;AACF0D,IAAAA,CAAC,GAAGA,CAAC,CAACC,KAAN;AACD;;AAGD,SAAO/B,CAAC,IAAIA,CAAC,CAACgC,CAAF,IAAON,IAAnB,EAAyB;AACvB,QACE1B,CAAC,CAACrB,CAAF,IAAO0C,EAAP,IACArB,CAAC,CAACrB,CAAF,IAAO4C,EADP,IAEAvB,CAAC,CAACpB,CAAF,IAAO0C,EAFP,IAGAtB,CAAC,CAACpB,CAAF,IAAO4C,EAHP,IAIAxB,CAAC,KAAKY,CAJN,IAKAZ,CAAC,KAAKc,CALN,IAMAW,eAAe,CAACV,EAAD,EAAKG,EAAL,EAASF,EAAT,EAAaG,EAAb,EAAiBF,EAAjB,EAAqBG,EAArB,EAAyBpB,CAAC,CAACrB,CAA3B,EAA8BqB,CAAC,CAACpB,CAAhC,CANf,IAOAU,IAAI,CAACU,CAAC,CAAC3B,IAAH,EAAS2B,CAAT,EAAYA,CAAC,CAAC5B,IAAd,CAAJ,IAA2B,CAR7B,EAUE,OAAO,KAAP;AACF4B,IAAAA,CAAC,GAAGA,CAAC,CAAC6B,KAAN;AACD;;AAGD,SAAOC,CAAC,IAAIA,CAAC,CAACE,CAAF,IAAOJ,IAAnB,EAAyB;AACvB,QACEE,CAAC,CAACnD,CAAF,IAAO0C,EAAP,IACAS,CAAC,CAACnD,CAAF,IAAO4C,EADP,IAEAO,CAAC,CAAClD,CAAF,IAAO0C,EAFP,IAGAQ,CAAC,CAAClD,CAAF,IAAO4C,EAHP,IAIAM,CAAC,KAAKlB,CAJN,IAKAkB,CAAC,KAAKhB,CALN,IAMAW,eAAe,CAACV,EAAD,EAAKG,EAAL,EAASF,EAAT,EAAaG,EAAb,EAAiBF,EAAjB,EAAqBG,EAArB,EAAyBU,CAAC,CAACnD,CAA3B,EAA8BmD,CAAC,CAAClD,CAAhC,CANf,IAOAU,IAAI,CAACwC,CAAC,CAACzD,IAAH,EAASyD,CAAT,EAAYA,CAAC,CAAC1D,IAAd,CAAJ,IAA2B,CAR7B,EAUE,OAAO,KAAP;AACF0D,IAAAA,CAAC,GAAGA,CAAC,CAACC,KAAN;AACD;;AAED,SAAO,IAAP;AACD;;AAGD,SAASrB,sBAAT,CAAgCvB,KAAhC,EAAuChB,SAAvC,EAAkDR,GAAlD,EAAuD;AACrD,MAAIqC,CAAC,GAAGb,KAAR;;AACA,KAAG;AACD,UAAMyB,CAAC,GAAGZ,CAAC,CAAC3B,IAAZ;AACA,UAAMwC,CAAC,GAAGb,CAAC,CAAC5B,IAAF,CAAOA,IAAjB;;AAEA,QACE,CAACyB,MAAM,CAACe,CAAD,EAAIC,CAAJ,CAAP,IACAoB,UAAU,CAACrB,CAAD,EAAIZ,CAAJ,EAAOA,CAAC,CAAC5B,IAAT,EAAeyC,CAAf,CADV,IAEAqB,aAAa,CAACtB,CAAD,EAAIC,CAAJ,CAFb,IAGAqB,aAAa,CAACrB,CAAD,EAAID,CAAJ,CAJf,EAKE;AACAzC,MAAAA,SAAS,CAACsC,IAAV,CAAgBG,CAAC,CAAC9B,CAAF,GAAMnB,GAAP,GAAc,CAA7B;AACAQ,MAAAA,SAAS,CAACsC,IAAV,CAAgBT,CAAC,CAAClB,CAAF,GAAMnB,GAAP,GAAc,CAA7B;AACAQ,MAAAA,SAAS,CAACsC,IAAV,CAAgBI,CAAC,CAAC/B,CAAF,GAAMnB,GAAP,GAAc,CAA7B;AAGAmC,MAAAA,UAAU,CAACE,CAAD,CAAV;AACAF,MAAAA,UAAU,CAACE,CAAC,CAAC5B,IAAH,CAAV;AAEA4B,MAAAA,CAAC,GAAGb,KAAK,GAAG0B,CAAZ;AACD;;AACDb,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GArBD,QAqBS4B,CAAC,KAAKb,KArBf;;AAuBA,SAAOY,YAAY,CAACC,CAAD,CAAnB;AACD;;AAGD,SAASW,WAAT,CAAqBxB,KAArB,EAA4BhB,SAA5B,EAAuCR,GAAvC,EAA4Cc,IAA5C,EAAkDC,IAAlD,EAAwDJ,OAAxD,EAAiE;AAE/D,MAAIsC,CAAC,GAAGzB,KAAR;;AACA,KAAG;AACD,QAAI0B,CAAC,GAAGD,CAAC,CAACxC,IAAF,CAAOA,IAAf;;AACA,WAAOyC,CAAC,KAAKD,CAAC,CAACvC,IAAf,EAAqB;AACnB,UAAIuC,CAAC,CAAC9B,CAAF,KAAQ+B,CAAC,CAAC/B,CAAV,IAAeqD,eAAe,CAACvB,CAAD,EAAIC,CAAJ,CAAlC,EAA0C;AAExC,YAAIC,CAAC,GAAGsB,YAAY,CAACxB,CAAD,EAAIC,CAAJ,CAApB;AAGAD,QAAAA,CAAC,GAAGb,YAAY,CAACa,CAAD,EAAIA,CAAC,CAACxC,IAAN,CAAhB;AACA0C,QAAAA,CAAC,GAAGf,YAAY,CAACe,CAAD,EAAIA,CAAC,CAAC1C,IAAN,CAAhB;AAGAa,QAAAA,YAAY,CAAC2B,CAAD,EAAIzC,SAAJ,EAAeR,GAAf,EAAoBc,IAApB,EAA0BC,IAA1B,EAAgCJ,OAAhC,EAAyC,CAAzC,CAAZ;AACAW,QAAAA,YAAY,CAAC6B,CAAD,EAAI3C,SAAJ,EAAeR,GAAf,EAAoBc,IAApB,EAA0BC,IAA1B,EAAgCJ,OAAhC,EAAyC,CAAzC,CAAZ;AACA;AACD;;AACDuC,MAAAA,CAAC,GAAGA,CAAC,CAACzC,IAAN;AACD;;AACDwC,IAAAA,CAAC,GAAGA,CAAC,CAACxC,IAAN;AACD,GAnBD,QAmBSwC,CAAC,KAAKzB,KAnBf;AAoBD;;AAGD,SAASN,cAAT,CACEK,IADF,EAEExB,WAFF,EAGEO,SAHF,EAIEN,GAJF,EAKEC,KALF,EAMEC,KANF,EAOU;AACR,QAAMwE,KAAK,GAAG,EAAd;AACA,MAAIvD,CAAJ;AACA,MAAIwD,GAAJ;AACA,MAAInD,KAAJ;AACA,MAAIC,GAAJ;AACA,MAAImD,IAAJ;;AAEA,OAAKzD,CAAC,GAAG,CAAJ,EAAOwD,GAAG,GAAG5E,WAAW,CAACK,MAA9B,EAAsCe,CAAC,GAAGwD,GAA1C,EAA+CxD,CAAC,EAAhD,EAAoD;AAClDK,IAAAA,KAAK,GAAGzB,WAAW,CAACoB,CAAD,CAAX,GAAiBnB,GAAzB;AACAyB,IAAAA,GAAG,GAAGN,CAAC,GAAGwD,GAAG,GAAG,CAAV,GAAc5E,WAAW,CAACoB,CAAC,GAAG,CAAL,CAAX,GAAqBnB,GAAnC,GAAyCuB,IAAI,CAACnB,MAApD;AACAwE,IAAAA,IAAI,GAAGrE,UAAU,CAACgB,IAAD,EAAOC,KAAP,EAAcC,GAAd,EAAmBzB,GAAnB,EAAwB,KAAxB,EAA+BC,KAAK,IAAIA,KAAK,CAACkB,CAAC,GAAG,CAAL,CAA7C,EAAsDjB,KAAtD,CAAjB;AACA,QAAI0E,IAAI,KAAKA,IAAI,CAACnE,IAAlB,EAAwBmE,IAAI,CAACrC,OAAL,GAAe,IAAf;AACxBmC,IAAAA,KAAK,CAAC5B,IAAN,CAAW+B,WAAW,CAACD,IAAD,CAAtB;AACD;;AAEDF,EAAAA,KAAK,CAACI,IAAN,CAAWC,QAAX;;AAGA,OAAK5D,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGuD,KAAK,CAACtE,MAAtB,EAA8Be,CAAC,EAA/B,EAAmC;AACjCb,IAAAA,SAAS,GAAG0E,aAAa,CAACN,KAAK,CAACvD,CAAD,CAAN,EAAWb,SAAX,CAAzB;AACD;;AAED,SAAOA,SAAP;AACD;;AAED,SAASyE,QAAT,CAAkB9B,CAAlB,EAAqBC,CAArB,EAAwB;AACtB,SAAOD,CAAC,CAACjC,CAAF,GAAMkC,CAAC,CAAClC,CAAf;AACD;;AAGD,SAASgE,aAAT,CAAuBC,IAAvB,EAA6B3E,SAA7B,EAAwC;AACtC,QAAM4E,MAAM,GAAGC,cAAc,CAACF,IAAD,EAAO3E,SAAP,CAA7B;;AACA,MAAI,CAAC4E,MAAL,EAAa;AACX,WAAO5E,SAAP;AACD;;AAED,QAAM8E,aAAa,GAAGX,YAAY,CAACS,MAAD,EAASD,IAAT,CAAlC;AAGA7C,EAAAA,YAAY,CAACgD,aAAD,EAAgBA,aAAa,CAAC3E,IAA9B,CAAZ;AACA,SAAO2B,YAAY,CAAC8C,MAAD,EAASA,MAAM,CAACzE,IAAhB,CAAnB;AACD;;AAGD,SAAS0E,cAAT,CAAwBF,IAAxB,EAA8B3E,SAA9B,EAAyC;AACvC,MAAI+B,CAAC,GAAG/B,SAAR;AACA,QAAM+E,EAAE,GAAGJ,IAAI,CAACjE,CAAhB;AACA,QAAMsE,EAAE,GAAGL,IAAI,CAAChE,CAAhB;AACA,MAAIsE,EAAE,GAAG,CAACC,QAAV;AACA,MAAIC,CAAJ;;AAIA,KAAG;AACD,QAAIH,EAAE,IAAIjD,CAAC,CAACpB,CAAR,IAAaqE,EAAE,IAAIjD,CAAC,CAAC5B,IAAF,CAAOQ,CAA1B,IAA+BoB,CAAC,CAAC5B,IAAF,CAAOQ,CAAP,KAAaoB,CAAC,CAACpB,CAAlD,EAAqD;AACnD,YAAMD,CAAC,GAAGqB,CAAC,CAACrB,CAAF,GAAO,CAACsE,EAAE,GAAGjD,CAAC,CAACpB,CAAR,KAAcoB,CAAC,CAAC5B,IAAF,CAAOO,CAAP,GAAWqB,CAAC,CAACrB,CAA3B,CAAD,IAAmCqB,CAAC,CAAC5B,IAAF,CAAOQ,CAAP,GAAWoB,CAAC,CAACpB,CAAhD,CAAhB;;AACA,UAAID,CAAC,IAAIqE,EAAL,IAAWrE,CAAC,GAAGuE,EAAnB,EAAuB;AACrBA,QAAAA,EAAE,GAAGvE,CAAL;AACAyE,QAAAA,CAAC,GAAGpD,CAAC,CAACrB,CAAF,GAAMqB,CAAC,CAAC5B,IAAF,CAAOO,CAAb,GAAiBqB,CAAjB,GAAqBA,CAAC,CAAC5B,IAA3B;AACA,YAAIO,CAAC,KAAKqE,EAAV,EAAc,OAAOI,CAAP;AACf;AACF;;AACDpD,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GAVD,QAUS4B,CAAC,KAAK/B,SAVf;;AAYA,MAAI,CAACmF,CAAL,EAAQ,OAAO,IAAP;AAMR,QAAM9C,IAAI,GAAG8C,CAAb;AACA,QAAMC,EAAE,GAAGD,CAAC,CAACzE,CAAb;AACA,QAAM2E,EAAE,GAAGF,CAAC,CAACxE,CAAb;AACA,MAAI2E,MAAM,GAAGJ,QAAb;AACA,MAAIK,GAAJ;AAEAxD,EAAAA,CAAC,GAAGoD,CAAJ;;AAEA,KAAG;AACD,QACEJ,EAAE,IAAIhD,CAAC,CAACrB,CAAR,IACAqB,CAAC,CAACrB,CAAF,IAAO0E,EADP,IAEAL,EAAE,KAAKhD,CAAC,CAACrB,CAFT,IAGA8C,eAAe,CAACwB,EAAE,GAAGK,EAAL,GAAUN,EAAV,GAAeE,EAAhB,EAAoBD,EAApB,EAAwBI,EAAxB,EAA4BC,EAA5B,EAAgCL,EAAE,GAAGK,EAAL,GAAUJ,EAAV,GAAeF,EAA/C,EAAmDC,EAAnD,EAAuDjD,CAAC,CAACrB,CAAzD,EAA4DqB,CAAC,CAACpB,CAA9D,CAJjB,EAKE;AACA4E,MAAAA,GAAG,GAAGzE,IAAI,CAAC0E,GAAL,CAASR,EAAE,GAAGjD,CAAC,CAACpB,CAAhB,KAAsBoE,EAAE,GAAGhD,CAAC,CAACrB,CAA7B,CAAN;;AAEA,UACEuD,aAAa,CAAClC,CAAD,EAAI4C,IAAJ,CAAb,KACCY,GAAG,GAAGD,MAAN,IACEC,GAAG,KAAKD,MAAR,KAAmBvD,CAAC,CAACrB,CAAF,GAAMyE,CAAC,CAACzE,CAAR,IAAcqB,CAAC,CAACrB,CAAF,KAAQyE,CAAC,CAACzE,CAAV,IAAe+E,oBAAoB,CAACN,CAAD,EAAIpD,CAAJ,CAApE,CAFH,CADF,EAIE;AACAoD,QAAAA,CAAC,GAAGpD,CAAJ;AACAuD,QAAAA,MAAM,GAAGC,GAAT;AACD;AACF;;AAEDxD,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GApBD,QAoBS4B,CAAC,KAAKM,IApBf;;AAsBA,SAAO8C,CAAP;AACD;;AAGD,SAASM,oBAAT,CAA8BN,CAA9B,EAAiCpD,CAAjC,EAAoC;AAClC,SAAOV,IAAI,CAAC8D,CAAC,CAAC/E,IAAH,EAAS+E,CAAT,EAAYpD,CAAC,CAAC3B,IAAd,CAAJ,GAA0B,CAA1B,IAA+BiB,IAAI,CAACU,CAAC,CAAC5B,IAAH,EAASgF,CAAT,EAAYA,CAAC,CAAChF,IAAd,CAAJ,GAA0B,CAAhE;AACD;;AAGD,SAASiC,UAAT,CAAoBlB,KAApB,EAA2BV,IAA3B,EAAiCC,IAAjC,EAAuCJ,OAAvC,EAAgD;AAC9C,MAAI0B,CAAC,GAAGb,KAAR;;AACA,KAAG;AACD,QAAIa,CAAC,CAACgC,CAAF,KAAQ,CAAZ,EAAehC,CAAC,CAACgC,CAAF,GAAML,MAAM,CAAC3B,CAAC,CAACrB,CAAH,EAAMqB,CAAC,CAACpB,CAAR,EAAWH,IAAX,EAAiBC,IAAjB,EAAuBJ,OAAvB,CAAZ;AACf0B,IAAAA,CAAC,CAAC6B,KAAF,GAAU7B,CAAC,CAAC3B,IAAZ;AACA2B,IAAAA,CAAC,CAAC+B,KAAF,GAAU/B,CAAC,CAAC5B,IAAZ;AACA4B,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GALD,QAKS4B,CAAC,KAAKb,KALf;;AAOAa,EAAAA,CAAC,CAAC6B,KAAF,CAAQE,KAAR,GAAgB,IAAhB;AACA/B,EAAAA,CAAC,CAAC6B,KAAF,GAAU,IAAV;AAEA8B,EAAAA,UAAU,CAAC3D,CAAD,CAAV;AACD;;AAID,SAAS2D,UAAT,CAAoBpB,IAApB,EAA0B;AACxB,MAAIqB,CAAJ;AACA,MAAI9E,CAAJ;AACA,MAAI+E,MAAM,GAAG,CAAb;AACA,MAAIC,SAAJ;AACA,MAAI9D,CAAJ;AACA,MAAI+D,KAAJ;AACA,MAAIC,CAAJ;AACA,MAAIC,KAAJ;AACA,MAAIC,IAAJ;;AAEA,KAAG;AACDlE,IAAAA,CAAC,GAAGuC,IAAJ;AACAA,IAAAA,IAAI,GAAG,IAAP;AACA2B,IAAAA,IAAI,GAAG,IAAP;AACAJ,IAAAA,SAAS,GAAG,CAAZ;;AAEA,WAAO9D,CAAP,EAAU;AACR8D,MAAAA,SAAS;AACTE,MAAAA,CAAC,GAAGhE,CAAJ;AACA+D,MAAAA,KAAK,GAAG,CAAR;;AACA,WAAKjF,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAG+E,MAAhB,EAAwB/E,CAAC,EAAzB,EAA6B;AAC3BiF,QAAAA,KAAK;AACLC,QAAAA,CAAC,GAAGA,CAAC,CAACjC,KAAN;AACA,YAAI,CAACiC,CAAL,EAAQ;AACT;;AACDC,MAAAA,KAAK,GAAGJ,MAAR;;AAEA,aAAOE,KAAK,GAAG,CAAR,IAAcE,KAAK,GAAG,CAAR,IAAaD,CAAlC,EAAsC;AACpC,YAAID,KAAK,KAAK,CAAV,KAAgBE,KAAK,KAAK,CAAV,IAAe,CAACD,CAAhB,IAAqBhE,CAAC,CAACgC,CAAF,IAAOgC,CAAC,CAAChC,CAA9C,CAAJ,EAAsD;AACpD4B,UAAAA,CAAC,GAAG5D,CAAJ;AACAA,UAAAA,CAAC,GAAGA,CAAC,CAAC+B,KAAN;AACAgC,UAAAA,KAAK;AACN,SAJD,MAIO;AACLH,UAAAA,CAAC,GAAGI,CAAJ;AACAA,UAAAA,CAAC,GAAGA,CAAC,CAACjC,KAAN;AACAkC,UAAAA,KAAK;AACN;;AAED,YAAIC,IAAJ,EAAUA,IAAI,CAACnC,KAAL,GAAa6B,CAAb,CAAV,KACKrB,IAAI,GAAGqB,CAAP;AAELA,QAAAA,CAAC,CAAC/B,KAAF,GAAUqC,IAAV;AACAA,QAAAA,IAAI,GAAGN,CAAP;AACD;;AAED5D,MAAAA,CAAC,GAAGgE,CAAJ;AACD;;AAEDE,IAAAA,IAAI,CAACnC,KAAL,GAAa,IAAb;AACA8B,IAAAA,MAAM,IAAI,CAAV;AACD,GAxCD,QAwCSC,SAAS,GAAG,CAxCrB;;AA0CA,SAAOvB,IAAP;AACD;;AAGD,SAASZ,MAAT,CAAgBhD,CAAhB,EAAmBC,CAAnB,EAAsBH,IAAtB,EAA4BC,IAA5B,EAAkCJ,OAAlC,EAA2C;AAEzCK,EAAAA,CAAC,GAAI,CAACA,CAAC,GAAGF,IAAL,IAAaH,OAAd,GAAyB,CAA7B;AACAM,EAAAA,CAAC,GAAI,CAACA,CAAC,GAAGF,IAAL,IAAaJ,OAAd,GAAyB,CAA7B;AAEAK,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AACAA,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AACAA,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AACAA,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AAEAC,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AACAA,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AACAA,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AACAA,EAAAA,CAAC,GAAG,CAACA,CAAC,GAAIA,CAAC,IAAI,CAAX,IAAiB,UAArB;AAEA,SAAOD,CAAC,GAAIC,CAAC,IAAI,CAAjB;AACD;;AAGD,SAAS4D,WAAT,CAAqBrD,KAArB,EAA4B;AAC1B,MAAIa,CAAC,GAAGb,KAAR;AACA,MAAIgF,QAAQ,GAAGhF,KAAf;;AACA,KAAG;AACD,QAAIa,CAAC,CAACrB,CAAF,GAAMwF,QAAQ,CAACxF,CAAf,IAAqBqB,CAAC,CAACrB,CAAF,KAAQwF,QAAQ,CAACxF,CAAjB,IAAsBqB,CAAC,CAACpB,CAAF,GAAMuF,QAAQ,CAACvF,CAA9D,EAAkEuF,QAAQ,GAAGnE,CAAX;AAClEA,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GAHD,QAGS4B,CAAC,KAAKb,KAHf;;AAKA,SAAOgF,QAAP;AACD;;AAGD,SAAS1C,eAAT,CAAyBV,EAAzB,EAA6BG,EAA7B,EAAiCF,EAAjC,EAAqCG,EAArC,EAAyCF,EAAzC,EAA6CG,EAA7C,EAAiDgD,EAAjD,EAAqDC,EAArD,EAAyD;AACvD,SACE,CAACpD,EAAE,GAAGmD,EAAN,KAAalD,EAAE,GAAGmD,EAAlB,KAAyB,CAACtD,EAAE,GAAGqD,EAAN,KAAahD,EAAE,GAAGiD,EAAlB,CAAzB,IACA,CAACtD,EAAE,GAAGqD,EAAN,KAAajD,EAAE,GAAGkD,EAAlB,KAAyB,CAACrD,EAAE,GAAGoD,EAAN,KAAalD,EAAE,GAAGmD,EAAlB,CADzB,IAEA,CAACrD,EAAE,GAAGoD,EAAN,KAAahD,EAAE,GAAGiD,EAAlB,KAAyB,CAACpD,EAAE,GAAGmD,EAAN,KAAajD,EAAE,GAAGkD,EAAlB,CAH3B;AAKD;;AAGD,SAASlC,eAAT,CAAyBvB,CAAzB,EAA4BC,CAA5B,EAA+B;AAC7B,SACED,CAAC,CAACxC,IAAF,CAAOU,CAAP,KAAa+B,CAAC,CAAC/B,CAAf,IACA8B,CAAC,CAACvC,IAAF,CAAOS,CAAP,KAAa+B,CAAC,CAAC/B,CADf,IAEA,CAACwF,iBAAiB,CAAC1D,CAAD,EAAIC,CAAJ,CAFlB,KAGEqB,aAAa,CAACtB,CAAD,EAAIC,CAAJ,CAAb,IACAqB,aAAa,CAACrB,CAAD,EAAID,CAAJ,CADb,IAEA2D,YAAY,CAAC3D,CAAD,EAAIC,CAAJ,CAFZ,KAGCvB,IAAI,CAACsB,CAAC,CAACvC,IAAH,EAASuC,CAAT,EAAYC,CAAC,CAACxC,IAAd,CAAJ,IAA2BiB,IAAI,CAACsB,CAAD,EAAIC,CAAC,CAACxC,IAAN,EAAYwC,CAAZ,CAHhC,CAAD,IAIEhB,MAAM,CAACe,CAAD,EAAIC,CAAJ,CAAN,IAAgBvB,IAAI,CAACsB,CAAC,CAACvC,IAAH,EAASuC,CAAT,EAAYA,CAAC,CAACxC,IAAd,CAAJ,GAA0B,CAA1C,IAA+CkB,IAAI,CAACuB,CAAC,CAACxC,IAAH,EAASwC,CAAT,EAAYA,CAAC,CAACzC,IAAd,CAAJ,GAA0B,CAP5E,CADF;AAUD;;AAGD,SAASkB,IAAT,CAAcU,CAAd,EAAiBgE,CAAjB,EAAoBQ,CAApB,EAAuB;AACrB,SAAO,CAACR,CAAC,CAACpF,CAAF,GAAMoB,CAAC,CAACpB,CAAT,KAAe4F,CAAC,CAAC7F,CAAF,GAAMqF,CAAC,CAACrF,CAAvB,IAA4B,CAACqF,CAAC,CAACrF,CAAF,GAAMqB,CAAC,CAACrB,CAAT,KAAe6F,CAAC,CAAC5F,CAAF,GAAMoF,CAAC,CAACpF,CAAvB,CAAnC;AACD;;AAGD,SAASiB,MAAT,CAAgB4E,EAAhB,EAAoBC,EAApB,EAAwB;AACtB,SAAOD,EAAE,CAAC9F,CAAH,KAAS+F,EAAE,CAAC/F,CAAZ,IAAiB8F,EAAE,CAAC7F,CAAH,KAAS8F,EAAE,CAAC9F,CAApC;AACD;;AAGD,SAASqD,UAAT,CAAoBwC,EAApB,EAAwBE,EAAxB,EAA4BD,EAA5B,EAAgCE,EAAhC,EAAoC;AAClC,QAAMC,EAAE,GAAGC,IAAI,CAACxF,IAAI,CAACmF,EAAD,EAAKE,EAAL,EAASD,EAAT,CAAL,CAAf;AACA,QAAMK,EAAE,GAAGD,IAAI,CAACxF,IAAI,CAACmF,EAAD,EAAKE,EAAL,EAASC,EAAT,CAAL,CAAf;AACA,QAAMI,EAAE,GAAGF,IAAI,CAACxF,IAAI,CAACoF,EAAD,EAAKE,EAAL,EAASH,EAAT,CAAL,CAAf;AACA,QAAMQ,EAAE,GAAGH,IAAI,CAACxF,IAAI,CAACoF,EAAD,EAAKE,EAAL,EAASD,EAAT,CAAL,CAAf;AAEA,MAAIE,EAAE,KAAKE,EAAP,IAAaC,EAAE,KAAKC,EAAxB,EAA4B,OAAO,IAAP;AAE5B,MAAIJ,EAAE,KAAK,CAAP,IAAYK,SAAS,CAACT,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAzB,EAAuC,OAAO,IAAP;AACvC,MAAII,EAAE,KAAK,CAAP,IAAYG,SAAS,CAACT,EAAD,EAAKG,EAAL,EAASD,EAAT,CAAzB,EAAuC,OAAO,IAAP;AACvC,MAAIK,EAAE,KAAK,CAAP,IAAYE,SAAS,CAACR,EAAD,EAAKD,EAAL,EAASG,EAAT,CAAzB,EAAuC,OAAO,IAAP;AACvC,MAAIK,EAAE,KAAK,CAAP,IAAYC,SAAS,CAACR,EAAD,EAAKC,EAAL,EAASC,EAAT,CAAzB,EAAuC,OAAO,IAAP;AAEvC,SAAO,KAAP;AACD;;AAGD,SAASM,SAAT,CAAmBlF,CAAnB,EAAsBgE,CAAtB,EAAyBQ,CAAzB,EAA4B;AAC1B,SACER,CAAC,CAACrF,CAAF,IAAOI,IAAI,CAACC,GAAL,CAASgB,CAAC,CAACrB,CAAX,EAAc6F,CAAC,CAAC7F,CAAhB,CAAP,IACAqF,CAAC,CAACrF,CAAF,IAAOI,IAAI,CAACoG,GAAL,CAASnF,CAAC,CAACrB,CAAX,EAAc6F,CAAC,CAAC7F,CAAhB,CADP,IAEAqF,CAAC,CAACpF,CAAF,IAAOG,IAAI,CAACC,GAAL,CAASgB,CAAC,CAACpB,CAAX,EAAc4F,CAAC,CAAC5F,CAAhB,CAFP,IAGAoF,CAAC,CAACpF,CAAF,IAAOG,IAAI,CAACoG,GAAL,CAASnF,CAAC,CAACpB,CAAX,EAAc4F,CAAC,CAAC5F,CAAhB,CAJT;AAMD;;AAED,SAASkG,IAAT,CAAcM,GAAd,EAAmB;AACjB,SAAOA,GAAG,GAAG,CAAN,GAAU,CAAV,GAAcA,GAAG,GAAG,CAAN,GAAU,CAAC,CAAX,GAAe,CAApC;AACD;;AAGD,SAASd,iBAAT,CAA2B1D,CAA3B,EAA8BC,CAA9B,EAAiC;AAC/B,MAAIb,CAAC,GAAGY,CAAR;;AACA,KAAG;AACD,QACEZ,CAAC,CAAClB,CAAF,KAAQ8B,CAAC,CAAC9B,CAAV,IACAkB,CAAC,CAAC5B,IAAF,CAAOU,CAAP,KAAa8B,CAAC,CAAC9B,CADf,IAEAkB,CAAC,CAAClB,CAAF,KAAQ+B,CAAC,CAAC/B,CAFV,IAGAkB,CAAC,CAAC5B,IAAF,CAAOU,CAAP,KAAa+B,CAAC,CAAC/B,CAHf,IAIAmD,UAAU,CAACjC,CAAD,EAAIA,CAAC,CAAC5B,IAAN,EAAYwC,CAAZ,EAAeC,CAAf,CALZ,EAOE,OAAO,IAAP;AACFb,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GAVD,QAUS4B,CAAC,KAAKY,CAVf;;AAYA,SAAO,KAAP;AACD;;AAGD,SAASsB,aAAT,CAAuBtB,CAAvB,EAA0BC,CAA1B,EAA6B;AAC3B,SAAOvB,IAAI,CAACsB,CAAC,CAACvC,IAAH,EAASuC,CAAT,EAAYA,CAAC,CAACxC,IAAd,CAAJ,GAA0B,CAA1B,GACHkB,IAAI,CAACsB,CAAD,EAAIC,CAAJ,EAAOD,CAAC,CAACxC,IAAT,CAAJ,IAAsB,CAAtB,IAA2BkB,IAAI,CAACsB,CAAD,EAAIA,CAAC,CAACvC,IAAN,EAAYwC,CAAZ,CAAJ,IAAsB,CAD9C,GAEHvB,IAAI,CAACsB,CAAD,EAAIC,CAAJ,EAAOD,CAAC,CAACvC,IAAT,CAAJ,GAAqB,CAArB,IAA0BiB,IAAI,CAACsB,CAAD,EAAIA,CAAC,CAACxC,IAAN,EAAYyC,CAAZ,CAAJ,GAAqB,CAFnD;AAGD;;AAGD,SAAS0D,YAAT,CAAsB3D,CAAtB,EAAyBC,CAAzB,EAA4B;AAC1B,MAAIb,CAAC,GAAGY,CAAR;AACA,MAAIyE,MAAM,GAAG,KAAb;AACA,QAAMjB,EAAE,GAAG,CAACxD,CAAC,CAACjC,CAAF,GAAMkC,CAAC,CAAClC,CAAT,IAAc,CAAzB;AACA,QAAM0F,EAAE,GAAG,CAACzD,CAAC,CAAChC,CAAF,GAAMiC,CAAC,CAACjC,CAAT,IAAc,CAAzB;;AACA,KAAG;AACD,QACEoB,CAAC,CAACpB,CAAF,GAAMyF,EAAN,KAAarE,CAAC,CAAC5B,IAAF,CAAOQ,CAAP,GAAWyF,EAAxB,IACArE,CAAC,CAAC5B,IAAF,CAAOQ,CAAP,KAAaoB,CAAC,CAACpB,CADf,IAEAwF,EAAE,GAAI,CAACpE,CAAC,CAAC5B,IAAF,CAAOO,CAAP,GAAWqB,CAAC,CAACrB,CAAd,KAAoB0F,EAAE,GAAGrE,CAAC,CAACpB,CAA3B,CAAD,IAAmCoB,CAAC,CAAC5B,IAAF,CAAOQ,CAAP,GAAWoB,CAAC,CAACpB,CAAhD,IAAqDoB,CAAC,CAACrB,CAH9D,EAKE0G,MAAM,GAAG,CAACA,MAAV;AACFrF,IAAAA,CAAC,GAAGA,CAAC,CAAC5B,IAAN;AACD,GARD,QAQS4B,CAAC,KAAKY,CARf;;AAUA,SAAOyE,MAAP;AACD;;AAID,SAASjD,YAAT,CAAsBxB,CAAtB,EAAyBC,CAAzB,EAA4B;AAC1B,QAAMyE,EAAE,GAAG,IAAIC,MAAJ,CAAW3E,CAAC,CAAC9B,CAAb,EAAgB8B,CAAC,CAACjC,CAAlB,EAAqBiC,CAAC,CAAChC,CAAvB,CAAX;AACA,QAAM4G,EAAE,GAAG,IAAID,MAAJ,CAAW1E,CAAC,CAAC/B,CAAb,EAAgB+B,CAAC,CAAClC,CAAlB,EAAqBkC,CAAC,CAACjC,CAAvB,CAAX;AACA,QAAM6G,EAAE,GAAG7E,CAAC,CAACxC,IAAb;AACA,QAAMsH,EAAE,GAAG7E,CAAC,CAACxC,IAAb;AAEAuC,EAAAA,CAAC,CAACxC,IAAF,GAASyC,CAAT;AACAA,EAAAA,CAAC,CAACxC,IAAF,GAASuC,CAAT;AAEA0E,EAAAA,EAAE,CAAClH,IAAH,GAAUqH,EAAV;AACAA,EAAAA,EAAE,CAACpH,IAAH,GAAUiH,EAAV;AAEAE,EAAAA,EAAE,CAACpH,IAAH,GAAUkH,EAAV;AACAA,EAAAA,EAAE,CAACjH,IAAH,GAAUmH,EAAV;AAEAE,EAAAA,EAAE,CAACtH,IAAH,GAAUoH,EAAV;AACAA,EAAAA,EAAE,CAACnH,IAAH,GAAUqH,EAAV;AAEA,SAAOF,EAAP;AACD;;AAGD,SAAS5F,UAAT,CAAoBd,CAApB,EAAuBH,CAAvB,EAA0BC,CAA1B,EAA6BW,IAA7B,EAAmC;AACjC,QAAMS,CAAC,GAAG,IAAIuF,MAAJ,CAAWzG,CAAX,EAAcH,CAAd,EAAiBC,CAAjB,CAAV;;AAEA,MAAI,CAACW,IAAL,EAAW;AACTS,IAAAA,CAAC,CAAC3B,IAAF,GAAS2B,CAAT;AACAA,IAAAA,CAAC,CAAC5B,IAAF,GAAS4B,CAAT;AACD,GAHD,MAGO;AACLA,IAAAA,CAAC,CAAC5B,IAAF,GAASmB,IAAI,CAACnB,IAAd;AACA4B,IAAAA,CAAC,CAAC3B,IAAF,GAASkB,IAAT;AACAA,IAAAA,IAAI,CAACnB,IAAL,CAAUC,IAAV,GAAiB2B,CAAjB;AACAT,IAAAA,IAAI,CAACnB,IAAL,GAAY4B,CAAZ;AACD;;AACD,SAAOA,CAAP;AACD;;AAED,SAASF,UAAT,CAAoBE,CAApB,EAAuB;AACrBA,EAAAA,CAAC,CAAC5B,IAAF,CAAOC,IAAP,GAAc2B,CAAC,CAAC3B,IAAhB;AACA2B,EAAAA,CAAC,CAAC3B,IAAF,CAAOD,IAAP,GAAc4B,CAAC,CAAC5B,IAAhB;AAEA,MAAI4B,CAAC,CAAC6B,KAAN,EAAa7B,CAAC,CAAC6B,KAAF,CAAQE,KAAR,GAAgB/B,CAAC,CAAC+B,KAAlB;AACb,MAAI/B,CAAC,CAAC+B,KAAN,EAAa/B,CAAC,CAAC+B,KAAF,CAAQF,KAAR,GAAgB7B,CAAC,CAAC6B,KAAlB;AACd;;AAED,MAAM0D,MAAN,CAAa;AAsBXI,EAAAA,WAAW,CAAC7G,CAAD,EAAYH,CAAZ,EAAuBC,CAAvB,EAAkC;AAAA;;AAAA;;AAAA;;AAAA,kCAb9B,IAa8B;;AAAA,kCAZ9B,IAY8B;;AAAA,+BATjC,CASiC;;AAAA,mCAN7B,IAM6B;;AAAA,mCAL7B,IAK6B;;AAAA,qCAF1B,KAE0B;;AAC3C,SAAKE,CAAL,GAASA,CAAT;AACA,SAAKH,CAAL,GAASA,CAAT;AACA,SAAKC,CAAL,GAASA,CAAT;AACD;;AA1BU","sourcesContent":["/*\n  Adapted from https://github.com/mapbox/earcut to allow passing in\n  of outline and hole areas using the `areas` parameter. As the\n  areas are calcuted as part of classifying the polygon rings\n  we can pass them in again to avoid recomputation\n\n  ISC License\n\n  Copyright (c) 2016, 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// @ts-nocheck\n\n/* eslint-disable */\n\nimport type {NumericArray} from '@math.gl/core';\nimport {getPolygonSignedArea, DimIndex, Plane2D} from './polygon-utils';\n\n/**\n * Computes a triangulation of a polygon\n * @param positions a flat array of the vertex positions that define the polygon.\n * @param holeIndices an array of hole indices if any (e.g. [5, 8] for a 12-vertex input would mean one hole with vertices 5–7 and another with 8–11).\n * @param dim the number of elements in each vertex. Size `2` will interpret `positions` as `[x0, y0, x1, y1, ...]` and size `3` will interpret `positions` as `[x0, y0, z0, x1, y1, z1, ...]`. Default `2`.\n * @param areas areas of outer polygon and holes as computed by `getPolygonSignedArea()`. Can be optionally supplied to speed up triangulation\n * @returns array of indices into the `positions` array that describes the triangulation of the polygon\n * Adapted from https://github.com/mapbox/earcut\n */\nexport function earcut(\n  positions: NumericArray,\n  holeIndices?: NumericArray,\n  dim: number = 2,\n  areas?: NumericArray,\n  plane: Plane2D = 'xy'\n): number[] {\n  const hasHoles = holeIndices && holeIndices.length;\n  const outerLen = hasHoles ? holeIndices[0] * dim : positions.length;\n  let outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0], plane);\n  const triangles = [];\n\n  if (!outerNode || outerNode.next === outerNode.prev) return triangles;\n\n  let invSize;\n  let maxX;\n  let maxY;\n  let minX;\n  let minY;\n  let x;\n  let y;\n\n  if (hasHoles) outerNode = eliminateHoles(positions, holeIndices, outerNode, dim, areas, plane);\n\n  // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox\n  if (positions.length > 80 * dim) {\n    minX = maxX = positions[0];\n    minY = maxY = positions[1];\n\n    for (let i = dim; i < outerLen; i += dim) {\n      x = positions[i];\n      y = positions[i + 1];\n      if (x < minX) minX = x;\n      if (y < minY) minY = y;\n      if (x > maxX) maxX = x;\n      if (y > maxY) maxY = y;\n    }\n\n    // minX, minY and invSize are later used to transform coords into integers for z-order calculation\n    invSize = Math.max(maxX - minX, maxY - minY);\n    invSize = invSize !== 0 ? 32767 / invSize : 0;\n  }\n\n  earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);\n\n  return triangles;\n}\n\n// create a circular doubly linked list from polygon points in the specified winding order\nfunction linkedList(\n  data: NumericArray,\n  start: number,\n  end: number,\n  dim: number,\n  clockwise: boolean,\n  area: number | undefined,\n  plane: Plane2D\n): Vertex {\n  let i;\n  let last;\n  if (area === undefined) {\n    area = getPolygonSignedArea(data, {start, end, size: dim, plane});\n  }\n\n  let i0 = DimIndex[plane[0]];\n  let i1 = DimIndex[plane[1]];\n  // Note that the signed area calculation in math.gl\n  // has the opposite sign to that which was originally\n  // present in earcut, thus the `< 0` is reversed\n  if (clockwise === area < 0) {\n    for (i = start; i < end; i += dim) last = insertNode(i, data[i + i0], data[i + i1], last);\n  } else {\n    for (i = end - dim; i >= start; i -= dim)\n      last = insertNode(i, data[i + i0], data[i + i1], last);\n  }\n\n  if (last && equals(last, last.next)) {\n    removeNode(last);\n    last = last.next;\n  }\n\n  return last;\n}\n\n// eliminate colinear or duplicate points\nfunction filterPoints(start, end?) {\n  if (!start) return start;\n  if (!end) end = start;\n\n  let p = start;\n  let again;\n  do {\n    again = false;\n\n    if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {\n      removeNode(p);\n      p = end = p.prev;\n      if (p === p.next) break;\n      again = true;\n    } else {\n      p = p.next;\n    }\n  } while (again || p !== end);\n\n  return end;\n}\n\n// main ear slicing loop which triangulates a polygon (given as a linked list)\nfunction earcutLinked(ear, triangles, dim, minX, minY, invSize, pass?) {\n  if (!ear) return;\n\n  // interlink polygon nodes in z-order\n  if (!pass && invSize) indexCurve(ear, minX, minY, invSize);\n\n  let stop = ear;\n  let prev;\n  let next;\n\n  // iterate through ears, slicing them one by one\n  while (ear.prev !== ear.next) {\n    prev = ear.prev;\n    next = ear.next;\n\n    if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {\n      // cut off the triangle\n      triangles.push((prev.i / dim) | 0);\n      triangles.push((ear.i / dim) | 0);\n      triangles.push((next.i / dim) | 0);\n\n      removeNode(ear);\n\n      // skipping the next vertex leads to less sliver triangles\n      ear = next.next;\n      stop = next.next;\n\n      continue;\n    }\n\n    ear = next;\n\n    // if we looped through the whole remaining polygon and can't find any more ears\n    if (ear === stop) {\n      // try filtering points and slicing again\n      if (!pass) {\n        earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);\n\n        // if this didn't work, try curing all small self-intersections locally\n      } else if (pass === 1) {\n        ear = cureLocalIntersections(filterPoints(ear), triangles, dim);\n        earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);\n\n        // as a last resort, try splitting the remaining polygon into two\n      } else if (pass === 2) {\n        splitEarcut(ear, triangles, dim, minX, minY, invSize);\n      }\n\n      break;\n    }\n  }\n}\n\n// check whether a polygon node forms a valid ear with adjacent nodes\nfunction isEar(ear) {\n  const a = ear.prev;\n  const b = ear;\n  const c = ear.next;\n\n  if (area(a, b, c) >= 0) return false; // reflex, can't be an ear\n\n  // now make sure we don't have other points inside the potential ear\n  const ax = a.x;\n  const bx = b.x;\n  const cx = c.x;\n  const ay = a.y;\n  const by = b.y;\n  const cy = c.y;\n\n  // triangle bbox; min & max are calculated like this for speed\n  const x0 = ax < bx ? (ax < cx ? ax : cx) : bx < cx ? bx : cx;\n  const y0 = ay < by ? (ay < cy ? ay : cy) : by < cy ? by : cy;\n  const x1 = ax > bx ? (ax > cx ? ax : cx) : bx > cx ? bx : cx;\n  const y1 = ay > by ? (ay > cy ? ay : cy) : by > cy ? by : cy;\n\n  let p = c.next;\n  while (p !== a) {\n    if (\n      p.x >= x0 &&\n      p.x <= x1 &&\n      p.y >= y0 &&\n      p.y <= y1 &&\n      pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&\n      area(p.prev, p, p.next) >= 0\n    )\n      return false;\n    p = p.next;\n  }\n\n  return true;\n}\n\nfunction isEarHashed(ear, minX, minY, invSize) {\n  const a = ear.prev;\n  const b = ear;\n  const c = ear.next;\n\n  if (area(a, b, c) >= 0) return false; // reflex, can't be an ear\n\n  const ax = a.x;\n  const bx = b.x;\n  const cx = c.x;\n  const ay = a.y;\n  const by = b.y;\n  const cy = c.y;\n\n  // triangle bbox; min & max are calculated like this for speed\n  const x0 = ax < bx ? (ax < cx ? ax : cx) : bx < cx ? bx : cx;\n  const y0 = ay < by ? (ay < cy ? ay : cy) : by < cy ? by : cy;\n  const x1 = ax > bx ? (ax > cx ? ax : cx) : bx > cx ? bx : cx;\n  const y1 = ay > by ? (ay > cy ? ay : cy) : by > cy ? by : cy;\n\n  // z-order range for the current triangle bbox;\n  const minZ = zOrder(x0, y0, minX, minY, invSize);\n  const maxZ = zOrder(x1, y1, minX, minY, invSize);\n\n  let p = ear.prevZ;\n  let n = ear.nextZ;\n\n  // look for points inside the triangle in both directions\n  while (p && p.z >= minZ && n && n.z <= maxZ) {\n    if (\n      p.x >= x0 &&\n      p.x <= x1 &&\n      p.y >= y0 &&\n      p.y <= y1 &&\n      p !== a &&\n      p !== c &&\n      pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&\n      area(p.prev, p, p.next) >= 0\n    )\n      return false;\n    p = p.prevZ;\n\n    if (\n      n.x >= x0 &&\n      n.x <= x1 &&\n      n.y >= y0 &&\n      n.y <= y1 &&\n      n !== a &&\n      n !== c &&\n      pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) &&\n      area(n.prev, n, n.next) >= 0\n    )\n      return false;\n    n = n.nextZ;\n  }\n\n  // look for remaining points in decreasing z-order\n  while (p && p.z >= minZ) {\n    if (\n      p.x >= x0 &&\n      p.x <= x1 &&\n      p.y >= y0 &&\n      p.y <= y1 &&\n      p !== a &&\n      p !== c &&\n      pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&\n      area(p.prev, p, p.next) >= 0\n    )\n      return false;\n    p = p.prevZ;\n  }\n\n  // look for remaining points in increasing z-order\n  while (n && n.z <= maxZ) {\n    if (\n      n.x >= x0 &&\n      n.x <= x1 &&\n      n.y >= y0 &&\n      n.y <= y1 &&\n      n !== a &&\n      n !== c &&\n      pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) &&\n      area(n.prev, n, n.next) >= 0\n    )\n      return false;\n    n = n.nextZ;\n  }\n\n  return true;\n}\n\n// go through all polygon nodes and cure small local self-intersections\nfunction cureLocalIntersections(start, triangles, dim) {\n  let p = start;\n  do {\n    const a = p.prev;\n    const b = p.next.next;\n\n    if (\n      !equals(a, b) &&\n      intersects(a, p, p.next, b) &&\n      locallyInside(a, b) &&\n      locallyInside(b, a)\n    ) {\n      triangles.push((a.i / dim) | 0);\n      triangles.push((p.i / dim) | 0);\n      triangles.push((b.i / dim) | 0);\n\n      // remove two nodes involved\n      removeNode(p);\n      removeNode(p.next);\n\n      p = start = b;\n    }\n    p = p.next;\n  } while (p !== start);\n\n  return filterPoints(p);\n}\n\n// try splitting polygon into two and triangulate them independently\nfunction splitEarcut(start, triangles, dim, minX, minY, invSize) {\n  // look for a valid diagonal that divides the polygon into two\n  let a = start;\n  do {\n    let b = a.next.next;\n    while (b !== a.prev) {\n      if (a.i !== b.i && isValidDiagonal(a, b)) {\n        // split the polygon in two by the diagonal\n        let c = splitPolygon(a, b);\n\n        // filter colinear points around the cuts\n        a = filterPoints(a, a.next);\n        c = filterPoints(c, c.next);\n\n        // run earcut on each half\n        earcutLinked(a, triangles, dim, minX, minY, invSize, 0);\n        earcutLinked(c, triangles, dim, minX, minY, invSize, 0);\n        return;\n      }\n      b = b.next;\n    }\n    a = a.next;\n  } while (a !== start);\n}\n\n// link every hole into the outer loop, producing a single-ring polygon without holes\nfunction eliminateHoles(\n  data: NumericArray,\n  holeIndices: NumericArray,\n  outerNode: Vertex,\n  dim: number,\n  areas: NumericArray | undefined,\n  plane: Plane2D\n): Vertex {\n  const queue = [];\n  let i;\n  let len;\n  let start;\n  let end;\n  let list;\n\n  for (i = 0, len = holeIndices.length; i < len; i++) {\n    start = holeIndices[i] * dim;\n    end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;\n    list = linkedList(data, start, end, dim, false, areas && areas[i + 1], plane);\n    if (list === list.next) list.steiner = true;\n    queue.push(getLeftmost(list));\n  }\n\n  queue.sort(compareX);\n\n  // process holes from left to right\n  for (i = 0; i < queue.length; i++) {\n    outerNode = eliminateHole(queue[i], outerNode);\n  }\n\n  return outerNode;\n}\n\nfunction compareX(a, b) {\n  return a.x - b.x;\n}\n\n// find a bridge between vertices that connects hole with an outer ring and and link it\nfunction eliminateHole(hole, outerNode) {\n  const bridge = findHoleBridge(hole, outerNode);\n  if (!bridge) {\n    return outerNode;\n  }\n\n  const bridgeReverse = splitPolygon(bridge, hole);\n\n  // filter collinear points around the cuts\n  filterPoints(bridgeReverse, bridgeReverse.next);\n  return filterPoints(bridge, bridge.next);\n}\n\n// David Eberly's algorithm for finding a bridge between hole and outer polygon\nfunction findHoleBridge(hole, outerNode) {\n  let p = outerNode;\n  const hx = hole.x;\n  const hy = hole.y;\n  let qx = -Infinity;\n  let m;\n\n  // find a segment intersected by a ray from the hole's leftmost point to the left;\n  // segment's endpoint with lesser x will be potential connection point\n  do {\n    if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {\n      const x = p.x + ((hy - p.y) * (p.next.x - p.x)) / (p.next.y - p.y);\n      if (x <= hx && x > qx) {\n        qx = x;\n        m = p.x < p.next.x ? p : p.next;\n        if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint\n      }\n    }\n    p = p.next;\n  } while (p !== outerNode);\n\n  if (!m) return null;\n\n  // look for points inside the triangle of hole point, segment intersection and endpoint;\n  // if there are no points found, we have a valid connection;\n  // otherwise choose the point of the minimum angle with the ray as connection point\n\n  const stop = m;\n  const mx = m.x;\n  const my = m.y;\n  let tanMin = Infinity;\n  let tan;\n\n  p = m;\n\n  do {\n    if (\n      hx >= p.x &&\n      p.x >= mx &&\n      hx !== p.x &&\n      pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)\n    ) {\n      tan = Math.abs(hy - p.y) / (hx - p.x); // tangential\n\n      if (\n        locallyInside(p, hole) &&\n        (tan < tanMin ||\n          (tan === tanMin && (p.x > m.x || (p.x === m.x && sectorContainsSector(m, p)))))\n      ) {\n        m = p;\n        tanMin = tan;\n      }\n    }\n\n    p = p.next;\n  } while (p !== stop);\n\n  return m;\n}\n\n// whether sector in vertex m contains sector in vertex p in the same coordinates\nfunction sectorContainsSector(m, p) {\n  return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;\n}\n\n// interlink polygon nodes in z-order\nfunction indexCurve(start, minX, minY, invSize) {\n  let p = start;\n  do {\n    if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);\n    p.prevZ = p.prev;\n    p.nextZ = p.next;\n    p = p.next;\n  } while (p !== start);\n\n  p.prevZ.nextZ = null;\n  p.prevZ = null;\n\n  sortLinked(p);\n}\n\n// Simon Tatham's linked list merge sort algorithm\n// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html\nfunction sortLinked(list) {\n  let e;\n  let i;\n  let inSize = 1;\n  let numMerges;\n  let p;\n  let pSize;\n  let q;\n  let qSize;\n  let tail;\n\n  do {\n    p = list;\n    list = null;\n    tail = null;\n    numMerges = 0;\n\n    while (p) {\n      numMerges++;\n      q = p;\n      pSize = 0;\n      for (i = 0; i < inSize; i++) {\n        pSize++;\n        q = q.nextZ;\n        if (!q) break;\n      }\n      qSize = inSize;\n\n      while (pSize > 0 || (qSize > 0 && q)) {\n        if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {\n          e = p;\n          p = p.nextZ;\n          pSize--;\n        } else {\n          e = q;\n          q = q.nextZ;\n          qSize--;\n        }\n\n        if (tail) tail.nextZ = e;\n        else list = e;\n\n        e.prevZ = tail;\n        tail = e;\n      }\n\n      p = q;\n    }\n\n    tail.nextZ = null;\n    inSize *= 2;\n  } while (numMerges > 1);\n\n  return list;\n}\n\n// z-order of a point given coords and inverse of the longer side of data bbox\nfunction zOrder(x, y, minX, minY, invSize) {\n  // coords are transformed into non-negative 15-bit integer range\n  x = ((x - minX) * invSize) | 0;\n  y = ((y - minY) * invSize) | 0;\n\n  x = (x | (x << 8)) & 0x00ff00ff;\n  x = (x | (x << 4)) & 0x0f0f0f0f;\n  x = (x | (x << 2)) & 0x33333333;\n  x = (x | (x << 1)) & 0x55555555;\n\n  y = (y | (y << 8)) & 0x00ff00ff;\n  y = (y | (y << 4)) & 0x0f0f0f0f;\n  y = (y | (y << 2)) & 0x33333333;\n  y = (y | (y << 1)) & 0x55555555;\n\n  return x | (y << 1);\n}\n\n// find the leftmost node of a polygon ring\nfunction getLeftmost(start) {\n  let p = start;\n  let leftmost = start;\n  do {\n    if (p.x < leftmost.x || (p.x === leftmost.x && p.y < leftmost.y)) leftmost = p;\n    p = p.next;\n  } while (p !== start);\n\n  return leftmost;\n}\n\n// check if a point lies within a convex triangle\nfunction pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {\n  return (\n    (cx - px) * (ay - py) >= (ax - px) * (cy - py) &&\n    (ax - px) * (by - py) >= (bx - px) * (ay - py) &&\n    (bx - px) * (cy - py) >= (cx - px) * (by - py)\n  );\n}\n\n// check if a diagonal between two polygon nodes is valid (lies in polygon interior)\nfunction isValidDiagonal(a, b) {\n  return (\n    a.next.i !== b.i &&\n    a.prev.i !== b.i &&\n    !intersectsPolygon(a, b) && // dones't intersect other edges\n    ((locallyInside(a, b) &&\n      locallyInside(b, a) &&\n      middleInside(a, b) && // locally visible\n      (area(a.prev, a, b.prev) || area(a, b.prev, b))) || // does not create opposite-facing sectors\n      (equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0))\n  ); // special zero-length case\n}\n\n// signed area of a triangle\nfunction area(p, q, r) {\n  return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);\n}\n\n// check if two points are equal\nfunction equals(p1, p2) {\n  return p1.x === p2.x && p1.y === p2.y;\n}\n\n// check if two segments intersect\nfunction intersects(p1, q1, p2, q2) {\n  const o1 = sign(area(p1, q1, p2));\n  const o2 = sign(area(p1, q1, q2));\n  const o3 = sign(area(p2, q2, p1));\n  const o4 = sign(area(p2, q2, q1));\n\n  if (o1 !== o2 && o3 !== o4) return true; // general case\n\n  if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1\n  if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1\n  if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2\n  if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2\n\n  return false;\n}\n\n// for collinear points p, q, r, check if point q lies on segment pr\nfunction onSegment(p, q, r) {\n  return (\n    q.x <= Math.max(p.x, r.x) &&\n    q.x >= Math.min(p.x, r.x) &&\n    q.y <= Math.max(p.y, r.y) &&\n    q.y >= Math.min(p.y, r.y)\n  );\n}\n\nfunction sign(num) {\n  return num > 0 ? 1 : num < 0 ? -1 : 0;\n}\n\n// check if a polygon diagonal intersects any polygon segments\nfunction intersectsPolygon(a, b) {\n  let p = a;\n  do {\n    if (\n      p.i !== a.i &&\n      p.next.i !== a.i &&\n      p.i !== b.i &&\n      p.next.i !== b.i &&\n      intersects(p, p.next, a, b)\n    )\n      return true;\n    p = p.next;\n  } while (p !== a);\n\n  return false;\n}\n\n// check if a polygon diagonal is locally inside the polygon\nfunction locallyInside(a, b) {\n  return area(a.prev, a, a.next) < 0\n    ? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0\n    : area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;\n}\n\n// check if the middle point of a polygon diagonal is inside the polygon\nfunction middleInside(a, b) {\n  let p = a;\n  let inside = false;\n  const px = (a.x + b.x) / 2;\n  const py = (a.y + b.y) / 2;\n  do {\n    if (\n      p.y > py !== p.next.y > py &&\n      p.next.y !== p.y &&\n      px < ((p.next.x - p.x) * (py - p.y)) / (p.next.y - p.y) + p.x\n    )\n      inside = !inside;\n    p = p.next;\n  } while (p !== a);\n\n  return inside;\n}\n\n// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;\n// if one belongs to the outer ring and another to a hole, it merges it into a single ring\nfunction splitPolygon(a, b) {\n  const a2 = new Vertex(a.i, a.x, a.y);\n  const b2 = new Vertex(b.i, b.x, b.y);\n  const an = a.next;\n  const bp = b.prev;\n\n  a.next = b;\n  b.prev = a;\n\n  a2.next = an;\n  an.prev = a2;\n\n  b2.next = a2;\n  a2.prev = b2;\n\n  bp.next = b2;\n  b2.prev = bp;\n\n  return b2;\n}\n\n// create a node and optionally link it with previous one (in a circular doubly linked list)\nfunction insertNode(i, x, y, last) {\n  const p = new Vertex(i, x, y);\n\n  if (!last) {\n    p.prev = p;\n    p.next = p;\n  } else {\n    p.next = last.next;\n    p.prev = last;\n    last.next.prev = p;\n    last.next = p;\n  }\n  return p;\n}\n\nfunction removeNode(p) {\n  p.next.prev = p.prev;\n  p.prev.next = p.next;\n\n  if (p.prevZ) p.prevZ.nextZ = p.nextZ;\n  if (p.nextZ) p.nextZ.prevZ = p.prevZ;\n}\n\nclass Vertex {\n  // vertex index in coordinates array\n  i: number;\n\n  // vertex coordinates\n  x: number;\n  y: number;\n\n  // previous and next vertex nodes in a polygon ring\n  prev: Vertex = null;\n  next: Vertex = null;\n\n  // z-order curve value\n  z: number = 0;\n\n  // previous and next nodes in z-order\n  prevZ: Vertex = null;\n  nextZ: Vertex = null;\n\n  // indicates whether this is a steiner point\n  steiner: boolean = false;\n\n  constructor(i: number, x: number, y: number) {\n    this.i = i;\n    this.x = x;\n    this.y = y;\n  }\n}\n"],"file":"earcut.js"}