@tscircuit/cli 0.1.1673 → 0.1.1675

package/dist/lib/index.js

@@ -39819,7 +39819,7 @@ var require_fast_uri = __commonJS((exports2, module2) => {
       if (!options.unicodeSupport && (!schemeHandler || !schemeHandler.unicodeSupport)) {
         if (parsed.host && (options.domainHost || schemeHandler && schemeHandler.domainHost) && isIP === false && nonSimpleDomain(parsed.host)) {
           try {
-            parsed.host = URL.domainToASCII(parsed.host.toLowerCase());
+            parsed.host = new URL("http://" + parsed.host).hostname;
           } catch (e) {
             parsed.error = parsed.error || "Host's domain name can not be converted to ASCII: " + e;
           }
@@ -59949,6 +59949,7 @@ var require_ignore = __commonJS((exports2, module2) => {
   var REGEX_REGEXP_RANGE = /([0-z])-([0-z])/g;
   var RETURN_FALSE = () => false;
   var sanitizeRange = (range) => range.replace(REGEX_REGEXP_RANGE, (match, from, to) => from.charCodeAt(0) <= to.charCodeAt(0) ? match : EMPTY);
+  var negateRange = (range) => range.startsWith("!") || range.startsWith("\\^") ? `^${range.slice(range[0] === "!" ? 1 : 2)}` : range;
   var cleanRangeBackSlash = (slashes) => {
     const { length } = slashes;
     return slashes.slice(0, length - length % 2);
@@ -59986,7 +59987,7 @@ var require_ignore = __commonJS((exports2, module2) => {
       () => "\\/"
     ],
     [
-      /^\^*\\\*\\\*\\\//,
+      /^\^*(?:\\\*\\\*\\\/)+/,
       () => "^(?:.*\\/)?"
     ],
     [
@@ -60016,7 +60017,7 @@ var require_ignore = __commonJS((exports2, module2) => {
     ],
     [
       /(\\)?\[([^\]/]*?)(\\*)($|\])/g,
-      (match, leadEscape, range, endEscape, close) => leadEscape === ESCAPE ? `\\[${range}${cleanRangeBackSlash(endEscape)}${close}` : close === "]" ? endEscape.length % 2 === 0 ? `[${sanitizeRange(range)}${endEscape}]` : "[]" : "[]"
+      (match, leadEscape, range, endEscape, close) => leadEscape === ESCAPE ? `\\[${range}${cleanRangeBackSlash(endEscape)}${close}` : close === "]" ? endEscape.length % 2 === 0 ? `[${negateRange(sanitizeRange(range))}${endEscape}]` : "[]" : "[]"
     ],
     [
       /(?:[^*])$/,
@@ -65811,7 +65812,7 @@ var getNodeHandler = (winterSpec, { port, middleware = [] }) => {
   }));
 };
 // package.json
-var version = "0.1.1672";
+var version = "0.1.1673";
 var package_default = {
   name: "@tscircuit/cli",
   version,
@@ -65827,7 +65828,7 @@ var package_default = {
     "@tscircuit/circuit-json-placement-analysis": "^0.0.6",
     "@tscircuit/circuit-json-routing-analysis": "^0.0.6",
     "@tscircuit/circuit-json-schematic-placement-analysis": "github:tscircuit/circuit-json-schematic-placement-analysis#b6d5fe675adc26a2fc988aa081e6fb51e6bf696a",
-    "@tscircuit/eval": "^0.0.1004",
+    "@tscircuit/eval": "^0.0.1008",
     "@tscircuit/fake-snippets": "^0.0.182",
     "@tscircuit/file-server": "^0.0.32",
     "@tscircuit/footprinter": "^0.0.374",
@@ -65893,7 +65894,7 @@ var package_default = {
     semver: "^7.6.3",
     stepts: "^0.0.3",
     tempy: "^3.1.0",
-    tscircuit: "0.0.2046-libonly",
+    tscircuit: "0.0.2084-libonly",
     tsx: "^4.7.1",
     "typed-ky": "^0.0.4",
     zod: "^3.23.8"
@@ -68526,14 +68527,18 @@ import { cju as cju2 } from "@tscircuit/circuit-json-util";
 import { compose as compose6, translate as translate6, scale as scale4 } from "transformation-matrix";
 
 // node_modules/earcut/src/earcut.js
+var steiners = new Set;
+var filteredOut = false;
 function earcut(data, holeIndices, dim = 2) {
   const hasHoles = holeIndices && holeIndices.length;
   const outerLen = hasHoles ? holeIndices[0] * dim : data.length;
+  if (steiners.size)
+    steiners.clear();
   let outerNode = linkedList(data, 0, outerLen, dim, true);
   const triangles = [];
   if (!outerNode || outerNode.next === outerNode.prev)
     return triangles;
-  let minX, minY, invSize;
+  let minX = 0, minY = 0, invSize = 0;
   if (hasHoles)
     outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
   if (data.length > 80 * dim) {
@@ -68556,11 +68561,11 @@ function earcut(data, holeIndices, dim = 2) {
     invSize = Math.max(maxX - minX, maxY - minY);
     invSize = invSize !== 0 ? 32767 / invSize : 0;
   }
-  earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
+  earcutLinked(outerNode, triangles, minX, minY, invSize);
   return triangles;
 }
 function linkedList(data, start, end, dim, clockwise) {
-  let last;
+  let last = null;
   if (clockwise === signedArea(data, start, end, dim) > 0) {
     for (let i = start;i < end; i += dim)
       last = insertNode(i / dim | 0, data[i], data[i + 1], last);
@@ -68574,93 +68579,79 @@ function linkedList(data, start, end, dim, clockwise) {
   }
   return last;
 }
-function filterPoints(start, end) {
-  if (!start)
-    return start;
-  if (!end)
-    end = start;
+function filterPoints(start, end = start) {
+  const full = end === start;
   let p = start, again;
   do {
     again = false;
-    if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
+    if (p !== p.next && (steiners.size === 0 || !steiners.has(p)) && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
+      if (full || p === end)
+        end = p.prev;
+      filteredOut = true;
       removeNode(p);
-      p = end = p.prev;
-      if (p === p.next)
-        break;
+      p = p.prev;
       again = true;
-    } else {
+    } else if (full || p !== end) {
       p = p.next;
+      again = !full;
     }
   } while (again || p !== end);
   return end;
 }
-function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
-  if (!ear)
-    return;
-  if (!pass && invSize)
+function earcutLinked(ear, triangles, minX, minY, invSize) {
+  if (invSize)
     indexCurve(ear, minX, minY, invSize);
-  let stop = ear;
+  let stop = ear, cured = false;
   while (ear.prev !== ear.next) {
     const prev = ear.prev;
     const next = ear.next;
-    if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
+    if (area(prev, ear, next) < 0 && (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear))) {
       triangles.push(prev.i, ear.i, next.i);
       removeNode(ear);
-      ear = next.next;
-      stop = next.next;
+      ear = next;
+      stop = 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);
-        earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
-      } else if (pass === 2) {
-        splitEarcut(ear, triangles, dim, minX, minY, invSize);
+      filteredOut = false;
+      ear = filterPoints(ear);
+      if (filteredOut) {
+        stop = ear;
+        continue;
       }
+      if (!cured) {
+        ear = cureLocalIntersections(ear, triangles);
+        stop = ear;
+        cured = true;
+        continue;
+      }
+      splitEarcut(ear, triangles, minX, minY, invSize);
       break;
     }
   }
 }
 function isEar(ear) {
-  const a = ear.prev, b = ear, c = ear.next;
-  if (area(a, b, c) >= 0)
-    return false;
-  const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-  const x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy), x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy);
+  const a = ear.prev, b = ear, c = ear.next, ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y, x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy), x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy);
   let p = c.next;
   while (p !== a) {
-    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0)
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && !(ax === p.x && ay === p.y) && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0)
       return false;
     p = p.next;
   }
   return true;
 }
 function isEarHashed(ear, minX, minY, invSize) {
-  const a = ear.prev, b = ear, c = ear.next;
-  if (area(a, b, c) >= 0)
-    return false;
-  const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-  const x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy), x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy);
-  const minZ = zOrder(x0, y0, minX, minY, invSize), maxZ = zOrder(x1, y1, minX, minY, invSize);
-  let { prevZ: p, nextZ: n } = ear;
-  while (p && p.z >= minZ && n && n.z <= maxZ) {
-    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c && pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0)
-      return false;
-    p = p.prevZ;
-    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c && pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0)
-      return false;
-    n = n.nextZ;
-  }
+  const a = ear.prev, b = ear, c = ear.next, ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y, x0 = Math.min(ax, bx, cx), y0 = Math.min(ay, by, cy), x1 = Math.max(ax, bx, cx), y1 = Math.max(ay, by, cy), minZ = zOrder(x0, y0, minX, minY, invSize), maxZ = zOrder(x1, y1, minX, minY, invSize);
+  let p = ear.prevZ;
   while (p && p.z >= minZ) {
-    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c && pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0)
+    if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== c && !(ax === p.x && ay === p.y) && pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0)
       return false;
     p = p.prevZ;
   }
+  let n = ear.nextZ;
   while (n && n.z <= maxZ) {
-    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c && pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0)
+    if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== c && !(ax === n.x && ay === n.y) && pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0)
       return false;
     n = n.nextZ;
   }
@@ -68668,19 +68659,21 @@ function isEarHashed(ear, minX, minY, invSize) {
 }
 function cureLocalIntersections(start, triangles) {
   let p = start;
+  let cured = false;
   do {
     const a = p.prev, b = p.next.next;
-    if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
+    if (intersects(a, p, p.next, b, false) && locallyInside(a, b) && locallyInside(b, a)) {
       triangles.push(a.i, p.i, b.i);
       removeNode(p);
       removeNode(p.next);
       p = start = b;
+      cured = true;
     }
     p = p.next;
   } while (p !== start);
-  return filterPoints(p);
+  return cured ? filterPoints(p) : p;
 }
-function splitEarcut(start, triangles, dim, minX, minY, invSize) {
+function splitEarcut(start, triangles, minX, minY, invSize) {
   let a = start;
   do {
     let b = a.next.next;
@@ -68689,8 +68682,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, 0);
-        earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
+        earcutLinked(a, triangles, minX, minY, invSize);
+        earcutLinked(c, triangles, minX, minY, invSize);
         return;
       }
       b = b.next;
@@ -68698,6 +68691,7 @@ function splitEarcut(start, triangles, dim, minX, minY, invSize) {
     a = a.next;
   } while (a !== start);
 }
+var indexActive = false;
 function eliminateHoles(data, holeIndices, outerNode, dim) {
   const queue = [];
   for (let i = 0, len = holeIndices.length;i < len; i++) {
@@ -68705,26 +68699,21 @@ function eliminateHoles(data, holeIndices, outerNode, dim) {
     const end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
     const list = linkedList(data, start, end, dim, false);
     if (list === list.next)
-      list.steiner = true;
+      steiners.add(list);
     queue.push(getLeftmost(list));
   }
   queue.sort(compareXYSlope);
+  buildBlockIndex(data.length / dim, holeIndices.length);
+  indexSegment(outerNode, outerNode);
+  indexActive = true;
   for (let i = 0;i < queue.length; i++) {
     outerNode = eliminateHole(queue[i], outerNode);
   }
-  return outerNode;
+  indexActive = false;
+  return filterPoints(outerNode);
 }
 function compareXYSlope(a, b) {
-  let result = a.x - b.x;
-  if (result === 0) {
-    result = a.y - b.y;
-    if (result === 0) {
-      const aSlope = (a.next.y - a.y) / (a.next.x - a.x);
-      const bSlope = (b.next.y - b.y) / (b.next.x - b.x);
-      result = aSlope - bSlope;
-    }
-  }
-  return result;
+  return a.x - b.x || a.y - b.y || (a.next.y - a.y) / (a.next.x - a.x) - (b.next.y - b.y) / (b.next.x - b.x);
 }
 function eliminateHole(hole, outerNode) {
   const bridge = findHoleBridge(hole, outerNode);
@@ -68732,9 +68721,83 @@ function eliminateHole(hole, outerNode) {
     return outerNode;
   }
   const bridgeReverse = splitPolygon(bridge, hole);
+  const bridge2 = bridgeReverse.next;
+  indexSegment(bridge, bridge2.next);
   filterPoints(bridgeReverse, bridgeReverse.next);
   return filterPoints(bridge, bridge.next);
 }
+var K = 16;
+var blockBBox = new Float64Array(0);
+var numBlocks = 0;
+var blockHead = [];
+var blockStop = [];
+function buildBlockIndex(maxNodes, numHoles) {
+  const maxBlocks = Math.ceil((maxNodes + 2 * numHoles) / K) + numHoles + 2;
+  if (blockBBox.length < maxBlocks * 4)
+    blockBBox = new Float64Array(maxBlocks * 4);
+  numBlocks = 0;
+}
+function indexSegment(head, stop) {
+  let p = head;
+  do {
+    const b = numBlocks++;
+    blockHead[b] = p;
+    let minX = Infinity, minY = Infinity, maxX = -Infinity, maxY = -Infinity;
+    let k = 0;
+    do {
+      const c = p.next;
+      p.z = b;
+      if (p.x < minX)
+        minX = p.x;
+      if (p.x > maxX)
+        maxX = p.x;
+      if (p.y < minY)
+        minY = p.y;
+      if (p.y > maxY)
+        maxY = p.y;
+      if (c.x < minX)
+        minX = c.x;
+      if (c.x > maxX)
+        maxX = c.x;
+      if (c.y < minY)
+        minY = c.y;
+      if (c.y > maxY)
+        maxY = c.y;
+      p = c;
+    } while (++k < K && p !== stop);
+    blockStop[b] = p;
+    const g = b * 4;
+    blockBBox[g] = minX;
+    blockBBox[g + 1] = minY;
+    blockBBox[g + 2] = maxX;
+    blockBBox[g + 3] = maxY;
+  } while (p !== stop);
+}
+function growBlock(head, tail) {
+  const g = head.z * 4;
+  if (tail.x < blockBBox[g])
+    blockBBox[g] = tail.x;
+  if (tail.y < blockBBox[g + 1])
+    blockBBox[g + 1] = tail.y;
+  if (tail.x > blockBBox[g + 2])
+    blockBBox[g + 2] = tail.x;
+  if (tail.y > blockBBox[g + 3])
+    blockBBox[g + 3] = tail.y;
+}
+function liveBlockStop(b) {
+  let stop = blockStop[b];
+  while (stop.prev.next !== stop)
+    stop = stop.next;
+  blockStop[b] = stop;
+  return stop;
+}
+function liveBlockHead(b) {
+  let head = blockHead[b];
+  while (head.prev.next !== head)
+    head = head.next;
+  blockHead[b] = head;
+  return head;
+}
 function findHoleBridge(hole, outerNode) {
   let p = outerNode;
   const hx = hole.x;
@@ -68743,98 +68806,121 @@ function findHoleBridge(hole, outerNode) {
   let m;
   if (equals(hole, p))
     return p;
-  do {
-    if (equals(hole, p.next))
-      return p.next;
-    else if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
-      const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
-      if (x <= hx && x > qx) {
-        qx = x;
-        m = p.x < p.next.x ? p : p.next;
-        if (x === hx)
-          return m;
+  for (let b = 0, g = 0;b < numBlocks; b++, g += 4) {
+    if (hy < blockBBox[g + 1] || hy > blockBBox[g + 3] || blockBBox[g] > hx || blockBBox[g + 2] <= qx)
+      continue;
+    const stop = liveBlockStop(b);
+    p = liveBlockHead(b);
+    do {
+      if (p.prev.next === p) {
+        if (equals(hole, p.next))
+          return p.next;
+        else if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
+          const x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
+          if (x <= hx && x > qx) {
+            qx = x;
+            m = p.x < p.next.x ? p : p.next;
+            if (x === hx)
+              return m;
+          }
+        }
       }
-    }
-    p = p.next;
-  } while (p !== outerNode);
+      p = p.next;
+    } while (p !== stop);
+  }
   if (!m)
     return null;
-  const stop = m;
   const mx = m.x;
   const my = m.y;
+  const tminY = Math.min(hy, my);
+  const tmaxY = Math.max(hy, my);
   let tanMin = Infinity;
-  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)) {
-      const 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;
+  for (let b = 0, g = 0;b < numBlocks; b++, g += 4) {
+    if (blockBBox[g + 2] < mx || blockBBox[g] > hx || blockBBox[g + 3] < tminY || blockBBox[g + 1] > tmaxY)
+      continue;
+    const stop = liveBlockStop(b);
+    p = liveBlockHead(b);
+    do {
+      if (p.prev.next === p && 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)) {
+        const tan = Math.abs(hy - p.y) / (hx - p.x);
+        if ((locallyInside(p, hole) || p.y === hy && p.next.y === hy && p.next.x > hx) && (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);
+      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;
 }
+var sortArr = [];
+var sortBuf = [];
+var zArr = new Uint32Array(0);
+var zBuf = new Uint32Array(0);
+var counts = new Uint32Array(256);
 function indexCurve(start, minX, minY, invSize) {
   let p = start;
+  let n = 0;
   do {
-    if (p.z === 0)
-      p.z = zOrder(p.x, p.y, minX, minY, invSize);
-    p.prevZ = p.prev;
-    p.nextZ = p.next;
+    p.z = zOrder(p.x, p.y, minX, minY, invSize);
+    sortArr[n++] = p;
     p = p.next;
   } while (p !== start);
-  p.prevZ.nextZ = null;
-  p.prevZ = null;
-  sortLinked(p);
+  sortNodes(n);
+  let prev = null;
+  for (let i = 0;i < n; i++) {
+    const node = sortArr[i];
+    node.prevZ = prev;
+    if (prev)
+      prev.nextZ = node;
+    prev = node;
+  }
+  prev.nextZ = null;
 }
-function sortLinked(list) {
-  let numMerges;
-  let inSize = 1;
-  do {
-    let p = list;
-    let e;
-    list = null;
-    let tail = null;
-    numMerges = 0;
-    while (p) {
-      numMerges++;
-      let q = p;
-      let pSize = 0;
-      for (let i = 0;i < inSize; i++) {
-        pSize++;
-        q = q.nextZ;
-        if (!q)
-          break;
+function sortNodes(n) {
+  if (n <= 32) {
+    for (let i = 1;i < n; i++) {
+      const node = sortArr[i], z21 = node.z;
+      let j = i - 1;
+      while (j >= 0 && sortArr[j].z > z21) {
+        sortArr[j + 1] = sortArr[j];
+        j--;
       }
-      let 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;
+      sortArr[j + 1] = node;
     }
-    tail.nextZ = null;
-    inSize *= 2;
-  } while (numMerges > 1);
-  return list;
+    return;
+  }
+  if (zArr.length < n) {
+    zArr = new Uint32Array(n);
+    zBuf = new Uint32Array(n);
+    sortBuf = new Array(n);
+  }
+  for (let i = 0;i < n; i++)
+    zArr[i] = sortArr[i].z;
+  radixPass(n, sortArr, zArr, sortBuf, zBuf, 0);
+  radixPass(n, sortBuf, zBuf, sortArr, zArr, 8);
+  radixPass(n, sortArr, zArr, sortBuf, zBuf, 16);
+  radixPass(n, sortBuf, zBuf, sortArr, zArr, 24);
+}
+function radixPass(n, src, srcZ, dst, dstZ, shift) {
+  counts.fill(0);
+  for (let i = 0;i < n; i++)
+    counts[srcZ[i] >>> shift & 255]++;
+  let sum = 0;
+  for (let b = 0;b < 256; b++) {
+    const c = counts[b];
+    counts[b] = sum;
+    sum += c;
+  }
+  for (let i = 0;i < n; i++) {
+    const z21 = srcZ[i];
+    const pos = counts[z21 >>> shift & 255]++;
+    dst[pos] = src[i];
+    dstZ[pos] = z21;
+  }
 }
 function zOrder(x, y, minX, minY, invSize) {
   x = (x - minX) * invSize | 0;
@@ -68861,11 +68947,9 @@ function getLeftmost(start) {
 function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
   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 pointInTriangleExceptFirst(ax, ay, bx, by, cx, cy, px, py) {
-  return !(ax === px && ay === py) && pointInTriangle(ax, ay, bx, by, cx, cy, px, py);
-}
 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);
+  const zeroLength = equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0;
+  return a.next.i !== b.i && (zeroLength || locallyInside(a, b) && locallyInside(b, a) && (area(a.prev, a, b.prev) !== 0 || area(a, b.prev, b) !== 0)) && !intersectsPolygon(a, b) && (zeroLength || middleInside(a, b));
 }
 function area(p, q, r) {
   return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
@@ -68873,13 +68957,15 @@ function area(p, q, r) {
 function equals(p1, p2) {
   return p1.x === p2.x && p1.y === p2.y;
 }
-function intersects(p1, q1, p2, q2) {
-  const o1 = sign(area(p1, q1, p2));
-  const o2 = sign(area(p1, q1, q2));
-  const o3 = sign(area(p2, q2, p1));
-  const o4 = sign(area(p2, q2, q1));
-  if (o1 !== o2 && o3 !== o4)
+function intersects(p1, q1, p2, q2, includeBoundary = true) {
+  const o1 = area(p1, q1, p2);
+  const o2 = area(p1, q1, q2);
+  const o3 = area(p2, q2, p1);
+  const o4 = area(p2, q2, q1);
+  if ((o1 > 0 && o2 < 0 || o1 < 0 && o2 > 0) && (o3 > 0 && o4 < 0 || o3 < 0 && o4 > 0))
     return true;
+  if (!includeBoundary)
+    return false;
   if (o1 === 0 && onSegment(p1, p2, q1))
     return true;
   if (o2 === 0 && onSegment(p1, q2, q1))
@@ -68893,15 +68979,21 @@ function intersects(p1, q1, p2, q2) {
 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) {
+  const minX = Math.min(a.x, b.x);
+  const maxX = Math.max(a.x, b.x);
+  const minY = Math.min(a.y, b.y);
+  const maxY = Math.max(a.y, b.y);
   let 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))
+    const n = p.next;
+    if (p.x > maxX && n.x > maxX || p.x < minX && n.x < minX || p.y > maxY && n.y > maxY || p.y < minY && n.y < minY) {
+      p = n;
+      continue;
+    }
+    if (p.i !== a.i && n.i !== a.i && p.i !== b.i && n.i !== b.i && intersects(p, n, a, b))
       return true;
-    p = p.next;
+    p = n;
   } while (p !== a);
   return false;
 }
@@ -68914,9 +69006,10 @@ function middleInside(a, b) {
   const px = (a.x + b.x) / 2;
   const 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)
+    const n = p.next;
+    if (p.y > py !== n.y > py && px < (n.x - p.x) * (py - p.y) / (n.y - p.y) + p.x)
       inside = !inside;
-    p = p.next;
+    p = n;
   } while (p !== a);
   return inside;
 }
@@ -68952,6 +69045,8 @@ function removeNode(p) {
     p.prevZ.nextZ = p.nextZ;
   if (p.nextZ)
     p.nextZ.prevZ = p.prevZ;
+  if (indexActive)
+    growBlock(p.prev, p.next);
 }
 function createNode(i, x, y) {
   return {
@@ -68962,8 +69057,7 @@ function createNode(i, x, y) {
     next: null,
     z: 0,
     prevZ: null,
-    nextZ: null,
-    steiner: false
+    nextZ: null
   };
 }
 function signedArea(data, start, end, dim) {