@billtaofbj/mindmap 1.0.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.
- package/LICENSE +21 -0
- package/dist/AutoMove-B6piuV1l.mjs +21 -0
- package/dist/Base-B8xfItDp.mjs +289 -0
- package/dist/Drag-BNJqZaaB.mjs +458 -0
- package/dist/Export-C11gtER2.mjs +307 -0
- package/dist/Formula-rim6V3Ro.mjs +29081 -0
- package/dist/KeyboardNavigation-BznWjRqo.mjs +106 -0
- package/dist/MindMapNode-CKCds6wa.mjs +1865 -0
- package/dist/MiniMap-BtFFvLbR.mjs +98 -0
- package/dist/NodeImgAdjust-CU_ka96q.mjs +138 -0
- package/dist/OuterFrame-D-P0EKq5.mjs +325 -0
- package/dist/Painter-D3byksYq.mjs +42 -0
- package/dist/RainbowLines-CGp8BmNt.mjs +52 -0
- package/dist/Scrollbar-5bObtsl_.mjs +117 -0
- package/dist/Search-1GRF2dmm.mjs +124 -0
- package/dist/Select-CY_n5-r2.mjs +99 -0
- package/dist/Watermark-B-zBgHXG.mjs +88 -0
- package/dist/api-D2rfJWe_.mjs +16 -0
- package/dist/btns-Cf5zZK5X.mjs +9 -0
- package/dist/index.cjs.js +1515 -0
- package/dist/index.es.js +2745 -0
- package/dist/mindmap.css +2 -0
- package/dist/simple-mind-map-DFGmd5vc.mjs +3188 -0
- package/dist/utils-DjW7eJ1w.mjs +4295 -0
- package/package.json +26 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2026 @yourcompany
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
//#region ../../node_modules/.pnpm/simple-mind-map@0.14.0-fix.2/node_modules/simple-mind-map/src/utils/AutoMove.js
|
|
2
|
+
var e = class {
|
|
3
|
+
constructor(e) {
|
|
4
|
+
this.mindMap = e, this.autoMoveTimer = null;
|
|
5
|
+
}
|
|
6
|
+
onMove(e, t, n = () => {}, r = () => {}) {
|
|
7
|
+
n();
|
|
8
|
+
let i = this.mindMap.opt.selectTranslateStep, a = this.mindMap.opt.selectTranslateLimit, o = 0;
|
|
9
|
+
e <= this.mindMap.elRect.left + a && (r("left", i), this.mindMap.view.translateX(i), o++), e >= this.mindMap.elRect.right - a && (r("right", i), this.mindMap.view.translateX(-i), o++), t <= this.mindMap.elRect.top + a && (r("top", i), this.mindMap.view.translateY(i), o++), t >= this.mindMap.elRect.bottom - a && (r("bottom", i), this.mindMap.view.translateY(-i), o++), o > 0 && this.startAutoMove(e, t, n, r);
|
|
10
|
+
}
|
|
11
|
+
startAutoMove(e, t, n, r) {
|
|
12
|
+
this.autoMoveTimer = setTimeout(() => {
|
|
13
|
+
this.onMove(e, t, n, r);
|
|
14
|
+
}, 20);
|
|
15
|
+
}
|
|
16
|
+
clearAutoMoveTimer() {
|
|
17
|
+
clearTimeout(this.autoMoveTimer);
|
|
18
|
+
}
|
|
19
|
+
};
|
|
20
|
+
//#endregion
|
|
21
|
+
export { e as t };
|
|
@@ -0,0 +1,289 @@
|
|
|
1
|
+
import { At as e, Dt as t, _ as n } from "./utils-DjW7eJ1w.mjs";
|
|
2
|
+
import { t as r } from "./MindMapNode-CKCds6wa.mjs";
|
|
3
|
+
//#region ../../node_modules/.pnpm/simple-mind-map@0.14.0-fix.2/node_modules/simple-mind-map/src/utils/Lru.js
|
|
4
|
+
var i = class {
|
|
5
|
+
constructor(e) {
|
|
6
|
+
this.max = e || 1e3, this.size = 0, this.pool = /* @__PURE__ */ new Map();
|
|
7
|
+
}
|
|
8
|
+
add(e, t) {
|
|
9
|
+
return !this.has(e) && this.size >= this.max ? !1 : (this.delete(e), this.pool.set(e, t), this.size++, !0);
|
|
10
|
+
}
|
|
11
|
+
delete(e) {
|
|
12
|
+
this.pool.has(e) && (this.pool.delete(e), this.size--);
|
|
13
|
+
}
|
|
14
|
+
has(e) {
|
|
15
|
+
return this.pool.has(e);
|
|
16
|
+
}
|
|
17
|
+
get(e) {
|
|
18
|
+
if (this.pool.has(e)) return this.pool.get(e);
|
|
19
|
+
}
|
|
20
|
+
clear() {
|
|
21
|
+
this.size = 0, this.pool = /* @__PURE__ */ new Map();
|
|
22
|
+
}
|
|
23
|
+
}, a = class {
|
|
24
|
+
constructor(e) {
|
|
25
|
+
this.renderer = e, this.mindMap = e.mindMap, this.draw = this.mindMap.draw, this.lineDraw = this.mindMap.lineDraw, this.root = null, this.lru = new i(this.mindMap.opt.maxNodeCacheCount), this.rootNodeCenterOffset = null;
|
|
26
|
+
}
|
|
27
|
+
doLayout() {
|
|
28
|
+
throw Error("【computed】方法为必要方法,需要子类进行重写!");
|
|
29
|
+
}
|
|
30
|
+
renderLine() {
|
|
31
|
+
throw Error("【renderLine】方法为必要方法,需要子类进行重写!");
|
|
32
|
+
}
|
|
33
|
+
renderExpandBtn() {
|
|
34
|
+
throw Error("【renderExpandBtn】方法为必要方法,需要子类进行重写!");
|
|
35
|
+
}
|
|
36
|
+
renderGeneralization() {}
|
|
37
|
+
cacheNode(e, t) {
|
|
38
|
+
this.renderer.nodeCache[e] = t, this.lru.add(e, t);
|
|
39
|
+
}
|
|
40
|
+
checkIsNeedResizeSources() {
|
|
41
|
+
return this.renderer.checkHasRenderSource(t.CHANGE_THEME);
|
|
42
|
+
}
|
|
43
|
+
checkIsLayerTypeChange(e, t) {
|
|
44
|
+
if (e >= 2 && t >= 2) return !1;
|
|
45
|
+
if (e >= 2 && t < 2 || e < 2 && t >= 2) return !0;
|
|
46
|
+
}
|
|
47
|
+
checkIsLayoutChangeRerenderExpandBtnPlaceholderRect(e) {
|
|
48
|
+
this.renderer.checkHasRenderSource(t.CHANGE_LAYOUT) && (e.needRerenderExpandBtnPlaceholderRect = !0);
|
|
49
|
+
}
|
|
50
|
+
checkIsNodeDataChange(e, t) {
|
|
51
|
+
if (e) e = typeof e == "string" ? JSON.parse(e) : e, e.isActive = t.isActive, e.expand = t.expand, e = JSON.stringify(e);
|
|
52
|
+
else return !1;
|
|
53
|
+
return e !== JSON.stringify(t);
|
|
54
|
+
}
|
|
55
|
+
checkNodeFixChange(e, t, n) {
|
|
56
|
+
let r = !1;
|
|
57
|
+
this.mindMap.nodeInnerPrefixList.forEach((n) => {
|
|
58
|
+
if (n.updateNodeData) {
|
|
59
|
+
let i = n.updateNodeData(e, t);
|
|
60
|
+
i && (r = i);
|
|
61
|
+
}
|
|
62
|
+
});
|
|
63
|
+
let i = !1;
|
|
64
|
+
return this.mindMap.nodeInnerPostfixList.forEach((t) => {
|
|
65
|
+
if (t.updateNodeData) {
|
|
66
|
+
let r = t.updateNodeData(e, n);
|
|
67
|
+
r && (i = r);
|
|
68
|
+
}
|
|
69
|
+
}), r || i;
|
|
70
|
+
}
|
|
71
|
+
createNode(e, t, i, a, o, s) {
|
|
72
|
+
let c = {};
|
|
73
|
+
this.mindMap.nodeInnerPrefixList.forEach((n) => {
|
|
74
|
+
if (n.createNodeData) {
|
|
75
|
+
let [r, i] = n.createNodeData({
|
|
76
|
+
data: e,
|
|
77
|
+
parent: t,
|
|
78
|
+
ancestors: s,
|
|
79
|
+
layerIndex: a,
|
|
80
|
+
index: o
|
|
81
|
+
});
|
|
82
|
+
c[r] = i;
|
|
83
|
+
}
|
|
84
|
+
});
|
|
85
|
+
let l = {};
|
|
86
|
+
this.mindMap.nodeInnerPostfixList.forEach((n) => {
|
|
87
|
+
if (n.createNodeData) {
|
|
88
|
+
let [r, i] = n.createNodeData({
|
|
89
|
+
data: e,
|
|
90
|
+
parent: t,
|
|
91
|
+
ancestors: s,
|
|
92
|
+
layerIndex: a,
|
|
93
|
+
index: o
|
|
94
|
+
});
|
|
95
|
+
l[r] = i;
|
|
96
|
+
}
|
|
97
|
+
});
|
|
98
|
+
let u = e.data.uid, d = null;
|
|
99
|
+
if (e && e._node && !this.renderer.reRender) {
|
|
100
|
+
d = e._node;
|
|
101
|
+
let n = this.checkIsLayerTypeChange(d.layerIndex, a);
|
|
102
|
+
d.reset(), d.layerIndex = a, i ? d.isRoot = !0 : d.parent = t._node, this.cacheNode(e._node.uid, d), this.checkIsLayoutChangeRerenderExpandBtnPlaceholderRect(d);
|
|
103
|
+
let r = this.checkNodeFixChange(d, c, l), o = this.checkIsNeedResizeSources(), s = this.checkIsNodeDataChange(e._node.nodeDataSnapshot, e.data);
|
|
104
|
+
(o || s || n || d.getData("resetRichText") && !d.isUseCustomNodeContent() || d.getData("needUpdate") || r) && (d.getSize(), d.needLayout = !0), this.checkGetGeneralizationChange(d, o);
|
|
105
|
+
} else if ((this.lru.has(u) || this.renderer.lastNodeCache[u]) && !this.renderer.reRender) {
|
|
106
|
+
d = this.lru.get(u) || this.renderer.lastNodeCache[u];
|
|
107
|
+
let n = JSON.stringify(d.getData()), r = this.checkIsLayerTypeChange(d.layerIndex, a);
|
|
108
|
+
d.reset(), d.nodeData = d.handleData(e || {}), d.layerIndex = a, i ? d.isRoot = !0 : d.parent = t._node, this.cacheNode(u, d), this.checkIsLayoutChangeRerenderExpandBtnPlaceholderRect(d), e._node = d;
|
|
109
|
+
let o = this.checkIsNeedResizeSources(), s = this.checkIsNodeDataChange(n, e.data), f = this.checkNodeFixChange(d, c, l);
|
|
110
|
+
(o || s || r || d.getData("resetRichText") && !d.isUseCustomNodeContent() || d.getData("needUpdate") || f) && (d.getSize(), d.needLayout = !0), this.checkGetGeneralizationChange(d, o);
|
|
111
|
+
} else {
|
|
112
|
+
let o = u || n();
|
|
113
|
+
d = new r({
|
|
114
|
+
data: e,
|
|
115
|
+
uid: o,
|
|
116
|
+
renderer: this.renderer,
|
|
117
|
+
mindMap: this.mindMap,
|
|
118
|
+
draw: this.draw,
|
|
119
|
+
layerIndex: a,
|
|
120
|
+
isRoot: i,
|
|
121
|
+
parent: i ? null : t._node,
|
|
122
|
+
...c
|
|
123
|
+
}), e.data.uid = o, this.cacheNode(o, d), e._node = d;
|
|
124
|
+
}
|
|
125
|
+
return e.data.isActive && this.renderer.addNodeToActiveList(d), this.mindMap.renderer.findActiveNodeIndex(d) !== -1 && d.setData({ isActive: !0 }), i ? this.root = d : t._node.addChildren(d), d;
|
|
126
|
+
}
|
|
127
|
+
checkGetGeneralizationChange(e, t) {
|
|
128
|
+
let n = e.getData("generalization");
|
|
129
|
+
n && e._generalizationList && e._generalizationList.length > 0 && e._generalizationList.forEach((e, r) => {
|
|
130
|
+
let i = e.generalizationNode, a = i.getData(), o = n[r];
|
|
131
|
+
(t || o && JSON.stringify(a) !== JSON.stringify(o)) && (o && (i.nodeData.data = o), i.getSize(), i.needLayout = !0);
|
|
132
|
+
});
|
|
133
|
+
}
|
|
134
|
+
formatPosition(t, n, r) {
|
|
135
|
+
return typeof t == "number" ? t : e[t] === void 0 ? /^\d\d*%$/.test(t) ? Number.parseFloat(t) / 100 * n : (n - r) / 2 : n * e[t];
|
|
136
|
+
}
|
|
137
|
+
formatInitRootNodePosition(e) {
|
|
138
|
+
let { CENTER: n } = t.INIT_ROOT_NODE_POSITION;
|
|
139
|
+
return (!e || !Array.isArray(e) || e.length < 2) && (e = [n, n]), e;
|
|
140
|
+
}
|
|
141
|
+
setNodeCenter(e, t) {
|
|
142
|
+
let { initRootNodePosition: n } = this.mindMap.opt;
|
|
143
|
+
n = this.formatInitRootNodePosition(t || n), e.left = this.formatPosition(n[0], this.mindMap.width, e.width), e.top = this.formatPosition(n[1], this.mindMap.height, e.height);
|
|
144
|
+
}
|
|
145
|
+
getRootCenterOffset(e, n) {
|
|
146
|
+
if (this.rootNodeCenterOffset) return this.rootNodeCenterOffset;
|
|
147
|
+
let { initRootNodePosition: r } = this.mindMap.opt, { CENTER: i } = t.INIT_ROOT_NODE_POSITION;
|
|
148
|
+
if (r = this.formatInitRootNodePosition(r), r[0] === i && r[1] === i) this.rootNodeCenterOffset = {
|
|
149
|
+
x: 0,
|
|
150
|
+
y: 0
|
|
151
|
+
};
|
|
152
|
+
else {
|
|
153
|
+
let t = {
|
|
154
|
+
width: e,
|
|
155
|
+
height: n
|
|
156
|
+
}, r = {
|
|
157
|
+
width: e,
|
|
158
|
+
height: n
|
|
159
|
+
};
|
|
160
|
+
this.setNodeCenter(t, [i, i]), this.setNodeCenter(r), this.rootNodeCenterOffset = {
|
|
161
|
+
x: r.left - t.left,
|
|
162
|
+
y: r.top - t.top
|
|
163
|
+
};
|
|
164
|
+
}
|
|
165
|
+
return this.rootNodeCenterOffset;
|
|
166
|
+
}
|
|
167
|
+
updateChildren(e, t, n) {
|
|
168
|
+
e.forEach((e) => {
|
|
169
|
+
e[t] += n, e.children && e.children.length && !e.hasCustomPosition() && this.updateChildren(e.children, t, n);
|
|
170
|
+
});
|
|
171
|
+
}
|
|
172
|
+
updateChildrenPro(e, t) {
|
|
173
|
+
e.forEach((e) => {
|
|
174
|
+
Object.keys(t).forEach((n) => {
|
|
175
|
+
e[n] += t[n];
|
|
176
|
+
}), e.children && e.children.length && !e.hasCustomPosition() && this.updateChildrenPro(e.children, t);
|
|
177
|
+
});
|
|
178
|
+
}
|
|
179
|
+
getNodeAreaWidth(e, t = !1) {
|
|
180
|
+
let n = [], r = 0, i = (e, a) => {
|
|
181
|
+
t && e.checkHasGeneralization() && (r += e._generalizationNodeWidth), e.children.length ? (a += e.width / 2, e.children.forEach((e) => {
|
|
182
|
+
i(e, a);
|
|
183
|
+
})) : (a += e.width, n.push(a));
|
|
184
|
+
};
|
|
185
|
+
return i(e, 0), Math.max(...n) + r;
|
|
186
|
+
}
|
|
187
|
+
quadraticCurvePath(e, t, n, r, i = !1) {
|
|
188
|
+
let a, o;
|
|
189
|
+
return i ? (a = e + (n - e) * .8, o = t + (r - t) * .2) : (a = e + (n - e) * .2, o = t + (r - t) * .8), `M ${e},${t} Q ${a},${o} ${n},${r}`;
|
|
190
|
+
}
|
|
191
|
+
cubicBezierPath(e, t, n, r, i = !1) {
|
|
192
|
+
let a, o, s, c;
|
|
193
|
+
return i ? (a = e, o = t + (r - t) / 2, s = n, c = o) : (a = e + (n - e) / 2, o = t, s = a, c = r), `M ${e},${t} C ${a},${o} ${s},${c} ${n},${r}`;
|
|
194
|
+
}
|
|
195
|
+
computeNewPoint(e, t, n = 0) {
|
|
196
|
+
if (e[0] === t[0]) return t[1] > e[1] ? [t[0], t[1] - n] : [t[0], t[1] + n];
|
|
197
|
+
if (e[1] === t[1]) return t[0] > e[0] ? [t[0] - n, t[1]] : [t[0] + n, t[1]];
|
|
198
|
+
}
|
|
199
|
+
createFoldLine(e) {
|
|
200
|
+
let { lineRadius: t } = this.mindMap.themeConfig, n = e.length, r = "", i = "";
|
|
201
|
+
if (n >= 3 && t > 0) {
|
|
202
|
+
let r = e[n - 3], a = e[n - 2], o = e[n - 1];
|
|
203
|
+
if (!(r[0].toFixed(0) === a[0].toFixed(0) && a[0].toFixed(0) === o[0].toFixed(0) || r[1].toFixed(0) === a[1].toFixed(0) && a[1].toFixed(0) === o[1].toFixed(0))) {
|
|
204
|
+
let s = this.computeNewPoint(r, a, t), c = this.computeNewPoint(o, a, t);
|
|
205
|
+
i = `Q ${a[0]},${a[1]} ${c[0]},${c[1]}`, e.splice(n - 2, 1, s, i);
|
|
206
|
+
}
|
|
207
|
+
}
|
|
208
|
+
return e.forEach((e, t) => {
|
|
209
|
+
if (typeof e == "string") r += e;
|
|
210
|
+
else {
|
|
211
|
+
let [n, i] = e;
|
|
212
|
+
t === 0 ? r += `M ${n},${i}` : r += `L ${n},${i}`;
|
|
213
|
+
}
|
|
214
|
+
}), r;
|
|
215
|
+
}
|
|
216
|
+
getMarginX(e) {
|
|
217
|
+
let { themeConfig: t, opt: n } = this.mindMap, { second: r, node: i } = t, a = n.hoverRectPadding * 2;
|
|
218
|
+
return e === 1 ? r.marginX + a : i.marginX + a;
|
|
219
|
+
}
|
|
220
|
+
getMarginY(e) {
|
|
221
|
+
let { themeConfig: t, opt: n } = this.mindMap, { second: r, node: i } = t, a = n.hoverRectPadding * 2;
|
|
222
|
+
return e === 1 ? r.marginY + a : i.marginY + a;
|
|
223
|
+
}
|
|
224
|
+
getNodeWidthWithGeneralization(e) {
|
|
225
|
+
return Math.max(e.width, e.checkHasGeneralization() ? e._generalizationNodeWidth : 0);
|
|
226
|
+
}
|
|
227
|
+
getNodeHeightWithGeneralization(e) {
|
|
228
|
+
return Math.max(e.height, e.checkHasGeneralization() ? e._generalizationNodeHeight : 0);
|
|
229
|
+
}
|
|
230
|
+
getNodeBoundaries(e, t) {
|
|
231
|
+
let { generalizationLineMargin: n, generalizationNodeMargin: r } = this.mindMap.themeConfig, i = (e) => {
|
|
232
|
+
let n = Infinity, a = -Infinity, o = Infinity, s = -Infinity;
|
|
233
|
+
e.children && e.children.length > 0 && e.children.forEach((e) => {
|
|
234
|
+
let { left: c, right: l, top: u, bottom: d } = i(e), f = e.checkHasGeneralization() && e.getData("expand") ? e._generalizationNodeWidth + r : 0, p = e.checkHasGeneralization() && e.getData("expand") ? e._generalizationNodeHeight + r : 0;
|
|
235
|
+
c - (t === "h" ? f : 0) < n && (n = c - (t === "h" ? f : 0)), l + (t === "h" ? f : 0) > a && (a = l + (t === "h" ? f : 0)), u < o && (o = u), d + (t === "v" ? p : 0) > s && (s = d + (t === "v" ? p : 0));
|
|
236
|
+
});
|
|
237
|
+
let c = {
|
|
238
|
+
left: e.left,
|
|
239
|
+
right: e.left + e.width,
|
|
240
|
+
top: e.top,
|
|
241
|
+
bottom: e.top + e.height
|
|
242
|
+
};
|
|
243
|
+
return {
|
|
244
|
+
left: c.left < n ? c.left : n,
|
|
245
|
+
right: c.right > a ? c.right : a,
|
|
246
|
+
top: c.top < o ? c.top : o,
|
|
247
|
+
bottom: c.bottom > s ? c.bottom : s
|
|
248
|
+
};
|
|
249
|
+
}, { left: a, right: o, top: s, bottom: c } = i(e);
|
|
250
|
+
return {
|
|
251
|
+
left: a,
|
|
252
|
+
right: o,
|
|
253
|
+
top: s,
|
|
254
|
+
bottom: c,
|
|
255
|
+
generalizationLineMargin: n,
|
|
256
|
+
generalizationNodeMargin: r
|
|
257
|
+
};
|
|
258
|
+
}
|
|
259
|
+
getChildrenBoundaries(e, t, n = 0, r) {
|
|
260
|
+
let { generalizationLineMargin: i, generalizationNodeMargin: a } = this.mindMap.themeConfig, o = e.children.slice(n, r + 1), s = Infinity, c = -Infinity, l = Infinity, u = -Infinity;
|
|
261
|
+
return o.forEach((e) => {
|
|
262
|
+
let n = this.getNodeBoundaries(e, t);
|
|
263
|
+
s = n.left < s ? n.left : s, c = n.right > c ? n.right : c, l = n.top < l ? n.top : l, u = n.bottom > u ? n.bottom : u;
|
|
264
|
+
}), {
|
|
265
|
+
left: s,
|
|
266
|
+
right: c,
|
|
267
|
+
top: l,
|
|
268
|
+
bottom: u,
|
|
269
|
+
generalizationLineMargin: i,
|
|
270
|
+
generalizationNodeMargin: a
|
|
271
|
+
};
|
|
272
|
+
}
|
|
273
|
+
getNodeGeneralizationRenderBoundaries(e, t) {
|
|
274
|
+
let n = null;
|
|
275
|
+
return n = e.range ? this.getChildrenBoundaries(e.node, t, e.range[0], e.range[1]) : this.getNodeBoundaries(e.node, t), n;
|
|
276
|
+
}
|
|
277
|
+
getNodeActChildrenLength(e) {
|
|
278
|
+
return e.nodeData.children && e.nodeData.children.length;
|
|
279
|
+
}
|
|
280
|
+
setLineStyle(e, t, n, r) {
|
|
281
|
+
t.plot(this.transformPath(n)), e && e(t, r, !0);
|
|
282
|
+
}
|
|
283
|
+
transformPath(e) {
|
|
284
|
+
let { customTransformNodeLinePath: t } = this.mindMap.opt;
|
|
285
|
+
return t ? t(e) : e;
|
|
286
|
+
}
|
|
287
|
+
};
|
|
288
|
+
//#endregion
|
|
289
|
+
export { a as t };
|