Table tree support sort
This commit is contained in:
parent
3c9452ef2a
commit
a5acce4b81
3 changed files with 61 additions and 17 deletions
|
@ -47,8 +47,7 @@
|
|||
},
|
||||
{
|
||||
title: 'Age',
|
||||
// key: 'age',
|
||||
slot: 'age',
|
||||
key: 'age',
|
||||
sortable: true
|
||||
},
|
||||
{
|
||||
|
@ -68,6 +67,7 @@
|
|||
address: 'New York No. 1 Lake Park',
|
||||
date: '2016-10-03',
|
||||
_disabled: true,
|
||||
level: 0
|
||||
},
|
||||
{
|
||||
id: '101',
|
||||
|
@ -77,58 +77,66 @@
|
|||
date: '2016-10-01',
|
||||
_showChildren: true,
|
||||
_disabled: false,
|
||||
level: 0,
|
||||
children: [
|
||||
{
|
||||
id: '10100',
|
||||
name: '张三',
|
||||
age: 18,
|
||||
age: 235,
|
||||
address: '发动机莲富大厦放假了开始的',
|
||||
date: '2016-10-01'
|
||||
date: '2016-10-01',
|
||||
level: 1
|
||||
},
|
||||
{
|
||||
id: '10101',
|
||||
name: '李四',
|
||||
age: 19,
|
||||
age: 129,
|
||||
address: '风刀霜剑分离的思路开发',
|
||||
date: '2016-10-02'
|
||||
date: '2016-10-02',
|
||||
level: 1
|
||||
},
|
||||
{
|
||||
id: '10102',
|
||||
name: '王五',
|
||||
age: 20,
|
||||
age: 290,
|
||||
address: '分离的付款就说个就是范德萨发生',
|
||||
date: '2016-10-03',
|
||||
_showChildren: true,
|
||||
level: 1,
|
||||
children: [
|
||||
{
|
||||
id: '10102100',
|
||||
name: '赵六',
|
||||
age: 21,
|
||||
age: 211,
|
||||
address: '梵蒂冈人太热疼我',
|
||||
date: '2016-10-05'
|
||||
date: '2016-10-05',
|
||||
level: 2
|
||||
},
|
||||
{
|
||||
id: '10102101',
|
||||
name: '丁八',
|
||||
age: 22,
|
||||
age: 272,
|
||||
address: '法第三方的范德萨范德萨发送到',
|
||||
date: '2016-10-06',
|
||||
_showChildren: true,
|
||||
level: 2,
|
||||
children: [
|
||||
{
|
||||
id: '10102101100',
|
||||
name: '第九',
|
||||
age: 23,
|
||||
age: 123,
|
||||
address: '9梵蒂冈人太热疼我',
|
||||
date: '2016-10-07',
|
||||
_disabled: true
|
||||
_disabled: true,
|
||||
level: 3
|
||||
},
|
||||
{
|
||||
id: '10102101101',
|
||||
name: '第十',
|
||||
age: 24,
|
||||
age: 254,
|
||||
address: '10法第三方的范德萨范德萨发送到',
|
||||
date: '2016-10-08'
|
||||
date: '2016-10-08',
|
||||
level: 3
|
||||
},
|
||||
]
|
||||
},
|
||||
|
@ -143,6 +151,7 @@
|
|||
address: 'Sydney No. 1 Lake Park',
|
||||
date: '2016-10-02',
|
||||
_disabled: false,
|
||||
level: 0
|
||||
},
|
||||
{
|
||||
id: '103',
|
||||
|
@ -151,6 +160,7 @@
|
|||
address: 'Ottawa No. 2 Lake Park',
|
||||
date: '2016-10-04',
|
||||
_disabled: true,
|
||||
level: 0
|
||||
}
|
||||
],
|
||||
columns5: [
|
||||
|
@ -165,7 +175,8 @@
|
|||
},
|
||||
{
|
||||
title: 'Age',
|
||||
key: 'age'
|
||||
key: 'age',
|
||||
sortable: true
|
||||
},
|
||||
{
|
||||
title: 'Address',
|
||||
|
|
|
@ -171,6 +171,34 @@
|
|||
}
|
||||
return status;
|
||||
},
|
||||
getLevel (rowKey) {
|
||||
let level;
|
||||
for (let i = 0; i < this.data.length; i++) {
|
||||
const row = this.data[i];
|
||||
if (row[this.rowKey] === rowKey) {
|
||||
level = 0;
|
||||
break;
|
||||
} else if (row.children && row.children.length) {
|
||||
level = this.getChildLevel(row, rowKey, 1);
|
||||
}
|
||||
}
|
||||
return level;
|
||||
},
|
||||
getChildLevel (data, rowKey, level) {
|
||||
let newLevel;
|
||||
if (data.children && data.children.length) {
|
||||
for (let i = 0; i < data.children.length; i++) {
|
||||
const row = data.children[i];
|
||||
if (row[this.rowKey] === rowKey) {
|
||||
newLevel = level;
|
||||
break;
|
||||
} else if (row.children && row.children.length) {
|
||||
newLevel = this.getChildLevel(row, rowKey, level + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
return newLevel;
|
||||
},
|
||||
getChildNode (h, data, nodes, level = 1) {
|
||||
if (data.children && data.children.length) {
|
||||
data.children.forEach((row, index) => {
|
||||
|
@ -190,7 +218,7 @@
|
|||
disabled: this.rowStatusByRowKey('_isDisabled', row._rowKey),
|
||||
expanded: this.rowStatusByRowKey('_isExpanded', row._rowKey),
|
||||
treeNode: true,
|
||||
treeLevel: level
|
||||
treeLevel: this.getLevel(row._rowKey)
|
||||
},
|
||||
key: column._columnKey,
|
||||
});
|
||||
|
@ -228,7 +256,7 @@
|
|||
|
||||
if (row.children && row.children.length) {
|
||||
level++;
|
||||
this.getChildNode(h, row, nodes, level, level);
|
||||
this.getChildNode(h, row, nodes, level);
|
||||
}
|
||||
});
|
||||
return nodes;
|
||||
|
|
|
@ -998,6 +998,11 @@
|
|||
}
|
||||
}
|
||||
});
|
||||
for (let i = 0; i < data.length; i++) {
|
||||
if (data[i].children && data[i].children.length) {
|
||||
data[i].children = this.sortData(data[i].children, type, index);
|
||||
}
|
||||
}
|
||||
return data;
|
||||
},
|
||||
handleSort (_index, type) {
|
||||
|
|
Loading…
Add table
Reference in a new issue