js遍历树结构数据

最新推荐文章于 2024-06-21 15:53:06 发布

曹小维

最新推荐文章于 2024-06-21 15:53:06 发布

阅读量1.3k

点赞数 2

文章标签：前端 javascript

本文链接：https://blog.csdn.net/cweeq/article/details/128562810

版权

1、源代码

// 遍历tree
const traverseTree = (trees, callback) => {
  const datas = expandTree(trees, [])
  datas.forEach((e) => {
    callback(e)
  })
}

// 展开tree
const expandTree = (trees, datas) => {
  datas = datas || []
  const expand = (data) => {
    datas.push(data)
    if (Array.isArray(data.children) && data.children.length > 0) {
      data.children.forEach((item) => {
        expandTree(item, datas)
      })
    }
  }
  if (Array.isArray(trees)) {
    trees.forEach((item) => {
      expand(item)
    })
  } else {
    expand(trees)
  }
  return datas
}

// 过滤tree
const filterTree = (trees, callback) => {
  const deepFilter = (list) => {
    if (Array.isArray(list)) {
      return list.filter((item) => {
        if (Array.isArray(list.children) && list.children.length > 0) {
          item.children = deepFilter(item.children)
        }
        return callback(item)
      })
    } else {
      if (Array.isArray(list.children) && list.children.length > 0) {
        list.children = deepFilter(list.children)
      }
      return callback(list) ? list : null
    }
  }
  return deepFilter(trees)
}

export default {
  list: (trees) => {
    trees = JSON.parse(JSON.stringify(trees))
    const datas = expandTree(trees, [])
    datas.forEach((item) => {
      item.children && delete item.children
    })
    return datas
  },
  find: (trees, callback) => {
    return expandTree(trees, []).find((e) => callback(e))
  },
  filter: (trees, callback) => {
    return filterTree(trees, callback)
  },
  forEach: (trees, callback) => {
    traverseTree(trees, callback)
  }
}