我们想根据父链接和显示顺序将下面的 JSON 转换为树视图结构的父子关系。
[{
"ParentLink":{ },
"Id":1,
"Title":"Home ITSD test new",
"Url":{
"Description":"#",
"Url":"https://technologies.sharepoint.com/"
},
"DisplayOrder":1,
"IsActive":true,
"ID":1},{
"ParentLink":{
},
"Id":2,
"Title":"Link6",
"Url":{
"Description":"#",
"Url":"https://technologies.sharepoint.com/"
},
"DisplayOrder":2,
"IsActive":true,
"ID":2},{"ParentLink":{
"Title":"Link6"
},
"Id":3,
"Title":"link7",
"Url":{
"Description":"#",
"Url":"https://technologies.sharepoint.com/"
},
"DisplayOrder":21,
"IsActive":true,
"ID":3},{
"ParentLink":{
"Title":"Link6"
},"Id":4,
"Title":"link8",
"Url":{
"Description":"#",
"Url":"https://technologies.sharepoint.com/"
},
"DisplayOrder":22,
"IsActive":true,
"ID":4},{
"ParentLink":{
"Title":"link8"
},
"Id":5,
"Title":"link9",
"Url":{
"Description":"#",
"Url":"https://technologies.sharepoint.com/"
},
"DisplayOrder":221,
"IsActive":true,
"ID":5}]
是否有任何其他可用的库或任何简单的方法来做到这一点
虽然Title和ParentLink.Title没有匹配的值，但您可以将两个值都作为小写字母，并通过迭代给定数组并使用对象来分配节点和子节点来使用它们来生成树。
对于想要的顺序，我建议提前对数据进行排序，以节点为实际生成树的顺序。这比稍后仅对零件进行排序更容易。
只是想知道，为什么数据有两个 id 属性？
var data = [{ ParentLink: {}, Id: 1, Title: "Home ITSD test new", Url: { Description: "#", Url: "https://technologies.sharepoint.com/" }, DisplayOrder: 1, IsActive: true, ID: 1 }, { ParentLink: {}, Id: 2, Title: "Link6", Url: { Description: "#", Url: "https://technologies.sharepoint.com/" }, DisplayOrder: 2, IsActive: true, ID: 2 }, { ParentLink: { Title: "Link6" }, Id: 3, Title: "link7", Url: { Description: "#", Url: "https://technologies.sharepoint.com/" }, DisplayOrder: 21, IsActive: true, ID: 3 }, { ParentLink: { Title: "Link6" }, Id: 4, Title: "link8", Url: { Description: "#", Url: "https://technologies.sharepoint.com/" }, DisplayOrder: 22, IsActive: true, ID: 4 }, { ParentLink: { Title: "link8" }, Id: 5, Title: "link9", Url: { Description: "#", Url: "https://technologies.sharepoint.com/" }, DisplayOrder: 221, IsActive: true, ID: 5 }],
tree = function (data, root) {
var r = [], o = {};
data.forEach(function (a) {
var id = a.Title.toLowerCase(),
parent = a.ParentLink && a.ParentLink.Title && a.ParentLink.Title.toLowerCase();
a.children = o[id] && o[id].children;
o[id] = a;
if (parent === root) {
r.push(a);
} else {
o[parent] = o[parent] || {};
o[parent].children = o[parent].children || [];
o[parent].children.push(a);
}
});
return r;
}(data, undefined);
console.log(tree);.as-console-wrapper { max-height: 100% !important; top: 0; }本文收集自互联网，转载请注明来源。
如有侵权，请联系[email protected] 删除。
我来说两句