(nodes: TreeNode[])
| 1652 | } |
| 1653 | |
| 1654 | filterTreeNodes(nodes: TreeNode[]): TreeNode[] { |
| 1655 | const search = this.searchString().trim().toLowerCase(); |
| 1656 | if (!search) { |
| 1657 | return nodes; |
| 1658 | } |
| 1659 | |
| 1660 | return nodes.reduce((acc, node) => { |
| 1661 | const children = node.children ? this.filterTreeNodes(node.children) : undefined; |
| 1662 | if (this.isMatch(node) || (children && children.length > 0)) { |
| 1663 | acc.push({ |
| 1664 | ...node, |
| 1665 | children, |
| 1666 | expanded: children && children.length > 0 ? true : node.expanded, |
| 1667 | }); |
| 1668 | } |
| 1669 | return acc; |
| 1670 | }, [] as TreeNode[]); |
| 1671 | } |
| 1672 | |
| 1673 | isMatch(node: TreeNode) { |
| 1674 | return node.name.toLowerCase().includes(this.searchString().toLowerCase()); |
no test coverage detected