带函数的树中的Lodash和deepdash过滤器

const _ = require('lodash');

function deepFilter(tree, predicate) {
  return _.filter(tree, (node) => {
    if (Array.isArray(node.children)) {
      node.children = deepFilter(node.children, predicate);
    }
    return predicate(node) || node.children.length > 0;
  });
}

const tree = [
  { id: 1, children: [{ id: 2 }, { id: 3 }] },
  { id: 4, children: [{ id: 5 }] }
];

const filteredTree = deepFilter(tree, (node) => node.id > 2);
console.log(filteredTree);

const deepdash = require('deepdash');

const tree = [
  { id: 1, children: [{ id: 2 }, { id: 3 }] },
  { id: 4, children: [{ id: 5 }] }
];

const result = deepdash.deepMap(tree, (node) => {
  if (node.id === 3) {
    throw new Error('Invalid node');
  }
  return node.id * 2;
});

console.log(result);