sldeditor 0.9.0 → 0.9.1

package/dist/sldeditor.js

@@ -3,7 +3,7 @@ var tv = (e, t, n) => t in e ? ev(e, t, { enumerable: !0, configurable: !0, writ
 var wt = (e, t, n) => tv(e, typeof t != "symbol" ? t + "" : t, n);
 import { jsxs as j, jsx as m, Fragment as et } from "react/jsx-runtime";
 import * as Se from "react";
-import jt, { forwardRef as Dr, createElement as Ln, useState as ye, useRef as he, useCallback as Kt, useMemo as Rr, useLayoutEffect as sn, useEffect as se, createContext as Fr, useContext as Hr, useId as nv, cloneElement as ov, Fragment as rv } from "react";
+import jt, { forwardRef as Dr, createElement as Ln, useState as ye, useRef as he, useCallback as Kt, useMemo as Rr, useLayoutEffect as sn, useEffect as ae, createContext as Fr, useContext as Hr, useId as nv, cloneElement as ov, Fragment as rv } from "react";
 import { createPortal as Wr } from "react-dom";
 /**
  * @license lucide-react v0.469.0 - ISC
@@ -728,8 +728,8 @@ const no = "-", $v = (e) => {
       continue;
     i.push(k);
     const x = r(g, h);
-    for (let S = 0; S < x.length; ++S) {
-      const I = x[S];
+    for (let T = 0; T < x.length; ++T) {
+      const I = x[T];
       i.push($ + I);
     }
     a = c + (a.length > 0 ? " " + a : a);
@@ -779,7 +779,7 @@ const fe = (e) => {
   // I could also use lookbehind assertion in `lengthUnitRegex` but that isn't supported widely enough.
   Rv.test(e) && !Fv.test(e)
 ), ai = () => !1, Zv = (e) => Hv.test(e), Qv = (e) => Wv.test(e), e2 = () => {
-  const e = fe("colors"), t = fe("spacing"), n = fe("blur"), o = fe("brightness"), r = fe("borderColor"), i = fe("borderRadius"), s = fe("borderSpacing"), a = fe("borderWidth"), l = fe("contrast"), c = fe("grayscale"), d = fe("hueRotate"), u = fe("invert"), f = fe("gap"), p = fe("gradientColorStops"), h = fe("gradientColorStopPositions"), g = fe("inset"), w = fe("margin"), $ = fe("opacity"), k = fe("padding"), x = fe("saturate"), S = fe("scale"), I = fe("sepia"), D = fe("skew"), X = fe("space"), V = fe("translate"), te = () => ["auto", "contain", "none"], le = () => ["auto", "hidden", "clip", "visible", "scroll"], R = () => ["auto", ee, t], W = () => [ee, t], xe = () => ["", Re, Ge], me = () => ["auto", ct, ee], be = () => ["bottom", "center", "left", "left-bottom", "left-top", "right", "right-bottom", "right-top", "top"], ne = () => ["solid", "dashed", "dotted", "double", "none"], re = () => ["normal", "multiply", "screen", "overlay", "darken", "lighten", "color-dodge", "color-burn", "hard-light", "soft-light", "difference", "exclusion", "hue", "saturation", "color", "luminosity"], we = () => ["start", "end", "center", "between", "around", "evenly", "stretch"], ve = () => ["", "0", ee], Ne = () => ["auto", "avoid", "all", "avoid-page", "page", "left", "right", "column"], Ae = () => [ct, ee];
+  const e = fe("colors"), t = fe("spacing"), n = fe("blur"), o = fe("brightness"), r = fe("borderColor"), i = fe("borderRadius"), s = fe("borderSpacing"), a = fe("borderWidth"), l = fe("contrast"), c = fe("grayscale"), d = fe("hueRotate"), u = fe("invert"), f = fe("gap"), p = fe("gradientColorStops"), h = fe("gradientColorStopPositions"), g = fe("inset"), w = fe("margin"), $ = fe("opacity"), k = fe("padding"), x = fe("saturate"), T = fe("scale"), I = fe("sepia"), z = fe("skew"), X = fe("space"), V = fe("translate"), te = () => ["auto", "contain", "none"], se = () => ["auto", "hidden", "clip", "visible", "scroll"], R = () => ["auto", ee, t], W = () => [ee, t], xe = () => ["", Re, Ge], me = () => ["auto", ct, ee], be = () => ["bottom", "center", "left", "left-bottom", "left-top", "right", "right-bottom", "right-top", "top"], ne = () => ["solid", "dashed", "dotted", "double", "none"], re = () => ["normal", "multiply", "screen", "overlay", "darken", "lighten", "color-dodge", "color-burn", "hard-light", "soft-light", "difference", "exclusion", "hue", "saturation", "color", "luminosity"], we = () => ["start", "end", "center", "between", "around", "evenly", "stretch"], ve = () => ["", "0", ee], Ne = () => ["auto", "avoid", "all", "avoid-page", "page", "left", "right", "column"], Ae = () => [ct, ee];
   return {
     cacheSize: 500,
     separator: ":",
@@ -909,21 +909,21 @@ const fe = (e) => {
        * @see https://tailwindcss.com/docs/overflow
        */
       overflow: [{
-        overflow: le()
+        overflow: se()
       }],
       /**
        * Overflow X
        * @see https://tailwindcss.com/docs/overflow
        */
       "overflow-x": [{
-        "overflow-x": le()
+        "overflow-x": se()
       }],
       /**
        * Overflow Y
        * @see https://tailwindcss.com/docs/overflow
        */
       "overflow-y": [{
-        "overflow-y": le()
+        "overflow-y": se()
       }],
       /**
        * Overscroll Behavior
@@ -2417,21 +2417,21 @@ const fe = (e) => {
        * @see https://tailwindcss.com/docs/scale
        */
       scale: [{
-        scale: [S]
+        scale: [T]
       }],
       /**
        * Scale X
        * @see https://tailwindcss.com/docs/scale
        */
       "scale-x": [{
-        "scale-x": [S]
+        "scale-x": [T]
       }],
       /**
        * Scale Y
        * @see https://tailwindcss.com/docs/scale
        */
       "scale-y": [{
-        "scale-y": [S]
+        "scale-y": [T]
       }],
       /**
        * Rotate
@@ -2459,14 +2459,14 @@ const fe = (e) => {
        * @see https://tailwindcss.com/docs/skew
        */
       "skew-x": [{
-        "skew-x": [D]
+        "skew-x": [z]
       }],
       /**
        * Skew Y
        * @see https://tailwindcss.com/docs/skew
        */
       "skew-y": [{
-        "skew-y": [D]
+        "skew-y": [z]
       }],
       /**
        * Transform Origin
@@ -2840,7 +2840,7 @@ function o2({ children: e }) {
     const c = i.current.getBoundingClientRect();
     let d = t.x, u = t.y;
     d + c.width > window.innerWidth - Lt && (d = Math.max(Lt, t.x - c.width)), u + c.height > window.innerHeight - Lt && (u = Math.max(Lt, t.y - c.height)), r({ left: d, top: u });
-  }, [t]), se(() => {
+  }, [t]), ae(() => {
     if (!t.open) return;
     const c = (p) => {
       i.current && !i.current.contains(p.target) && s();
@@ -3318,7 +3318,7 @@ function ui(e, t) {
 function _e(e, t) {
   return di(ui(ln.getState().locale, e), t);
 }
-function ae() {
+function le() {
   const e = ln((t) => t.locale);
   return (t, n) => di(ui(e, t), n);
 }
@@ -3402,41 +3402,41 @@ const Rn = (e) => (t) => {
     var w, $;
     if (!d) return;
     const k = ++a;
-    s = !1, l.forEach((S) => {
+    s = !1, l.forEach((T) => {
       var I;
-      return S((I = o()) != null ? I : p);
+      return T((I = o()) != null ? I : p);
     });
     const x = (($ = i.onRehydrateStorage) == null ? void 0 : $.call(i, (w = o()) != null ? w : p)) || void 0;
-    return Rn(d.getItem.bind(d))(i.name).then((S) => {
-      if (S)
-        if (typeof S.version == "number" && S.version !== i.version) {
+    return Rn(d.getItem.bind(d))(i.name).then((T) => {
+      if (T)
+        if (typeof T.version == "number" && T.version !== i.version) {
           if (i.migrate) {
             const I = i.migrate(
-              S.state,
-              S.version
+              T.state,
+              T.version
             );
-            return I instanceof Promise ? I.then((D) => [!0, D]) : [!0, I];
+            return I instanceof Promise ? I.then((z) => [!0, z]) : [!0, I];
           }
           console.error(
             "State loaded from storage couldn't be migrated since no migrate function was provided"
           );
         } else
-          return [!1, S.state];
+          return [!1, T.state];
       return [!1, void 0];
-    }).then((S) => {
+    }).then((T) => {
       var I;
       if (k !== a)
         return;
-      const [D, X] = S;
+      const [z, X] = T;
       if (h = i.merge(
         X,
         (I = o()) != null ? I : p
-      ), n(h, !0), D)
+      ), n(h, !0), z)
         return u();
     }).then(() => {
-      k === a && (x == null || x(o(), void 0), h = o(), s = !0, c.forEach((S) => S(h)));
-    }).catch((S) => {
-      k === a && (x == null || x(void 0, S));
+      k === a && (x == null || x(o(), void 0), h = o(), s = !0, c.forEach((T) => T(h)));
+    }).catch((T) => {
+      k === a && (x == null || x(void 0, T));
     });
   };
   return r.persist = {
@@ -3613,53 +3613,53 @@ function b2(e) {
       var v;
       return (v = y.layout) == null ? void 0 : v.at;
     }).map((y) => y.id)
-  ), S = new hi();
+  ), T = new hi();
   for (const y of r)
-    S.add(y.ends[0]), S.add(y.ends[1]), S.union(y.ends[0], y.ends[1]);
+    T.add(y.ends[0]), T.add(y.ends[1]), T.union(y.ends[0], y.ends[1]);
   for (const y of t) {
     const v = i.get(y.kind);
     if (v)
-      for (const N of v.terminals) S.add(`${y.id}.${N.id}`);
+      for (const S of v.terminals) T.add(`${y.id}.${S.id}`);
   }
-  for (const y of n) S.add(y.id);
+  for (const y of n) T.add(y.id);
   const I = [];
-  for (const [, y] of S.groups())
+  for (const [, y] of T.groups())
     y.length >= 2 && I.push(y);
-  const D = /* @__PURE__ */ new Map();
+  const z = /* @__PURE__ */ new Map();
   for (const y of I)
-    for (const v of y) D.set(v, [y]);
+    for (const v of y) z.set(v, [y]);
   const X = /* @__PURE__ */ new Map();
   for (const y of I) {
     const v = y.filter($);
     if (v.length !== 0)
-      for (const N of v) {
-        const M = y.filter((_) => _ !== N), E = X.get(N) ?? [];
-        E.push(...M), X.set(N, E);
+      for (const S of v) {
+        const E = y.filter((_) => _ !== S), N = X.get(S) ?? [];
+        N.push(...E), X.set(S, N);
       }
   }
   {
-    const N = (C) => p.has(C) && !!g(C), M = (C) => {
+    const S = (C) => p.has(C) && !!g(C), E = (C) => {
       if ($(C)) return null;
       if (k.has(C)) return C;
-      const T = C.indexOf(".");
-      return T > 0 ? C.slice(0, T) : null;
-    }, E = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Set(), A = (C, T) => {
-      E.has(C) || E.set(C, /* @__PURE__ */ new Set()), E.has(T) || E.set(T, /* @__PURE__ */ new Set()), C !== T && (E.get(C).add(T), E.get(T).add(C));
+      const M = C.indexOf(".");
+      return M > 0 ? C.slice(0, M) : null;
+    }, N = /* @__PURE__ */ new Map(), _ = /* @__PURE__ */ new Set(), A = (C, M) => {
+      N.has(C) || N.set(C, /* @__PURE__ */ new Set()), N.has(M) || N.set(M, /* @__PURE__ */ new Set()), C !== M && (N.get(C).add(M), N.get(M).add(C));
     };
     for (const C of I) {
-      const T = [];
+      const M = [];
       let B = !1;
       for (const H of C) {
         if ($(H)) {
           B = !0;
           continue;
         }
-        const J = M(H);
-        J && T.push(J);
+        const J = E(H);
+        J && M.push(J);
       }
-      const L = [...new Set(T)];
+      const L = [...new Set(M)];
       for (const H of L)
-        E.has(H) || E.set(H, /* @__PURE__ */ new Set()), B && _.add(H);
+        N.has(H) || N.set(H, /* @__PURE__ */ new Set()), B && _.add(H);
       const F = L.filter((H) => k.has(H)), q = L.filter((H) => !k.has(H));
       if (F.length > 0) {
         for (const H of F) for (const J of q) A(H, J);
@@ -3669,32 +3669,32 @@ function b2(e) {
         for (let H = 0; H < q.length; H++)
           for (let J = H + 1; J < q.length; J++) A(q[H], q[J]);
     }
-    const z = (C, T) => {
+    const D = (C, M) => {
       const B = g(C);
       if (!B) return null;
       for (const L of B.terminals) {
         const F = `${C}.${L.id}`;
-        for (const q of D.get(F) ?? [])
-          for (const H of q) if (M(H) === T) return L;
+        for (const q of z.get(F) ?? [])
+          for (const H of q) if (E(H) === M) return L;
       }
       return null;
     }, P = (C) => {
-      const T = (K) => {
+      const M = (K) => {
         var Q;
-        return ((Q = E.get(K)) == null ? void 0 : Q.size) ?? 0;
+        return ((Q = N.get(K)) == null ? void 0 : Q.size) ?? 0;
       }, B = (K) => {
         var Q;
         return ((Q = g(K)) == null ? void 0 : Q.category) ?? "";
       }, L = (K) => {
         const Q = B(K);
-        return Q === "source" ? 0 : Q === "renewable" ? 1 : 2 + Math.min(T(K), 9) / 10;
-      }, F = C.filter(N).sort((K, Q) => L(K) - L(Q) || K.localeCompare(Q))[0];
+        return Q === "source" ? 0 : Q === "renewable" ? 1 : 2 + Math.min(M(K), 9) / 10;
+      }, F = C.filter(S).sort((K, Q) => L(K) - L(Q) || K.localeCompare(Q))[0];
       if (!F) return;
       const q = /* @__PURE__ */ new Map([[F, null]]), H = /* @__PURE__ */ new Map([[F, 0]]), J = /* @__PURE__ */ new Map(), Z = [], G = [F], Y = /* @__PURE__ */ new Set([F]);
       for (; G.length; ) {
         const K = G.shift();
         Z.push(K);
-        for (const Q of [...E.get(K) ?? []].sort((Ee, Me) => Ee.localeCompare(Me)))
+        for (const Q of [...N.get(K) ?? []].sort((Ee, Me) => Ee.localeCompare(Me)))
           Y.has(Q) || (Y.add(Q), q.set(Q, K), H.set(Q, (H.get(K) ?? 0) + 1), J.has(K) || J.set(K, []), J.get(K).push(Q), G.push(Q));
       }
       let U = 0;
@@ -3718,45 +3718,45 @@ function b2(e) {
         let Me = 0;
         const Bt = q.get(K) ?? null;
         if (Bt) {
-          const bt = z(K, Bt);
+          const bt = D(K, Bt);
           bt && (Me = zt(bt.orientation, "n"));
         } else {
-          const bt = (J.get(K) ?? [])[0], Mo = bt ? z(K, bt) : null;
+          const bt = (J.get(K) ?? [])[0], Mo = bt ? D(K, bt) : null;
           Mo && (Me = zt(Mo.orientation, "s"));
         }
         l.set(K, { at: [Q, Ee], rot: Me, mirror: !1 }), u.add(K);
       }
     }, O = /* @__PURE__ */ new Set();
-    for (const C of E.keys()) {
+    for (const C of N.keys()) {
       if (O.has(C)) continue;
-      const T = [], B = [C];
+      const M = [], B = [C];
       for (O.add(C); B.length; ) {
         const L = B.pop();
-        T.push(L);
-        for (const F of E.get(L) ?? []) O.has(F) || (O.add(F), B.push(F));
+        M.push(L);
+        for (const F of N.get(L) ?? []) O.has(F) || (O.add(F), B.push(F));
       }
-      T.length < 2 || T.some((L) => _.has(L)) || T.some((L) => l.has(L) || x.has(L)) || T.some(N) && P(T);
+      M.length < 2 || M.some((L) => _.has(L)) || M.some((L) => l.has(L) || x.has(L)) || M.some(S) && P(M);
     }
   }
   const V = /* @__PURE__ */ new Map();
   for (const y of I) {
     const v = y.filter($);
     if (v.length !== 0)
-      for (const N of y) {
-        if ($(N)) continue;
-        const M = N.indexOf(".");
-        if (M < 0) continue;
-        const E = N.slice(0, M), _ = N.slice(M + 1), A = V.get(E) ?? [];
-        for (const z of v)
-          A.some((P) => P.busId === z && P.pin === _) || A.push({ busId: z, pin: _ });
-        V.set(E, A);
+      for (const S of y) {
+        if ($(S)) continue;
+        const E = S.indexOf(".");
+        if (E < 0) continue;
+        const N = S.slice(0, E), _ = S.slice(E + 1), A = V.get(N) ?? [];
+        for (const D of v)
+          A.some((P) => P.busId === D && P.pin === _) || A.push({ busId: D, pin: _ });
+        V.set(N, A);
       }
   }
-  const te = [], le = /* @__PURE__ */ new Set();
+  const te = [], se = /* @__PURE__ */ new Set();
   for (const [y, v] of V)
-    if (new Set(v.map((M) => M.busId)).size >= 2) {
-      const M = ((_o = i.get(((ko = p.get(y)) == null ? void 0 : ko.kind) ?? "")) == null ? void 0 : _o.category) === "transformer" ? "vertical" : "horizontal";
-      te.push({ elementId: y, attachments: v, orientation: M }), M === "vertical" && le.add(y);
+    if (new Set(v.map((E) => E.busId)).size >= 2) {
+      const E = ((_o = i.get(((ko = p.get(y)) == null ? void 0 : ko.kind) ?? "")) == null ? void 0 : _o.category) === "transformer" ? "vertical" : "horizontal";
+      te.push({ elementId: y, attachments: v, orientation: E }), E === "vertical" && se.add(y);
     }
   const R = /* @__PURE__ */ new Map(), W = (y, v) => {
     y !== v && (R.has(y) || R.set(y, /* @__PURE__ */ new Set()), R.has(v) || R.set(v, /* @__PURE__ */ new Set()), R.get(y).add(v), R.get(v).add(y));
@@ -3766,92 +3766,92 @@ function b2(e) {
   for (const y of t) {
     const v = i.get(y.kind);
     if (!v || v.terminals.length < 2) continue;
-    const N = v.terminals.map(
-      (M) => `${y.id}.${M.id}`
+    const S = v.terminals.map(
+      (E) => `${y.id}.${E.id}`
     );
-    for (let M = 0; M < N.length; M++)
-      for (let E = M + 1; E < N.length; E++)
-        W(N[M], N[E]);
+    for (let E = 0; E < S.length; E++)
+      for (let N = E + 1; N < S.length; N++)
+        W(S[E], S[N]);
   }
   for (const y of t) {
-    if (le.has(y.id)) continue;
+    if (se.has(y.id)) continue;
     const v = i.get(y.kind);
     if (!v || v.category !== "transformer" || v.terminals.length < 2) continue;
-    const N = v.terminals.map(
+    const S = v.terminals.map(
       (_) => `${y.id}.${_.id}`
-    ), M = /* @__PURE__ */ new Map();
-    for (const _ of N) {
+    ), E = /* @__PURE__ */ new Map();
+    for (const _ of S) {
       const A = _.slice(y.id.length + 1);
-      M.set(A, /* @__PURE__ */ new Set());
-      const z = new Set(N.filter((C) => C !== _)), P = /* @__PURE__ */ new Set([_]), O = [_];
+      E.set(A, /* @__PURE__ */ new Set());
+      const D = new Set(S.filter((C) => C !== _)), P = /* @__PURE__ */ new Set([_]), O = [_];
       for (; O.length > 0; ) {
         const C = O.shift();
         if ($(C)) {
-          M.get(A).add(C);
+          E.get(A).add(C);
           continue;
         }
-        const T = R.get(C);
-        if (T)
-          for (const B of T)
-            P.has(B) || z.has(B) || (P.add(B), O.push(B));
+        const M = R.get(C);
+        if (M)
+          for (const B of M)
+            P.has(B) || D.has(B) || (P.add(B), O.push(B));
       }
     }
-    const E = /* @__PURE__ */ new Set();
-    for (const _ of M.values())
-      for (const A of _) E.add(A);
-    if (E.size >= 2) {
+    const N = /* @__PURE__ */ new Set();
+    for (const _ of E.values())
+      for (const A of _) N.add(A);
+    if (N.size >= 2) {
       const _ = [];
-      for (const [A, z] of M)
-        for (const P of z) _.push({ busId: P, pin: A });
-      te.push({ elementId: y.id, attachments: _, orientation: "vertical" }), le.add(y.id);
+      for (const [A, D] of E)
+        for (const P of D) _.push({ busId: P, pin: A });
+      te.push({ elementId: y.id, attachments: _, orientation: "vertical" }), se.add(y.id);
     }
   }
   const xe = (y, v) => {
-    var z;
-    const N = g(v), M = N ? N.terminals.map((P) => `${v}.${P.id}`) : [], E = y, _ = /* @__PURE__ */ new Set([E, ...M]), A = [E];
+    var D;
+    const S = g(v), E = S ? S.terminals.map((P) => `${v}.${P.id}`) : [], N = y, _ = /* @__PURE__ */ new Set([N, ...E]), A = [N];
     for (; A.length > 0; ) {
       const P = A.shift(), O = P.indexOf(".");
       if (O > 0) {
-        const T = P.slice(0, O), B = p.get(T);
+        const M = P.slice(0, O), B = p.get(M);
         if (B) {
-          const L = (z = i.get(B.kind)) == null ? void 0 : z.category;
+          const L = (D = i.get(B.kind)) == null ? void 0 : D.category;
           if (L && Wo.has(L)) return !0;
         }
       }
       const C = R.get(P);
       if (C)
-        for (const T of C)
-          _.has(T) || (_.add(T), A.push(T));
+        for (const M of C)
+          _.has(M) || (_.add(M), A.push(M));
     }
     return !1;
   };
   for (const y of te) {
     if (y.orientation !== "horizontal") continue;
-    const v = new Set(y.attachments.map((M) => M.busId));
-    let N = 0;
-    for (const M of v)
-      xe(M, y.elementId) && N++;
-    N === 1 && (y.orientation = "vertical", le.add(y.elementId));
+    const v = new Set(y.attachments.map((E) => E.busId));
+    let S = 0;
+    for (const E of v)
+      xe(E, y.elementId) && S++;
+    S === 1 && (y.orientation = "vertical", se.add(y.elementId));
   }
   for (const y of t) {
-    if (le.has(y.id) || y.kind !== "breaker") continue;
+    if (se.has(y.id) || y.kind !== "breaker") continue;
     const v = i.get(y.kind);
     if (!v || v.terminals.length !== 2) continue;
-    const N = v.terminals.map(
+    const S = v.terminals.map(
       (_) => `${y.id}.${_.id}`
-    ), M = /* @__PURE__ */ new Map();
-    for (const _ of N) {
-      const A = _.slice(y.id.length + 1), z = new Set(N.filter((C) => C !== _)), P = /* @__PURE__ */ new Set([_]), O = [_];
+    ), E = /* @__PURE__ */ new Map();
+    for (const _ of S) {
+      const A = _.slice(y.id.length + 1), D = new Set(S.filter((C) => C !== _)), P = /* @__PURE__ */ new Set([_]), O = [_];
       for (; O.length > 0; ) {
         const C = O.shift();
         if ($(C)) {
-          M.set(A, C);
+          E.set(A, C);
           break;
         }
-        const T = R.get(C);
-        if (T)
-          for (const B of T) {
-            if (P.has(B) || z.has(B)) continue;
+        const M = R.get(C);
+        if (M)
+          for (const B of M) {
+            if (P.has(B) || D.has(B)) continue;
             const L = B.indexOf(".");
             if (L > 0) {
               const F = B.slice(0, L);
@@ -3864,10 +3864,10 @@ function b2(e) {
           }
       }
     }
-    if (new Set(M.values()).size >= 2) {
+    if (new Set(E.values()).size >= 2) {
       const _ = [];
-      for (const [A, z] of M)
-        _.push({ busId: z, pin: A });
+      for (const [A, D] of E)
+        _.push({ busId: D, pin: A });
       te.push({
         elementId: y.id,
         attachments: _,
@@ -3878,24 +3878,24 @@ function b2(e) {
   const me = /* @__PURE__ */ new Map();
   for (const y of n) me.set(y.id, /* @__PURE__ */ new Map());
   for (const y of te) {
-    const v = Array.from(new Set(y.attachments.map((N) => N.busId)));
-    for (const N of v)
-      for (const M of v)
-        N !== M && (($o = me.get(N)) == null || $o.set(M, y));
+    const v = Array.from(new Set(y.attachments.map((S) => S.busId)));
+    for (const S of v)
+      for (const E of v)
+        S !== E && (($o = me.get(S)) == null || $o.set(E, y));
   }
   const be = (y) => {
-    var N;
-    const v = (N = i.get(y)) == null ? void 0 : N.category;
+    var S;
+    const v = (S = i.get(y)) == null ? void 0 : S.category;
     return v ? Wo.has(v) : !1;
   }, ne = [];
   for (const y of n) {
     const v = X.get(y.id);
     if (v)
-      for (const N of v) {
-        if ($(N)) continue;
-        const M = N.indexOf(".");
-        if (M < 0) continue;
-        const E = N.slice(0, M), _ = p.get(E);
+      for (const S of v) {
+        if ($(S)) continue;
+        const E = S.indexOf(".");
+        if (E < 0) continue;
+        const N = S.slice(0, E), _ = p.get(N);
         if (_ && be(_.kind)) {
           ne.push(y.id);
           break;
@@ -3908,12 +3908,12 @@ function b2(e) {
   {
     const y = [...ne];
     for (; y.length > 0; ) {
-      const v = y.shift(), N = re.get(v), M = me.get(v);
-      if (M)
-        for (const [E, _] of M) {
-          if (re.has(E)) continue;
-          const A = _.orientation === "horizontal" ? N : N + 1;
-          re.set(E, A), y.push(E);
+      const v = y.shift(), S = re.get(v), E = me.get(v);
+      if (E)
+        for (const [N, _] of E) {
+          if (re.has(N)) continue;
+          const A = _.orientation === "horizontal" ? S : S + 1;
+          re.set(N, A), y.push(N);
         }
     }
   }
@@ -3924,23 +3924,23 @@ function b2(e) {
   }
   const we = /* @__PURE__ */ new Map();
   for (const y of n) {
-    const v = re.get(y.id), N = we.get(v) ?? [];
-    N.push(y.id), we.set(v, N);
+    const v = re.get(y.id), S = we.get(v) ?? [];
+    S.push(y.id), we.set(v, S);
   }
-  const ve = [...we.keys()].sort((y, v) => y - v), Ne = (y, v, N) => {
-    const M = `${y.elementId}.${N}`, E = v, _ = g(y.elementId), A = /* @__PURE__ */ new Set();
+  const ve = [...we.keys()].sort((y, v) => y - v), Ne = (y, v, S) => {
+    const E = `${y.elementId}.${S}`, N = v, _ = g(y.elementId), A = /* @__PURE__ */ new Set();
     if (_)
-      for (const T of _.terminals)
-        T.id !== N && A.add(`${y.elementId}.${T.id}`);
-    const z = /* @__PURE__ */ new Set([M]), P = [
-      { ref: M, dist: 0 }
-    ], O = /* @__PURE__ */ new Map(), C = (T, B, L, F) => {
-      z.add(T), O.set(T, B), P.push({ ref: T, dist: F + L });
+      for (const M of _.terminals)
+        M.id !== S && A.add(`${y.elementId}.${M.id}`);
+    const D = /* @__PURE__ */ new Set([E]), P = [
+      { ref: E, dist: 0 }
+    ], O = /* @__PURE__ */ new Map(), C = (M, B, L, F) => {
+      D.add(M), O.set(M, B), P.push({ ref: M, dist: F + L });
     };
     for (; P.length > 0; ) {
-      const { ref: T, dist: B } = P.shift();
-      if (T === E) {
-        const H = O.get(E);
+      const { ref: M, dist: B } = P.shift();
+      if (M === N) {
+        const H = O.get(N);
         let J;
         if (H) {
           const Z = H.indexOf(".");
@@ -3951,120 +3951,120 @@ function b2(e) {
         }
         return { extent: B, head: J };
       }
-      const L = T.indexOf(".");
+      const L = M.indexOf(".");
       if (L < 0)
         continue;
-      const F = T.slice(0, L), q = T.slice(L + 1);
-      if (!$(F) && !le.has(F)) {
+      const F = M.slice(0, L), q = M.slice(L + 1);
+      if (!$(F) && !se.has(F)) {
         const H = g(F), J = H == null ? void 0 : H.terminals.find((Z) => Z.id === q);
         if (H && J)
           for (const Z of H.terminals) {
             if (Z.id === q) continue;
             const G = `${F}.${Z.id}`;
-            z.has(G) || A.has(G) || C(G, T, Math.abs(J.y - Z.y), B);
+            D.has(G) || A.has(G) || C(G, M, Math.abs(J.y - Z.y), B);
           }
       }
-      for (const H of D.get(T) ?? [])
+      for (const H of z.get(M) ?? [])
         for (const J of H) {
-          if (J === T || z.has(J) || A.has(J)) continue;
-          const Z = $(T) || $(J);
-          C(J, T, Z ? Ro : _t, B);
+          if (J === M || D.has(J) || A.has(J)) continue;
+          const Z = $(M) || $(J);
+          C(J, M, Z ? Ro : _t, B);
         }
     }
     return { extent: 0 };
   }, Ae = (y, v) => {
-    var T, B, L;
-    const N = (T = me.get(y)) == null ? void 0 : T.get(v);
-    if (!N || N.orientation === "horizontal") return kt;
-    const M = g(N.elementId);
-    if (!M) return kt;
-    const E = (B = N.attachments.find((F) => F.busId === y)) == null ? void 0 : B.pin, _ = (L = N.attachments.find((F) => F.busId === v)) == null ? void 0 : L.pin;
-    if (!E || !_) return kt;
-    const A = M.terminals.find((F) => F.id === E), z = M.terminals.find((F) => F.id === _);
-    if (!A || !z) return kt;
-    const P = Math.abs(z.y - A.y), O = Ne(N, y, E).extent, C = Ne(N, v, _).extent;
+    var M, B, L;
+    const S = (M = me.get(y)) == null ? void 0 : M.get(v);
+    if (!S || S.orientation === "horizontal") return kt;
+    const E = g(S.elementId);
+    if (!E) return kt;
+    const N = (B = S.attachments.find((F) => F.busId === y)) == null ? void 0 : B.pin, _ = (L = S.attachments.find((F) => F.busId === v)) == null ? void 0 : L.pin;
+    if (!N || !_) return kt;
+    const A = E.terminals.find((F) => F.id === N), D = E.terminals.find((F) => F.id === _);
+    if (!A || !D) return kt;
+    const P = Math.abs(D.y - A.y), O = Ne(S, y, N).extent, C = Ne(S, v, _).extent;
     return O + P + C;
   }, yn = /* @__PURE__ */ new Map();
   for (const y of te) {
     if (y.orientation !== "vertical") continue;
     const v = y.attachments.slice().sort(
-      (z, P) => (re.get(z.busId) ?? 0) - (re.get(P.busId) ?? 0)
+      (D, P) => (re.get(D.busId) ?? 0) - (re.get(P.busId) ?? 0)
     );
     if (v.length < 2) continue;
-    const N = v[0].busId, M = v[1].busId, E = v[0].pin, A = Ne(y, N, E).head ?? y.elementId;
-    yn.set(A, { lowerBusId: M });
+    const S = v[0].busId, E = v[1].busId, N = v[0].pin, A = Ne(y, S, N).head ?? y.elementId;
+    yn.set(A, { lowerBusId: E });
   }
   const lo = 30, co = (y) => {
     const v = g(y);
     return Math.max((v == null ? void 0 : v.width) ?? Ye, Ye);
-  }, qx = 2, uo = (y, v, N, M = 0) => {
-    const E = g(v);
+  }, qx = 2, uo = (y, v, S, E = 0) => {
+    const N = g(v);
     let _ = co(v);
-    if (E && !N.has(v) && M < qx) {
-      N.add(v);
+    if (N && !S.has(v) && E < qx) {
+      S.add(v);
       let A = 0;
-      for (const z of E.terminals) {
-        const P = `${v}.${z.id}`;
+      for (const D of N.terminals) {
+        const P = `${v}.${D.id}`;
         if (P !== y)
-          for (const O of D.get(P) ?? []) {
+          for (const O of z.get(P) ?? []) {
             const C = /* @__PURE__ */ new Set();
-            let T = !1;
+            let M = !1;
             for (const L of O) {
               if (L === P) continue;
               if ($(L)) {
-                T = !0;
+                M = !0;
                 continue;
               }
               const F = L.indexOf(".");
               if (F < 0) continue;
               const q = L.slice(0, F);
-              q === v || N.has(q) || le.has(q) || C.add(q);
+              q === v || S.has(q) || se.has(q) || C.add(q);
             }
-            if (T || C.size === 0) continue;
+            if (M || C.size === 0) continue;
             let B = 0;
             for (const L of C) {
               const F = [...O].find(
                 (q) => q.indexOf(".") > 0 && q.slice(0, q.indexOf(".")) === L
               );
-              B += (F ? uo(F, L, N, M + 1) : co(L)) + lo;
+              B += (F ? uo(F, L, S, E + 1) : co(L)) + lo;
             }
             A = Math.max(A, B - lo);
           }
       }
-      N.delete(v), _ = Math.max(_, A);
+      S.delete(v), _ = Math.max(_, A);
     }
     return _;
   }, pt = 320, ot = /* @__PURE__ */ new Map(), mo = (y, v) => {
-    if (!le.has(y)) return !1;
-    const N = te.find((A) => A.elementId === y), M = N == null ? void 0 : N.attachments.find((A) => A.busId !== v);
-    if (!M) return !1;
-    const E = re.get(v) ?? 0;
-    return (re.get(M.busId) ?? 0) < E;
-  }, gt = (y, v, N) => {
-    const M = yn.get(y);
-    if (M) {
-      const _ = ot.get(M.lowerBusId);
+    if (!se.has(y)) return !1;
+    const S = te.find((A) => A.elementId === y), E = S == null ? void 0 : S.attachments.find((A) => A.busId !== v);
+    if (!E) return !1;
+    const N = re.get(v) ?? 0;
+    return (re.get(E.busId) ?? 0) < N;
+  }, gt = (y, v, S) => {
+    const E = yn.get(y);
+    if (E) {
+      const _ = ot.get(E.lowerBusId);
       if (_ !== void 0)
         return Math.max(v, _ + Ye);
     }
-    let E = 0;
-    return N && (E = uo(N, y, /* @__PURE__ */ new Set())), Math.max(v, Ye, E);
+    let N = 0;
+    return S && (N = uo(S, y, /* @__PURE__ */ new Set())), Math.max(v, Ye, N);
   }, fo = (y, v) => {
     if (ot.has(y)) return ot.get(y);
     if (v.has(y)) return pt;
     v.add(y);
-    const N = X.get(y) ?? [];
-    let M = 0, E = 0;
-    for (const A of N) {
+    const S = X.get(y) ?? [];
+    let E = 0, N = 0;
+    for (const A of S) {
       if ($(A)) continue;
-      const z = A.indexOf(".");
-      if (z < 0) continue;
-      const P = A.slice(0, z), O = A.slice(z + 1);
+      const D = A.indexOf(".");
+      if (D < 0) continue;
+      const P = A.slice(0, D), O = A.slice(D + 1);
       if (mo(P, y)) continue;
       const C = g(P);
       if (!C) continue;
-      const T = C.terminals.find((F) => F.id === O);
-      if (!T) continue;
+      const M = C.terminals.find((F) => F.id === O);
+      if (!M) continue;
       const B = yn.get(P);
       B && fo(B.lowerBusId, v);
       const L = gt(
@@ -4072,39 +4072,39 @@ function b2(e) {
         C.width,
         `${P}.${O}`
       );
-      T.y > 0 ? M += L : E += L;
+      M.y > 0 ? E += L : N += L;
     }
     const _ = Math.max(
       pt,
-      Math.max(M, E) + Ye
+      Math.max(E, N) + Ye
     );
     return ot.set(y, _), v.delete(y), _;
   };
   for (const y of n) fo(y.id, /* @__PURE__ */ new Set());
-  const qe = /* @__PURE__ */ new Map(), Gx = (y, v, N) => {
-    const M = g(v);
-    if (!M) return;
-    const E = `${v}.${N}`, _ = M.terminals.filter((P) => P.id !== N).map((P) => `${v}.${P.id}`);
+  const qe = /* @__PURE__ */ new Map(), Gx = (y, v, S) => {
+    const E = g(v);
+    if (!E) return;
+    const N = `${v}.${S}`, _ = E.terminals.filter((P) => P.id !== S).map((P) => `${v}.${P.id}`);
     if (_.length === 0) return;
-    const A = /* @__PURE__ */ new Set([E, ..._]), z = _.slice();
-    for (; z.length > 0; ) {
-      const P = z.shift();
+    const A = /* @__PURE__ */ new Set([N, ..._]), D = _.slice();
+    for (; D.length > 0; ) {
+      const P = D.shift();
       if ($(P) && P !== y) {
         const C = c.get(P);
         return C ? C.at[0] : void 0;
       }
-      for (const C of D.get(P) ?? [])
-        for (const T of C)
-          T === P || A.has(T) || (A.add(T), z.push(T));
+      for (const C of z.get(P) ?? [])
+        for (const M of C)
+          M === P || A.has(M) || (A.add(M), D.push(M));
       const O = P.indexOf(".");
       if (O > 0) {
         const C = P.slice(0, O);
         if (!$(C)) {
-          const T = g(C);
-          if (T)
-            for (const B of T.terminals) {
+          const M = g(C);
+          if (M)
+            for (const B of M.terminals) {
               const L = `${C}.${B.id}`;
-              A.has(L) || (A.add(L), z.push(L));
+              A.has(L) || (A.add(L), D.push(L));
             }
         }
       }
@@ -4112,13 +4112,13 @@ function b2(e) {
   }, Xx = (y) => {
     const v = X.get(y);
     if (!v || v.length === 0) return;
-    const N = c.get(y);
-    if (!N) return;
-    const M = v.flatMap((T) => {
-      if ($(T)) return [];
-      const B = T.indexOf(".");
+    const S = c.get(y);
+    if (!S) return;
+    const E = v.flatMap((M) => {
+      if ($(M)) return [];
+      const B = M.indexOf(".");
       if (B < 0) return [];
-      const L = T.slice(0, B), F = T.slice(B + 1);
+      const L = M.slice(0, B), F = M.slice(B + 1);
       if (l.has(L)) return [];
       if (mo(L, y)) return [];
       const q = g(L);
@@ -4128,39 +4128,39 @@ function b2(e) {
         elId: L,
         lib: q,
         localTerm: H,
-        isLinker: le.has(L),
+        isLinker: se.has(L),
         busFacingRef: `${L}.${F}`
       }] : [];
     });
-    if (M.length === 0) return;
-    const E = [], _ = [];
-    for (const T of M)
-      T.localTerm.y > 0 ? E.push(T) : _.push(T);
-    const A = (T) => T.reduce(
+    if (E.length === 0) return;
+    const N = [], _ = [];
+    for (const M of E)
+      M.localTerm.y > 0 ? N.push(M) : _.push(M);
+    const A = (M) => M.reduce(
       (B, L) => B + gt(L.elId, L.lib.width, L.busFacingRef),
       0
-    ), z = Math.max(A(E), A(_)) + Ye, P = Math.max(N.span, z);
-    P !== N.span && !f.has(y) && c.set(y, { ...N, span: P });
-    const O = c.get(y), C = (T, B) => {
-      if (T.length === 0) return;
+    ), D = Math.max(A(N), A(_)) + Ye, P = Math.max(S.span, D);
+    P !== S.span && !f.has(y) && c.set(y, { ...S, span: P });
+    const O = c.get(y), C = (M, B) => {
+      if (M.length === 0) return;
       const L = /* @__PURE__ */ new Map();
-      for (const Y of T) {
+      for (const Y of M) {
         const U = Gx(y, Y.elId, Y.localTerm.id);
         U !== void 0 && L.set(Y.elId, U);
       }
-      T.sort((Y, U) => {
+      M.sort((Y, U) => {
         const ce = L.get(Y.elId) ?? O.at[0], ke = L.get(U.elId) ?? O.at[0];
         if (ce !== ke) return ce - ke;
         const K = gt(Y.elId, Y.lib.width, Y.busFacingRef);
         return gt(U.elId, U.lib.width, U.busFacingRef) - K;
       });
-      const F = T.map(
+      const F = M.map(
         (Y) => gt(Y.elId, Y.lib.width, Y.busFacingRef)
-      ), q = F.reduce((Y, U) => Y + U, 0), H = Math.max(P, q), J = (H - q) / (T.length + 1);
+      ), q = F.reduce((Y, U) => Y + U, 0), H = Math.max(P, q), J = (H - q) / (M.length + 1);
       let Z = O.at[0] - H / 2 + J;
       const G = O.at[1] + B * Ro;
-      for (let Y = 0; Y < T.length; Y++) {
-        const U = T[Y], ce = F[Y], ke = Z + ce / 2;
+      for (let Y = 0; Y < M.length; Y++) {
+        const U = M[Y], ce = F[Y], ke = Z + ce / 2;
         U.isLinker ? qe.has(U.elId) || qe.set(U.elId, ke) : l.set(U.elId, {
           at: [pe(ke - U.localTerm.x), pe(G - U.localTerm.y)],
           rot: 0,
@@ -4168,21 +4168,21 @@ function b2(e) {
         }), Z += ce + J;
       }
     };
-    C(E, -1), C(_, 1);
+    C(N, -1), C(_, 1);
   }, Yx = (y) => {
     if (l.has(y.elementId) || y.orientation === "horizontal") return;
     const v = g(y.elementId);
     if (!v) return;
-    const N = y.attachments.filter(
+    const S = y.attachments.filter(
       (Z) => c.has(Z.busId)
     );
-    if (N.length < 2) return;
-    const M = N.slice().sort(
+    if (S.length < 2) return;
+    const E = S.slice().sort(
       (Z, G) => (re.get(Z.busId) ?? 0) - (re.get(G.busId) ?? 0)
-    ), E = M[0].busId, _ = c.get(E), A = M[0].pin, z = M[M.length - 1].pin, P = v.terminals.find((Z) => Z.id === A), O = v.terminals.find((Z) => Z.id === z);
+    ), N = E[0].busId, _ = c.get(N), A = E[0].pin, D = E[E.length - 1].pin, P = v.terminals.find((Z) => Z.id === A), O = v.terminals.find((Z) => Z.id === D);
     if (!P || !O) return;
-    const C = P.y <= O.y ? 0 : 180, T = re.get(E) ?? 0, B = N.filter(
-      (Z) => (re.get(Z.busId) ?? 0) === T
+    const C = P.y <= O.y ? 0 : 180, M = re.get(N) ?? 0, B = S.filter(
+      (Z) => (re.get(Z.busId) ?? 0) === M
     ), L = [];
     let F = 0;
     for (const Z of B) {
@@ -4209,11 +4209,11 @@ function b2(e) {
         q
       );
     }
-  }, Kx = (y, v, N, M) => {
-    const E = /* @__PURE__ */ new Set([y]);
-    let _ = y, A = v, z = N;
+  }, Kx = (y, v, S, E) => {
+    const N = /* @__PURE__ */ new Set([y]);
+    let _ = y, A = v, D = S;
     for (; ; ) {
-      const P = D.get(_) ?? [];
+      const P = z.get(_) ?? [];
       let O, C = !1;
       for (const Q of P) {
         if (Q.length >= 3) {
@@ -4221,7 +4221,7 @@ function b2(e) {
           break;
         }
         const Ee = Q.find((Me) => Me !== _);
-        if (!(!Ee || E.has(Ee))) {
+        if (!(!Ee || N.has(Ee))) {
           if ($(Ee)) {
             C = !0;
             break;
@@ -4231,70 +4231,70 @@ function b2(e) {
         }
       }
       if (C || !O) break;
-      const T = O.indexOf(".");
-      if (T < 0) break;
-      const B = O.slice(0, T), L = O.slice(T + 1);
-      if ($(B) || le.has(B) || l.has(B)) break;
+      const M = O.indexOf(".");
+      if (M < 0) break;
+      const B = O.slice(0, M), L = O.slice(M + 1);
+      if ($(B) || se.has(B) || l.has(B)) break;
       const F = g(B);
       if (!F) break;
       const q = F.terminals.find((Q) => Q.id === L);
       if (!q) break;
-      const H = Lo(z), J = [
+      const H = Lo(D), J = [
         A[0] + H[0] * _t,
         A[1] + H[1] * _t
-      ], Z = Do[z], G = zt(q.orientation, Z), Y = De([q.x, q.y], {
+      ], Z = Do[D], G = zt(q.orientation, Z), Y = De([q.x, q.y], {
         at: [0, 0],
         rot: G,
         mirror: !1
       }), U = [
-        pe(M - Y[0]),
+        pe(E - Y[0]),
         pe(J[1] - Y[1])
       ];
-      l.set(B, { at: U, rot: G, mirror: !1 }), E.add(O);
+      l.set(B, { at: U, rot: G, mirror: !1 }), N.add(O);
       const ce = F.terminals.find((Q) => Q.id !== L);
       if (!ce) break;
       const ke = `${B}.${ce.id}`;
-      E.add(ke);
+      N.add(ke);
       const K = { at: U, rot: G, mirror: !1 };
-      A = De([ce.x, ce.y], K), z = Xt(ce.orientation, K), _ = ke;
+      A = De([ce.x, ce.y], K), D = Xt(ce.orientation, K), _ = ke;
     }
   }, Vx = (y) => {
     if (l.has(y.elementId) || y.orientation !== "horizontal") return;
     const v = g(y.elementId);
     if (!v) return;
-    const N = y.attachments.filter((B) => c.has(B.busId));
-    if (N.length < 2) return;
-    const M = N.map((B) => {
+    const S = y.attachments.filter((B) => c.has(B.busId));
+    if (S.length < 2) return;
+    const E = S.map((B) => {
       const L = Ne(y, B.busId, B.pin), F = L.head ? l.get(L.head) : void 0, q = F ? F.at[0] : c.get(B.busId).at[0];
       return { att: B, x: q, extent: L.extent };
     });
-    M.sort((B, L) => B.x - L.x);
-    const E = M[0], _ = M[M.length - 1], A = v.terminals.find((B) => B.id === E.att.pin), z = v.terminals.find((B) => B.id === _.att.pin);
-    if (!A || !z) return;
-    const P = A.y <= z.y ? 270 : 90, O = (E.x + _.x) / 2, T = c.get(E.att.busId).at[1] + Math.max(E.extent, _.extent);
+    E.sort((B, L) => B.x - L.x);
+    const N = E[0], _ = E[E.length - 1], A = v.terminals.find((B) => B.id === N.att.pin), D = v.terminals.find((B) => B.id === _.att.pin);
+    if (!A || !D) return;
+    const P = A.y <= D.y ? 270 : 90, O = (N.x + _.x) / 2, M = c.get(N.att.busId).at[1] + Math.max(N.extent, _.extent);
     l.set(y.elementId, {
-      at: [pe(O), pe(T)],
+      at: [pe(O), pe(M)],
       rot: P,
       mirror: !1
     });
   }, ho = 100;
   let Ot = Dt;
   for (let y = 0; y < ve.length; y++) {
-    const v = ve[y], N = we.get(v);
-    let M;
+    const v = ve[y], S = we.get(v);
+    let E;
     if (y === 0)
-      M = Dt;
+      E = Dt;
     else {
       const _ = we.get(ve[y - 1]);
       let A = 0;
-      for (const z of _)
-        for (const P of N)
-          (So = me.get(z)) != null && So.get(P) && (A = Math.max(A, Ae(z, P)));
-      A === 0 && (A = kt), M = Ot + A;
-    }
-    Ot = M;
-    let E = $n;
-    for (const _ of N) {
+      for (const D of _)
+        for (const P of S)
+          (So = me.get(D)) != null && So.get(P) && (A = Math.max(A, Ae(D, P)));
+      A === 0 && (A = kt), E = Ot + A;
+    }
+    Ot = E;
+    let N = $n;
+    for (const _ of S) {
       if (c.has(_)) {
         Ot = Math.max(Ot, c.get(_).at[1]);
         continue;
@@ -4303,91 +4303,91 @@ function b2(e) {
       if (y > 0) {
         const P = we.get(ve[y - 1]), O = [];
         for (const C of P) {
-          const T = (No = me.get(C)) == null ? void 0 : No.get(_);
-          if (!T || T.orientation !== "vertical") continue;
-          const B = (Eo = T.attachments.find(
+          const M = (No = me.get(C)) == null ? void 0 : No.get(_);
+          if (!M || M.orientation !== "vertical") continue;
+          const B = (Eo = M.attachments.find(
             (F) => F.busId === C
           )) == null ? void 0 : Eo.pin;
           if (!B) continue;
-          const L = Ne(T, C, B);
-          L.head && l.has(L.head) ? O.push(l.get(L.head).at[0]) : qe.has(T.elementId) ? O.push(qe.get(T.elementId)) : O.push(c.get(C).at[0]);
+          const L = Ne(M, C, B);
+          L.head && l.has(L.head) ? O.push(l.get(L.head).at[0]) : qe.has(M.elementId) ? O.push(qe.get(M.elementId)) : O.push(c.get(C).at[0]);
         }
-        O.length > 0 && (A = O.reduce((C, T) => C + T, 0) / O.length);
+        O.length > 0 && (A = O.reduce((C, M) => C + M, 0) / O.length);
       }
       if (A === void 0) {
         const P = ot.get(_) ?? Sn;
-        A = E + P / 2, E += P + ho;
+        A = N + P / 2, N += P + ho;
       }
-      const z = ot.get(_) ?? Sn;
+      const D = ot.get(_) ?? Sn;
       c.set(_, {
-        at: [pe(A), pe(M)],
+        at: [pe(A), pe(E)],
         rot: 0,
-        span: z,
+        span: D,
         axis: Fn(0)
       });
     }
-    for (const _ of N)
+    for (const _ of S)
       Xx(_);
     if (y > 0)
       for (const _ of te)
         l.has(_.elementId) || !_.attachments.some(
-          (z) => N.includes(z.busId)
+          (D) => S.includes(D.busId)
         ) || Yx(_);
     for (const _ of te)
       _.orientation !== "horizontal" || l.has(_.elementId) || !_.attachments.every(
-        (z) => N.includes(z.busId)
+        (D) => S.includes(D.busId)
       ) || Vx(_);
   }
   if (n.length === 0 && l.size < t.length) {
-    const y = (E) => {
-      const _ = /* @__PURE__ */ new Set(), A = g(E);
+    const y = (N) => {
+      const _ = /* @__PURE__ */ new Set(), A = g(N);
       if (!A) return _;
-      for (const z of A.terminals) {
-        const P = `${E}.${z.id}`;
-        for (const O of D.get(P) ?? [])
+      for (const D of A.terminals) {
+        const P = `${N}.${D.id}`;
+        for (const O of z.get(P) ?? [])
           for (const C of O) {
             if (C === P || $(C)) continue;
-            const T = C.indexOf(".");
-            if (T < 0) continue;
-            const B = C.slice(0, T);
-            B !== E && _.add(B);
+            const M = C.indexOf(".");
+            if (M < 0) continue;
+            const B = C.slice(0, M);
+            B !== N && _.add(B);
           }
       }
       return _;
-    }, v = /* @__PURE__ */ new Set(), N = [];
-    for (const E of t) {
-      if (v.has(E.id) || !g(E.id)) continue;
-      const _ = [], A = [E.id];
-      for (v.add(E.id); A.length > 0; ) {
-        const z = A.pop();
-        _.push(z);
-        for (const P of y(z))
+    }, v = /* @__PURE__ */ new Set(), S = [];
+    for (const N of t) {
+      if (v.has(N.id) || !g(N.id)) continue;
+      const _ = [], A = [N.id];
+      for (v.add(N.id); A.length > 0; ) {
+        const D = A.pop();
+        _.push(D);
+        for (const P of y(D))
           v.has(P) || (v.add(P), A.push(P));
       }
-      _.length >= 2 && N.push(_);
+      _.length >= 2 && S.push(_);
     }
-    let M = $n;
-    for (const E of N) {
-      if (E.some((O) => l.has(O))) continue;
-      E.sort((O, C) => {
+    let E = $n;
+    for (const N of S) {
+      if (N.some((O) => l.has(O))) continue;
+      N.sort((O, C) => {
         var q, H;
-        const T = be(((q = p.get(O)) == null ? void 0 : q.kind) ?? "") ? 0 : 1, B = be(((H = p.get(C)) == null ? void 0 : H.kind) ?? "") ? 0 : 1;
-        if (T !== B) return T - B;
+        const M = be(((q = p.get(O)) == null ? void 0 : q.kind) ?? "") ? 0 : 1, B = be(((H = p.get(C)) == null ? void 0 : H.kind) ?? "") ? 0 : 1;
+        if (M !== B) return M - B;
         const L = y(O).size, F = y(C).size;
         return L !== F ? L - F : O.localeCompare(C);
       });
-      const _ = E[0], A = g(_);
+      const _ = N[0], A = g(_);
       if (!A) continue;
-      const z = A.terminals.slice().sort((O, C) => C.y - O.y)[0], P = z ? De([z.x, z.y], {
+      const D = A.terminals.slice().sort((O, C) => C.y - O.y)[0], P = D ? De([D.x, D.y], {
         at: [0, 0],
         rot: 0,
         mirror: !1
       }) : [0, 0];
       l.set(_, {
-        at: [pe(M - P[0]), pe(Dt - P[1])],
+        at: [pe(E - P[0]), pe(Dt - P[1])],
         rot: 0,
         mirror: !1
-      }), M += Math.max(Sn, E.length * Ye) + ho;
+      }), E += Math.max(Sn, N.length * Ye) + ho;
     }
   }
   const Ux = (y) => {
@@ -4400,7 +4400,7 @@ function b2(e) {
     bn = !1;
     for (const y of I) {
       if (y.length < 2) continue;
-      const v = [], N = /* @__PURE__ */ new Map();
+      const v = [], S = /* @__PURE__ */ new Map();
       for (const G of y) {
         if ($(G))
           continue;
@@ -4411,51 +4411,51 @@ function b2(e) {
           v.push(G);
           continue;
         }
-        if (le.has(U) || N.has(U)) continue;
+        if (se.has(U) || S.has(U)) continue;
         const ke = g(U);
         if (!ke) continue;
         const K = ke.terminals.find((Q) => Q.id === ce);
-        K && N.set(U, {
+        K && S.set(U, {
           ref: G,
           elId: U,
           lib: ke,
           localTerm: K
         });
       }
-      if (N.size === 0 || v.length === 0) continue;
-      const M = [...N.values()], E = /* @__PURE__ */ new Map();
-      for (const G of M)
-        for (const Y of D.get(G.ref) ?? [])
+      if (S.size === 0 || v.length === 0) continue;
+      const E = [...S.values()], N = /* @__PURE__ */ new Map();
+      for (const G of E)
+        for (const Y of z.get(G.ref) ?? [])
           for (const U of Y) {
             if (U === G.ref || $(U) || !Ux(U)) continue;
             const ce = U;
-            E.set(ce, (E.get(ce) ?? 0) + 1);
+            N.set(ce, (N.get(ce) ?? 0) + 1);
           }
       let _;
-      if (E.size > 0) {
+      if (N.size > 0) {
         let G = -1;
-        for (const [Y, U] of E)
+        for (const [Y, U] of N)
           (U > G || U === G && (_ === void 0 || Y < _)) && (G = U, _ = Y);
       }
       if (_ || (_ = [...v].sort()[0]), !_) continue;
-      const A = _.indexOf("."), z = _.slice(0, A), P = _.slice(A + 1), O = g(z), C = l.get(z);
+      const A = _.indexOf("."), D = _.slice(0, A), P = _.slice(A + 1), O = g(D), C = l.get(D);
       if (!O || !C) continue;
-      const T = O.terminals.find((G) => G.id === P);
-      if (!T) continue;
+      const M = O.terminals.find((G) => G.id === P);
+      if (!M) continue;
       const B = De(
-        [T.x, T.y],
+        [M.x, M.y],
         C
       ), L = Xt(
-        T.orientation,
+        M.orientation,
         C
       ), F = Lo(L), q = [-F[1], F[0]];
-      M.sort((G, Y) => G.elId.localeCompare(Y.elId));
-      const H = M.map(
+      E.sort((G, Y) => G.elId.localeCompare(Y.elId));
+      const H = E.map(
         (G) => Math.max(G.lib.width, Ye)
       );
       let Z = -H.reduce((G, Y) => G + Y, 0) / 2;
-      for (let G = 0; G < M.length; G++) {
-        const Y = M[G], U = H[G], ce = Z + U / 2;
+      for (let G = 0; G < E.length; G++) {
+        const Y = E[G], U = H[G], ce = Z + U / 2;
         Z += U;
         const ke = Do[L], K = zt(
           Y.localTerm.orientation,
@@ -4475,98 +4475,98 @@ function b2(e) {
     }
   }
   const yt = (y) => {
-    const v = l.get(y), N = g(y);
-    if (!v || !N) return null;
-    const M = N.viewBox.split(/\s+/).map(Number);
-    if (M.length < 4 || M.some((T) => Number.isNaN(T))) {
-      const T = N.width / 2;
-      return { min: v.at[0] - T, max: v.at[0] + T };
-    }
-    const [E, _, A, z] = M, P = [
-      [E, _],
-      [E + A, _],
-      [E, _ + z],
-      [E + A, _ + z]
+    const v = l.get(y), S = g(y);
+    if (!v || !S) return null;
+    const E = S.viewBox.split(/\s+/).map(Number);
+    if (E.length < 4 || E.some((M) => Number.isNaN(M))) {
+      const M = S.width / 2;
+      return { min: v.at[0] - M, max: v.at[0] + M };
+    }
+    const [N, _, A, D] = E, P = [
+      [N, _],
+      [N + A, _],
+      [N, _ + D],
+      [N + A, _ + D]
     ];
     let O = 1 / 0, C = -1 / 0;
-    for (const T of P) {
-      const B = De(T, v);
+    for (const M of P) {
+      const B = De(M, v);
       O = Math.min(O, B[0]), C = Math.max(C, B[0]);
     }
     return { min: O, max: C };
   }, wn = (y) => {
-    const v = /* @__PURE__ */ new Set(), N = g(y);
-    if (!N) return v;
-    for (const M of N.terminals) {
-      const E = `${y}.${M.id}`;
-      for (const _ of D.get(E) ?? [])
+    const v = /* @__PURE__ */ new Set(), S = g(y);
+    if (!S) return v;
+    for (const E of S.terminals) {
+      const N = `${y}.${E.id}`;
+      for (const _ of z.get(N) ?? [])
         for (const A of _) {
-          if (A === E || $(A)) continue;
-          const z = A.indexOf(".");
-          if (z < 0) continue;
-          const P = A.slice(0, z);
+          if (A === N || $(A)) continue;
+          const D = A.indexOf(".");
+          if (D < 0) continue;
+          const P = A.slice(0, D);
           P !== y && v.add(P);
         }
     }
     return v;
   }, po = 40, xn = (y) => {
-    const v = l.get(y), N = g(y);
-    if (!v || !N) return null;
-    const M = N.viewBox.split(/\s+/).map(Number);
-    if (M.length < 4 || M.some((T) => Number.isNaN(T))) {
-      const T = N.height / 2;
-      return { min: v.at[1] - T, max: v.at[1] + T };
-    }
-    const [E, _, A, z] = M, P = [
-      [E, _],
-      [E + A, _],
-      [E, _ + z],
-      [E + A, _ + z]
+    const v = l.get(y), S = g(y);
+    if (!v || !S) return null;
+    const E = S.viewBox.split(/\s+/).map(Number);
+    if (E.length < 4 || E.some((M) => Number.isNaN(M))) {
+      const M = S.height / 2;
+      return { min: v.at[1] - M, max: v.at[1] + M };
+    }
+    const [N, _, A, D] = E, P = [
+      [N, _],
+      [N + A, _],
+      [N, _ + D],
+      [N + A, _ + D]
     ];
     let O = 1 / 0, C = -1 / 0;
-    for (const T of P) {
-      const B = De(T, v);
+    for (const M of P) {
+      const B = De(M, v);
       O = Math.min(O, B[1]), C = Math.max(C, B[1]);
     }
     return { min: O, max: C };
   }, Zx = (y, v) => {
-    const N = /* @__PURE__ */ new Set(), M = [];
-    for (const E of X.get(y) ?? []) {
-      if ($(E)) continue;
-      const _ = E.indexOf(".");
+    const S = /* @__PURE__ */ new Set(), E = [];
+    for (const N of X.get(y) ?? []) {
+      if ($(N)) continue;
+      const _ = N.indexOf(".");
       if (_ < 0) continue;
-      const A = E.slice(0, _), z = l.get(A);
-      !z || z.at[1] >= v - 1 || N.has(A) || (N.add(A), M.push(A));
+      const A = N.slice(0, _), D = l.get(A);
+      !D || D.at[1] >= v - 1 || S.has(A) || (S.add(A), E.push(A));
     }
-    for (; M.length > 0; ) {
-      const E = M.pop();
-      for (const _ of wn(E)) {
-        if (N.has(_)) continue;
+    for (; E.length > 0; ) {
+      const N = E.pop();
+      for (const _ of wn(N)) {
+        if (S.has(_)) continue;
         const A = l.get(_);
-        !A || A.at[1] >= v - 1 || (N.add(_), M.push(_));
+        !A || A.at[1] >= v - 1 || (S.add(_), E.push(_));
       }
     }
-    return N;
-  }, go = (y, v, N) => {
-    const M = /* @__PURE__ */ new Set([y]), E = [y];
-    for (; E.length > 0; ) {
-      const _ = E.pop();
+    return S;
+  }, go = (y, v, S) => {
+    const E = /* @__PURE__ */ new Set([y]), N = [y];
+    for (; N.length > 0; ) {
+      const _ = N.pop();
       for (const A of wn(_))
-        A === v || M.has(A) || !N.has(A) || (M.add(A), E.push(A));
+        A === v || E.has(A) || !S.has(A) || (E.add(A), N.push(A));
     }
-    return M;
+    return E;
   }, yo = (y, v) => {
-    let N = y.length * y.length + 8, M = !1, E = !0;
-    for (; E && N-- > 0; ) {
-      E = !1;
-      for (let _ = 0; _ < y.length && !E; _++)
+    let S = y.length * y.length + 8, E = !1, N = !0;
+    for (; N && S-- > 0; ) {
+      N = !1;
+      for (let _ = 0; _ < y.length && !N; _++)
         for (let A = _ + 1; A < y.length; A++) {
-          const z = y[_], P = y[A], O = yt(z), C = yt(P), T = xn(z), B = xn(P);
-          if (!O || !C || !T || !B) continue;
-          const L = Math.min(O.max, C.max) - Math.max(O.min, C.min), F = Math.min(T.max, B.max) - Math.max(T.min, B.min);
+          const D = y[_], P = y[A], O = yt(D), C = yt(P), M = xn(D), B = xn(P);
+          if (!O || !C || !M || !B) continue;
+          const L = Math.min(O.max, C.max) - Math.max(O.min, C.min), F = Math.min(M.max, B.max) - Math.max(M.min, B.min);
           if (L <= 0 || F <= 0) continue;
-          const q = go(z, P, v), H = go(P, z, v);
-          if (q.has(P) || H.has(z)) continue;
+          const q = go(D, P, v), H = go(P, D, v);
+          if (q.has(P) || H.has(D)) continue;
           const J = ![...q].some((K) => u.has(K)), Z = ![...H].some((K) => u.has(K));
           if (!J && !Z) continue;
           const G = (O.min + O.max) / 2, Y = (C.min + C.max) / 2;
@@ -4581,33 +4581,33 @@ function b2(e) {
                 at: [Q.at[0] + ke, Q.at[1]]
               });
             }
-            M = !0, E = !0;
+            E = !0, N = !0;
             break;
           }
         }
     }
-    return M;
+    return E;
   };
   for (const y of n) {
     const v = c.get(y.id);
     if (!v) continue;
-    const N = Zx(y.id, v.at[1]);
-    if (N.size < 2) continue;
-    const M = [...N];
-    if (yo(M, N)) {
+    const S = Zx(y.id, v.at[1]);
+    if (S.size < 2) continue;
+    const E = [...S];
+    if (yo(E, S)) {
       let _ = 1 / 0, A = -1 / 0;
-      for (const z of M) {
-        const P = yt(z);
+      for (const D of E) {
+        const P = yt(D);
         P && (_ = Math.min(_, P.min), A = Math.max(A, P.max));
       }
       if (Number.isFinite(_)) {
-        const P = M.some((C) => u.has(C)) ? 0 : pe(v.at[0] - (_ + A) / 2);
+        const P = E.some((C) => u.has(C)) ? 0 : pe(v.at[0] - (_ + A) / 2);
         if (P !== 0)
-          for (const C of M) {
-            const T = l.get(C);
-            T && l.set(C, {
-              ...T,
-              at: [T.at[0] + P, T.at[1]]
+          for (const C of E) {
+            const M = l.get(C);
+            M && l.set(C, {
+              ...M,
+              at: [M.at[0] + P, M.at[1]]
             });
           }
         const O = A - _ + po;
@@ -4619,14 +4619,14 @@ function b2(e) {
     }
   }
   const bo = () => {
-    const v = t.map((M) => M.id).filter((M) => l.has(M)).map((M) => ({ x: yt(M), y: xn(M) })).filter((M) => M.x && M.y);
-    let N = 0;
-    for (let M = 0; M < v.length; M++)
-      for (let E = M + 1; E < v.length; E++) {
-        const _ = Math.min(v[M].x.max, v[E].x.max) - Math.max(v[M].x.min, v[E].x.min), A = Math.min(v[M].y.max, v[E].y.max) - Math.max(v[M].y.min, v[E].y.min);
-        _ > 1 && A > 1 && N++;
+    const v = t.map((E) => E.id).filter((E) => l.has(E)).map((E) => ({ x: yt(E), y: xn(E) })).filter((E) => E.x && E.y);
+    let S = 0;
+    for (let E = 0; E < v.length; E++)
+      for (let N = E + 1; N < v.length; N++) {
+        const _ = Math.min(v[E].x.max, v[N].x.max) - Math.max(v[E].x.min, v[N].x.min), A = Math.min(v[E].y.max, v[N].y.max) - Math.max(v[E].y.min, v[N].y.min);
+        _ > 1 && A > 1 && S++;
       }
-    return N;
+    return S;
   }, Qx = bo(), wo = /* @__PURE__ */ new Map();
   for (const [y, v] of l) wo.set(y, { ...v, at: [...v.at] });
   const xo = /* @__PURE__ */ new Map();
@@ -4634,62 +4634,62 @@ function b2(e) {
     xo.set(y, { ...v, at: [...v.at] });
   const vn = 120, vo = /* @__PURE__ */ new Map();
   {
-    const y = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), N = [];
-    for (const E of n)
-      for (const _ of X.get(E.id) ?? []) {
+    const y = /* @__PURE__ */ new Map(), v = /* @__PURE__ */ new Map(), S = [];
+    for (const N of n)
+      for (const _ of X.get(N.id) ?? []) {
         if ($(_)) continue;
         const A = _.indexOf(".");
         if (A < 0) continue;
-        const z = _.slice(0, A);
-        l.has(z) && N.push({ el: z, bus: E.id, d: 1 });
+        const D = _.slice(0, A);
+        l.has(D) && S.push({ el: D, bus: N.id, d: 1 });
       }
-    N.sort((E, _) => E.d - _.d);
-    let M = 0;
-    for (; M < N.length; ) {
-      const { el: E, bus: _, d: A } = N[M++], z = y.get(E);
-      if (z === void 0)
-        y.set(E, A), v.set(E, _);
-      else if (A === z && v.get(E) !== _) {
-        v.set(E, null);
+    S.sort((N, _) => N.d - _.d);
+    let E = 0;
+    for (; E < S.length; ) {
+      const { el: N, bus: _, d: A } = S[E++], D = y.get(N);
+      if (D === void 0)
+        y.set(N, A), v.set(N, _);
+      else if (A === D && v.get(N) !== _) {
+        v.set(N, null);
         continue;
       } else
         continue;
-      for (const P of wn(E))
-        l.has(P) && (y.has(P) || N.push({ el: P, bus: _, d: A + 1 }));
+      for (const P of wn(N))
+        l.has(P) && (y.has(P) || S.push({ el: P, bus: _, d: A + 1 }));
     }
-    for (const [E, _] of v) _ && vo.set(E, _);
+    for (const [N, _] of v) _ && vo.set(N, _);
   }
   for (const y of ve) {
     const v = (we.get(y) ?? []).filter(
       (O) => c.has(O)
     );
     if (v.length < 2 || v.some((O) => f.has(O))) continue;
-    const N = [];
-    let M = 0;
+    const S = [];
+    let E = 0;
     for (const O of v) {
-      const C = c.get(O), T = [];
+      const C = c.get(O), M = [];
       let B = 1 / 0, L = -1 / 0;
       for (const [F, q] of vo) {
         if (q !== O) continue;
         const H = yt(F);
-        H && (T.push(F), B = Math.min(B, H.min), L = Math.max(L, H.max));
+        H && (M.push(F), B = Math.min(B, H.min), L = Math.max(L, H.max));
       }
-      Number.isFinite(B) || (B = C.at[0] - pt / 2, L = C.at[0] + pt / 2), N.push({ busId: O, min: B, max: L, members: T }), M += L - B;
+      Number.isFinite(B) || (B = C.at[0] - pt / 2, L = C.at[0] + pt / 2), S.push({ busId: O, min: B, max: L, members: M }), E += L - B;
     }
-    if (N.some((O) => O.members.some((C) => u.has(C))))
+    if (S.some((O) => O.members.some((C) => u.has(C))))
       continue;
-    let E = 1 / 0, _ = -1 / 0;
-    for (const O of N)
-      E = Math.min(E, O.min), _ = Math.max(_, O.max);
-    const A = _ - E, z = M + vn * (N.length - 1);
-    if (!(A > z + vn)) continue;
-    N.sort((O, C) => (O.min + O.max) / 2 - (C.min + C.max) / 2);
-    let P = E;
-    for (const O of N) {
+    let N = 1 / 0, _ = -1 / 0;
+    for (const O of S)
+      N = Math.min(N, O.min), _ = Math.max(_, O.max);
+    const A = _ - N, D = E + vn * (S.length - 1);
+    if (!(A > D + vn)) continue;
+    S.sort((O, C) => (O.min + O.max) / 2 - (C.min + C.max) / 2);
+    let P = N;
+    for (const O of S) {
       const C = pe(P - O.min);
       if (C !== 0) {
-        const T = c.get(O.busId);
-        c.set(O.busId, { ...T, at: [T.at[0] + C, T.at[1]] });
+        const M = c.get(O.busId);
+        c.set(O.busId, { ...M, at: [M.at[0] + C, M.at[1]] });
         for (const B of O.members) {
           const L = l.get(B);
           L && l.set(B, { ...L, at: [L.at[0] + C, L.at[1]] });
@@ -4698,13 +4698,13 @@ function b2(e) {
       }
       P = O.max + vn;
     }
-    for (const O of N) {
-      const C = c.get(O.busId), T = Math.max(pt, O.max - O.min);
-      T < C.span && c.set(O.busId, { ...C, span: T });
+    for (const O of S) {
+      const C = c.get(O.busId), M = Math.max(pt, O.max - O.min);
+      M < C.span && c.set(O.busId, { ...C, span: M });
     }
   }
   {
-    const y = t.map((N) => N.id).filter((N) => l.has(N)), v = new Set(y);
+    const y = t.map((S) => S.id).filter((S) => l.has(S)), v = new Set(y);
     yo(y, v);
   }
   if (bo() > Qx) {
@@ -4716,11 +4716,11 @@ function b2(e) {
   let kn = 0;
   for (const y of t) {
     if (l.has(y.id)) continue;
-    const v = kn % Ho, N = Math.floor(kn / Ho);
+    const v = kn % Ho, S = Math.floor(kn / Ho);
     l.set(y.id, {
       at: [
         pe(h2 + v * g2),
-        pe(p2 + N * y2)
+        pe(p2 + S * y2)
       ],
       rot: 0,
       mirror: !1
@@ -7085,13 +7085,13 @@ const z$ = 320;
 function Ze(e) {
   var h, g, w, $, k;
   const t = d2(), n = /* @__PURE__ */ new Map();
-  e.elements.forEach((x, S) => {
+  e.elements.forEach((x, T) => {
     if (n.has(x.id)) {
       t.diagnostics.push({
         code: "E001",
         severity: "error",
         message: _e("compile.duplicateId", { id: x.id }),
-        pointer: `/elements/${S}`
+        pointer: `/elements/${T}`
       });
       return;
     }
@@ -7101,17 +7101,17 @@ function Ze(e) {
       code: "E003",
       severity: "error",
       message: `${_e("compile.unknownKind", { kind: x.kind })} (id=${x.id})`,
-      pointer: `/elements/${S}`
+      pointer: `/elements/${T}`
     }), t.elements.set(x.id, { element: x, libraryDef: I });
   });
   const o = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map();
-  (e.buses ?? []).forEach((x, S) => {
+  (e.buses ?? []).forEach((x, T) => {
     if (n.has(x.id) || o.has(x.id)) {
       t.diagnostics.push({
         code: "E001",
         severity: "error",
         message: _e("compile.duplicateId", { id: x.id }),
-        pointer: `/buses/${S}`
+        pointer: `/buses/${T}`
       });
       return;
     }
@@ -7126,19 +7126,19 @@ function Ze(e) {
     }
   });
   const i = /* @__PURE__ */ new Map();
-  (e.junctions ?? []).forEach((x, S) => {
+  (e.junctions ?? []).forEach((x, T) => {
     if (n.has(x.id) || o.has(x.id) || i.has(x.id)) {
       t.diagnostics.push({
         code: "E001",
         severity: "error",
         message: _e("compile.duplicateId", { id: x.id }),
-        pointer: `/junctions/${S}`
+        pointer: `/junctions/${T}`
       });
       return;
     }
     i.set(x.id, x);
   });
-  const s = (x) => !x.includes(".") && o.has(x), a = (x) => !x.includes(".") && i.has(x), l = (x, S) => {
+  const s = (x) => !x.includes(".") && o.has(x), a = (x) => !x.includes(".") && i.has(x), l = (x, T) => {
     if (s(x) || a(x)) return !0;
     const I = x.indexOf(".");
     if (I <= 0)
@@ -7146,41 +7146,41 @@ function Ze(e) {
         code: "E003",
         severity: "error",
         message: _e("compile.invalidTermRef", { ref: x }),
-        pointer: S
+        pointer: T
       }), !1;
-    const D = x.slice(0, I), X = x.slice(I + 1), V = t.elements.get(D);
+    const z = x.slice(0, I), X = x.slice(I + 1), V = t.elements.get(z);
     if (!V)
       return t.diagnostics.push({
         code: "E002",
         severity: "error",
-        message: _e("compile.elementMissing", { id: D }),
-        pointer: S
+        message: _e("compile.elementMissing", { id: z }),
+        pointer: T
       }), !1;
     if (!V.libraryDef) return !1;
     if (!V.libraryDef.terminals.find((te) => te.id === X)) {
-      const te = V.libraryDef.terminals.map((le) => le.id).join(", ");
+      const te = V.libraryDef.terminals.map((se) => se.id).join(", ");
       return t.diagnostics.push({
         code: "E003",
         severity: "error",
         message: _e("compile.missingPin", {
-          id: D,
+          id: z,
           kind: V.element.kind,
           pin: X,
           available: te
         }),
-        pointer: S
+        pointer: T
       }), !1;
     }
     return !0;
   }, c = [];
-  (e.wires ?? []).forEach((x, S) => {
-    const I = `/wires/${S}`, D = l(x.ends[0], I), X = l(x.ends[1], I);
-    D && X && c.push(x);
+  (e.wires ?? []).forEach((x, T) => {
+    const I = `/wires/${T}`, z = l(x.ends[0], I), X = l(x.ends[1], I);
+    z && X && c.push(x);
   });
   const d = /* @__PURE__ */ new Map();
   if (e.layout)
-    for (const [x, S] of Object.entries(e.layout))
-      t.elements.has(x) ? d.set(x, u2(S)) : t.diagnostics.push({
+    for (const [x, T] of Object.entries(e.layout))
+      t.elements.has(x) ? d.set(x, u2(T)) : t.diagnostics.push({
         code: "E004",
         severity: "error",
         message: _e("compile.layoutMissingElement", { id: x }),
@@ -7196,31 +7196,31 @@ function Ze(e) {
     userBusLayout: r
   });
   t.layout = u.devices;
-  for (const [x, S] of u.buses) {
+  for (const [x, T] of u.buses) {
     const I = o.get(x);
-    I && t.buses.set(x, { bus: I, geometry: S });
+    I && t.buses.set(x, { bus: I, geometry: T });
   }
-  for (const [x, S] of o)
+  for (const [x, T] of o)
     t.buses.has(x) || t.buses.set(x, {
-      bus: S,
+      bus: T,
       geometry: {
-        at: ((h = S.layout) == null ? void 0 : h.at) ?? [0, 0],
-        span: ((g = S.layout) == null ? void 0 : g.span) ?? z$,
-        rot: ((w = S.layout) == null ? void 0 : w.rot) ?? 0,
-        axis: Fn((($ = S.layout) == null ? void 0 : $.rot) ?? 0)
+        at: ((h = T.layout) == null ? void 0 : h.at) ?? [0, 0],
+        span: ((g = T.layout) == null ? void 0 : g.span) ?? z$,
+        rot: ((w = T.layout) == null ? void 0 : w.rot) ?? 0,
+        axis: Fn((($ = T.layout) == null ? void 0 : $.rot) ?? 0)
       }
     });
   for (const x of t.elements.values()) {
     if (!x.libraryDef) continue;
-    const S = t.layout.get(x.element.id);
-    if (!S) continue;
+    const T = t.layout.get(x.element.id);
+    if (!T) continue;
     const I = [];
-    for (const D of x.libraryDef.terminals) {
-      const X = `${x.element.id}.${D.id}`, V = De([D.x, D.y], S), te = Xt(D.orientation, S);
+    for (const z of x.libraryDef.terminals) {
+      const X = `${x.element.id}.${z.id}`, V = De([z.x, z.y], T), te = Xt(z.orientation, T);
       t.terminals.set(X, {
         ref: X,
         elementId: x.element.id,
-        pin: D.id,
+        pin: z.id,
         world: V,
         orientation: te
       }), I.push(X);
@@ -7232,42 +7232,42 @@ function Ze(e) {
       const I = t.buses.get(x);
       return I ? I.geometry.at : null;
     }
-    const S = t.terminals.get(x);
-    return S ? S.world : null;
+    const T = t.terminals.get(x);
+    return T ? T.world : null;
   };
-  for (const [x, S] of i) {
+  for (const [x, T] of i) {
     let I;
-    if ((k = S.layout) != null && k.at)
-      I = [S.layout.at[0], S.layout.at[1]];
+    if ((k = T.layout) != null && k.at)
+      I = [T.layout.at[0], T.layout.at[1]];
     else if (u.junctions.has(x))
       I = u.junctions.get(x);
     else {
-      const D = [];
+      const z = [];
       for (const X of c) {
-        const [V, te] = X.ends, le = V === x ? te : te === x ? V : null;
-        if (le === null) continue;
-        const R = f(le);
-        R && D.push(R);
+        const [V, te] = X.ends, se = V === x ? te : te === x ? V : null;
+        if (se === null) continue;
+        const R = f(se);
+        R && z.push(R);
       }
-      I = D.length ? [
-        D.reduce((X, V) => X + V[0], 0) / D.length,
-        D.reduce((X, V) => X + V[1], 0) / D.length
+      I = z.length ? [
+        z.reduce((X, V) => X + V[0], 0) / z.length,
+        z.reduce((X, V) => X + V[1], 0) / z.length
       ] : [0, 0];
     }
-    t.junctions.set(x, { junction: S, world: I });
+    t.junctions.set(x, { junction: T, world: I });
   }
   const p = new hi();
   for (const x of c)
     p.add(x.ends[0]), p.add(x.ends[1]), p.union(x.ends[0], x.ends[1]);
   for (const [, x] of p.groups()) {
-    const S = L$(x);
-    t.nodes.set(S, { id: S, terminals: x });
-    for (const I of x) t.terminalToNode.set(I, S);
+    const T = L$(x);
+    t.nodes.set(T, { id: T, terminals: x });
+    for (const I of x) t.terminalToNode.set(I, T);
   }
   for (const x of t.elements.values()) {
-    const S = t.elementToTerminals.get(x.element.id) ?? [];
-    if (S.length === 0) continue;
-    S.some((D) => t.terminalToNode.has(D)) || t.diagnostics.push({
+    const T = t.elementToTerminals.get(x.element.id) ?? [];
+    if (T.length === 0) continue;
+    T.some((z) => t.terminalToNode.has(z)) || t.diagnostics.push({
       code: "W001",
       severity: "warning",
       message: _e("compile.elementUnconnected", { id: x.element.id })
@@ -7287,21 +7287,21 @@ function Ze(e) {
     });
   for (const x of c) {
     if (x.path && x.path.length >= 2) {
-      const I = x.path, D = I.length >= 2 ? I[1] : null, X = I.length >= 2 ? I[I.length - 2] : null, V = Go(x.ends[0], D, t), te = Go(x.ends[1], X, t);
+      const I = x.path, z = I.length >= 2 ? I[1] : null, X = I.length >= 2 ? I[I.length - 2] : null, V = Go(x.ends[0], z, t), te = Go(x.ends[1], X, t);
       if (V && te) {
-        const le = [
+        const se = [
           [V[0], V[1]],
           ...I.slice(1, -1).map((W) => [W[0], W[1]]),
           [te[0], te[1]]
-        ], R = fi(le);
+        ], R = fi(se);
         if (R.length >= 2) {
           t.wireRenders.set(x.id, { wireId: x.id, path: R, userEdited: !0 });
           continue;
         }
       }
     }
-    const S = w2(x, t);
-    S && t.wireRenders.set(x.id, S);
+    const T = w2(x, t);
+    T && t.wireRenders.set(x.id, T);
   }
   return t;
 }
@@ -7632,10 +7632,10 @@ const b = an()(
           }), p = n.buses.map((k) => {
             const x = structuredClone(k);
             x.id = l.get(k.id);
-            const S = n.busLayouts[k.id];
-            return S && (x.layout = {
-              ...S,
-              at: [S.at[0] + s, S.at[1] + a]
+            const T = n.busLayouts[k.id];
+            return T && (x.layout = {
+              ...T,
+              at: [T.at[0] + s, T.at[1] + a]
             }), x;
           }), h = n.junctions.map((k) => {
             const x = structuredClone(k);
@@ -7644,10 +7644,10 @@ const b = an()(
             }), x;
           }), g = { ...u.layout ?? {} };
           for (const [k, x] of l) {
-            const S = n.placements[k];
-            S && (g[x] = {
-              ...S,
-              at: [S.at[0] + s, S.at[1] + a]
+            const T = n.placements[k];
+            T && (g[x] = {
+              ...T,
+              at: [T.at[0] + s, T.at[1] + a]
             });
           }
           const w = n.wires.map((k) => {
@@ -7995,9 +7995,9 @@ const b = an()(
             if ("junctionAt" in h) return l(h.junctionAt);
             const g = (i.wires ?? []).find((x) => x.id === h.onWire), w = l(h.at);
             if (!g) return w;
-            const $ = (i.wires ?? []).filter((x) => x.id !== h.onWire), k = (x, S) => ({
-              id: lt(x, S),
-              ends: [x, S]
+            const $ = (i.wires ?? []).filter((x) => x.id !== h.onWire), k = (x, T) => ({
+              id: lt(x, T),
+              ends: [x, T]
             });
             return i = {
               ...i,
@@ -8251,14 +8251,14 @@ function V$(e, t, n) {
     ue(f[1] - u.y)
   ], h = Jt(i, e);
   return r.dispatch((g) => {
-    const w = { id: h, kind: e }, $ = { at: p }, k = `${h}.${u.id}`, x = s.isBus && s.busId ? s.busId : t, S = {
+    const w = { id: h, kind: e }, $ = { at: p }, k = `${h}.${u.id}`, x = s.isBus && s.busId ? s.busId : t, T = {
       id: lt(x, k),
       ends: [x, k]
     };
     return {
       ...g,
       elements: [...g.elements, w],
-      wires: [...g.wires ?? [], S],
+      wires: [...g.wires ?? [], T],
       layout: { ...g.layout ?? {}, [h]: $ }
     };
   }), r.setSelection([h]), { newElementId: h, attachedToBus: s.isBus };
@@ -8353,7 +8353,7 @@ function Z$({
   anchor: o
 }) {
   const r = he(null);
-  se(() => {
+  ae(() => {
     const l = r.current;
     if (!l) return;
     l.focus();
@@ -8486,7 +8486,7 @@ function eS({
 }
 function tS({ ann: e }) {
   const t = he(null), n = e.fontSize ?? ux;
-  se(() => {
+  ae(() => {
     const a = t.current;
     if (!a) return;
     a.focus();
@@ -8694,17 +8694,17 @@ function iS({
     if (!g || h.pointerId !== g.pointerId || !r) return;
     const w = r.screenToSvg(h.clientX, h.clientY), $ = g.startPath, k = g.index;
     if (k <= 0 || k >= $.length - 1) return;
-    const x = $[k], S = [
+    const x = $[k], T = [
       g.xLocked ? x[0] : ue(x[0] + (w[0] - g.startSvg[0])),
       g.yLocked ? x[1] : ue(x[1] + (w[1] - g.startSvg[1]))
     ];
-    if (S[0] === x[0] && S[1] === x[1]) return;
+    if (T[0] === x[0] && T[1] === x[1]) return;
     const I = $.map((V) => [V[0], V[1]]);
-    I[k] = S;
-    const D = Mt($[k - 1], $[k]);
-    k - 1 > 0 && (D === "h" ? I[k - 1] = [$[k - 1][0], S[1]] : I[k - 1] = [S[0], $[k - 1][1]]);
+    I[k] = T;
+    const z = Mt($[k - 1], $[k]);
+    k - 1 > 0 && (z === "h" ? I[k - 1] = [$[k - 1][0], T[1]] : I[k - 1] = [T[0], $[k - 1][1]]);
     const X = Mt($[k], $[k + 1]);
-    k + 1 < $.length - 1 && (X === "h" ? I[k + 1] = [$[k + 1][0], S[1]] : I[k + 1] = [S[0], $[k + 1][1]]), b.getState().updateWirePath(e, I);
+    k + 1 < $.length - 1 && (X === "h" ? I[k + 1] = [$[k + 1][0], T[1]] : I[k + 1] = [T[0], $[k + 1][1]]), b.getState().updateWirePath(e, I);
   }, f = (h) => {
     const g = i.current;
     !g || h.pointerId !== g.pointerId || (h.target.hasPointerCapture(h.pointerId) && h.target.releasePointerCapture(h.pointerId), i.current = null, document.body.style.cursor = "");
@@ -8756,16 +8756,16 @@ function sS({
     if (!g || h.pointerId !== g.pointerId || !o) return;
     const w = o.screenToSvg(h.clientX, h.clientY), $ = g.startPath, k = g.segIndex;
     if (k >= $.length - 1) return;
-    const x = $[k], S = $[k + 1], I = [];
-    for (let D = 0; D <= k; D++) I.push($[D]);
+    const x = $[k], T = $[k + 1], I = [];
+    for (let z = 0; z <= k; z++) I.push($[z]);
     if (g.axis === "h") {
-      const D = ue(x[1] + (w[1] - g.startSvg[1]));
-      I.push([x[0], D]), I.push([S[0], D]);
+      const z = ue(x[1] + (w[1] - g.startSvg[1]));
+      I.push([x[0], z]), I.push([T[0], z]);
     } else {
-      const D = ue(x[0] + (w[0] - g.startSvg[0]));
-      I.push([D, x[1]]), I.push([D, S[1]]);
+      const z = ue(x[0] + (w[0] - g.startSvg[0]));
+      I.push([z, x[1]]), I.push([z, T[1]]);
     }
-    for (let D = k + 1; D < $.length; D++) I.push($[D]);
+    for (let z = k + 1; z < $.length; z++) I.push($[z]);
     b.getState().updateWirePath(e, I);
   }, p = (h) => {
     const g = r.current;
@@ -8815,7 +8815,7 @@ function lS() {
         !l.includes(".") && e.has(l) && s.add(l);
   }
   return /* @__PURE__ */ m("g", { className: "ole-bus-layer", children: Array.from(e.values()).map(({ bus: a, geometry: l }) => {
-    const { axis: c, at: d, span: u } = l, f = u / 2, p = c === "x" ? d[0] - f : d[0], h = c === "x" ? d[1] : d[1] - f, g = c === "x" ? d[0] + f : d[0], w = c === "x" ? d[1] : d[1] + f, $ = i.has(a.id), k = s.has(a.id), x = r.get(a.id) ?? void 0, S = An / 2, I = c === "x" ? d[0] - f : d[0] - S, D = c === "x" ? d[1] - S : d[1] - f, X = c === "x" ? u : An, V = c === "x" ? An : u;
+    const { axis: c, at: d, span: u } = l, f = u / 2, p = c === "x" ? d[0] - f : d[0], h = c === "x" ? d[1] : d[1] - f, g = c === "x" ? d[0] + f : d[0], w = c === "x" ? d[1] : d[1] + f, $ = i.has(a.id), k = s.has(a.id), x = r.get(a.id) ?? void 0, T = An / 2, I = c === "x" ? d[0] - f : d[0] - T, z = c === "x" ? d[1] - T : d[1] - f, X = c === "x" ? u : An, V = c === "x" ? An : u;
     return /* @__PURE__ */ j(
       "g",
       {
@@ -8830,7 +8830,7 @@ function lS() {
             "rect",
             {
               x: I,
-              y: D,
+              y: z,
               width: X,
               height: V,
               fill: "transparent",
@@ -9023,7 +9023,7 @@ function yS(e) {
 }
 function bS() {
   const [e, t] = ye(gS());
-  return se(() => yS(t), []), !e || e.w === 0 && e.h === 0 ? null : /* @__PURE__ */ m(
+  return ae(() => yS(t), []), !e || e.w === 0 && e.h === 0 ? null : /* @__PURE__ */ m(
     "rect",
     {
       className: "ole-marquee",
@@ -9214,7 +9214,7 @@ function SS() {
           "data-manual": c.userEdited ? "true" : void 0,
           "data-selected": g,
           className: "ole-wire",
-          points: k.map((S) => `${S[0]},${S[1]}`).join(" ")
+          points: k.map((T) => `${T[0]},${T[1]}`).join(" ")
         },
         `${c.wireId}-${x}`
       ))
@@ -9239,7 +9239,7 @@ function ES(e) {
 }
 function MS() {
   const e = b((l) => l.wireDragFrom), t = b((l) => l.cursorSvg), [n, o] = ye(NS());
-  if (se(() => ES(o), []), !e || !t) return null;
+  if (ae(() => ES(o), []), !e || !t) return null;
   const r = e.world, i = (n == null ? void 0 : n.world[0]) ?? t[0], s = (n == null ? void 0 : n.world[1]) ?? t[1], a = (n == null ? void 0 : n.create) === "junction";
   return /* @__PURE__ */ j("g", { className: "ole-wire-preview", pointerEvents: "none", children: [
     /* @__PURE__ */ m(
@@ -9361,7 +9361,7 @@ function hx() {
   (e.selectedNode || e.selectedWire || e.selection.length > 0 || e.selectedAnnotation) && e.clearSelection();
 }
 function IS() {
-  se(() => {
+  ae(() => {
     const e = (t) => {
       if (CS(t.target)) return;
       const n = t.metaKey || t.ctrlKey, o = b.getState();
@@ -9465,7 +9465,7 @@ function BS(e) {
 }
 const sr = "ole-hover-element-host", jS = "ole-hover-terminal-on", LS = "ole-hover-node-on";
 function zS(e) {
-  se(() => {
+  ae(() => {
     const t = e.current;
     if (!t) return;
     let n = null, o = null;
@@ -9591,56 +9591,60 @@ const HS = {
   id: "select",
   cursor: "default",
   onPointerDown(e, t) {
-    var p, h, g, w, $, k, x;
+    var p, h, g, w, $, k, x, T;
     if (e.button !== 0 || e.target instanceof Element && e.target.closest(".ole-bus-handle, .ole-wire-handle"))
       return;
     const n = b.getState(), o = tn(e.target);
     if (o) {
       e.preventDefault(), e.stopPropagation();
-      const S = (p = n.diagram.annotations) == null ? void 0 : p.find((I) => I.id === o);
-      if (!S) return;
+      const I = (p = n.diagram.annotations) == null ? void 0 : p.find((z) => z.id === o);
+      if (!I) return;
       n.setSelectedAnnotation(o), ge = {
         pointerId: e.pointerId,
         id: o,
         startSvg: t.viewport.screenToSvg(e.clientX, e.clientY),
-        origin: [S.at[0], S.at[1]],
+        origin: [I.at[0], I.at[1]],
         moved: !1
       };
       return;
     }
     const i = (e.target instanceof Element ? (h = e.target.closest("[data-terminal-id]")) == null ? void 0 : h.getAttribute("data-terminal-id") : null) ? fn(e.target) : null;
     if (i) {
-      const S = i.indexOf("."), I = S > 0 ? i.slice(0, S) : "";
-      if (I && n.selection.includes(I)) {
-        e.preventDefault(), e.stopPropagation(), e.target instanceof Element && ((w = (g = e.target).hasPointerCapture) != null && w.call(g, e.pointerId)) && e.target.releasePointerCapture(e.pointerId), t.hostEl.classList.add("tool-wire"), n.setWireFromTerminal(i), n.setCursorSvg(t.viewport.screenToSvg(e.clientX, e.clientY)), Ie = { pointerId: e.pointerId, fromRef: i };
+      const I = i.indexOf("."), z = I > 0 ? i.slice(0, I) : "";
+      if (z && n.selection.includes(z)) {
+        e.preventDefault(), e.stopPropagation(), e.target instanceof Element && ((w = (g = e.target).hasPointerCapture) != null && w.call(g, e.pointerId)) && e.target.releasePointerCapture(e.pointerId), t.hostEl.classList.add("tool-wire"), n.setWireFromTerminal(i);
+        const X = ($ = n.internal.terminals.get(
+          i
+        )) == null ? void 0 : $.world;
+        X && n.setWireDragFrom({ spec: { end: i }, world: X, ref: i }), n.setCursorSvg(t.viewport.screenToSvg(e.clientX, e.clientY)), Ie = { pointerId: e.pointerId, fromRef: i };
         return;
       }
     }
     let s = ut(e.target);
     if (!s) {
-      const S = Gn(e.target);
-      if (S && typeof document < "u") {
-        const I = document.elementsFromPoint(e.clientX, e.clientY);
-        for (const D of I) {
-          const X = (k = ($ = D.closest) == null ? void 0 : $.call(D, "[data-bus-id]")) == null ? void 0 : k.getAttribute("data-bus-id");
-          if (!X) continue;
-          const V = (x = n.diagram.wires) == null ? void 0 : x.find((te) => te.id === S);
-          V && (V.ends[0] === X || V.ends[1] === X) && (s = X);
+      const I = Gn(e.target);
+      if (I && typeof document < "u") {
+        const z = document.elementsFromPoint(e.clientX, e.clientY);
+        for (const X of z) {
+          const V = (x = (k = X.closest) == null ? void 0 : k.call(X, "[data-bus-id]")) == null ? void 0 : x.getAttribute("data-bus-id");
+          if (!V) continue;
+          const te = (T = n.diagram.wires) == null ? void 0 : T.find((se) => se.id === I);
+          te && (te.ends[0] === V || te.ends[1] === V) && (s = V);
           break;
         }
       }
     }
     if (!s) {
-      const S = Gn(e.target);
-      if (S) {
+      const I = Gn(e.target);
+      if (I) {
         if (e.preventDefault(), e.altKey) {
-          const I = hn(e.target);
-          if (I) {
-            n.setSelectedNode(I);
+          const z = hn(e.target);
+          if (z) {
+            n.setSelectedNode(z);
             return;
           }
         }
-        n.setSelectedWire(S);
+        n.setSelectedWire(I);
         return;
       }
       e.shiftKey || n.clearSelection(), Ce = {
@@ -9656,19 +9660,19 @@ const HS = {
     const l = e.shiftKey ? b.getState().selection : a.includes(s) ? a : [s];
     if (l.length === 0) return;
     const c = b.getState().internal, d = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Map(), f = /* @__PURE__ */ new Map();
-    for (const S of l) {
-      const I = c.buses.get(S);
-      if (I) {
-        u.set(S, [I.geometry.at[0], I.geometry.at[1]]);
+    for (const I of l) {
+      const z = c.buses.get(I);
+      if (z) {
+        u.set(I, [z.geometry.at[0], z.geometry.at[1]]);
         continue;
       }
-      const D = c.junctions.get(S);
-      if (D) {
-        f.set(S, [D.world[0], D.world[1]]);
+      const X = c.junctions.get(I);
+      if (X) {
+        f.set(I, [X.world[0], X.world[1]]);
         continue;
       }
-      const X = c.layout.get(S);
-      X && d.set(S, { ...X });
+      const V = c.layout.get(I);
+      V && d.set(I, { ...V });
     }
     d.size === 0 && u.size === 0 && f.size === 0 || (de = {
       pointerId: e.pointerId,
@@ -9747,7 +9751,7 @@ const HS = {
     }
     if (Ie && e.pointerId === Ie.pointerId) {
       const n = b.getState(), o = Ie.fromRef;
-      Ie = null, t.hostEl.classList.remove("tool-wire"), n.setWireFromTerminal(null), n.setCursorSvg(null), Ke(null);
+      Ie = null, t.hostEl.classList.remove("tool-wire"), n.setWireFromTerminal(null), n.setWireDragFrom(null), n.setCursorSvg(null), Ke(null);
       const r = t.viewport.screenToSvg(e.clientX, e.clientY), i = nn(e.clientX, e.clientY) ?? (e.target instanceof Element ? e.target : null), s = Tt(i, r, At(t, e.clientX, e.clientY));
       if (on({
         world: [0, 0],
@@ -9840,7 +9844,7 @@ const HS = {
     if (Ie && e.pointerId === Ie.pointerId) {
       t.hostEl.classList.remove("tool-wire");
       const l = b.getState();
-      l.setWireFromTerminal(null), l.setCursorSvg(null), Ke(null), Ie = null;
+      l.setWireFromTerminal(null), l.setWireDragFrom(null), l.setCursorSvg(null), Ke(null), Ie = null;
     }
     if (Ce && e.pointerId === Ce.pointerId) {
       if ((a = (s = t.hostEl).hasPointerCapture) != null && a.call(s, e.pointerId))
@@ -9864,7 +9868,7 @@ const HS = {
     if (de = null, Ce = null, ge = null, Ie) {
       e.hostEl.classList.remove("tool-wire");
       const t = b.getState();
-      t.setWireFromTerminal(null), t.setCursorSvg(null), Ke(null), Ie = null;
+      t.setWireFromTerminal(null), t.setWireDragFrom(null), t.setCursorSvg(null), Ke(null), Ie = null;
     }
     Ft(null);
   }
@@ -10297,7 +10301,7 @@ const e4 = {
 };
 function r4(e, t) {
   const n = b((o) => o.activeTool);
-  se(() => {
+  ae(() => {
     var f;
     const o = e.current;
     if (!o) return;
@@ -10356,7 +10360,7 @@ function d4(e, t, n = { tx: 0, ty: 0, scale: 1 }) {
       for (const c of r.current) c(l);
     }
   };
-  return se(() => {
+  return ae(() => {
     const s = e.current;
     if (!s) return;
     let a = !1, l = -1, c = 0, d = 0, u = 0, f = 0, p = !1;
@@ -10399,7 +10403,7 @@ function d4(e, t, n = { tx: 0, ty: 0, scale: 1 }) {
       if (W.length < 2) return;
       const xe = W[1].x - W[0].x, me = W[1].y - W[0].y, be = Math.hypot(xe, me) || 1, ne = s.getBoundingClientRect(), re = (W[0].x + W[1].x) / 2 - ne.left, we = (W[0].y + W[1].y) / 2 - ne.top, ve = be / g.startDist, Ne = Pn(g.startScale * ve, Cn, In), Ae = Ne / g.startScale;
       o.current.tx = g.startMidX - (g.startMidX - g.startTx) * Ae + (re - g.startMidX), o.current.ty = g.startMidY - (g.startMidY - g.startTy) * Ae + (we - g.startMidY), o.current.scale = Ne, i();
-    }, S = (R) => {
+    }, T = (R) => {
       var W;
       if (R.pointerType === "touch" && h.has(R.pointerId) && (h.delete(R.pointerId), w)) {
         if (R.stopPropagation(), (W = s.hasPointerCapture) != null && W.call(s, R.pointerId))
@@ -10418,7 +10422,7 @@ function d4(e, t, n = { tx: 0, ty: 0, scale: 1 }) {
       } else
         o.current.tx -= R.deltaX, o.current.ty -= R.deltaY;
       i();
-    }, D = (R) => {
+    }, z = (R) => {
       const W = R.button === 1, xe = p && R.button === 0;
       !W && !xe || (R.preventDefault(), a = !0, l = R.pointerId, c = R.clientX, d = R.clientY, u = o.current.tx, f = o.current.ty, s.setPointerCapture(R.pointerId), s.style.cursor = "grabbing");
     }, X = (R) => {
@@ -10431,11 +10435,11 @@ function d4(e, t, n = { tx: 0, ty: 0, scale: 1 }) {
         if (W && (W.tagName === "INPUT" || W.tagName === "TEXTAREA" || W.isContentEditable)) return;
         p = !0, s.style.cursor = "grab", R.preventDefault();
       }
-    }, le = (R) => {
+    }, se = (R) => {
       R.code === "Space" && (p = !1, a || (s.style.cursor = ""));
     };
-    return s.addEventListener("wheel", I, { passive: !1 }), s.addEventListener("pointerdown", D), s.addEventListener("pointermove", X), s.addEventListener("pointerup", V), s.addEventListener("pointercancel", V), s.addEventListener("pointerdown", k, { capture: !0 }), s.addEventListener("pointermove", x, { capture: !0 }), s.addEventListener("pointerup", S, { capture: !0 }), s.addEventListener("pointercancel", S, { capture: !0 }), window.addEventListener("keydown", te), window.addEventListener("keyup", le), i(), () => {
-      s.removeEventListener("wheel", I), s.removeEventListener("pointerdown", D), s.removeEventListener("pointermove", X), s.removeEventListener("pointerup", V), s.removeEventListener("pointercancel", V), s.removeEventListener("pointerdown", k, { capture: !0 }), s.removeEventListener("pointermove", x, { capture: !0 }), s.removeEventListener("pointerup", S, { capture: !0 }), s.removeEventListener("pointercancel", S, { capture: !0 }), window.removeEventListener("keydown", te), window.removeEventListener("keyup", le);
+    return s.addEventListener("wheel", I, { passive: !1 }), s.addEventListener("pointerdown", z), s.addEventListener("pointermove", X), s.addEventListener("pointerup", V), s.addEventListener("pointercancel", V), s.addEventListener("pointerdown", k, { capture: !0 }), s.addEventListener("pointermove", x, { capture: !0 }), s.addEventListener("pointerup", T, { capture: !0 }), s.addEventListener("pointercancel", T, { capture: !0 }), window.addEventListener("keydown", te), window.addEventListener("keyup", se), i(), () => {
+      s.removeEventListener("wheel", I), s.removeEventListener("pointerdown", z), s.removeEventListener("pointermove", X), s.removeEventListener("pointerup", V), s.removeEventListener("pointercancel", V), s.removeEventListener("pointerdown", k, { capture: !0 }), s.removeEventListener("pointermove", x, { capture: !0 }), s.removeEventListener("pointerup", T, { capture: !0 }), s.removeEventListener("pointercancel", T, { capture: !0 }), window.removeEventListener("keydown", te), window.removeEventListener("keyup", se);
     };
   }, []), {
     screenToSvg(s, a) {
@@ -10467,8 +10471,8 @@ function f4(e) {
   return On[On.length - 1];
 }
 function h4() {
-  const e = ae(), t = he(null), n = he(null), o = he(null), r = d4(t, n);
-  r4(t, r), zS(t), se(() => (nr(r), () => nr(null)), [r]), se(() => {
+  const e = le(), t = he(null), n = he(null), o = he(null), r = d4(t, n);
+  r4(t, r), zS(t), ae(() => (nr(r), () => nr(null)), [r]), ae(() => {
     const d = (u) => {
       const f = o.current;
       if (!f) return;
@@ -10488,10 +10492,10 @@ function h4() {
       if (g)
         p.selection.includes(g) || p.setSelection([g]);
       else {
-        const D = hn(f);
-        D && p.selectedNode !== D && p.setSelectedNode(D);
+        const z = hn(f);
+        z && p.selectedNode !== z && p.setSelectedNode(z);
       }
-      const w = b.getState(), $ = w.selection.length > 0, k = w.selectedNode != null, x = !!w.clipboard, S = w.diagram.elements.length > 0, I = [
+      const w = b.getState(), $ = w.selection.length > 0, k = w.selectedNode != null, x = !!w.clipboard, T = w.diagram.elements.length > 0, I = [
         {
           label: e("menu.undo"),
           shortcut: `${st}Z`,
@@ -10549,10 +10553,10 @@ function h4() {
           shortcut: `${st}A`,
           icon: _v,
           onSelect: () => {
-            const D = b.getState();
-            D.setSelection(D.diagram.elements.map((X) => X.id));
+            const z = b.getState();
+            z.setSelection(z.diagram.elements.map((X) => X.id));
           },
-          disabled: !S
+          disabled: !T
         },
         { type: "separator" },
         {
@@ -10568,7 +10572,7 @@ function h4() {
     },
     [i, e]
   );
-  return se(() => {
+  return ae(() => {
     const d = t.current;
     if (!d) return;
     const u = 700, f = 4;
@@ -10582,13 +10586,13 @@ function h4() {
         y: x.clientY,
         target: x.target
       }, p = window.setTimeout(() => {
-        const S = h;
-        h = null, p = void 0, S && (fx(d, S.pointerId), s(S.x, S.y, S.target));
+        const T = h;
+        h = null, p = void 0, T && (fx(d, T.pointerId), s(T.x, T.y, T.target));
       }, u));
     }, $ = (x) => {
       if (!h || x.pointerId !== h.pointerId) return;
-      const S = x.clientX - h.x, I = x.clientY - h.y;
-      Math.hypot(S, I) > f && g();
+      const T = x.clientX - h.x, I = x.clientY - h.y;
+      Math.hypot(T, I) > f && g();
     }, k = (x) => {
       !h || x.pointerId !== h.pointerId || g();
     };
@@ -10701,7 +10705,7 @@ function v4() {
 }
 function k4() {
   const [e, t] = ye(OS()), [n, o] = ye(!1), [r, i] = ye(null), s = he(null), a = he(void 0), [l] = ye(v4);
-  se(() => BS((h) => t(h)), []), se(() => {
+  ae(() => BS((h) => t(h)), []), ae(() => {
     if (window.clearTimeout(a.current), o(!1), i(null), !!e)
       return a.current = window.setTimeout(() => o(!0), x4), () => window.clearTimeout(a.current);
   }, [e]);
@@ -10714,11 +10718,11 @@ function k4() {
         `[data-element-id="${_4(e)}"]`
       ), x = s.current;
       if (k && x) {
-        const S = k.getBoundingClientRect();
-        let I = S.bottom + wr;
-        I + x.offsetHeight > window.innerHeight - 4 && (I = S.top - x.offsetHeight - wr);
-        let D = S.left + S.width / 2 - x.offsetWidth / 2;
-        D = Math.max(4, Math.min(D, window.innerWidth - x.offsetWidth - 4)), (I !== g || D !== w) && (i({ top: I, left: D }), g = I, w = D);
+        const T = k.getBoundingClientRect();
+        let I = T.bottom + wr;
+        I + x.offsetHeight > window.innerHeight - 4 && (I = T.top - x.offsetHeight - wr);
+        let z = T.left + T.width / 2 - x.offsetWidth / 2;
+        z = Math.max(4, Math.min(z, window.innerWidth - x.offsetWidth - 4)), (I !== g || z !== w) && (i({ top: I, left: z }), g = I, w = z);
       }
       h = requestAnimationFrame($);
     };
@@ -10913,11 +10917,11 @@ function Be({
   sn(() => {
     if (!s || !r.current || !i.current) return;
     const $ = r.current.getBoundingClientRect(), k = i.current.getBoundingClientRect(), x = 8;
-    let S = "top", I = $.top - k.height - x;
-    I < 4 && (S = "bottom", I = $.bottom + x);
-    let D = $.left + $.width / 2 - k.width / 2;
-    D = Math.max(4, Math.min(D, window.innerWidth - k.width - 4)), c({ top: I, left: D, side: S });
-  }, [s, e]), se(() => () => window.clearTimeout(u.current), []), se(() => {
+    let T = "top", I = $.top - k.height - x;
+    I < 4 && (T = "bottom", I = $.bottom + x);
+    let z = $.left + $.width / 2 - k.width / 2;
+    z = Math.max(4, Math.min(z, window.innerWidth - k.width - 4)), c({ top: I, left: z, side: T });
+  }, [s, e]), ae(() => () => window.clearTimeout(u.current), []), ae(() => {
     if (!s) return;
     const $ = (x) => {
       x.key === "Escape" && a(!1);
@@ -10977,21 +10981,21 @@ function Be({
 const _r = 12, z4 = 56;
 function D4() {
   var $;
-  const e = ae(), t = b((k) => k.selection), n = b((k) => k.selectedNode), o = b((k) => k.selectedWire), r = b((k) => k.activeTool), i = b((k) => k.rotateSelection), s = b((k) => k.mirrorSelection), a = b((k) => k.deleteSelection), l = b((k) => k.deleteSelectedNode), c = b((k) => k.deleteSelectedWire), d = b((k) => k.resetWirePath), u = b((k) => k.internal.wireRenders), f = o != null && (($ = u.get(o)) == null ? void 0 : $.userEdited) === !0, p = he(null);
-  se(() => {
+  const e = le(), t = b((k) => k.selection), n = b((k) => k.selectedNode), o = b((k) => k.selectedWire), r = b((k) => k.activeTool), i = b((k) => k.rotateSelection), s = b((k) => k.mirrorSelection), a = b((k) => k.deleteSelection), l = b((k) => k.deleteSelectedNode), c = b((k) => k.deleteSelectedWire), d = b((k) => k.resetWirePath), u = b((k) => k.internal.wireRenders), f = o != null && (($ = u.get(o)) == null ? void 0 : $.userEdited) === !0, p = he(null);
+  ae(() => {
     const k = p.current;
     if (!k) return;
-    const x = t.length > 0, S = !x && o != null, I = !x && !S && n != null;
-    if (!((x || S || I) && (r === "select" || r === "pan"))) {
+    const x = t.length > 0, T = !x && o != null, I = !x && !T && n != null;
+    if (!((x || T || I) && (r === "select" || r === "pan"))) {
       k.style.display = "none";
       return;
     }
     k.style.display = "flex";
     let X = 0, V = "";
     const te = () => {
-      let le = 1 / 0, R = -1 / 0, W = 1 / 0, xe = -1 / 0, me = !1;
+      let se = 1 / 0, R = -1 / 0, W = 1 / 0, xe = -1 / 0, me = !1;
       const be = (ne) => {
-        ne.width === 0 && ne.height === 0 || (ne.left < le && (le = ne.left), ne.right > R && (R = ne.right), ne.top < W && (W = ne.top), ne.bottom > xe && (xe = ne.bottom), me = !0);
+        ne.width === 0 && ne.height === 0 || (ne.left < se && (se = ne.left), ne.right > R && (R = ne.right), ne.top < W && (W = ne.top), ne.bottom > xe && (xe = ne.bottom), me = !0);
       };
       if (x)
         for (const ne of t) {
@@ -11000,7 +11004,7 @@ function D4() {
           );
           re && be(re.getBoundingClientRect());
         }
-      else if (S && o) {
+      else if (T && o) {
         const ne = document.querySelector(
           `polyline.ole-wire[data-wire-id="${CSS.escape(o)}"]`
         );
@@ -11012,7 +11016,7 @@ function D4() {
         for (const re of ne) be(re.getBoundingClientRect());
       }
       if (me) {
-        const ne = (le + R) / 2;
+        const ne = (se + R) / 2;
         let re = W - _r, we = "-100%";
         re < z4 && (re = xe + _r, we = "0%");
         const ve = `translate3d(${ne}px, ${re}px, 0) translate(-50%, ${we})`;
@@ -11137,7 +11141,7 @@ function ro({
   children: o
 }) {
   const r = he(null);
-  return se(() => {
+  return ae(() => {
     if (!e) return;
     const i = (a) => {
       r.current && !r.current.contains(a.target) && t(!1);
@@ -11250,10 +11254,10 @@ function Y4() {
 }
 function Mx() {
   const [e, t] = ye(() => F4());
-  return se(() => {
+  return ae(() => {
     const n = Ex();
     n == null || n.classList.toggle("hide-grid", !e), H4(e);
-  }, [e]), se(() => {
+  }, [e]), ae(() => {
     const n = (o) => {
       if (o.metaKey || o.ctrlKey || o.altKey || o.key !== "g" && o.key !== "G") return;
       const r = o.target;
@@ -11263,7 +11267,7 @@ function Mx() {
   }, []), [e, t];
 }
 function Tx() {
-  const e = ae();
+  const e = le();
   return /* @__PURE__ */ m(
     Be,
     {
@@ -11285,7 +11289,7 @@ function Tx() {
   );
 }
 function Ax() {
-  const e = ae();
+  const e = le();
   return /* @__PURE__ */ m(
     Be,
     {
@@ -11307,8 +11311,8 @@ function Ax() {
   );
 }
 function Cx() {
-  const e = ae(), [t, n] = ye(s4);
-  return se(() => a4(n), []), /* @__PURE__ */ m(
+  const e = le(), [t, n] = ye(s4);
+  return ae(() => a4(n), []), /* @__PURE__ */ m(
     Be,
     {
       content: /* @__PURE__ */ j("div", { className: "space-y-0.5", children: [
@@ -11332,7 +11336,7 @@ function Cx() {
   );
 }
 function Ix() {
-  const e = ae();
+  const e = le();
   return /* @__PURE__ */ m(
     Be,
     {
@@ -11357,7 +11361,7 @@ function Px({
   grid: e,
   setGrid: t
 }) {
-  const n = ae();
+  const n = le();
   return /* @__PURE__ */ m(
     Be,
     {
@@ -11384,7 +11388,7 @@ function Px({
   );
 }
 function Ox() {
-  const e = ae(), t = b(
+  const e = le(), t = b(
     (n) => {
       var o;
       return ((o = n.diagram.meta) == null ? void 0 : o.labelMode) ?? "all";
@@ -11413,7 +11417,7 @@ function Ox() {
   );
 }
 function K4({ stacked: e } = {}) {
-  const t = ae(), [n, o] = ye(!1), [r, i] = Mx(), s = /* @__PURE__ */ j("div", { className: "space-y-0.5", children: [
+  const t = le(), [n, o] = ye(!1), [r, i] = Mx(), s = /* @__PURE__ */ j("div", { className: "space-y-0.5", children: [
     /* @__PURE__ */ m("div", { className: "font-medium", children: t("view.menu") }),
     /* @__PURE__ */ m("div", { className: "text-muted-foreground", children: t("view.menuHint") })
   ] }), a = e ? /* @__PURE__ */ m(Be, { content: s, children: /* @__PURE__ */ j(
@@ -11555,7 +11559,7 @@ const Sr = [
   }
 ];
 function J4() {
-  const e = ae(), t = b((d) => d.activeTool), n = b((d) => d.placeKind), o = b((d) => d.placeFromTerminal), r = b((d) => d.wireDragFrom), i = b((d) => d.busbarDrawStart), s = b(
+  const e = le(), t = b((d) => d.activeTool), n = b((d) => d.placeKind), o = b((d) => d.placeFromTerminal), r = b((d) => d.wireDragFrom), i = b((d) => d.busbarDrawStart), s = b(
     (d) => d.selection.length > 0 || d.selectedNode != null
   );
   let a = null, l = !1;
@@ -11593,7 +11597,7 @@ function J4() {
   ] });
 }
 function Z4() {
-  const e = ae(), t = b((h) => h.activeTool), n = b((h) => h.placeKind), o = b((h) => h.setActiveTool), r = b((h) => h.past.length), i = b((h) => h.future.length), s = b((h) => h.undo), a = b((h) => h.redo), l = Je(), c = Le(l, "tight"), d = !Le(l, "dense"), u = Le(l, "dense"), f = u ? Sr.filter((h) => h.id !== "select" && h.id !== "text") : Sr, p = (h) => t === h.switchTo;
+  const e = le(), t = b((h) => h.activeTool), n = b((h) => h.placeKind), o = b((h) => h.setActiveTool), r = b((h) => h.past.length), i = b((h) => h.future.length), s = b((h) => h.undo), a = b((h) => h.redo), l = Je(), c = Le(l, "tight"), d = !Le(l, "dense"), u = Le(l, "dense"), f = u ? Sr.filter((h) => h.id !== "select" && h.id !== "text") : Sr, p = (h) => t === h.switchTo;
   return /* @__PURE__ */ j(
     "div",
     {
@@ -11671,7 +11675,7 @@ function Z4() {
   );
 }
 function Q4({ stacked: e }) {
-  const t = ae(), n = It((r) => r.outlineOpen), o = It((r) => r.toggleOutline);
+  const t = le(), n = It((r) => r.outlineOpen), o = It((r) => r.toggleOutline);
   return /* @__PURE__ */ m(
     dt,
     {
@@ -11748,7 +11752,7 @@ function Bx() {
   };
 }
 function e6({ iconOnly: e }) {
-  const t = ae(), [n, o] = ye(!1), r = Bx(), i = (s) => () => {
+  const t = le(), [n, o] = ye(!1), r = Bx(), i = (s) => () => {
     o(!1), s();
   };
   return /* @__PURE__ */ j(
@@ -11810,7 +11814,7 @@ function e6({ iconOnly: e }) {
   );
 }
 function t6({ stacked: e }) {
-  const t = ae(), [n, o] = ye(!1), r = b((f) => f.past.length), i = b((f) => f.future.length), s = b((f) => f.undo), a = b((f) => f.redo), l = b((f) => f.selection.length > 0), c = b((f) => f.clipboard != null), d = Bx(), u = (f) => () => {
+  const t = le(), [n, o] = ye(!1), r = b((f) => f.past.length), i = b((f) => f.future.length), s = b((f) => f.undo), a = b((f) => f.redo), l = b((f) => f.selection.length > 0), c = b((f) => f.clipboard != null), d = Bx(), u = (f) => () => {
     o(!1), f();
   };
   return /* @__PURE__ */ j(
@@ -11969,7 +11973,7 @@ function n6() {
   );
 }
 function o6({ onClick: e }) {
-  const t = ae(), n = Je(), o = Le(n, "compact");
+  const t = le(), n = Je(), o = Le(n, "compact");
   return /* @__PURE__ */ j(
     "button",
     {
@@ -11992,7 +11996,7 @@ function Nr({
   onClose: e,
   sheet: t
 }) {
-  const n = ae(), o = b((c) => c.diagram.elements), r = b((c) => c.activeTool === "place"), i = Je(), s = Le(i, "compact"), a = Le(i, "dense"), l = t ? "min(50vh, calc(100vh - 9rem))" : r ? "min(40vh, calc(100vh - 200px))" : "min(70vh, calc(100vh - 100px))";
+  const n = le(), o = b((c) => c.diagram.elements), r = b((c) => c.activeTool === "place"), i = Je(), s = Le(i, "compact"), a = Le(i, "dense"), l = t ? "min(50vh, calc(100vh - 9rem))" : r ? "min(40vh, calc(100vh - 200px))" : "min(70vh, calc(100vh - 100px))";
   return /* @__PURE__ */ j(
     "aside",
     {
@@ -12401,7 +12405,7 @@ function m6(e) {
   }
 }
 function f6() {
-  const e = ae(), t = b((u) => u.activeTool === "place"), n = b((u) => u.placeKind), o = b((u) => u.setActiveTool), r = It((u) => u.outlineOpen), i = Je(), s = Le(i, "dense"), a = 68, c = s ? void 0 : `calc(100vh - ${a}px - ${r ? "calc(40vh + 20px)" : "68px"})`;
+  const e = le(), t = b((u) => u.activeTool === "place"), n = b((u) => u.placeKind), o = b((u) => u.setActiveTool), r = It((u) => u.outlineOpen), i = Je(), s = Le(i, "dense"), a = 68, c = s ? void 0 : `calc(100vh - ${a}px - ${r ? "calc(40vh + 20px)" : "68px"})`;
   if (!t || s && n != null) return null;
   const d = s ? {
     top: `calc(${a}px + var(--ole-top-inset, 0px))`,
@@ -12444,7 +12448,7 @@ function f6() {
   );
 }
 function h6({ sheet: e }) {
-  const t = ae(), n = Pt(), [o, r] = ye(""), [i, s] = ye(
+  const t = le(), n = Pt(), [o, r] = ye(""), [i, s] = ye(
     () => u6()
   ), a = Rr(() => {
     const u = o.trim().toLowerCase();
@@ -12500,7 +12504,7 @@ function p6({
   value: e,
   onChange: t
 }) {
-  const n = ae();
+  const n = le();
   return /* @__PURE__ */ j("div", { className: "relative", children: [
     /* @__PURE__ */ m(vv, { className: "pointer-events-none absolute left-2 top-1/2 size-3.5 -translate-y-1/2 text-muted-foreground" }),
     /* @__PURE__ */ m(
@@ -12530,12 +12534,12 @@ function g6({
   entry: e,
   sheet: t
 }) {
-  const n = ae(), o = Pt(), r = o(`${e.id}.name`, e.name), i = o(`${e.id}.desc`, e.description ?? ""), s = b((u) => u.setActiveTool), a = b(
+  const n = le(), o = Pt(), r = o(`${e.id}.name`, e.name), i = o(`${e.id}.desc`, e.description ?? ""), s = b((u) => u.setActiveTool), a = b(
     (u) => u.activeTool === "place" && u.placeKind === e.id
   ), l = b(
     (u) => t && u.activeTool === "place" && u.placeKind == null && u.lastPlaceKind === e.id
   ), c = he(null);
-  return se(() => {
+  return ae(() => {
     var u;
     l && ((u = c.current) == null || u.scrollIntoView({ block: "nearest" }));
   }, [l]), /* @__PURE__ */ j(
@@ -12609,7 +12613,7 @@ const Tr = an((e) => ({
   }
 }));
 function w6() {
-  const e = ae(), t = Tr((o) => o.dismissed), n = Tr((o) => o.dismiss);
+  const e = le(), t = Tr((o) => o.dismissed), n = Tr((o) => o.dismiss);
   return t ? null : /* @__PURE__ */ j(
     "div",
     {
@@ -12697,7 +12701,7 @@ function Bn({
   ] });
 }
 function x6() {
-  const e = ae(), t = b((f) => f.selection), n = b((f) => f.diagram.elements), o = b((f) => f.diagram.buses), r = b((f) => f.diagram.junctions), i = b((f) => f.selectedNode), s = b((f) => f.selectedWire);
+  const e = le(), t = b((f) => f.selection), n = b((f) => f.diagram.elements), o = b((f) => f.diagram.buses), r = b((f) => f.diagram.junctions), i = b((f) => f.selectedNode), s = b((f) => f.selectedWire);
   if (s) return /* @__PURE__ */ m(N6, { wireId: s });
   if (i) return /* @__PURE__ */ m(M6, { nodeId: i });
   if (t.length === 0)
@@ -12774,7 +12778,7 @@ function k6({
   field: n
 }) {
   var l;
-  const o = ae(), r = Pt(), i = ((l = t.params) == null ? void 0 : l[n.name]) ?? n.default, s = r(`${t.kind}.param.${n.name}`, n.label ?? n.name), a = (c) => {
+  const o = le(), r = Pt(), i = ((l = t.params) == null ? void 0 : l[n.name]) ?? n.default, s = r(`${t.kind}.param.${n.name}`, n.label ?? n.name), a = (c) => {
     const d = { ...t.params ?? {} };
     c === void 0 || c === n.default ? delete d[n.name] : d[n.name] = c, b.getState().updateElement(e, {
       params: Object.keys(d).length > 0 ? d : void 0
@@ -12804,7 +12808,7 @@ function _6({
   fieldKey: n,
   value: o
 }) {
-  const r = ae(), i = (s) => {
+  const r = le(), i = (s) => {
     const a = { ...t.params ?? {} };
     s === void 0 ? delete a[n] : a[n] = s, b.getState().updateElement(e, {
       params: Object.keys(a).length > 0 ? a : void 0
@@ -12820,7 +12824,7 @@ function _6({
   );
 }
 function $6({ bus: e }) {
-  const t = ae(), n = e.id, o = (r) => {
+  const t = le(), n = e.id, o = (r) => {
     const i = r.trim();
     Jn(n, { name: i === "" ? void 0 : i });
   };
@@ -12869,18 +12873,18 @@ function Jn(e, t) {
   });
 }
 function N6({ wireId: e }) {
-  const t = ae(), n = b((w) => w.diagram.wires), o = b((w) => w.diagram.elements), r = b((w) => w.diagram.buses), i = b((w) => w.diagram.junctions), s = b((w) => w.internal.terminalToNode), a = b((w) => w.setSelectedNode), l = (n ?? []).find((w) => w.id === e);
+  const t = le(), n = b((w) => w.diagram.wires), o = b((w) => w.diagram.elements), r = b((w) => w.diagram.buses), i = b((w) => w.diagram.junctions), s = b((w) => w.internal.terminalToNode), a = b((w) => w.setSelectedNode), l = (n ?? []).find((w) => w.id === e);
   if (!l)
     return /* @__PURE__ */ m("div", { className: "px-4 py-5 text-center text-xs text-muted-foreground", children: t("props.wireNotFound", { id: e }) });
   const c = s.get(l.ends[0]), d = new Map(o.map((w) => [w.id, w])), u = new Map((r ?? []).map((w) => [w.id, w])), f = new Map((i ?? []).map((w) => [w.id, w])), p = (w) => {
     if (!w.includes(".")) {
       const I = u.get(w);
       if (I) return { id: w, label: I.name ?? w };
-      const D = f.get(w);
-      return { id: w, label: (D == null ? void 0 : D.name) ?? w };
+      const z = f.get(w);
+      return { id: w, label: (z == null ? void 0 : z.name) ?? w };
     }
-    const $ = w.indexOf("."), k = w.slice(0, $), x = w.slice($ + 1), S = d.get(k);
-    return { id: k, label: (S == null ? void 0 : S.name) ?? k, pin: x };
+    const $ = w.indexOf("."), k = w.slice(0, $), x = w.slice($ + 1), T = d.get(k);
+    return { id: k, label: (T == null ? void 0 : T.name) ?? k, pin: x };
   }, h = p(l.ends[0]), g = p(l.ends[1]);
   return /* @__PURE__ */ j("div", { className: "flex flex-col gap-3 px-3 py-3 text-xs", children: [
     /* @__PURE__ */ j("div", { className: "space-y-1", children: [
@@ -12913,7 +12917,7 @@ function N6({ wireId: e }) {
 }
 function E6({ junction: e }) {
   var r;
-  const t = ae(), n = b((i) => {
+  const t = le(), n = b((i) => {
     var s;
     return (s = i.internal.junctions.get(e.id)) == null ? void 0 : s.world;
   }), o = ((r = e.layout) == null ? void 0 : r.at) ?? n;
@@ -12950,7 +12954,7 @@ function E6({ junction: e }) {
   ] });
 }
 function M6({ nodeId: e }) {
-  const t = ae(), n = b((a) => a.internal.nodes.get(e)), o = b((a) => a.diagram.elements), r = b((a) => a.setSelection);
+  const t = le(), n = b((a) => a.internal.nodes.get(e)), o = b((a) => a.diagram.elements), r = b((a) => a.setSelection);
   if (!n)
     return /* @__PURE__ */ m("div", { className: "px-4 py-5 text-center text-xs text-muted-foreground", children: t("props.nodeNotFound", { id: e }) });
   const i = /* @__PURE__ */ new Map();
@@ -13006,7 +13010,7 @@ function ht({
   onCommit: r
 }) {
   const [i, s] = ye(t), a = he(null);
-  return se(() => s(t), [t]), /* @__PURE__ */ m(ft, { label: e, children: /* @__PURE__ */ j("div", { className: "relative", children: [
+  return ae(() => s(t), [t]), /* @__PURE__ */ m(ft, { label: e, children: /* @__PURE__ */ j("div", { className: "relative", children: [
     /* @__PURE__ */ m(
       "input",
       {
@@ -13037,7 +13041,7 @@ function so({
   onCommit: n
 }) {
   const [o, r] = ye(t);
-  return se(() => r(t), [t]), /* @__PURE__ */ m(ft, { label: e, children: /* @__PURE__ */ m(
+  return ae(() => r(t), [t]), /* @__PURE__ */ m(ft, { label: e, children: /* @__PURE__ */ m(
     "textarea",
     {
       rows: 2,
@@ -13058,7 +13062,7 @@ function gn({
   onCommit: r
 }) {
   const [i, s] = ye(String(t)), a = he(null);
-  return se(() => s(String(t)), [t]), /* @__PURE__ */ m(ft, { label: e, children: /* @__PURE__ */ j("div", { className: "relative", children: [
+  return ae(() => s(String(t)), [t]), /* @__PURE__ */ m(ft, { label: e, children: /* @__PURE__ */ j("div", { className: "relative", children: [
     /* @__PURE__ */ m(
       "input",
       {
@@ -13109,7 +13113,7 @@ function T6({
   field: n
 }) {
   var l;
-  const o = ae(), i = Pt()(`${t.kind}.state.${n.name}`, n.label ?? n.name), s = ((l = t.state) == null ? void 0 : l[n.name]) ?? n.default, a = (c) => {
+  const o = le(), i = Pt()(`${t.kind}.state.${n.name}`, n.label ?? n.name), s = ((l = t.state) == null ? void 0 : l[n.name]) ?? n.default, a = (c) => {
     const d = { ...t.state ?? {} };
     c === void 0 || c === n.default ? delete d[n.name] : d[n.name] = c, b.getState().updateElement(e, {
       state: Object.keys(d).length > 0 ? d : void 0
@@ -13132,7 +13136,7 @@ function T6({
   );
 }
 function A6() {
-  const e = ae(), t = Pt(), n = b((u) => u.selection), o = b((u) => u.selectedNode), r = b((u) => u.selectedWire), i = b((u) => u.diagram.elements), s = b((u) => u.diagram.buses), a = Je(), l = Le(a, "dense");
+  const e = le(), t = Pt(), n = b((u) => u.selection), o = b((u) => u.selectedNode), r = b((u) => u.selectedWire), i = b((u) => u.diagram.elements), s = b((u) => u.diagram.buses), a = Je(), l = Le(a, "dense");
   if (n.length === 0 && !o && !r) return null;
   let c = e("props.title"), d = null;
   if (r)
@@ -13175,7 +13179,7 @@ function A6() {
   );
 }
 function C6() {
-  se(() => {
+  ae(() => {
     const e = (n) => {
       const o = n.target;
       if (!o || o.tagName === "INPUT" || o.tagName === "TEXTAREA" || o.isContentEditable)
@@ -13234,14 +13238,14 @@ function j6(e) {
   typeof document > "u" || document.documentElement.classList.toggle("dark", e === "dark");
 }
 function p5({ className: e, diagram: t, locale: n, theme: o }) {
-  return se(() => {
+  return ae(() => {
     if (!t) return;
     b.getState().diagram.elements.length === 0 && b.getState().setDiagram(t);
-  }, [t]), se(() => {
+  }, [t]), ae(() => {
     n && ln.getState().setLocale(n);
-  }, [n]), se(() => {
+  }, [n]), ae(() => {
     o && j6(o);
-  }, [o]), se(() => {
+  }, [o]), ae(() => {
     vx();
   }, []), IS(), /* @__PURE__ */ m("div", { className: `ole-root ${e ?? "h-full w-full"}`, children: /* @__PURE__ */ m(I6, {}) });
 }
@@ -13325,15 +13329,15 @@ async function Cr(e, t, n = {}) {
   return i.href = r, i.download = (t == null ? void 0 : t.name) ?? "diagram.json", i.click(), URL.revokeObjectURL(r), t ?? { name: "diagram.json" };
 }
 function g5() {
-  const e = ae(), t = b((u) => u.fileSession), n = (t == null ? void 0 : t.name) ?? e("common.unnamed"), { onNew: o, onOpen: r, onSave: i, onSaveAs: s } = D6(), [a, l] = ye(!1), c = he(null);
-  se(() => {
+  const e = le(), t = b((u) => u.fileSession), n = (t == null ? void 0 : t.name) ?? e("common.unnamed"), { onNew: o, onOpen: r, onSave: i, onSaveAs: s } = D6(), [a, l] = ye(!1), c = he(null);
+  ae(() => {
     const u = (f) => {
       if (!(f.metaKey || f.ctrlKey)) return;
       const p = f.key.toLowerCase();
       p === "o" ? (f.preventDefault(), r()) : p === "s" && (f.preventDefault(), f.shiftKey ? s() : i());
     };
     return window.addEventListener("keydown", u), () => window.removeEventListener("keydown", u);
-  }, [r, i, s]), se(() => {
+  }, [r, i, s]), ae(() => {
     if (!a) return;
     const u = (p) => {
       c.current && !c.current.contains(p.target) && l(!1);
@@ -13401,7 +13405,7 @@ function qt({
   );
 }
 function D6() {
-  const e = ae(), t = b((l) => l.loadDiagramFromFile), n = b((l) => l.setFileSession), o = b((l) => l.setDiagram);
+  const e = le(), t = b((l) => l.loadDiagramFromFile), n = b((l) => l.setFileSession), o = b((l) => l.setDiagram);
   return { onNew: () => {
     const { diagram: l } = b.getState();
     l.elements.length > 0 && !confirm(e("topbar.file.newConfirm")) || (o({ version: "1", elements: [] }), n(null));
@@ -13621,18 +13625,18 @@ function t5(e, t, n, o, r, i) {
     const W = Math.sqrt(w);
     f *= W, p *= W;
   }
-  const $ = r === i ? -1 : 1, k = f * f * p * p - f * f * u * u - p * p * d * d, x = f * f * u * u + p * p * d * d, S = $ * Math.sqrt(Math.max(0, k / x)), I = S * (f * u) / p, D = S * -(p * d) / f, X = I + (s + l) / 2, V = D + (a + c) / 2, te = (W, xe, me, be) => {
+  const $ = r === i ? -1 : 1, k = f * f * p * p - f * f * u * u - p * p * d * d, x = f * f * u * u + p * p * d * d, T = $ * Math.sqrt(Math.max(0, k / x)), I = T * (f * u) / p, z = T * -(p * d) / f, X = I + (s + l) / 2, V = z + (a + c) / 2, te = (W, xe, me, be) => {
     const ne = W * me + xe * be, re = Math.hypot(W, xe) * Math.hypot(me, be);
     let we = Math.acos(Math.max(-1, Math.min(1, ne / re)));
     return W * be - xe * me < 0 && (we = -we), we;
-  }, le = te(1, 0, (d - I) / f, (u - D) / p);
+  }, se = te(1, 0, (d - I) / f, (u - z) / p);
   let R = te(
     (d - I) / f,
-    (u - D) / p,
+    (u - z) / p,
     (-d - I) / f,
-    (-u - D) / p
+    (-u - z) / p
   );
-  return !i && R > 0 ? R -= 2 * Math.PI : i && R < 0 && (R += 2 * Math.PI), { cx: X, cy: V, theta1: le, delta: R };
+  return !i && R > 0 ? R -= 2 * Math.PI : i && R < 0 && (R += 2 * Math.PI), { cx: X, cy: V, theta1: se, delta: R };
 }
 function He(e, t) {
   return De(e, t);
@@ -13720,9 +13724,9 @@ function Hx(e, t = {}) {
   }
   l.push("  </g>");
   for (const { bus: u, geometry: f } of e.buses.values()) {
-    const { axis: p, at: h, span: g } = f, w = g / 2, $ = p === "x" ? h[0] - w : h[0], k = p === "x" ? h[1] : h[1] - w, x = p === "x" ? h[0] + w : h[0], S = p === "x" ? h[1] : h[1] + w;
+    const { axis: p, at: h, span: g } = f, w = g / 2, $ = p === "x" ? h[0] - w : h[0], k = p === "x" ? h[1] : h[1] - w, x = p === "x" ? h[0] + w : h[0], T = p === "x" ? h[1] : h[1] + w;
     l.push(
-      `  <line id="${at(u.id)}" x1="${$}" y1="${k}" x2="${x}" y2="${S}" stroke="black" stroke-width="3" stroke-linecap="round" fill="none"/>`
+      `  <line id="${at(u.id)}" x1="${$}" y1="${k}" x2="${x}" y2="${T}" stroke="black" stroke-width="3" stroke-linecap="round" fill="none"/>`
     );
   }
   for (const { junction: u, world: f } of e.junctions.values())
@@ -13878,8 +13882,8 @@ function Wx(e, t) {
   o.href = n, o.download = t, o.click(), URL.revokeObjectURL(n);
 }
 function y5() {
-  const e = ae(), [t, n] = ye(!1), o = he(null);
-  se(() => {
+  const e = le(), [t, n] = ye(!1), o = he(null);
+  ae(() => {
     if (!t) return;
     const i = (a) => {
       o.current && !o.current.contains(a.target) && n(!1);