Custom search filter - Here we apply on root node only. - This does a case insensitive stristr which is pretty heavy. In a real large-scale app you would likely store a filtered list which in turns would be trivial to linearize.
| 9681 | // - Here we apply on root node only. |
| 9682 | // - This does a case insensitive stristr which is pretty heavy. In a real large-scale app you would likely store a filtered list which in turns would be trivial to linearize. |
| 9683 | inline bool IsNodePassingFilter(ExampleTreeNode* node) |
| 9684 | { |
| 9685 | return node->Parent->Parent != NULL || Filter.PassFilter(node->Name); |
| 9686 | } |
| 9687 | |
| 9688 | // Basic version, recursive. This is how you would generally draw a tree. |
| 9689 | // - Simple but going to be noticeably costly if you have a large amount of nodes as DrawTreeNode() is called for all of them. |
nothing calls this directly
no test coverage detected