递归方法整合

/*菜单树下拉，禁止选择当前项及其子项，以防止死循环*/
/*item表示递归树，compID表示比对的需要禁止选择的项ID*/
// 实例：编辑情况下，禁止选择当前节点及其子节点
export function diGuiTreeEdit(item, compID) {
  const dataSor = item
  let treeAry = []
  for (let i in dataSor) {
    const v = dataSor[i]
    let node = {}
    if (v === null || v === undefined) { }
    else {
      if (v.children && v.children.length > 0) {
        if (v.id == compID) {
          node.isDisabled = true
        } else {
          node.isDisabled = false
        }
        node.id = v.id
        node.label = v.label
        node.name = v.name
        node.children = diGuiTreeEdit(v.children, compID)
        treeAry.push(node)
      } else {
        if (v.id == compID) {
          node.isDisabled = true
        } else {
          node.isDisabled = false
        }
        node.id = v.id
        node.label = v.label
        node.name = v.name
        treeAry.push(node)
      }
    }
  }
  return treeAry
}

// 递归遍历根据id,找到对应的node节点，得到一个结果。treeAry主要是用于递归push的值
// item表示递归树，id表示已知的值的在对象中的key,idVal表示已知的数值。treeAry用于存放每一步遍历得出的值
// 例如根据id在递归树中获取其名称
export function rspTreeNodeFormID(item,id,idVal, treeAry=[]) {
  const dataSor = item
  for (let v of dataSor) {
    if (v === null || v === undefined) { }
    else {
      if (v.children && v.children.length > 0) {
        if (v[id] == idVal) {
          treeAry.push(v)
          break
        } else {
          rspTreeNodeFormID(v.children, id, idVal,treeAry )
        }
      } else {
        if (v[id] == idVal) {
          treeAry.push(v)
          break
        }
      }
    }
  }
  return treeAry
}

// 递归遍历根据id,找到对应的node节点下的data属性里面的对应的值。treeAry主要是用于递归push的值
// 和方法rspTreeNodeFormID实现的功能类似
export function rspTreeNodeDataFormID(item,firstAttr,secAttr,idVal, treeAry=[]) {
  const dataSor = item
  for (let v of dataSor) {
    if (v === null || v === undefined) { }
    else {
      if (v.children && v.children.length > 0) {
        if (v[firstAttr] && v[firstAttr][secAttr] && v[firstAttr][secAttr] == idVal) {
          treeAry.push(v)
          break
        } else {
          rspTreeNodeDataFormID(v.children, firstAttr,secAttr, idVal,treeAry )
        }
      } else {
        if (v[firstAttr] && v[firstAttr][secAttr] && v[firstAttr][secAttr] == idVal) {
          treeAry.push(v)
          break
        }
      }
    }
  }
  return treeAry
}