[英]Nest array of objects by hierarchy level JavaScript/TypeScript
I have a dataset similar to the one below: 我有一个类似于以下数据集的数据集:
dataSet = {rows: [
{"ID":0, "Value":10, "HIERARCHY_LEVEL":1},
{"ID":1, "Value":20, "HIERARCHY_LEVEL":2},
{"ID":2, "Value":55, "HIERARCHY_LEVEL":3},
{"ID":3, "Value":77, "HIERARCHY_LEVEL":2},
{"ID":4, "Value":29, "HIERARCHY_LEVEL":3},
{"ID":5, "Value":44, "HIERARCHY_LEVEL":4},
{"ID":6, "Value":34, "HIERARCHY_LEVEL":5},
{"ID":7, "Value":56, "HIERARCHY_LEVEL":4},
{"ID":8, "Value":23, "HIERARCHY_LEVEL":2},
{"ID":9, "Value":23, "HIERARCHY_LEVEL":3},
{"ID":10, "Value":23, "HIERARCHY_LEVEL":1},
{"ID":11, "Value":23, "HIERARCHY_LEVEL":2},
{"ID":12, "Value":23, "HIERARCHY_LEVEL":2},
{"ID":13, "Value":23, "HIERARCHY_LEVEL":3},
]}
I would like to re-arrange this dataSet by the hierarchy level, so each level is put into a children
property array of the previous object like below: 我想按层次结构级别重新排列此dataSet,因此将每个级别放入上一个对象的children
属性数组中,如下所示:
NOTE: The dataSet is loaded in, as is (in-order). 注意:数据集按原样加载(按顺序)。 Also, it does not matter if all objects have the
children
property. 同样,所有对象是否都具有children
属性也无关紧要。
(I have tried to format it for easier reading) (我试图格式化它以便于阅读)
newDataSet = [
{"ID":0, "Value":10, "HIERARCHY_LEVEL":1, "children":[
{"ID":1, "Value":20, "HIERARCHY_LEVEL":2, "children":[
{"ID":2, "Value":55, "HIERARCHY_LEVEL":3}
]},
{"ID":3, "Value":77, "HIERARCHY_LEVEL":2, "children":[
{"ID":4, "Value":29, "HIERARCHY_LEVEL":3, "children":[
{"ID":5, "Value":44, "HIERARCHY_LEVEL":4, "children":[
{"ID":6, "Value":34, "HIERARCHY_LEVEL":5}
]},
{"ID":7, "Value":56, "HIERARCHY_LEVEL":4}
]}
]},
{"ID":8, "Value":23, "HIERARCHY_LEVEL":2, "children":[
{"ID":9, "Value":23, "HIERARCHY_LEVEL":3}
]}
]},
{"ID":10, "Value":23, "HIERARCHY_LEVEL":1, "children":[
{"ID":11, "Value":23, "HIERARCHY_LEVEL":2},
{"ID":12, "Value":23, "HIERARCHY_LEVEL":2, "children":[
{"ID":13, "Value":23, "HIERARCHY_LEVEL":3}
]}
]}
]
let newResults = [];
let topHierarchyLevel = 1;
let resultCounter = (newResults.length - 1); //Get the 2nd last element of newResults
let currentLevel = 2;
let loopCounter = 0;
for (loopCounter; loopCounter < dataSet.rows.length; loopCounter++) {
let row = dataSet.rows[loopCounter];
row["children"] = [];
if (row.HIERARCHY_LEVEL == topHierarchyLevel) {
newResults.push(row);
resultCounter++;
} else {
if (row.HIERARCHY_LEVEL == 2) {
newResults[resultCounter].children.push(row);
currentLevel++;
} else if (row.HIERARCHY_LEVEL > 2) {
newResults[resultCounter-1].children.children.push(row);
currentLevel++;
resultCounter++;
} else {
currentLevel--;
resultCounter--;
loopCounter--;
}
}
}
You could use the level property HIERARCHY_LEVEL
for indicating the nested position in a helper array. 您可以使用级别属性HIERARCHY_LEVEL
来指示帮助器数组中的嵌套位置。
Then iterate the data and build children arrays, if necessary. 然后,如有必要,对数据进行迭代并构建子数组。
function getTree(array) { var levels = [{}]; array.forEach(function (o) { levels.length = o.HIERARCHY_LEVEL; levels[o.HIERARCHY_LEVEL - 1].children = levels[o.HIERARCHY_LEVEL - 1].children || []; levels[o.HIERARCHY_LEVEL - 1].children.push(o); levels[o.HIERARCHY_LEVEL] = o; }); return levels[0].children; } var data = [{ ID: 0, Value: 10, HIERARCHY_LEVEL: 1 }, { ID: 1, Value: 20, HIERARCHY_LEVEL: 2 }, { ID: 2, Value: 55, HIERARCHY_LEVEL: 3 }, { ID: 3, Value: 77, HIERARCHY_LEVEL: 2 }, { ID: 4, Value: 29, HIERARCHY_LEVEL: 3 }, { ID: 5, Value: 44, HIERARCHY_LEVEL: 4 }, { ID: 6, Value: 34, HIERARCHY_LEVEL: 5 }, { ID: 7, Value: 56, HIERARCHY_LEVEL: 4 }, { ID: 8, Value: 23, HIERARCHY_LEVEL: 2 }, { ID: 9, Value: 23, HIERARCHY_LEVEL: 3 }, { ID: 10, Value: 23, HIERARCHY_LEVEL: 1 }, { ID: 11, Value: 23, HIERARCHY_LEVEL: 2 }, { ID: 12, Value: 23, HIERARCHY_LEVEL: 2 }, { ID: 13, Value: 23, HIERARCHY_LEVEL: 3 }]; console.log(getTree(data));
.as-console-wrapper { max-height: 100% !important; top: 0; }
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.