@wandox/sdk 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (114) hide show
  1. package/README.md +59 -0
  2. package/dist/arc-BJMRTG9S.cjs +1 -0
  3. package/dist/arc-Vdco0qfw.js +83 -0
  4. package/dist/architectureDiagram-3BPJPVTR-BjEqcvey.js +4695 -0
  5. package/dist/architectureDiagram-3BPJPVTR-BvjJfAkh.cjs +36 -0
  6. package/dist/blockDiagram-GPEHLZMM-B1xf7RE9.js +2427 -0
  7. package/dist/blockDiagram-GPEHLZMM-B5VqovGY.cjs +132 -0
  8. package/dist/c4Diagram-AAUBKEIU-C4kjMRea.js +1578 -0
  9. package/dist/c4Diagram-AAUBKEIU-Ck5uEnJI.cjs +10 -0
  10. package/dist/channel-DlRtLuYv.js +5 -0
  11. package/dist/channel-Dm_yrRYJ.cjs +1 -0
  12. package/dist/chunk-2J33WTMH-CG2n_n4y.cjs +1 -0
  13. package/dist/chunk-2J33WTMH-CWvmGb4H.js +20 -0
  14. package/dist/chunk-4BX2VUAB-Bq3GzsD8.js +9 -0
  15. package/dist/chunk-4BX2VUAB-CdMctZeT.cjs +1 -0
  16. package/dist/chunk-55IACEB6-BdJhzL0d.js +8 -0
  17. package/dist/chunk-55IACEB6-sHyHtvg8.cjs +1 -0
  18. package/dist/chunk-727SXJPM-D-Vmam30.cjs +206 -0
  19. package/dist/chunk-727SXJPM-DmruCqjM.js +1529 -0
  20. package/dist/chunk-AQP2D5EJ-CWhKjcV3.cjs +231 -0
  21. package/dist/chunk-AQP2D5EJ-Ca0ak6w7.js +1399 -0
  22. package/dist/chunk-FMBD7UC4-CqV0NWQQ.js +19 -0
  23. package/dist/chunk-FMBD7UC4-DOxtd0OO.cjs +15 -0
  24. package/dist/chunk-ND2GUHAM-6EMX5Mu8.js +68 -0
  25. package/dist/chunk-ND2GUHAM-BXeDBtSC.cjs +1 -0
  26. package/dist/chunk-QZHKN3VN-B7FSI55w.js +15 -0
  27. package/dist/chunk-QZHKN3VN-CbbdNKnD.cjs +1 -0
  28. package/dist/classDiagram-4FO5ZUOK-0Kaf7WfA.js +16 -0
  29. package/dist/classDiagram-4FO5ZUOK-C4it2xBI.cjs +1 -0
  30. package/dist/classDiagram-v2-Q7XG4LA2-Byom5adL.js +16 -0
  31. package/dist/classDiagram-v2-Q7XG4LA2-C4it2xBI.cjs +1 -0
  32. package/dist/cose-bilkent-S5V4N54A-CuUv9oIm.js +2606 -0
  33. package/dist/cose-bilkent-S5V4N54A-Dh6nTopA.cjs +1 -0
  34. package/dist/cytoscape.esm-Cp8cXbK2.js +18729 -0
  35. package/dist/cytoscape.esm-fcqEUasK.cjs +331 -0
  36. package/dist/dagre-BM42HDAG-CwxJjZ2n.cjs +4 -0
  37. package/dist/dagre-BM42HDAG-DMBidMxP.js +448 -0
  38. package/dist/defaultLocale-BDVPUiG2.js +171 -0
  39. package/dist/defaultLocale-k2G_58r6.cjs +1 -0
  40. package/dist/diagram-2AECGRRQ-B2a4nXgJ.js +221 -0
  41. package/dist/diagram-2AECGRRQ-r7De7taS.cjs +43 -0
  42. package/dist/diagram-5GNKFQAL-CDiO79WC.cjs +10 -0
  43. package/dist/diagram-5GNKFQAL-DrHBNZzF.js +123 -0
  44. package/dist/diagram-KO2AKTUF-BcjWCXZr.js +466 -0
  45. package/dist/diagram-KO2AKTUF-CDlJCxVO.cjs +3 -0
  46. package/dist/diagram-LMA3HP47-BXFSAyNV.cjs +24 -0
  47. package/dist/diagram-LMA3HP47-DJxmyqn0.js +143 -0
  48. package/dist/diagram-OG6HWLK6-ATK__ca8.js +531 -0
  49. package/dist/diagram-OG6HWLK6-CgIyEO8_.cjs +24 -0
  50. package/dist/erDiagram-TEJ5UH35-D4baWNzQ.js +900 -0
  51. package/dist/erDiagram-TEJ5UH35-Dyuc5EB6.cjs +85 -0
  52. package/dist/flowDiagram-I6XJVG4X-BMZOncyU.js +1635 -0
  53. package/dist/flowDiagram-I6XJVG4X-C45fICr4.cjs +162 -0
  54. package/dist/ganttDiagram-6RSMTGT7-CiYZmmke.js +2526 -0
  55. package/dist/ganttDiagram-6RSMTGT7-Cxoj6IK8.cjs +292 -0
  56. package/dist/gitGraphDiagram-PVQCEYII-CQ9bNuwN.js +828 -0
  57. package/dist/gitGraphDiagram-PVQCEYII-rlaY9dfj.cjs +106 -0
  58. package/dist/graph-CBizzZ7K.js +1545 -0
  59. package/dist/graph-V5BNIbHU.cjs +1 -0
  60. package/dist/index-jBRold1l.js +173159 -0
  61. package/dist/index-sFrjovbM.cjs +804 -0
  62. package/dist/index.d.ts +54 -0
  63. package/dist/infoDiagram-5YYISTIA-CAzYIvUX.js +24 -0
  64. package/dist/infoDiagram-5YYISTIA-zX5rQglQ.cjs +2 -0
  65. package/dist/init-CHZsXQcr.cjs +1 -0
  66. package/dist/init-DjUOC4st.js +16 -0
  67. package/dist/ishikawaDiagram-YF4QCWOH-09prKBsn.cjs +70 -0
  68. package/dist/ishikawaDiagram-YF4QCWOH-Co8BnN24.js +622 -0
  69. package/dist/journeyDiagram-JHISSGLW-DkdWRF_-.cjs +139 -0
  70. package/dist/journeyDiagram-JHISSGLW-riCLiMCC.js +836 -0
  71. package/dist/kanban-definition-UN3LZRKU-DWipOCsx.cjs +89 -0
  72. package/dist/kanban-definition-UN3LZRKU-SRyCSn2H.js +725 -0
  73. package/dist/katex-Cf_UVKIT.cjs +257 -0
  74. package/dist/katex-RNjvZ8pg.js +11681 -0
  75. package/dist/layout-CbksXFOD.js +1728 -0
  76. package/dist/layout-Dh52gsIJ.cjs +1 -0
  77. package/dist/linear-C3xSMJV8.cjs +1 -0
  78. package/dist/linear-CmUCzX9U.js +259 -0
  79. package/dist/mermaid.core-BzNKr-OJ.cjs +308 -0
  80. package/dist/mermaid.core-CdBIz6FY.js +15475 -0
  81. package/dist/mindmap-definition-RKZ34NQL-Cs63oyIX.cjs +96 -0
  82. package/dist/mindmap-definition-RKZ34NQL-Gcma5iTd.js +830 -0
  83. package/dist/ordinal-CagbB1m8.cjs +1 -0
  84. package/dist/ordinal-DfAQgscy.js +61 -0
  85. package/dist/pieDiagram-4H26LBE5-CBGkD8dp.cjs +30 -0
  86. package/dist/pieDiagram-4H26LBE5-DSL8cVK1.js +164 -0
  87. package/dist/quadrantDiagram-W4KKPZXB-D3nCWRjF.cjs +7 -0
  88. package/dist/quadrantDiagram-W4KKPZXB-uod6bhUy.js +1026 -0
  89. package/dist/requirementDiagram-4Y6WPE33-Bc_6y7SM.js +884 -0
  90. package/dist/requirementDiagram-4Y6WPE33-D2mHlh5i.cjs +84 -0
  91. package/dist/sankeyDiagram-5OEKKPKP-DL_kXejW.cjs +40 -0
  92. package/dist/sankeyDiagram-5OEKKPKP-DMsjY4G4.js +847 -0
  93. package/dist/sequenceDiagram-3UESZ5HK-CBGalGOV.cjs +162 -0
  94. package/dist/sequenceDiagram-3UESZ5HK-CH2Z-Pis.js +2901 -0
  95. package/dist/stateDiagram-AJRCARHV-gEqlAI6t.js +263 -0
  96. package/dist/stateDiagram-AJRCARHV-rNMrAI-A.cjs +1 -0
  97. package/dist/stateDiagram-v2-BHNVJYJU-CDj7L1wi.js +16 -0
  98. package/dist/stateDiagram-v2-BHNVJYJU-LLlFJ1GM.cjs +1 -0
  99. package/dist/timeline-definition-PNZ67QCA-Bbuv3uu-.cjs +120 -0
  100. package/dist/timeline-definition-PNZ67QCA-DrGFbQdC.js +1068 -0
  101. package/dist/types.d.ts +295 -0
  102. package/dist/vennDiagram-CIIHVFJN-CGcAwVxU.js +1564 -0
  103. package/dist/vennDiagram-CIIHVFJN-DsSjXluJ.cjs +34 -0
  104. package/dist/wandox.cjs +1 -0
  105. package/dist/wandox.css +1 -0
  106. package/dist/wandox.js +6 -0
  107. package/dist/wandox.umd.js +4172 -0
  108. package/dist/wardley-L42UT6IY-DUnkyH_z.js +22539 -0
  109. package/dist/wardley-L42UT6IY-tDp0NbFW.cjs +165 -0
  110. package/dist/wardleyDiagram-YWT4CUSO-CB_Qa4lR.js +684 -0
  111. package/dist/wardleyDiagram-YWT4CUSO-D0BUmvVW.cjs +78 -0
  112. package/dist/xychartDiagram-2RQKCTM6-Bcq-ACuw.js +1342 -0
  113. package/dist/xychartDiagram-2RQKCTM6-BjeAPKLo.cjs +7 -0
  114. package/package.json +42 -0
@@ -0,0 +1,830 @@
1
+ import { g as oe } from "./chunk-55IACEB6-BdJhzL0d.js";
2
+ import { s as ce } from "./chunk-2J33WTMH-CWvmGb4H.js";
3
+ import { b as h, aB as R, a8 as le, aT as he, a1 as de, Q as W, a2 as U, aX as H, ae as ge, as as ue, ax as pe, L as fe } from "./mermaid.core-CdBIz6FY.js";
4
+ const _ = [];
5
+ for (let t = 0; t < 256; ++t)
6
+ _.push((t + 256).toString(16).slice(1));
7
+ function me(t, e = 0) {
8
+ return (_[t[e + 0]] + _[t[e + 1]] + _[t[e + 2]] + _[t[e + 3]] + "-" + _[t[e + 4]] + _[t[e + 5]] + "-" + _[t[e + 6]] + _[t[e + 7]] + "-" + _[t[e + 8]] + _[t[e + 9]] + "-" + _[t[e + 10]] + _[t[e + 11]] + _[t[e + 12]] + _[t[e + 13]] + _[t[e + 14]] + _[t[e + 15]]).toLowerCase();
9
+ }
10
+ const ye = new Uint8Array(16);
11
+ function Ee() {
12
+ return crypto.getRandomValues(ye);
13
+ }
14
+ function _e(t, e, o) {
15
+ return crypto.randomUUID ? crypto.randomUUID() : be(t);
16
+ }
17
+ function be(t, e, o) {
18
+ var n;
19
+ t = t || {};
20
+ const l = t.random ?? ((n = t.rng) == null ? void 0 : n.call(t)) ?? Ee();
21
+ if (l.length < 16)
22
+ throw new Error("Random bytes length must be >= 16");
23
+ return l[6] = l[6] & 15 | 64, l[8] = l[8] & 63 | 128, me(l);
24
+ }
25
+ var J = function() {
26
+ var t = /* @__PURE__ */ h(function(O, s, i, a) {
27
+ for (i = i || {}, a = O.length; a--; i[O[a]] = s) ;
28
+ return i;
29
+ }, "o"), e = [1, 4], o = [1, 13], l = [1, 12], n = [1, 15], d = [1, 16], p = [1, 20], y = [1, 19], E = [6, 7, 8], k = [1, 26], L = [1, 24], D = [1, 25], b = [6, 7, 11], $ = [1, 6, 13, 15, 16, 19, 22], f = [1, 33], B = [1, 34], P = [1, 6, 7, 11, 13, 15, 16, 19, 22], X = {
30
+ trace: /* @__PURE__ */ h(function() {
31
+ }, "trace"),
32
+ yy: {},
33
+ symbols_: { error: 2, start: 3, mindMap: 4, spaceLines: 5, SPACELINE: 6, NL: 7, MINDMAP: 8, document: 9, stop: 10, EOF: 11, statement: 12, SPACELIST: 13, node: 14, ICON: 15, CLASS: 16, nodeWithId: 17, nodeWithoutId: 18, NODE_DSTART: 19, NODE_DESCR: 20, NODE_DEND: 21, NODE_ID: 22, $accept: 0, $end: 1 },
34
+ terminals_: { 2: "error", 6: "SPACELINE", 7: "NL", 8: "MINDMAP", 11: "EOF", 13: "SPACELIST", 15: "ICON", 16: "CLASS", 19: "NODE_DSTART", 20: "NODE_DESCR", 21: "NODE_DEND", 22: "NODE_ID" },
35
+ productions_: [0, [3, 1], [3, 2], [5, 1], [5, 2], [5, 2], [4, 2], [4, 3], [10, 1], [10, 1], [10, 1], [10, 2], [10, 2], [9, 3], [9, 2], [12, 2], [12, 2], [12, 2], [12, 1], [12, 1], [12, 1], [12, 1], [12, 1], [14, 1], [14, 1], [18, 3], [17, 1], [17, 4]],
36
+ performAction: /* @__PURE__ */ h(function(s, i, a, c, u, r, M) {
37
+ var g = r.length - 1;
38
+ switch (u) {
39
+ case 6:
40
+ case 7:
41
+ return c;
42
+ case 8:
43
+ c.getLogger().trace("Stop NL ");
44
+ break;
45
+ case 9:
46
+ c.getLogger().trace("Stop EOF ");
47
+ break;
48
+ case 11:
49
+ c.getLogger().trace("Stop NL2 ");
50
+ break;
51
+ case 12:
52
+ c.getLogger().trace("Stop EOF2 ");
53
+ break;
54
+ case 15:
55
+ c.getLogger().info("Node: ", r[g].id), c.addNode(r[g - 1].length, r[g].id, r[g].descr, r[g].type);
56
+ break;
57
+ case 16:
58
+ c.getLogger().trace("Icon: ", r[g]), c.decorateNode({ icon: r[g] });
59
+ break;
60
+ case 17:
61
+ case 21:
62
+ c.decorateNode({ class: r[g] });
63
+ break;
64
+ case 18:
65
+ c.getLogger().trace("SPACELIST");
66
+ break;
67
+ case 19:
68
+ c.getLogger().trace("Node: ", r[g].id), c.addNode(0, r[g].id, r[g].descr, r[g].type);
69
+ break;
70
+ case 20:
71
+ c.decorateNode({ icon: r[g] });
72
+ break;
73
+ case 25:
74
+ c.getLogger().trace("node found ..", r[g - 2]), this.$ = { id: r[g - 1], descr: r[g - 1], type: c.getType(r[g - 2], r[g]) };
75
+ break;
76
+ case 26:
77
+ this.$ = { id: r[g], descr: r[g], type: c.nodeType.DEFAULT };
78
+ break;
79
+ case 27:
80
+ c.getLogger().trace("node found ..", r[g - 3]), this.$ = { id: r[g - 3], descr: r[g - 1], type: c.getType(r[g - 2], r[g]) };
81
+ break;
82
+ }
83
+ }, "anonymous"),
84
+ table: [{ 3: 1, 4: 2, 5: 3, 6: [1, 5], 8: e }, { 1: [3] }, { 1: [2, 1] }, { 4: 6, 6: [1, 7], 7: [1, 8], 8: e }, { 6: o, 7: [1, 10], 9: 9, 12: 11, 13: l, 14: 14, 15: n, 16: d, 17: 17, 18: 18, 19: p, 22: y }, t(E, [2, 3]), { 1: [2, 2] }, t(E, [2, 4]), t(E, [2, 5]), { 1: [2, 6], 6: o, 12: 21, 13: l, 14: 14, 15: n, 16: d, 17: 17, 18: 18, 19: p, 22: y }, { 6: o, 9: 22, 12: 11, 13: l, 14: 14, 15: n, 16: d, 17: 17, 18: 18, 19: p, 22: y }, { 6: k, 7: L, 10: 23, 11: D }, t(b, [2, 22], { 17: 17, 18: 18, 14: 27, 15: [1, 28], 16: [1, 29], 19: p, 22: y }), t(b, [2, 18]), t(b, [2, 19]), t(b, [2, 20]), t(b, [2, 21]), t(b, [2, 23]), t(b, [2, 24]), t(b, [2, 26], { 19: [1, 30] }), { 20: [1, 31] }, { 6: k, 7: L, 10: 32, 11: D }, { 1: [2, 7], 6: o, 12: 21, 13: l, 14: 14, 15: n, 16: d, 17: 17, 18: 18, 19: p, 22: y }, t($, [2, 14], { 7: f, 11: B }), t(P, [2, 8]), t(P, [2, 9]), t(P, [2, 10]), t(b, [2, 15]), t(b, [2, 16]), t(b, [2, 17]), { 20: [1, 35] }, { 21: [1, 36] }, t($, [2, 13], { 7: f, 11: B }), t(P, [2, 11]), t(P, [2, 12]), { 21: [1, 37] }, t(b, [2, 25]), t(b, [2, 27])],
85
+ defaultActions: { 2: [2, 1], 6: [2, 2] },
86
+ parseError: /* @__PURE__ */ h(function(s, i) {
87
+ if (i.recoverable)
88
+ this.trace(s);
89
+ else {
90
+ var a = new Error(s);
91
+ throw a.hash = i, a;
92
+ }
93
+ }, "parseError"),
94
+ parse: /* @__PURE__ */ h(function(s) {
95
+ var i = this, a = [0], c = [], u = [null], r = [], M = this.table, g = "", F = 0, K = 0, ie = 2, Z = 1, se = r.slice.call(arguments, 1), m = Object.create(this.lexer), C = { yy: {} };
96
+ for (var z in this.yy)
97
+ Object.prototype.hasOwnProperty.call(this.yy, z) && (C.yy[z] = this.yy[z]);
98
+ m.setInput(s, C.yy), C.yy.lexer = m, C.yy.parser = this, typeof m.yylloc > "u" && (m.yylloc = {});
99
+ var Y = m.yylloc;
100
+ r.push(Y);
101
+ var re = m.options && m.options.ranges;
102
+ typeof C.yy.parseError == "function" ? this.parseError = C.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
103
+ function ae(x) {
104
+ a.length = a.length - 2 * x, u.length = u.length - x, r.length = r.length - x;
105
+ }
106
+ h(ae, "popStack");
107
+ function ee() {
108
+ var x;
109
+ return x = c.pop() || m.lex() || Z, typeof x != "number" && (x instanceof Array && (c = x, x = c.pop()), x = i.symbols_[x] || x), x;
110
+ }
111
+ h(ee, "lex");
112
+ for (var S, I, N, Q, w = {}, G, v, te, j; ; ) {
113
+ if (I = a[a.length - 1], this.defaultActions[I] ? N = this.defaultActions[I] : ((S === null || typeof S > "u") && (S = ee()), N = M[I] && M[I][S]), typeof N > "u" || !N.length || !N[0]) {
114
+ var q = "";
115
+ j = [];
116
+ for (G in M[I])
117
+ this.terminals_[G] && G > ie && j.push("'" + this.terminals_[G] + "'");
118
+ m.showPosition ? q = "Parse error on line " + (F + 1) + `:
119
+ ` + m.showPosition() + `
120
+ Expecting ` + j.join(", ") + ", got '" + (this.terminals_[S] || S) + "'" : q = "Parse error on line " + (F + 1) + ": Unexpected " + (S == Z ? "end of input" : "'" + (this.terminals_[S] || S) + "'"), this.parseError(q, {
121
+ text: m.match,
122
+ token: this.terminals_[S] || S,
123
+ line: m.yylineno,
124
+ loc: Y,
125
+ expected: j
126
+ });
127
+ }
128
+ if (N[0] instanceof Array && N.length > 1)
129
+ throw new Error("Parse Error: multiple actions possible at state: " + I + ", token: " + S);
130
+ switch (N[0]) {
131
+ case 1:
132
+ a.push(S), u.push(m.yytext), r.push(m.yylloc), a.push(N[1]), S = null, K = m.yyleng, g = m.yytext, F = m.yylineno, Y = m.yylloc;
133
+ break;
134
+ case 2:
135
+ if (v = this.productions_[N[1]][1], w.$ = u[u.length - v], w._$ = {
136
+ first_line: r[r.length - (v || 1)].first_line,
137
+ last_line: r[r.length - 1].last_line,
138
+ first_column: r[r.length - (v || 1)].first_column,
139
+ last_column: r[r.length - 1].last_column
140
+ }, re && (w._$.range = [
141
+ r[r.length - (v || 1)].range[0],
142
+ r[r.length - 1].range[1]
143
+ ]), Q = this.performAction.apply(w, [
144
+ g,
145
+ K,
146
+ F,
147
+ C.yy,
148
+ N[1],
149
+ u,
150
+ r
151
+ ].concat(se)), typeof Q < "u")
152
+ return Q;
153
+ v && (a = a.slice(0, -1 * v * 2), u = u.slice(0, -1 * v), r = r.slice(0, -1 * v)), a.push(this.productions_[N[1]][0]), u.push(w.$), r.push(w._$), te = M[a[a.length - 2]][a[a.length - 1]], a.push(te);
154
+ break;
155
+ case 3:
156
+ return !0;
157
+ }
158
+ }
159
+ return !0;
160
+ }, "parse")
161
+ }, ne = /* @__PURE__ */ function() {
162
+ var O = {
163
+ EOF: 1,
164
+ parseError: /* @__PURE__ */ h(function(i, a) {
165
+ if (this.yy.parser)
166
+ this.yy.parser.parseError(i, a);
167
+ else
168
+ throw new Error(i);
169
+ }, "parseError"),
170
+ // resets the lexer, sets new input
171
+ setInput: /* @__PURE__ */ h(function(s, i) {
172
+ return this.yy = i || this.yy || {}, this._input = s, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
173
+ first_line: 1,
174
+ first_column: 0,
175
+ last_line: 1,
176
+ last_column: 0
177
+ }, this.options.ranges && (this.yylloc.range = [0, 0]), this.offset = 0, this;
178
+ }, "setInput"),
179
+ // consumes and returns one char from the input
180
+ input: /* @__PURE__ */ h(function() {
181
+ var s = this._input[0];
182
+ this.yytext += s, this.yyleng++, this.offset++, this.match += s, this.matched += s;
183
+ var i = s.match(/(?:\r\n?|\n).*/g);
184
+ return i ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), s;
185
+ }, "input"),
186
+ // unshifts one char (or a string) into the input
187
+ unput: /* @__PURE__ */ h(function(s) {
188
+ var i = s.length, a = s.split(/(?:\r\n?|\n)/g);
189
+ this._input = s + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - i), this.offset -= i;
190
+ var c = this.match.split(/(?:\r\n?|\n)/g);
191
+ this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), a.length - 1 && (this.yylineno -= a.length - 1);
192
+ var u = this.yylloc.range;
193
+ return this.yylloc = {
194
+ first_line: this.yylloc.first_line,
195
+ last_line: this.yylineno + 1,
196
+ first_column: this.yylloc.first_column,
197
+ last_column: a ? (a.length === c.length ? this.yylloc.first_column : 0) + c[c.length - a.length].length - a[0].length : this.yylloc.first_column - i
198
+ }, this.options.ranges && (this.yylloc.range = [u[0], u[0] + this.yyleng - i]), this.yyleng = this.yytext.length, this;
199
+ }, "unput"),
200
+ // When called from action, caches matched text and appends it on next action
201
+ more: /* @__PURE__ */ h(function() {
202
+ return this._more = !0, this;
203
+ }, "more"),
204
+ // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
205
+ reject: /* @__PURE__ */ h(function() {
206
+ if (this.options.backtrack_lexer)
207
+ this._backtrack = !0;
208
+ else
209
+ return this.parseError("Lexical error on line " + (this.yylineno + 1) + `. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).
210
+ ` + this.showPosition(), {
211
+ text: "",
212
+ token: null,
213
+ line: this.yylineno
214
+ });
215
+ return this;
216
+ }, "reject"),
217
+ // retain first n characters of the match
218
+ less: /* @__PURE__ */ h(function(s) {
219
+ this.unput(this.match.slice(s));
220
+ }, "less"),
221
+ // displays already matched input, i.e. for error messages
222
+ pastInput: /* @__PURE__ */ h(function() {
223
+ var s = this.matched.substr(0, this.matched.length - this.match.length);
224
+ return (s.length > 20 ? "..." : "") + s.substr(-20).replace(/\n/g, "");
225
+ }, "pastInput"),
226
+ // displays upcoming input, i.e. for error messages
227
+ upcomingInput: /* @__PURE__ */ h(function() {
228
+ var s = this.match;
229
+ return s.length < 20 && (s += this._input.substr(0, 20 - s.length)), (s.substr(0, 20) + (s.length > 20 ? "..." : "")).replace(/\n/g, "");
230
+ }, "upcomingInput"),
231
+ // displays the character position where the lexing error occurred, i.e. for error messages
232
+ showPosition: /* @__PURE__ */ h(function() {
233
+ var s = this.pastInput(), i = new Array(s.length + 1).join("-");
234
+ return s + this.upcomingInput() + `
235
+ ` + i + "^";
236
+ }, "showPosition"),
237
+ // test the lexed token: return FALSE when not a match, otherwise return token
238
+ test_match: /* @__PURE__ */ h(function(s, i) {
239
+ var a, c, u;
240
+ if (this.options.backtrack_lexer && (u = {
241
+ yylineno: this.yylineno,
242
+ yylloc: {
243
+ first_line: this.yylloc.first_line,
244
+ last_line: this.last_line,
245
+ first_column: this.yylloc.first_column,
246
+ last_column: this.yylloc.last_column
247
+ },
248
+ yytext: this.yytext,
249
+ match: this.match,
250
+ matches: this.matches,
251
+ matched: this.matched,
252
+ yyleng: this.yyleng,
253
+ offset: this.offset,
254
+ _more: this._more,
255
+ _input: this._input,
256
+ yy: this.yy,
257
+ conditionStack: this.conditionStack.slice(0),
258
+ done: this.done
259
+ }, this.options.ranges && (u.yylloc.range = this.yylloc.range.slice(0))), c = s[0].match(/(?:\r\n?|\n).*/g), c && (this.yylineno += c.length), this.yylloc = {
260
+ first_line: this.yylloc.last_line,
261
+ last_line: this.yylineno + 1,
262
+ first_column: this.yylloc.last_column,
263
+ last_column: c ? c[c.length - 1].length - c[c.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + s[0].length
264
+ }, this.yytext += s[0], this.match += s[0], this.matches = s, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(s[0].length), this.matched += s[0], a = this.performAction.call(this, this.yy, this, i, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), a)
265
+ return a;
266
+ if (this._backtrack) {
267
+ for (var r in u)
268
+ this[r] = u[r];
269
+ return !1;
270
+ }
271
+ return !1;
272
+ }, "test_match"),
273
+ // return next match in input
274
+ next: /* @__PURE__ */ h(function() {
275
+ if (this.done)
276
+ return this.EOF;
277
+ this._input || (this.done = !0);
278
+ var s, i, a, c;
279
+ this._more || (this.yytext = "", this.match = "");
280
+ for (var u = this._currentRules(), r = 0; r < u.length; r++)
281
+ if (a = this._input.match(this.rules[u[r]]), a && (!i || a[0].length > i[0].length)) {
282
+ if (i = a, c = r, this.options.backtrack_lexer) {
283
+ if (s = this.test_match(a, u[r]), s !== !1)
284
+ return s;
285
+ if (this._backtrack) {
286
+ i = !1;
287
+ continue;
288
+ } else
289
+ return !1;
290
+ } else if (!this.options.flex)
291
+ break;
292
+ }
293
+ return i ? (s = this.test_match(i, u[c]), s !== !1 ? s : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
294
+ ` + this.showPosition(), {
295
+ text: "",
296
+ token: null,
297
+ line: this.yylineno
298
+ });
299
+ }, "next"),
300
+ // return next match that has a token
301
+ lex: /* @__PURE__ */ h(function() {
302
+ var i = this.next();
303
+ return i || this.lex();
304
+ }, "lex"),
305
+ // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
306
+ begin: /* @__PURE__ */ h(function(i) {
307
+ this.conditionStack.push(i);
308
+ }, "begin"),
309
+ // pop the previously active lexer condition state off the condition stack
310
+ popState: /* @__PURE__ */ h(function() {
311
+ var i = this.conditionStack.length - 1;
312
+ return i > 0 ? this.conditionStack.pop() : this.conditionStack[0];
313
+ }, "popState"),
314
+ // produce the lexer rule set which is active for the currently active lexer condition state
315
+ _currentRules: /* @__PURE__ */ h(function() {
316
+ return this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1] ? this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules : this.conditions.INITIAL.rules;
317
+ }, "_currentRules"),
318
+ // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
319
+ topState: /* @__PURE__ */ h(function(i) {
320
+ return i = this.conditionStack.length - 1 - Math.abs(i || 0), i >= 0 ? this.conditionStack[i] : "INITIAL";
321
+ }, "topState"),
322
+ // alias for begin(condition)
323
+ pushState: /* @__PURE__ */ h(function(i) {
324
+ this.begin(i);
325
+ }, "pushState"),
326
+ // return the number of states currently on the stack
327
+ stateStackSize: /* @__PURE__ */ h(function() {
328
+ return this.conditionStack.length;
329
+ }, "stateStackSize"),
330
+ options: { "case-insensitive": !0 },
331
+ performAction: /* @__PURE__ */ h(function(i, a, c, u) {
332
+ switch (c) {
333
+ case 0:
334
+ return i.getLogger().trace("Found comment", a.yytext), 6;
335
+ case 1:
336
+ return 8;
337
+ case 2:
338
+ this.begin("CLASS");
339
+ break;
340
+ case 3:
341
+ return this.popState(), 16;
342
+ case 4:
343
+ this.popState();
344
+ break;
345
+ case 5:
346
+ i.getLogger().trace("Begin icon"), this.begin("ICON");
347
+ break;
348
+ case 6:
349
+ return i.getLogger().trace("SPACELINE"), 6;
350
+ case 7:
351
+ return 7;
352
+ case 8:
353
+ return 15;
354
+ case 9:
355
+ i.getLogger().trace("end icon"), this.popState();
356
+ break;
357
+ case 10:
358
+ return i.getLogger().trace("Exploding node"), this.begin("NODE"), 19;
359
+ case 11:
360
+ return i.getLogger().trace("Cloud"), this.begin("NODE"), 19;
361
+ case 12:
362
+ return i.getLogger().trace("Explosion Bang"), this.begin("NODE"), 19;
363
+ case 13:
364
+ return i.getLogger().trace("Cloud Bang"), this.begin("NODE"), 19;
365
+ case 14:
366
+ return this.begin("NODE"), 19;
367
+ case 15:
368
+ return this.begin("NODE"), 19;
369
+ case 16:
370
+ return this.begin("NODE"), 19;
371
+ case 17:
372
+ return this.begin("NODE"), 19;
373
+ case 18:
374
+ return 13;
375
+ case 19:
376
+ return 22;
377
+ case 20:
378
+ return 11;
379
+ case 21:
380
+ this.begin("NSTR2");
381
+ break;
382
+ case 22:
383
+ return "NODE_DESCR";
384
+ case 23:
385
+ this.popState();
386
+ break;
387
+ case 24:
388
+ i.getLogger().trace("Starting NSTR"), this.begin("NSTR");
389
+ break;
390
+ case 25:
391
+ return i.getLogger().trace("description:", a.yytext), "NODE_DESCR";
392
+ case 26:
393
+ this.popState();
394
+ break;
395
+ case 27:
396
+ return this.popState(), i.getLogger().trace("node end ))"), "NODE_DEND";
397
+ case 28:
398
+ return this.popState(), i.getLogger().trace("node end )"), "NODE_DEND";
399
+ case 29:
400
+ return this.popState(), i.getLogger().trace("node end ...", a.yytext), "NODE_DEND";
401
+ case 30:
402
+ return this.popState(), i.getLogger().trace("node end (("), "NODE_DEND";
403
+ case 31:
404
+ return this.popState(), i.getLogger().trace("node end (-"), "NODE_DEND";
405
+ case 32:
406
+ return this.popState(), i.getLogger().trace("node end (-"), "NODE_DEND";
407
+ case 33:
408
+ return this.popState(), i.getLogger().trace("node end (("), "NODE_DEND";
409
+ case 34:
410
+ return this.popState(), i.getLogger().trace("node end (("), "NODE_DEND";
411
+ case 35:
412
+ return i.getLogger().trace("Long description:", a.yytext), 20;
413
+ case 36:
414
+ return i.getLogger().trace("Long description:", a.yytext), 20;
415
+ }
416
+ }, "anonymous"),
417
+ rules: [/^(?:\s*%%.*)/i, /^(?:mindmap\b)/i, /^(?::::)/i, /^(?:.+)/i, /^(?:\n)/i, /^(?:::icon\()/i, /^(?:[\s]+[\n])/i, /^(?:[\n]+)/i, /^(?:[^\)]+)/i, /^(?:\))/i, /^(?:-\))/i, /^(?:\(-)/i, /^(?:\)\))/i, /^(?:\))/i, /^(?:\(\()/i, /^(?:\{\{)/i, /^(?:\()/i, /^(?:\[)/i, /^(?:[\s]+)/i, /^(?:[^\(\[\n\)\{\}]+)/i, /^(?:$)/i, /^(?:["][`])/i, /^(?:[^`"]+)/i, /^(?:[`]["])/i, /^(?:["])/i, /^(?:[^"]+)/i, /^(?:["])/i, /^(?:[\)]\))/i, /^(?:[\)])/i, /^(?:[\]])/i, /^(?:\}\})/i, /^(?:\(-)/i, /^(?:-\))/i, /^(?:\(\()/i, /^(?:\()/i, /^(?:[^\)\]\(\}]+)/i, /^(?:.+(?!\(\())/i],
418
+ conditions: { CLASS: { rules: [3, 4], inclusive: !1 }, ICON: { rules: [8, 9], inclusive: !1 }, NSTR2: { rules: [22, 23], inclusive: !1 }, NSTR: { rules: [25, 26], inclusive: !1 }, NODE: { rules: [21, 24, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36], inclusive: !1 }, INITIAL: { rules: [0, 1, 2, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], inclusive: !0 } }
419
+ };
420
+ return O;
421
+ }();
422
+ X.lexer = ne;
423
+ function V() {
424
+ this.yy = {};
425
+ }
426
+ return h(V, "Parser"), V.prototype = X, X.Parser = V, new V();
427
+ }();
428
+ J.parser = J;
429
+ var ke = J, Se = 12, T = {
430
+ DEFAULT: 0,
431
+ NO_BORDER: 0,
432
+ ROUNDED_RECT: 1,
433
+ RECT: 2,
434
+ CIRCLE: 3,
435
+ CLOUD: 4,
436
+ BANG: 5,
437
+ HEXAGON: 6
438
+ }, A, xe = (A = class {
439
+ constructor() {
440
+ this.nodes = [], this.count = 0, this.elements = {}, this.getLogger = this.getLogger.bind(this), this.nodeType = T, this.clear(), this.getType = this.getType.bind(this), this.getElementById = this.getElementById.bind(this), this.getParent = this.getParent.bind(this), this.getMindmap = this.getMindmap.bind(this), this.addNode = this.addNode.bind(this), this.decorateNode = this.decorateNode.bind(this);
441
+ }
442
+ clear() {
443
+ this.nodes = [], this.count = 0, this.elements = {}, this.baseLevel = void 0;
444
+ }
445
+ getParent(e) {
446
+ for (let o = this.nodes.length - 1; o >= 0; o--)
447
+ if (this.nodes[o].level < e)
448
+ return this.nodes[o];
449
+ return null;
450
+ }
451
+ getMindmap() {
452
+ return this.nodes.length > 0 ? this.nodes[0] : null;
453
+ }
454
+ addNode(e, o, l, n) {
455
+ var L, D;
456
+ R.info("addNode", e, o, l, n);
457
+ let d = !1;
458
+ this.nodes.length === 0 ? (this.baseLevel = e, e = 0, d = !0) : this.baseLevel !== void 0 && (e = e - this.baseLevel, d = !1);
459
+ const p = U();
460
+ let y = ((L = p.mindmap) == null ? void 0 : L.padding) ?? W.mindmap.padding;
461
+ switch (n) {
462
+ case this.nodeType.ROUNDED_RECT:
463
+ case this.nodeType.RECT:
464
+ case this.nodeType.HEXAGON:
465
+ y *= 2;
466
+ break;
467
+ }
468
+ const E = {
469
+ id: this.count++,
470
+ nodeId: H(o, p),
471
+ level: e,
472
+ descr: H(l, p),
473
+ type: n,
474
+ children: [],
475
+ width: ((D = p.mindmap) == null ? void 0 : D.maxNodeWidth) ?? W.mindmap.maxNodeWidth,
476
+ padding: y,
477
+ isRoot: d
478
+ }, k = this.getParent(e);
479
+ if (k)
480
+ k.children.push(E), this.nodes.push(E);
481
+ else if (d)
482
+ this.nodes.push(E);
483
+ else
484
+ throw new Error(
485
+ `There can be only one root. No parent could be found for ("${E.descr}")`
486
+ );
487
+ }
488
+ getType(e, o) {
489
+ switch (R.debug("In get type", e, o), e) {
490
+ case "[":
491
+ return this.nodeType.RECT;
492
+ case "(":
493
+ return o === ")" ? this.nodeType.ROUNDED_RECT : this.nodeType.CLOUD;
494
+ case "((":
495
+ return this.nodeType.CIRCLE;
496
+ case ")":
497
+ return this.nodeType.CLOUD;
498
+ case "))":
499
+ return this.nodeType.BANG;
500
+ case "{{":
501
+ return this.nodeType.HEXAGON;
502
+ default:
503
+ return this.nodeType.DEFAULT;
504
+ }
505
+ }
506
+ setElementForId(e, o) {
507
+ this.elements[e] = o;
508
+ }
509
+ getElementById(e) {
510
+ return this.elements[e];
511
+ }
512
+ decorateNode(e) {
513
+ if (!e)
514
+ return;
515
+ const o = U(), l = this.nodes[this.nodes.length - 1];
516
+ e.icon && (l.icon = H(e.icon, o)), e.class && (l.class = H(e.class, o));
517
+ }
518
+ type2Str(e) {
519
+ switch (e) {
520
+ case this.nodeType.DEFAULT:
521
+ return "no-border";
522
+ case this.nodeType.RECT:
523
+ return "rect";
524
+ case this.nodeType.ROUNDED_RECT:
525
+ return "rounded-rect";
526
+ case this.nodeType.CIRCLE:
527
+ return "circle";
528
+ case this.nodeType.CLOUD:
529
+ return "cloud";
530
+ case this.nodeType.BANG:
531
+ return "bang";
532
+ case this.nodeType.HEXAGON:
533
+ return "hexgon";
534
+ default:
535
+ return "no-border";
536
+ }
537
+ }
538
+ /**
539
+ * Assign section numbers to nodes based on their position relative to root
540
+ * @param node - The mindmap node to process
541
+ * @param sectionNumber - The section number to assign (undefined for root)
542
+ */
543
+ assignSections(e, o) {
544
+ if (e.level === 0 ? e.section = void 0 : e.section = o, e.children)
545
+ for (const [l, n] of e.children.entries()) {
546
+ const d = e.level === 0 ? l % (Se - 1) : o;
547
+ this.assignSections(n, d);
548
+ }
549
+ }
550
+ /**
551
+ * Convert mindmap tree structure to flat array of nodes
552
+ * @param node - The mindmap node to process
553
+ * @param processedNodes - Array to collect processed nodes
554
+ */
555
+ flattenNodes(e, o) {
556
+ const l = U(), n = ["mindmap-node"];
557
+ e.isRoot === !0 ? n.push("section-root", "section--1") : e.section !== void 0 && n.push(`section-${e.section}`), e.class && n.push(e.class);
558
+ const d = n.join(" "), p = /* @__PURE__ */ h((E) => {
559
+ var D;
560
+ const L = (((D = l.theme) == null ? void 0 : D.toLowerCase()) ?? "").includes("redux");
561
+ switch (E) {
562
+ case T.CIRCLE:
563
+ return "mindmapCircle";
564
+ case T.RECT:
565
+ return "rect";
566
+ case T.ROUNDED_RECT:
567
+ return "rounded";
568
+ case T.CLOUD:
569
+ return "cloud";
570
+ case T.BANG:
571
+ return "bang";
572
+ case T.HEXAGON:
573
+ return "hexagon";
574
+ case T.DEFAULT:
575
+ return L ? "rounded" : "defaultMindmapNode";
576
+ case T.NO_BORDER:
577
+ default:
578
+ return "rect";
579
+ }
580
+ }, "getShapeFromType"), y = {
581
+ id: e.id.toString(),
582
+ domId: "node_" + e.id.toString(),
583
+ label: e.descr,
584
+ labelType: "markdown",
585
+ isGroup: !1,
586
+ shape: p(e.type),
587
+ width: e.width,
588
+ height: e.height ?? 0,
589
+ padding: e.padding,
590
+ cssClasses: d,
591
+ cssStyles: [],
592
+ look: l.look,
593
+ icon: e.icon,
594
+ x: e.x,
595
+ y: e.y,
596
+ // Mindmap-specific properties
597
+ level: e.level,
598
+ nodeId: e.nodeId,
599
+ type: e.type,
600
+ section: e.section
601
+ };
602
+ if (o.push(y), e.children)
603
+ for (const E of e.children)
604
+ this.flattenNodes(E, o);
605
+ }
606
+ /**
607
+ * Generate edges from parent-child relationships in mindmap tree
608
+ * @param node - The mindmap node to process
609
+ * @param edges - Array to collect edges
610
+ */
611
+ generateEdges(e, o) {
612
+ if (!e.children)
613
+ return;
614
+ const l = U();
615
+ for (const n of e.children) {
616
+ let d = "edge";
617
+ n.section !== void 0 && (d += ` section-edge-${n.section}`);
618
+ const p = e.level + 1;
619
+ d += ` edge-depth-${p}`;
620
+ const y = {
621
+ id: `edge_${e.id}_${n.id}`,
622
+ start: e.id.toString(),
623
+ end: n.id.toString(),
624
+ type: "normal",
625
+ curve: "basis",
626
+ thickness: "normal",
627
+ look: l.look,
628
+ classes: d,
629
+ // Store mindmap-specific data
630
+ depth: e.level,
631
+ section: n.section
632
+ };
633
+ o.push(y), this.generateEdges(n, o);
634
+ }
635
+ }
636
+ /**
637
+ * Get structured data for layout algorithms
638
+ * Following the pattern established by ER diagrams
639
+ * @returns Structured data containing nodes, edges, and config
640
+ */
641
+ getData() {
642
+ const e = this.getMindmap(), o = U(), n = ge().layout !== void 0, d = o;
643
+ if (n || (d.layout = "cose-bilkent"), !e)
644
+ return {
645
+ nodes: [],
646
+ edges: [],
647
+ config: d
648
+ };
649
+ R.debug("getData: mindmapRoot", e, o), this.assignSections(e);
650
+ const p = [], y = [];
651
+ this.flattenNodes(e, p), this.generateEdges(e, y), R.debug(
652
+ `getData: processed ${p.length} nodes and ${y.length} edges`
653
+ );
654
+ const E = /* @__PURE__ */ new Map();
655
+ for (const k of p)
656
+ E.set(k.id, {
657
+ shape: k.shape,
658
+ width: k.width,
659
+ height: k.height,
660
+ padding: k.padding
661
+ });
662
+ return {
663
+ nodes: p,
664
+ edges: y,
665
+ config: d,
666
+ // Store the root node for mindmap-specific layout algorithms
667
+ rootNode: e,
668
+ // Properties required by dagre layout algorithm
669
+ markers: ["point"],
670
+ // Mindmaps don't use markers
671
+ direction: "TB",
672
+ // Top-to-bottom direction for mindmaps
673
+ nodeSpacing: 50,
674
+ // Default spacing between nodes
675
+ rankSpacing: 50,
676
+ // Default spacing between ranks
677
+ // Add shapes for ELK compatibility
678
+ shapes: Object.fromEntries(E),
679
+ // Additional properties that layout algorithms might expect
680
+ type: "mindmap",
681
+ diagramId: "mindmap-" + _e()
682
+ };
683
+ }
684
+ // Expose logger to grammar
685
+ getLogger() {
686
+ return R;
687
+ }
688
+ }, h(A, "MindmapDB"), A), Ne = /* @__PURE__ */ h(async (t, e, o, l) => {
689
+ var b, $;
690
+ R.debug(`Rendering mindmap diagram
691
+ ` + t);
692
+ const n = l.db, d = n.getData(), p = oe(e, d.config.securityLevel);
693
+ if (d.type = l.type, d.layoutAlgorithm = le(d.config.layout, {
694
+ fallback: "cose-bilkent"
695
+ }), d.diagramId = e, !n.getMindmap())
696
+ return;
697
+ d.nodes.forEach((f) => {
698
+ f.shape === "rounded" ? (f.radius = 15, f.taper = 15, f.stroke = "none", f.width = 0, f.padding = 15) : f.shape === "circle" ? f.padding = 10 : f.shape === "rect" ? (f.width = 0, f.padding = 10) : f.shape === "hexagon" && (f.width = 0, f.height = 0);
699
+ }), await he(d, p);
700
+ const { themeVariables: E } = de(), { useGradient: k, gradientStart: L, gradientStop: D } = E;
701
+ if (k && L && D) {
702
+ const f = p.attr("id"), B = p.append("defs").append("linearGradient").attr("id", `${f}-gradient`).attr("gradientUnits", "objectBoundingBox").attr("x1", "0%").attr("y1", "0%").attr("x2", "100%").attr("y2", "0%");
703
+ B.append("stop").attr("offset", "0%").attr("stop-color", L).attr("stop-opacity", 1), B.append("stop").attr("offset", "100%").attr("stop-color", D).attr("stop-opacity", 1);
704
+ }
705
+ ce(
706
+ p,
707
+ ((b = d.config.mindmap) == null ? void 0 : b.padding) ?? W.mindmap.padding,
708
+ "mindmapDiagram",
709
+ (($ = d.config.mindmap) == null ? void 0 : $.useMaxWidth) ?? W.mindmap.useMaxWidth
710
+ );
711
+ }, "draw"), De = {
712
+ draw: Ne
713
+ }, Le = /* @__PURE__ */ h((t) => {
714
+ const { theme: e, look: o } = t;
715
+ let l = "";
716
+ for (let n = 0; n < t.THEME_COLOR_LIMIT; n++)
717
+ t["lineColor" + n] = t["lineColor" + n] || t["cScaleInv" + n], ue(t["lineColor" + n]) ? t["lineColor" + n] = pe(t["lineColor" + n], 20) : t["lineColor" + n] = fe(t["lineColor" + n], 20);
718
+ for (let n = 0; n < t.THEME_COLOR_LIMIT; n++) {
719
+ const d = "" + (o === "neo" ? Math.max(10 - (n - 1) * 2, 2) : 17 - 3 * n);
720
+ l += `
721
+ .section-${n - 1} rect, .section-${n - 1} path, .section-${n - 1} circle, .section-${n - 1} polygon, .section-${n - 1} path {
722
+ fill: ${t["cScale" + n]};
723
+ }
724
+ .section-${n - 1} text {
725
+ fill: ${t["cScaleLabel" + n]};
726
+ }
727
+ .section-${n - 1} span {
728
+ color: ${t["cScaleLabel" + n]};
729
+ }
730
+ .node-icon-${n - 1} {
731
+ font-size: 40px;
732
+ color: ${t["cScaleLabel" + n]};
733
+ }
734
+ .section-edge-${n - 1}{
735
+ stroke: ${t["cScale" + n]};
736
+ }
737
+ .edge-depth-${n - 1}{
738
+ stroke-width: ${d};
739
+ }
740
+ .section-${n - 1} line {
741
+ stroke: ${t["cScaleInv" + n]} ;
742
+ stroke-width: 3;
743
+ }
744
+
745
+ .disabled, .disabled circle, .disabled text {
746
+ fill: lightgray;
747
+ }
748
+ .disabled text {
749
+ fill: #efefef;
750
+ }
751
+ [data-look="neo"].mindmap-node.section-${n - 1} rect, [data-look="neo"].mindmap-node.section-${n - 1} path, [data-look="neo"].mindmap-node.section-${n - 1} circle, [data-look="neo"].mindmap-node.section-${n - 1} polygon {
752
+ fill: ${e === "redux" || e === "redux-dark" || e === "neutral" ? t.mainBkg : t["cScale" + n]};
753
+ stroke: ${e === "redux" || e === "redux-dark" ? t.nodeBorder : t["cScale" + n]};
754
+ stroke-width: ${t.strokeWidth ?? 2}px;
755
+ }
756
+ [data-look="neo"].section-edge-${n - 1}{
757
+ stroke: ${e != null && e.includes("redux") || e === "neo-dark" ? t.nodeBorder : t["cScale" + n]};
758
+ }
759
+ [data-look="neo"].mindmap-node.section-${n - 1} text {
760
+ fill: ${e === "redux" || e === "redux-dark" ? t.nodeBorder : t["cScaleLabel" + (e === "neutral" ? 1 : n)]};
761
+ }
762
+ `;
763
+ }
764
+ return l;
765
+ }, "genSections"), ve = /* @__PURE__ */ h((t, e, o) => {
766
+ let l = "";
767
+ for (let n = 0; n < t; n++)
768
+ l += `
769
+ [data-look="neo"].mindmap-node.section-${n - 1} rect, [data-look="neo"].mindmap-node.section-${n - 1} path, [data-look="neo"].mindmap-node.section-${n - 1} circle, [data-look="neo"].mindmap-node.section-${n - 1} polygon {
770
+ stroke: url(${e}-gradient);
771
+ fill: ${o};
772
+ }
773
+ .section-${n - 1} line {
774
+ stroke-width: 0;
775
+ }`;
776
+ return l;
777
+ }, "genGradient"), Te = /* @__PURE__ */ h((t) => {
778
+ const { theme: e } = t, o = t.svgId, l = t.dropShadow ? t.dropShadow.replace("url(#drop-shadow)", `url(${o}-drop-shadow)`) : "none";
779
+ return `
780
+ .edge {
781
+ stroke-width: 3;
782
+ }
783
+ ${Le(t)}
784
+ .section-root rect, .section-root path, .section-root circle, .section-root polygon {
785
+ fill: ${t.git0};
786
+ }
787
+ .section-root text {
788
+ fill: ${t.gitBranchLabel0};
789
+ }
790
+ .section-root span {
791
+ color: ${e != null && e.includes("redux") ? t.nodeBorder : t.gitBranchLabel0};
792
+ }
793
+ .icon-container {
794
+ height:100%;
795
+ display: flex;
796
+ justify-content: center;
797
+ align-items: center;
798
+ }
799
+ .edge {
800
+ fill: none;
801
+ }
802
+ .mindmap-node-label {
803
+ dy: 1em;
804
+ alignment-baseline: middle;
805
+ text-anchor: middle;
806
+ dominant-baseline: middle;
807
+ text-align: center;
808
+ }
809
+ [data-look="neo"].mindmap-node {
810
+ filter: ${l};
811
+ }
812
+ [data-look="neo"].mindmap-node.section-root rect, [data-look="neo"].mindmap-node.section-root path, [data-look="neo"].mindmap-node.section-root circle, [data-look="neo"].mindmap-node.section-root polygon {
813
+ fill: ${e != null && e.includes("redux") ? t.mainBkg : t.git0};
814
+ }
815
+ [data-look="neo"].mindmap-node.section-root .text-inner-tspan {
816
+ fill: ${e != null && e.includes("redux") ? t.nodeBorder : t["cScaleLabel" + (e === "neutral" ? 1 : 0)]};
817
+ }
818
+ ${t.useGradient && o && t.mainBkg ? ve(t.THEME_COLOR_LIMIT, o, t.mainBkg) : ""}
819
+ `;
820
+ }, "getStyles"), Oe = Te, Re = {
821
+ get db() {
822
+ return new xe();
823
+ },
824
+ renderer: De,
825
+ parser: ke,
826
+ styles: Oe
827
+ };
828
+ export {
829
+ Re as diagram
830
+ };