| apply(Object, int, BiFunction) |  | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| applyIfPresent(Object, int, BiFunction) |  | 66% | | 50% | 2 | 3 | 3 | 11 | 0 | 1 |
| readValueUnderLock(ConcurrentReferenceHashMap.HashEntry) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| removeStale() | | 44% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| putInternal(Object, int, Object, Function, boolean) | | 91% | | 83% | 3 | 10 | 1 | 23 | 0 | 1 |
| containsValue(Object) | | 89% | | 90% | 1 | 6 | 1 | 12 | 0 | 1 |
| rehash() | | 96% | | 87% | 2 | 9 | 3 | 33 | 0 | 1 |
| get(Object, int) | | 89% | | 80% | 2 | 6 | 1 | 10 | 0 | 1 |
| removeInternal(Object, int, Object, boolean) | | 98% | | 81% | 4 | 12 | 2 | 25 | 0 | 1 |
| keyEq(Object, Object) | | 85% | | 75% | 1 | 3 | 0 | 1 | 0 | 1 |
| replaceInternal2(Object, int, Object, Object) | | 100% | | 60% | 4 | 6 | 0 | 9 | 0 | 1 |
| replaceInternal(Object, int, Object) | | 100% | | 62% | 3 | 5 | 0 | 9 | 0 | 1 |
| clear() | | 100% | | 100% | 0 | 2 | 0 | 9 | 0 | 1 |
| containsKey(Object, int) | | 100% | | 87% | 1 | 5 | 0 | 7 | 0 | 1 |
| ConcurrentReferenceHashMap.Segment(int, float, ConcurrentReferenceHashMap.ReferenceType, ConcurrentReferenceHashMap.ReferenceType, boolean) | | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
| setTable(ConcurrentReferenceHashMap.HashEntry[]) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| newHashEntry(Object, int, ConcurrentReferenceHashMap.HashEntry, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| put(Object, int, Object, Function, boolean) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| remove(Object, int, Object, boolean) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| replace(Object, int, Object, Object) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| getFirst(int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| replace(Object, int, Object) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| getValue(Object, Object, Function) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| newArray(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |