mirrors
/
mermaid
mirror of https://github.com/mermaid-js/mermaid.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity

Remove unnecessary code

This commit is contained in:
Matheus B 2023-11-17 20:20:13 -03:00
parent 56c3809b57
commit 453c16d08e
2 changed files with 0 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
packages/mermaid/src/dagre-wrapper/edges.js
View File

@ -6,7 +6,6 @@ import { getConfig } from '../diagram-api/diagramAPI.js';
import utils from '../utils.js';
import { evaluate } from '../diagrams/common/common.js';
import { getLineFunctionsWithOffset } from '../utils/lineWithOffset.js';
import { getSubGraphTitleMargins } from '../utils/getSubGraphTitleMargins.js';
let edgeLabels = {};
let terminalLabels = {};
@ -264,7 +263,6 @@ export const intersection = (node, outsidePoint, insidePoint) => {
const Q = Math.abs(outsidePoint.y - insidePoint.y);
const R = Math.abs(outsidePoint.x - insidePoint.x);
const { subGraphTitleTotalMargin } = getSubGraphTitleMargins();
// log.warn();
if (Math.abs(y - outsidePoint.y) * w > Math.abs(x - outsidePoint.x) * h) {
// Intersection is top or bottom of rect.
@ -282,9 +280,6 @@ export const intersection = (node, outsidePoint, insidePoint) => {
}
if (R === 0) {
res.x = outsidePoint.x;
if (q && subGraphTitleTotalMargin) {
res.y = insidePoint.y < outsidePoint.y ? y + h : y - h;
}
}
if (Q === 0) {
res.y = outsidePoint.y;

6
packages/mermaid/src/dagre-wrapper/index.js
View File

@ -125,12 +125,6 @@ const recursiveRender = async (_elem, graph, diagramtype, id, parentCluster) =>
// A cluster in the non-recursive way
// positionCluster(node);
node.height += subGraphTitleTotalMargin * 2;
graph.children(v).forEach((c) => {
if (!clusterDb[c]) return;
if (!clusterDb[c].clusterData) {
node.height += subGraphTitleTotalMargin * 2;
}
});
insertCluster(clusters, node);
clusterDb[node.id].node = node;
} else {