Closed GaborTorma closed 3 years ago
Hi @GaborTorma!
Predicate signature is similar to native js array filter
or Lodash's version:
value goes first, key - second
let cleaned = _.filterDeep(tree, (v, k) => k === 'rootKey' || v === 'rootVal');
Also note includeRoot
makes sense only if you use leavesOnly:false
but in that case you should carefully decide about parent nodes, because if you return false for some parent - children will not be visited.
`const tree = { id: 1,
rootKey: 'rootVal'
};
let cleaned = _.filterDeep(tree, (k, v) => k === 'rootKey' || v === 'rootVal', {includeRoot: true});
console.log(cleaned); // get empty object // expected result: { rootKey: 'rootVal' }`