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

package/dist/es5/earcut.js

@@ -1,540 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.earcut = earcut;
-
-var _polygonUtils = require("./polygon-utils");
-
-function earcut(positions, holeIndices) {
-  var dim = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 2;
-  var areas = arguments.length > 3 ? arguments[3] : undefined;
-  var hasHoles = holeIndices && holeIndices.length;
-  var outerLen = hasHoles ? holeIndices[0] * dim : positions.length;
-  var outerNode = linkedList(positions, 0, outerLen, dim, true, areas && areas[0]);
-  var triangles = [];
-  if (!outerNode || outerNode.next === outerNode.prev) return triangles;
-  var invSize;
-  var maxX;
-  var maxY;
-  var minX;
-  var minY;
-  var x;
-  var y;
-  if (hasHoles) outerNode = eliminateHoles(positions, holeIndices, outerNode, dim, areas);
-
-  if (positions.length > 80 * dim) {
-    minX = maxX = positions[0];
-    minY = maxY = positions[1];
-
-    for (var i = dim; i < outerLen; i += dim) {
-      x = positions[i];
-      y = positions[i + 1];
-      if (x < minX) minX = x;
-      if (y < minY) minY = y;
-      if (x > maxX) maxX = x;
-      if (y > maxY) maxY = y;
-    }
-
-    invSize = Math.max(maxX - minX, maxY - minY);
-    invSize = invSize !== 0 ? 1 / invSize : 0;
-  }
-
-  earcutLinked(outerNode, triangles, dim, minX, minY, invSize);
-  return triangles;
-}
-
-function linkedList(data, start, end, dim, clockwise, area) {
-  var i;
-  var last;
-
-  if (area === undefined) {
-    area = (0, _polygonUtils.getPolygonSignedArea)(data, {
-      start: start,
-      end: end,
-      size: dim
-    });
-  }
-
-  if (clockwise === area < 0) {
-    for (i = start; i < end; i += dim) {
-      last = insertNode(i, data[i], data[i + 1], last);
-    }
-  } else {
-    for (i = end - dim; i >= start; i -= dim) {
-      last = insertNode(i, data[i], data[i + 1], last);
-    }
-  }
-
-  if (last && equals(last, last.next)) {
-    removeNode(last);
-    last = last.next;
-  }
-
-  return last;
-}
-
-function filterPoints(start, end) {
-  if (!start) return start;
-  if (!end) end = start;
-  var p = start;
-  var again;
-
-  do {
-    again = false;
-
-    if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
-      removeNode(p);
-      p = end = p.prev;
-      if (p === p.next) break;
-      again = true;
-    } else {
-      p = p.next;
-    }
-  } while (again || p !== end);
-
-  return end;
-}
-
-function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
-  if (!ear) return;
-  if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
-  var stop = ear;
-  var prev;
-  var next;
-
-  while (ear.prev !== ear.next) {
-    prev = ear.prev;
-    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);
-      removeNode(ear);
-      ear = next.next;
-      stop = next.next;
-      continue;
-    }
-
-    ear = next;
-
-    if (ear === stop) {
-      if (!pass) {
-        earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
-      } else if (pass === 1) {
-        ear = cureLocalIntersections(filterPoints(ear), triangles, dim);
-        earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
-      } else if (pass === 2) {
-        splitEarcut(ear, triangles, dim, minX, minY, invSize);
-      }
-
-      break;
-    }
-  }
-}
-
-function isEar(ear) {
-  var a = ear.prev;
-  var b = ear;
-  var c = ear.next;
-  if (area(a, b, c) >= 0) return false;
-  var p = ear.next.next;
-
-  while (p !== ear.prev) {
-    if (pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
-    p = p.next;
-  }
-
-  return true;
-}
-
-function isEarHashed(ear, minX, minY, invSize) {
-  var a = ear.prev;
-  var b = ear;
-  var c = ear.next;
-  if (area(a, b, c) >= 0) return false;
-  var minTX = a.x < b.x ? a.x < c.x ? a.x : c.x : b.x < c.x ? b.x : c.x;
-  var minTY = a.y < b.y ? a.y < c.y ? a.y : c.y : b.y < c.y ? b.y : c.y;
-  var maxTX = a.x > b.x ? a.x > c.x ? a.x : c.x : b.x > c.x ? b.x : c.x;
-  var maxTY = a.y > b.y ? a.y > c.y ? a.y : c.y : b.y > c.y ? b.y : c.y;
-  var minZ = zOrder(minTX, minTY, minX, minY, invSize);
-  var maxZ = zOrder(maxTX, maxTY, minX, minY, invSize);
-  var p = ear.prevZ;
-  var n = ear.nextZ;
-
-  while (p && p.z >= minZ && n && n.z <= maxZ) {
-    if (p !== ear.prev && p !== ear.next && pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
-    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;
-    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;
-    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;
-    n = n.nextZ;
-  }
-
-  return true;
-}
-
-function cureLocalIntersections(start, triangles, dim) {
-  var p = start;
-
-  do {
-    var a = p.prev;
-    var b = p.next.next;
-
-    if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
-      triangles.push(a.i / dim);
-      triangles.push(p.i / dim);
-      triangles.push(b.i / dim);
-      removeNode(p);
-      removeNode(p.next);
-      p = start = b;
-    }
-
-    p = p.next;
-  } while (p !== start);
-
-  return filterPoints(p);
-}
-
-function splitEarcut(start, triangles, dim, minX, minY, invSize) {
-  var a = start;
-
-  do {
-    var b = a.next.next;
-
-    while (b !== a.prev) {
-      if (a.i !== b.i && isValidDiagonal(a, b)) {
-        var 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);
-        return;
-      }
-
-      b = b.next;
-    }
-
-    a = a.next;
-  } while (a !== start);
-}
-
-function eliminateHoles(data, holeIndices, outerNode, dim, areas) {
-  var queue = [];
-  var i;
-  var len;
-  var start;
-  var end;
-  var list;
-
-  for (i = 0, len = holeIndices.length; i < len; i++) {
-    start = holeIndices[i] * dim;
-    end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
-    list = linkedList(data, start, end, dim, false, areas && areas[i + 1]);
-    if (list === list.next) list.steiner = true;
-    queue.push(getLeftmost(list));
-  }
-
-  queue.sort(compareX);
-
-  for (i = 0; i < queue.length; i++) {
-    eliminateHole(queue[i], outerNode);
-    outerNode = filterPoints(outerNode, outerNode.next);
-  }
-
-  return outerNode;
-}
-
-function compareX(a, b) {
-  return a.x - b.x;
-}
-
-function eliminateHole(hole, outerNode) {
-  outerNode = findHoleBridge(hole, outerNode);
-
-  if (outerNode) {
-    var b = splitPolygon(outerNode, hole);
-    filterPoints(outerNode, outerNode.next);
-    filterPoints(b, b.next);
-  }
-}
-
-function findHoleBridge(hole, outerNode) {
-  var p = outerNode;
-  var hx = hole.x;
-  var hy = hole.y;
-  var qx = -Infinity;
-  var m;
-
-  do {
-    if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
-      var x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
-
-      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;
-      }
-    }
-
-    p = p.next;
-  } while (p !== outerNode);
-
-  if (!m) return null;
-  if (hx === qx) return m;
-  var stop = m;
-  var mx = m.x;
-  var my = m.y;
-  var tanMin = Infinity;
-  var tan;
-  p = m;
-
-  do {
-    if (hx >= p.x && p.x >= mx && hx !== p.x && pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {
-      tan = Math.abs(hy - p.y) / (hx - p.x);
-
-      if (locallyInside(p, hole) && (tan < tanMin || tan === tanMin && (p.x > m.x || p.x === m.x && sectorContainsSector(m, p)))) {
-        m = p;
-        tanMin = tan;
-      }
-    }
-
-    p = p.next;
-  } while (p !== stop);
-
-  return m;
-}
-
-function sectorContainsSector(m, p) {
-  return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
-}
-
-function indexCurve(start, minX, minY, invSize) {
-  var p = start;
-
-  do {
-    if (p.z === null) p.z = zOrder(p.x, p.y, minX, minY, invSize);
-    p.prevZ = p.prev;
-    p.nextZ = p.next;
-    p = p.next;
-  } while (p !== start);
-
-  p.prevZ.nextZ = null;
-  p.prevZ = null;
-  sortLinked(p);
-}
-
-function sortLinked(list) {
-  var e;
-  var i;
-  var inSize = 1;
-  var numMerges;
-  var p;
-  var pSize;
-  var q;
-  var qSize;
-  var tail;
-
-  do {
-    p = list;
-    list = null;
-    tail = null;
-    numMerges = 0;
-
-    while (p) {
-      numMerges++;
-      q = p;
-      pSize = 0;
-
-      for (i = 0; i < inSize; i++) {
-        pSize++;
-        q = q.nextZ;
-        if (!q) break;
-      }
-
-      qSize = inSize;
-
-      while (pSize > 0 || qSize > 0 && q) {
-        if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {
-          e = p;
-          p = p.nextZ;
-          pSize--;
-        } else {
-          e = q;
-          q = q.nextZ;
-          qSize--;
-        }
-
-        if (tail) tail.nextZ = e;else list = e;
-        e.prevZ = tail;
-        tail = e;
-      }
-
-      p = q;
-    }
-
-    tail.nextZ = null;
-    inSize *= 2;
-  } while (numMerges > 1);
-
-  return list;
-}
-
-function zOrder(x, y, minX, minY, invSize) {
-  x = 32767 * (x - minX) * invSize;
-  y = 32767 * (y - minY) * invSize;
-  x = (x | x << 8) & 0x00ff00ff;
-  x = (x | x << 4) & 0x0f0f0f0f;
-  x = (x | x << 2) & 0x33333333;
-  x = (x | x << 1) & 0x55555555;
-  y = (y | y << 8) & 0x00ff00ff;
-  y = (y | y << 4) & 0x0f0f0f0f;
-  y = (y | y << 2) & 0x33333333;
-  y = (y | y << 1) & 0x55555555;
-  return x | y << 1;
-}
-
-function getLeftmost(start) {
-  var p = start;
-  var leftmost = start;
-
-  do {
-    if (p.x < leftmost.x || p.x === leftmost.x && p.y < leftmost.y) leftmost = p;
-    p = p.next;
-  } while (p !== start);
-
-  return leftmost;
-}
-
-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;
-}
-
-function isValidDiagonal(a, b) {
-  return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && (area(a.prev, a, b.prev) || area(a, b.prev, b)) || equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0);
-}
-
-function area(p, q, r) {
-  return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
-}
-
-function equals(p1, p2) {
-  return p1.x === p2.x && p1.y === p2.y;
-}
-
-function intersects(p1, q1, p2, q2) {
-  var o1 = sign(area(p1, q1, p2));
-  var o2 = sign(area(p1, q1, q2));
-  var o3 = sign(area(p2, q2, p1));
-  var o4 = sign(area(p2, q2, q1));
-  if (o1 !== o2 && o3 !== o4) return true;
-  if (o1 === 0 && onSegment(p1, p2, q1)) return true;
-  if (o2 === 0 && onSegment(p1, q2, q1)) return true;
-  if (o3 === 0 && onSegment(p2, p1, q2)) return true;
-  if (o4 === 0 && onSegment(p2, q1, q2)) return true;
-  return false;
-}
-
-function onSegment(p, q, r) {
-  return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
-}
-
-function sign(num) {
-  return num > 0 ? 1 : num < 0 ? -1 : 0;
-}
-
-function intersectsPolygon(a, b) {
-  var p = a;
-
-  do {
-    if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i && intersects(p, p.next, a, b)) return true;
-    p = p.next;
-  } while (p !== a);
-
-  return false;
-}
-
-function locallyInside(a, b) {
-  return area(a.prev, a, a.next) < 0 ? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 : area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
-}
-
-function middleInside(a, b) {
-  var p = a;
-  var inside = false;
-  var px = (a.x + b.x) / 2;
-  var py = (a.y + b.y) / 2;
-
-  do {
-    if (p.y > py !== p.next.y > py && p.next.y !== p.y && px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x) inside = !inside;
-    p = p.next;
-  } while (p !== a);
-
-  return inside;
-}
-
-function splitPolygon(a, b) {
-  var a2 = new Node(a.i, a.x, a.y);
-  var b2 = new Node(b.i, b.x, b.y);
-  var an = a.next;
-  var bp = b.prev;
-  a.next = b;
-  b.prev = a;
-  a2.next = an;
-  an.prev = a2;
-  b2.next = a2;
-  a2.prev = b2;
-  bp.next = b2;
-  b2.prev = bp;
-  return b2;
-}
-
-function insertNode(i, x, y, last) {
-  var p = new Node(i, x, y);
-
-  if (!last) {
-    p.prev = p;
-    p.next = p;
-  } else {
-    p.next = last.next;
-    p.prev = last;
-    last.next.prev = p;
-    last.next = p;
-  }
-
-  return p;
-}
-
-function removeNode(p) {
-  p.next.prev = p.prev;
-  p.prev.next = p.next;
-  if (p.prevZ) p.prevZ.nextZ = p.nextZ;
-  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;
-}
-//# sourceMappingURL=earcut.js.map

package/dist/es5/earcut.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../../src/earcut.ts"],"names":["earcut","positions","holeIndices","dim","areas","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","insertNode","equals","removeNode","filterPoints","p","again","steiner","ear","pass","indexCurve","stop","isEarHashed","isEar","push","cureLocalIntersections","splitEarcut","a","b","c","pointInTriangle","minTX","minTY","maxTX","maxTY","minZ","zOrder","maxZ","prevZ","n","nextZ","z","intersects","locallyInside","isValidDiagonal","splitPolygon","queue","len","list","getLeftmost","sort","compareX","eliminateHole","hole","findHoleBridge","hx","hy","qx","Infinity","m","mx","my","tanMin","tan","abs","sectorContainsSector","sortLinked","e","inSize","numMerges","pSize","q","qSize","tail","leftmost","ax","ay","bx","by","cx","cy","px","py","intersectsPolygon","middleInside","r","p1","p2","q1","q2","o1","sign","o2","o3","o4","onSegment","min","num","inside","a2","Node","b2","an","bp"],"mappings":";;;;;;;AA0BA;;AAWO,SAASA,MAAT,CACLC,SADK,EAELC,WAFK,EAKK;AAAA,MAFVC,GAEU,uEAFI,CAEJ;AAAA,MADVC,KACU;AACV,MAAMC,QAAQ,GAAGH,WAAW,IAAIA,WAAW,CAACI,MAA5C;AACA,MAAMC,QAAQ,GAAGF,QAAQ,GAAGH,WAAW,CAAC,CAAD,CAAX,GAAiBC,GAApB,GAA0BF,SAAS,CAACK,MAA7D;AACA,MAAIE,SAAS,GAAGC,UAAU,CAACR,SAAD,EAAY,CAAZ,EAAeM,QAAf,EAAyBJ,GAAzB,EAA8B,IAA9B,EAAoCC,KAAK,IAAIA,KAAK,CAAC,CAAD,CAAlD,CAA1B;AACA,MAAMM,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,CAACnB,SAAD,EAAYC,WAAZ,EAAyBM,SAAzB,EAAoCL,GAApC,EAAyCC,KAAzC,CAA1B;;AAGd,MAAIH,SAAS,CAACK,MAAV,GAAmB,KAAKH,GAA5B,EAAiC;AAC/Ba,IAAAA,IAAI,GAAGF,IAAI,GAAGb,SAAS,CAAC,CAAD,CAAvB;AACAgB,IAAAA,IAAI,GAAGF,IAAI,GAAGd,SAAS,CAAC,CAAD,CAAvB;;AAEA,SAAK,IAAIoB,CAAC,GAAGlB,GAAb,EAAkBkB,CAAC,GAAGd,QAAtB,EAAgCc,CAAC,IAAIlB,GAArC,EAA0C;AACxCe,MAAAA,CAAC,GAAGjB,SAAS,CAACoB,CAAD,CAAb;AACAF,MAAAA,CAAC,GAAGlB,SAAS,CAACoB,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,IAAIA,OAApB,GAA8B,CAAxC;AACD;;AAEDW,EAAAA,YAAY,CAAChB,SAAD,EAAYE,SAAZ,EAAuBP,GAAvB,EAA4Ba,IAA5B,EAAkCC,IAAlC,EAAwCJ,OAAxC,CAAZ;AAEA,SAAOH,SAAP;AACD;;AAGD,SAASD,UAAT,CAAoBgB,IAApB,EAA0BC,KAA1B,EAAiCC,GAAjC,EAAsCxB,GAAtC,EAA2CyB,SAA3C,EAAsDC,IAAtD,EAA4D;AAC1D,MAAIR,CAAJ;AACA,MAAIS,IAAJ;;AACA,MAAID,IAAI,KAAKE,SAAb,EAAwB;AACtBF,IAAAA,IAAI,GAAG,wCAAqBJ,IAArB,EAA2B;AAACC,MAAAA,KAAK,EAALA,KAAD;AAAQC,MAAAA,GAAG,EAAHA,GAAR;AAAaK,MAAAA,IAAI,EAAE7B;AAAnB,KAA3B,CAAP;AACD;;AAKD,MAAIyB,SAAS,KAAKC,IAAI,GAAG,CAAzB,EAA4B;AAC1B,SAAKR,CAAC,GAAGK,KAAT,EAAgBL,CAAC,GAAGM,GAApB,EAAyBN,CAAC,IAAIlB,GAA9B;AAAmC2B,MAAAA,IAAI,GAAGG,UAAU,CAACZ,CAAD,EAAII,IAAI,CAACJ,CAAD,CAAR,EAAaI,IAAI,CAACJ,CAAC,GAAG,CAAL,CAAjB,EAA0BS,IAA1B,CAAjB;AAAnC;AACD,GAFD,MAEO;AACL,SAAKT,CAAC,GAAGM,GAAG,GAAGxB,GAAf,EAAoBkB,CAAC,IAAIK,KAAzB,EAAgCL,CAAC,IAAIlB,GAArC;AAA0C2B,MAAAA,IAAI,GAAGG,UAAU,CAACZ,CAAD,EAAII,IAAI,CAACJ,CAAD,CAAR,EAAaI,IAAI,CAACJ,CAAC,GAAG,CAAL,CAAjB,EAA0BS,IAA1B,CAAjB;AAA1C;AACD;;AAED,MAAIA,IAAI,IAAII,MAAM,CAACJ,IAAD,EAAOA,IAAI,CAACnB,IAAZ,CAAlB,EAAqC;AACnCwB,IAAAA,UAAU,CAACL,IAAD,CAAV;AACAA,IAAAA,IAAI,GAAGA,IAAI,CAACnB,IAAZ;AACD;;AAED,SAAOmB,IAAP;AACD;;AAGD,SAASM,YAAT,CAAsBV,KAAtB,EAA6BC,GAA7B,EAAmC;AACjC,MAAI,CAACD,KAAL,EAAY,OAAOA,KAAP;AACZ,MAAI,CAACC,GAAL,EAAUA,GAAG,GAAGD,KAAN;AAEV,MAAIW,CAAC,GAAGX,KAAR;AACA,MAAIY,KAAJ;;AACA,KAAG;AACDA,IAAAA,KAAK,GAAG,KAAR;;AAEA,QAAI,CAACD,CAAC,CAACE,OAAH,KAAeL,MAAM,CAACG,CAAD,EAAIA,CAAC,CAAC1B,IAAN,CAAN,IAAqBkB,IAAI,CAACQ,CAAC,CAACzB,IAAH,EAASyB,CAAT,EAAYA,CAAC,CAAC1B,IAAd,CAAJ,KAA4B,CAAhE,CAAJ,EAAwE;AACtEwB,MAAAA,UAAU,CAACE,CAAD,CAAV;AACAA,MAAAA,CAAC,GAAGV,GAAG,GAAGU,CAAC,CAACzB,IAAZ;AACA,UAAIyB,CAAC,KAAKA,CAAC,CAAC1B,IAAZ,EAAkB;AAClB2B,MAAAA,KAAK,GAAG,IAAR;AACD,KALD,MAKO;AACLD,MAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD;AACF,GAXD,QAWS2B,KAAK,IAAID,CAAC,KAAKV,GAXxB;;AAaA,SAAOA,GAAP;AACD;;AAGD,SAASH,YAAT,CAAsBgB,GAAtB,EAA2B9B,SAA3B,EAAsCP,GAAtC,EAA2Ca,IAA3C,EAAiDC,IAAjD,EAAuDJ,OAAvD,EAAgE4B,IAAhE,EAAuE;AACrE,MAAI,CAACD,GAAL,EAAU;AAGV,MAAI,CAACC,IAAD,IAAS5B,OAAb,EAAsB6B,UAAU,CAACF,GAAD,EAAMxB,IAAN,EAAYC,IAAZ,EAAkBJ,OAAlB,CAAV;AAEtB,MAAI8B,IAAI,GAAGH,GAAX;AACA,MAAI5B,IAAJ;AACA,MAAID,IAAJ;;AAGA,SAAO6B,GAAG,CAAC5B,IAAJ,KAAa4B,GAAG,CAAC7B,IAAxB,EAA8B;AAC5BC,IAAAA,IAAI,GAAG4B,GAAG,CAAC5B,IAAX;AACAD,IAAAA,IAAI,GAAG6B,GAAG,CAAC7B,IAAX;;AAEA,QAAIE,OAAO,GAAG+B,WAAW,CAACJ,GAAD,EAAMxB,IAAN,EAAYC,IAAZ,EAAkBJ,OAAlB,CAAd,GAA2CgC,KAAK,CAACL,GAAD,CAA3D,EAAkE;AAEhE9B,MAAAA,SAAS,CAACoC,IAAV,CAAelC,IAAI,CAACS,CAAL,GAASlB,GAAxB;AACAO,MAAAA,SAAS,CAACoC,IAAV,CAAeN,GAAG,CAACnB,CAAJ,GAAQlB,GAAvB;AACAO,MAAAA,SAAS,CAACoC,IAAV,CAAenC,IAAI,CAACU,CAAL,GAASlB,GAAxB;AAEAgC,MAAAA,UAAU,CAACK,GAAD,CAAV;AAGAA,MAAAA,GAAG,GAAG7B,IAAI,CAACA,IAAX;AACAgC,MAAAA,IAAI,GAAGhC,IAAI,CAACA,IAAZ;AAEA;AACD;;AAED6B,IAAAA,GAAG,GAAG7B,IAAN;;AAGA,QAAI6B,GAAG,KAAKG,IAAZ,EAAkB;AAEhB,UAAI,CAACF,IAAL,EAAW;AACTjB,QAAAA,YAAY,CAACY,YAAY,CAACI,GAAD,CAAb,EAAoB9B,SAApB,EAA+BP,GAA/B,EAAoCa,IAApC,EAA0CC,IAA1C,EAAgDJ,OAAhD,EAAyD,CAAzD,CAAZ;AAGD,OAJD,MAIO,IAAI4B,IAAI,KAAK,CAAb,EAAgB;AACrBD,QAAAA,GAAG,GAAGO,sBAAsB,CAACX,YAAY,CAACI,GAAD,CAAb,EAAoB9B,SAApB,EAA+BP,GAA/B,CAA5B;AACAqB,QAAAA,YAAY,CAACgB,GAAD,EAAM9B,SAAN,EAAiBP,GAAjB,EAAsBa,IAAtB,EAA4BC,IAA5B,EAAkCJ,OAAlC,EAA2C,CAA3C,CAAZ;AAGD,OALM,MAKA,IAAI4B,IAAI,KAAK,CAAb,EAAgB;AACrBO,QAAAA,WAAW,CAACR,GAAD,EAAM9B,SAAN,EAAiBP,GAAjB,EAAsBa,IAAtB,EAA4BC,IAA5B,EAAkCJ,OAAlC,CAAX;AACD;;AAED;AACD;AACF;AACF;;AAGD,SAASgC,KAAT,CAAeL,GAAf,EAAoB;AAClB,MAAMS,CAAC,GAAGT,GAAG,CAAC5B,IAAd;AACA,MAAMsC,CAAC,GAAGV,GAAV;AACA,MAAMW,CAAC,GAAGX,GAAG,CAAC7B,IAAd;AAEA,MAAIkB,IAAI,CAACoB,CAAD,EAAIC,CAAJ,EAAOC,CAAP,CAAJ,IAAiB,CAArB,EAAwB,OAAO,KAAP;AAGxB,MAAId,CAAC,GAAGG,GAAG,CAAC7B,IAAJ,CAASA,IAAjB;;AAEA,SAAO0B,CAAC,KAAKG,GAAG,CAAC5B,IAAjB,EAAuB;AACrB,QAAIwC,eAAe,CAACH,CAAC,CAAC/B,CAAH,EAAM+B,CAAC,CAAC9B,CAAR,EAAW+B,CAAC,CAAChC,CAAb,EAAgBgC,CAAC,CAAC/B,CAAlB,EAAqBgC,CAAC,CAACjC,CAAvB,EAA0BiC,CAAC,CAAChC,CAA5B,EAA+BkB,CAAC,CAACnB,CAAjC,EAAoCmB,CAAC,CAAClB,CAAtC,CAAf,IAA2DU,IAAI,CAACQ,CAAC,CAACzB,IAAH,EAASyB,CAAT,EAAYA,CAAC,CAAC1B,IAAd,CAAJ,IAA2B,CAA1F,EACE,OAAO,KAAP;AACF0B,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD;;AAED,SAAO,IAAP;AACD;;AAED,SAASiC,WAAT,CAAqBJ,GAArB,EAA0BxB,IAA1B,EAAgCC,IAAhC,EAAsCJ,OAAtC,EAA+C;AAC7C,MAAMoC,CAAC,GAAGT,GAAG,CAAC5B,IAAd;AACA,MAAMsC,CAAC,GAAGV,GAAV;AACA,MAAMW,CAAC,GAAGX,GAAG,CAAC7B,IAAd;AAEA,MAAIkB,IAAI,CAACoB,CAAD,EAAIC,CAAJ,EAAOC,CAAP,CAAJ,IAAiB,CAArB,EAAwB,OAAO,KAAP;AAGxB,MAAME,KAAK,GAAGJ,CAAC,CAAC/B,CAAF,GAAMgC,CAAC,CAAChC,CAAR,GAAa+B,CAAC,CAAC/B,CAAF,GAAMiC,CAAC,CAACjC,CAAR,GAAY+B,CAAC,CAAC/B,CAAd,GAAkBiC,CAAC,CAACjC,CAAjC,GAAsCgC,CAAC,CAAChC,CAAF,GAAMiC,CAAC,CAACjC,CAAR,GAAYgC,CAAC,CAAChC,CAAd,GAAkBiC,CAAC,CAACjC,CAAxE;AACA,MAAMoC,KAAK,GAAGL,CAAC,CAAC9B,CAAF,GAAM+B,CAAC,CAAC/B,CAAR,GAAa8B,CAAC,CAAC9B,CAAF,GAAMgC,CAAC,CAAChC,CAAR,GAAY8B,CAAC,CAAC9B,CAAd,GAAkBgC,CAAC,CAAChC,CAAjC,GAAsC+B,CAAC,CAAC/B,CAAF,GAAMgC,CAAC,CAAChC,CAAR,GAAY+B,CAAC,CAAC/B,CAAd,GAAkBgC,CAAC,CAAChC,CAAxE;AACA,MAAMoC,KAAK,GAAGN,CAAC,CAAC/B,CAAF,GAAMgC,CAAC,CAAChC,CAAR,GAAa+B,CAAC,CAAC/B,CAAF,GAAMiC,CAAC,CAACjC,CAAR,GAAY+B,CAAC,CAAC/B,CAAd,GAAkBiC,CAAC,CAACjC,CAAjC,GAAsCgC,CAAC,CAAChC,CAAF,GAAMiC,CAAC,CAACjC,CAAR,GAAYgC,CAAC,CAAChC,CAAd,GAAkBiC,CAAC,CAACjC,CAAxE;AACA,MAAMsC,KAAK,GAAGP,CAAC,CAAC9B,CAAF,GAAM+B,CAAC,CAAC/B,CAAR,GAAa8B,CAAC,CAAC9B,CAAF,GAAMgC,CAAC,CAAChC,CAAR,GAAY8B,CAAC,CAAC9B,CAAd,GAAkBgC,CAAC,CAAChC,CAAjC,GAAsC+B,CAAC,CAAC/B,CAAF,GAAMgC,CAAC,CAAChC,CAAR,GAAY+B,CAAC,CAAC/B,CAAd,GAAkBgC,CAAC,CAAChC,CAAxE;AAGA,MAAMsC,IAAI,GAAGC,MAAM,CAACL,KAAD,EAAQC,KAAR,EAAetC,IAAf,EAAqBC,IAArB,EAA2BJ,OAA3B,CAAnB;AACA,MAAM8C,IAAI,GAAGD,MAAM,CAACH,KAAD,EAAQC,KAAR,EAAexC,IAAf,EAAqBC,IAArB,EAA2BJ,OAA3B,CAAnB;AAEA,MAAIwB,CAAC,GAAGG,GAAG,CAACoB,KAAZ;AACA,MAAIC,CAAC,GAAGrB,GAAG,CAACsB,KAAZ;;AAGA,SAAOzB,CAAC,IAAIA,CAAC,CAAC0B,CAAF,IAAON,IAAZ,IAAoBI,CAApB,IAAyBA,CAAC,CAACE,CAAF,IAAOJ,IAAvC,EAA6C;AAC3C,QACEtB,CAAC,KAAKG,GAAG,CAAC5B,IAAV,IACAyB,CAAC,KAAKG,GAAG,CAAC7B,IADV,IAEAyC,eAAe,CAACH,CAAC,CAAC/B,CAAH,EAAM+B,CAAC,CAAC9B,CAAR,EAAW+B,CAAC,CAAChC,CAAb,EAAgBgC,CAAC,CAAC/B,CAAlB,EAAqBgC,CAAC,CAACjC,CAAvB,EAA0BiC,CAAC,CAAChC,CAA5B,EAA+BkB,CAAC,CAACnB,CAAjC,EAAoCmB,CAAC,CAAClB,CAAtC,CAFf,IAGAU,IAAI,CAACQ,CAAC,CAACzB,IAAH,EAASyB,CAAT,EAAYA,CAAC,CAAC1B,IAAd,CAAJ,IAA2B,CAJ7B,EAME,OAAO,KAAP;AACF0B,IAAAA,CAAC,GAAGA,CAAC,CAACuB,KAAN;AAEA,QACEC,CAAC,KAAKrB,GAAG,CAAC5B,IAAV,IACAiD,CAAC,KAAKrB,GAAG,CAAC7B,IADV,IAEAyC,eAAe,CAACH,CAAC,CAAC/B,CAAH,EAAM+B,CAAC,CAAC9B,CAAR,EAAW+B,CAAC,CAAChC,CAAb,EAAgBgC,CAAC,CAAC/B,CAAlB,EAAqBgC,CAAC,CAACjC,CAAvB,EAA0BiC,CAAC,CAAChC,CAA5B,EAA+B0C,CAAC,CAAC3C,CAAjC,EAAoC2C,CAAC,CAAC1C,CAAtC,CAFf,IAGAU,IAAI,CAACgC,CAAC,CAACjD,IAAH,EAASiD,CAAT,EAAYA,CAAC,CAAClD,IAAd,CAAJ,IAA2B,CAJ7B,EAME,OAAO,KAAP;AACFkD,IAAAA,CAAC,GAAGA,CAAC,CAACC,KAAN;AACD;;AAGD,SAAOzB,CAAC,IAAIA,CAAC,CAAC0B,CAAF,IAAON,IAAnB,EAAyB;AACvB,QACEpB,CAAC,KAAKG,GAAG,CAAC5B,IAAV,IACAyB,CAAC,KAAKG,GAAG,CAAC7B,IADV,IAEAyC,eAAe,CAACH,CAAC,CAAC/B,CAAH,EAAM+B,CAAC,CAAC9B,CAAR,EAAW+B,CAAC,CAAChC,CAAb,EAAgBgC,CAAC,CAAC/B,CAAlB,EAAqBgC,CAAC,CAACjC,CAAvB,EAA0BiC,CAAC,CAAChC,CAA5B,EAA+BkB,CAAC,CAACnB,CAAjC,EAAoCmB,CAAC,CAAClB,CAAtC,CAFf,IAGAU,IAAI,CAACQ,CAAC,CAACzB,IAAH,EAASyB,CAAT,EAAYA,CAAC,CAAC1B,IAAd,CAAJ,IAA2B,CAJ7B,EAME,OAAO,KAAP;AACF0B,IAAAA,CAAC,GAAGA,CAAC,CAACuB,KAAN;AACD;;AAGD,SAAOC,CAAC,IAAIA,CAAC,CAACE,CAAF,IAAOJ,IAAnB,EAAyB;AACvB,QACEE,CAAC,KAAKrB,GAAG,CAAC5B,IAAV,IACAiD,CAAC,KAAKrB,GAAG,CAAC7B,IADV,IAEAyC,eAAe,CAACH,CAAC,CAAC/B,CAAH,EAAM+B,CAAC,CAAC9B,CAAR,EAAW+B,CAAC,CAAChC,CAAb,EAAgBgC,CAAC,CAAC/B,CAAlB,EAAqBgC,CAAC,CAACjC,CAAvB,EAA0BiC,CAAC,CAAChC,CAA5B,EAA+B0C,CAAC,CAAC3C,CAAjC,EAAoC2C,CAAC,CAAC1C,CAAtC,CAFf,IAGAU,IAAI,CAACgC,CAAC,CAACjD,IAAH,EAASiD,CAAT,EAAYA,CAAC,CAAClD,IAAd,CAAJ,IAA2B,CAJ7B,EAME,OAAO,KAAP;AACFkD,IAAAA,CAAC,GAAGA,CAAC,CAACC,KAAN;AACD;;AAED,SAAO,IAAP;AACD;;AAGD,SAASf,sBAAT,CAAgCrB,KAAhC,EAAuChB,SAAvC,EAAkDP,GAAlD,EAAuD;AACrD,MAAIkC,CAAC,GAAGX,KAAR;;AACA,KAAG;AACD,QAAMuB,CAAC,GAAGZ,CAAC,CAACzB,IAAZ;AACA,QAAMsC,CAAC,GAAGb,CAAC,CAAC1B,IAAF,CAAOA,IAAjB;;AAEA,QACE,CAACuB,MAAM,CAACe,CAAD,EAAIC,CAAJ,CAAP,IACAc,UAAU,CAACf,CAAD,EAAIZ,CAAJ,EAAOA,CAAC,CAAC1B,IAAT,EAAeuC,CAAf,CADV,IAEAe,aAAa,CAAChB,CAAD,EAAIC,CAAJ,CAFb,IAGAe,aAAa,CAACf,CAAD,EAAID,CAAJ,CAJf,EAKE;AACAvC,MAAAA,SAAS,CAACoC,IAAV,CAAeG,CAAC,CAAC5B,CAAF,GAAMlB,GAArB;AACAO,MAAAA,SAAS,CAACoC,IAAV,CAAeT,CAAC,CAAChB,CAAF,GAAMlB,GAArB;AACAO,MAAAA,SAAS,CAACoC,IAAV,CAAeI,CAAC,CAAC7B,CAAF,GAAMlB,GAArB;AAGAgC,MAAAA,UAAU,CAACE,CAAD,CAAV;AACAF,MAAAA,UAAU,CAACE,CAAC,CAAC1B,IAAH,CAAV;AAEA0B,MAAAA,CAAC,GAAGX,KAAK,GAAGwB,CAAZ;AACD;;AACDb,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GArBD,QAqBS0B,CAAC,KAAKX,KArBf;;AAuBA,SAAOU,YAAY,CAACC,CAAD,CAAnB;AACD;;AAGD,SAASW,WAAT,CAAqBtB,KAArB,EAA4BhB,SAA5B,EAAuCP,GAAvC,EAA4Ca,IAA5C,EAAkDC,IAAlD,EAAwDJ,OAAxD,EAAiE;AAE/D,MAAIoC,CAAC,GAAGvB,KAAR;;AACA,KAAG;AACD,QAAIwB,CAAC,GAAGD,CAAC,CAACtC,IAAF,CAAOA,IAAf;;AACA,WAAOuC,CAAC,KAAKD,CAAC,CAACrC,IAAf,EAAqB;AACnB,UAAIqC,CAAC,CAAC5B,CAAF,KAAQ6B,CAAC,CAAC7B,CAAV,IAAe6C,eAAe,CAACjB,CAAD,EAAIC,CAAJ,CAAlC,EAA0C;AAExC,YAAIC,CAAC,GAAGgB,YAAY,CAAClB,CAAD,EAAIC,CAAJ,CAApB;AAGAD,QAAAA,CAAC,GAAGb,YAAY,CAACa,CAAD,EAAIA,CAAC,CAACtC,IAAN,CAAhB;AACAwC,QAAAA,CAAC,GAAGf,YAAY,CAACe,CAAD,EAAIA,CAAC,CAACxC,IAAN,CAAhB;AAGAa,QAAAA,YAAY,CAACyB,CAAD,EAAIvC,SAAJ,EAAeP,GAAf,EAAoBa,IAApB,EAA0BC,IAA1B,EAAgCJ,OAAhC,CAAZ;AACAW,QAAAA,YAAY,CAAC2B,CAAD,EAAIzC,SAAJ,EAAeP,GAAf,EAAoBa,IAApB,EAA0BC,IAA1B,EAAgCJ,OAAhC,CAAZ;AACA;AACD;;AACDqC,MAAAA,CAAC,GAAGA,CAAC,CAACvC,IAAN;AACD;;AACDsC,IAAAA,CAAC,GAAGA,CAAC,CAACtC,IAAN;AACD,GAnBD,QAmBSsC,CAAC,KAAKvB,KAnBf;AAoBD;;AAGD,SAASN,cAAT,CAAwBK,IAAxB,EAA8BvB,WAA9B,EAA2CM,SAA3C,EAAsDL,GAAtD,EAA2DC,KAA3D,EAAkE;AAChE,MAAMgE,KAAK,GAAG,EAAd;AACA,MAAI/C,CAAJ;AACA,MAAIgD,GAAJ;AACA,MAAI3C,KAAJ;AACA,MAAIC,GAAJ;AACA,MAAI2C,IAAJ;;AAEA,OAAKjD,CAAC,GAAG,CAAJ,EAAOgD,GAAG,GAAGnE,WAAW,CAACI,MAA9B,EAAsCe,CAAC,GAAGgD,GAA1C,EAA+ChD,CAAC,EAAhD,EAAoD;AAClDK,IAAAA,KAAK,GAAGxB,WAAW,CAACmB,CAAD,CAAX,GAAiBlB,GAAzB;AACAwB,IAAAA,GAAG,GAAGN,CAAC,GAAGgD,GAAG,GAAG,CAAV,GAAcnE,WAAW,CAACmB,CAAC,GAAG,CAAL,CAAX,GAAqBlB,GAAnC,GAAyCsB,IAAI,CAACnB,MAApD;AACAgE,IAAAA,IAAI,GAAG7D,UAAU,CAACgB,IAAD,EAAOC,KAAP,EAAcC,GAAd,EAAmBxB,GAAnB,EAAwB,KAAxB,EAA+BC,KAAK,IAAIA,KAAK,CAACiB,CAAC,GAAG,CAAL,CAA7C,CAAjB;AACA,QAAIiD,IAAI,KAAKA,IAAI,CAAC3D,IAAlB,EAAwB2D,IAAI,CAAC/B,OAAL,GAAe,IAAf;AACxB6B,IAAAA,KAAK,CAACtB,IAAN,CAAWyB,WAAW,CAACD,IAAD,CAAtB;AACD;;AAEDF,EAAAA,KAAK,CAACI,IAAN,CAAWC,QAAX;;AAGA,OAAKpD,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAG+C,KAAK,CAAC9D,MAAtB,EAA8Be,CAAC,EAA/B,EAAmC;AACjCqD,IAAAA,aAAa,CAACN,KAAK,CAAC/C,CAAD,CAAN,EAAWb,SAAX,CAAb;AACAA,IAAAA,SAAS,GAAG4B,YAAY,CAAC5B,SAAD,EAAYA,SAAS,CAACG,IAAtB,CAAxB;AACD;;AAED,SAAOH,SAAP;AACD;;AAED,SAASiE,QAAT,CAAkBxB,CAAlB,EAAqBC,CAArB,EAAwB;AACtB,SAAOD,CAAC,CAAC/B,CAAF,GAAMgC,CAAC,CAAChC,CAAf;AACD;;AAGD,SAASwD,aAAT,CAAuBC,IAAvB,EAA6BnE,SAA7B,EAAwC;AACtCA,EAAAA,SAAS,GAAGoE,cAAc,CAACD,IAAD,EAAOnE,SAAP,CAA1B;;AACA,MAAIA,SAAJ,EAAe;AACb,QAAM0C,CAAC,GAAGiB,YAAY,CAAC3D,SAAD,EAAYmE,IAAZ,CAAtB;AAGAvC,IAAAA,YAAY,CAAC5B,SAAD,EAAYA,SAAS,CAACG,IAAtB,CAAZ;AACAyB,IAAAA,YAAY,CAACc,CAAD,EAAIA,CAAC,CAACvC,IAAN,CAAZ;AACD;AACF;;AAGD,SAASiE,cAAT,CAAwBD,IAAxB,EAA8BnE,SAA9B,EAAyC;AACvC,MAAI6B,CAAC,GAAG7B,SAAR;AACA,MAAMqE,EAAE,GAAGF,IAAI,CAACzD,CAAhB;AACA,MAAM4D,EAAE,GAAGH,IAAI,CAACxD,CAAhB;AACA,MAAI4D,EAAE,GAAG,CAACC,QAAV;AACA,MAAIC,CAAJ;;AAIA,KAAG;AACD,QAAIH,EAAE,IAAIzC,CAAC,CAAClB,CAAR,IAAa2D,EAAE,IAAIzC,CAAC,CAAC1B,IAAF,CAAOQ,CAA1B,IAA+BkB,CAAC,CAAC1B,IAAF,CAAOQ,CAAP,KAAakB,CAAC,CAAClB,CAAlD,EAAqD;AACnD,UAAMD,CAAC,GAAGmB,CAAC,CAACnB,CAAF,GAAO,CAAC4D,EAAE,GAAGzC,CAAC,CAAClB,CAAR,KAAckB,CAAC,CAAC1B,IAAF,CAAOO,CAAP,GAAWmB,CAAC,CAACnB,CAA3B,CAAD,IAAmCmB,CAAC,CAAC1B,IAAF,CAAOQ,CAAP,GAAWkB,CAAC,CAAClB,CAAhD,CAAhB;;AACA,UAAID,CAAC,IAAI2D,EAAL,IAAW3D,CAAC,GAAG6D,EAAnB,EAAuB;AACrBA,QAAAA,EAAE,GAAG7D,CAAL;;AACA,YAAIA,CAAC,KAAK2D,EAAV,EAAc;AACZ,cAAIC,EAAE,KAAKzC,CAAC,CAAClB,CAAb,EAAgB,OAAOkB,CAAP;AAChB,cAAIyC,EAAE,KAAKzC,CAAC,CAAC1B,IAAF,CAAOQ,CAAlB,EAAqB,OAAOkB,CAAC,CAAC1B,IAAT;AACtB;;AACDsE,QAAAA,CAAC,GAAG5C,CAAC,CAACnB,CAAF,GAAMmB,CAAC,CAAC1B,IAAF,CAAOO,CAAb,GAAiBmB,CAAjB,GAAqBA,CAAC,CAAC1B,IAA3B;AACD;AACF;;AACD0B,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GAbD,QAaS0B,CAAC,KAAK7B,SAbf;;AAeA,MAAI,CAACyE,CAAL,EAAQ,OAAO,IAAP;AAER,MAAIJ,EAAE,KAAKE,EAAX,EAAe,OAAOE,CAAP;AAMf,MAAMtC,IAAI,GAAGsC,CAAb;AACA,MAAMC,EAAE,GAAGD,CAAC,CAAC/D,CAAb;AACA,MAAMiE,EAAE,GAAGF,CAAC,CAAC9D,CAAb;AACA,MAAIiE,MAAM,GAAGJ,QAAb;AACA,MAAIK,GAAJ;AAEAhD,EAAAA,CAAC,GAAG4C,CAAJ;;AAEA,KAAG;AACD,QACEJ,EAAE,IAAIxC,CAAC,CAACnB,CAAR,IACAmB,CAAC,CAACnB,CAAF,IAAOgE,EADP,IAEAL,EAAE,KAAKxC,CAAC,CAACnB,CAFT,IAGAkC,eAAe,CAAC0B,EAAE,GAAGK,EAAL,GAAUN,EAAV,GAAeE,EAAhB,EAAoBD,EAApB,EAAwBI,EAAxB,EAA4BC,EAA5B,EAAgCL,EAAE,GAAGK,EAAL,GAAUJ,EAAV,GAAeF,EAA/C,EAAmDC,EAAnD,EAAuDzC,CAAC,CAACnB,CAAzD,EAA4DmB,CAAC,CAAClB,CAA9D,CAJjB,EAKE;AACAkE,MAAAA,GAAG,GAAG/D,IAAI,CAACgE,GAAL,CAASR,EAAE,GAAGzC,CAAC,CAAClB,CAAhB,KAAsB0D,EAAE,GAAGxC,CAAC,CAACnB,CAA7B,CAAN;;AAEA,UACE+C,aAAa,CAAC5B,CAAD,EAAIsC,IAAJ,CAAb,KACCU,GAAG,GAAGD,MAAN,IACEC,GAAG,KAAKD,MAAR,KAAmB/C,CAAC,CAACnB,CAAF,GAAM+D,CAAC,CAAC/D,CAAR,IAAcmB,CAAC,CAACnB,CAAF,KAAQ+D,CAAC,CAAC/D,CAAV,IAAeqE,oBAAoB,CAACN,CAAD,EAAI5C,CAAJ,CAApE,CAFH,CADF,EAIE;AACA4C,QAAAA,CAAC,GAAG5C,CAAJ;AACA+C,QAAAA,MAAM,GAAGC,GAAT;AACD;AACF;;AAEDhD,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GApBD,QAoBS0B,CAAC,KAAKM,IApBf;;AAsBA,SAAOsC,CAAP;AACD;;AAGD,SAASM,oBAAT,CAA8BN,CAA9B,EAAiC5C,CAAjC,EAAoC;AAClC,SAAOR,IAAI,CAACoD,CAAC,CAACrE,IAAH,EAASqE,CAAT,EAAY5C,CAAC,CAACzB,IAAd,CAAJ,GAA0B,CAA1B,IAA+BiB,IAAI,CAACQ,CAAC,CAAC1B,IAAH,EAASsE,CAAT,EAAYA,CAAC,CAACtE,IAAd,CAAJ,GAA0B,CAAhE;AACD;;AAGD,SAAS+B,UAAT,CAAoBhB,KAApB,EAA2BV,IAA3B,EAAiCC,IAAjC,EAAuCJ,OAAvC,EAAgD;AAC9C,MAAIwB,CAAC,GAAGX,KAAR;;AACA,KAAG;AACD,QAAIW,CAAC,CAAC0B,CAAF,KAAQ,IAAZ,EAAkB1B,CAAC,CAAC0B,CAAF,GAAML,MAAM,CAACrB,CAAC,CAACnB,CAAH,EAAMmB,CAAC,CAAClB,CAAR,EAAWH,IAAX,EAAiBC,IAAjB,EAAuBJ,OAAvB,CAAZ;AAClBwB,IAAAA,CAAC,CAACuB,KAAF,GAAUvB,CAAC,CAACzB,IAAZ;AACAyB,IAAAA,CAAC,CAACyB,KAAF,GAAUzB,CAAC,CAAC1B,IAAZ;AACA0B,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GALD,QAKS0B,CAAC,KAAKX,KALf;;AAOAW,EAAAA,CAAC,CAACuB,KAAF,CAAQE,KAAR,GAAgB,IAAhB;AACAzB,EAAAA,CAAC,CAACuB,KAAF,GAAU,IAAV;AAEA4B,EAAAA,UAAU,CAACnD,CAAD,CAAV;AACD;;AAID,SAASmD,UAAT,CAAoBlB,IAApB,EAA0B;AACxB,MAAImB,CAAJ;AACA,MAAIpE,CAAJ;AACA,MAAIqE,MAAM,GAAG,CAAb;AACA,MAAIC,SAAJ;AACA,MAAItD,CAAJ;AACA,MAAIuD,KAAJ;AACA,MAAIC,CAAJ;AACA,MAAIC,KAAJ;AACA,MAAIC,IAAJ;;AAEA,KAAG;AACD1D,IAAAA,CAAC,GAAGiC,IAAJ;AACAA,IAAAA,IAAI,GAAG,IAAP;AACAyB,IAAAA,IAAI,GAAG,IAAP;AACAJ,IAAAA,SAAS,GAAG,CAAZ;;AAEA,WAAOtD,CAAP,EAAU;AACRsD,MAAAA,SAAS;AACTE,MAAAA,CAAC,GAAGxD,CAAJ;AACAuD,MAAAA,KAAK,GAAG,CAAR;;AACA,WAAKvE,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGqE,MAAhB,EAAwBrE,CAAC,EAAzB,EAA6B;AAC3BuE,QAAAA,KAAK;AACLC,QAAAA,CAAC,GAAGA,CAAC,CAAC/B,KAAN;AACA,YAAI,CAAC+B,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,IAAqBxD,CAAC,CAAC0B,CAAF,IAAO8B,CAAC,CAAC9B,CAA9C,CAAJ,EAAsD;AACpD0B,UAAAA,CAAC,GAAGpD,CAAJ;AACAA,UAAAA,CAAC,GAAGA,CAAC,CAACyB,KAAN;AACA8B,UAAAA,KAAK;AACN,SAJD,MAIO;AACLH,UAAAA,CAAC,GAAGI,CAAJ;AACAA,UAAAA,CAAC,GAAGA,CAAC,CAAC/B,KAAN;AACAgC,UAAAA,KAAK;AACN;;AAED,YAAIC,IAAJ,EAAUA,IAAI,CAACjC,KAAL,GAAa2B,CAAb,CAAV,KACKnB,IAAI,GAAGmB,CAAP;AAELA,QAAAA,CAAC,CAAC7B,KAAF,GAAUmC,IAAV;AACAA,QAAAA,IAAI,GAAGN,CAAP;AACD;;AAEDpD,MAAAA,CAAC,GAAGwD,CAAJ;AACD;;AAEDE,IAAAA,IAAI,CAACjC,KAAL,GAAa,IAAb;AACA4B,IAAAA,MAAM,IAAI,CAAV;AACD,GAxCD,QAwCSC,SAAS,GAAG,CAxCrB;;AA0CA,SAAOrB,IAAP;AACD;;AAGD,SAASZ,MAAT,CAAgBxC,CAAhB,EAAmBC,CAAnB,EAAsBH,IAAtB,EAA4BC,IAA5B,EAAkCJ,OAAlC,EAA2C;AAEzCK,EAAAA,CAAC,GAAG,SAASA,CAAC,GAAGF,IAAb,IAAqBH,OAAzB;AACAM,EAAAA,CAAC,GAAG,SAASA,CAAC,GAAGF,IAAb,IAAqBJ,OAAzB;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,SAASoD,WAAT,CAAqB7C,KAArB,EAA4B;AAC1B,MAAIW,CAAC,GAAGX,KAAR;AACA,MAAIsE,QAAQ,GAAGtE,KAAf;;AACA,KAAG;AACD,QAAIW,CAAC,CAACnB,CAAF,GAAM8E,QAAQ,CAAC9E,CAAf,IAAqBmB,CAAC,CAACnB,CAAF,KAAQ8E,QAAQ,CAAC9E,CAAjB,IAAsBmB,CAAC,CAAClB,CAAF,GAAM6E,QAAQ,CAAC7E,CAA9D,EAAkE6E,QAAQ,GAAG3D,CAAX;AAClEA,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GAHD,QAGS0B,CAAC,KAAKX,KAHf;;AAKA,SAAOsE,QAAP;AACD;;AAGD,SAAS5C,eAAT,CAAyB6C,EAAzB,EAA6BC,EAA7B,EAAiCC,EAAjC,EAAqCC,EAArC,EAAyCC,EAAzC,EAA6CC,EAA7C,EAAiDC,EAAjD,EAAqDC,EAArD,EAAyD;AACvD,SACE,CAACH,EAAE,GAAGE,EAAN,KAAaL,EAAE,GAAGM,EAAlB,IAAwB,CAACP,EAAE,GAAGM,EAAN,KAAaD,EAAE,GAAGE,EAAlB,CAAxB,IAAiD,CAAjD,IACA,CAACP,EAAE,GAAGM,EAAN,KAAaH,EAAE,GAAGI,EAAlB,IAAwB,CAACL,EAAE,GAAGI,EAAN,KAAaL,EAAE,GAAGM,EAAlB,CAAxB,IAAiD,CADjD,IAEA,CAACL,EAAE,GAAGI,EAAN,KAAaD,EAAE,GAAGE,EAAlB,IAAwB,CAACH,EAAE,GAAGE,EAAN,KAAaH,EAAE,GAAGI,EAAlB,CAAxB,IAAiD,CAHnD;AAKD;;AAGD,SAAStC,eAAT,CAAyBjB,CAAzB,EAA4BC,CAA5B,EAA+B;AAC7B,SACED,CAAC,CAACtC,IAAF,CAAOU,CAAP,KAAa6B,CAAC,CAAC7B,CAAf,IACA4B,CAAC,CAACrC,IAAF,CAAOS,CAAP,KAAa6B,CAAC,CAAC7B,CADf,IAEA,CAACoF,iBAAiB,CAACxD,CAAD,EAAIC,CAAJ,CAFlB,KAGEe,aAAa,CAAChB,CAAD,EAAIC,CAAJ,CAAb,IACAe,aAAa,CAACf,CAAD,EAAID,CAAJ,CADb,IAEAyD,YAAY,CAACzD,CAAD,EAAIC,CAAJ,CAFZ,KAGCrB,IAAI,CAACoB,CAAC,CAACrC,IAAH,EAASqC,CAAT,EAAYC,CAAC,CAACtC,IAAd,CAAJ,IAA2BiB,IAAI,CAACoB,CAAD,EAAIC,CAAC,CAACtC,IAAN,EAAYsC,CAAZ,CAHhC,CAAD,IAIEhB,MAAM,CAACe,CAAD,EAAIC,CAAJ,CAAN,IAAgBrB,IAAI,CAACoB,CAAC,CAACrC,IAAH,EAASqC,CAAT,EAAYA,CAAC,CAACtC,IAAd,CAAJ,GAA0B,CAA1C,IAA+CkB,IAAI,CAACqB,CAAC,CAACtC,IAAH,EAASsC,CAAT,EAAYA,CAAC,CAACvC,IAAd,CAAJ,GAA0B,CAP5E,CADF;AAUD;;AAGD,SAASkB,IAAT,CAAcQ,CAAd,EAAiBwD,CAAjB,EAAoBc,CAApB,EAAuB;AACrB,SAAO,CAACd,CAAC,CAAC1E,CAAF,GAAMkB,CAAC,CAAClB,CAAT,KAAewF,CAAC,CAACzF,CAAF,GAAM2E,CAAC,CAAC3E,CAAvB,IAA4B,CAAC2E,CAAC,CAAC3E,CAAF,GAAMmB,CAAC,CAACnB,CAAT,KAAeyF,CAAC,CAACxF,CAAF,GAAM0E,CAAC,CAAC1E,CAAvB,CAAnC;AACD;;AAGD,SAASe,MAAT,CAAgB0E,EAAhB,EAAoBC,EAApB,EAAwB;AACtB,SAAOD,EAAE,CAAC1F,CAAH,KAAS2F,EAAE,CAAC3F,CAAZ,IAAiB0F,EAAE,CAACzF,CAAH,KAAS0F,EAAE,CAAC1F,CAApC;AACD;;AAGD,SAAS6C,UAAT,CAAoB4C,EAApB,EAAwBE,EAAxB,EAA4BD,EAA5B,EAAgCE,EAAhC,EAAoC;AAClC,MAAMC,EAAE,GAAGC,IAAI,CAACpF,IAAI,CAAC+E,EAAD,EAAKE,EAAL,EAASD,EAAT,CAAL,CAAf;AACA,MAAMK,EAAE,GAAGD,IAAI,CAACpF,IAAI,CAAC+E,EAAD,EAAKE,EAAL,EAASC,EAAT,CAAL,CAAf;AACA,MAAMI,EAAE,GAAGF,IAAI,CAACpF,IAAI,CAACgF,EAAD,EAAKE,EAAL,EAASH,EAAT,CAAL,CAAf;AACA,MAAMQ,EAAE,GAAGH,IAAI,CAACpF,IAAI,CAACgF,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,CAAmBhF,CAAnB,EAAsBwD,CAAtB,EAAyBc,CAAzB,EAA4B;AAC1B,SACEd,CAAC,CAAC3E,CAAF,IAAOI,IAAI,CAACC,GAAL,CAASc,CAAC,CAACnB,CAAX,EAAcyF,CAAC,CAACzF,CAAhB,CAAP,IACA2E,CAAC,CAAC3E,CAAF,IAAOI,IAAI,CAACgG,GAAL,CAASjF,CAAC,CAACnB,CAAX,EAAcyF,CAAC,CAACzF,CAAhB,CADP,IAEA2E,CAAC,CAAC1E,CAAF,IAAOG,IAAI,CAACC,GAAL,CAASc,CAAC,CAAClB,CAAX,EAAcwF,CAAC,CAACxF,CAAhB,CAFP,IAGA0E,CAAC,CAAC1E,CAAF,IAAOG,IAAI,CAACgG,GAAL,CAASjF,CAAC,CAAClB,CAAX,EAAcwF,CAAC,CAACxF,CAAhB,CAJT;AAMD;;AAED,SAAS8F,IAAT,CAAcM,GAAd,EAAmB;AACjB,SAAOA,GAAG,GAAG,CAAN,GAAU,CAAV,GAAcA,GAAG,GAAG,CAAN,GAAU,CAAC,CAAX,GAAe,CAApC;AACD;;AAGD,SAASd,iBAAT,CAA2BxD,CAA3B,EAA8BC,CAA9B,EAAiC;AAC/B,MAAIb,CAAC,GAAGY,CAAR;;AACA,KAAG;AACD,QACEZ,CAAC,CAAChB,CAAF,KAAQ4B,CAAC,CAAC5B,CAAV,IACAgB,CAAC,CAAC1B,IAAF,CAAOU,CAAP,KAAa4B,CAAC,CAAC5B,CADf,IAEAgB,CAAC,CAAChB,CAAF,KAAQ6B,CAAC,CAAC7B,CAFV,IAGAgB,CAAC,CAAC1B,IAAF,CAAOU,CAAP,KAAa6B,CAAC,CAAC7B,CAHf,IAIA2C,UAAU,CAAC3B,CAAD,EAAIA,CAAC,CAAC1B,IAAN,EAAYsC,CAAZ,EAAeC,CAAf,CALZ,EAOE,OAAO,IAAP;AACFb,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GAVD,QAUS0B,CAAC,KAAKY,CAVf;;AAYA,SAAO,KAAP;AACD;;AAGD,SAASgB,aAAT,CAAuBhB,CAAvB,EAA0BC,CAA1B,EAA6B;AAC3B,SAAOrB,IAAI,CAACoB,CAAC,CAACrC,IAAH,EAASqC,CAAT,EAAYA,CAAC,CAACtC,IAAd,CAAJ,GAA0B,CAA1B,GACHkB,IAAI,CAACoB,CAAD,EAAIC,CAAJ,EAAOD,CAAC,CAACtC,IAAT,CAAJ,IAAsB,CAAtB,IAA2BkB,IAAI,CAACoB,CAAD,EAAIA,CAAC,CAACrC,IAAN,EAAYsC,CAAZ,CAAJ,IAAsB,CAD9C,GAEHrB,IAAI,CAACoB,CAAD,EAAIC,CAAJ,EAAOD,CAAC,CAACrC,IAAT,CAAJ,GAAqB,CAArB,IAA0BiB,IAAI,CAACoB,CAAD,EAAIA,CAAC,CAACtC,IAAN,EAAYuC,CAAZ,CAAJ,GAAqB,CAFnD;AAGD;;AAGD,SAASwD,YAAT,CAAsBzD,CAAtB,EAAyBC,CAAzB,EAA4B;AAC1B,MAAIb,CAAC,GAAGY,CAAR;AACA,MAAIuE,MAAM,GAAG,KAAb;AACA,MAAMjB,EAAE,GAAG,CAACtD,CAAC,CAAC/B,CAAF,GAAMgC,CAAC,CAAChC,CAAT,IAAc,CAAzB;AACA,MAAMsF,EAAE,GAAG,CAACvD,CAAC,CAAC9B,CAAF,GAAM+B,CAAC,CAAC/B,CAAT,IAAc,CAAzB;;AACA,KAAG;AACD,QACEkB,CAAC,CAAClB,CAAF,GAAMqF,EAAN,KAAanE,CAAC,CAAC1B,IAAF,CAAOQ,CAAP,GAAWqF,EAAxB,IACAnE,CAAC,CAAC1B,IAAF,CAAOQ,CAAP,KAAakB,CAAC,CAAClB,CADf,IAEAoF,EAAE,GAAI,CAAClE,CAAC,CAAC1B,IAAF,CAAOO,CAAP,GAAWmB,CAAC,CAACnB,CAAd,KAAoBsF,EAAE,GAAGnE,CAAC,CAAClB,CAA3B,CAAD,IAAmCkB,CAAC,CAAC1B,IAAF,CAAOQ,CAAP,GAAWkB,CAAC,CAAClB,CAAhD,IAAqDkB,CAAC,CAACnB,CAH9D,EAKEsG,MAAM,GAAG,CAACA,MAAV;AACFnF,IAAAA,CAAC,GAAGA,CAAC,CAAC1B,IAAN;AACD,GARD,QAQS0B,CAAC,KAAKY,CARf;;AAUA,SAAOuE,MAAP;AACD;;AAID,SAASrD,YAAT,CAAsBlB,CAAtB,EAAyBC,CAAzB,EAA4B;AAC1B,MAAMuE,EAAE,GAAG,IAAIC,IAAJ,CAASzE,CAAC,CAAC5B,CAAX,EAAc4B,CAAC,CAAC/B,CAAhB,EAAmB+B,CAAC,CAAC9B,CAArB,CAAX;AACA,MAAMwG,EAAE,GAAG,IAAID,IAAJ,CAASxE,CAAC,CAAC7B,CAAX,EAAc6B,CAAC,CAAChC,CAAhB,EAAmBgC,CAAC,CAAC/B,CAArB,CAAX;AACA,MAAMyG,EAAE,GAAG3E,CAAC,CAACtC,IAAb;AACA,MAAMkH,EAAE,GAAG3E,CAAC,CAACtC,IAAb;AAEAqC,EAAAA,CAAC,CAACtC,IAAF,GAASuC,CAAT;AACAA,EAAAA,CAAC,CAACtC,IAAF,GAASqC,CAAT;AAEAwE,EAAAA,EAAE,CAAC9G,IAAH,GAAUiH,EAAV;AACAA,EAAAA,EAAE,CAAChH,IAAH,GAAU6G,EAAV;AAEAE,EAAAA,EAAE,CAAChH,IAAH,GAAU8G,EAAV;AACAA,EAAAA,EAAE,CAAC7G,IAAH,GAAU+G,EAAV;AAEAE,EAAAA,EAAE,CAAClH,IAAH,GAAUgH,EAAV;AACAA,EAAAA,EAAE,CAAC/G,IAAH,GAAUiH,EAAV;AAEA,SAAOF,EAAP;AACD;;AAGD,SAAS1F,UAAT,CAAoBZ,CAApB,EAAuBH,CAAvB,EAA0BC,CAA1B,EAA6BW,IAA7B,EAAmC;AACjC,MAAMO,CAAC,GAAG,IAAIqF,IAAJ,CAASrG,CAAT,EAAYH,CAAZ,EAAeC,CAAf,CAAV;;AAEA,MAAI,CAACW,IAAL,EAAW;AACTO,IAAAA,CAAC,CAACzB,IAAF,GAASyB,CAAT;AACAA,IAAAA,CAAC,CAAC1B,IAAF,GAAS0B,CAAT;AACD,GAHD,MAGO;AACLA,IAAAA,CAAC,CAAC1B,IAAF,GAASmB,IAAI,CAACnB,IAAd;AACA0B,IAAAA,CAAC,CAACzB,IAAF,GAASkB,IAAT;AACAA,IAAAA,IAAI,CAACnB,IAAL,CAAUC,IAAV,GAAiByB,CAAjB;AACAP,IAAAA,IAAI,CAACnB,IAAL,GAAY0B,CAAZ;AACD;;AACD,SAAOA,CAAP;AACD;;AAED,SAASF,UAAT,CAAoBE,CAApB,EAAuB;AACrBA,EAAAA,CAAC,CAAC1B,IAAF,CAAOC,IAAP,GAAcyB,CAAC,CAACzB,IAAhB;AACAyB,EAAAA,CAAC,CAACzB,IAAF,CAAOD,IAAP,GAAc0B,CAAC,CAAC1B,IAAhB;AAEA,MAAI0B,CAAC,CAACuB,KAAN,EAAavB,CAAC,CAACuB,KAAF,CAAQE,KAAR,GAAgBzB,CAAC,CAACyB,KAAlB;AACb,MAAIzB,CAAC,CAACyB,KAAN,EAAazB,CAAC,CAACyB,KAAF,CAAQF,KAAR,GAAgBvB,CAAC,CAACuB,KAAlB;AACd;;AAED,SAAS8D,IAAT,CAAcrG,CAAd,EAAiBH,CAAjB,EAAoBC,CAApB,EAAuB;AAErB,OAAKE,CAAL,GAASA,CAAT;AAGA,OAAKH,CAAL,GAASA,CAAT;AACA,OAAKC,CAAL,GAASA,CAAT;AAGA,OAAKP,IAAL,GAAY,IAAZ;AACA,OAAKD,IAAL,GAAY,IAAZ;AAGA,OAAKoD,CAAL,GAAS,IAAT;AAGA,OAAKH,KAAL,GAAa,IAAb;AACA,OAAKE,KAAL,GAAa,IAAb;AAGA,OAAKvB,OAAL,GAAe,KAAf;AACD","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/* eslint-disable */\n\nimport {getPolygonSignedArea} 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: number[],\n  holeIndices?: number[],\n  dim: number = 2,\n  areas?: number[]\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]);\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);\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 ? 1 / invSize : 0;\n  }\n\n  earcutLinked(outerNode, triangles, dim, minX, minY, invSize);\n\n  return triangles;\n}\n\n// create a circular doubly linked list from polygon points in the specified winding order\nfunction linkedList(data, start, end, dim, clockwise, area) {\n  let i;\n  let last;\n  if (area === undefined) {\n    area = getPolygonSignedArea(data, {start, end, size: dim});\n  }\n\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], data[i + 1], last);\n  } else {\n    for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], 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);\n      triangles.push(ear.i / dim);\n      triangles.push(next.i / dim);\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  let p = ear.next.next;\n\n  while (p !== ear.prev) {\n    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)\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  // triangle bbox; min & max are calculated like this for speed\n  const minTX = a.x < b.x ? (a.x < c.x ? a.x : c.x) : b.x < c.x ? b.x : c.x;\n  const minTY = a.y < b.y ? (a.y < c.y ? a.y : c.y) : b.y < c.y ? b.y : c.y;\n  const maxTX = a.x > b.x ? (a.x > c.x ? a.x : c.x) : b.x > c.x ? b.x : c.x;\n  const maxTY = a.y > b.y ? (a.y > c.y ? a.y : c.y) : b.y > c.y ? b.y : c.y;\n\n  // z-order range for the current triangle bbox;\n  const minZ = zOrder(minTX, minTY, minX, minY, invSize);\n  const maxZ = zOrder(maxTX, maxTY, 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 !== ear.prev &&\n      p !== ear.next &&\n      pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, 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 !== ear.prev &&\n      n !== ear.next &&\n      pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, 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 !== ear.prev &&\n      p !== ear.next &&\n      pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, 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 !== ear.prev &&\n      n !== ear.next &&\n      pointInTriangle(a.x, a.y, b.x, b.y, c.x, c.y, 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);\n      triangles.push(p.i / dim);\n      triangles.push(b.i / dim);\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);\n        earcutLinked(c, triangles, dim, minX, minY, invSize);\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(data, holeIndices, outerNode, dim, areas) {\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]);\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    eliminateHole(queue[i], outerNode);\n    outerNode = filterPoints(outerNode, outerNode.next);\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  outerNode = findHoleBridge(hole, outerNode);\n  if (outerNode) {\n    const b = splitPolygon(outerNode, hole);\n\n    // filter collinear points around the cuts\n    filterPoints(outerNode, outerNode.next);\n    filterPoints(b, b.next);\n  }\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        if (x === hx) {\n          if (hy === p.y) return p;\n          if (hy === p.next.y) return p.next;\n        }\n        m = p.x < p.next.x ? p : p.next;\n      }\n    }\n    p = p.next;\n  } while (p !== outerNode);\n\n  if (!m) return null;\n\n  if (hx === qx) return m; // hole touches outer segment; pick leftmost endpoint\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 === null) 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 = 32767 * (x - minX) * invSize;\n  y = 32767 * (y - minY) * invSize;\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) >= 0 &&\n    (ax - px) * (by - py) - (bx - px) * (ay - py) >= 0 &&\n    (bx - px) * (cy - py) - (cx - px) * (by - py) >= 0\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 Node(a.i, a.x, a.y);\n  const b2 = new Node(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 Node(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\nfunction Node(i, x, y) {\n  // vertex index in coordinates array\n  this.i = i;\n\n  // vertex coordinates\n  this.x = x;\n  this.y = y;\n\n  // previous and next vertex nodes in a polygon ring\n  this.prev = null;\n  this.next = null;\n\n  // z-order curve value\n  this.z = null;\n\n  // previous and next nodes in z-order\n  this.prevZ = null;\n  this.nextZ = null;\n\n  // indicates whether this is a steiner point\n  this.steiner = false;\n}\n"],"file":"earcut.js"}