| cloneNode(Node) |  | 0% | | 0% | 10 | 10 | 24 | 24 | 1 | 1 |
| printTree(PrintWriter, Node, int) | | 0% | | 0% | 11 | 11 | 33 | 33 | 1 | 1 |
| assertAssignable(NodeUtil.NodeClass, long, Object) | | 0% | | 0% | 10 | 10 | 15 | 15 | 1 | 1 |
| printSourceAttributionTree(PrintWriter, Node, Node, int) | | 0% | | 0% | 7 | 7 | 21 | 21 | 1 | 1 |
| replaceChild(Node, Node, Node) | | 0% | | 0% | 11 | 11 | 16 | 16 | 1 | 1 |
| findNodeChildren(Node) | | 0% | | 0% | 7 | 7 | 13 | 13 | 1 | 1 |
| traceRewrite(Node, Node, CharSequence) | | 0% | | 0% | 11 | 11 | 16 | 16 | 1 | 1 |
| getNodeFieldName(Node, Node, String) | | 0% | | 0% | 7 | 7 | 12 | 12 | 1 | 1 |
| displaySourceAttribution(Node) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| printCompactTree(PrintWriter, Node, Node, int) | | 0% | | 0% | 5 | 5 | 14 | 14 | 1 | 1 |
| printSyntaxTags(Object) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| verify(Node) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| findAnnotation(Class, Class) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| printChildren(PrintWriter, int, Object) | | 0% | | 0% | 2 | 2 | 9 | 9 | 1 | 1 |
| collectNodes(Node, Node) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| formatNodeInfo(Node) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| findFirstNodeInstance(Node, Class) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| toLongArray(List) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getUnsafe() | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| findAllParents(Node, Class) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| countNodes(Node, NodeUtil.NodeCountFilter) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| findParent(Node, Class) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| toStringWithClass(Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| concat(Object[], Object[]) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getNthParent(Node, int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| filterByContainsClassName(Class, String) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| getAllFields(Class) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| countNodes(Node) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| printCompactTreeToString(Node) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| printSourceAttributionTree(Node) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| findAllNodeInstances(Node, Class) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| findNodeInstancesShallow(Node, Class) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| printTreeToString(Node) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| printNewLine(PrintWriter, int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| printCompactTree(OutputStream, Node) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| printSourceAttributionTree(OutputStream, Node) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| printTree(PrintWriter, Node) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| filterByKind(Node, NodeCost) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| printTree(OutputStream, Node) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| makeIterator(Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| makeRecursiveIterator(Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| nodeName(Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| NodeUtil() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |