| clear() |  | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| replace(Object, Object, Object) | | 0% | | 0% | 6 | 6 | 18 | 18 | 1 | 1 |
| orderedMap(boolean, int) | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| replace(Object, Object) | | 0% | | 0% | 5 | 5 | 17 | 17 | 1 | 1 |
| orderedKeySet(boolean, int) | | 0% | | 0% | 6 | 6 | 14 | 14 | 1 | 1 |
| remove(Object, Object) | | 0% | | 0% | 7 | 7 | 13 | 13 | 1 | 1 |
| put(Object, Object, boolean) |  | 48% | | 10% | 5 | 6 | 14 | 23 | 0 | 1 |
| compute(Object, Function, boolean) | | 68% | | 41% | 4 | 7 | 11 | 32 | 0 | 1 |
| setCapacity(long) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| containsValue(Object) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| tryToRetire(ConcurrentLinkedHashMap.Node, ConcurrentLinkedHashMap.WeightedValue) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| keySet() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| getQuietly(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| notifyListener() | | 50% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| weightedSize() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| putIfAbsent(Object, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| containsKey(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ascendingKeySetWithLimit(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingKeySetWithLimit(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| writeReplace() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ascendingMapWithLimit(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingMapWithLimit(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| checkNotNull(Object) | | 42% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| checkArgument(boolean) | | 42% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| checkState(boolean) | | 42% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| capacity() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isEmpty() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ascendingKeySet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingKeySet() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ascendingMap() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingMap() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ConcurrentLinkedHashMap(ConcurrentLinkedHashMap.Builder) | | 97% | | 83% | 1 | 4 | 0 | 25 | 0 | 1 |
| drainOnReadIfNeeded(int, long) | | 89% | | 50% | 2 | 3 | 1 | 6 | 0 | 1 |
| makeRetired(ConcurrentLinkedHashMap.Node) | | 91% | | 50% | 2 | 3 | 2 | 7 | 0 | 1 |
| remove(Object) | | 91% | | 50% | 1 | 2 | 1 | 6 | 0 | 1 |
| entrySet() | | 87% | | 50% | 1 | 2 | 1 | 5 | 0 | 1 |
| makeDead(ConcurrentLinkedHashMap.Node) | | 96% | | 50% | 1 | 2 | 1 | 6 | 0 | 1 |
| evict() | | 96% | | 66% | 2 | 4 | 1 | 9 | 0 | 1 |
| drainReadBuffer(int) | | 100% | | 75% | 1 | 3 | 0 | 12 | 0 | 1 |
| lambda$compute$0(Function, Object, ConcurrentLinkedHashMap.ObjectHolder, Object) | | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
| recordRead(int, ConcurrentLinkedHashMap.Node) | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| drainReadBuffers() | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| tryToDrainBuffers() | | 100% | | 50% | 1 | 2 | 0 | 6 | 0 | 1 |
| drainWriteBuffer() | | 100% | | 75% | 1 | 3 | 0 | 6 | 0 | 1 |
| get(Object) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| afterRead(ConcurrentLinkedHashMap.Node) | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| afterWrite(Runnable) | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| hasOverflowed() | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| applyRead(ConcurrentLinkedHashMap.Node) | | 100% | | 50% | 1 | 2 | 0 | 3 | 0 | 1 |
| ceilingNextPowerOfTwo(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| readBufferIndex() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| put(Object, Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| computeIfAbsent(Object, Function) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| drainBuffers() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |