/**
* 拼音码搜索树结构查找父节点
*/
handleSearchPYM() {
let searchVal = this.serchValue; // 搜索内容
let treeData = this.$lodash.cloneDeep(this.getTreeData);
// 整理tree节点数据
var treeObj = treeData.reduce((o, x) => {
let id = x.id
let pId = x.parent
o[id] = o[id] || { children: [] }
o[id].node = x
if (pId) {
o[pId] = o[pId] || { children: [] }
o[pId].children.push(x)
}
return o
}, {});
let cludePY = [];
// 判断包含搜索内容得节点 会有多个符合
treeData.forEach(el => {
if (el.pinyin.includes(searchVal)) {
cludePY.push(el)
}
});
let result = this.getNodeParent(treeObj, cludePY); // 获取节点所有父节点
this.formatTreeData(result);
console.log('result', result);
},
getNodeParent(treeData, searchNode) {
let arr = []
searchNode.forEach(el => {
拼音码搜索子节点找父节点 tree
最新推荐文章于 2023-12-25 14:28:09 发布