@tscircuit/cli 0.1.1673 → 0.1.1675

package/dist/cli/main.js

@@ -15006,6 +15006,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);
@@ -15043,7 +15044,7 @@ var require_ignore = __commonJS((exports2, module2) => {
       () => "\\/"
     ],
     [
-      /^\^*\\\*\\\*\\\//,
+      /^\^*(?:\\\*\\\*\\\/)+/,
       () => "^(?:.*\\/)?"
     ],
     [
@@ -15073,7 +15074,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}]` : "[]" : "[]"
     ],
     [
       /(?:[^*])$/,
@@ -19069,7 +19070,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;
           }
@@ -35296,7 +35297,7 @@ var __create3, __defProp3, __getOwnPropDesc2, __getOwnPropNames3, __getProtoOf3,
 }, e = (t) => {
   let o = t.primitives ?? [...Object.values(t.paths ?? {}), ...Object.values(t.texts ?? {}), ...Object.values(t.circles ?? {}), ...Object.values(t.rects ?? {})], i = t.ports ?? Object.entries(t.refblocks).flatMap(([a, y]) => [{ ...y, labels: [a] }]), l = t.center ?? { x: t.bounds.centerX, y: t.bounds.centerY };
   return i.length === 2 && (l = { x: (i[0].x + i[1].x) / 2, y: (i[0].y + i[1].y) / 2 }), new _r({ ...t, primitives: o, ports: i, center: l });
-}, w, If, o5, Ct, dp, Bf, bp, qf, a5, Nt, _p, Df, gp, Gf, m5, It, up, Uf, vp, Wf, h5, Bt, wp, Hf, Ap, Zf, g5, qt, Pp, Qf, Sp, Kf, A5, Dt, Rp, tc, Fp, A, rc, T5, Gt, Tp, oc, Ep, Yp, ic, k5, Ut, Xp, lc, Lp, Vp, pc, N5, Wt, jp, ac, kp, yc, D5, Ht, zp, xc, Op, j, mc, Z5, Zt, Jp, nc, $p, fc, eg, Qt, Mp, cc, Kt, hc, lg, te, Cp, dc, Np, gr, ur, vr, Ip, Bp, _c, qp, ee, Dp, gc, re, Gp, k, vc, Tg, Up, Wp, wc, Hp, Ac, Lg, Zp, Qp, Pc, Kp, Sc, zg, ta, ea, Rc, ra, z2, Tc, Cg, oe, oa, Ec, ia, Yc, qg, ie, la, Xc, pa, Lc, Wg, le, aa, Vc, ya, jc, Kg, pe, xa, kc, sa, zc, ou, ma, na, Oc, fa, ut, $c, yu, ca, ha, Mc, da, Cc, nu, ba, _a, Nc, ae, ga, Ic, gu, ua, va, Bc, wa, O, Dc, Pu, ye, Aa, Gc, Pa, Sa, J, Wc, Lu, xe, Ra, Hc, Fa, Ta, Zc, $u, se, Ea, Qc, Ya, Kc, Iu, me, Xa, th, La, Va, eh, Hu, ne, ja, rh, ka, P, ih, e3, fe, za, lh, Oa, Ja, ph, y3, ce, $a, ah, Ma, Ca, yh, h3, he, Na, xh, Ia, sh, g3, de, Ba, mh, qa, $2, fh, P3, be, _e, ch, Da, Ga, Ua, hh, j3, ge, ue, dh, Wa, M, _h, $3, ve, Ha, gh, Za, Qa, Ka, uh, W3, we, ty, vh, ey, St = 0.6, wr = 0.3, wh, ry, Rt = 0.6, Ar = 0.3, Ah, oy, Ft = 0.6, Pr = 0.3, Ph, iy, Tt = 0.6, Sr = 0.3, Sh, ly, S, py, ay, yy, xy, sy, my, ny, Th, Eh, Ae, fy, Yh, Et, Rr, Fr, Vh, cy, hy, R, zh, j7, Pe, dy, Oh, by, Jh, J7, Se, _y, $h, gy, Mh, N7, Re, uy, Ch, vy, Nh, D7, Fe, wy, Ih, Ay, Bh, H7, Te, Py, qh, Sy, Dh, t8, Ee, Ry, Gh, Fy, F, Ty, Ey, Yy, Xy7, Ly, Vy, C, Hh, jy, Zh, ky2, Qh, zy, Kh, Oy, td, Jy, ed, $y, rd, My, od, Cy, Ny, N, Iy, By, qy, Dy, I, Tr, Er, Yr, Gy, Xr, Lr, Vr, Uy, jr, kr, zr, Wy, Hy, B, Or, Jr, $r, Zy, Mr, Cr, Nr, Qy, Ir, Br, qr, Ky2, tx, q, Dr, Gr, Ur, ex, Wr, Hr, Zr, rx, Qr, Kr, to, ox, ix, D, eo, ro, oo, lx, io, lo, po, px, ao, yo, xo, ax, Ye, sd, Uv, Xe, yx, md, Le, so, mo, no, xx, Ve, sx, T, fd, x6, je, mx, cd, nx, hd, f6, ke, fx, dd, cx, bd, b6, ze, hx, _d, dx, gd, v6, Oe, bx, ud, _x, vd, S6, Je, gx, wd, ux, Ad, E6, $e, vx, Pd, wx, Ax, Rd, Fd, Me, Px, Td, Yt, Ed, Yd, Sx, Rx, Fx, Vd, jd, Ce, Tx, Ne, Ex, E, Yx, Xx, Lx, Vx, jx, kx, Xt, zx, Ox, Jx, G, $x, Mx, fo, co, ho, Cx, Nx, Ie, bo, _o, Ix, Bx, qx, Be, Dx, Gx, go, uo, Ux, Wx, Cd, Hx, qe, Zx, Nd, vt, De, Qx, Kx, vo, U, wo, Ao, Po, ts, So, Ro, Fo, es, To, Eo, Yo, rs, os5, qd, is, Ge, ls, Dd, wt, Xo, Lo, Vo, Ue, jo, ko, zo, ps, as, ys, Ud, xs, We, ss, Wd, He, ms, ns, Oo, Jo, fs43, cs, Zd, hs, Ze, $o, Qe, Mo, ds, Co, bs, _s, Kd, gs, Ke, us, t2, t0, No, Lt, e0, vs, ws, r2, As, r0, Io, o2, o0, Ps, Ss, Bo, qo, Rs, Fs, l2, Ts, i0, Do, p2, l0, Es, Ys, Go, Uo, Xs, Ls, y2, Vs, p0, Wo, x2, a0, js, ks, Ho, Zo, zs, Os, m2, Js, n2, W, $s, Ms, Cs, g, c2, MP, y0, Qo, h2, Ns, Is, d2, QP, x0, Ko, b2, Bs, _2, rS, s0, ti, g2, qs, u2, pS, m0, ei, v2, Ds, w2, sS, n0, ri, A2, Gs, Us, H, Ws, Hs, Zs, Qs, Z, Ks, tm, em, rm, F2, om, f0, oi, T2, c0, im, lm, ii, li, pm, am, Y2, ym, h0, pi, X2, d0, xm, sm, ai, yi, mm, nm, b0, fm, V2, cm, hm, dm, k2, bm, _0, xi, z22, g0, _m, gm, si, mi, um, u, J2, hR, u0, ni, $22, vm, wm, M2, FR, v0, fi, C2, Am, N2, XR, w0, ci, I2, Pm, B2, kR, A0, hi, q2, Sm, D2, $R, P0, di, G2, Rm, Fm, W2, Tm, S0, Em, R0, H2, Ym, Xm, Q2, Lm, F0, Vm, Q, bi, _i, gi, jm, ui, vi, wi, km, Ai, Pi, Si, zm, K, t9, sF, T0, Ri, e9, Om, r9, cF, E0, Fi, o9, Jm, $m, i9, vF, Y0, Ti, l9, Mm, Cm, a9, RF, X0, Nm, y9, L0, Im, Ei, Yi, Xi, Li, Bm, qm, s9, Dm, V0, Gm, m9, j0, Um, k0, f9, Wm, z0, Hm, c9, X, Vi, ji, ki, Zm, h9, Qm, O0, Km, d9, tn, zi, Oi, Ji, en, $i, Mi, Ci, rn, Ni, Ii, Bi, on2, tt, _9, pT, ln, g9, u9, pn, v9, sT, an, w9, A9, yn, P9, cT, xn, S9, R9, sn, F9, _T, mn, T9, nn, fn, Y9, cn, J0, $0, X9, M0, qi, L9, V9, hn, et, k9, YT, C0, dn, z9, bn, O9, jT, N0, _n, J9, gn, $9, JT, I0, un, M9, vn, C9, NT, B0, wn, N9, An, q0, B9, Pn, D0, Di, q9, rt, Gi, Ui, Wi, Sn, D9, KT, G0, Hi, G9, U0, Zi, Qi, Ki, Rn, tl, el, rl, Fn, Tn, En, ot, ol, il, ll, Yn, pl, al, yl, Xn, xl, sl, ml, Ln, nl, W0, Vn, H9, jn, kn, it, zn, On, Jn, $n, lt, Mn, Cn, Nn, In, pt, Bn, qn, Dn, Gn, at, Un, Wn, Hn, Zn, yt, Qn, Kn, t1, e1, xt, r1, o1, i1, l1, p1, st, fl, cl, hl, a1, dl, bl, _l, y1, gl, ul, vl, x1, s1, mt, wl, Al, Pl, m1, Sl, Rl, Fl, n1, Tl, El, Yl, f1, Vt, nt, Xl, Ll, Vl, c1, jl, kl, zl, h1, Ol, Jl, $l, d1, jt, ft, Ml, Cl, Nl, b1, Il, Bl, ql, _1, Dl, Gl, Ul, g1, ct, u1, v1, w1, A1, Wl, H0, P1, S1, sb, mb, Z0, R1, nb, kt, fb, cb, F1, T1, ht, Y1, E1, X1, L1, j1, V1, k1, z1, At5, Hl, Zl, Ql, Q0, Kl, tp, ep, O1, rp, op, ip, J1, lp, K0, $1, M1, _b, gb, C1, N1, vb, I1, tr, B1, wb, er, pp, Ab, Pb, q1, D1, Rb, G1, rr, ap, Fb, or, U1, W1, Tb, H1, Z1, Q1, K1, tf, Xb, yp, ir, ef, Lb, lr, rf, of, jb, lf, pr, pf, kb, ar, xp, zb, Ob, af, yf, $b, xf, yr, sf, xr, mf, nf, Cb, Nb, sr, ff, Ib, zt, Bb, qb, cf, hf, dt, Ub, df, Wb, bf, Hb, _f, Zb, gf, sp, mr, uf, vf, t_, e_, nr, wf, r_, Ot, o_, i_, Af, Pf, Sf, a_, y_, fr, Rf, x_, Jt, s_, m_, Ff, Tf, Ef, c_, Yf, cr, Xf, h_, hr, mp, d_, b_, Lf, Vf, YC, calculateElbowBends = (p12, p22, overshootAmount) => {
+}, w, If, o5, Ct, dp, Bf, bp, qf, a5, Nt, _p, Df, gp, Gf, m5, It, up, Uf, vp, Wf, h5, Bt, wp, Hf, Ap, Zf, g5, qt, Pp, Qf, Sp, Kf, A5, Dt, Rp, tc, Fp, A, rc, T5, Gt, Tp, oc, Ep, Yp, ic, k5, Ut, Xp, lc, Lp, Vp, pc, N5, Wt, jp, ac, kp, yc, D5, Ht, zp, xc, Op, j, mc, Z5, Zt, Jp, nc, $p, fc, eg, Qt, Mp, cc, Kt, hc, lg, te, Cp, dc, Np, gr, ur, vr, Ip, Bp, _c, qp, ee, Dp, gc, re, Gp, k, vc, Tg, Up, Wp, wc, Hp, Ac, Lg, Zp, Qp, Pc, Kp, Sc, zg, ta, ea, Rc, ra, z2, Tc, Cg, oe, oa, Ec, ia, Yc, qg, ie, la, Xc, pa, Lc, Wg, le, aa, Vc, ya, jc, Kg, pe, xa, kc, sa, zc, ou, ma, na, Oc, fa, ut, $c, yu, ca, ha, Mc, da, Cc, nu, ba, _a, Nc, ae, ga, Ic, gu, ua, va, Bc, wa, O, Dc, Pu, ye, Aa, Gc, Pa, Sa, J, Wc, Lu, xe, Ra, Hc, Fa, Ta, Zc, $u, se, Ea, Qc, Ya, Kc, Iu, me, Xa, th, La, Va, eh, Hu, ne, ja, rh, ka, P, ih, e3, fe, za, lh, Oa, Ja, ph, y3, ce, $a, ah, Ma, Ca, yh, h3, he, Na, xh, Ia, sh, g3, de, Ba, mh, qa, $2, fh, P3, be, _e, ch, Da, Ga, Ua, hh, j3, ge, ue, dh, Wa, M, _h, $3, ve, Ha, gh, Za, Qa, Ka, uh, W3, we, ty, vh, ey, St = 0.6, wr = 0.3, wh, ry, Rt = 0.6, Ar = 0.3, Ah, oy, Ft = 0.6, Pr = 0.3, Ph, iy, Tt = 0.6, Sr = 0.3, Sh, ly, S, py, ay, yy, xy, sy, my, ny, Th, Eh, Ae, fy, Yh, Et, Rr, Fr, Vh, cy, hy, R, zh, j7, Pe, dy, Oh, by, Jh, J7, Se, _y, $h, gy, Mh, N7, Re, uy, Ch, vy, Nh, D7, Fe, wy, Ih, Ay, Bh, H7, Te, Py, qh, Sy, Dh, t8, Ee, Ry, Gh, Fy, F, Ty, Ey, Yy, Xy7, Ly, Vy, C, Hh, jy, Zh, ky2, Qh, zy, Kh, Oy, td, Jy, ed, $y, rd, My, od, Cy, Ny, N, Iy, By, qy, Dy, I, Tr, Er, Yr, Gy, Xr, Lr, Vr, Uy, jr, kr, zr, Wy, Hy, B, Or, Jr, $r, Zy, Mr, Cr, Nr, Qy, Ir, Br, qr, Ky2, tx, q, Dr, Gr, Ur, ex, Wr, Hr, Zr, rx, Qr, Kr, to, ox, ix, D, eo, ro, oo, lx, io, lo, po, px, ao, yo, xo, ax, Ye, sd, Uv, Xe, yx, md, Le, so, mo, no, xx, Ve, sx, T, fd, x6, je, mx, cd, nx, hd, f6, ke, fx, dd, cx, bd, b6, ze, hx, _d, dx, gd, v6, Oe, bx, ud, _x, vd, S6, Je, gx, wd, ux, Ad, E6, $e, vx, Pd, wx, Ax, Rd, Fd, Me, Px, Td, Yt, Ed, Yd, Sx, Rx, Fx, Vd, jd, Ce, Tx, Ne, Ex, E, Yx, Xx, Lx, Vx, jx, kx, Xt, zx, Ox, Jx, G, $x, Mx, fo, co, ho, Cx, Nx, Ie, bo, _o, Ix, Bx, qx, Be, Dx, Gx, go, uo, Ux, Wx, Cd, Hx, qe, Zx, Nd, vt, De, Qx, Kx, vo, U, wo, Ao, Po, ts, So, Ro, Fo, es, To, Eo, Yo, rs, os5, qd, is, Ge, ls, Dd, wt, Xo, Lo, Vo, Ue, jo, ko, zo, ps, as, ys, Ud, xs, We, ss, Wd, He, ms, ns, Oo, Jo, fs43, cs, Zd, hs, Ze, $o, Qe, Mo, ds, Co, bs, _s, Kd, gs, Ke, us, t2, t0, No, Lt, e0, vs, ws, r2, As, r0, Io, o2, o0, Ps, Ss, Bo, qo, Rs, Fs, l2, Ts, i0, Do, p2, l0, Es, Ys, Go, Uo, Xs, Ls, y2, Vs, p0, Wo, x2, a0, js, ks, Ho, Zo, zs, Os, m2, Js, n2, W, $s, Ms, Cs, g, c2, MP, y0, Qo, h2, Ns, Is, d2, QP, x0, Ko, b2, Bs, _2, rS, s0, ti, g2, qs, u2, pS, m0, ei, v2, Ds, w2, sS, n0, ri, A2, Gs, Us, H, Ws, Hs, Zs, Qs, Z, Ks, tm, em, rm, F2, om, f0, oi, T2, c0, im, lm, ii, li, pm, am, Y2, ym, h0, pi, X2, d0, xm, sm, ai, yi, mm, nm, b0, fm, V2, cm, hm, dm, k2, bm, _0, xi, z22, g0, _m, gm, si, mi, um, u, J2, hR, u0, ni, $22, vm, wm, M2, FR, v0, fi, C2, Am, N2, XR, w0, ci, I2, Pm, B2, kR, A0, hi, q2, Sm, D2, $R, P0, di, G2, Rm, Fm, W2, Tm, S0, Em, R0, H2, Ym, Xm, Q2, Lm, F0, Vm, Q, bi, _i, gi, jm, ui, vi, wi, km, Ai, Pi, Si, zm, K2, t9, sF, T0, Ri, e9, Om, r9, cF, E0, Fi, o9, Jm, $m, i9, vF, Y0, Ti, l9, Mm, Cm, a9, RF, X0, Nm, y9, L0, Im, Ei, Yi, Xi, Li, Bm, qm, s9, Dm, V0, Gm, m9, j0, Um, k0, f9, Wm, z0, Hm, c9, X, Vi, ji, ki, Zm, h9, Qm, O0, Km, d9, tn, zi, Oi, Ji, en, $i, Mi, Ci, rn, Ni, Ii, Bi, on2, tt, _9, pT, ln, g9, u9, pn, v9, sT, an, w9, A9, yn, P9, cT, xn, S9, R9, sn, F9, _T, mn, T9, nn, fn, Y9, cn, J0, $0, X9, M0, qi, L9, V9, hn, et, k9, YT, C0, dn, z9, bn, O9, jT, N0, _n, J9, gn, $9, JT, I0, un, M9, vn, C9, NT, B0, wn, N9, An, q0, B9, Pn, D0, Di, q9, rt, Gi, Ui, Wi, Sn, D9, KT, G0, Hi, G9, U0, Zi, Qi, Ki, Rn, tl, el, rl, Fn, Tn, En, ot, ol, il, ll, Yn, pl, al, yl, Xn, xl, sl, ml, Ln, nl, W0, Vn, H9, jn, kn, it, zn, On, Jn, $n, lt, Mn, Cn, Nn, In, pt, Bn, qn, Dn, Gn, at, Un, Wn, Hn, Zn, yt, Qn, Kn, t1, e1, xt, r1, o1, i1, l1, p1, st, fl, cl, hl, a1, dl, bl, _l, y1, gl, ul, vl, x1, s1, mt, wl, Al, Pl, m1, Sl, Rl, Fl, n1, Tl, El, Yl, f1, Vt, nt, Xl, Ll, Vl, c1, jl, kl, zl, h1, Ol, Jl, $l, d1, jt, ft, Ml, Cl, Nl, b1, Il, Bl, ql, _1, Dl, Gl, Ul, g1, ct, u1, v1, w1, A1, Wl, H0, P1, S1, sb, mb, Z0, R1, nb, kt, fb, cb, F1, T1, ht, Y1, E1, X1, L1, j1, V1, k1, z1, At5, Hl, Zl, Ql, Q0, Kl, tp, ep, O1, rp, op, ip, J1, lp, K0, $1, M1, _b, gb, C1, N1, vb, I1, tr, B1, wb, er, pp, Ab, Pb, q1, D1, Rb, G1, rr, ap, Fb, or, U1, W1, Tb, H1, Z1, Q1, K1, tf, Xb, yp, ir, ef, Lb, lr, rf, of, jb, lf, pr, pf, kb, ar, xp, zb, Ob, af, yf, $b, xf, yr, sf, xr, mf, nf, Cb, Nb, sr, ff, Ib, zt, Bb, qb, cf, hf, dt, Ub, df, Wb, bf, Hb, _f, Zb, gf, sp, mr, uf, vf, t_, e_, nr, wf, r_, Ot, o_, i_, Af, Pf, Sf, a_, y_, fr, Rf, x_, Jt, s_, m_, Ff, Tf, Ef, c_, Yf, cr, Xf, h_, hr, mp, d_, b_, Lf, Vf, YC, calculateElbowBends = (p12, p22, overshootAmount) => {
   const result = [{
     x: p12.x,
     y: p12.y
@@ -39246,13 +39247,13 @@ var init_chunk_4ISXDEM5 = __esm(() => {
   Si.y -= 0.21;
   Si.x = 0.34;
   zm = Ai;
-  K = { paths: { path1: { type: "path", points: [{ x: -0.42, y: 0 }, { x: -0.3, y: 0 }], color: "primary", fill: false }, "path1-2-1": { type: "path", points: [{ x: -0.3, y: 0 }, { x: -0.25, y: 0.1 }, { x: -0.15, y: -0.1 }, { x: -0.05, y: 0.1 }, { x: 0.05, y: -0.1 }, { x: 0.15, y: 0.1 }, { x: 0.25, y: -0.1 }, { x: 0.3, y: 0 }], color: "primary", fill: false }, path2: { type: "path", points: [{ x: 0.3, y: 0 }, { x: 0.42, y: 0 }], color: "primary", fill: false }, path3: { type: "path", points: [{ x: 0, y: -0.17 }, { x: 0, y: -0.4 }], color: "primary", fill: false }, path15: { type: "path", points: [{ x: 0, y: -0.12 }, { x: 0.05, y: -0.2 }, { x: -0.05, y: -0.2 }, { x: 0, y: -0.12 }], color: "primary", fill: true } }, texts: { top1: { type: "text", text: "{REF}", x: 0.3, y: 0.25 }, bottom1: { type: "text", text: "{VAL}", x: 0.3, y: -0.25 } }, refblocks: { left: { x: -0.42, y: 0 }, right: { x: 0.42, y: 0 }, bottom: { x: 0, y: -0.4 } }, bounds: { minX: -0.42, maxX: 0.42, minY: -0.2, maxY: 0.2, width: 0.84, height: 0.4, centerX: 0, centerY: 0 }, circles: {} };
-  ({ paths: t9, texts: sF, bounds: T0, refblocks: Ri, circles: e9 } = K);
+  K2 = { paths: { path1: { type: "path", points: [{ x: -0.42, y: 0 }, { x: -0.3, y: 0 }], color: "primary", fill: false }, "path1-2-1": { type: "path", points: [{ x: -0.3, y: 0 }, { x: -0.25, y: 0.1 }, { x: -0.15, y: -0.1 }, { x: -0.05, y: 0.1 }, { x: 0.05, y: -0.1 }, { x: 0.15, y: 0.1 }, { x: 0.25, y: -0.1 }, { x: 0.3, y: 0 }], color: "primary", fill: false }, path2: { type: "path", points: [{ x: 0.3, y: 0 }, { x: 0.42, y: 0 }], color: "primary", fill: false }, path3: { type: "path", points: [{ x: 0, y: -0.17 }, { x: 0, y: -0.4 }], color: "primary", fill: false }, path15: { type: "path", points: [{ x: 0, y: -0.12 }, { x: 0.05, y: -0.2 }, { x: -0.05, y: -0.2 }, { x: 0, y: -0.12 }], color: "primary", fill: true } }, texts: { top1: { type: "text", text: "{REF}", x: 0.3, y: 0.25 }, bottom1: { type: "text", text: "{VAL}", x: 0.3, y: -0.25 } }, refblocks: { left: { x: -0.42, y: 0 }, right: { x: 0.42, y: 0 }, bottom: { x: 0, y: -0.4 } }, bounds: { minX: -0.42, maxX: 0.42, minY: -0.2, maxY: 0.2, width: 0.84, height: 0.4, centerX: 0, centerY: 0 }, circles: {} };
+  ({ paths: t9, texts: sF, bounds: T0, refblocks: Ri, circles: e9 } = K2);
   Om = e({ primitives: [...Object.values(t9), ...Object.values(e9), { type: "text", text: "{REF}", x: -0.15, y: 0.2394553499999995 }, { type: "text", text: "{VAL}", x: 0.15, y: 0.2394553499999995 }], ports: [{ ...Ri.left, labels: ["1"] }, { ...Ri.right, labels: ["3"] }, { ...Ri.bottom, labels: ["2"] }], size: { width: T0.width, height: T0.height }, center: { x: T0.centerX, y: T0.centerY } }).rotateRightFacingSymbol("down").labelPort("left", ["1"]).labelPort("right", ["2"]).labelPort("bottom", ["3"]).changeTextAnchor("{REF}", "middle_left").changeTextAnchor("{VAL}", "middle_left").build();
-  ({ paths: r9, texts: cF, bounds: E0, refblocks: Fi, circles: o9 } = K);
+  ({ paths: r9, texts: cF, bounds: E0, refblocks: Fi, circles: o9 } = K2);
   Jm = e({ primitives: [...Object.values(r9), ...Object.values(o9), { type: "text", text: "{REF}", x: -0.3, y: -0.3894553499999995 }, { type: "text", text: "{VAL}", x: -0.3, y: 0.3194553499999995 }], ports: [{ ...Fi.left, labels: ["1"] }, { ...Fi.right, labels: ["3"] }, { ...Fi.bottom, labels: ["2"] }], size: { width: E0.width, height: E0.height }, center: { x: E0.centerX, y: E0.centerY } }).rotateRightFacingSymbol("left").labelPort("left", ["1"]).labelPort("right", ["2"]).labelPort("bottom", ["3"]).changeTextAnchor("{REF}", "middle_bottom").changeTextAnchor("{VAL}", "middle_top").build();
-  $m = e(K).labelPort("left", ["1"]).labelPort("right", ["3"]).labelPort("bottom", ["2"]).changeTextAnchor("{REF}", "middle_bottom").changeTextAnchor("{VAL}", "middle_top").build();
-  ({ paths: i9, texts: vF, bounds: Y0, refblocks: Ti, circles: l9 } = K);
+  $m = e(K2).labelPort("left", ["1"]).labelPort("right", ["3"]).labelPort("bottom", ["2"]).changeTextAnchor("{REF}", "middle_bottom").changeTextAnchor("{VAL}", "middle_top").build();
+  ({ paths: i9, texts: vF, bounds: Y0, refblocks: Ti, circles: l9 } = K2);
   Mm = e({ primitives: [...Object.values(i9), ...Object.values(l9), { type: "text", text: "{REF}", x: 0.3, y: -0.2894553499999995 }, { type: "text", text: "{VAL}", x: -0.3, y: -0.2894553499999995 }], ports: [{ ...Ti.left, labels: ["1"] }, { ...Ti.right, labels: ["3"] }, { ...Ti.bottom, labels: ["2"] }], size: { width: Y0.width, height: Y0.height }, center: { x: Y0.centerX, y: Y0.centerY } }).rotateRightFacingSymbol("up").labelPort("left", ["1"]).labelPort("right", ["2"]).labelPort("bottom", ["3"]).changeTextAnchor("{REF}", "middle_left").changeTextAnchor("{VAL}", "middle_left").build();
   Cm = { paths: { path11: { type: "path", points: [{ x: -0.54, y: 0.03 }, { x: -0.3, y: 0.03 }], color: "primary", fill: false }, path12: { type: "path", points: [{ x: 0.29, y: 0.03 }, { x: 0.54, y: 0.03 }], color: "primary", fill: false } }, texts: { top1: { type: "text", text: "{REF}", x: -0.16, y: 0.4 }, bottom1: { type: "text", text: "{VAL}", x: 0, y: -0.4 }, left1: { type: "text", text: "COS φ", x: -0.15, y: 0.01 } }, refblocks: { left1: { x: -0.54, y: 0.03 }, right1: { x: 0.54, y: 0.03 } }, bounds: { minX: -0.57, maxX: 0.57, minY: -0.4, maxY: 0.4, width: 1.14, height: 0.79, centerX: 0, centerY: 0 }, circles: { path1: { type: "circle", x: 0, y: 0.04, radius: 0.29, color: "primary", fill: false } } };
   ({ paths: a9, texts: RF, bounds: X0, refblocks: Nm, circles: y9 } = Cm);
@@ -48142,14 +48143,14 @@ function calculateVerticalEdgeLabels(edge, pinout_labels, {
   styleScale
 }, label_positions) {
   const x_coords = pinout_labels.map((l) => l.pcb_port.x);
-  const counts = {};
+  const counts2 = {};
   for (const x3 of x_coords) {
     const rounded = x3.toFixed(1);
-    counts[rounded] = (counts[rounded] || 0) + 1;
+    counts2[rounded] = (counts2[rounded] || 0) + 1;
   }
   let edge_ports;
-  if (Object.keys(counts).length > 1 && pinout_labels.length > 2) {
-    const sorted_x_groups = Object.entries(counts).sort((a, b) => b[1] - a[1]);
+  if (Object.keys(counts2).length > 1 && pinout_labels.length > 2) {
+    const sorted_x_groups = Object.entries(counts2).sort((a, b) => b[1] - a[1]);
     const primary_x = parseFloat(sorted_x_groups[0][0]);
     const primary_pins = pinout_labels.filter((l) => Math.abs(l.pcb_port.x - primary_x) < 0.2);
     const other_pins = pinout_labels.filter((l) => Math.abs(l.pcb_port.x - primary_x) >= 0.2);
@@ -48255,15 +48256,15 @@ function calculateVerticalEdgeLabels(edge, pinout_labels, {
       stagger_rank = geometric_middle_index - dist_from_middle;
     }
     const stagger_offset = stagger_offset_base + stagger_rank * (STAGGER_OFFSET_STEP * styleScale * pxPerMm);
-    const sign2 = edge === "left" ? -1 : 1;
+    const sign = edge === "left" ? -1 : 1;
     const is_main_group_pin = main_group_indices.includes(i);
     const y_pos = is_all_main_group ? edge_ports[i].y : main_group_indices.length > 0 && is_main_group_pin ? edge_ports[i].y : current_y;
     const elbow_end = {
-      x: board_edge_x + sign2 * stagger_offset,
+      x: board_edge_x + sign * stagger_offset,
       y: y_pos
     };
     const label_pos = {
-      x: board_edge_x + sign2 * aligned_label_offset,
+      x: board_edge_x + sign * aligned_label_offset,
       y: y_pos
     };
     label_positions.set(pcb_port.pcb_port_id, {
@@ -62106,8 +62107,8 @@ var require_lodash2 = __commonJS((exports2, module2) => {
     }
     value = toNumber4(value);
     if (value === INFINITY || value === -INFINITY) {
-      var sign2 = value < 0 ? -1 : 1;
-      return sign2 * MAX_INTEGER;
+      var sign = value < 0 ? -1 : 1;
+      return sign * MAX_INTEGER;
     }
     return value === value ? value : 0;
   }
@@ -62287,8 +62288,8 @@ var require_lodash3 = __commonJS((exports2, module2) => {
     }
     value = toNumber4(value);
     if (value === INFINITY || value === -INFINITY) {
-      var sign2 = value < 0 ? -1 : 1;
-      return sign2 * MAX_INTEGER;
+      var sign = value < 0 ? -1 : 1;
+      return sign * MAX_INTEGER;
     }
     return value === value ? value : 0;
   }
@@ -62336,14 +62337,14 @@ var require_normalize_coord = __commonJS((exports2, module2) => {
       return NaN;
     }
     var numberString = "" + number;
-    var sign2 = "+";
+    var sign = "+";
     if (numberString[0] === "-" || numberString[0] === "+") {
-      sign2 = numberString[0];
+      sign = numberString[0];
       numberString = numberString.slice(1);
     }
     var hasDecimal = numberString.indexOf(".") !== -1;
     if (hasDecimal || format == null || format.zero == null) {
-      return Number(sign2 + numberString);
+      return Number(sign + numberString);
     } else {
       if (format.places == null || format.places.length !== 2) {
         return NaN;
@@ -62363,7 +62364,7 @@ var require_normalize_coord = __commonJS((exports2, module2) => {
     }
     var before = numberString.slice(0, leading);
     var after = numberString.slice(leading, leading + trailing);
-    return Number(sign2 + before + "." + after);
+    return Number(sign + before + "." + after);
   };
   module2.exports = normalizeCoord;
 });
@@ -65926,8 +65927,8 @@ var require_lodash4 = __commonJS((exports2, module2) => {
     }
     value = toNumber4(value);
     if (value === INFINITY || value === -INFINITY) {
-      var sign2 = value < 0 ? -1 : 1;
-      return sign2 * MAX_INTEGER;
+      var sign = value < 0 ? -1 : 1;
+      return sign * MAX_INTEGER;
     }
     return value === value ? value : 0;
   }
@@ -66609,7 +66610,7 @@ var require__operate = __commonJS((exports2, module2) => {
     return number >= epsilon ? number : 0;
   };
   var arcCenterFromRadius = function(start, end, mode, epsilon, radius) {
-    var sign2 = mode === "ccw" ? 1 : -1;
+    var sign = mode === "ccw" ? 1 : -1;
     var xAve = (start[0] + end[0]) / 2;
     var yAve = (start[1] + end[1]) / 2;
     var deltaX = end[0] - start[1];
@@ -66617,8 +66618,8 @@ var require__operate = __commonJS((exports2, module2) => {
     var distance49 = Math.sqrt(Math.pow(deltaX, 2) + Math.pow(deltaY, 2));
     var halfDistance = distance49 / 2;
     var squareDifference = Math.sqrt(Math.pow(radius, 2) - Math.pow(halfDistance, 2));
-    var xOffset = -sign2 * deltaY * squareDifference / distance49;
-    var yOffset = sign2 * deltaX * squareDifference / distance49;
+    var xOffset = -sign * deltaY * squareDifference / distance49;
+    var yOffset = sign * deltaX * squareDifference / distance49;
     return [
       [
         roundToZero(xAve + xOffset, epsilon),
@@ -72170,9 +72171,9 @@ function computeArcFromBulge(startX, startY, endX, endY, bulge) {
   const midY = (startY + endY) / 2;
   const perpX = -chordY / chordLength;
   const perpY = chordX / chordLength;
-  const sign2 = bulge > 0 ? -1 : 1;
-  const centerX = midX + sign2 * perpX * distToCenter;
-  const centerY = midY + sign2 * perpY * distToCenter;
+  const sign = bulge > 0 ? -1 : 1;
+  const centerX = midX + sign * perpX * distToCenter;
+  const centerY = midY + sign * perpY * distToCenter;
   return { centerX, centerY, radius };
 }
 function drawArcFromBulge(ctx, realStartX, realStartY, realEndX, realEndY, bulge, realToCanvasMat) {
@@ -75117,10 +75118,10 @@ function computeArcFromBulge2(startX, startY, endX, endY, bulge) {
   const midY = (startY + endY) / 2;
   const perpX = -chordY / chordLength;
   const perpY = chordX / chordLength;
-  const sign2 = bulge > 0 ? -1 : 1;
+  const sign = bulge > 0 ? -1 : 1;
   return {
-    centerX: midX + sign2 * perpX * distToCenter,
-    centerY: midY + sign2 * perpY * distToCenter,
+    centerX: midX + sign * perpX * distToCenter,
+    centerY: midY + sign * perpY * distToCenter,
     radius
   };
 }
@@ -118347,7 +118348,7 @@ var import_perfect_cli = __toESM2(require_dist2(), 1);
 // lib/getVersion.ts
 import { createRequire as createRequire2 } from "node:module";
 // package.json
-var version = "0.1.1672";
+var version = "0.1.1673";
 var package_default = {
   name: "@tscircuit/cli",
   version,
@@ -118363,7 +118364,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",
@@ -118429,7 +118430,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"
@@ -123266,14 +123267,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) {
@@ -123296,11 +123301,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);
@@ -123314,93 +123319,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 stop2 = ear;
+  let stop2 = 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;
-      stop2 = next.next;
+      ear = next;
+      stop2 = next;
       continue;
     }
     ear = next;
     if (ear === stop2) {
-      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) {
+        stop2 = ear;
+        continue;
       }
+      if (!cured) {
+        ear = cureLocalIntersections(ear, triangles);
+        stop2 = 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;
   }
@@ -123408,19 +123399,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;
@@ -123429,8 +123422,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;
@@ -123438,6 +123431,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++) {
@@ -123445,26 +123439,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);
@@ -123472,9 +123461,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, stop2) {
+  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 !== stop2);
+    blockStop[b] = p;
+    const g = b * 4;
+    blockBBox[g] = minX;
+    blockBBox[g + 1] = minY;
+    blockBBox[g + 2] = maxX;
+    blockBBox[g + 3] = maxY;
+  } while (p !== stop2);
+}
+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 stop2 = blockStop[b];
+  while (stop2.prev.next !== stop2)
+    stop2 = stop2.next;
+  blockStop[b] = stop2;
+  return stop2;
+}
+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;
@@ -123483,98 +123546,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 stop2 = 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 !== stop2);
+  }
   if (!m)
     return null;
-  const stop2 = 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 stop2 = 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 !== stop2);
+      p = p.next;
+    } while (p !== stop2);
+  }
   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);
-}
-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;
-      }
-      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;
+  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 sortNodes(n) {
+  if (n <= 32) {
+    for (let i = 1;i < n; i++) {
+      const node = sortArr[i], z2 = node.z;
+      let j = i - 1;
+      while (j >= 0 && sortArr[j].z > z2) {
+        sortArr[j + 1] = sortArr[j];
+        j--;
       }
-      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 z2 = srcZ[i];
+    const pos = counts[z2 >>> shift & 255]++;
+    dst[pos] = src[i];
+    dstZ[pos] = z2;
+  }
 }
 function zOrder(x, y, minX, minY, invSize) {
   x = (x - minX) * invSize | 0;
@@ -123601,11 +123687,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);
@@ -123613,13 +123697,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))
@@ -123633,15 +123719,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;
 }
@@ -123654,9 +123746,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;
 }
@@ -123692,6 +123785,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 {
@@ -123702,8 +123797,7 @@ function createNode(i, x, y) {
     next: null,
     z: 0,
     prevZ: null,
-    nextZ: null,
-    steiner: false
+    nextZ: null
   };
 }
 function signedArea(data, start, end, dim) {
@@ -130456,12 +130550,12 @@ var filterDiagnosticsByDrcCategory = ({
     ignoredByCategory
   };
 };
-var formatIgnoredDrcCounts = (counts) => [
-  ["netlist", counts.netlist],
-  ["pin_specification", counts.pin_specification],
-  ["placement", counts.placement],
-  ["routing", counts.routing],
-  ["unknown", counts.unknown]
+var formatIgnoredDrcCounts = (counts2) => [
+  ["netlist", counts2.netlist],
+  ["pin_specification", counts2.pin_specification],
+  ["placement", counts2.placement],
+  ["routing", counts2.routing],
+  ["unknown", counts2.unknown]
 ].filter(([, count]) => count > 0).map(([category, count]) => `${category}: ${count}`).join(", ");
 
 // cli/build/build-file.ts
@@ -137680,11 +137774,11 @@ var buildClusters = (components, issues) => {
   return clusters.sort((a, b) => b.severity - a.severity);
 };
 var buildCountsByType = (issues) => {
-  const counts = {};
+  const counts2 = {};
   for (const issue of issues) {
-    counts[issue.type] = (counts[issue.type] ?? 0) + 1;
+    counts2[issue.type] = (counts2[issue.type] ?? 0) + 1;
   }
-  return counts;
+  return counts2;
 };
 var buildComponentStatuses = (components, boardBounds, issues) => components.map((component) => {
   const componentIssues = issues.filter((issue) => issue.componentA === component.name || issue.componentB === component.name);
@@ -162854,7 +162948,7 @@ function Z2(t50, e32, n3, o3) {
 }
 var q3 = { aliceblue: "f0f8ff", antiquewhite: "faebd7", aqua: "00ffff", aquamarine: "7fffd4", azure: "f0ffff", beige: "f5f5dc", bisque: "ffe4c4", black: "000", blanchedalmond: "ffebcd", blue: "0000ff", blueviolet: "8a2be2", brown: "a52a2a", burlywood: "deb887", cadetblue: "5f9ea0", chartreuse: "7fff00", chocolate: "d2691e", coral: "ff7f50", cornflowerblue: "6495ed", cornsilk: "fff8dc", crimson: "dc143c", cyan: "00ffff", darkblue: "00008b", darkcyan: "008b8b", darkgoldenrod: "b8860b", darkgray: "a9a9a9", darkgreen: "006400", darkgrey: "a9a9a9", darkkhaki: "bdb76b", darkmagenta: "8b008b", darkolivegreen: "556b2f", darkorange: "ff8c00", darkorchid: "9932cc", darkred: "8b0000", darksalmon: "e9967a", darkseagreen: "8fbc8f", darkslateblue: "483d8b", darkslategray: "2f4f4f", darkslategrey: "2f4f4f", darkturquoise: "00ced1", darkviolet: "9400d3", deeppink: "ff1493", deepskyblue: "00bfff", dimgray: "696969", dimgrey: "696969", dodgerblue: "1e90ff", firebrick: "b22222", floralwhite: "fffaf0", forestgreen: "228b22", fuchsia: "ff00ff", gainsboro: "dcdcdc", ghostwhite: "f8f8ff", gold: "ffd700", goldenrod: "daa520", gray: "808080", green: "008000", greenyellow: "adff2f", grey: "808080", honeydew: "f0fff0", hotpink: "ff69b4", indianred: "cd5c5c", indigo: "4b0082", ivory: "fffff0", khaki: "f0e68c", lavender: "e6e6fa", lavenderblush: "fff0f5", lawngreen: "7cfc00", lemonchiffon: "fffacd", lightblue: "add8e6", lightcoral: "f08080", lightcyan: "e0ffff", lightgoldenrodyellow: "fafad2", lightgray: "d3d3d3", lightgreen: "90ee90", lightgrey: "d3d3d3", lightpink: "ffb6c1", lightsalmon: "ffa07a", lightseagreen: "20b2aa", lightskyblue: "87cefa", lightslategray: "789", lightslategrey: "789", lightsteelblue: "b0c4de", lightyellow: "ffffe0", lime: "0f0", limegreen: "32cd32", linen: "faf0e6", magenta: "f0f", maroon: "800000", mediumaquamarine: "66cdaa", mediumblue: "0000cd", mediumorchid: "ba55d3", mediumpurple: "9370db", mediumseagreen: "3cb371", mediumslateblue: "7b68ee", mediumspringgreen: "00fa9a", mediumturquoise: "48d1cc", mediumvioletred: "c71585", midnightblue: "191970", mintcream: "f5fffa", mistyrose: "ffe4e1", moccasin: "ffe4b5", navajowhite: "ffdead", navy: "000080", oldlace: "fdf5e6", olive: "808000", olivedrab: "6b8e23", orange: "ffa500", orangered: "ff4500", orchid: "da70d6", palegoldenrod: "eee8aa", palegreen: "98fb98", paleturquoise: "afeeee", palevioletred: "db7093", papayawhip: "ffefd5", peachpuff: "ffdab9", peru: "cd853f", pink: "ffc0cb", plum: "dda0dd", powderblue: "b0e0e6", purple: "800080", rebeccapurple: "639", red: "f00", rosybrown: "bc8f8f", royalblue: "4169e1", saddlebrown: "8b4513", salmon: "fa8072", sandybrown: "f4a460", seagreen: "2e8b57", seashell: "fff5ee", sienna: "a0522d", silver: "c0c0c0", skyblue: "87ceeb", slateblue: "6a5acd", slategray: "708090", slategrey: "708090", snow: "fffafa", springgreen: "00ff7f", steelblue: "4682b4", tan: "d2b48c", teal: "008080", thistle: "d8bfd8", tomato: "ff6347", turquoise: "40e0d0", violet: "ee82ee", wheat: "f5deb3", white: "fff", whitesmoke: "f5f5f5", yellow: "ff0", yellowgreen: "9acd32" };
 var J3 = /^#[a-fA-F0-9]{6}$/;
-var K2 = /^#[a-fA-F0-9]{8}$/;
+var K3 = /^#[a-fA-F0-9]{8}$/;
 var Q3 = /^#[a-fA-F0-9]{3}$/;
 var tt2 = /^#[a-fA-F0-9]{4}$/;
 var et2 = /^rgb\(\s*(\d{1,3})\s*(?:,)?\s*(\d{1,3})\s*(?:,)?\s*(\d{1,3})\s*\)$/i;
@@ -162872,7 +162966,7 @@ function st2(t50) {
   }(t50);
   if (e32.match(J3))
     return { red: parseInt("" + e32[1] + e32[2], 16), green: parseInt("" + e32[3] + e32[4], 16), blue: parseInt("" + e32[5] + e32[6], 16) };
-  if (e32.match(K2)) {
+  if (e32.match(K3)) {
     var n3 = parseFloat((parseInt("" + e32[7] + e32[8], 16) / 255).toFixed(2));
     return { red: parseInt("" + e32[1] + e32[2], 16), green: parseInt("" + e32[3] + e32[4], 16), blue: parseInt("" + e32[5] + e32[6], 16), alpha: n3 };
   }
@@ -233487,24 +233581,24 @@ function parse2(formula) {
   }
   let idx = 0;
   let a3 = 0;
-  let sign2 = readSign();
+  let sign = readSign();
   let number = readNumber();
   if (idx < formula.length && formula.charAt(idx) === "n") {
     idx++;
-    a3 = sign2 * (number !== null && number !== undefined ? number : 1);
+    a3 = sign * (number !== null && number !== undefined ? number : 1);
     skipWhitespace();
     if (idx < formula.length) {
-      sign2 = readSign();
+      sign = readSign();
       skipWhitespace();
       number = readNumber();
     } else {
-      sign2 = number = 0;
+      sign = number = 0;
     }
   }
   if (number === null || idx < formula.length) {
     throw new Error(`n-th rule couldn't be parsed ('${formula}')`);
   }
-  return [a3, sign2 * number];
+  return [a3, sign * number];
   function readSign() {
     if (formula.charAt(idx) === "-") {
       idx++;
@@ -238200,9 +238294,9 @@ var Edge = class {
       let largeArcFlag;
       let sweepFlag = arc2.counterClockwise ? "1" : "0";
       if (Flatten.Utils.EQ(arc2.sweep, 2 * Math.PI)) {
-        let sign2 = arc2.counterClockwise ? 1 : -1;
-        let halfArc1 = new Flatten.Arc(arc2.pc, arc2.r, arc2.startAngle, arc2.startAngle + sign2 * Math.PI, arc2.counterClockwise);
-        let halfArc2 = new Flatten.Arc(arc2.pc, arc2.r, arc2.startAngle + sign2 * Math.PI, arc2.endAngle, arc2.counterClockwise);
+        let sign = arc2.counterClockwise ? 1 : -1;
+        let halfArc1 = new Flatten.Arc(arc2.pc, arc2.r, arc2.startAngle, arc2.startAngle + sign * Math.PI, arc2.counterClockwise);
+        let halfArc2 = new Flatten.Arc(arc2.pc, arc2.r, arc2.startAngle + sign * Math.PI, arc2.endAngle, arc2.counterClockwise);
         largeArcFlag = "0";
         return ` A${halfArc1.r},${halfArc1.r} 0 ${largeArcFlag},${sweepFlag} ${halfArc1.end.x},${halfArc1.end.y}
                     A${halfArc2.r},${halfArc2.r} 0 ${largeArcFlag},${sweepFlag} ${halfArc2.end.x},${halfArc2.end.y}`;
@@ -247445,10 +247539,10 @@ var wlFeatureVec = (adjMatrix, K22, opts = {}) => {
   }
   let colors = (opts.nodeInitialColors ?? Array.from({ length: n3 }, () => "_")).slice();
   const getCounts = (cols) => {
-    const counts = {};
+    const counts2 = {};
     for (const c3 of cols)
-      counts[c3] = (counts[c3] ?? 0) + 1;
-    return counts;
+      counts2[c3] = (counts2[c3] ?? 0) + 1;
+    return counts2;
   };
   const countsArr = [];
   countsArr.push(getCounts(colors));
@@ -248192,11 +248286,11 @@ var SchematicPartitionProcessor = class {
     this.unexploredPins = this.wipPartitions.flatMap((part) => part.pins.map((p3) => ({ ...p3, partitionId: part.partitionId })));
     this.boxSingletonKeys = this.initializeBoxSingletonKeys();
     this.pinConnectionCount = (() => {
-      const counts = {};
+      const counts2 = {};
       for (const pin of this.initialGraph.pins) {
-        counts[`${pin.boxId}:${pin.pinId}`] = this.getNeighbors(pin).length;
+        counts2[`${pin.boxId}:${pin.pinId}`] = this.getNeighbors(pin).length;
       }
-      return counts;
+      return counts2;
     })();
     const netCounts = {};
     for (const p3 of this.initialGraph.pins) {
@@ -250362,19 +250456,19 @@ var getRestrictedCenterLines = (params2) => {
     let entry = chipFacingMap.get(chip.chipId);
     if (!entry) {
       entry = { center: chip.center };
-      const counts = { xPos: 0, xNeg: 0, yPos: 0, yNeg: 0 };
+      const counts2 = { xPos: 0, xNeg: 0, yPos: 0, yNeg: 0 };
       for (const cp2 of chip.pins) {
         const cpFacing = cp2._facingDirection ?? getPinDirection2(cp2, chip);
         if (cpFacing === "x+")
-          counts.xPos++;
+          counts2.xPos++;
         if (cpFacing === "x-")
-          counts.xNeg++;
+          counts2.xNeg++;
         if (cpFacing === "y+")
-          counts.yPos++;
+          counts2.yPos++;
         if (cpFacing === "y-")
-          counts.yNeg++;
+          counts2.yNeg++;
       }
-      entry.counts = counts;
+      entry.counts = counts2;
       chipFacingMap.set(chip.chipId, entry);
     }
     if (facing === "x+")
@@ -250389,8 +250483,8 @@ var getRestrictedCenterLines = (params2) => {
   for (const [chipId, faces] of chipFacingMap) {
     const axes = /* @__PURE__ */ new Set;
     const rcl = { axes };
-    const counts = faces.counts;
-    const anySideHasMultiplePins = !!(counts && (counts.xPos > 1 || counts.xNeg > 1 || counts.yPos > 1 || counts.yNeg > 1));
+    const counts2 = faces.counts;
+    const anySideHasMultiplePins = !!(counts2 && (counts2.xPos > 1 || counts2.xNeg > 1 || counts2.yPos > 1 || counts2.yNeg > 1));
     const skipCenterRestriction = !anySideHasMultiplePins && chipsOfFacingPins.has(chipId);
     if (!skipCenterRestriction) {
       if (faces.hasXPos && faces.hasXNeg) {
@@ -293697,7 +293791,7 @@ function _supportsColor(haveStream, { streamIsTTY, sniffFlags = true } = {}) {
     if (["GITHUB_ACTIONS", "GITEA_ACTIONS", "CIRCLECI"].some((key) => (key in env2))) {
       return 3;
     }
-    if (["TRAVIS", "APPVEYOR", "GITLAB_CI", "BUILDKITE", "DRONE"].some((sign2) => (sign2 in env2)) || env2.CI_NAME === "codeship") {
+    if (["TRAVIS", "APPVEYOR", "GITLAB_CI", "BUILDKITE", "DRONE"].some((sign) => (sign in env2)) || env2.CI_NAME === "codeship") {
       return 1;
     }
     return min;
@@ -312615,21 +312709,26 @@ var Config = Object.freeze({
   ...FuzzyOptions,
   ...AdvancedOptions
 });
+function isWordSeparator(code) {
+  return code >= 9 && code <= 13 || code === 32 || code === 160;
+}
 function norm(weight = 1, mantissa = 3) {
   const cache = /* @__PURE__ */ new Map;
   const m4 = Math.pow(10, mantissa);
   return {
     get(value) {
-      let numTokens = 1;
-      let inSpace = false;
+      let numTokens = 0;
+      let inWord = false;
       for (let i4 = 0;i4 < value.length; i4++)
-        if (value.charCodeAt(i4) === 32) {
-          if (!inSpace) {
+        if (!isWordSeparator(value.charCodeAt(i4))) {
+          if (!inWord) {
             numTokens++;
-            inSpace = true;
+            inWord = true;
           }
         } else
-          inSpace = false;
+          inWord = false;
+      if (numTokens === 0)
+        numTokens = 1;
       if (cache.has(numTokens))
         return cache.get(numTokens);
       const n3 = Math.round(m4 / Math.pow(numTokens, 0.5 * weight)) / m4;
@@ -313020,6 +313119,11 @@ var BitapSearch = class {
     text = isCaseSensitive ? text : text.toLowerCase();
     text = ignoreDiacritics ? stripDiacritics(text) : text;
     if (this.pattern === text) {
+      if (text.length < this.options.minMatchCharLength)
+        return {
+          isMatch: false,
+          score: 1
+        };
       const result2 = {
         isMatch: true,
         score: 0
@@ -313447,33 +313551,31 @@ function computeScore(results, { ignoreFieldNorm = Config.ignoreFieldNorm }) {
   });
 }
 var MaxHeap = class {
-  constructor(limit) {
+  constructor(limit, comparator) {
     this.limit = limit;
     this.heap = [];
+    this.comparator = comparator;
   }
   get size() {
     return this.heap.length;
   }
-  shouldInsert(score) {
-    return this.size < this.limit || score < this.heap[0].score;
-  }
   insert(item) {
     if (this.size < this.limit) {
       this.heap.push(item);
       this._bubbleUp(this.size - 1);
-    } else if (item.score < this.heap[0].score) {
+    } else if (this.comparator(item, this.heap[0]) < 0) {
       this.heap[0] = item;
       this._sinkDown(0);
     }
   }
-  extractSorted(sortFn) {
-    return this.heap.sort(sortFn);
+  extractSorted() {
+    return this.heap.sort(this.comparator);
   }
   _bubbleUp(i4) {
     const heap = this.heap;
     while (i4 > 0) {
       const parent = i4 - 1 >> 1;
-      if (heap[i4].score <= heap[parent].score)
+      if (this.comparator(heap[i4], heap[parent]) <= 0)
         break;
       const tmp = heap[i4];
       heap[i4] = heap[parent];
@@ -313489,9 +313591,9 @@ var MaxHeap = class {
       i4 = largest;
       const left = 2 * i4 + 1;
       const right = 2 * i4 + 2;
-      if (left < len && heap[left].score > heap[largest].score)
+      if (left < len && this.comparator(heap[left], heap[largest]) > 0)
         largest = left;
-      if (right < len && heap[right].score > heap[largest].score)
+      if (right < len && this.comparator(heap[right], heap[largest]) > 0)
         largest = right;
       if (largest !== i4) {
         const tmp = heap[i4];
@@ -313848,6 +313950,9 @@ var Fuse2 = class {
   getIndex() {
     return this._myIndex;
   }
+  _normalizedKeys() {
+    return this._myIndex.keys.map((key) => this._keyStore.get(key.id) || key);
+  }
   search(query, options) {
     const { limit = -1 } = options || {};
     const { includeMatches, includeScore, shouldSort, sortFn, ignoreFieldNorm } = this.options;
@@ -313860,10 +313965,12 @@ var Fuse2 = class {
         docs = docs.slice(0, limit);
       return docs;
     }
-    const useHeap = isNumber2(limit) && limit > 0 && isString2(query);
+    const useHeap = shouldSort && isNumber2(limit) && limit > 0 && isString2(query);
+    const comparator = sortFn;
+    const stable = (a3, b3) => comparator(a3, b3) || a3.idx - b3.idx;
     let results;
     if (useHeap) {
-      const heap = new MaxHeap(limit);
+      const heap = new MaxHeap(limit, stable);
       if (isString2(this._docs[0]))
         this._searchStringList(query, {
           heap,
@@ -313874,12 +313981,12 @@ var Fuse2 = class {
           heap,
           ignoreFieldNorm
         });
-      results = heap.extractSorted(sortFn);
+      results = heap.extractSorted();
     } else {
       results = isString2(query) ? isString2(this._docs[0]) ? this._searchStringList(query) : this._searchObjectList(query) : this._searchLogical(query);
       computeScore(results, { ignoreFieldNorm });
       if (shouldSort)
-        results.sort(sortFn);
+        results.sort(isString2(query) ? stable : comparator);
       if (isNumber2(limit) && limit > -1)
         results = results.slice(0, limit);
     }
@@ -313918,8 +314025,7 @@ var Fuse2 = class {
           };
           if (heap) {
             result.score = computeScoreSingle(result.matches, { ignoreFieldNorm });
-            if (heap.shouldInsert(result.score))
-              heap.insert(result);
+            heap.insert(result);
           } else
             results.push(result);
         }
@@ -313929,13 +314035,14 @@ var Fuse2 = class {
   }
   _searchLogical(query) {
     const expression = parse3(query, this.options);
+    const keys = this._normalizedKeys();
     const evaluate = (node, item, idx) => {
       if (!("children" in node)) {
         const { keyId, searcher } = node;
         let matches;
         if (keyId === null) {
           matches = [];
-          this._myIndex.keys.forEach((key, keyIndex) => {
+          keys.forEach((key, keyIndex) => {
             matches.push(...this._findMatches({
               key,
               value: item[keyIndex],
@@ -313994,7 +314101,8 @@ var Fuse2 = class {
   _searchObjectList(query, { heap, ignoreFieldNorm } = {}) {
     const searcher = this._getSearcher(query);
     const requireAllTokens = this.options.useTokenSearch && this.options.tokenMatch === "all";
-    const { keys, records } = this._myIndex;
+    const { records } = this._myIndex;
+    const keys = this._normalizedKeys();
     const results = heap ? null : [];
     records.forEach(({ $: item, i: idx }) => {
       if (!isDefined(item))
@@ -314025,8 +314133,7 @@ var Fuse2 = class {
         };
         if (heap) {
           result.score = computeScoreSingle(result.matches, { ignoreFieldNorm });
-          if (heap.shouldInsert(result.score))
-            heap.insert(result);
+          heap.insert(result);
         } else
           results.push(result);
       }
@@ -314102,7 +314209,7 @@ var Fuse2 = class {
     return coverage.size === termCount;
   }
 };
-Fuse2.version = "7.4.2";
+Fuse2.version = "7.5.0";
 Fuse2.createIndex = createIndex;
 Fuse2.parseIndex = parseIndex;
 Fuse2.config = Config;