| rangeContains(Object) |  | 0% | | 0% | 6 | 6 | 3 | 3 | 1 | 1 |
| subMap(Object, Object) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| maintainEmptyInvariant() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| headMap(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| tailMap(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| firstKey() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| computeBackingRowMap() |  | 52% | | 50% | 3 | 4 | 3 | 8 | 0 | 1 |
| containsKey(Object) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| wholeRow() | | 57% | | 16% | 3 | 4 | 0 | 3 | 0 | 1 |
| put(Object, Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| TreeBasedTable.TreeRow(TreeBasedTable, Object, Object, Object) | | 66% | | 16% | 3 | 4 | 0 | 7 | 0 | 1 |
| compare(Object, Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| keySet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| comparator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| TreeBasedTable.TreeRow(TreeBasedTable, Object) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| backingRowMap() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |