@superlc/md-core 0.1.1 → 0.2.1

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

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

package/dist/dagre-6UL2VRFP-lY6fElcy.js

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

package/dist/defaultLocale-BgPVtth8.js

@@ -0,0 +1,171 @@
+function J(n) {
+  return Math.abs(n = Math.round(n)) >= 1e21 ? n.toLocaleString("en").replace(/,/g, "") : n.toString(10);
+}
+function j(n, t) {
+  if (!isFinite(n) || n === 0) return null;
+  var e = (n = t ? n.toExponential(t - 1) : n.toExponential()).indexOf("e"), i = n.slice(0, e);
+  return [
+    i.length > 1 ? i[0] + i.slice(2) : i,
+    +n.slice(e + 1)
+  ];
+}
+function K(n) {
+  return n = j(Math.abs(n)), n ? n[1] : NaN;
+}
+function Q(n, t) {
+  return function(e, i) {
+    for (var o = e.length, a = [], c = 0, h = n[0], M = 0; o > 0 && h > 0 && (M + h + 1 > i && (h = Math.max(1, i - M)), a.push(e.substring(o -= h, o + h)), !((M += h + 1) > i)); )
+      h = n[c = (c + 1) % n.length];
+    return a.reverse().join(t);
+  };
+}
+function V(n) {
+  return function(t) {
+    return t.replace(/[0-9]/g, function(e) {
+      return n[+e];
+    });
+  };
+}
+var W = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
+function $(n) {
+  if (!(t = W.exec(n))) throw new Error("invalid format: " + n);
+  var t;
+  return new L({
+    fill: t[1],
+    align: t[2],
+    sign: t[3],
+    symbol: t[4],
+    zero: t[5],
+    width: t[6],
+    comma: t[7],
+    precision: t[8] && t[8].slice(1),
+    trim: t[9],
+    type: t[10]
+  });
+}
+$.prototype = L.prototype;
+function L(n) {
+  this.fill = n.fill === void 0 ? " " : n.fill + "", this.align = n.align === void 0 ? ">" : n.align + "", this.sign = n.sign === void 0 ? "-" : n.sign + "", this.symbol = n.symbol === void 0 ? "" : n.symbol + "", this.zero = !!n.zero, this.width = n.width === void 0 ? void 0 : +n.width, this.comma = !!n.comma, this.precision = n.precision === void 0 ? void 0 : +n.precision, this.trim = !!n.trim, this.type = n.type === void 0 ? "" : n.type + "";
+}
+L.prototype.toString = function() {
+  return this.fill + this.align + this.sign + this.symbol + (this.zero ? "0" : "") + (this.width === void 0 ? "" : Math.max(1, this.width | 0)) + (this.comma ? "," : "") + (this.precision === void 0 ? "" : "." + Math.max(0, this.precision | 0)) + (this.trim ? "~" : "") + this.type;
+};
+function _(n) {
+  n: for (var t = n.length, e = 1, i = -1, o; e < t; ++e)
+    switch (n[e]) {
+      case ".":
+        i = o = e;
+        break;
+      case "0":
+        i === 0 && (i = e), o = e;
+        break;
+      default:
+        if (!+n[e]) break n;
+        i > 0 && (i = 0);
+        break;
+    }
+  return i > 0 ? n.slice(0, i) + n.slice(o + 1) : n;
+}
+var N;
+function v(n, t) {
+  var e = j(n, t);
+  if (!e) return N = void 0, n.toPrecision(t);
+  var i = e[0], o = e[1], a = o - (N = Math.max(-8, Math.min(8, Math.floor(o / 3))) * 3) + 1, c = i.length;
+  return a === c ? i : a > c ? i + new Array(a - c + 1).join("0") : a > 0 ? i.slice(0, a) + "." + i.slice(a) : "0." + new Array(1 - a).join("0") + j(n, Math.max(0, t + a - 1))[0];
+}
+function X(n, t) {
+  var e = j(n, t);
+  if (!e) return n + "";
+  var i = e[0], o = e[1];
+  return o < 0 ? "0." + new Array(-o).join("0") + i : i.length > o + 1 ? i.slice(0, o + 1) + "." + i.slice(o + 1) : i + new Array(o - i.length + 2).join("0");
+}
+const O = {
+  "%": (n, t) => (n * 100).toFixed(t),
+  b: (n) => Math.round(n).toString(2),
+  c: (n) => n + "",
+  d: J,
+  e: (n, t) => n.toExponential(t),
+  f: (n, t) => n.toFixed(t),
+  g: (n, t) => n.toPrecision(t),
+  o: (n) => Math.round(n).toString(8),
+  p: (n, t) => X(n * 100, t),
+  r: X,
+  s: v,
+  X: (n) => Math.round(n).toString(16).toUpperCase(),
+  x: (n) => Math.round(n).toString(16)
+};
+function R(n) {
+  return n;
+}
+var U = Array.prototype.map, Y = ["y", "z", "a", "f", "p", "n", "µ", "m", "", "k", "M", "G", "T", "P", "E", "Z", "Y"];
+function nn(n) {
+  var t = n.grouping === void 0 || n.thousands === void 0 ? R : Q(U.call(n.grouping, Number), n.thousands + ""), e = n.currency === void 0 ? "" : n.currency[0] + "", i = n.currency === void 0 ? "" : n.currency[1] + "", o = n.decimal === void 0 ? "." : n.decimal + "", a = n.numerals === void 0 ? R : V(U.call(n.numerals, String)), c = n.percent === void 0 ? "%" : n.percent + "", h = n.minus === void 0 ? "−" : n.minus + "", M = n.nan === void 0 ? "NaN" : n.nan + "";
+  function T(f, g) {
+    f = $(f);
+    var b = f.fill, p = f.align, m = f.sign, w = f.symbol, S = f.zero, E = f.width, F = f.comma, y = f.precision, C = f.trim, d = f.type;
+    d === "n" ? (F = !0, d = "g") : O[d] || (y === void 0 && (y = 12), C = !0, d = "g"), (S || b === "0" && p === "=") && (S = !0, b = "0", p = "=");
+    var q = (g && g.prefix !== void 0 ? g.prefix : "") + (w === "$" ? e : w === "#" && /[boxX]/.test(d) ? "0" + d.toLowerCase() : ""), B = (w === "$" ? i : /[%p]/.test(d) ? c : "") + (g && g.suffix !== void 0 ? g.suffix : ""), D = O[d], H = /[defgprs%]/.test(d);
+    y = y === void 0 ? 6 : /[gprs]/.test(d) ? Math.max(1, Math.min(21, y)) : Math.max(0, Math.min(20, y));
+    function G(r) {
+      var l = q, u = B, x, I, k;
+      if (d === "c")
+        u = D(r) + u, r = "";
+      else {
+        r = +r;
+        var P = r < 0 || 1 / r < 0;
+        if (r = isNaN(r) ? M : D(Math.abs(r), y), C && (r = _(r)), P && +r == 0 && m !== "+" && (P = !1), l = (P ? m === "(" ? m : h : m === "-" || m === "(" ? "" : m) + l, u = (d === "s" && !isNaN(r) && N !== void 0 ? Y[8 + N / 3] : "") + u + (P && m === "(" ? ")" : ""), H) {
+          for (x = -1, I = r.length; ++x < I; )
+            if (k = r.charCodeAt(x), 48 > k || k > 57) {
+              u = (k === 46 ? o + r.slice(x + 1) : r.slice(x)) + u, r = r.slice(0, x);
+              break;
+            }
+        }
+      }
+      F && !S && (r = t(r, 1 / 0));
+      var z = l.length + r.length + u.length, s = z < E ? new Array(E - z + 1).join(b) : "";
+      switch (F && S && (r = t(s + r, s.length ? E - u.length : 1 / 0), s = ""), p) {
+        case "<":
+          r = l + r + u + s;
+          break;
+        case "=":
+          r = l + s + r + u;
+          break;
+        case "^":
+          r = s.slice(0, z = s.length >> 1) + l + r + u + s.slice(z);
+          break;
+        default:
+          r = s + l + r + u;
+          break;
+      }
+      return a(r);
+    }
+    return G.toString = function() {
+      return f + "";
+    }, G;
+  }
+  function Z(f, g) {
+    var b = Math.max(-8, Math.min(8, Math.floor(K(g) / 3))) * 3, p = Math.pow(10, -b), m = T((f = $(f), f.type = "f", f), { suffix: Y[8 + b / 3] });
+    return function(w) {
+      return m(p * w);
+    };
+  }
+  return {
+    format: T,
+    formatPrefix: Z
+  };
+}
+var A, tn, rn;
+en({
+  thousands: ",",
+  grouping: [3],
+  currency: ["$", ""]
+});
+function en(n) {
+  return A = nn(n), tn = A.format, rn = A.formatPrefix, A;
+}
+export {
+  rn as a,
+  tn as b,
+  K as e,
+  $ as f
+};

package/dist/defaultLocale-C4wbwF1n.cjs

@@ -0,0 +1 @@
+"use strict";function K(n){return Math.abs(n=Math.round(n))>=1e21?n.toLocaleString("en").replace(/,/g,""):n.toString(10)}function j(n,t){if(!isFinite(n)||n===0)return null;var e=(n=t?n.toExponential(t-1):n.toExponential()).indexOf("e"),i=n.slice(0,e);return[i.length>1?i[0]+i.slice(2):i,+n.slice(e+1)]}function Z(n){return n=j(Math.abs(n)),n?n[1]:NaN}function Q(n,t){return function(e,i){for(var o=e.length,a=[],c=0,m=n[0],M=0;o>0&&m>0&&(M+m+1>i&&(m=Math.max(1,i-M)),a.push(e.substring(o-=m,o+m)),!((M+=m+1)>i));)m=n[c=(c+1)%n.length];return a.reverse().join(t)}}function V(n){return function(t){return t.replace(/[0-9]/g,function(e){return n[+e]})}}var W=/^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;function N(n){if(!(t=W.exec(n)))throw new Error("invalid format: "+n);var t;return new L({fill:t[1],align:t[2],sign:t[3],symbol:t[4],zero:t[5],width:t[6],comma:t[7],precision:t[8]&&t[8].slice(1),trim:t[9],type:t[10]})}N.prototype=L.prototype;function L(n){this.fill=n.fill===void 0?" ":n.fill+"",this.align=n.align===void 0?">":n.align+"",this.sign=n.sign===void 0?"-":n.sign+"",this.symbol=n.symbol===void 0?"":n.symbol+"",this.zero=!!n.zero,this.width=n.width===void 0?void 0:+n.width,this.comma=!!n.comma,this.precision=n.precision===void 0?void 0:+n.precision,this.trim=!!n.trim,this.type=n.type===void 0?"":n.type+""}L.prototype.toString=function(){return this.fill+this.align+this.sign+this.symbol+(this.zero?"0":"")+(this.width===void 0?"":Math.max(1,this.width|0))+(this.comma?",":"")+(this.precision===void 0?"":"."+Math.max(0,this.precision|0))+(this.trim?"~":"")+this.type};function _(n){n:for(var t=n.length,e=1,i=-1,o;e<t;++e)switch(n[e]){case".":i=o=e;break;case"0":i===0&&(i=e),o=e;break;default:if(!+n[e])break n;i>0&&(i=0);break}return i>0?n.slice(0,i)+n.slice(o+1):n}var E;function v(n,t){var e=j(n,t);if(!e)return E=void 0,n.toPrecision(t);var i=e[0],o=e[1],a=o-(E=Math.max(-8,Math.min(8,Math.floor(o/3)))*3)+1,c=i.length;return a===c?i:a>c?i+new Array(a-c+1).join("0"):a>0?i.slice(0,a)+"."+i.slice(a):"0."+new Array(1-a).join("0")+j(n,Math.max(0,t+a-1))[0]}function X(n,t){var e=j(n,t);if(!e)return n+"";var i=e[0],o=e[1];return o<0?"0."+new Array(-o).join("0")+i:i.length>o+1?i.slice(0,o+1)+"."+i.slice(o+1):i+new Array(o-i.length+2).join("0")}const O={"%":(n,t)=>(n*100).toFixed(t),b:n=>Math.round(n).toString(2),c:n=>n+"",d:K,e:(n,t)=>n.toExponential(t),f:(n,t)=>n.toFixed(t),g:(n,t)=>n.toPrecision(t),o:n=>Math.round(n).toString(8),p:(n,t)=>X(n*100,t),r:X,s:v,X:n=>Math.round(n).toString(16).toUpperCase(),x:n=>Math.round(n).toString(16)};function R(n){return n}var U=Array.prototype.map,Y=["y","z","a","f","p","n","µ","m","","k","M","G","T","P","E","Z","Y"];function nn(n){var t=n.grouping===void 0||n.thousands===void 0?R:Q(U.call(n.grouping,Number),n.thousands+""),e=n.currency===void 0?"":n.currency[0]+"",i=n.currency===void 0?"":n.currency[1]+"",o=n.decimal===void 0?".":n.decimal+"",a=n.numerals===void 0?R:V(U.call(n.numerals,String)),c=n.percent===void 0?"%":n.percent+"",m=n.minus===void 0?"−":n.minus+"",M=n.nan===void 0?"NaN":n.nan+"";function T(f,g){f=N(f);var x=f.fill,p=f.align,h=f.sign,w=f.symbol,S=f.zero,F=f.width,$=f.comma,y=f.precision,C=f.trim,d=f.type;d==="n"?($=!0,d="g"):O[d]||(y===void 0&&(y=12),C=!0,d="g"),(S||x==="0"&&p==="=")&&(S=!0,x="0",p="=");var B=(g&&g.prefix!==void 0?g.prefix:"")+(w==="$"?e:w==="#"&&/[boxX]/.test(d)?"0"+d.toLowerCase():""),H=(w==="$"?i:/[%p]/.test(d)?c:"")+(g&&g.suffix!==void 0?g.suffix:""),D=O[d],J=/[defgprs%]/.test(d);y=y===void 0?6:/[gprs]/.test(d)?Math.max(1,Math.min(21,y)):Math.max(0,Math.min(20,y));function G(r){var l=B,u=H,b,I,k;if(d==="c")u=D(r)+u,r="";else{r=+r;var P=r<0||1/r<0;if(r=isNaN(r)?M:D(Math.abs(r),y),C&&(r=_(r)),P&&+r==0&&h!=="+"&&(P=!1),l=(P?h==="("?h:m:h==="-"||h==="("?"":h)+l,u=(d==="s"&&!isNaN(r)&&E!==void 0?Y[8+E/3]:"")+u+(P&&h==="("?")":""),J){for(b=-1,I=r.length;++b<I;)if(k=r.charCodeAt(b),48>k||k>57){u=(k===46?o+r.slice(b+1):r.slice(b))+u,r=r.slice(0,b);break}}}$&&!S&&(r=t(r,1/0));var z=l.length+r.length+u.length,s=z<F?new Array(F-z+1).join(x):"";switch($&&S&&(r=t(s+r,s.length?F-u.length:1/0),s=""),p){case"<":r=l+r+u+s;break;case"=":r=l+s+r+u;break;case"^":r=s.slice(0,z=s.length>>1)+l+r+u+s.slice(z);break;default:r=s+l+r+u;break}return a(r)}return G.toString=function(){return f+""},G}function q(f,g){var x=Math.max(-8,Math.min(8,Math.floor(Z(g)/3)))*3,p=Math.pow(10,-x),h=T((f=N(f),f.type="f",f),{suffix:Y[8+x/3]});return function(w){return h(p*w)}}return{format:T,formatPrefix:q}}var A;exports.format=void 0;exports.formatPrefix=void 0;tn({thousands:",",grouping:[3],currency:["$",""]});function tn(n){return A=nn(n),exports.format=A.format,exports.formatPrefix=A.formatPrefix,A}exports.exponent=Z;exports.formatSpecifier=N;