| rehash() |  | 0% | | 0% | 9 | 9 | 33 | 33 | 1 | 1 |
| putInternal(Object, int, Object, Function, boolean) | | 0% | | 0% | 10 | 10 | 23 | 23 | 1 | 1 |
| removeInternal(Object, int, Object, boolean) | | 0% | | 0% | 12 | 12 | 25 | 25 | 1 | 1 |
| containsValue(Object) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| applyIfPresent(Object, int, BiFunction) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| replaceInternal2(Object, int, Object, Object) | | 0% | | 0% | 6 | 6 | 9 | 9 | 1 | 1 |
| apply(Object, int, BiFunction) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| get(Object, int) | | 0% | | 0% | 6 | 6 | 10 | 10 | 1 | 1 |
| replaceInternal(Object, int, Object) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| clear() | | 0% | | 0% | 2 | 2 | 9 | 9 | 1 | 1 |
| containsKey(Object, int) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| ConcurrentReferenceHashMap.Segment(int, float, ConcurrentReferenceHashMap.ReferenceType, ConcurrentReferenceHashMap.ReferenceType, boolean) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| removeStale() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| setTable(ConcurrentReferenceHashMap.HashEntry[]) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| keyEq(Object, Object) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| newHashEntry(Object, int, ConcurrentReferenceHashMap.HashEntry, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| put(Object, int, Object, Function, boolean) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| remove(Object, int, Object, boolean) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| replace(Object, int, Object, Object) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getFirst(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| replace(Object, int, Object) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| readValueUnderLock(ConcurrentReferenceHashMap.HashEntry) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getValue(Object, Object, Function) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| newArray(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |