You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
97 lines
2.2 KiB
97 lines
2.2 KiB
5 months ago
|
var setupDefaults = require('./setupDefaults')
|
||
|
|
||
|
var map = require('./map')
|
||
|
var orderBy = require('./orderBy')
|
||
|
|
||
|
var clone = require('./clone')
|
||
|
var eqNull = require('./eqNull')
|
||
|
var each = require('./each')
|
||
|
var remove = require('./remove')
|
||
|
|
||
|
var assign = require('./assign')
|
||
|
|
||
|
function strictTree (array, optChildren) {
|
||
|
each(array, function (item) {
|
||
|
if (item[optChildren] && !item[optChildren].length) {
|
||
|
remove(item, optChildren)
|
||
|
}
|
||
|
})
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* 将一个带层级的数据列表转成树结构
|
||
|
*
|
||
|
* @param {Array} array 数组
|
||
|
* @param {Object} options {strict: false, parentKey: 'parentId', key: 'id', children: 'children', mapChildren: 'children', data: 'data'}
|
||
|
* @return {Array}
|
||
|
*/
|
||
|
function toArrayTree (array, options) {
|
||
|
var opts = assign({}, setupDefaults.treeOptions, options)
|
||
|
var optStrict = opts.strict
|
||
|
var optKey = opts.key
|
||
|
var optParentKey = opts.parentKey
|
||
|
var optChildren = opts.children
|
||
|
var optMapChildren = opts.mapChildren
|
||
|
var optSortKey = opts.sortKey
|
||
|
var optReverse = opts.reverse
|
||
|
var optData = opts.data
|
||
|
var result = []
|
||
|
var treeMap = {}
|
||
|
var idsMap = {}
|
||
|
var id, treeData, parentId
|
||
|
|
||
|
if (optSortKey) {
|
||
|
array = orderBy(clone(array), optSortKey)
|
||
|
if (optReverse) {
|
||
|
array = array.reverse()
|
||
|
}
|
||
|
}
|
||
|
|
||
|
each(array, function (item) {
|
||
|
id = item[optKey]
|
||
|
idsMap[id] = true
|
||
|
})
|
||
|
|
||
|
each(array, function (item) {
|
||
|
id = item[optKey]
|
||
|
|
||
|
if (optData) {
|
||
|
treeData = {}
|
||
|
treeData[optData] = item
|
||
|
} else {
|
||
|
treeData = item
|
||
|
}
|
||
|
|
||
|
parentId = item[optParentKey]
|
||
|
treeMap[id] = treeMap[id] || []
|
||
|
treeData[optKey] = id
|
||
|
treeData[optParentKey] = parentId
|
||
|
|
||
|
if (id === parentId) {
|
||
|
parentId = null
|
||
|
console.log('Fix infinite Loop.', item)
|
||
|
}
|
||
|
|
||
|
treeMap[parentId] = treeMap[parentId] || []
|
||
|
treeMap[parentId].push(treeData)
|
||
|
treeData[optChildren] = treeMap[id]
|
||
|
if (optMapChildren) {
|
||
|
treeData[optMapChildren] = treeMap[id]
|
||
|
}
|
||
|
|
||
|
if (!optStrict || (optStrict && eqNull(parentId))) {
|
||
|
if (!idsMap[parentId]) {
|
||
|
result.push(treeData)
|
||
|
}
|
||
|
}
|
||
|
})
|
||
|
|
||
|
if (optStrict) {
|
||
|
strictTree(array, optChildren)
|
||
|
}
|
||
|
|
||
|
return result
|
||
|
}
|
||
|
|
||
|
module.exports = toArrayTree
|