| binarySearchInArray(Comparable) |  | 0% | | 0% | 7 | 7 | 18 | 18 | 1 | 1 |
| put(Comparable, Object) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| equals(Object) | | 0% | | 0% | 8 | 8 | 17 | 17 | 1 | 1 |
| removeArrayEntryAt(int) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| hashCode() | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| remove(Object) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| getOverflowEntriesMutable() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| get(Object) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| ensureEntryArrayMutable() | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| clear() | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| containsKey(Object) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| entrySet() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| descendingEntrySet() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getOverflowEntriesDescending() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| checkMutable() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| makeImmutable() |  | 79% | | 50% | 3 | 4 | 0 | 11 | 0 | 1 |
| getArrayEntryAt(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newInstanceForTest(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getNumOverflowEntries() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getOverflowEntries() | | 70% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| SmallSortedMap(int) | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| newFieldMap(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getNumArrayEntries() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isImmutable() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |