| nextObject() |   | 77% | | 88% | 5 | 24 | 8 | 61 | 0 | 1 |
| markTreeUninteresting(RevTree) | | 70% | | 91% | 1 | 8 | 5 | 30 | 0 | 1 |
| parseMode(byte[], int, int, ObjectWalk.TreeVisit) | | 78% | | 50% | 6 | 8 | 12 | 41 | 0 | 1 |
| markUninteresting(RevObject) | | 55% | | 66% | 3 | 7 | 6 | 14 | 0 | 1 |
| getPathString() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| growPathBuf(int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| reset(int) | | 73% | | 50% | 1 | 2 | 1 | 8 | 0 | 1 |
| updatePathBuf(ObjectWalk.TreeVisit) | | 91% | | 83% | 2 | 7 | 2 | 20 | 0 | 1 |
| static {...} | | 83% | | 50% | 1 | 2 | 0 | 4 | 0 | 1 |
| setObjectFilter(ObjectFilter) | | 90% | | 50% | 1 | 2 | 0 | 3 | 0 | 1 |
| findObjectId(byte[], int) | | 100% | | 100% | 0 | 17 | 0 | 16 | 0 | 1 |
| getPathHashCode() | | 100% | | 85% | 2 | 8 | 0 | 25 | 0 | 1 |
| pushTree(RevObject) | | 100% | | 100% | 0 | 3 | 0 | 18 | 0 | 1 |
| next() | | 100% | | 90% | 1 | 6 | 0 | 12 | 0 | 1 |
| ObjectWalk(ObjectReader) | | 100% | | n/a | 0 | 1 | 0 | 8 | 0 | 1 |
| markStart(RevObject) | | 100% | | 100% | 0 | 3 | 0 | 8 | 0 | 1 |
| checkConnectivity() | | 100% | | 100% | 0 | 5 | 0 | 8 | 0 | 1 |
| addObject(RevObject) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| dispose() | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| getPathBuffer() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| getPathLength() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| releaseTreeVisit(ObjectWalk.TreeVisit) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| sort(RevSort, boolean) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| sort(RevSort) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| getTreeDepth() | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| setVisitationPolicy(ObjectWalk.VisitationPolicy) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| skipTree() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| ObjectWalk(Repository) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| getObjectFilter() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |