@v-c/tree 1.0.0 → 1.0.2
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/dist/Tree.js +38 -12
- package/dist/index.d.ts +1 -1
- package/dist/index.js +2 -2
- package/dist/utils/treeUtil.d.ts +3 -1
- package/dist/utils/treeUtil.js +3 -2
- package/package.json +3 -3
- package/dist/DropIndicator.cjs +0 -54
- package/dist/Indent.cjs +0 -52
- package/dist/MotionTreeNode.cjs +0 -330
- package/dist/NodeList.cjs +0 -352
- package/dist/Tree.cjs +0 -1109
- package/dist/TreeNode.cjs +0 -463
- package/dist/_virtual/rolldown_runtime.cjs +0 -21
- package/dist/contextTypes.cjs +0 -5
- package/dist/index.cjs +0 -22
- package/dist/inter.cjs +0 -3
- package/dist/interface.cjs +0 -1
- package/dist/util.cjs +0 -159
- package/dist/utils/conductUtil.cjs +0 -110
- package/dist/utils/diffUtil.cjs +0 -36
- package/dist/utils/keyUtil.cjs +0 -8
- package/dist/utils/treeUtil.cjs +0 -235
|
@@ -1,110 +0,0 @@
|
|
|
1
|
-
Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
|
|
2
|
-
const require_rolldown_runtime = require("../_virtual/rolldown_runtime.cjs");
|
|
3
|
-
const require_keyUtil = require("./keyUtil.cjs");
|
|
4
|
-
let _v_c_util_dist_warning = require("@v-c/util/dist/warning");
|
|
5
|
-
_v_c_util_dist_warning = require_rolldown_runtime.__toESM(_v_c_util_dist_warning);
|
|
6
|
-
function removeFromCheckedKeys(halfCheckedKeys, checkedKeys) {
|
|
7
|
-
const filteredKeys = /* @__PURE__ */ new Set();
|
|
8
|
-
halfCheckedKeys.forEach((key) => {
|
|
9
|
-
if (!checkedKeys.has(key)) filteredKeys.add(key);
|
|
10
|
-
});
|
|
11
|
-
return filteredKeys;
|
|
12
|
-
}
|
|
13
|
-
function isCheckDisabled(node) {
|
|
14
|
-
const { disabled, disableCheckbox, checkable } = node || {};
|
|
15
|
-
return !!(disabled || disableCheckbox) || checkable === false;
|
|
16
|
-
}
|
|
17
|
-
function fillConductCheck(keys, levelEntities, maxLevel, syntheticGetCheckDisabled) {
|
|
18
|
-
const checkedKeys = new Set(keys);
|
|
19
|
-
const halfCheckedKeys = /* @__PURE__ */ new Set();
|
|
20
|
-
for (let level = 0; level <= maxLevel; level += 1) (levelEntities.get(level) || /* @__PURE__ */ new Set()).forEach((entity) => {
|
|
21
|
-
const { key, node, children = [] } = entity;
|
|
22
|
-
if (checkedKeys.has(key) && !syntheticGetCheckDisabled(node)) children.filter((childEntity) => !syntheticGetCheckDisabled(childEntity.node)).forEach((childEntity) => {
|
|
23
|
-
checkedKeys.add(childEntity.key);
|
|
24
|
-
});
|
|
25
|
-
});
|
|
26
|
-
const visitedKeys = /* @__PURE__ */ new Set();
|
|
27
|
-
for (let level = maxLevel; level >= 0; level -= 1) (levelEntities.get(level) || /* @__PURE__ */ new Set()).forEach((entity) => {
|
|
28
|
-
const { parent, node } = entity;
|
|
29
|
-
if (syntheticGetCheckDisabled(node) || !entity.parent || visitedKeys.has(entity.parent.key)) return;
|
|
30
|
-
if (syntheticGetCheckDisabled(entity.parent.node)) {
|
|
31
|
-
visitedKeys.add(parent.key);
|
|
32
|
-
return;
|
|
33
|
-
}
|
|
34
|
-
let allChecked = true;
|
|
35
|
-
let partialChecked = false;
|
|
36
|
-
(parent.children || []).filter((childEntity) => !syntheticGetCheckDisabled(childEntity.node)).forEach(({ key }) => {
|
|
37
|
-
const checked = checkedKeys.has(key);
|
|
38
|
-
if (allChecked && !checked) allChecked = false;
|
|
39
|
-
if (!partialChecked && (checked || halfCheckedKeys.has(key))) partialChecked = true;
|
|
40
|
-
});
|
|
41
|
-
if (allChecked) checkedKeys.add(parent.key);
|
|
42
|
-
if (partialChecked) halfCheckedKeys.add(parent.key);
|
|
43
|
-
visitedKeys.add(parent.key);
|
|
44
|
-
});
|
|
45
|
-
return {
|
|
46
|
-
checkedKeys: Array.from(checkedKeys),
|
|
47
|
-
halfCheckedKeys: Array.from(removeFromCheckedKeys(halfCheckedKeys, checkedKeys))
|
|
48
|
-
};
|
|
49
|
-
}
|
|
50
|
-
function cleanConductCheck(keys, halfKeys, levelEntities, maxLevel, syntheticGetCheckDisabled) {
|
|
51
|
-
const checkedKeys = new Set(keys);
|
|
52
|
-
let halfCheckedKeys = new Set(halfKeys);
|
|
53
|
-
for (let level = 0; level <= maxLevel; level += 1) (levelEntities.get(level) || /* @__PURE__ */ new Set()).forEach((entity) => {
|
|
54
|
-
const { key, node, children = [] } = entity;
|
|
55
|
-
if (!checkedKeys.has(key) && !halfCheckedKeys.has(key) && !syntheticGetCheckDisabled(node)) children.filter((childEntity) => !syntheticGetCheckDisabled(childEntity.node)).forEach((childEntity) => {
|
|
56
|
-
checkedKeys.delete(childEntity.key);
|
|
57
|
-
});
|
|
58
|
-
});
|
|
59
|
-
halfCheckedKeys = /* @__PURE__ */ new Set();
|
|
60
|
-
const visitedKeys = /* @__PURE__ */ new Set();
|
|
61
|
-
for (let level = maxLevel; level >= 0; level -= 1) (levelEntities.get(level) || /* @__PURE__ */ new Set()).forEach((entity) => {
|
|
62
|
-
const { parent, node } = entity;
|
|
63
|
-
if (syntheticGetCheckDisabled(node) || !entity.parent || visitedKeys.has(entity.parent.key)) return;
|
|
64
|
-
if (syntheticGetCheckDisabled(entity.parent.node)) {
|
|
65
|
-
visitedKeys.add(parent.key);
|
|
66
|
-
return;
|
|
67
|
-
}
|
|
68
|
-
let allChecked = true;
|
|
69
|
-
let partialChecked = false;
|
|
70
|
-
(parent.children || []).filter((childEntity) => !syntheticGetCheckDisabled(childEntity.node)).forEach(({ key }) => {
|
|
71
|
-
const checked = checkedKeys.has(key);
|
|
72
|
-
if (allChecked && !checked) allChecked = false;
|
|
73
|
-
if (!partialChecked && (checked || halfCheckedKeys.has(key))) partialChecked = true;
|
|
74
|
-
});
|
|
75
|
-
if (!allChecked) checkedKeys.delete(parent.key);
|
|
76
|
-
if (partialChecked) halfCheckedKeys.add(parent.key);
|
|
77
|
-
visitedKeys.add(parent.key);
|
|
78
|
-
});
|
|
79
|
-
return {
|
|
80
|
-
checkedKeys: Array.from(checkedKeys),
|
|
81
|
-
halfCheckedKeys: Array.from(removeFromCheckedKeys(halfCheckedKeys, checkedKeys))
|
|
82
|
-
};
|
|
83
|
-
}
|
|
84
|
-
function conductCheck(keyList, checked, keyEntities, getCheckDisabled) {
|
|
85
|
-
const warningMissKeys = [];
|
|
86
|
-
const syntheticGetCheckDisabled = getCheckDisabled || isCheckDisabled;
|
|
87
|
-
const keys = new Set((keyList || []).filter((key) => {
|
|
88
|
-
const hasEntity = !!require_keyUtil.default(keyEntities, key);
|
|
89
|
-
if (!hasEntity) warningMissKeys.push(key);
|
|
90
|
-
return hasEntity;
|
|
91
|
-
}));
|
|
92
|
-
const levelEntities = /* @__PURE__ */ new Map();
|
|
93
|
-
let maxLevel = 0;
|
|
94
|
-
Object.keys(keyEntities).forEach((entityKey) => {
|
|
95
|
-
const entity = keyEntities[entityKey];
|
|
96
|
-
const { level } = entity;
|
|
97
|
-
let levelSet = levelEntities.get(level);
|
|
98
|
-
if (!levelSet) {
|
|
99
|
-
levelSet = /* @__PURE__ */ new Set();
|
|
100
|
-
levelEntities.set(level, levelSet);
|
|
101
|
-
}
|
|
102
|
-
levelSet.add(entity);
|
|
103
|
-
maxLevel = Math.max(maxLevel, level);
|
|
104
|
-
});
|
|
105
|
-
(0, _v_c_util_dist_warning.default)(!warningMissKeys.length, `Tree missing follow keys: ${warningMissKeys.slice(0, 100).map((key) => `'${key}'`).join(", ")}`);
|
|
106
|
-
if (checked === true) return fillConductCheck(keys, levelEntities, maxLevel, syntheticGetCheckDisabled);
|
|
107
|
-
return cleanConductCheck(keys, checked.halfCheckedKeys, levelEntities, maxLevel, syntheticGetCheckDisabled);
|
|
108
|
-
}
|
|
109
|
-
exports.conductCheck = conductCheck;
|
|
110
|
-
exports.isCheckDisabled = isCheckDisabled;
|
package/dist/utils/diffUtil.cjs
DELETED
|
@@ -1,36 +0,0 @@
|
|
|
1
|
-
Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
|
|
2
|
-
function findExpandedKeys(prev = [], next = []) {
|
|
3
|
-
const prevLen = prev.length;
|
|
4
|
-
const nextLen = next.length;
|
|
5
|
-
if (Math.abs(prevLen - nextLen) !== 1) return {
|
|
6
|
-
add: false,
|
|
7
|
-
key: null
|
|
8
|
-
};
|
|
9
|
-
function find(shorter, longer) {
|
|
10
|
-
const cache = /* @__PURE__ */ new Map();
|
|
11
|
-
shorter.forEach((key) => {
|
|
12
|
-
cache.set(key, true);
|
|
13
|
-
});
|
|
14
|
-
const keys = longer.filter((key) => !cache.has(key));
|
|
15
|
-
return keys.length === 1 ? keys[0] : null;
|
|
16
|
-
}
|
|
17
|
-
if (prevLen < nextLen) return {
|
|
18
|
-
add: true,
|
|
19
|
-
key: find(prev, next)
|
|
20
|
-
};
|
|
21
|
-
return {
|
|
22
|
-
add: false,
|
|
23
|
-
key: find(next, prev)
|
|
24
|
-
};
|
|
25
|
-
}
|
|
26
|
-
function getExpandRange(shorter, longer, key) {
|
|
27
|
-
const shorterEndNode = shorter[shorter.findIndex((data) => data.key === key) + 1];
|
|
28
|
-
const longerStartIndex = longer.findIndex((data) => data.key === key);
|
|
29
|
-
if (shorterEndNode) {
|
|
30
|
-
const longerEndIndex = longer.findIndex((data) => data.key === shorterEndNode.key);
|
|
31
|
-
return longer.slice(longerStartIndex + 1, longerEndIndex);
|
|
32
|
-
}
|
|
33
|
-
return longer.slice(longerStartIndex + 1);
|
|
34
|
-
}
|
|
35
|
-
exports.findExpandedKeys = findExpandedKeys;
|
|
36
|
-
exports.getExpandRange = getExpandRange;
|
package/dist/utils/keyUtil.cjs
DELETED
package/dist/utils/treeUtil.cjs
DELETED
|
@@ -1,235 +0,0 @@
|
|
|
1
|
-
Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
|
|
2
|
-
const require_rolldown_runtime = require("../_virtual/rolldown_runtime.cjs");
|
|
3
|
-
const require_keyUtil = require("./keyUtil.cjs");
|
|
4
|
-
let _v_c_util_dist_Children_toArray = require("@v-c/util/dist/Children/toArray");
|
|
5
|
-
let _v_c_util_dist_utils_omit = require("@v-c/util/dist/utils/omit");
|
|
6
|
-
let _v_c_util_dist_warning = require("@v-c/util/dist/warning");
|
|
7
|
-
_v_c_util_dist_warning = require_rolldown_runtime.__toESM(_v_c_util_dist_warning);
|
|
8
|
-
function getPosition(level, index) {
|
|
9
|
-
return `${level}-${index}`;
|
|
10
|
-
}
|
|
11
|
-
function isTreeNode(node) {
|
|
12
|
-
return !!(node && node.type && node.type.isTreeNode);
|
|
13
|
-
}
|
|
14
|
-
function getKey(key, pos) {
|
|
15
|
-
if (key !== null && key !== void 0) return key;
|
|
16
|
-
return pos;
|
|
17
|
-
}
|
|
18
|
-
function fillFieldNames(fieldNames) {
|
|
19
|
-
const { title, _title, key, children } = fieldNames || {};
|
|
20
|
-
const mergedTitle = title || "title";
|
|
21
|
-
return {
|
|
22
|
-
title: mergedTitle,
|
|
23
|
-
_title: _title || [mergedTitle],
|
|
24
|
-
key: key || "key",
|
|
25
|
-
children: children || "children"
|
|
26
|
-
};
|
|
27
|
-
}
|
|
28
|
-
function warningWithoutKey(treeData, fieldNames) {
|
|
29
|
-
const keys = /* @__PURE__ */ new Map();
|
|
30
|
-
const mergedFieldNames = fillFieldNames(fieldNames);
|
|
31
|
-
function dig(list, path = "") {
|
|
32
|
-
(list || []).forEach((treeNode) => {
|
|
33
|
-
const key = treeNode[mergedFieldNames.key];
|
|
34
|
-
const children = treeNode[mergedFieldNames.children];
|
|
35
|
-
(0, _v_c_util_dist_warning.default)(key !== null && key !== void 0, `Tree node must have a certain key: [${path}${key}]`);
|
|
36
|
-
const recordKey = String(key);
|
|
37
|
-
(0, _v_c_util_dist_warning.default)(!keys.has(recordKey) || key === null || key === void 0, `Same 'key' exist in the Tree: ${recordKey}`);
|
|
38
|
-
keys.set(recordKey, true);
|
|
39
|
-
dig(children, `${path}${recordKey} > `);
|
|
40
|
-
});
|
|
41
|
-
}
|
|
42
|
-
dig(treeData);
|
|
43
|
-
}
|
|
44
|
-
function convertTreeToData(rootNodes) {
|
|
45
|
-
function dig(node) {
|
|
46
|
-
return (0, _v_c_util_dist_Children_toArray.toArray)(node).map((treeNode) => {
|
|
47
|
-
if (!isTreeNode(treeNode)) {
|
|
48
|
-
(0, _v_c_util_dist_warning.default)(!treeNode, "Tree/TreeNode can only accept TreeNode as children.");
|
|
49
|
-
return null;
|
|
50
|
-
}
|
|
51
|
-
const dataNode = {
|
|
52
|
-
key: treeNode.key,
|
|
53
|
-
...treeNode.props || {}
|
|
54
|
-
};
|
|
55
|
-
let childrenNodes = [];
|
|
56
|
-
if (treeNode.children) {
|
|
57
|
-
const children = treeNode.children;
|
|
58
|
-
if (typeof children === "object" && children.default) childrenNodes = children.default();
|
|
59
|
-
else childrenNodes = children;
|
|
60
|
-
}
|
|
61
|
-
const parsedChildren = dig(childrenNodes);
|
|
62
|
-
if (parsedChildren.length) dataNode.children = parsedChildren;
|
|
63
|
-
return dataNode;
|
|
64
|
-
}).filter((dataNode) => !!dataNode);
|
|
65
|
-
}
|
|
66
|
-
return dig(rootNodes);
|
|
67
|
-
}
|
|
68
|
-
function flattenTreeData(treeNodeList, expandedKeys, fieldNames) {
|
|
69
|
-
const { _title: fieldTitles, key: fieldKey, children: fieldChildren } = fillFieldNames(fieldNames);
|
|
70
|
-
const expandedKeySet = new Set(expandedKeys === true ? [] : expandedKeys);
|
|
71
|
-
const flattenList = [];
|
|
72
|
-
function dig(list, parent = null) {
|
|
73
|
-
return (list || []).map((treeNode, index) => {
|
|
74
|
-
const pos = getPosition(parent ? parent.pos : "0", index);
|
|
75
|
-
const mergedKey = getKey(treeNode[fieldKey], pos);
|
|
76
|
-
let mergedTitle;
|
|
77
|
-
for (let i = 0; i < fieldTitles.length; i += 1) {
|
|
78
|
-
const fieldTitle = fieldTitles[i];
|
|
79
|
-
if (treeNode[fieldTitle] !== void 0) {
|
|
80
|
-
mergedTitle = treeNode[fieldTitle];
|
|
81
|
-
break;
|
|
82
|
-
}
|
|
83
|
-
}
|
|
84
|
-
const flattenNode = Object.assign((0, _v_c_util_dist_utils_omit.omit)(treeNode, [
|
|
85
|
-
...fieldTitles,
|
|
86
|
-
fieldKey,
|
|
87
|
-
fieldChildren
|
|
88
|
-
]), {
|
|
89
|
-
title: mergedTitle,
|
|
90
|
-
key: mergedKey,
|
|
91
|
-
parent,
|
|
92
|
-
pos,
|
|
93
|
-
children: [],
|
|
94
|
-
data: treeNode,
|
|
95
|
-
isStart: [...parent ? parent.isStart : [], index === 0],
|
|
96
|
-
isEnd: [...parent ? parent.isEnd : [], index === list.length - 1]
|
|
97
|
-
});
|
|
98
|
-
flattenList.push(flattenNode);
|
|
99
|
-
if (expandedKeys === true || expandedKeySet.has(mergedKey)) flattenNode.children = dig(treeNode[fieldChildren] || [], flattenNode);
|
|
100
|
-
else flattenNode.children = [];
|
|
101
|
-
return flattenNode;
|
|
102
|
-
});
|
|
103
|
-
}
|
|
104
|
-
dig(treeNodeList || []);
|
|
105
|
-
return flattenList;
|
|
106
|
-
}
|
|
107
|
-
function traverseDataNodes(dataNodes, callback, config) {
|
|
108
|
-
let mergedConfig = {};
|
|
109
|
-
if (typeof config === "object") mergedConfig = config;
|
|
110
|
-
else mergedConfig = { externalGetKey: config };
|
|
111
|
-
mergedConfig = mergedConfig || {};
|
|
112
|
-
const { childrenPropName, externalGetKey, fieldNames } = mergedConfig;
|
|
113
|
-
const { key: fieldKey, children: fieldChildren } = fillFieldNames(fieldNames);
|
|
114
|
-
const mergeChildrenPropName = childrenPropName || fieldChildren;
|
|
115
|
-
let syntheticGetKey;
|
|
116
|
-
if (externalGetKey) if (typeof externalGetKey === "string") syntheticGetKey = (node) => node[externalGetKey];
|
|
117
|
-
else syntheticGetKey = (node) => externalGetKey(node);
|
|
118
|
-
else syntheticGetKey = (node, pos) => getKey(node[fieldKey], pos);
|
|
119
|
-
function processNode(node, index, parent, pathNodes) {
|
|
120
|
-
const children = node ? node[mergeChildrenPropName] : dataNodes;
|
|
121
|
-
const pos = node ? getPosition(parent.pos, index) : "0";
|
|
122
|
-
const connectNodes = node ? [...pathNodes || [], node] : [];
|
|
123
|
-
if (node) callback({
|
|
124
|
-
node,
|
|
125
|
-
index,
|
|
126
|
-
pos,
|
|
127
|
-
key: syntheticGetKey(node, pos),
|
|
128
|
-
parentPos: parent.node ? parent.pos : null,
|
|
129
|
-
level: parent.level + 1,
|
|
130
|
-
nodes: connectNodes
|
|
131
|
-
});
|
|
132
|
-
if (children) children.forEach((subNode, subIndex) => {
|
|
133
|
-
processNode(subNode, subIndex, {
|
|
134
|
-
node,
|
|
135
|
-
pos,
|
|
136
|
-
level: parent ? parent.level + 1 : -1
|
|
137
|
-
}, connectNodes);
|
|
138
|
-
});
|
|
139
|
-
}
|
|
140
|
-
processNode(null);
|
|
141
|
-
}
|
|
142
|
-
function convertDataToEntities(dataNodes, { initWrapper, processEntity, onProcessFinished, externalGetKey, childrenPropName, fieldNames } = {}) {
|
|
143
|
-
const posEntities = {};
|
|
144
|
-
const keyEntities = {};
|
|
145
|
-
let wrapper = {
|
|
146
|
-
posEntities,
|
|
147
|
-
keyEntities
|
|
148
|
-
};
|
|
149
|
-
if (initWrapper) wrapper = initWrapper(wrapper) || wrapper;
|
|
150
|
-
traverseDataNodes(dataNodes, (item) => {
|
|
151
|
-
const { node, index, pos, key, parentPos, level, nodes } = item;
|
|
152
|
-
const entity = {
|
|
153
|
-
node,
|
|
154
|
-
nodes,
|
|
155
|
-
index,
|
|
156
|
-
key,
|
|
157
|
-
pos,
|
|
158
|
-
level
|
|
159
|
-
};
|
|
160
|
-
const mergedKey = getKey(key, pos);
|
|
161
|
-
posEntities[pos] = entity;
|
|
162
|
-
keyEntities[String(mergedKey)] = entity;
|
|
163
|
-
entity.parent = posEntities[String(parentPos)];
|
|
164
|
-
if (entity.parent) {
|
|
165
|
-
entity.parent.children = entity.parent.children || [];
|
|
166
|
-
entity.parent.children.push(entity);
|
|
167
|
-
}
|
|
168
|
-
processEntity?.(entity, wrapper);
|
|
169
|
-
}, {
|
|
170
|
-
externalGetKey,
|
|
171
|
-
childrenPropName,
|
|
172
|
-
fieldNames
|
|
173
|
-
});
|
|
174
|
-
onProcessFinished?.(wrapper);
|
|
175
|
-
return wrapper;
|
|
176
|
-
}
|
|
177
|
-
function getTreeNodeProps(key, { expandedKeys, selectedKeys, loadedKeys, loadingKeys, checkedKeys, halfCheckedKeys, dragOverNodeKey, dropPosition, keyEntities }) {
|
|
178
|
-
const entity = require_keyUtil.default(keyEntities, key);
|
|
179
|
-
return {
|
|
180
|
-
eventKey: key,
|
|
181
|
-
expanded: expandedKeys.includes(key),
|
|
182
|
-
selected: selectedKeys.includes(key),
|
|
183
|
-
loaded: loadedKeys.includes(key),
|
|
184
|
-
loading: loadingKeys.includes(key),
|
|
185
|
-
checked: checkedKeys.includes(key),
|
|
186
|
-
halfChecked: halfCheckedKeys.includes(key),
|
|
187
|
-
pos: String(entity ? entity.pos : ""),
|
|
188
|
-
dragOver: dragOverNodeKey === key && dropPosition === 0,
|
|
189
|
-
dragOverGapTop: dragOverNodeKey === key && dropPosition === -1,
|
|
190
|
-
dragOverGapBottom: dragOverNodeKey === key && dropPosition === 1
|
|
191
|
-
};
|
|
192
|
-
}
|
|
193
|
-
function convertNodePropsToEventData(props) {
|
|
194
|
-
const { data, expanded, selected, checked, loaded, loading, halfChecked, dragOver, dragOverGapTop, dragOverGapBottom, pos, active, eventKey } = props;
|
|
195
|
-
const eventData = {
|
|
196
|
-
...data,
|
|
197
|
-
expanded,
|
|
198
|
-
selected,
|
|
199
|
-
checked,
|
|
200
|
-
loaded,
|
|
201
|
-
loading,
|
|
202
|
-
halfChecked,
|
|
203
|
-
dragOver,
|
|
204
|
-
dragOverGapTop,
|
|
205
|
-
dragOverGapBottom,
|
|
206
|
-
pos,
|
|
207
|
-
active,
|
|
208
|
-
key: eventKey
|
|
209
|
-
};
|
|
210
|
-
if (!("props" in eventData)) Object.defineProperty(eventData, "props", { get() {
|
|
211
|
-
(0, _v_c_util_dist_warning.default)(false, "Second param return from event is node data instead of TreeNode instance. Please read value directly instead of reading from `props`.");
|
|
212
|
-
return props;
|
|
213
|
-
} });
|
|
214
|
-
return eventData;
|
|
215
|
-
}
|
|
216
|
-
function isLeafNode(isLeaf, loadData, hasChildren, loaded) {
|
|
217
|
-
if (isLeaf === false) return false;
|
|
218
|
-
return !!isLeaf || !loadData && !hasChildren || !!(loadData && loaded && !hasChildren);
|
|
219
|
-
}
|
|
220
|
-
function getTreeNodeId(treeId, key) {
|
|
221
|
-
return `${treeId}-${key}`;
|
|
222
|
-
}
|
|
223
|
-
exports.convertDataToEntities = convertDataToEntities;
|
|
224
|
-
exports.convertNodePropsToEventData = convertNodePropsToEventData;
|
|
225
|
-
exports.convertTreeToData = convertTreeToData;
|
|
226
|
-
exports.fillFieldNames = fillFieldNames;
|
|
227
|
-
exports.flattenTreeData = flattenTreeData;
|
|
228
|
-
exports.getKey = getKey;
|
|
229
|
-
exports.getPosition = getPosition;
|
|
230
|
-
exports.getTreeNodeId = getTreeNodeId;
|
|
231
|
-
exports.getTreeNodeProps = getTreeNodeProps;
|
|
232
|
-
exports.isLeafNode = isLeafNode;
|
|
233
|
-
exports.isTreeNode = isTreeNode;
|
|
234
|
-
exports.traverseDataNodes = traverseDataNodes;
|
|
235
|
-
exports.warningWithoutKey = warningWithoutKey;
|