marcel/mermaid
1
0
Fork 0
mirror of https://github.com/mermaid-js/mermaid.git synced 2025-08-15 14:29:25 +02:00
Code Issues Packages Projects Releases Wiki Activity

spelling: and

Browse Source 
Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
This commit is contained in:
Josh Soref
2025-04-16 20:34:25 -04:00
parent f5fa0ae876
commit 5919d39812
3 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
packages/mermaid-layout-elk/src/render.ts
View File

@@ -713,7 +713,7 @@ export const render = async (
// check if point is inside the boundary rect // check if point is inside the boundary rect
if (!outsideNode(bounds, point) && !isInside) { if (!outsideNode(bounds, point) && !isInside) {
// First point inside the rect found // First point inside the rect found
// Calc the intersection coord between the point anf the last point outside the rect // Calc the intersection coord between the point and the last point outside the rect
let inter; let inter;
if (isDiamond) { if (isDiamond) {

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

@@ -324,7 +324,7 @@ const cutPathAtIntersect = (_points, boundaryNode) => {
// check if point is inside the boundary rect // check if point is inside the boundary rect
if (!outsideNode(boundaryNode, point) && !isInside) { if (!outsideNode(boundaryNode, point) && !isInside) {
// First point inside the rect found // First point inside the rect found
// Calc the intersection coord between the point anf the last point outside the rect // Calc the intersection coord between the point and the last point outside the rect
const inter = intersection(boundaryNode, lastPointOutside, point); const inter = intersection(boundaryNode, lastPointOutside, point);
// // Check case where the intersection is the same as the last point // // Check case where the intersection is the same as the last point

2
packages/mermaid/src/diagrams/flowchart/flowDb.ts
View File

@@ -319,7 +319,7 @@ You have to call mermaid.initialize.`
// the rest of the edges should have auto generated ids // the rest of the edges should have auto generated ids
for (const start of _start) { for (const start of _start) {
for (const end of _end) { for (const end of _end) {
//use the id only for last node in _start and and first node in _end //use the id only for last node in _start and first node in _end
const isLastStart = start === _start[_start.length - 1]; const isLastStart = start === _start[_start.length - 1];
const isFirstEnd = end === _end[0]; const isFirstEnd = end === _end[0];
if (isLastStart && isFirstEnd) { if (isLastStart && isFirstEnd) {