likec4 1.2.0 → 1.2.1

package/dist/__app__/src/{view_viewId_.css-BFbcQw78.js → view_viewId_.css-LQsQcFpp.js}

@@ -1,4 +1,4 @@
-import { q as React, j as jsxRuntimeExports, B as Box, t as CopyButton$1, T as Tooltip, A as ActionIcon, I as IconCheck, v as rem, w as IconCopy } from "./main-DtZ0eEaw.js";
+import { q as React, j as jsxRuntimeExports, B as Box, t as CopyButton$1, T as Tooltip, A as ActionIcon, I as IconCheck, v as rem, w as IconCopy } from "./main-yVRq2dIl.js";
 const {
   createElement,
   createContext,
@@ -194,8 +194,7 @@ function intersects(rectOne, rectTwo, strict) {
   return strict ? rectOne.x < rectTwo.x + rectTwo.width && rectOne.x + rectOne.width > rectTwo.x && rectOne.y < rectTwo.y + rectTwo.height && rectOne.y + rectOne.height > rectTwo.y : rectOne.x <= rectTwo.x + rectTwo.width && rectOne.x + rectOne.width >= rectTwo.x && rectOne.y <= rectTwo.y + rectTwo.height && rectOne.y + rectOne.height >= rectTwo.y;
 }
 function compare(a, b) {
-  if (a === b)
-    throw new Error("Cannot compare node with itself");
+  if (a === b) throw new Error("Cannot compare node with itself");
   const ancestors = {
     a: get_ancestors(a),
     b: get_ancestors(b)
@@ -216,10 +215,8 @@ function compare(a, b) {
     let i = children.length;
     for (; i--; ) {
       const child = children[i];
-      if (child === furthest_ancestors.a)
-        return 1;
-      if (child === furthest_ancestors.b)
-        return -1;
+      if (child === furthest_ancestors.a) return 1;
+      if (child === furthest_ancestors.b) return -1;
     }
   }
   return Math.sign(z_indexes.a - z_indexes.b);
@@ -238,8 +235,7 @@ function find_stacking_context(nodes) {
   let i = nodes.length;
   for (; i--; ) {
     const node = nodes[i];
-    if (assert(node, "Missing node"), creates_stacking_context(node))
-      return node;
+    if (assert(node, "Missing node"), creates_stacking_context(node)) return node;
   }
   return null;
 }