mirror of
https://github.com/mermaid-js/mermaid.git
synced 2025-09-26 02:39:41 +02:00
Merge pull request #5476 from welfuture/develop
chore: remove repetitive words
This commit is contained in:
@@ -21,7 +21,7 @@ export const updateCurrentConfig = (siteCfg: MermaidConfig, _directives: Mermaid
|
|||||||
let sumOfDirectives: MermaidConfig = {};
|
let sumOfDirectives: MermaidConfig = {};
|
||||||
for (const d of _directives) {
|
for (const d of _directives) {
|
||||||
sanitize(d);
|
sanitize(d);
|
||||||
// Apply the data from the directive where the the overrides the themeVariables
|
// Apply the data from the directive where the overrides the themeVariables
|
||||||
sumOfDirectives = assignWithDepth(sumOfDirectives, d);
|
sumOfDirectives = assignWithDepth(sumOfDirectives, d);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -45,7 +45,7 @@ flowchart
|
|||||||
a --> C2
|
a --> C2
|
||||||
```
|
```
|
||||||
|
|
||||||
To handle this case a special type of edge is inserted. The edge to/from the cluster is replaced with an edge to/from a node in the cluster which is tagged with toCluster/fromCluster. When rendering this edge the intersection between the edge and the border of the cluster is calculated making the edge start/stop there. In practice this renders like an an edge to/from the cluster.
|
To handle this case a special type of edge is inserted. The edge to/from the cluster is replaced with an edge to/from a node in the cluster which is tagged with toCluster/fromCluster. When rendering this edge the intersection between the edge and the border of the cluster is calculated making the edge start/stop there. In practice this renders like an edge to/from the cluster.
|
||||||
|
|
||||||
In the diagram above the root diagram would be rendered with C1 whereas C2 would be rendered recursively.
|
In the diagram above the root diagram would be rendered with C1 whereas C2 would be rendered recursively.
|
||||||
|
|
||||||
|
@@ -1,5 +1,5 @@
|
|||||||
/*
|
/*
|
||||||
* Borrowed with love from from dagre-d3. Many thanks to cpettitt!
|
* Borrowed with love from dagre-d3. Many thanks to cpettitt!
|
||||||
*/
|
*/
|
||||||
|
|
||||||
import node from './intersect-node.js';
|
import node from './intersect-node.js';
|
||||||
|
@@ -262,7 +262,7 @@ const getBlocksFlat = () => {
|
|||||||
return [...Object.values(blockDatabase)];
|
return [...Object.values(blockDatabase)];
|
||||||
};
|
};
|
||||||
/**
|
/**
|
||||||
* Returns the the hierarchy of blocks
|
* Returns the hierarchy of blocks
|
||||||
* @returns
|
* @returns
|
||||||
*/
|
*/
|
||||||
const getBlocks = () => {
|
const getBlocks = () => {
|
||||||
|
@@ -141,7 +141,7 @@ describe('when parsing flowcharts', function () {
|
|||||||
expect(edges[3].type).toBe('arrow_point');
|
expect(edges[3].type).toBe('arrow_point');
|
||||||
expect(edges[3].text).toBe('');
|
expect(edges[3].text).toBe('');
|
||||||
});
|
});
|
||||||
it('should handle chaining and multiple nodes in in link statement FVC ', function () {
|
it('should handle chaining and multiple nodes in link statement FVC ', function () {
|
||||||
const res = flow.parser.parse(`
|
const res = flow.parser.parse(`
|
||||||
graph TD
|
graph TD
|
||||||
A --> B & B2 & C --> D2;
|
A --> B & B2 & C --> D2;
|
||||||
@@ -181,7 +181,7 @@ describe('when parsing flowcharts', function () {
|
|||||||
expect(edges[5].type).toBe('arrow_point');
|
expect(edges[5].type).toBe('arrow_point');
|
||||||
expect(edges[5].text).toBe('');
|
expect(edges[5].text).toBe('');
|
||||||
});
|
});
|
||||||
it('should handle chaining and multiple nodes in in link statement with extra info in statements', function () {
|
it('should handle chaining and multiple nodes in link statement with extra info in statements', function () {
|
||||||
const res = flow.parser.parse(`
|
const res = flow.parser.parse(`
|
||||||
graph TD
|
graph TD
|
||||||
A[ h ] -- hello --> B[" test "]:::exClass & C --> D;
|
A[ h ] -- hello --> B[" test "]:::exClass & C --> D;
|
||||||
|
@@ -64,7 +64,7 @@ describe('parsing a flow chart', function () {
|
|||||||
expect(edges[0].end).toBe('monograph');
|
expect(edges[0].end).toBe('monograph');
|
||||||
});
|
});
|
||||||
|
|
||||||
describe('special characters should be be handled.', function () {
|
describe('special characters should be handled.', function () {
|
||||||
const charTest = function (char, result) {
|
const charTest = function (char, result) {
|
||||||
const res = flow.parser.parse('graph TD;A(' + char + ')-->B;');
|
const res = flow.parser.parse('graph TD;A(' + char + ')-->B;');
|
||||||
|
|
||||||
|
@@ -145,7 +145,7 @@ const getRootDocV2 = () => {
|
|||||||
* Ex: the section within a fork has its own statements, and incoming and outgoing statements
|
* Ex: the section within a fork has its own statements, and incoming and outgoing statements
|
||||||
* refer to the fork as a whole (document).
|
* refer to the fork as a whole (document).
|
||||||
* See the parser grammar: the definition of a document is a document then a 'line', where a line can be a statement.
|
* See the parser grammar: the definition of a document is a document then a 'line', where a line can be a statement.
|
||||||
* This will push the statement into the the list of statements for the current document.
|
* This will push the statement into the list of statements for the current document.
|
||||||
*
|
*
|
||||||
* @param _doc
|
* @param _doc
|
||||||
*/
|
*/
|
||||||
|
Reference in New Issue
Block a user