mio-previewer 0.1.1 → 0.1.3

package/dist/dagre-6UL2VRFP-e70bbbAo.cjs

@@ -0,0 +1,4 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./custom-Bj6wd8Zo.cjs"),P=require("./graph-DxA9vrvy.cjs"),R=require("./layout-DWd-riGk.cjs"),N=require("./_baseUniq-BZgquYGf.cjs"),M=require("./clone-BIUMbfGI.cjs"),O=require("./_basePickBy-xJ9BT3zN.cjs");function m(e){var o={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:q(e),edges:j(e)};return N.isUndefined(e.graph())||(o.value=M.clone(e.graph())),o}function q(e){return O.map(e.nodes(),function(o){var n=e.node(o),l=e.parent(o),s={v:o};return N.isUndefined(n)||(s.value=n),N.isUndefined(l)||(s.parent=l),s})}function j(e){return O.map(e.edges(),function(o){var n=e.edge(o),l={v:o.v,w:o.w};return N.isUndefined(o.name)||(l.name=o.name),N.isUndefined(n)||(l.value=n),l})}var a=new Map,y=new Map,k=new Map,U=t.__name(()=>{y.clear(),k.clear(),a.clear()},"clear"),S=t.__name((e,o)=>{const n=y.get(o)||[];return t.log.trace("In isDescendant",o," ",e," = ",n.includes(e)),n.includes(e)},"isDescendant"),F=t.__name((e,o)=>{const n=y.get(o)||[];return t.log.info("Descendants of ",o," is ",n),t.log.info("Edge is ",e),e.v===o||e.w===o?!1:n?n.includes(e.v)||S(e.v,o)||S(e.w,o)||n.includes(e.w):(t.log.debug("Tilt, ",o,",not in descendants"),!1)},"edgeInCluster"),B=t.__name((e,o,n,l)=>{t.log.warn("Copying children of ",e,"root",l,"data",o.node(e),l);const s=o.children(e)||[];e!==l&&s.push(e),t.log.warn("Copying (nodes) clusterId",e,"nodes",s),s.forEach(r=>{if(o.children(r).length>0)B(r,o,n,l);else{const d=o.node(r);t.log.info("cp ",r," to ",l," with parent ",e),n.setNode(r,d),l!==o.parent(r)&&(t.log.warn("Setting parent",r,o.parent(r)),n.setParent(r,o.parent(r))),e!==l&&r!==e?(t.log.debug("Setting parent",r,e),n.setParent(r,e)):(t.log.info("In copy ",e,"root",l,"data",o.node(e),l),t.log.debug("Not Setting parent for node=",r,"cluster!==rootId",e!==l,"node!==clusterId",r!==e));const g=o.edges(r);t.log.debug("Copying Edges",g),g.forEach(c=>{t.log.info("Edge",c);const w=o.edge(c.v,c.w,c.name);t.log.info("Edge data",w,l);try{F(c,l)?(t.log.info("Copying as ",c.v,c.w,w,c.name),n.setEdge(c.v,c.w,w,c.name),t.log.info("newGraph edges ",n.edges(),n.edge(n.edges()[0]))):t.log.info("Skipping copy of edge ",c.v,"-->",c.w," rootId: ",l," clusterId:",e)}catch(h){t.log.error(h)}})}t.log.debug("Removing node",r),o.removeNode(r)})},"copy"),A=t.__name((e,o)=>{const n=o.children(e);let l=[...n];for(const s of n)k.set(s,e),l=[...l,...A(s,o)];return l},"extractDescendants"),Y=t.__name((e,o,n)=>{const l=e.edges().filter(c=>c.v===o||c.w===o),s=e.edges().filter(c=>c.v===n||c.w===n),r=l.map(c=>({v:c.v===o?n:c.v,w:c.w===o?o:c.w})),d=s.map(c=>({v:c.v,w:c.w}));return r.filter(c=>d.some(w=>c.v===w.v&&c.w===w.w))},"findCommonEdges"),b=t.__name((e,o,n)=>{const l=o.children(e);if(t.log.trace("Searching children of id ",e,l),l.length<1)return e;let s;for(const r of l){const d=b(r,o,n),g=Y(o,n,d);if(d)if(g.length>0)s=d;else return d}return s},"findNonClusterChild"),D=t.__name(e=>!a.has(e)||!a.get(e).externalConnections?e:a.has(e)?a.get(e).id:e,"getAnchorId"),H=t.__name((e,o)=>{if(!e||o>10){t.log.debug("Opting out, no graph ");return}else t.log.debug("Opting in, graph ");e.nodes().forEach(function(n){e.children(n).length>0&&(t.log.warn("Cluster identified",n," Replacement id in edges: ",b(n,e,n)),y.set(n,A(n,e)),a.set(n,{id:b(n,e,n),clusterData:e.node(n)}))}),e.nodes().forEach(function(n){const l=e.children(n),s=e.edges();l.length>0?(t.log.debug("Cluster identified",n,y),s.forEach(r=>{const d=S(r.v,n),g=S(r.w,n);d^g&&(t.log.warn("Edge: ",r," leaves cluster ",n),t.log.warn("Descendants of XXX ",n,": ",y.get(n)),a.get(n).externalConnections=!0)})):t.log.debug("Not a cluster ",n,y)});for(let n of a.keys()){const l=a.get(n).id,s=e.parent(l);s!==n&&a.has(s)&&!a.get(s).externalConnections&&(a.get(n).id=s)}e.edges().forEach(function(n){const l=e.edge(n);t.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(n)),t.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(e.edge(n)));let s=n.v,r=n.w;if(t.log.warn("Fix XXX",a,"ids:",n.v,n.w,"Translating: ",a.get(n.v)," --- ",a.get(n.w)),a.get(n.v)||a.get(n.w)){if(t.log.warn("Fixing and trying - removing XXX",n.v,n.w,n.name),s=D(n.v),r=D(n.w),e.removeEdge(n.v,n.w,n.name),s!==n.v){const d=e.parent(s);a.get(d).externalConnections=!0,l.fromCluster=n.v}if(r!==n.w){const d=e.parent(r);a.get(d).externalConnections=!0,l.toCluster=n.w}t.log.warn("Fix Replacing with XXX",s,r,n.name),e.setEdge(s,r,l,n.name)}}),t.log.warn("Adjusted Graph",m(e)),J(e,0),t.log.trace(a)},"adjustClustersAndEdges"),J=t.__name((e,o)=>{if(t.log.warn("extractor - ",o,m(e),e.children("D")),o>10){t.log.error("Bailing out");return}let n=e.nodes(),l=!1;for(const s of n){const r=e.children(s);l=l||r.length>0}if(!l){t.log.debug("Done, no node has children",e.nodes());return}t.log.debug("Nodes = ",n,o);for(const s of n)if(t.log.debug("Extracting node",s,a,a.has(s)&&!a.get(s).externalConnections,!e.parent(s),e.node(s),e.children("D")," Depth ",o),!a.has(s))t.log.debug("Not a cluster",s,o);else if(!a.get(s).externalConnections&&e.children(s)&&e.children(s).length>0){t.log.warn("Cluster without external connections, without a parent and with children",s,o);let d=e.graph().rankdir==="TB"?"LR":"TB";a.get(s)?.clusterData?.dir&&(d=a.get(s).clusterData.dir,t.log.warn("Fixing dir",a.get(s).clusterData.dir,d));const g=new P.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:d,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});t.log.warn("Old graph before copy",m(e)),B(s,e,g,s),e.setNode(s,{clusterNode:!0,id:s,clusterData:a.get(s).clusterData,label:a.get(s).label,graph:g}),t.log.warn("New graph after copy node: (",s,")",m(g)),t.log.debug("Old graph after copy",m(e))}else t.log.warn("Cluster ** ",s," **not meeting the criteria !externalConnections:",!a.get(s).externalConnections," no parent: ",!e.parent(s)," children ",e.children(s)&&e.children(s).length>0,e.children("D"),o),t.log.debug(a);n=e.nodes(),t.log.warn("New list of nodes",n);for(const s of n){const r=e.node(s);t.log.warn(" Now next level",s,r),r?.clusterNode&&J(r.graph,o+1)}},"extractor"),T=t.__name((e,o)=>{if(o.length===0)return[];let n=Object.assign([],o);return o.forEach(l=>{const s=e.children(l),r=T(e,s);n=[...n,...r]}),n},"sorter"),V=t.__name(e=>T(e,e.children()),"sortNodesByHierarchy"),G=t.__name(async(e,o,n,l,s,r)=>{t.log.warn("Graph in recursive render:XAX",m(o),s);const d=o.graph().rankdir;t.log.trace("Dir in recursive render - dir:",d);const g=e.insert("g").attr("class","root");o.nodes()?t.log.info("Recursive render XXX",o.nodes()):t.log.info("No nodes found for",o),o.edges().length>0&&t.log.info("Recursive edges",o.edge(o.edges()[0]));const c=g.insert("g").attr("class","clusters"),w=g.insert("g").attr("class","edgePaths"),h=g.insert("g").attr("class","edgeLabels"),v=g.insert("g").attr("class","nodes");await Promise.all(o.nodes().map(async function(f){const i=o.node(f);if(s!==void 0){const u=JSON.parse(JSON.stringify(s.clusterData));t.log.trace(`Setting data for parent cluster XXX
+ Node.id = `,f,`
+ data=`,u.height,`
+Parent cluster`,s.height),o.setNode(s.id,u),o.parent(f)||(t.log.trace("Setting parent",f,s.id),o.setParent(f,s.id,u))}if(t.log.info("(Insert) Node XXX"+f+": "+JSON.stringify(o.node(f))),i?.clusterNode){t.log.info("Cluster identified XBX",f,i.width,o.node(f));const{ranksep:u,nodesep:p}=o.graph();i.graph.setGraph({...i.graph.graph(),ranksep:u+25,nodesep:p});const E=await G(v,i.graph,n,l,o.node(f),r),_=E.elem;t.updateNodeBounds(i,_),i.diff=E.diff||0,t.log.info("New compound node after recursive render XAX",f,"width",i.width,"height",i.height),t.setNodeElem(_,i)}else o.children(f).length>0?(t.log.trace("Cluster - the non recursive path XBX",f,i.id,i,i.width,"Graph:",o),t.log.trace(b(i.id,o)),a.set(i.id,{id:b(i.id,o),node:i})):(t.log.trace("Node - the non recursive path XAX",f,v,o.node(f),d),await t.insertNode(v,o.node(f),{config:r,dir:d}))})),await t.__name(async()=>{const f=o.edges().map(async function(i){const u=o.edge(i.v,i.w,i.name);t.log.info("Edge "+i.v+" -> "+i.w+": "+JSON.stringify(i)),t.log.info("Edge "+i.v+" -> "+i.w+": ",i," ",JSON.stringify(o.edge(i))),t.log.info("Fix",a,"ids:",i.v,i.w,"Translating: ",a.get(i.v),a.get(i.w)),await t.insertEdgeLabel(h,u)});await Promise.all(f)},"processEdges")(),t.log.info("Graph before layout:",JSON.stringify(m(o))),t.log.info("############################################# XXX"),t.log.info("###                Layout                 ### XXX"),t.log.info("############################################# XXX"),R.layout(o),t.log.info("Graph after layout:",JSON.stringify(m(o)));let x=0,{subGraphTitleTotalMargin:C}=t.getSubGraphTitleMargins(r);return await Promise.all(V(o).map(async function(f){const i=o.node(f);if(t.log.info("Position XBX => "+f+": ("+i.x,","+i.y,") width: ",i.width," height: ",i.height),i?.clusterNode)i.y+=C,t.log.info("A tainted cluster node XBX1",f,i.id,i.width,i.height,i.x,i.y,o.parent(f)),a.get(i.id).node=i,t.positionNode(i);else if(o.children(f).length>0){t.log.info("A pure cluster node XBX1",f,i.id,i.x,i.y,i.width,i.height,o.parent(f)),i.height+=C,o.node(i.parentId);const u=i?.padding/2||0,p=i?.labelBBox?.height||0,E=p-u||0;t.log.debug("OffsetY",E,"labelHeight",p,"halfPadding",u),await t.insertCluster(c,i),a.get(i.id).node=i}else{const u=o.node(i.parentId);i.y+=C/2,t.log.info("A regular node XBX1 - using the padding",i.id,"parent",i.parentId,i.width,i.height,i.x,i.y,"offsetY",i.offsetY,"parent",u,u?.offsetY,i),t.positionNode(i)}})),o.edges().forEach(function(f){const i=o.edge(f);t.log.info("Edge "+f.v+" -> "+f.w+": "+JSON.stringify(i),i),i.points.forEach(_=>_.y+=C/2);const u=o.node(f.v);var p=o.node(f.w);const E=t.insertEdge(w,i,a,n,u,p,l);t.positionEdgeLabel(i,E)}),o.nodes().forEach(function(f){const i=o.node(f);t.log.info(f,i.type,i.diff),i.isGroup&&(x=i.diff)}),t.log.warn("Returning from recursive render XAX",g,x),{elem:g,diff:x}},"recursiveRender"),z=t.__name(async(e,o)=>{const n=new P.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:e.direction,nodesep:e.config?.nodeSpacing||e.config?.flowchart?.nodeSpacing||e.nodeSpacing,ranksep:e.config?.rankSpacing||e.config?.flowchart?.rankSpacing||e.rankSpacing,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}}),l=o.select("g");t.markers_default(l,e.markers,e.type,e.diagramId),t.clear2(),t.clear$1(),t.clear$2(),U(),e.nodes.forEach(r=>{n.setNode(r.id,{...r}),r.parentId&&n.setParent(r.id,r.parentId)}),t.log.debug("Edges:",e.edges),e.edges.forEach(r=>{if(r.start===r.end){const d=r.start,g=d+"---"+d+"---1",c=d+"---"+d+"---2",w=n.node(d);n.setNode(g,{domId:g,id:g,parentId:w.parentId,labelStyle:"",label:"",padding:0,shape:"labelRect",style:"",width:10,height:10}),n.setParent(g,w.parentId),n.setNode(c,{domId:c,id:c,parentId:w.parentId,labelStyle:"",padding:0,shape:"labelRect",label:"",style:"",width:10,height:10}),n.setParent(c,w.parentId);const h=structuredClone(r),v=structuredClone(r),X=structuredClone(r);h.label="",h.arrowTypeEnd="none",h.id=d+"-cyclic-special-1",v.arrowTypeStart="none",v.arrowTypeEnd="none",v.id=d+"-cyclic-special-mid",X.label="",w.isGroup&&(h.fromCluster=d,X.toCluster=d),X.id=d+"-cyclic-special-2",X.arrowTypeStart="none",n.setEdge(d,g,h,d+"-cyclic-special-0"),n.setEdge(g,c,v,d+"-cyclic-special-1"),n.setEdge(c,d,X,d+"-cyc<lic-special-2")}else n.setEdge(r.start,r.end,{...r},r.id)}),t.log.warn("Graph at first:",JSON.stringify(m(n))),H(n),t.log.warn("Graph after XAX:",JSON.stringify(m(n)));const s=t.getConfig2();await G(l,n,e.type,e.diagramId,void 0,s)},"render");exports.render=z;

package/dist/{dagre-6UL2VRFP-Cfh4UdSr.js → dagre-6UL2VRFP-wwVKK1c4.js}

@@ -1,9 +1,9 @@
-import { _ as w, aw as F, ax as Y, ay as _, az as H, l as i, c as V, aA as z, aB as U, ag as $, al as q, ah as P, af as K, aC as Q, aD as W, aE as Z } from "./plugin-mermaid-y4lbJ7sL.js";
-import { G as B } from "./graph-DiGqaw_6.js";
-import { l as I } from "./layout-CHaNS4g6.js";
-import { i as b } from "./_baseUniq-Cwhfu1XM.js";
-import { c as L } from "./clone-D6h_cwF4.js";
-import { m as A } from "./_basePickBy-nvL1-X4h.js";
+import { _ as w, ar as F, as as Y, at as _, au as H, l as r, c as V, av as z, aw as U, ag as $, al as q, ah as P, af as K, ax as Q, ay as W, az as Z } from "./custom-DpenvaVL.js";
+import { G as B } from "./graph-DuYupv9-.js";
+import { l as I } from "./layout-C2ZYHFpX.js";
+import { i as b } from "./_baseUniq-Tf9Kt8z-.js";
+import { c as L } from "./clone-AbZIjD3b.js";
+import { m as A } from "./_basePickBy-BPvpJ2um.js";
 function h(e) {
   var t = {
     options: {
@@ -18,8 +18,8 @@ function h(e) {
 }
 function ee(e) {
   return A(e.nodes(), function(t) {
-    var n = e.node(t), a = e.parent(t), r = { v: t };
-    return b(n) || (r.value = n), b(a) || (r.parent = a), r;
+    var n = e.node(t), a = e.parent(t), i = { v: t };
+    return b(n) || (i.value = n), b(a) || (i.parent = a), i;
   });
 }
 function ne(e) {
@@ -32,12 +32,12 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
   y.clear(), J.clear(), d.clear();
 }, "clear"), D = /* @__PURE__ */ w((e, t) => {
   const n = y.get(t) || [];
-  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
+  return r.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
 }, "isDescendant"), se = /* @__PURE__ */ w((e, t) => {
   const n = y.get(t) || [];
-  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || D(e.v, t) || D(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
+  return r.info("Descendants of ", t, " is ", n), r.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || D(e.v, t) || D(e.w, t) || n.includes(e.w) : (r.debug("Tilt, ", t, ",not in descendants"), !1);
 }, "edgeInCluster"), G = /* @__PURE__ */ w((e, t, n, a) => {
-  i.warn(
+  r.warn(
     "Copying children of ",
     e,
     "root",
@@ -46,13 +46,13 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
     t.node(e),
     a
   );
-  const r = t.children(e) || [];
-  e !== a && r.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", r), r.forEach((o) => {
+  const i = t.children(e) || [];
+  e !== a && i.push(e), r.warn("Copying (nodes) clusterId", e, "nodes", i), i.forEach((o) => {
     if (t.children(o).length > 0)
       G(o, t, n, a);
     else {
       const l = t.node(o);
-      i.info("cp ", o, " to ", a, " with parent ", e), n.setNode(o, l), a !== t.parent(o) && (i.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== a && o !== e ? (i.debug("Setting parent", o, e), n.setParent(o, e)) : (i.info("In copy ", e, "root", a, "data", t.node(e), a), i.debug(
+      r.info("cp ", o, " to ", a, " with parent ", e), n.setNode(o, l), a !== t.parent(o) && (r.warn("Setting parent", o, t.parent(o)), n.setParent(o, t.parent(o))), e !== a && o !== e ? (r.debug("Setting parent", o, e), n.setParent(o, e)) : (r.info("In copy ", e, "root", a, "data", t.node(e), a), r.debug(
         "Not Setting parent for node=",
         o,
         "cluster!==rootId",
@@ -61,12 +61,12 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
         o !== e
       ));
       const u = t.edges(o);
-      i.debug("Copying Edges", u), u.forEach((c) => {
-        i.info("Edge", c);
+      r.debug("Copying Edges", u), u.forEach((c) => {
+        r.info("Edge", c);
         const m = t.edge(c.v, c.w, c.name);
-        i.info("Edge data", m, a);
+        r.info("Edge data", m, a);
         try {
-          se(c, a) ? (i.info("Copying as ", c.v, c.w, m, c.name), n.setEdge(c.v, c.w, m, c.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
+          se(c, a) ? (r.info("Copying as ", c.v, c.w, m, c.name), n.setEdge(c.v, c.w, m, c.name), r.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : r.info(
             "Skipping copy of edge ",
             c.v,
             "-->",
@@ -77,64 +77,64 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
             e
           );
         } catch (v) {
-          i.error(v);
+          r.error(v);
         }
       });
     }
-    i.debug("Removing node", o), t.removeNode(o);
+    r.debug("Removing node", o), t.removeNode(o);
   });
 }, "copy"), R = /* @__PURE__ */ w((e, t) => {
   const n = t.children(e);
   let a = [...n];
-  for (const r of n)
-    J.set(r, e), a = [...a, ...R(r, t)];
+  for (const i of n)
+    J.set(i, e), a = [...a, ...R(i, t)];
   return a;
-}, "extractDescendants"), ie = /* @__PURE__ */ w((e, t, n) => {
-  const a = e.edges().filter((c) => c.v === t || c.w === t), r = e.edges().filter((c) => c.v === n || c.w === n), o = a.map((c) => ({ v: c.v === t ? n : c.v, w: c.w === t ? t : c.w })), l = r.map((c) => ({ v: c.v, w: c.w }));
+}, "extractDescendants"), re = /* @__PURE__ */ w((e, t, n) => {
+  const a = e.edges().filter((c) => c.v === t || c.w === t), i = e.edges().filter((c) => c.v === n || c.w === n), o = a.map((c) => ({ v: c.v === t ? n : c.v, w: c.w === t ? t : c.w })), l = i.map((c) => ({ v: c.v, w: c.w }));
   return o.filter((c) => l.some((m) => c.v === m.v && c.w === m.w));
 }, "findCommonEdges"), C = /* @__PURE__ */ w((e, t, n) => {
   const a = t.children(e);
-  if (i.trace("Searching children of id ", e, a), a.length < 1)
+  if (r.trace("Searching children of id ", e, a), a.length < 1)
     return e;
-  let r;
+  let i;
   for (const o of a) {
-    const l = C(o, t, n), u = ie(t, n, l);
+    const l = C(o, t, n), u = re(t, n, l);
     if (l)
       if (u.length > 0)
-        r = l;
+        i = l;
       else
         return l;
   }
-  return r;
-}, "findNonClusterChild"), k = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ w((e, t) => {
+  return i;
+}, "findNonClusterChild"), k = /* @__PURE__ */ w((e) => !d.has(e) || !d.get(e).externalConnections ? e : d.has(e) ? d.get(e).id : e, "getAnchorId"), ie = /* @__PURE__ */ w((e, t) => {
   if (!e || t > 10) {
-    i.debug("Opting out, no graph ");
+    r.debug("Opting out, no graph ");
     return;
   } else
-    i.debug("Opting in, graph ");
+    r.debug("Opting in, graph ");
   e.nodes().forEach(function(n) {
-    e.children(n).length > 0 && (i.warn(
+    e.children(n).length > 0 && (r.warn(
       "Cluster identified",
       n,
       " Replacement id in edges: ",
       C(n, e, n)
     ), y.set(n, R(n, e)), d.set(n, { id: C(n, e, n), clusterData: e.node(n) }));
   }), e.nodes().forEach(function(n) {
-    const a = e.children(n), r = e.edges();
-    a.length > 0 ? (i.debug("Cluster identified", n, y), r.forEach((o) => {
+    const a = e.children(n), i = e.edges();
+    a.length > 0 ? (r.debug("Cluster identified", n, y), i.forEach((o) => {
       const l = D(o.v, n), u = D(o.w, n);
-      l ^ u && (i.warn("Edge: ", o, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", y.get(n)), d.get(n).externalConnections = !0);
-    })) : i.debug("Not a cluster ", n, y);
+      l ^ u && (r.warn("Edge: ", o, " leaves cluster ", n), r.warn("Descendants of XXX ", n, ": ", y.get(n)), d.get(n).externalConnections = !0);
+    })) : r.debug("Not a cluster ", n, y);
   });
   for (let n of d.keys()) {
-    const a = d.get(n).id, r = e.parent(a);
-    r !== n && d.has(r) && !d.get(r).externalConnections && (d.get(n).id = r);
+    const a = d.get(n).id, i = e.parent(a);
+    i !== n && d.has(i) && !d.get(i).externalConnections && (d.get(n).id = i);
   }
   e.edges().forEach(function(n) {
     const a = e.edge(n);
-    i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
-    let r = n.v, o = n.w;
-    if (i.warn(
+    r.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), r.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let i = n.v, o = n.w;
+    if (r.warn(
       "Fix XXX",
       d,
       "ids:",
@@ -145,53 +145,53 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
       " --- ",
       d.get(n.w)
     ), d.get(n.v) || d.get(n.w)) {
-      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), r = k(n.v), o = k(n.w), e.removeEdge(n.v, n.w, n.name), r !== n.v) {
-        const l = e.parent(r);
+      if (r.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), i = k(n.v), o = k(n.w), e.removeEdge(n.v, n.w, n.name), i !== n.v) {
+        const l = e.parent(i);
         d.get(l).externalConnections = !0, a.fromCluster = n.v;
       }
       if (o !== n.w) {
         const l = e.parent(o);
         d.get(l).externalConnections = !0, a.toCluster = n.w;
       }
-      i.warn("Fix Replacing with XXX", r, o, n.name), e.setEdge(r, o, a, n.name);
+      r.warn("Fix Replacing with XXX", i, o, n.name), e.setEdge(i, o, a, n.name);
     }
-  }), i.warn("Adjusted Graph", h(e)), T(e, 0), i.trace(d);
+  }), r.warn("Adjusted Graph", h(e)), T(e, 0), r.trace(d);
 }, "adjustClustersAndEdges"), T = /* @__PURE__ */ w((e, t) => {
-  if (i.warn("extractor - ", t, h(e), e.children("D")), t > 10) {
-    i.error("Bailing out");
+  if (r.warn("extractor - ", t, h(e), e.children("D")), t > 10) {
+    r.error("Bailing out");
     return;
   }
   let n = e.nodes(), a = !1;
-  for (const r of n) {
-    const o = e.children(r);
+  for (const i of n) {
+    const o = e.children(i);
     a = a || o.length > 0;
   }
   if (!a) {
-    i.debug("Done, no node has children", e.nodes());
+    r.debug("Done, no node has children", e.nodes());
     return;
   }
-  i.debug("Nodes = ", n, t);
-  for (const r of n)
-    if (i.debug(
+  r.debug("Nodes = ", n, t);
+  for (const i of n)
+    if (r.debug(
       "Extracting node",
-      r,
+      i,
       d,
-      d.has(r) && !d.get(r).externalConnections,
-      !e.parent(r),
-      e.node(r),
+      d.has(i) && !d.get(i).externalConnections,
+      !e.parent(i),
+      e.node(i),
       e.children("D"),
       " Depth ",
       t
-    ), !d.has(r))
-      i.debug("Not a cluster", r, t);
-    else if (!d.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
-      i.warn(
+    ), !d.has(i))
+      r.debug("Not a cluster", i, t);
+    else if (!d.get(i).externalConnections && e.children(i) && e.children(i).length > 0) {
+      r.warn(
         "Cluster without external connections, without a parent and with children",
-        r,
+        i,
         t
       );
       let l = e.graph().rankdir === "TB" ? "LR" : "TB";
-      d.get(r)?.clusterData?.dir && (l = d.get(r).clusterData.dir, i.warn("Fixing dir", d.get(r).clusterData.dir, l));
+      d.get(i)?.clusterData?.dir && (l = d.get(i).clusterData.dir, r.warn("Fixing dir", d.get(i).clusterData.dir, l));
       const u = new B({
         multigraph: !0,
         compound: !0
@@ -204,52 +204,52 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
       }).setDefaultEdgeLabel(function() {
         return {};
       });
-      i.warn("Old graph before copy", h(e)), G(r, e, u, r), e.setNode(r, {
+      r.warn("Old graph before copy", h(e)), G(i, e, u, i), e.setNode(i, {
         clusterNode: !0,
-        id: r,
-        clusterData: d.get(r).clusterData,
-        label: d.get(r).label,
+        id: i,
+        clusterData: d.get(i).clusterData,
+        label: d.get(i).label,
         graph: u
-      }), i.warn("New graph after copy node: (", r, ")", h(u)), i.debug("Old graph after copy", h(e));
+      }), r.warn("New graph after copy node: (", i, ")", h(u)), r.debug("Old graph after copy", h(e));
     } else
-      i.warn(
+      r.warn(
         "Cluster ** ",
-        r,
+        i,
         " **not meeting the criteria !externalConnections:",
-        !d.get(r).externalConnections,
+        !d.get(i).externalConnections,
         " no parent: ",
-        !e.parent(r),
+        !e.parent(i),
         " children ",
-        e.children(r) && e.children(r).length > 0,
+        e.children(i) && e.children(i).length > 0,
         e.children("D"),
         t
-      ), i.debug(d);
-  n = e.nodes(), i.warn("New list of nodes", n);
-  for (const r of n) {
-    const o = e.node(r);
-    i.warn(" Now next level", r, o), o?.clusterNode && T(o.graph, t + 1);
+      ), r.debug(d);
+  n = e.nodes(), r.warn("New list of nodes", n);
+  for (const i of n) {
+    const o = e.node(i);
+    r.warn(" Now next level", i, o), o?.clusterNode && T(o.graph, t + 1);
   }
 }, "extractor"), M = /* @__PURE__ */ w((e, t) => {
   if (t.length === 0)
     return [];
   let n = Object.assign([], t);
   return t.forEach((a) => {
-    const r = e.children(a), o = M(e, r);
+    const i = e.children(a), o = M(e, i);
     n = [...n, ...o];
   }), n;
-}, "sorter"), oe = /* @__PURE__ */ w((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ w(async (e, t, n, a, r, o) => {
-  i.warn("Graph in recursive render:XAX", h(t), r);
+}, "sorter"), oe = /* @__PURE__ */ w((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ w(async (e, t, n, a, i, o) => {
+  r.warn("Graph in recursive render:XAX", h(t), i);
   const l = t.graph().rankdir;
-  i.trace("Dir in recursive render - dir:", l);
+  r.trace("Dir in recursive render - dir:", l);
   const u = e.insert("g").attr("class", "root");
-  t.nodes() ? i.info("Recursive render XXX", t.nodes()) : i.info("No nodes found for", t), t.edges().length > 0 && i.info("Recursive edges", t.edge(t.edges()[0]));
+  t.nodes() ? r.info("Recursive render XXX", t.nodes()) : r.info("No nodes found for", t), t.edges().length > 0 && r.info("Recursive edges", t.edge(t.edges()[0]));
   const c = u.insert("g").attr("class", "clusters"), m = u.insert("g").attr("class", "edgePaths"), v = u.insert("g").attr("class", "edgeLabels"), X = u.insert("g").attr("class", "nodes");
   await Promise.all(
     t.nodes().map(async function(f) {
       const s = t.node(f);
-      if (r !== void 0) {
-        const g = JSON.parse(JSON.stringify(r.clusterData));
-        i.trace(
+      if (i !== void 0) {
+        const g = JSON.parse(JSON.stringify(i.clusterData));
+        r.trace(
           `Setting data for parent cluster XXX
  Node.id = `,
           f,
@@ -258,11 +258,11 @@ var d = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), J = /* @__PURE
           g.height,
           `
 Parent cluster`,
-          r.height
-        ), t.setNode(r.id, g), t.parent(f) || (i.trace("Setting parent", f, r.id), t.setParent(f, r.id, g));
+          i.height
+        ), t.setNode(i.id, g), t.parent(f) || (r.trace("Setting parent", f, i.id), t.setParent(f, i.id, g));
       }
-      if (i.info("(Insert) Node XXX" + f + ": " + JSON.stringify(t.node(f))), s?.clusterNode) {
-        i.info("Cluster identified XBX", f, s.width, t.node(f));
+      if (r.info("(Insert) Node XXX" + f + ": " + JSON.stringify(t.node(f))), s?.clusterNode) {
+        r.info("Cluster identified XBX", f, s.width, t.node(f));
         const { ranksep: g, nodesep: E } = t.graph();
         s.graph.setGraph({
           ...s.graph.graph(),
@@ -277,7 +277,7 @@ Parent cluster`,
           t.node(f),
           o
         ), x = N.elem;
-        z(s, x), s.diff = N.diff || 0, i.info(
+        z(s, x), s.diff = N.diff || 0, r.info(
           "New compound node after recursive render XAX",
           f,
           "width",
@@ -289,7 +289,7 @@ Parent cluster`,
           // node.y
         ), U(x, s);
       } else
-        t.children(f).length > 0 ? (i.trace(
+        t.children(f).length > 0 ? (r.trace(
           "Cluster - the non recursive path XBX",
           f,
           s.id,
@@ -297,12 +297,12 @@ Parent cluster`,
           s.width,
           "Graph:",
           t
-        ), i.trace(C(s.id, t)), d.set(s.id, { id: C(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", f, X, t.node(f), l), await $(X, t.node(f), { config: o, dir: l }));
+        ), r.trace(C(s.id, t)), d.set(s.id, { id: C(s.id, t), node: s })) : (r.trace("Node - the non recursive path XAX", f, X, t.node(f), l), await $(X, t.node(f), { config: o, dir: l }));
     })
   ), await (/* @__PURE__ */ w(async () => {
     const f = t.edges().map(async function(s) {
       const g = t.edge(s.v, s.w, s.name);
-      i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
+      r.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), r.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), r.info(
         "Fix",
         d,
         "ids:",
@@ -314,12 +314,12 @@ Parent cluster`,
       ), await Z(v, g);
     });
     await Promise.all(f);
-  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(h(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(h(t)));
+  }, "processEdges"))(), r.info("Graph before layout:", JSON.stringify(h(t))), r.info("############################################# XXX"), r.info("###                Layout                 ### XXX"), r.info("############################################# XXX"), I(t), r.info("Graph after layout:", JSON.stringify(h(t)));
   let O = 0, { subGraphTitleTotalMargin: S } = q(o);
   return await Promise.all(
     oe(t).map(async function(f) {
       const s = t.node(f);
-      if (i.info(
+      if (r.info(
         "Position XBX => " + f + ": (" + s.x,
         "," + s.y,
         ") width: ",
@@ -327,7 +327,7 @@ Parent cluster`,
         " height: ",
         s.height
       ), s?.clusterNode)
-        s.y += S, i.info(
+        s.y += S, r.info(
           "A tainted cluster node XBX1",
           f,
           s.id,
@@ -338,7 +338,7 @@ Parent cluster`,
           t.parent(f)
         ), d.get(s.id).node = s, P(s);
       else if (t.children(f).length > 0) {
-        i.info(
+        r.info(
           "A pure cluster node XBX1",
           f,
           s.id,
@@ -349,10 +349,10 @@ Parent cluster`,
           t.parent(f)
         ), s.height += S, t.node(s.parentId);
         const g = s?.padding / 2 || 0, E = s?.labelBBox?.height || 0, N = E - g || 0;
-        i.debug("OffsetY", N, "labelHeight", E, "halfPadding", g), await K(c, s), d.get(s.id).node = s;
+        r.debug("OffsetY", N, "labelHeight", E, "halfPadding", g), await K(c, s), d.get(s.id).node = s;
       } else {
         const g = t.node(s.parentId);
-        s.y += S / 2, i.info(
+        s.y += S / 2, r.info(
           "A regular node XBX1 - using the padding",
           s.id,
           "parent",
@@ -372,15 +372,15 @@ Parent cluster`,
     })
   ), t.edges().forEach(function(f) {
     const s = t.edge(f);
-    i.info("Edge " + f.v + " -> " + f.w + ": " + JSON.stringify(s), s), s.points.forEach((x) => x.y += S / 2);
+    r.info("Edge " + f.v + " -> " + f.w + ": " + JSON.stringify(s), s), s.points.forEach((x) => x.y += S / 2);
     const g = t.node(f.v);
     var E = t.node(f.w);
     const N = Q(m, s, d, n, g, E, a);
     W(s, N);
   }), t.nodes().forEach(function(f) {
     const s = t.node(f);
-    i.info(f, s.type, s.diff), s.isGroup && (O = s.diff);
-  }), i.warn("Returning from recursive render XAX", u, O), { elem: u, diff: O };
+    r.info(f, s.type, s.diff), s.isGroup && (O = s.diff);
+  }), r.warn("Returning from recursive render XAX", u, O), { elem: u, diff: O };
 }, "recursiveRender"), ge = /* @__PURE__ */ w(async (e, t) => {
   const n = new B({
     multigraph: !0,
@@ -396,7 +396,7 @@ Parent cluster`,
   }), a = t.select("g");
   F(a, e.markers, e.type, e.diagramId), Y(), _(), H(), te(), e.nodes.forEach((o) => {
     n.setNode(o.id, { ...o }), o.parentId && n.setParent(o.id, o.parentId);
-  }), i.debug("Edges:", e.edges), e.edges.forEach((o) => {
+  }), r.debug("Edges:", e.edges), e.edges.forEach((o) => {
     if (o.start === o.end) {
       const l = o.start, u = l + "---" + l + "---1", c = l + "---" + l + "---2", m = n.node(l);
       n.setNode(u, {
@@ -428,15 +428,15 @@ Parent cluster`,
       v.label = "", v.arrowTypeEnd = "none", v.id = l + "-cyclic-special-1", X.arrowTypeStart = "none", X.arrowTypeEnd = "none", X.id = l + "-cyclic-special-mid", p.label = "", m.isGroup && (v.fromCluster = l, p.toCluster = l), p.id = l + "-cyclic-special-2", p.arrowTypeStart = "none", n.setEdge(l, u, v, l + "-cyclic-special-0"), n.setEdge(u, c, X, l + "-cyclic-special-1"), n.setEdge(c, l, p, l + "-cyc<lic-special-2");
     } else
       n.setEdge(o.start, o.end, { ...o }, o.id);
-  }), i.warn("Graph at first:", JSON.stringify(h(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(h(n)));
-  const r = V();
+  }), r.warn("Graph at first:", JSON.stringify(h(n))), ie(n), r.warn("Graph after XAX:", JSON.stringify(h(n)));
+  const i = V();
   await j(
     a,
     n,
     e.type,
     e.diagramId,
     void 0,
-    r
+    i
   );
 }, "render");
 export {

package/dist/{diagram-PSM6KHXK-BZDEX43o.js → diagram-PSM6KHXK-BvHkTFl-.js}

@@ -1,7 +1,7 @@
-import { _ as w, D as te, E as ae, H as he, e as ue, l as K, aZ as P, d as Y, b as pe, a as fe, p as ge, q as me, g as ye, s as Se, F as ve, a_ as xe, y as be } from "./plugin-mermaid-y4lbJ7sL.js";
-import { s as we } from "./chunk-QN33PNHL-BuyP9RXS.js";
-import { p as Ce } from "./chunk-4BX2VUAB-j8LeaMvy.js";
-import { p as Te } from "./mermaid-parser.core-CkQKh-yb.js";
+import { _ as w, D as te, E as ae, H as he, e as ue, l as K, a_ as P, d as Y, b as pe, a as fe, p as ge, q as me, g as ye, s as Se, F as ve, a$ as xe, y as be } from "./custom-DpenvaVL.js";
+import { s as we } from "./chunk-QN33PNHL-E13ckPQD.js";
+import { p as Ce } from "./chunk-4BX2VUAB-BM6KMQlI.js";
+import { p as Te } from "./mermaid-parser.core-9Cm7d5-2.js";
 import { b as O } from "./defaultLocale-D7EN2tov.js";
 import { o as J } from "./ordinal-DfAQgscy.js";
 function Le(t) {
@@ -97,10 +97,10 @@ function* Re() {
 }
 function Q(t, a) {
   t instanceof Map ? (t = [void 0, t], a === void 0 && (a = Ie)) : a === void 0 && (a = He);
-  for (var l = new Z(t), n, o = [l], s, d, h, g; n = o.pop(); )
+  for (var l = new U(t), n, o = [l], s, d, h, g; n = o.pop(); )
     if ((d = a(n.data)) && (g = (d = Array.from(d)).length))
       for (n.children = d, h = g - 1; h >= 0; --h)
-        o.push(s = d[h] = new Z(d[h])), s.parent = n, s.depth = n.depth + 1;
+        o.push(s = d[h] = new U(d[h])), s.parent = n, s.depth = n.depth + 1;
   return l.eachBefore(qe);
 }
 function We() {
@@ -121,11 +121,11 @@ function qe(t) {
     t.height = a;
   while ((t = t.parent) && t.height < ++a);
 }
-function Z(t) {
+function U(t) {
   this.data = t, this.depth = this.height = 0, this.parent = null;
 }
-Z.prototype = Q.prototype = {
-  constructor: Z,
+U.prototype = Q.prototype = {
+  constructor: U,
   count: $e,
   each: Ae,
   eachAfter: ke,
@@ -164,8 +164,8 @@ function Ye(t, a, l, n, o) {
   for (var s = t.children, d, h = -1, g = s.length, c = t.value && (o - l) / t.value; ++h < g; )
     d = s[h], d.x0 = a, d.x1 = n, d.y0 = l, d.y1 = l += d.value * c;
 }
-var Ze = (1 + Math.sqrt(5)) / 2;
-function Ue(t, a, l, n, o, s) {
+var Ue = (1 + Math.sqrt(5)) / 2;
+function Ze(t, a, l, n, o, s) {
   for (var d = [], h = a.children, g, c, u = 0, b = 0, r = h.length, x, S, v = a.value, p, m, N, k, V, R, M; u < r; ) {
     x = o - l, S = s - n;
     do
@@ -184,12 +184,12 @@ function Ue(t, a, l, n, o, s) {
 }
 const Je = (function t(a) {
   function l(n, o, s, d, h) {
-    Ue(a, n, o, s, d, h);
+    Ze(a, n, o, s, d, h);
   }
   return l.ratio = function(n) {
     return t((n = +n) > 1 ? n : 1);
   }, l;
-})(Ze);
+})(Ue);
 function Ke() {
   var t = Je, a = !1, l = 1, n = 1, o = [0], s = q, d = q, h = q, g = q, c = q;
   function u(r) {
@@ -440,12 +440,12 @@ var Qe = /* @__PURE__ */ w((t, a) => {
     let I = Math.max(
       z,
       Math.min(F, Math.round(y * T))
-    ), U = y + H + I;
-    for (; U > A && y > _ && (y--, I = Math.max(
+    ), Z = y + H + I;
+    for (; Z > A && y > _ && (y--, I = Math.max(
       z,
       Math.min(F, Math.round(y * T))
     ), !(I < z && y === _)); )
-      i.style("font-size", `${y}px`), U = y + H + I;
+      i.style("font-size", `${y}px`), Z = y + H + I;
     i.style("font-size", `${y}px`), (L.getComputedTextLength() > D || y < _ || A < y) && i.style("display", "none");
   }), s.showValues !== !1 && j.append("text").attr("class", "treemapValue").attr("x", (i) => (i.x1 - i.x0) / 2).attr("y", function(i) {
     return (i.y1 - i.y0) / 2;

package/dist/diagram-PSM6KHXK-ByERYM-3.cjs

@@ -0,0 +1,24 @@
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("./custom-Bj6wd8Zo.cjs"),se=require("./chunk-QN33PNHL-DD0xRcz_.cjs"),ie=require("./chunk-4BX2VUAB-BNg9BEzs.cjs"),oe=require("./mermaid-parser.core-2hw0AO3p.cjs"),I=require("./defaultLocale-DIVzfLaQ.cjs"),U=require("./ordinal-CagbB1m8.cjs");function ce(a){var t=0,l=a.children,n=l&&l.length;if(!n)t=1;else for(;--n>=0;)t+=l[n].value;a.value=t}function de(){return this.eachAfter(ce)}function ue(a,t){let l=-1;for(const n of this)a.call(t,n,++l,this);return this}function he(a,t){for(var l=this,n=[l],o,s,d=-1;l=n.pop();)if(a.call(t,l,++d,this),o=l.children)for(s=o.length-1;s>=0;--s)n.push(o[s]);return this}function pe(a,t){for(var l=this,n=[l],o=[],s,d,h,m=-1;l=n.pop();)if(o.push(l),s=l.children)for(d=0,h=s.length;d<h;++d)n.push(s[d]);for(;l=o.pop();)a.call(t,l,++m,this);return this}function fe(a,t){let l=-1;for(const n of this)if(a.call(t,n,++l,this))return n}function ge(a){return this.eachAfter(function(t){for(var l=+a(t.data)||0,n=t.children,o=n&&n.length;--o>=0;)l+=n[o].value;t.value=l})}function me(a){return this.eachBefore(function(t){t.children&&t.children.sort(a)})}function ye(a){for(var t=this,l=Se(t,a),n=[t];t!==l;)t=t.parent,n.push(t);for(var o=n.length;a!==l;)n.splice(o,0,a),a=a.parent;return n}function Se(a,t){if(a===t)return a;var l=a.ancestors(),n=t.ancestors(),o=null;for(a=l.pop(),t=n.pop();a===t;)o=a,a=l.pop(),t=n.pop();return o}function ve(){for(var a=this,t=[a];a=a.parent;)t.push(a);return t}function xe(){return Array.from(this)}function be(){var a=[];return this.eachBefore(function(t){t.children||a.push(t)}),a}function we(){var a=this,t=[];return a.each(function(l){l!==a&&t.push({source:l.parent,target:l})}),t}function*Ce(){var a=this,t,l=[a],n,o,s;do for(t=l.reverse(),l=[];a=t.pop();)if(yield a,n=a.children)for(o=0,s=n.length;o<s;++o)l.push(n[o]);while(l.length)}function Q(a,t){a instanceof Map?(a=[void 0,a],t===void 0&&(t=Le)):t===void 0&&(t=Te);for(var l=new j(a),n,o=[l],s,d,h,m;n=o.pop();)if((d=t(n.data))&&(m=(d=Array.from(d)).length))for(n.children=d,h=m-1;h>=0;--h)o.push(s=d[h]=new j(d[h])),s.parent=n,s.depth=n.depth+1;return l.eachBefore(Ae)}function _e(){return Q(this).eachBefore($e)}function Te(a){return a.children}function Le(a){return Array.isArray(a)?a[1]:null}function $e(a){a.data.value!==void 0&&(a.value=a.data.value),a.data=a.data.data}function Ae(a){var t=0;do a.height=t;while((a=a.parent)&&a.height<++t)}function j(a){this.data=a,this.depth=this.height=0,this.parent=null}j.prototype=Q.prototype={constructor:j,count:de,each:ue,eachAfter:pe,eachBefore:he,find:fe,sum:ge,sort:me,path:ye,ancestors:ve,descendants:xe,leaves:be,links:we,copy:_e,[Symbol.iterator]:Ce};function ke(a){if(typeof a!="function")throw new Error;return a}function q(){return 0}function O(a){return function(){return a}}function Ne(a){a.x0=Math.round(a.x0),a.y0=Math.round(a.y0),a.x1=Math.round(a.x1),a.y1=Math.round(a.y1)}function Me(a,t,l,n,o){for(var s=a.children,d,h=-1,m=s.length,c=a.value&&(n-t)/a.value;++h<m;)d=s[h],d.y0=l,d.y1=o,d.x0=t,d.x1=t+=d.value*c}function Fe(a,t,l,n,o){for(var s=a.children,d,h=-1,m=s.length,c=a.value&&(o-l)/a.value;++h<m;)d=s[h],d.x0=t,d.x1=n,d.y0=l,d.y1=l+=d.value*c}var ze=(1+Math.sqrt(5))/2;function Ve(a,t,l,n,o,s){for(var d=[],h=t.children,m,c,p=0,w=0,r=h.length,b,v,x=t.value,f,y,N,k,V,R,M;p<r;){b=o-l,v=s-n;do f=h[w++].value;while(!f&&w<r);for(y=N=f,R=Math.max(v/b,b/v)/(x*a),M=f*f*R,V=Math.max(N/M,M/y);w<r;++w){if(f+=c=h[w].value,c<y&&(y=c),c>N&&(N=c),M=f*f*R,k=Math.max(N/M,M/y),k>V){f-=c;break}V=k}d.push(m={value:f,dice:b<v,children:h.slice(p,w)}),m.dice?Me(m,l,n,o,x?n+=v*f/x:s):Fe(m,l,n,x?l+=b*f/x:o,s),x-=f,p=w}return d}const Pe=(function a(t){function l(n,o,s,d,h){Ve(t,n,o,s,d,h)}return l.ratio=function(n){return a((n=+n)>1?n:1)},l})(ze);function Be(){var a=Pe,t=!1,l=1,n=1,o=[0],s=q,d=q,h=q,m=q,c=q;function p(r){return r.x0=r.y0=0,r.x1=l,r.y1=n,r.eachBefore(w),o=[0],t&&r.eachBefore(Ne),r}function w(r){var b=o[r.depth],v=r.x0+b,x=r.y0+b,f=r.x1-b,y=r.y1-b;f<v&&(v=f=(v+f)/2),y<x&&(x=y=(x+y)/2),r.x0=v,r.y0=x,r.x1=f,r.y1=y,r.children&&(b=o[r.depth+1]=s(r)/2,v+=c(r)-b,x+=d(r)-b,f-=h(r)-b,y-=m(r)-b,f<v&&(v=f=(v+f)/2),y<x&&(x=y=(x+y)/2),a(r,v,x,f,y))}return p.round=function(r){return arguments.length?(t=!!r,p):t},p.size=function(r){return arguments.length?(l=+r[0],n=+r[1],p):[l,n]},p.tile=function(r){return arguments.length?(a=ke(r),p):a},p.padding=function(r){return arguments.length?p.paddingInner(r).paddingOuter(r):p.paddingInner()},p.paddingInner=function(r){return arguments.length?(s=typeof r=="function"?r:O(+r),p):s},p.paddingOuter=function(r){return arguments.length?p.paddingTop(r).paddingRight(r).paddingBottom(r).paddingLeft(r):p.paddingTop()},p.paddingTop=function(r){return arguments.length?(d=typeof r=="function"?r:O(+r),p):d},p.paddingRight=function(r){return arguments.length?(h=typeof r=="function"?r:O(+r),p):h},p.paddingBottom=function(r){return arguments.length?(m=typeof r=="function"?r:O(+r),p):m},p.paddingLeft=function(r){return arguments.length?(c=typeof r=="function"?r:O(+r),p):c},p}var D,J=(D=class{constructor(){this.nodes=[],this.levels=new Map,this.outerNodes=[],this.classes=new Map,this.setAccTitle=u.setAccTitle,this.getAccTitle=u.getAccTitle,this.setDiagramTitle=u.setDiagramTitle,this.getDiagramTitle=u.getDiagramTitle,this.getAccDescription=u.getAccDescription,this.setAccDescription=u.setAccDescription}getNodes(){return this.nodes}getConfig(){const t=u.defaultConfig_default,l=u.getConfig();return u.cleanAndMerge({...t.treemap,...l.treemap??{}})}addNode(t,l){this.nodes.push(t),this.levels.set(t,l),l===0&&(this.outerNodes.push(t),this.root??=t)}getRoot(){return{name:"",children:this.outerNodes}}addClass(t,l){const n=this.classes.get(t)??{id:t,styles:[],textStyles:[]},o=l.replace(/\\,/g,"§§§").replace(/,/g,";").replace(/§§§/g,",").split(";");o&&o.forEach(s=>{u.isLabelStyle(s)&&(n?.textStyles?n.textStyles.push(s):n.textStyles=[s]),n?.styles?n.styles.push(s):n.styles=[s]}),this.classes.set(t,n)}getClasses(){return this.classes}getStylesForClass(t){return this.classes.get(t)?.styles??[]}clear(){u.clear(),this.nodes=[],this.levels=new Map,this.outerNodes=[],this.classes=new Map,this.root=void 0}},u.__name(D,"TreeMapDB"),D);function K(a){if(!a.length)return[];const t=[],l=[];return a.forEach(n=>{const o={name:n.name,children:n.type==="Leaf"?void 0:[]};for(o.classSelector=n?.classSelector,n?.cssCompiledStyles&&(o.cssCompiledStyles=[n.cssCompiledStyles]),n.type==="Leaf"&&n.value!==void 0&&(o.value=n.value);l.length>0&&l[l.length-1].level>=n.level;)l.pop();if(l.length===0)t.push(o);else{const s=l[l.length-1].node;s.children?s.children.push(o):s.children=[o]}n.type!=="Leaf"&&l.push({node:o,level:n.level})}),t}u.__name(K,"buildHierarchy");var De=u.__name((a,t)=>{ie.populateCommonDb(a,t);const l=[];for(const s of a.TreemapRows??[])s.$type==="ClassDefStatement"&&t.addClass(s.className??"",s.styleText??"");for(const s of a.TreemapRows??[]){const d=s.item;if(!d)continue;const h=s.indent?parseInt(s.indent):0,m=Re(d),c=d.classSelector?t.getStylesForClass(d.classSelector):[],p=c.length>0?c.join(";"):void 0,w={level:h,name:m,type:d.$type,value:d.value,classSelector:d.classSelector,cssCompiledStyles:p};l.push(w)}const n=K(l),o=u.__name((s,d)=>{for(const h of s)t.addNode(h,d),h.children&&h.children.length>0&&o(h.children,d+1)},"addNodesRecursively");o(n,0)},"populate"),Re=u.__name(a=>a.name?String(a.name):"","getItemName"),ee={parser:{yy:void 0},parse:u.__name(async a=>{try{const t=oe.parse,l=await t("treemap",a);u.log.debug("Treemap AST:",l);const n=ee.parser?.yy;if(!(n instanceof J))throw new Error("parser.parser?.yy was not a TreemapDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues.");De(l,n)}catch(t){throw u.log.error("Error parsing treemap:",t),t}},"parse")},Ee=10,B=10,G=25,We=u.__name((a,t,l,n)=>{const o=n.db,s=o.getConfig(),d=s.padding??Ee,h=o.getDiagramTitle(),m=o.getRoot(),{themeVariables:c}=u.getConfig();if(!m)return;const p=h?30:0,w=u.selectSvgElement(t),r=s.nodeWidth?s.nodeWidth*B:960,b=s.nodeHeight?s.nodeHeight*B:500,v=r,x=b+p;w.attr("viewBox",`0 0 ${v} ${x}`),u.configureSvgSize(w,x,v,s.useMaxWidth);let f;try{const e=s.valueFormat||",";if(e==="$0,0")f=u.__name(i=>"$"+I.format(",")(i),"valueFormat");else if(e.startsWith("$")&&e.includes(",")){const i=/\.\d+/.exec(e),g=i?i[0]:"";f=u.__name(C=>"$"+I.format(","+g)(C),"valueFormat")}else if(e.startsWith("$")){const i=e.substring(1);f=u.__name(g=>"$"+I.format(i||"")(g),"valueFormat")}else f=I.format(e)}catch(e){u.log.error("Error creating format function:",e),f=I.format(",")}const y=U.ordinal().range(["transparent",c.cScale0,c.cScale1,c.cScale2,c.cScale3,c.cScale4,c.cScale5,c.cScale6,c.cScale7,c.cScale8,c.cScale9,c.cScale10,c.cScale11]),N=U.ordinal().range(["transparent",c.cScalePeer0,c.cScalePeer1,c.cScalePeer2,c.cScalePeer3,c.cScalePeer4,c.cScalePeer5,c.cScalePeer6,c.cScalePeer7,c.cScalePeer8,c.cScalePeer9,c.cScalePeer10,c.cScalePeer11]),k=U.ordinal().range([c.cScaleLabel0,c.cScaleLabel1,c.cScaleLabel2,c.cScaleLabel3,c.cScaleLabel4,c.cScaleLabel5,c.cScaleLabel6,c.cScaleLabel7,c.cScaleLabel8,c.cScaleLabel9,c.cScaleLabel10,c.cScaleLabel11]);h&&w.append("text").attr("x",v/2).attr("y",p/2).attr("class","treemapTitle").attr("text-anchor","middle").attr("dominant-baseline","middle").text(h);const V=w.append("g").attr("transform",`translate(0, ${p})`).attr("class","treemapContainer"),R=Q(m).sum(e=>e.value??0).sort((e,i)=>(i.value??0)-(e.value??0)),Z=Be().size([r,b]).paddingTop(e=>e.children&&e.children.length>0?G+B:0).paddingInner(d).paddingLeft(e=>e.children&&e.children.length>0?B:0).paddingRight(e=>e.children&&e.children.length>0?B:0).paddingBottom(e=>e.children&&e.children.length>0?B:0).round(!0)(R),te=Z.descendants().filter(e=>e.children&&e.children.length>0),E=V.selectAll(".treemapSection").data(te).enter().append("g").attr("class","treemapSection").attr("transform",e=>`translate(${e.x0},${e.y0})`);E.append("rect").attr("width",e=>e.x1-e.x0).attr("height",G).attr("class","treemapSectionHeader").attr("fill","none").attr("fill-opacity",.6).attr("stroke-width",.6).attr("style",e=>e.depth===0?"display: none;":""),E.append("clipPath").attr("id",(e,i)=>`clip-section-${t}-${i}`).append("rect").attr("width",e=>Math.max(0,e.x1-e.x0-12)).attr("height",G),E.append("rect").attr("width",e=>e.x1-e.x0).attr("height",e=>e.y1-e.y0).attr("class",(e,i)=>`treemapSection section${i}`).attr("fill",e=>y(e.data.name)).attr("fill-opacity",.6).attr("stroke",e=>N(e.data.name)).attr("stroke-width",2).attr("stroke-opacity",.4).attr("style",e=>{if(e.depth===0)return"display: none;";const i=u.styles2String({cssCompiledStyles:e.data.cssCompiledStyles});return i.nodeStyles+";"+i.borderStyles.join(";")}),E.append("text").attr("class","treemapSectionLabel").attr("x",6).attr("y",G/2).attr("dominant-baseline","middle").text(e=>e.depth===0?"":e.data.name).attr("font-weight","bold").attr("style",e=>{if(e.depth===0)return"display: none;";const i="dominant-baseline: middle; font-size: 12px; fill:"+k(e.data.name)+"; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;",g=u.styles2String({cssCompiledStyles:e.data.cssCompiledStyles});return i+g.labelStyles.replace("color:","fill:")}).each(function(e){if(e.depth===0)return;const i=u.select(this),g=e.data.name;i.text(g);const C=e.x1-e.x0,T=6;let L;s.showValues!==!1&&e.value?L=C-10-30-10-T:L=C-T-6;const $=Math.max(15,L),S=i.node();if(S.getComputedTextLength()>$){let _=g;for(;_.length>0;){if(_=g.substring(0,_.length-1),_.length===0){i.text("..."),S.getComputedTextLength()>$&&i.text("");break}if(i.text(_+"..."),S.getComputedTextLength()<=$)break}}}),s.showValues!==!1&&E.append("text").attr("class","treemapSectionValue").attr("x",e=>e.x1-e.x0-10).attr("y",G/2).attr("text-anchor","end").attr("dominant-baseline","middle").text(e=>e.value?f(e.value):"").attr("font-style","italic").attr("style",e=>{if(e.depth===0)return"display: none;";const i="text-anchor: end; dominant-baseline: middle; font-size: 10px; fill:"+k(e.data.name)+"; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;",g=u.styles2String({cssCompiledStyles:e.data.cssCompiledStyles});return i+g.labelStyles.replace("color:","fill:")});const ae=Z.leaves(),X=V.selectAll(".treemapLeafGroup").data(ae).enter().append("g").attr("class",(e,i)=>`treemapNode treemapLeafGroup leaf${i}${e.data.classSelector?` ${e.data.classSelector}`:""}x`).attr("transform",e=>`translate(${e.x0},${e.y0})`);X.append("rect").attr("width",e=>e.x1-e.x0).attr("height",e=>e.y1-e.y0).attr("class","treemapLeaf").attr("fill",e=>e.parent?y(e.parent.data.name):y(e.data.name)).attr("style",e=>u.styles2String({cssCompiledStyles:e.data.cssCompiledStyles}).nodeStyles).attr("fill-opacity",.3).attr("stroke",e=>e.parent?y(e.parent.data.name):y(e.data.name)).attr("stroke-width",3),X.append("clipPath").attr("id",(e,i)=>`clip-${t}-${i}`).append("rect").attr("width",e=>Math.max(0,e.x1-e.x0-4)).attr("height",e=>Math.max(0,e.y1-e.y0-4)),X.append("text").attr("class","treemapLabel").attr("x",e=>(e.x1-e.x0)/2).attr("y",e=>(e.y1-e.y0)/2).attr("style",e=>{const i="text-anchor: middle; dominant-baseline: middle; font-size: 38px;fill:"+k(e.data.name)+";",g=u.styles2String({cssCompiledStyles:e.data.cssCompiledStyles});return i+g.labelStyles.replace("color:","fill:")}).attr("clip-path",(e,i)=>`url(#clip-${t}-${i})`).text(e=>e.data.name).each(function(e){const i=u.select(this),g=e.x1-e.x0,C=e.y1-e.y0,T=i.node(),L=4,P=g-2*L,$=C-2*L;if(P<10||$<10){i.style("display","none");return}let S=parseInt(i.style("font-size"),10);const F=8,A=28,_=.6,z=6,W=2;for(;T.getComputedTextLength()>P&&S>F;)S--,i.style("font-size",`${S}px`);let H=Math.max(z,Math.min(A,Math.round(S*_))),Y=S+W+H;for(;Y>$&&S>F&&(S--,H=Math.max(z,Math.min(A,Math.round(S*_))),!(H<z&&S===F));)i.style("font-size",`${S}px`),Y=S+W+H;i.style("font-size",`${S}px`),(T.getComputedTextLength()>P||S<F||$<S)&&i.style("display","none")}),s.showValues!==!1&&X.append("text").attr("class","treemapValue").attr("x",i=>(i.x1-i.x0)/2).attr("y",function(i){return(i.y1-i.y0)/2}).attr("style",i=>{const g="text-anchor: middle; dominant-baseline: hanging; font-size: 28px;fill:"+k(i.data.name)+";",C=u.styles2String({cssCompiledStyles:i.data.cssCompiledStyles});return g+C.labelStyles.replace("color:","fill:")}).attr("clip-path",(i,g)=>`url(#clip-${t}-${g})`).text(i=>i.value?f(i.value):"").each(function(i){const g=u.select(this),C=this.parentNode;if(!C){g.style("display","none");return}const T=u.select(C).select(".treemapLabel");if(T.empty()||T.style("display")==="none"){g.style("display","none");return}const L=parseFloat(T.style("font-size")),P=28,$=.6,S=6,F=2,A=Math.max(S,Math.min(P,Math.round(L*$)));g.style("font-size",`${A}px`);const z=(i.y1-i.y0)/2+L/2+F;g.attr("y",z);const W=i.x1-i.x0,le=i.y1-i.y0-4,re=W-8;g.node().getComputedTextLength()>re||z+A>le||A<S?g.style("display","none"):g.style("display",null)});const ne=s.diagramPadding??8;se.setupViewPortForSVG(w,ne,"flowchart",s?.useMaxWidth||!1)},"draw"),He=u.__name(function(a,t){return t.db.getClasses()},"getClasses"),Ie={draw:We,getClasses:He},qe={sectionStrokeColor:"black",sectionStrokeWidth:"1",sectionFillColor:"#efefef",leafStrokeColor:"black",leafStrokeWidth:"1",leafFillColor:"#efefef",labelColor:"black",labelFontSize:"12px",valueFontSize:"10px",valueColor:"black",titleColor:"black",titleFontSize:"14px"},Oe=u.__name(({treemap:a}={})=>{const t=u.cleanAndMerge(qe,a);return`
+  .treemapNode.section {
+    stroke: ${t.sectionStrokeColor};
+    stroke-width: ${t.sectionStrokeWidth};
+    fill: ${t.sectionFillColor};
+  }
+  .treemapNode.leaf {
+    stroke: ${t.leafStrokeColor};
+    stroke-width: ${t.leafStrokeWidth};
+    fill: ${t.leafFillColor};
+  }
+  .treemapLabel {
+    fill: ${t.labelColor};
+    font-size: ${t.labelFontSize};
+  }
+  .treemapValue {
+    fill: ${t.valueColor};
+    font-size: ${t.valueFontSize};
+  }
+  .treemapTitle {
+    fill: ${t.titleColor};
+    font-size: ${t.titleFontSize};
+  }
+  `},"getStyles"),Ge=Oe,Xe={parser:ee,get db(){return new J},renderer:Ie,styles:Ge};exports.diagram=Xe;