innov
/
bee-tree
1
0
Fork 0
Code Issues Pull Requests 2 Projects Releases Wiki Activity

fix:滚动时，层级计算错误

This commit is contained in:
yangchch6 2019-08-26 21:13:42 +08:00
parent b0ff0ad518
commit 8524f03c82
8 changed files with 211 additions and 197 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
build/Tree.js
View File

@ -146,19 +146,6 @@ var Tree = function (_React$Component) {
this.setState(st);
};
// componentWillUpdate(nextProps, nextState){
// const { expandedKeys,treeData } = this.state;
// if(nextState.expandedKeys !== expandedKeys) {
// this.cacheExpandedKeys = expandedKeys;
// if(this.props.lazyLoad){
// let flatTreeData = this.deepTraversal(treeData);
// this.setState({
// flatTreeData
// })
// }
// }
// }
Tree.prototype.onDragStart = function onDragStart(e, treeNode) {
this.dragNode = treeNode;
this.dragNodesKeys = this.getDragNodes(treeNode);
@ -1117,7 +1104,7 @@ var _initialiseProps = function _initialiseProps() {
var expandedKeys = _this7.state.expandedKeys,
flatTreeData = [],
flatTreeKeysMap = _this7.flatTreeKeysMap,
dataCopy = JSON.parse(JSON.stringify(treeData));
dataCopy = treeData;
if (Array.isArray(dataCopy)) {
for (var i = 0, l = dataCopy.length; i < l; i++) {
@ -1127,25 +1114,27 @@ var _initialiseProps = function _initialiseProps() {
children = _dataCopy$i.children,
props = _objectWithoutProperties(_dataCopy$i, ['key', 'title', 'children']);
var dataCopyI = new Object();
var isLeaf = children ? false : true,
isExpanded = _this7.cacheExpandedKeys ? _this7.cacheExpandedKeys.indexOf(key) !== -1 : expandedKeys.indexOf(key) !== -1;
dataCopy[i].isExpanded = isExpanded;
dataCopy[i].parentKey = parentKey || null;
dataCopy[i].isShown = isShown;
dataCopy[i].isLeaf = isLeaf;
dataCopyI = _extends(dataCopyI, {
key: key,
title: title,
isExpanded: isExpanded,
parentKey: parentKey || null,
isShown: isShown,
isLeaf: isLeaf
}, _extends({}, props));
//该节点的父节点是展开状态 或 该节点是根节点
if (isShown || parentKey === null) {
flatTreeData.push(_extends(dataCopy[i], _extends({}, props))); // 取每项数据放入一个新数组
flatTreeKeysMap[key] = dataCopy[i];
flatTreeData.push(dataCopyI); // 取每项数据放入一个新数组
flatTreeKeysMap[key] = dataCopyI;
}
if (Array.isArray(dataCopy[i]["children"]) && dataCopy[i]["children"].length > 0) {
if (Array.isArray(children) && children.length > 0) {
// 若存在children则递归调用，把数据拼接到新数组中，并且删除该children
flatTreeData = flatTreeData.concat(_this7.deepTraversal(dataCopy[i]["children"], key, isExpanded));
delete dataCopy[i]["children"];
flatTreeData = flatTreeData.concat(_this7.deepTraversal(children, key, isExpanded));
}
}
} else {
flatTreeData.push(dataCopy); // 取每项数据放入一个新数组
}
return flatTreeData;
};

6
build/infiniteScroll.js
View File

@ -125,14 +125,12 @@ var InfiniteScroll = function (_Component) {
};
_this.sliceTreeList = function (startIndex, endIndex) {
var flatTreeData = JSON.parse(JSON.stringify(_this.treeList)),
newTreeList = []; //存储截取后的新数据
var newTreeList = []; //存储截取后的新数据
// console.log(
// "**startIndex**" + startIndex,
// "**endIndex**" + endIndex
// );
newTreeList = flatTreeData.slice(startIndex, endIndex);
// console.log('截取后', JSON.stringify(newTreeList))
newTreeList = _this.treeList.slice(startIndex, endIndex);
_this.props.handleTreeListChange && _this.props.handleTreeListChange(newTreeList, startIndex, endIndex);
};

91
build/util.js
View File

@ -381,59 +381,78 @@ function warnOnlyTreeNode() {
* @param {*} treeData 扁平结构的 List 数组
* @param {*} attr 属性配置设置
* @param {*} flatTreeKeysMap 存储所有 key-value 的映射，方便获取各节点信息
* let attr = {
id: 'key',
parendId: 'parentKey',
name: 'title',
rootId: null,
isLeaf: 'isLeaf'
};
*/
function convertListToTree(treeData, attr, flatTreeKeysMap) {
var tree = [];
var resData = treeData,
resKeysMap = {};
resKeysMap = {},
treeKeysMap = {};
resData.map(function (element) {
resKeysMap[element.key] = element;
var key = attr.id;
resKeysMap[element[key]] = element;
});
// 查找父节点，为了补充不完整的数据结构
var findParentNode = function findParentNode(node) {
var parentKey = node[attr.parendId];
if (!resKeysMap.hasOwnProperty(parentKey)) {
var _flatTreeKeysMap$pare = flatTreeKeysMap[parentKey],
key = _flatTreeKeysMap$pare.key,
title = _flatTreeKeysMap$pare.title,
children = _flatTreeKeysMap$pare.children,
otherProps = _objectWithoutProperties(_flatTreeKeysMap$pare, ['key', 'title', 'children']);
var obj = {
if (parentKey !== attr.rootId) {
//如果不是根节点，则继续递归
var item = flatTreeKeysMap[parentKey];
// 用 resKeysMap 判断，避免重复计算某节点的父节点
if (resKeysMap.hasOwnProperty(item[attr.id])) return;
resData.push(item);
resKeysMap[item[attr.id]] = item;
findParentNode(item);
} else {
// 用 treeKeysMap 判断，避免重复累加
if (!treeKeysMap.hasOwnProperty(node[attr.id])) {
var key = node.key,
title = node.title,
children = node.children,
isLeaf = node.isLeaf,
otherProps = _objectWithoutProperties(node, ['key', 'title', 'children', 'isLeaf']),
obj = {
key: key,
title: title,
isLeaf: isLeaf,
children: []
};
tree.push(_extends(obj, _extends({}, otherProps)));
resKeysMap[obj.key] = obj;
treeKeysMap[key] = node;
return node;
}
}
return flatTreeKeysMap[parentKey];
};
for (var i = 0; i < resData.length; i++) {
if (resData[i].parentKey === attr.rootId) {
var _resData$i = resData[i],
key = _resData$i.key,
title = _resData$i.title,
children = _resData$i.children,
otherProps = _objectWithoutProperties(_resData$i, ['key', 'title', 'children']);
var item = resData[i];
if (item[attr.parendId] === attr.rootId) {
//如果是根节点，就存放进 tree 对象中
var key = item.key,
title = item.title,
children = item.children,
otherProps = _objectWithoutProperties(item, ['key', 'title', 'children']);
var obj = {
key: resData[i][attr.id],
title: resData[i][attr.name],
isLeaf: resData[i][attr.isLeaf],
key: item[attr.id],
title: item[attr.name],
isLeaf: item[attr.isLeaf],
children: []
};
tree.push(_extends(obj, _extends({}, otherProps)));
treeKeysMap[key] = item;
resData.splice(i, 1);
i--;
} else {
var parentNode = flatTreeKeysMap[resData[i][attr.id]],
parentKey = parentNode[attr.parendId];
while (parentKey !== attr.rootId) {
parentNode = findParentNode(parentNode);
parentKey = parentNode[attr.parendId];
}
//递归查找根节点信息
findParentNode(item);
}
}
// console.log('tree',tree);
@ -441,17 +460,17 @@ function convertListToTree(treeData, attr, flatTreeKeysMap) {
if (resData.length > 0) {
for (var _i2 = 0; _i2 < treeArrs.length; _i2++) {
for (var j = 0; j < resData.length; j++) {
if (treeArrs[_i2].key === resData[j][attr.parendId]) {
var _resData$j = resData[j],
_key = _resData$j.key,
_title = _resData$j.title,
_children = _resData$j.children,
_otherProps = _objectWithoutProperties(_resData$j, ['key', 'title', 'children']);
var _item = resData[j];
if (treeArrs[_i2].key === _item[attr.parendId]) {
var _key = _item.key,
_title = _item.title,
_children = _item.children,
_otherProps = _objectWithoutProperties(_item, ['key', 'title', 'children']);
var _obj = {
key: resData[j][attr.id],
title: resData[j][attr.name],
isLeaf: resData[j][attr.isLeaf],
key: _item[attr.id],
title: _item[attr.name],
isLeaf: _item[attr.isLeaf],
children: []
};
treeArrs[_i2].children.push(_extends(_obj, _extends({}, _otherProps)));

133
dist/demo.js vendored
View File

@ -34492,19 +34492,6 @@
this.setState(st);
};
// componentWillUpdate(nextProps, nextState){
// const { expandedKeys,treeData } = this.state;
// if(nextState.expandedKeys !== expandedKeys) {
// this.cacheExpandedKeys = expandedKeys;
// if(this.props.lazyLoad){
// let flatTreeData = this.deepTraversal(treeData);
// this.setState({
// flatTreeData
// })
// }
// }
// }
Tree.prototype.onDragStart = function onDragStart(e, treeNode) {
this.dragNode = treeNode;
this.dragNodesKeys = this.getDragNodes(treeNode);
@ -35463,7 +35450,7 @@
var expandedKeys = _this7.state.expandedKeys,
flatTreeData = [],
flatTreeKeysMap = _this7.flatTreeKeysMap,
dataCopy = JSON.parse(JSON.stringify(treeData));
dataCopy = treeData;
if (Array.isArray(dataCopy)) {
for (var i = 0, l = dataCopy.length; i < l; i++) {
@ -35473,25 +35460,27 @@
children = _dataCopy$i.children,
props = _objectWithoutProperties(_dataCopy$i, ['key', 'title', 'children']);
var dataCopyI = new Object();
var isLeaf = children ? false : true,
isExpanded = _this7.cacheExpandedKeys ? _this7.cacheExpandedKeys.indexOf(key) !== -1 : expandedKeys.indexOf(key) !== -1;
dataCopy[i].isExpanded = isExpanded;
dataCopy[i].parentKey = parentKey || null;
dataCopy[i].isShown = isShown;
dataCopy[i].isLeaf = isLeaf;
dataCopyI = _extends(dataCopyI, {
key: key,
title: title,
isExpanded: isExpanded,
parentKey: parentKey || null,
isShown: isShown,
isLeaf: isLeaf
}, _extends({}, props));
//该节点的父节点是展开状态 或 该节点是根节点
if (isShown || parentKey === null) {
flatTreeData.push(_extends(dataCopy[i], _extends({}, props))); // 取每项数据放入一个新数组
flatTreeKeysMap[key] = dataCopy[i];
flatTreeData.push(dataCopyI); // 取每项数据放入一个新数组
flatTreeKeysMap[key] = dataCopyI;
}
if (Array.isArray(dataCopy[i]["children"]) && dataCopy[i]["children"].length > 0) {
if (Array.isArray(children) && children.length > 0) {
// 若存在children则递归调用，把数据拼接到新数组中，并且删除该children
flatTreeData = flatTreeData.concat(_this7.deepTraversal(dataCopy[i]["children"], key, isExpanded));
delete dataCopy[i]["children"];
flatTreeData = flatTreeData.concat(_this7.deepTraversal(children, key, isExpanded));
}
}
} else {
flatTreeData.push(dataCopy); // 取每项数据放入一个新数组
}
return flatTreeData;
};
@ -36574,59 +36563,75 @@
* @param {*} treeData 扁平结构的 List 数组
* @param {*} attr 属性配置设置
* @param {*} flatTreeKeysMap 存储所有 key-value 的映射，方便获取各节点信息
* let attr = {
id: 'key',
parendId: 'parentKey',
name: 'title',
rootId: null,
isLeaf: 'isLeaf'
};
*/
function convertListToTree(treeData, attr, flatTreeKeysMap) {
var tree = [];
var resData = treeData,
resKeysMap = {};
resKeysMap = {},
treeKeysMap = {};
resData.map(function (element) {
resKeysMap[element.key] = element;
var key = attr.id;
resKeysMap[element[key]] = element;
});
// 查找父节点，为了补充不完整的数据结构
var findParentNode = function findParentNode(node) {
var parentKey = node[attr.parendId];
if (!resKeysMap.hasOwnProperty(parentKey)) {
var _flatTreeKeysMap$pare = flatTreeKeysMap[parentKey],
key = _flatTreeKeysMap$pare.key,
title = _flatTreeKeysMap$pare.title,
children = _flatTreeKeysMap$pare.children,
otherProps = _objectWithoutProperties(_flatTreeKeysMap$pare, ['key', 'title', 'children']);
var obj = {
if (parentKey !== attr.rootId) {
var item = flatTreeKeysMap[parentKey];
if (resKeysMap.hasOwnProperty(item[attr.id])) return;
resData.push(item);
resKeysMap[item[attr.id]] = item;
findParentNode(item);
} else {
if (!treeKeysMap.hasOwnProperty(node[attr.id])) {
var key = node.key,
title = node.title,
children = node.children,
isLeaf = node.isLeaf,
otherProps = _objectWithoutProperties(node, ['key', 'title', 'children', 'isLeaf']),
obj = {
key: key,
title: title,
isLeaf: isLeaf,
children: []
};
tree.push(_extends(obj, _extends({}, otherProps)));
resKeysMap[obj.key] = obj;
treeKeysMap[key] = node;
return node;
}
}
return flatTreeKeysMap[parentKey];
};
for (var i = 0; i < resData.length; i++) {
if (resData[i].parentKey === attr.rootId) {
var _resData$i = resData[i],
key = _resData$i.key,
title = _resData$i.title,
children = _resData$i.children,
otherProps = _objectWithoutProperties(_resData$i, ['key', 'title', 'children']);
var item = resData[i];
if (item[attr.parendId] === attr.rootId) {
//如果是根节点，就存放进 tree 对象中
var key = item.key,
title = item.title,
children = item.children,
otherProps = _objectWithoutProperties(item, ['key', 'title', 'children']);
var obj = {
key: resData[i][attr.id],
title: resData[i][attr.name],
isLeaf: resData[i][attr.isLeaf],
key: item[attr.id],
title: item[attr.name],
isLeaf: item[attr.isLeaf],
children: []
};
tree.push(_extends(obj, _extends({}, otherProps)));
treeKeysMap[key] = item;
resData.splice(i, 1);
i--;
} else {
var parentNode = flatTreeKeysMap[resData[i][attr.id]],
parentKey = parentNode[attr.parendId];
while (parentKey !== attr.rootId) {
parentNode = findParentNode(parentNode);
parentKey = parentNode[attr.parendId];
}
//找到根节点信息
findParentNode(item);
}
}
// console.log('tree',tree);
@ -36634,17 +36639,17 @@
if (resData.length > 0) {
for (var _i2 = 0; _i2 < treeArrs.length; _i2++) {
for (var j = 0; j < resData.length; j++) {
if (treeArrs[_i2].key === resData[j][attr.parendId]) {
var _resData$j = resData[j],
_key = _resData$j.key,
_title = _resData$j.title,
_children = _resData$j.children,
_otherProps = _objectWithoutProperties(_resData$j, ['key', 'title', 'children']);
var _item = resData[j];
if (treeArrs[_i2].key === _item[attr.parendId]) {
var _key = _item.key,
_title = _item.title,
_children = _item.children,
_otherProps = _objectWithoutProperties(_item, ['key', 'title', 'children']);
var _obj = {
key: resData[j][attr.id],
title: resData[j][attr.name],
isLeaf: resData[j][attr.isLeaf],
key: _item[attr.id],
title: _item[attr.name],
isLeaf: _item[attr.isLeaf],
children: []
};
treeArrs[_i2].children.push(_extends(_obj, _extends({}, _otherProps)));
@ -36851,14 +36856,12 @@
};
_this.sliceTreeList = function (startIndex, endIndex) {
var flatTreeData = JSON.parse(JSON.stringify(_this.treeList)),
newTreeList = []; //存储截取后的新数据
var newTreeList = []; //存储截取后的新数据
// console.log(
// "**startIndex**" + startIndex,
// "**endIndex**" + endIndex
// );
newTreeList = flatTreeData.slice(startIndex, endIndex);
// console.log('截取后', JSON.stringify(newTreeList))
newTreeList = _this.treeList.slice(startIndex, endIndex);
_this.props.handleTreeListChange && _this.props.handleTreeListChange(newTreeList, startIndex, endIndex);
};

2
dist/demo.js.map vendored
View File

File diff suppressed because one or more lines are too long

39
src/Tree.js
View File

@ -103,19 +103,6 @@ class Tree extends React.Component {
this.setState(st);
}
// componentWillUpdate(nextProps, nextState){
// const { expandedKeys,treeData } = this.state;
// if(nextState.expandedKeys !== expandedKeys) {
// this.cacheExpandedKeys = expandedKeys;
// if(this.props.lazyLoad){
// let flatTreeData = this.deepTraversal(treeData);
// this.setState({
// flatTreeData
// })
// }
// }
// }
onDragStart(e, treeNode) {
this.dragNode = treeNode;
this.dragNodesKeys = this.getDragNodes(treeNode);
@ -829,29 +816,31 @@ onExpand(treeNode,keyType) {
let {expandedKeys} = this.state,
flatTreeData = [],
flatTreeKeysMap = this.flatTreeKeysMap, //存储所有 key-value 的映射，方便获取各节点信息
dataCopy = JSON.parse(JSON.stringify(treeData));
dataCopy = treeData;
if(Array.isArray(dataCopy)){
for (let i=0, l=dataCopy.length; i<l; i++) {
let { key, title, children, ...props } = dataCopy[i];
let dataCopyI = new Object();
let isLeaf = children ? false : true,
isExpanded = this.cacheExpandedKeys ? this.cacheExpandedKeys.indexOf(key) !== -1 : expandedKeys.indexOf(key) !== -1;
dataCopy[i].isExpanded = isExpanded;
dataCopy[i].parentKey = parentKey || null;
dataCopy[i].isShown = isShown;
dataCopy[i].isLeaf = isLeaf;
dataCopyI = Object.assign(dataCopyI,{
key,
title,
isExpanded,
parentKey : parentKey || null,
isShown,
isLeaf
},{...props});
//该节点的父节点是展开状态 或 该节点是根节点
if(isShown || parentKey === null){
flatTreeData.push(Object.assign(dataCopy[i], {...props})); // 取每项数据放入一个新数组
flatTreeKeysMap[key] = dataCopy[i];
flatTreeData.push(dataCopyI); // 取每项数据放入一个新数组
flatTreeKeysMap[key] = dataCopyI;
}
if (Array.isArray(dataCopy[i]["children"]) && dataCopy[i]["children"].length > 0){
if (Array.isArray(children) && children.length > 0){
// 若存在children则递归调用，把数据拼接到新数组中，并且删除该children
flatTreeData = flatTreeData.concat(this.deepTraversal(dataCopy[i]["children"], key, isExpanded));
delete dataCopy[i]["children"]
flatTreeData = flatTreeData.concat(this.deepTraversal(children, key, isExpanded));
}
}
}else {
flatTreeData.push(dataCopy); // 取每项数据放入一个新数组
}
return flatTreeData;
}

6
src/infiniteScroll.js
View File

@ -248,14 +248,12 @@ export default class InfiniteScroll extends Component {
* @param endIndex
*/
sliceTreeList = (startIndex, endIndex) => {
let flatTreeData = JSON.parse(JSON.stringify(this.treeList)),
newTreeList = []; //存储截取后的新数据
let newTreeList = []; //存储截取后的新数据
// console.log(
// "**startIndex**" + startIndex,
// "**endIndex**" + endIndex
// );
newTreeList = flatTreeData.slice(startIndex,endIndex);
// console.log('截取后', JSON.stringify(newTreeList))
newTreeList = this.treeList.slice(startIndex,endIndex);
this.props.handleTreeListChange && this.props.handleTreeListChange(newTreeList, startIndex, endIndex);
}

74
src/util.js
View File

@ -328,49 +328,66 @@ export function warnOnlyTreeNode() {
* @param {*} treeData 扁平结构的 List 数组
* @param {*} attr 属性配置设置
* @param {*} flatTreeKeysMap 存储所有 key-value 的映射，方便获取各节点信息
* let attr = {
id: 'key',
parendId: 'parentKey',
name: 'title',
rootId: null,
isLeaf: 'isLeaf'
};
*/
export function convertListToTree(treeData, attr, flatTreeKeysMap) {
let tree = [];
let resData = treeData,
resKeysMap = {};
resKeysMap = {},
treeKeysMap = {};
resData.map((element) => {
  resKeysMap[element.key] = element;
let key = attr.id;
  resKeysMap[element[key]] = element;
  });
// 查找父节点，为了补充不完整的数据结构
let findParentNode = (node) => {
let parentKey = node[attr.parendId];
if (!resKeysMap.hasOwnProperty(parentKey) ) {
let { key, title, children, ...otherProps } = flatTreeKeysMap[parentKey];
let obj = {
key: key,
title: title,
if(parentKey !== attr.rootId) { //如果不是根节点，则继续递归
let item = flatTreeKeysMap[parentKey];
// 用 resKeysMap 判断，避免重复计算某节点的父节点
if(resKeysMap.hasOwnProperty(item[attr.id])) return;
resData.push(item);
resKeysMap[item[attr.id]] = item;
findParentNode(item);
}else{
// 用 treeKeysMap 判断，避免重复累加
if (!treeKeysMap.hasOwnProperty(node[attr.id]) ) {
let { key, title, children, isLeaf, ...otherProps } = node,
obj = {
key,
title,
isLeaf,
children: []
};
tree.push(Object.assign(obj, {...otherProps}));
resKeysMap[obj.key] = obj;
}
return flatTreeKeysMap[parentKey];
tree.push(Object.assign(obj, {...otherProps}));
treeKeysMap[key] = node;
return node;
}
}
}
for (let i = 0; i < resData.length; i++) {
if (resData[i].parentKey === attr.rootId) {
let { key, title, children, ...otherProps } = resData[i];
let item = resData[i];
if (item[attr.parendId] === attr.rootId) { //如果是根节点，就存放进 tree 对象中
let { key, title, children, ...otherProps } = item;
let obj = {
key: resData[i][attr.id],
title: resData[i][attr.name],
isLeaf: resData[i][attr.isLeaf],
key: item[attr.id],
title: item[attr.name],
isLeaf: item[attr.isLeaf],
children: []
};
tree.push(Object.assign(obj, {...otherProps}));
treeKeysMap[key] = item;
resData.splice(i, 1);
i--;
}else {
let parentNode = flatTreeKeysMap[resData[i][attr.id]],
parentKey = parentNode[attr.parendId];
while(parentKey !== attr.rootId){
parentNode = findParentNode(parentNode);
parentKey = parentNode[attr.parendId];
}
}else { //递归查找根节点信息
findParentNode(item);
}
}
// console.log('tree',tree);
@ -378,12 +395,13 @@ export function convertListToTree(treeData, attr, flatTreeKeysMap) {
if (resData.length > 0) {
for (let i = 0; i < treeArrs.length; i++) {
for (let j = 0; j < resData.length; j++) {
if (treeArrs[i].key === resData[j][attr.parendId]) {
let { key, title, children, ...otherProps } = resData[j];
let item = resData[j];
if (treeArrs[i].key === item[attr.parendId]) {
let { key, title, children, ...otherProps } = item;
let obj = {
key: resData[j][attr.id],
title: resData[j][attr.name],
isLeaf: resData[j][attr.isLeaf],
key: item[attr.id],
title: item[attr.name],
isLeaf: item[attr.isLeaf],
children: []
};
treeArrs[i].children.push(Object.assign(obj, {...otherProps}));