| findInsertionIndex(int[], byte[], int, int) |  | 0% | | 0% | 12 | 12 | 26 | 26 | 1 | 1 |
| growTable() | | 0% | | 0% | 3 | 3 | 21 | 21 | 1 | 1 |
| get(int) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| remove(int) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| OpenIntToDoubleHashMap(OpenIntToDoubleHashMap) | | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| put(int, double) | | 0% | | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
| containsKey(int) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| doRemove(int) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| OpenIntToDoubleHashMap(int, double) | | 0% | | n/a | 1 | 1 | 8 | 8 | 1 | 1 |
| computeCapacity(int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| hashOf(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| containsKey(int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| shouldGrowTable() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| probe(int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| findInsertionIndex(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| iterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| OpenIntToDoubleHashMap() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| OpenIntToDoubleHashMap(double) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| OpenIntToDoubleHashMap(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| nextPowerOfTwo(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| changeIndexSign(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| perturb(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |