| AbstractOpenIntHashMap() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| findInsertionIndex(int[], byte[], int, int) |  | 100% | | 100% | 0 | 12 | 0 | 26 | 0 | 1 |
| doGrowTable(int, AbstractOpenIntHashMap.ValueCopier) | | 100% | | 100% | 0 | 4 | 0 | 21 | 0 | 1 |
| put(int) | | 100% | | 100% | 0 | 5 | 0 | 16 | 0 | 1 |
| containsKey(int) | | 100% | | 100% | 0 | 5 | 0 | 13 | 0 | 1 |
| locate(int) | | 100% | | 100% | 0 | 5 | 0 | 13 | 0 | 1 |
| AbstractOpenIntHashMap(AbstractOpenIntHashMap) | | 100% | | n/a | 0 | 1 | 0 | 10 | 0 | 1 |
| computeCapacity(int) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| doRemove(int) | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| AbstractOpenIntHashMap(int) | | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
| hashOf(int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| containsKey(int, int) | | 100% | | 100% | 0 | 4 | 0 | 1 | 0 | 1 |
| shouldGrowTable() | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| keysStatesHashCode() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| probe(int, int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| equalKeys(AbstractOpenIntHashMap) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| equalStates(AbstractOpenIntHashMap) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| nextPowerOfTwo(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| changeIndexSign(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getCapacity() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| resetCount() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| perturb(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getSize() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |