| filterTree(List, Predicate, Function, BiConsumer) |  | 100% |  | 91% | 2 | 13 | 0 | 17 | 0 | 1 |
| buildTree(List, Function, Function, BiConsumer) | | 100% | | 100% | 0 | 8 | 0 | 18 | 0 | 1 |
| findPath(List, Predicate, Function, List) | | 100% | | 88% | 2 | 10 | 0 | 12 | 0 | 1 |
| tryCreateCopy(Object) | | 100% | | 100% | 0 | 4 | 0 | 13 | 0 | 1 |
| findNode(List, Predicate, Function) | | 100% | | 88% | 2 | 10 | 0 | 11 | 0 | 1 |
| findNodesInternal(List, Predicate, Function, List) | | 100% | | 87% | 2 | 9 | 0 | 9 | 0 | 1 |
| traverseTreeInternal(List, BiConsumer, Function, int) | | 100% | | 85% | 2 | 8 | 0 | 8 | 0 | 1 |
| getMaxDepth(List, Function) | | 100% | | 85% | 2 | 8 | 0 | 8 | 0 | 1 |
| flattenTreeInternal(List, Function, List) | | 100% | | 85% | 2 | 8 | 0 | 8 | 0 | 1 |
| getAllFields(Class) | | 100% | | 75% | 1 | 3 | 0 | 6 | 0 | 1 |
| getChildren(Object) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| getNodePath(List, Predicate, Function) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| findNodes(List, Predicate, Function) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| flattenTree(List, Function) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| traverseTree(List, BiConsumer, Function) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| findNodeById(List, Object, Function, Function) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| findNodeById$lambda$0(Function, Object, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |