| toString() |  | 0% |  | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| getPath(DiffEntry.Side) |  | 0% |  | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| scan(TreeWalk, boolean, TreeFilter[]) |   | 96% |   | 93% | 2 | 16 | 1 | 44 | 0 | 1 |
| breakModify(DiffEntry) |  | 100% | | n/a | 0 | 1 | 0 | 19 | 0 | 1 |
| pair(DiffEntry.ChangeType, DiffEntry, DiffEntry, int) |  | 100% | | n/a | 0 | 1 | 0 | 12 | 0 | 1 |
| add(String, AnyObjectId) |  | 100% | | n/a | 0 | 1 | 0 | 9 | 0 | 1 |
| delete(String, AnyObjectId) |  | 100% | | n/a | 0 | 1 | 0 | 9 | 0 | 1 |
| modify(String) |  | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
| isMarked(int) |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| getMode(DiffEntry.Side) |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| getId(DiffEntry.Side) |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| DiffEntry() |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| scan(TreeWalk, boolean) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| scan(TreeWalk) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getOldPath() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getNewPath() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getDiffAttribute() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getOldMode() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getNewMode() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getChangeType() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getScore() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getOldId() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getNewId() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getTreeFilterMarks() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |