reverse() |  | 0% |  | 0% | 2 | 2 | 11 | 11 | 1 | 1 |
reversed() |  | 0% |  | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
transform2(BiFunction) |  | 0% |  | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
forEachIndexed(PairList.IndexedBiConsumer) |  | 0% |  | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
forEach(BiConsumer) |  | 0% |  | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
anyMatch(BiPredicate) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
allMatch(BiPredicate) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
noMatch(BiPredicate) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
set(int, Object, Object) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
lambda$transform$1(BiFunction, int) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
remove(int) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
add(int, Map.Entry) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
get(int) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
set(int, Map.Entry) |  | 0% |  | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
add(int, Object, Object) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
add(Map.Entry) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
subList(int, int) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
addAll(int, PairList) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
leftList() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
rightList() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
right(int) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
add(Object, Object) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
transform(BiFunction) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
left(int) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
toImmutableMap() |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
addAll(PairList) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
PairLists.MutablePairList(List) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
size() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$toImmutableMap$0(ImmutableMap.Builder, Object, Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
immutable() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
clear() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
isEmpty() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
backingList() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |