epic-designer-gold
Version:
基于vue3的设计器,可视化开发页面表单
788 lines (786 loc) • 32.2 kB
JavaScript
import { g as le } from "./chunk-55IACEB6-CEBPV7RK.js";
import { s as he } from "./chunk-KX2RTZJC-CtCuAxcv.js";
import { _ as l, l as C, p as de, r as ge, H as j, c as X, i as F, aK as ue, ad as pe, ae as fe, af as ye } from "./mermaid.core-BmO8XxbV.js";
const E = [];
for (let t = 0; t < 256; ++t)
E.push((t + 256).toString(16).slice(1));
function me(t, e = 0) {
return (E[t[e + 0]] + E[t[e + 1]] + E[t[e + 2]] + E[t[e + 3]] + "-" + E[t[e + 4]] + E[t[e + 5]] + "-" + E[t[e + 6]] + E[t[e + 7]] + "-" + E[t[e + 8]] + E[t[e + 9]] + "-" + E[t[e + 10]] + E[t[e + 11]] + E[t[e + 12]] + E[t[e + 13]] + E[t[e + 14]] + E[t[e + 15]]).toLowerCase();
}
let Y;
const Ee = new Uint8Array(16);
function _e() {
if (!Y) {
if (typeof crypto > "u" || !crypto.getRandomValues)
throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");
Y = crypto.getRandomValues.bind(crypto);
}
return Y(Ee);
}
const be = typeof crypto < "u" && crypto.randomUUID && crypto.randomUUID.bind(crypto), ne = { randomUUID: be };
function Se(t, e, n) {
var u;
if (ne.randomUUID && !t)
return ne.randomUUID();
t = t || {};
const c = t.random ?? ((u = t.rng) == null ? void 0 : u.call(t)) ?? _e();
if (c.length < 16)
throw new Error("Random bytes length must be >= 16");
return c[6] = c[6] & 15 | 64, c[8] = c[8] & 63 | 128, me(c);
}
var K = function() {
var t = /* @__PURE__ */ l(function(v, s, i, a) {
for (i = i || {}, a = v.length; a--; i[v[a]] = s) ;
return i;
}, "o"), e = [1, 4], n = [1, 13], c = [1, 12], u = [1, 15], h = [1, 16], p = [1, 20], y = [1, 19], _ = [6, 7, 8], b = [1, 26], m = [1, 24], w = [1, 25], N = [6, 7, 11], q = [1, 6, 13, 15, 16, 19, 22], J = [1, 33], Q = [1, 34], A = [1, 6, 7, 11, 13, 15, 16, 19, 22], G = {
trace: /* @__PURE__ */ l(function() {
}, "trace"),
yy: {},
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 },
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" },
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]],
performAction: /* @__PURE__ */ l(function(s, i, a, o, g, r, U) {
var d = r.length - 1;
switch (g) {
case 6:
case 7:
return o;
case 8:
o.getLogger().trace("Stop NL ");
break;
case 9:
o.getLogger().trace("Stop EOF ");
break;
case 11:
o.getLogger().trace("Stop NL2 ");
break;
case 12:
o.getLogger().trace("Stop EOF2 ");
break;
case 15:
o.getLogger().info("Node: ", r[d].id), o.addNode(r[d - 1].length, r[d].id, r[d].descr, r[d].type);
break;
case 16:
o.getLogger().trace("Icon: ", r[d]), o.decorateNode({ icon: r[d] });
break;
case 17:
case 21:
o.decorateNode({ class: r[d] });
break;
case 18:
o.getLogger().trace("SPACELIST");
break;
case 19:
o.getLogger().trace("Node: ", r[d].id), o.addNode(0, r[d].id, r[d].descr, r[d].type);
break;
case 20:
o.decorateNode({ icon: r[d] });
break;
case 25:
o.getLogger().trace("node found ..", r[d - 2]), this.$ = { id: r[d - 1], descr: r[d - 1], type: o.getType(r[d - 2], r[d]) };
break;
case 26:
this.$ = { id: r[d], descr: r[d], type: o.nodeType.DEFAULT };
break;
case 27:
o.getLogger().trace("node found ..", r[d - 3]), this.$ = { id: r[d - 3], descr: r[d - 1], type: o.getType(r[d - 2], r[d]) };
break;
}
}, "anonymous"),
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: n, 7: [1, 10], 9: 9, 12: 11, 13: c, 14: 14, 15: u, 16: h, 17: 17, 18: 18, 19: p, 22: y }, t(_, [2, 3]), { 1: [2, 2] }, t(_, [2, 4]), t(_, [2, 5]), { 1: [2, 6], 6: n, 12: 21, 13: c, 14: 14, 15: u, 16: h, 17: 17, 18: 18, 19: p, 22: y }, { 6: n, 9: 22, 12: 11, 13: c, 14: 14, 15: u, 16: h, 17: 17, 18: 18, 19: p, 22: y }, { 6: b, 7: m, 10: 23, 11: w }, t(N, [2, 22], { 17: 17, 18: 18, 14: 27, 15: [1, 28], 16: [1, 29], 19: p, 22: y }), t(N, [2, 18]), t(N, [2, 19]), t(N, [2, 20]), t(N, [2, 21]), t(N, [2, 23]), t(N, [2, 24]), t(N, [2, 26], { 19: [1, 30] }), { 20: [1, 31] }, { 6: b, 7: m, 10: 32, 11: w }, { 1: [2, 7], 6: n, 12: 21, 13: c, 14: 14, 15: u, 16: h, 17: 17, 18: 18, 19: p, 22: y }, t(q, [2, 14], { 7: J, 11: Q }), t(A, [2, 8]), t(A, [2, 9]), t(A, [2, 10]), t(N, [2, 15]), t(N, [2, 16]), t(N, [2, 17]), { 20: [1, 35] }, { 21: [1, 36] }, t(q, [2, 13], { 7: J, 11: Q }), t(A, [2, 11]), t(A, [2, 12]), { 21: [1, 37] }, t(N, [2, 25]), t(N, [2, 27])],
defaultActions: { 2: [2, 1], 6: [2, 2] },
parseError: /* @__PURE__ */ l(function(s, i) {
if (i.recoverable)
this.trace(s);
else {
var a = new Error(s);
throw a.hash = i, a;
}
}, "parseError"),
parse: /* @__PURE__ */ l(function(s) {
var i = this, a = [0], o = [], g = [null], r = [], U = this.table, d = "", M = 0, Z = 0, re = 2, ee = 1, ae = r.slice.call(arguments, 1), f = Object.create(this.lexer), T = { yy: {} };
for (var H in this.yy)
Object.prototype.hasOwnProperty.call(this.yy, H) && (T.yy[H] = this.yy[H]);
f.setInput(s, T.yy), T.yy.lexer = f, T.yy.parser = this, typeof f.yylloc > "u" && (f.yylloc = {});
var $ = f.yylloc;
r.push($);
var oe = f.options && f.options.ranges;
typeof T.yy.parseError == "function" ? this.parseError = T.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
function ce(D) {
a.length = a.length - 2 * D, g.length = g.length - D, r.length = r.length - D;
}
l(ce, "popStack");
function te() {
var D;
return D = o.pop() || f.lex() || ee, typeof D != "number" && (D instanceof Array && (o = D, D = o.pop()), D = i.symbols_[D] || D), D;
}
l(te, "lex");
for (var S, O, k, z, I = {}, V, L, ie, B; ; ) {
if (O = a[a.length - 1], this.defaultActions[O] ? k = this.defaultActions[O] : ((S === null || typeof S > "u") && (S = te()), k = U[O] && U[O][S]), typeof k > "u" || !k.length || !k[0]) {
var W = "";
B = [];
for (V in U[O])
this.terminals_[V] && V > re && B.push("'" + this.terminals_[V] + "'");
f.showPosition ? W = "Parse error on line " + (M + 1) + `:
` + f.showPosition() + `
Expecting ` + B.join(", ") + ", got '" + (this.terminals_[S] || S) + "'" : W = "Parse error on line " + (M + 1) + ": Unexpected " + (S == ee ? "end of input" : "'" + (this.terminals_[S] || S) + "'"), this.parseError(W, {
text: f.match,
token: this.terminals_[S] || S,
line: f.yylineno,
loc: $,
expected: B
});
}
if (k[0] instanceof Array && k.length > 1)
throw new Error("Parse Error: multiple actions possible at state: " + O + ", token: " + S);
switch (k[0]) {
case 1:
a.push(S), g.push(f.yytext), r.push(f.yylloc), a.push(k[1]), S = null, Z = f.yyleng, d = f.yytext, M = f.yylineno, $ = f.yylloc;
break;
case 2:
if (L = this.productions_[k[1]][1], I.$ = g[g.length - L], I._$ = {
first_line: r[r.length - (L || 1)].first_line,
last_line: r[r.length - 1].last_line,
first_column: r[r.length - (L || 1)].first_column,
last_column: r[r.length - 1].last_column
}, oe && (I._$.range = [
r[r.length - (L || 1)].range[0],
r[r.length - 1].range[1]
]), z = this.performAction.apply(I, [
d,
Z,
M,
T.yy,
k[1],
g,
r
].concat(ae)), typeof z < "u")
return z;
L && (a = a.slice(0, -1 * L * 2), g = g.slice(0, -1 * L), r = r.slice(0, -1 * L)), a.push(this.productions_[k[1]][0]), g.push(I.$), r.push(I._$), ie = U[a[a.length - 2]][a[a.length - 1]], a.push(ie);
break;
case 3:
return !0;
}
}
return !0;
}, "parse")
}, se = /* @__PURE__ */ function() {
var v = {
EOF: 1,
parseError: /* @__PURE__ */ l(function(i, a) {
if (this.yy.parser)
this.yy.parser.parseError(i, a);
else
throw new Error(i);
}, "parseError"),
// resets the lexer, sets new input
setInput: /* @__PURE__ */ l(function(s, i) {
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 = {
first_line: 1,
first_column: 0,
last_line: 1,
last_column: 0
}, this.options.ranges && (this.yylloc.range = [0, 0]), this.offset = 0, this;
}, "setInput"),
// consumes and returns one char from the input
input: /* @__PURE__ */ l(function() {
var s = this._input[0];
this.yytext += s, this.yyleng++, this.offset++, this.match += s, this.matched += s;
var i = s.match(/(?:\r\n?|\n).*/g);
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;
}, "input"),
// unshifts one char (or a string) into the input
unput: /* @__PURE__ */ l(function(s) {
var i = s.length, a = s.split(/(?:\r\n?|\n)/g);
this._input = s + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - i), this.offset -= i;
var o = this.match.split(/(?:\r\n?|\n)/g);
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);
var g = this.yylloc.range;
return this.yylloc = {
first_line: this.yylloc.first_line,
last_line: this.yylineno + 1,
first_column: this.yylloc.first_column,
last_column: a ? (a.length === o.length ? this.yylloc.first_column : 0) + o[o.length - a.length].length - a[0].length : this.yylloc.first_column - i
}, this.options.ranges && (this.yylloc.range = [g[0], g[0] + this.yyleng - i]), this.yyleng = this.yytext.length, this;
}, "unput"),
// When called from action, caches matched text and appends it on next action
more: /* @__PURE__ */ l(function() {
return this._more = !0, this;
}, "more"),
// 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.
reject: /* @__PURE__ */ l(function() {
if (this.options.backtrack_lexer)
this._backtrack = !0;
else
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).
` + this.showPosition(), {
text: "",
token: null,
line: this.yylineno
});
return this;
}, "reject"),
// retain first n characters of the match
less: /* @__PURE__ */ l(function(s) {
this.unput(this.match.slice(s));
}, "less"),
// displays already matched input, i.e. for error messages
pastInput: /* @__PURE__ */ l(function() {
var s = this.matched.substr(0, this.matched.length - this.match.length);
return (s.length > 20 ? "..." : "") + s.substr(-20).replace(/\n/g, "");
}, "pastInput"),
// displays upcoming input, i.e. for error messages
upcomingInput: /* @__PURE__ */ l(function() {
var s = this.match;
return s.length < 20 && (s += this._input.substr(0, 20 - s.length)), (s.substr(0, 20) + (s.length > 20 ? "..." : "")).replace(/\n/g, "");
}, "upcomingInput"),
// displays the character position where the lexing error occurred, i.e. for error messages
showPosition: /* @__PURE__ */ l(function() {
var s = this.pastInput(), i = new Array(s.length + 1).join("-");
return s + this.upcomingInput() + `
` + i + "^";
}, "showPosition"),
// test the lexed token: return FALSE when not a match, otherwise return token
test_match: /* @__PURE__ */ l(function(s, i) {
var a, o, g;
if (this.options.backtrack_lexer && (g = {
yylineno: this.yylineno,
yylloc: {
first_line: this.yylloc.first_line,
last_line: this.last_line,
first_column: this.yylloc.first_column,
last_column: this.yylloc.last_column
},
yytext: this.yytext,
match: this.match,
matches: this.matches,
matched: this.matched,
yyleng: this.yyleng,
offset: this.offset,
_more: this._more,
_input: this._input,
yy: this.yy,
conditionStack: this.conditionStack.slice(0),
done: this.done
}, this.options.ranges && (g.yylloc.range = this.yylloc.range.slice(0))), o = s[0].match(/(?:\r\n?|\n).*/g), o && (this.yylineno += o.length), this.yylloc = {
first_line: this.yylloc.last_line,
last_line: this.yylineno + 1,
first_column: this.yylloc.last_column,
last_column: o ? o[o.length - 1].length - o[o.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + s[0].length
}, 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)
return a;
if (this._backtrack) {
for (var r in g)
this[r] = g[r];
return !1;
}
return !1;
}, "test_match"),
// return next match in input
next: /* @__PURE__ */ l(function() {
if (this.done)
return this.EOF;
this._input || (this.done = !0);
var s, i, a, o;
this._more || (this.yytext = "", this.match = "");
for (var g = this._currentRules(), r = 0; r < g.length; r++)
if (a = this._input.match(this.rules[g[r]]), a && (!i || a[0].length > i[0].length)) {
if (i = a, o = r, this.options.backtrack_lexer) {
if (s = this.test_match(a, g[r]), s !== !1)
return s;
if (this._backtrack) {
i = !1;
continue;
} else
return !1;
} else if (!this.options.flex)
break;
}
return i ? (s = this.test_match(i, g[o]), s !== !1 ? s : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
` + this.showPosition(), {
text: "",
token: null,
line: this.yylineno
});
}, "next"),
// return next match that has a token
lex: /* @__PURE__ */ l(function() {
var i = this.next();
return i || this.lex();
}, "lex"),
// activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
begin: /* @__PURE__ */ l(function(i) {
this.conditionStack.push(i);
}, "begin"),
// pop the previously active lexer condition state off the condition stack
popState: /* @__PURE__ */ l(function() {
var i = this.conditionStack.length - 1;
return i > 0 ? this.conditionStack.pop() : this.conditionStack[0];
}, "popState"),
// produce the lexer rule set which is active for the currently active lexer condition state
_currentRules: /* @__PURE__ */ l(function() {
return this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1] ? this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules : this.conditions.INITIAL.rules;
}, "_currentRules"),
// return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
topState: /* @__PURE__ */ l(function(i) {
return i = this.conditionStack.length - 1 - Math.abs(i || 0), i >= 0 ? this.conditionStack[i] : "INITIAL";
}, "topState"),
// alias for begin(condition)
pushState: /* @__PURE__ */ l(function(i) {
this.begin(i);
}, "pushState"),
// return the number of states currently on the stack
stateStackSize: /* @__PURE__ */ l(function() {
return this.conditionStack.length;
}, "stateStackSize"),
options: { "case-insensitive": !0 },
performAction: /* @__PURE__ */ l(function(i, a, o, g) {
switch (o) {
case 0:
return i.getLogger().trace("Found comment", a.yytext), 6;
case 1:
return 8;
case 2:
this.begin("CLASS");
break;
case 3:
return this.popState(), 16;
case 4:
this.popState();
break;
case 5:
i.getLogger().trace("Begin icon"), this.begin("ICON");
break;
case 6:
return i.getLogger().trace("SPACELINE"), 6;
case 7:
return 7;
case 8:
return 15;
case 9:
i.getLogger().trace("end icon"), this.popState();
break;
case 10:
return i.getLogger().trace("Exploding node"), this.begin("NODE"), 19;
case 11:
return i.getLogger().trace("Cloud"), this.begin("NODE"), 19;
case 12:
return i.getLogger().trace("Explosion Bang"), this.begin("NODE"), 19;
case 13:
return i.getLogger().trace("Cloud Bang"), this.begin("NODE"), 19;
case 14:
return this.begin("NODE"), 19;
case 15:
return this.begin("NODE"), 19;
case 16:
return this.begin("NODE"), 19;
case 17:
return this.begin("NODE"), 19;
case 18:
return 13;
case 19:
return 22;
case 20:
return 11;
case 21:
this.begin("NSTR2");
break;
case 22:
return "NODE_DESCR";
case 23:
this.popState();
break;
case 24:
i.getLogger().trace("Starting NSTR"), this.begin("NSTR");
break;
case 25:
return i.getLogger().trace("description:", a.yytext), "NODE_DESCR";
case 26:
this.popState();
break;
case 27:
return this.popState(), i.getLogger().trace("node end ))"), "NODE_DEND";
case 28:
return this.popState(), i.getLogger().trace("node end )"), "NODE_DEND";
case 29:
return this.popState(), i.getLogger().trace("node end ...", a.yytext), "NODE_DEND";
case 30:
return this.popState(), i.getLogger().trace("node end (("), "NODE_DEND";
case 31:
return this.popState(), i.getLogger().trace("node end (-"), "NODE_DEND";
case 32:
return this.popState(), i.getLogger().trace("node end (-"), "NODE_DEND";
case 33:
return this.popState(), i.getLogger().trace("node end (("), "NODE_DEND";
case 34:
return this.popState(), i.getLogger().trace("node end (("), "NODE_DEND";
case 35:
return i.getLogger().trace("Long description:", a.yytext), 20;
case 36:
return i.getLogger().trace("Long description:", a.yytext), 20;
}
}, "anonymous"),
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],
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 } }
};
return v;
}();
G.lexer = se;
function P() {
this.yy = {};
}
return l(P, "Parser"), P.prototype = G, G.Parser = P, new P();
}();
K.parser = K;
var Ne = K, De = 12, x = {
DEFAULT: 0,
NO_BORDER: 0,
ROUNDED_RECT: 1,
RECT: 2,
CIRCLE: 3,
CLOUD: 4,
BANG: 5,
HEXAGON: 6
}, R, ke = (R = class {
constructor() {
this.nodes = [], this.count = 0, this.elements = {}, this.getLogger = this.getLogger.bind(this), this.nodeType = x, 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);
}
clear() {
this.nodes = [], this.count = 0, this.elements = {}, this.baseLevel = void 0;
}
getParent(e) {
for (let n = this.nodes.length - 1; n >= 0; n--)
if (this.nodes[n].level < e)
return this.nodes[n];
return null;
}
getMindmap() {
return this.nodes.length > 0 ? this.nodes[0] : null;
}
addNode(e, n, c, u) {
var m, w;
C.info("addNode", e, n, c, u);
let h = !1;
this.nodes.length === 0 ? (this.baseLevel = e, e = 0, h = !0) : this.baseLevel !== void 0 && (e = e - this.baseLevel, h = !1);
const p = X();
let y = ((m = p.mindmap) == null ? void 0 : m.padding) ?? j.mindmap.padding;
switch (u) {
case this.nodeType.ROUNDED_RECT:
case this.nodeType.RECT:
case this.nodeType.HEXAGON:
y *= 2;
break;
}
const _ = {
id: this.count++,
nodeId: F(n, p),
level: e,
descr: F(c, p),
type: u,
children: [],
width: ((w = p.mindmap) == null ? void 0 : w.maxNodeWidth) ?? j.mindmap.maxNodeWidth,
padding: y,
isRoot: h
}, b = this.getParent(e);
if (b)
b.children.push(_), this.nodes.push(_);
else if (h)
this.nodes.push(_);
else
throw new Error(
`There can be only one root. No parent could be found for ("${_.descr}")`
);
}
getType(e, n) {
switch (C.debug("In get type", e, n), e) {
case "[":
return this.nodeType.RECT;
case "(":
return n === ")" ? this.nodeType.ROUNDED_RECT : this.nodeType.CLOUD;
case "((":
return this.nodeType.CIRCLE;
case ")":
return this.nodeType.CLOUD;
case "))":
return this.nodeType.BANG;
case "{{":
return this.nodeType.HEXAGON;
default:
return this.nodeType.DEFAULT;
}
}
setElementForId(e, n) {
this.elements[e] = n;
}
getElementById(e) {
return this.elements[e];
}
decorateNode(e) {
if (!e)
return;
const n = X(), c = this.nodes[this.nodes.length - 1];
e.icon && (c.icon = F(e.icon, n)), e.class && (c.class = F(e.class, n));
}
type2Str(e) {
switch (e) {
case this.nodeType.DEFAULT:
return "no-border";
case this.nodeType.RECT:
return "rect";
case this.nodeType.ROUNDED_RECT:
return "rounded-rect";
case this.nodeType.CIRCLE:
return "circle";
case this.nodeType.CLOUD:
return "cloud";
case this.nodeType.BANG:
return "bang";
case this.nodeType.HEXAGON:
return "hexgon";
default:
return "no-border";
}
}
/**
* Assign section numbers to nodes based on their position relative to root
* @param node - The mindmap node to process
* @param sectionNumber - The section number to assign (undefined for root)
*/
assignSections(e, n) {
if (e.level === 0 ? e.section = void 0 : e.section = n, e.children)
for (const [c, u] of e.children.entries()) {
const h = e.level === 0 ? c % (De - 1) : n;
this.assignSections(u, h);
}
}
/**
* Convert mindmap tree structure to flat array of nodes
* @param node - The mindmap node to process
* @param processedNodes - Array to collect processed nodes
*/
flattenNodes(e, n) {
const c = ["mindmap-node"];
e.isRoot === !0 ? c.push("section-root", "section--1") : e.section !== void 0 && c.push(`section-${e.section}`), e.class && c.push(e.class);
const u = c.join(" "), h = /* @__PURE__ */ l((y) => {
switch (y) {
case x.CIRCLE:
return "mindmapCircle";
case x.RECT:
return "rect";
case x.ROUNDED_RECT:
return "rounded";
case x.CLOUD:
return "cloud";
case x.BANG:
return "bang";
case x.HEXAGON:
return "hexagon";
case x.DEFAULT:
return "defaultMindmapNode";
case x.NO_BORDER:
default:
return "rect";
}
}, "getShapeFromType"), p = {
id: e.id.toString(),
domId: "node_" + e.id.toString(),
label: e.descr,
labelType: "markdown",
isGroup: !1,
shape: h(e.type),
width: e.width,
height: e.height ?? 0,
padding: e.padding,
cssClasses: u,
cssStyles: [],
look: "default",
icon: e.icon,
x: e.x,
y: e.y,
// Mindmap-specific properties
level: e.level,
nodeId: e.nodeId,
type: e.type,
section: e.section
};
if (n.push(p), e.children)
for (const y of e.children)
this.flattenNodes(y, n);
}
/**
* Generate edges from parent-child relationships in mindmap tree
* @param node - The mindmap node to process
* @param edges - Array to collect edges
*/
generateEdges(e, n) {
if (e.children)
for (const c of e.children) {
let u = "edge";
c.section !== void 0 && (u += ` section-edge-${c.section}`);
const h = e.level + 1;
u += ` edge-depth-${h}`;
const p = {
id: `edge_${e.id}_${c.id}`,
start: e.id.toString(),
end: c.id.toString(),
type: "normal",
curve: "basis",
thickness: "normal",
look: "default",
classes: u,
// Store mindmap-specific data
depth: e.level,
section: c.section
};
n.push(p), this.generateEdges(c, n);
}
}
/**
* Get structured data for layout algorithms
* Following the pattern established by ER diagrams
* @returns Structured data containing nodes, edges, and config
*/
getData() {
const e = this.getMindmap(), n = X(), u = ue().layout !== void 0, h = n;
if (u || (h.layout = "cose-bilkent"), !e)
return {
nodes: [],
edges: [],
config: h
};
C.debug("getData: mindmapRoot", e, n), this.assignSections(e);
const p = [], y = [];
this.flattenNodes(e, p), this.generateEdges(e, y), C.debug(
`getData: processed ${p.length} nodes and ${y.length} edges`
);
const _ = /* @__PURE__ */ new Map();
for (const b of p)
_.set(b.id, {
shape: b.shape,
width: b.width,
height: b.height,
padding: b.padding
});
return {
nodes: p,
edges: y,
config: h,
// Store the root node for mindmap-specific layout algorithms
rootNode: e,
// Properties required by dagre layout algorithm
markers: ["point"],
// Mindmaps don't use markers
direction: "TB",
// Top-to-bottom direction for mindmaps
nodeSpacing: 50,
// Default spacing between nodes
rankSpacing: 50,
// Default spacing between ranks
// Add shapes for ELK compatibility
shapes: Object.fromEntries(_),
// Additional properties that layout algorithms might expect
type: "mindmap",
diagramId: "mindmap-" + Se()
};
}
// Expose logger to grammar
getLogger() {
return C;
}
}, l(R, "MindmapDB"), R), Le = /* @__PURE__ */ l(async (t, e, n, c) => {
var _, b;
C.debug(`Rendering mindmap diagram
` + t);
const u = c.db, h = u.getData(), p = le(e, h.config.securityLevel);
h.type = c.type, h.layoutAlgorithm = de(h.config.layout, {
fallback: "cose-bilkent"
}), h.diagramId = e, u.getMindmap() && (h.nodes.forEach((m) => {
m.shape === "rounded" ? (m.radius = 15, m.taper = 15, m.stroke = "none", m.width = 0, m.padding = 15) : m.shape === "circle" ? m.padding = 10 : m.shape === "rect" && (m.width = 0, m.padding = 10);
}), await ge(h, p), he(
p,
((_ = h.config.mindmap) == null ? void 0 : _.padding) ?? j.mindmap.padding,
"mindmapDiagram",
((b = h.config.mindmap) == null ? void 0 : b.useMaxWidth) ?? j.mindmap.useMaxWidth
));
}, "draw"), xe = {
draw: Le
}, ve = /* @__PURE__ */ l((t) => {
let e = "";
for (let n = 0; n < t.THEME_COLOR_LIMIT; n++)
t["lineColor" + n] = t["lineColor" + n] || t["cScaleInv" + n], pe(t["lineColor" + n]) ? t["lineColor" + n] = fe(t["lineColor" + n], 20) : t["lineColor" + n] = ye(t["lineColor" + n], 20);
for (let n = 0; n < t.THEME_COLOR_LIMIT; n++) {
const c = "" + (17 - 3 * n);
e += `
.section-${n - 1} rect, .section-${n - 1} path, .section-${n - 1} circle, .section-${n - 1} polygon, .section-${n - 1} path {
fill: ${t["cScale" + n]};
}
.section-${n - 1} text {
fill: ${t["cScaleLabel" + n]};
}
.node-icon-${n - 1} {
font-size: 40px;
color: ${t["cScaleLabel" + n]};
}
.section-edge-${n - 1}{
stroke: ${t["cScale" + n]};
}
.edge-depth-${n - 1}{
stroke-width: ${c};
}
.section-${n - 1} line {
stroke: ${t["cScaleInv" + n]} ;
stroke-width: 3;
}
.disabled, .disabled circle, .disabled text {
fill: lightgray;
}
.disabled text {
fill: #efefef;
}
`;
}
return e;
}, "genSections"), Te = /* @__PURE__ */ l((t) => `
.edge {
stroke-width: 3;
}
${ve(t)}
.section-root rect, .section-root path, .section-root circle, .section-root polygon {
fill: ${t.git0};
}
.section-root text {
fill: ${t.gitBranchLabel0};
}
.section-root span {
color: ${t.gitBranchLabel0};
}
.section-2 span {
color: ${t.gitBranchLabel0};
}
.icon-container {
height:100%;
display: flex;
justify-content: center;
align-items: center;
}
.edge {
fill: none;
}
.mindmap-node-label {
dy: 1em;
alignment-baseline: middle;
text-anchor: middle;
dominant-baseline: middle;
text-align: center;
}
`, "getStyles"), Oe = Te, we = {
get db() {
return new ke();
},
renderer: xe,
parser: Ne,
styles: Oe
};
export {
we as diagram
};