JS过滤树数据

<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<title></title>
<!--<script type="text/javascript" src="vue.min.js"></script>-->


<script type="text/javascript"
src="vue.min.js"></script>
<link rel="stylesheet"
href="index.css">
<script src="index.js"></script>


</head>
<body>

<div id="app">


</div>

<script type="text/javascript">

var menu = [];

var node0 = {
id: 'test1',
code: 'code',
name: 'name1',
state: 'open/close',
ico: 'ico',
parentId: 0,
checked: 'true/false',
attributes: {},
children: []
};
var node1 = {
id: 'test',
code: 'code',
name: 'name1',
state: 'open/close',
ico: 'ico2',
parentId: 0,
checked: 'true/false',
attributes: {},
children: []
};

var node2 = {
id: 3,
code: 'code',
name: 'name1',
state: 'open/close',
ico: 'ico',
parentId: 0,
checked: 'true/false',
attributes: {},
children: [node0]
};

var node3 = {
id: 3,
code: 'code',
name: 'name1',
state: 'open/close',
ico: 'ico',
parentId: 0,
checked: 'true/false',
attributes: {},
children: [node1]
};

var node4 = {
id: 4,
code: 'code',
name: 'name1',
state: 'open/close',
ico: 'ico',
parentId: 0,
checked: 'true/false',
attributes: {},
children: [node1]
};
var node5 = {
id: 5,
code: 'code',
name: 'name1',
state: 'open/close',
ico: 'ico',
parentId: 0,
checked: 'true/false',
attributes: {},
children: [node3, node2]
};
node3

menu.push(node5);
menu.push(node4);

console.info(JSON.stringify(menu));

var menuTest = filterByName(menu, '3');
console.info("menuTest == " + JSON.stringify(menuTest));

function filterByName(menu, name) {
var menuNew = [];
for (var i = 0; i < menu.length; i++) {
var nodeNew = undefined;
var node = menu[i];
var childrenNode = node.children;

var childrenMenu = [];
if (childrenNode) {
if (childrenNode.length > 0) {
childrenMenu = filterByName(childrenNode, name);
}
}

if (childrenMenu) {
if (childrenMenu.length > 0) {
nodeNew = new Object();
nodeNew = nodeFillNewFromOld(node, nodeNew);
nodeNew.children = childrenMenu;
} else {
if (checkNodeEquals(node, name)) {
nodeNew = new Object();
nodeNew = nodeFillNewFromOld(node, nodeNew);
}
}
}
if (nodeNew) {
menuNew.push(nodeNew);
}
}

return menuNew;
}

function nodeFillNewFromOld(oldNode, newNode) {
newNode.id = oldNode.id;
newNode.code = oldNode.code;
newNode.name = oldNode.name;
newNode.state = oldNode.state;
newNode.ico = oldNode.ico;
newNode.parentId = oldNode.parentId;
newNode.checked = oldNode.checked;
newNode.attributes = oldNode.attributes;
newNode.children = undefined;

return newNode;
}

function checkNodeEquals(node, name) {
if (node.name.indexOf(name) != -1) {
return true;
} else {
return false;
}

// if (node.id == name) {
// return true;
// } else {
// return false;
// }
}


</script>
</body>
</html>
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

jie310600

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值