mirror of
https://github.com/wanglin2/mind-map.git
synced 2026-02-17 14:04:47 +08:00
236 lines
7.2 KiB
JavaScript
236 lines
7.2 KiB
JavaScript
import Base from './Base';
|
||
import {
|
||
walk
|
||
} from '../utils'
|
||
import Node from '../Node'
|
||
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-12 22:25:58
|
||
* @Desc: 逻辑结构图
|
||
*/
|
||
class LogicalStructure extends Base {
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-12 22:26:31
|
||
* @Desc: 构造函数
|
||
*/
|
||
constructor(opt = {}) {
|
||
super(opt)
|
||
}
|
||
|
||
/**
|
||
* javascript comment
|
||
* @Author: 王林25
|
||
* @Date: 2021-04-06 14:04:20
|
||
* @Desc: 布局
|
||
*/
|
||
doLayout() {
|
||
// 计算节点的left、width、height
|
||
this.computedBaseValue()
|
||
// 计算节点的top
|
||
this.computedTopValue()
|
||
// 调整节点top
|
||
this.adjustTopValue()
|
||
|
||
return this.root;
|
||
}
|
||
|
||
/**
|
||
* javascript comment
|
||
* @Author: 王林25
|
||
* @Date: 2021-04-08 09:49:32
|
||
* @Desc: 计算节点的left、width、height
|
||
*/
|
||
computedBaseValue() {
|
||
walk(this.renderTree, null, (node, parent, isRoot, layerIndex) => {
|
||
// 遍历子节点前设置left、width、height
|
||
// 创建节点
|
||
let newNode = new Node({
|
||
uid: this.mindMap.uid++,
|
||
data: node,
|
||
renderer: this.renderer,
|
||
mindMap: this.mindMap,
|
||
draw: this.draw,
|
||
layerIndex
|
||
})
|
||
// 计算节点的宽高
|
||
newNode.refreshSize()
|
||
if (isRoot) {
|
||
newNode.isRoot = true
|
||
newNode.left = (this.mindMap.width - newNode.width) / 2
|
||
newNode.top = (this.mindMap.height - newNode.height) / 2
|
||
this.root = newNode
|
||
} else {
|
||
let marginX = layerIndex === 1 ? this.themeConfig.secondLevel.marginX : this.themeConfig.node.marginX
|
||
newNode.left = parent._node.left + parent._node.width + marginX,
|
||
newNode.parent = parent._node
|
||
parent._node.addChildren(newNode)
|
||
}
|
||
node._node = newNode
|
||
}, (node, parent, isRoot, layerIndex) => {
|
||
// 返回时计算节点的areaHeight，也就是子节点所占的高度之和，包括外边距
|
||
let len = node.expand === false ? 0 : node._node.children.length
|
||
node._node.childrenAreaHeight = len ? node._node.children.reduce((h, cur) => {
|
||
return h + cur.height
|
||
}, 0) + (len + 1) * this.getMarginY(layerIndex) : 0
|
||
}, true, 0)
|
||
}
|
||
|
||
/**
|
||
* javascript comment
|
||
* @Author: 王林25
|
||
* @Date: 2021-04-08 09:59:25
|
||
* @Desc: 计算节点的top
|
||
*/
|
||
computedTopValue() {
|
||
walk(this.root, null, (node, parent, isRoot, layerIndex) => {
|
||
if (node.children && node.children.length) {
|
||
let marginY = this.getMarginY(layerIndex)
|
||
// 第一个子节点的top值 = 该节点中心的top值 - 子节点的高度之和的一半
|
||
let top = node.top + node.height / 2 - node.childrenAreaHeight / 2
|
||
let totalTop = top + marginY
|
||
node.children.forEach((cur) => {
|
||
cur.top = totalTop
|
||
totalTop += cur.height + marginY
|
||
})
|
||
}
|
||
}, null, true)
|
||
}
|
||
|
||
/**
|
||
* javascript comment
|
||
* @Author: 王林25
|
||
* @Date: 2021-04-08 10:04:05
|
||
* @Desc: 调整节点top
|
||
*/
|
||
adjustTopValue() {
|
||
walk(this.root, null, (node, parent, isRoot, layerIndex) => {
|
||
// 判断子节点所占的高度之和是否大于该节点自身，大于则需要调整位置
|
||
let difference = node.childrenAreaHeight - this.getMarginY(layerIndex) - node.height
|
||
if (difference > 0) {
|
||
this.updateBrothers(node, difference / 2)
|
||
}
|
||
}, null, true)
|
||
}
|
||
|
||
/**
|
||
* javascript comment
|
||
* @Author: 王林25
|
||
* @Date: 2021-04-07 14:26:03
|
||
* @Desc: 更新兄弟节点的top
|
||
*/
|
||
updateBrothers(node, addHeight) {
|
||
if (node.parent) {
|
||
let childrenList = node.parent.children
|
||
let index = childrenList.findIndex((item) => {
|
||
return item === node
|
||
})
|
||
childrenList.forEach((item, _index) => {
|
||
let _offset = 0
|
||
// 上面的节点往上移
|
||
if (_index < index) {
|
||
_offset = -addHeight
|
||
} else if (_index > index) {// 下面的节点往下移
|
||
_offset = addHeight
|
||
}
|
||
item.top += _offset
|
||
// 同步更新子节点的位置
|
||
if (item.children && item.children.length) {
|
||
this.updateChildren(item.children, 'top', _offset)
|
||
}
|
||
})
|
||
// 更新父节点的位置
|
||
this.updateBrothers(node.parent, addHeight)
|
||
}
|
||
}
|
||
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-11 15:34:20
|
||
* @Desc: 获取节点的marginY
|
||
*/
|
||
getMarginY(layerIndex) {
|
||
return layerIndex === 1 ? this.themeConfig.secondLevel.marginY : this.themeConfig.node.marginY;
|
||
}
|
||
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-11 15:05:01
|
||
* @Desc: 二次贝塞尔曲线
|
||
*/
|
||
quadraticCurvePath(x1, y1, x2, y2) {
|
||
let cx = x1 + (x2 - x1) * 0.2
|
||
let cy = y1 + (y2 - y1) * 0.8
|
||
return `M ${x1},${y1} Q ${cx},${cy} ${x2},${y2}`
|
||
}
|
||
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-11 15:05:18
|
||
* @Desc: 三次贝塞尔曲线
|
||
*/
|
||
cubicBezierPath(x1, y1, x2, y2) {
|
||
let cx1 = x1 + (x2 - x1) / 2
|
||
let cy1 = y1
|
||
let cx2 = x2 - (x2 - x1) / 2
|
||
let cy2 = y2
|
||
return `M ${x1},${y1} C ${cx1},${cy1} ${cx2},${cy2} ${x2},${y2}`
|
||
}
|
||
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-11 14:42:48
|
||
* @Desc: 绘制连线，连接该节点到其子节点
|
||
*/
|
||
drawLine(node) {
|
||
if (node.children.length <= 0) {
|
||
return [];
|
||
}
|
||
let {
|
||
left,
|
||
top,
|
||
width,
|
||
height
|
||
} = node
|
||
let lines = []
|
||
if (!node.isRoot) {
|
||
let line = this.draw.line(left + width, top + height / 2, left + width + 20, top + height / 2)
|
||
lines.push(line)
|
||
}
|
||
node.children.forEach((item) => {
|
||
let x1 = node.layerIndex === 0 ? left + width / 2 : left + width + 20
|
||
let y1 = node.layerIndex === 0 ? top + height / 2 : top + height / 2
|
||
let x2 = item.left
|
||
let y2 = item.top + item.height / 2
|
||
let path = ''
|
||
if (node.isRoot) {
|
||
path = this.quadraticCurvePath(x1, y1, x2, y2)
|
||
} else {
|
||
path = this.cubicBezierPath(x1, y1, x2, y2)
|
||
}
|
||
let line = this.draw.path(path)
|
||
lines.push(line)
|
||
})
|
||
return lines;
|
||
}
|
||
|
||
/**
|
||
* @Author: 王林
|
||
* @Date: 2021-04-11 19:54:26
|
||
* @Desc: 渲染按钮
|
||
*/
|
||
drawIcon(node, icons) {
|
||
let {
|
||
left,
|
||
top,
|
||
width,
|
||
height
|
||
} = node
|
||
icons.forEach((icon) => {
|
||
icon.x(left + width).y(top + height / 2)
|
||
})
|
||
}
|
||
}
|
||
|
||
export default LogicalStructure |