MapMakerInternalMap.Segment |   | 24% |   | 18% | 149 | 182 | 361 | 483 | 30 | 50 | 0 | 1 |
TreeMultiset.AvlNode |  | 0% |  | 0% | 105 | 105 | 242 | 242 | 25 | 25 | 1 | 1 |
Maps |  | 0% |  | 0% | 127 | 127 | 222 | 222 | 91 | 91 | 1 | 1 |
TreeMultiset |  | 0% |  | 0% | 70 | 70 | 166 | 166 | 27 | 27 | 1 | 1 |
ImmutableList |  | 0% |  | 0% | 59 | 59 | 87 | 87 | 42 | 42 | 1 | 1 |
Iterables |  | 0% |  | 0% | 91 | 91 | 144 | 144 | 50 | 50 | 1 | 1 |
Iterators |  | 0% |  | 0% | 92 | 92 | 153 | 153 | 57 | 57 | 1 | 1 |
MapMakerInternalMap |   | 33% |   | 19% | 79 | 100 | 134 | 197 | 30 | 48 | 0 | 1 |
GeneralRange |  | 0% |  | 0% | 77 | 77 | 91 | 91 | 22 | 22 | 1 | 1 |
HashBiMap |  | 0% |  | 0% | 61 | 61 | 137 | 137 | 28 | 28 | 1 | 1 |
Ordering |  | 0% |  | 0% | 67 | 67 | 134 | 134 | 35 | 35 | 1 | 1 |
ConcurrentHashMultiset |  | 0% |  | 0% | 67 | 67 | 143 | 143 | 22 | 22 | 1 | 1 |
ArrayTable |  | 0% |  | 0% | 55 | 55 | 92 | 92 | 33 | 33 | 1 | 1 |
ImmutableSortedMap |  | 0% |  | 0% | 70 | 70 | 94 | 94 | 49 | 49 | 1 | 1 |
Range |  | 0% |  | 0% | 86 | 86 | 110 | 110 | 41 | 41 | 1 | 1 |
Sets |  | 0% |  | 0% | 66 | 66 | 123 | 123 | 40 | 40 | 1 | 1 |
MinMaxPriorityQueue |  | 0% |  | 0% | 61 | 61 | 102 | 102 | 35 | 35 | 1 | 1 |
LinkedListMultimap |  | 0% |  | 0% | 48 | 48 | 124 | 124 | 29 | 29 | 1 | 1 |
ImmutableSortedSet |  | 0% |  | 0% | 54 | 54 | 90 | 90 | 44 | 44 | 1 | 1 |
Multisets |  | 0% |  | 0% | 53 | 53 | 118 | 118 | 26 | 26 | 1 | 1 |
MinMaxPriorityQueue.Heap |  | 0% |  | 0% | 49 | 49 | 97 | 97 | 17 | 17 | 1 | 1 |
Multimaps |  | 0% |  | 0% | 64 | 64 | 100 | 100 | 39 | 39 | 1 | 1 |
ImmutableSetMultimap |  | 0% |  | 0% | 38 | 38 | 99 | 99 | 21 | 21 | 1 | 1 |
AbstractMapBasedMultimap |  | 0% |  | 0% | 47 | 47 | 92 | 92 | 24 | 24 | 1 | 1 |
MapMaker |   | 25% |   | 10% | 50 | 63 | 67 | 93 | 13 | 26 | 0 | 1 |
ImmutableSet |  | 0% |  | 0% | 45 | 45 | 83 | 83 | 20 | 20 | 1 | 1 |
ImmutableSortedMultiset |  | 0% |  | 0% | 34 | 34 | 64 | 64 | 26 | 26 | 1 | 1 |
RegularImmutableSortedSet |  | 0% |  | 0% | 56 | 56 | 90 | 90 | 27 | 27 | 1 | 1 |
ImmutableRangeSet |  | 0% |  | 0% | 51 | 51 | 91 | 91 | 23 | 23 | 1 | 1 |
RegularImmutableBiMap |  | 0% |  | 0% | 27 | 27 | 84 | 84 | 9 | 9 | 1 | 1 |
ImmutableMap |  | 0% |  | 0% | 46 | 46 | 55 | 55 | 32 | 32 | 1 | 1 |
Lists |  | 0% |  | 0% | 48 | 48 | 75 | 75 | 28 | 28 | 1 | 1 |
ImmutableListMultimap |  | 0% |  | 0% | 28 | 28 | 83 | 83 | 16 | 16 | 1 | 1 |
StandardTable |  | 0% |  | 0% | 53 | 53 | 71 | 71 | 26 | 26 | 1 | 1 |
TreeRangeSet |  | 0% |  | 0% | 38 | 38 | 69 | 69 | 13 | 13 | 1 | 1 |
Synchronized.SynchronizedNavigableMap |  | 0% |  | 0% | 27 | 27 | 49 | 49 | 24 | 24 | 1 | 1 |
ImmutableMultiset |  | 0% |  | 0% | 40 | 40 | 53 | 53 | 30 | 30 | 1 | 1 |
Synchronized.SynchronizedMultimap |  | 0% |  | 0% | 28 | 28 | 57 | 57 | 22 | 22 | 1 | 1 |
LinkedHashMultimap.ValueSet |  | 0% |  | 0% | 23 | 23 | 77 | 77 | 13 | 13 | 1 | 1 |
ImmutableRangeMap |  | 0% |  | 0% | 31 | 31 | 60 | 60 | 18 | 18 | 1 | 1 |
AbstractMapBasedMultimap.WrappedCollection |  | 0% |  | 0% | 39 | 39 | 91 | 91 | 20 | 20 | 1 | 1 |
AbstractMapBasedMultiset |  | 0% |  | 0% | 27 | 27 | 61 | 61 | 14 | 14 | 1 | 1 |
RegularContiguousSet |  | 0% |  | 0% | 38 | 38 | 43 | 43 | 22 | 22 | 1 | 1 |
SparseImmutableTable |  | 0% |  | 0% | 12 | 12 | 51 | 51 | 6 | 6 | 1 | 1 |
TreeRangeMap |  | 0% |  | 0% | 31 | 31 | 57 | 57 | 17 | 17 | 1 | 1 |
Queues |  | 0% |  | 0% | 33 | 33 | 75 | 75 | 20 | 20 | 1 | 1 |
TreeRangeSet.SubRangeSetRangesByLowerBound |  | 0% |  | 0% | 27 | 27 | 45 | 45 | 11 | 11 | 1 | 1 |
ComputingConcurrentHashMap.ComputingSegment |  | 0% |  | 0% | 24 | 24 | 67 | 67 | 3 | 3 | 1 | 1 |
AbstractBiMap |  | 0% |  | 0% | 34 | 34 | 58 | 58 | 21 | 21 | 1 | 1 |
TreeRangeSet.ComplementRangesByLowerBound |  | 0% |  | 0% | 30 | 30 | 46 | 46 | 12 | 12 | 1 | 1 |
AbstractMultimap |  | 0% |  | 0% | 41 | 41 | 48 | 48 | 22 | 22 | 1 | 1 |
DenseImmutableTable |  | 0% |  | 0% | 13 | 13 | 47 | 47 | 8 | 8 | 1 | 1 |
TreeBasedTable.TreeRow |  | 0% |  | 0% | 39 | 39 | 47 | 47 | 17 | 17 | 1 | 1 |
FluentIterable |  | 0% |  | 0% | 40 | 40 | 55 | 55 | 30 | 30 | 1 | 1 |
LinkedHashMultimap |  | 0% |  | 0% | 22 | 22 | 60 | 60 | 18 | 18 | 1 | 1 |
TreeRangeMap.SubRangeMap |  | 0% |  | 0% | 26 | 26 | 46 | 46 | 13 | 13 | 1 | 1 |
ObjectArrays |  | 0% |  | 0% | 24 | 24 | 54 | 54 | 16 | 16 | 1 | 1 |
TreeRangeSet.RangesByUpperBound |  | 0% |  | 0% | 28 | 28 | 47 | 47 | 13 | 13 | 1 | 1 |
RegularImmutableMap |  | 0% |  | 0% | 18 | 18 | 52 | 52 | 9 | 9 | 1 | 1 |
MinMaxPriorityQueue.QueueIterator |  | 0% |  | 0% | 25 | 25 | 52 | 52 | 8 | 8 | 1 | 1 |
LinkedListMultimap.ValueForKeyIterator |  | 0% |  | 0% | 23 | 23 | 49 | 49 | 11 | 11 | 1 | 1 |
AbstractMapBasedMultimap.NavigableAsMap |  | 0% |  | 0% | 33 | 33 | 40 | 40 | 26 | 26 | 1 | 1 |
Synchronized |  | 0% |  | 0% | 39 | 39 | 43 | 43 | 21 | 21 | 1 | 1 |
Serialization |  | 0% |  | 0% | 19 | 19 | 54 | 54 | 11 | 11 | 1 | 1 |
Synchronized.SynchronizedMap |  | 0% |  | 0% | 20 | 20 | 43 | 43 | 16 | 16 | 1 | 1 |
LinkedListMultimap.NodeIterator |  | 0% |  | 0% | 21 | 21 | 50 | 50 | 12 | 12 | 1 | 1 |
ForwardingNavigableMap |  | 0% |  | 0% | 39 | 39 | 43 | 43 | 37 | 37 | 1 | 1 |
Synchronized.SynchronizedDeque |  | 0% | | n/a | 19 | 19 | 43 | 43 | 19 | 19 | 1 | 1 |
ImmutableRangeSet.AsSet |  | 0% |  | 0% | 23 | 23 | 41 | 41 | 13 | 13 | 1 | 1 |
MapMakerInternalMap.HashIterator |  | 0% |  | 0% | 24 | 24 | 45 | 45 | 8 | 8 | 1 | 1 |
Maps.DescendingMap |  | 0% |  | 0% | 36 | 36 | 40 | 40 | 32 | 32 | 1 | 1 |
AbstractTable |  | 0% |  | 0% | 31 | 31 | 35 | 35 | 21 | 21 | 1 | 1 |
ImmutableMultimap.Builder |  | 0% |  | 0% | 16 | 16 | 37 | 37 | 9 | 9 | 1 | 1 |
TreeRangeMap.SubRangeMap.SubRangeMapAsMap |  | 0% |  | 0% | 23 | 23 | 39 | 39 | 9 | 9 | 1 | 1 |
Synchronized.SynchronizedNavigableSet |  | 0% | | 0% | 17 | 17 | 31 | 31 | 16 | 16 | 1 | 1 |
ImmutableBiMap |  | 0% |  | 0% | 17 | 17 | 22 | 22 | 13 | 13 | 1 | 1 |
RegularImmutableSortedMultiset |  | 0% |  | 0% | 19 | 19 | 25 | 25 | 11 | 11 | 1 | 1 |
ImmutableMultimap |  | 0% |  | 0% | 35 | 35 | 38 | 38 | 31 | 31 | 1 | 1 |
FilteredEntryMultimap |  | 0% |  | 0% | 25 | 25 | 36 | 36 | 18 | 18 | 1 | 1 |
ImmutableTable |  | 0% |  | 0% | 26 | 26 | 35 | 35 | 21 | 21 | 1 | 1 |
ImmutableRangeMap.Builder |  | 0% |  | 0% | 11 | 11 | 28 | 28 | 4 | 4 | 1 | 1 |
Maps.MapDifferenceImpl |  | 0% |  | 0% | 22 | 22 | 28 | 28 | 9 | 9 | 1 | 1 |
CartesianList |  | 0% |  | 0% | 13 | 13 | 35 | 35 | 6 | 6 | 1 | 1 |
TreeMultimap |  | 0% | | 0% | 20 | 20 | 35 | 35 | 19 | 19 | 1 | 1 |
Synchronized.SynchronizedCollection |  | 0% | | n/a | 15 | 15 | 30 | 30 | 15 | 15 | 1 | 1 |
Maps.UnmodifiableNavigableMap |  | 0% | | 0% | 26 | 26 | 31 | 31 | 25 | 25 | 1 | 1 |
ContiguousSet |  | 0% |  | 0% | 17 | 17 | 29 | 29 | 10 | 10 | 1 | 1 |
Maps.TransformedEntriesNavigableMap |  | 0% | | 0% | 25 | 25 | 25 | 25 | 24 | 24 | 1 | 1 |
Synchronized.SynchronizedList |  | 0% | | 0% | 15 | 15 | 29 | 29 | 14 | 14 | 1 | 1 |
ForwardingMultiset |  | 0% |  | 0% | 31 | 31 | 31 | 31 | 25 | 25 | 1 | 1 |
AbstractMapBasedMultimap.WrappedList |  | 0% |  | 0% | 17 | 17 | 40 | 40 | 12 | 12 | 1 | 1 |
MapMakerInternalMap.ExpirationQueue |  | 0% |  | 0% | 17 | 17 | 36 | 36 | 10 | 10 | 1 | 1 |
MapMakerInternalMap.EvictionQueue |  | 0% |  | 0% | 17 | 17 | 36 | 36 | 10 | 10 | 1 | 1 |
StandardTable.Row |  | 0% |  | 0% | 24 | 24 | 30 | 30 | 10 | 10 | 1 | 1 |
Maps.FilteredEntryNavigableMap |  | 0% | | n/a | 20 | 20 | 26 | 26 | 20 | 20 | 1 | 1 |
ForwardingSortedMultiset |  | 0% |  | 0% | 20 | 20 | 36 | 36 | 16 | 16 | 1 | 1 |
Collections2 |  | 0% |  | 0% | 18 | 18 | 33 | 33 | 14 | 14 | 1 | 1 |
Synchronized.SynchronizedMultiset |  | 0% |  | 0% | 14 | 14 | 27 | 27 | 11 | 11 | 1 | 1 |
TreeRangeSet.SubRangeSet |  | 0% |  | 0% | 19 | 19 | 26 | 26 | 8 | 8 | 1 | 1 |
Maps.Values |  | 0% |  | 0% | 16 | 16 | 34 | 34 | 10 | 10 | 1 | 1 |
EnumBiMap |  | 0% |  | 0% | 16 | 16 | 33 | 33 | 11 | 11 | 1 | 1 |
AbstractMultiset |  | 0% |  | 0% | 29 | 29 | 34 | 34 | 23 | 23 | 1 | 1 |
ImmutableSetMultimap.Builder |  | 0% |  | 0% | 13 | 13 | 30 | 30 | 9 | 9 | 1 | 1 |
MapMakerInternalMap.AbstractSerializationProxy |  | 0% |  | 0% | 10 | 10 | 37 | 37 | 5 | 5 | 1 | 1 |
Sets.CartesianSet |  | 0% |  | 0% | 10 | 10 | 30 | 30 | 5 | 5 | 1 | 1 |
FilteredKeyMultimap |  | 0% |  | 0% | 21 | 21 | 32 | 32 | 15 | 15 | 1 | 1 |
ImmutableCollection |  | 0% |  | 0% | 23 | 23 | 33 | 33 | 14 | 14 | 1 | 1 |
Collections2.FilteredCollection |  | 0% |  | 0% | 20 | 20 | 26 | 26 | 15 | 15 | 1 | 1 |
ForwardingMap |  | 0% |  | 0% | 29 | 29 | 36 | 36 | 24 | 24 | 1 | 1 |
Collections2.PermutationIterator |  | 0% |  | 0% | 9 | 9 | 35 | 35 | 4 | 4 | 1 | 1 |
RegularImmutableTable |  | 0% |  | 0% | 14 | 14 | 27 | 27 | 6 | 6 | 1 | 1 |
RegularImmutableList |  | 0% |  | 0% | 17 | 17 | 27 | 27 | 10 | 10 | 1 | 1 |
MapConstraints |  | 0% |  | 0% | 17 | 17 | 28 | 28 | 14 | 14 | 1 | 1 |
AbstractNavigableMap |  | 0% |  | 0% | 25 | 25 | 30 | 30 | 23 | 23 | 1 | 1 |
Tables.TransformedTable |  | 0% |  | 0% | 19 | 19 | 23 | 23 | 17 | 17 | 1 | 1 |
ForwardingNavigableSet |  | 0% | | n/a | 24 | 24 | 24 | 24 | 24 | 24 | 1 | 1 |
ForwardingCollection |  | 0% |  | 0% | 28 | 28 | 33 | 33 | 25 | 25 | 1 | 1 |
AbstractSortedMultiset |  | 0% |  | 0% | 18 | 18 | 33 | 33 | 13 | 13 | 1 | 1 |
Multimaps.UnmodifiableMultimap |  | 0% |  | 0% | 20 | 20 | 32 | 32 | 15 | 15 | 1 | 1 |
HashBiMap.Itr |  | 0% |  | 0% | 11 | 11 | 30 | 30 | 5 | 5 | 1 | 1 |
AbstractMapBasedMultimap.AsMap |  | 0% |  | 0% | 17 | 17 | 29 | 29 | 12 | 12 | 1 | 1 |
StandardTable.ColumnKeySet |  | 0% |  | 0% | 17 | 17 | 38 | 38 | 7 | 7 | 1 | 1 |
FilteredEntryMultimap.AsMap |  | 0% |  | 0% | 16 | 16 | 30 | 30 | 8 | 8 | 1 | 1 |
MapConstraints.ConstrainedMultimap |  | 0% |  | 0% | 12 | 12 | 24 | 24 | 9 | 9 | 1 | 1 |
Multimaps.TransformedEntriesMultimap |  | 0% | | 0% | 19 | 19 | 25 | 25 | 18 | 18 | 1 | 1 |
Sets.DescendingSet |  | 0% | | 0% | 25 | 25 | 29 | 29 | 24 | 24 | 1 | 1 |
Cut.AboveValue |  | 0% |  | 0% | 21 | 21 | 25 | 25 | 13 | 13 | 1 | 1 |
Sets.PowerSet |  | 0% |  | 0% | 12 | 12 | 22 | 22 | 8 | 8 | 1 | 1 |
Collections2.OrderedPermutationIterator |  | 0% |  | 0% | 11 | 11 | 27 | 27 | 5 | 5 | 1 | 1 |
SingletonImmutableList |  | 0% |  | 0% | 21 | 21 | 26 | 26 | 15 | 15 | 1 | 1 |
StandardTable.ColumnMap.ColumnMapEntrySet |  | 0% |  | 0% | 12 | 12 | 24 | 24 | 7 | 7 | 1 | 1 |
Synchronized.SynchronizedAsMapEntries |  | 0% | | 0% | 11 | 11 | 22 | 22 | 10 | 10 | 1 | 1 |
ForwardingList |  | 0% |  | 0% | 25 | 25 | 25 | 25 | 23 | 23 | 1 | 1 |
Maps.EntrySet |  | 0% |  | 0% | 15 | 15 | 27 | 27 | 8 | 8 | 1 | 1 |
Multisets.FilteredMultiset |  | 0% |  | 0% | 14 | 14 | 22 | 22 | 10 | 10 | 1 | 1 |
Lists.ReverseList |  | 0% | | n/a | 14 | 14 | 26 | 26 | 14 | 14 | 1 | 1 |
StandardTable.ColumnMap.ColumnMapValues |  | 0% |  | 0% | 10 | 10 | 25 | 25 | 4 | 4 | 1 | 1 |
DescendingMultiset |  | 0% |  | 0% | 21 | 21 | 25 | 25 | 18 | 18 | 1 | 1 |
Multimaps.MapMultimap |  | 0% | | 0% | 20 | 20 | 26 | 26 | 19 | 19 | 1 | 1 |
ImmutableMap.Builder |  | 0% |  | 0% | 11 | 11 | 23 | 23 | 7 | 7 | 1 | 1 |
ForwardingTable |  | 0% |  | 0% | 24 | 24 | 24 | 24 | 22 | 22 | 1 | 1 |
Maps.AbstractFilteredMap |  | 0% |  | 0% | 15 | 15 | 19 | 19 | 9 | 9 | 1 | 1 |
ArrayListMultimap |  | 0% |  | 0% | 12 | 12 | 30 | 30 | 10 | 10 | 1 | 1 |
Collections2.OrderedPermutationCollection |  | 0% |  | 0% | 12 | 12 | 30 | 30 | 7 | 7 | 1 | 1 |
Cut.BelowValue |  | 0% |  | 0% | 19 | 19 | 23 | 23 | 12 | 12 | 1 | 1 |
SingletonImmutableSet |  | 0% |  | 0% | 18 | 18 | 27 | 27 | 12 | 12 | 1 | 1 |
ForwardingSortedSet |  | 0% |  | 0% | 15 | 15 | 32 | 32 | 11 | 11 | 1 | 1 |
Multimaps.Keys |  | 0% |  | 0% | 15 | 15 | 27 | 27 | 10 | 10 | 1 | 1 |
RegularImmutableSortedMap |  | 0% |  | 0% | 14 | 14 | 21 | 21 | 10 | 10 | 1 | 1 |
ImmutableTable.Builder |  | 0% |  | 0% | 11 | 11 | 26 | 26 | 7 | 7 | 1 | 1 |
ForwardingMultimap |  | 0% |  | 0% | 23 | 23 | 22 | 22 | 21 | 21 | 1 | 1 |
AbstractRangeSet |  | 0% |  | 0% | 19 | 19 | 28 | 28 | 12 | 12 | 1 | 1 |
ImmutableRangeSet.ComplementRanges |  | 0% |  | 0% | 11 | 11 | 20 | 20 | 4 | 4 | 1 | 1 |
AbstractMapBasedMultimap.NavigableKeySet |  | 0% | | n/a | 16 | 16 | 18 | 18 | 16 | 16 | 1 | 1 |
Tables.TransposeTable |  | 0% | | n/a | 20 | 20 | 24 | 24 | 20 | 20 | 1 | 1 |
SortedLists |  | 0% |  | 0% | 8 | 8 | 22 | 22 | 4 | 4 | 1 | 1 |
StandardTable.Column.EntrySet |  | 0% |  | 0% | 13 | 13 | 20 | 20 | 8 | 8 | 1 | 1 |
StandardTable.Column |  | 0% |  | 0% | 13 | 13 | 23 | 23 | 9 | 9 | 1 | 1 |
HashBiMap.EntrySet.1.MapEntry |  | 0% |  | 0% | 8 | 8 | 18 | 18 | 4 | 4 | 1 | 1 |
LinkedListMultimap.DistinctKeyIterator |  | 0% |  | 0% | 10 | 10 | 22 | 22 | 5 | 5 | 1 | 1 |
ReverseOrdering |  | 0% |  | 0% | 16 | 16 | 21 | 21 | 14 | 14 | 1 | 1 |
Sets.FilteredNavigableSet |  | 0% | | n/a | 14 | 14 | 15 | 15 | 14 | 14 | 1 | 1 |
ImmutableCollection.ArrayBasedBuilder |  | 0% |  | 0% | 7 | 7 | 22 | 22 | 5 | 5 | 1 | 1 |
AbstractMapBasedMultimap.WrappedNavigableSet |  | 0% | | 0% | 15 | 15 | 16 | 16 | 14 | 14 | 1 | 1 |
ImmutableRangeSet.Builder |  | 0% |  | 0% | 10 | 10 | 17 | 17 | 4 | 4 | 1 | 1 |
ComputingConcurrentHashMap.ComputingValueReference |  | 0% |  | 0% | 13 | 13 | 35 | 35 | 9 | 9 | 1 | 1 |
DescendingImmutableSortedSet |  | 0% | | 0% | 16 | 16 | 20 | 20 | 15 | 15 | 1 | 1 |
AbstractMapBasedMultimap.WrappedSortedSet |  | 0% |  | 0% | 11 | 11 | 15 | 15 | 8 | 8 | 1 | 1 |
ArrayTable.ArrayMap |  | 0% |  | 0% | 13 | 13 | 19 | 19 | 11 | 11 | 1 | 1 |
HashBiMap.Inverse.1.1.InverseEntry |  | 0% |  | 0% | 7 | 7 | 15 | 15 | 4 | 4 | 1 | 1 |
HashBiMap.Inverse |  | 0% |  | 0% | 16 | 16 | 21 | 21 | 14 | 14 | 1 | 1 |
Maps.NavigableAsMapView |  | 0% | | 0% | 13 | 13 | 19 | 19 | 12 | 12 | 1 | 1 |
ExplicitOrdering |  | 0% |  | 0% | 11 | 11 | 22 | 22 | 8 | 8 | 1 | 1 |
SortedMultisets.NavigableElementSet |  | 0% | | n/a | 12 | 12 | 13 | 13 | 12 | 12 | 1 | 1 |
Constraints.ConstrainedList |  | 0% | | n/a | 10 | 10 | 17 | 17 | 10 | 10 | 1 | 1 |
HashMultimap |  | 0% | | 0% | 10 | 10 | 25 | 25 | 9 | 9 | 1 | 1 |
Synchronized.SynchronizedSortedMap |  | 0% | | n/a | 8 | 8 | 15 | 15 | 8 | 8 | 1 | 1 |
EnumHashBiMap |  | 0% | | n/a | 9 | 9 | 20 | 20 | 9 | 9 | 1 | 1 |
ImmutableList.ReverseImmutableList |  | 0% |  | 0% | 13 | 13 | 17 | 17 | 11 | 11 | 1 | 1 |
Sets.UnmodifiableNavigableSet |  | 0% | | 0% | 14 | 14 | 19 | 19 | 13 | 13 | 1 | 1 |
Synchronized.SynchronizedSortedSet |  | 0% | | n/a | 8 | 8 | 15 | 15 | 8 | 8 | 1 | 1 |
ForwardingSortedMap |  | 0% |  | 0% | 13 | 13 | 22 | 22 | 10 | 10 | 1 | 1 |
Multisets.UnmodifiableMultiset |  | 0% |  | 0% | 18 | 18 | 20 | 20 | 16 | 16 | 1 | 1 |
FilteredMultimapValues |  | 0% |  | 0% | 11 | 11 | 19 | 19 | 8 | 8 | 1 | 1 |
TreeMultiset.new Iterator() {...} |  | 0% |  | 0% | 9 | 9 | 21 | 21 | 4 | 4 | 1 | 1 |
Lists.ReverseList.new ListIterator() {...} |  | 0% |  | 0% | 12 | 12 | 24 | 24 | 10 | 10 | 1 | 1 |
Constraints |  | 0% |  | 0% | 12 | 12 | 17 | 17 | 7 | 7 | 1 | 1 |
Maps.NavigableKeySet |  | 0% | | n/a | 16 | 16 | 17 | 17 | 16 | 16 | 1 | 1 |
LinkedHashMultimap.ValueSet.new Iterator() {...} |  | 0% |  | 0% | 9 | 9 | 21 | 21 | 5 | 5 | 1 | 1 |
Multisets.MultisetIteratorImpl |  | 0% |  | 0% | 9 | 9 | 20 | 20 | 4 | 4 | 1 | 1 |
TreeBasedTable |  | 0% | | n/a | 10 | 10 | 18 | 18 | 10 | 10 | 1 | 1 |
SingletonImmutableBiMap |  | 0% |  | 0% | 13 | 13 | 23 | 23 | 11 | 11 | 1 | 1 |
AbstractMapBasedMultiset.MapBasedMultisetIterator |  | 0% |  | 0% | 9 | 9 | 19 | 19 | 4 | 4 | 1 | 1 |
ImmutableMultiset.Builder |  | 0% |  | 0% | 11 | 11 | 24 | 24 | 9 | 9 | 1 | 1 |
ForwardingBlockingDeque |  | 0% | | n/a | 16 | 16 | 19 | 19 | 16 | 16 | 1 | 1 |
EvictingQueue |  | 0% |  | 0% | 12 | 12 | 19 | 19 | 9 | 9 | 1 | 1 |
FilteredEntryMultimap.AsMap.new Maps.Values() {...} |  | 0% |  | 0% | 9 | 9 | 17 | 17 | 4 | 4 | 1 | 1 |
TreeMultiset.new Iterator() {...} |  | 0% |  | 0% | 9 | 9 | 20 | 20 | 4 | 4 | 1 | 1 |
ByFunctionOrdering |  | 0% |  | 0% | 9 | 9 | 13 | 13 | 5 | 5 | 1 | 1 |
StandardRowSortedTable.RowSortedMap |  | 0% | | n/a | 9 | 9 | 13 | 13 | 9 | 9 | 1 | 1 |
ImmutableCollection.Builder |  | 0% |  | 0% | 11 | 11 | 20 | 20 | 5 | 5 | 1 | 1 |
UnmodifiableSortedMultiset |  | 0% | | 0% | 14 | 14 | 19 | 19 | 13 | 13 | 1 | 1 |
MapMakerInternalMap.EntrySet |  | 0% |  | 0% | 14 | 14 | 19 | 19 | 7 | 7 | 1 | 1 |
Multisets.new AbstractMultiset() {...} |  | 0% |  | 0% | 12 | 12 | 10 | 10 | 8 | 8 | 1 | 1 |
ForwardingMapEntry |  | 0% |  | 0% | 14 | 14 | 14 | 14 | 9 | 9 | 1 | 1 |
ImmutableEnumSet |  | 0% |  | 0% | 17 | 17 | 18 | 18 | 12 | 12 | 1 | 1 |
TreeRangeSet.ComplementRangesByLowerBound.new AbstractIterator() {...} |  | 0% |  | 0% | 6 | 6 | 15 | 15 | 2 | 2 | 1 | 1 |
RegularImmutableSet |  | 0% |  | 0% | 12 | 12 | 22 | 22 | 9 | 9 | 1 | 1 |
AbstractTable.CellSet |  | 0% |  | 0% | 12 | 12 | 15 | 15 | 6 | 6 | 1 | 1 |
Maps.FilteredEntrySortedMap |  | 0% | | 0% | 11 | 11 | 16 | 16 | 10 | 10 | 1 | 1 |
StandardTable.RowMap.EntrySet |  | 0% |  | 0% | 13 | 13 | 11 | 11 | 5 | 5 | 1 | 1 |
Sets.new Sets.SetView() {...} |  | 0% |  | 0% | 11 | 11 | 9 | 9 | 7 | 7 | 1 | 1 |
AbstractMapBasedMultimap.Itr |  | 0% |  | 0% | 8 | 8 | 18 | 18 | 4 | 4 | 1 | 1 |
ForwardingDeque |  | 0% | | n/a | 18 | 18 | 21 | 21 | 18 | 18 | 1 | 1 |
BinaryTreeTraverser.PostOrderIterator |  | 0% |  | 0% | 5 | 5 | 16 | 16 | 3 | 3 | 1 | 1 |
AbstractBiMap.EntrySet |  | 0% | | 0% | 12 | 12 | 19 | 19 | 11 | 11 | 1 | 1 |
ImmutableSortedMultiset.SerializedForm |  | 0% |  | 0% | 4 | 4 | 17 | 17 | 2 | 2 | 1 | 1 |
AbstractIterator |  | 0% |  | 0% | 12 | 12 | 24 | 24 | 6 | 6 | 1 | 1 |
Multimaps.Keys.KeysEntrySet |  | 0% |  | 0% | 13 | 13 | 17 | 17 | 7 | 7 | 1 | 1 |
EnumMultiset |  | 0% | | n/a | 6 | 6 | 22 | 22 | 6 | 6 | 1 | 1 |
Tables.AbstractCell |  | 0% |  | 0% | 9 | 9 | 9 | 9 | 4 | 4 | 1 | 1 |
Synchronized.SynchronizedAsMap |  | 0% |  | 0% | 8 | 8 | 14 | 14 | 5 | 5 | 1 | 1 |
MapMakerInternalMap.StrongEntry |  | 0% | | n/a | 16 | 16 | 24 | 24 | 16 | 16 | 1 | 1 |
MapMakerInternalMap.SoftEntry |  | 0% | | n/a | 16 | 16 | 23 | 23 | 16 | 16 | 1 | 1 |
AbstractIndexedListIterator |  | 0% |  | 0% | 12 | 12 | 17 | 17 | 8 | 8 | 1 | 1 |
CompoundOrdering |  | 0% |  | 0% | 10 | 10 | 20 | 20 | 6 | 6 | 1 | 1 |
AbstractMapBasedMultimap.SortedAsMap |  | 0% | | 0% | 11 | 11 | 13 | 13 | 10 | 10 | 1 | 1 |
Maps.ValueDifferenceImpl |  | 0% |  | 0% | 10 | 10 | 13 | 13 | 7 | 7 | 1 | 1 |
DiscreteDomain.LongDomain |  | 0% |  | 0% | 14 | 14 | 15 | 15 | 8 | 8 | 1 | 1 |
BinaryTreeTraverser.InOrderIterator |  | 0% |  | 0% | 4 | 4 | 16 | 16 | 2 | 2 | 1 | 1 |
AbstractMapBasedMultimap.WrappedCollection.WrappedIterator |  | 0% | | 0% | 8 | 8 | 21 | 21 | 7 | 7 | 1 | 1 |
LexicographicalOrdering |  | 0% |  | 0% | 11 | 11 | 23 | 23 | 5 | 5 | 1 | 1 |
Iterators.new UnmodifiableIterator() {...} |  | 0% |  | 0% | 9 | 9 | 12 | 12 | 3 | 3 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys |  | 0% | | n/a | 11 | 11 | 16 | 16 | 11 | 11 | 1 | 1 |
Multisets.new AbstractMultiset() {...} |  | 0% |  | 0% | 11 | 11 | 9 | 9 | 7 | 7 | 1 | 1 |
Tables |  | 0% |  | 0% | 12 | 12 | 16 | 16 | 9 | 9 | 1 | 1 |
StandardTable.CellIterator |  | 0% |  | 0% | 8 | 8 | 13 | 13 | 4 | 4 | 1 | 1 |
AbstractBiMap.EntrySet.1.new ForwardingMapEntry() {...} |  | 0% |  | 0% | 5 | 5 | 10 | 10 | 3 | 3 | 1 | 1 |
SingletonImmutableTable |  | 0% | | 0% | 9 | 9 | 14 | 14 | 8 | 8 | 1 | 1 |
MinMaxPriorityQueue.Builder |  | 0% |  | 0% | 9 | 9 | 18 | 18 | 6 | 6 | 1 | 1 |
TreeRangeMap.SubRangeMap.SubRangeMapAsMap.new Maps.EntrySet() {...} |  | 0% |  | 0% | 8 | 8 | 10 | 10 | 6 | 6 | 1 | 1 |
AbstractMapBasedMultimap.KeySet |  | 0% |  | 0% | 11 | 11 | 17 | 17 | 7 | 7 | 1 | 1 |
Maps.AsMapView |  | 0% |  | 0% | 12 | 12 | 20 | 20 | 10 | 10 | 1 | 1 |
NullsLastOrdering |  | 0% |  | 0% | 13 | 13 | 21 | 21 | 8 | 8 | 1 | 1 |
Maps.TransformedEntriesMap |  | 0% |  | 0% | 11 | 11 | 13 | 13 | 8 | 8 | 1 | 1 |
ImmutableMap.SerializedForm |  | 0% |  | 0% | 5 | 5 | 15 | 15 | 3 | 3 | 1 | 1 |
NullsFirstOrdering |  | 0% |  | 0% | 13 | 13 | 21 | 21 | 8 | 8 | 1 | 1 |
ReverseNaturalOrdering |  | 0% | | 0% | 14 | 14 | 16 | 16 | 13 | 13 | 1 | 1 |
Cut |  | 0% |  | 0% | 14 | 14 | 23 | 23 | 9 | 9 | 1 | 1 |
HashBasedTable |  | 0% | | n/a | 11 | 11 | 16 | 16 | 11 | 11 | 1 | 1 |
Ordering.ArbitraryOrdering |  | 0% |  | 0% | 10 | 10 | 18 | 18 | 4 | 4 | 1 | 1 |
ImmutableMultiset.SerializedForm |  | 0% |  | 0% | 4 | 4 | 15 | 15 | 2 | 2 | 1 | 1 |
EmptyContiguousSet |  | 0% | | 0% | 22 | 22 | 25 | 25 | 21 | 21 | 1 | 1 |
Synchronized.SynchronizedBiMap |  | 0% |  | 0% | 7 | 7 | 14 | 14 | 5 | 5 | 1 | 1 |
Synchronized.SynchronizedSetMultimap |  | 0% | | 0% | 7 | 7 | 13 | 13 | 6 | 6 | 1 | 1 |
Tables.UnmodifiableTable |  | 0% | | n/a | 14 | 14 | 18 | 18 | 14 | 14 | 1 | 1 |
MapMaker.NullConcurrentMap |  | 0% | | n/a | 12 | 12 | 24 | 24 | 12 | 12 | 1 | 1 |
MapConstraints.ConstrainedMultimap.new ForwardingMap() {...} |  | 0% |  | 0% | 9 | 9 | 15 | 15 | 6 | 6 | 1 | 1 |
Cut.BelowAll |  | 0% | | 0% | 17 | 17 | 20 | 20 | 16 | 16 | 1 | 1 |
Maps.BiMapConverter |  | 0% |  | 0% | 9 | 9 | 14 | 14 | 7 | 7 | 1 | 1 |
Sets.FilteredSortedSet |  | 0% | | 0% | 8 | 8 | 13 | 13 | 7 | 7 | 1 | 1 |
Synchronized.SynchronizedEntry |  | 0% | | n/a | 7 | 7 | 13 | 13 | 7 | 7 | 1 | 1 |
StandardTable.ColumnKeyIterator |  | 0% |  | 0% | 5 | 5 | 12 | 12 | 2 | 2 | 1 | 1 |
Synchronized.SynchronizedQueue |  | 0% | | n/a | 7 | 7 | 13 | 13 | 7 | 7 | 1 | 1 |
Platform |  | 0% |  | 0% | 11 | 11 | 9 | 9 | 7 | 7 | 1 | 1 |
ForwardingNavigableMap.StandardDescendingMap.new Iterator() {...} |  | 0% |  | 0% | 7 | 7 | 13 | 13 | 4 | 4 | 1 | 1 |
ImmutableEnumMap |  | 0% |  | 0% | 12 | 12 | 16 | 16 | 9 | 9 | 1 | 1 |
Multimaps.MapMultimap.1.new Iterator() {...} |  | 0% |  | 0% | 8 | 8 | 10 | 10 | 4 | 4 | 1 | 1 |
TreeRangeSet.ComplementRangesByLowerBound.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 12 | 12 | 2 | 2 | 1 | 1 |
Multisets.1.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 13 | 13 | 2 | 2 | 1 | 1 |
ComparisonChain.new ComparisonChain() {...} |  | 0% |  | 0% | 13 | 13 | 11 | 11 | 11 | 11 | 1 | 1 |
Multisets.3.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 13 | 13 | 2 | 2 | 1 | 1 |
Multimaps.AsMap |  | 0% |  | 0% | 12 | 12 | 14 | 14 | 10 | 10 | 1 | 1 |
AbstractMapEntry |  | 0% |  | 0% | 10 | 10 | 10 | 10 | 5 | 5 | 1 | 1 |
Iterators.PeekingImpl |  | 0% |  | 0% | 10 | 10 | 17 | 17 | 5 | 5 | 1 | 1 |
MapMakerInternalMap.AbstractReferenceEntry |  | 0% | | n/a | 16 | 16 | 16 | 16 | 16 | 16 | 1 | 1 |
LinkedHashMultimap.new Iterator() {...} |  | 0% |  | 0% | 7 | 7 | 13 | 13 | 4 | 4 | 1 | 1 |
FilteredEntryMultimap.Keys |  | 0% |  | 0% | 8 | 8 | 21 | 21 | 3 | 3 | 1 | 1 |
Multisets.AbstractEntry |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 4 | 4 | 1 | 1 |
Iterators.MergingIterator |  | 0% |  | 0% | 7 | 7 | 14 | 14 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.WriteThroughEntry |  | 0% |  | 0% | 9 | 9 | 14 | 14 | 6 | 6 | 1 | 1 |
EmptyImmutableSortedSet |  | 0% | | 0% | 21 | 21 | 24 | 24 | 20 | 20 | 1 | 1 |
TreeTraverser.PostOrderIterator |  | 0% |  | 0% | 5 | 5 | 15 | 15 | 3 | 3 | 1 | 1 |
AbstractMapBasedMultimap.WrappedList.WrappedListIterator |  | 0% | | 0% | 10 | 10 | 17 | 17 | 9 | 9 | 1 | 1 |
ImmutableMultiset.EntrySet |  | 0% |  | 0% | 11 | 11 | 14 | 14 | 8 | 8 | 1 | 1 |
EmptyImmutableSortedMultiset |  | 0% | | 0% | 16 | 16 | 24 | 24 | 15 | 15 | 1 | 1 |
Cut.AboveAll |  | 0% | | 0% | 16 | 16 | 17 | 17 | 15 | 15 | 1 | 1 |
ComputingConcurrentHashMap |  | 0% | | n/a | 5 | 5 | 8 | 8 | 5 | 5 | 1 | 1 |
Synchronized.SynchronizedSortedSetMultimap |  | 0% | | n/a | 6 | 6 | 11 | 11 | 6 | 6 | 1 | 1 |
RegularImmutableBiMap.Inverse |  | 0% |  | 0% | 10 | 10 | 15 | 15 | 7 | 7 | 1 | 1 |
Sets.new Sets.SetView() {...} |  | 0% |  | 0% | 11 | 11 | 6 | 6 | 6 | 6 | 1 | 1 |
Hashing |  | 0% |  | 0% | 10 | 10 | 10 | 10 | 5 | 5 | 1 | 1 |
Lists.StringAsImmutableList |  | 0% |  | 0% | 9 | 9 | 11 | 11 | 7 | 7 | 1 | 1 |
Constraints.ConstrainedSortedSet |  | 0% | | n/a | 7 | 7 | 11 | 11 | 7 | 7 | 1 | 1 |
Multisets.EntrySet |  | 0% |  | 0% | 9 | 9 | 18 | 18 | 4 | 4 | 1 | 1 |
Iterators.new Iterator() {...} |  | 0% |  | 0% | 8 | 8 | 13 | 13 | 4 | 4 | 1 | 1 |
Count |  | 0% |  | 0% | 11 | 11 | 16 | 16 | 9 | 9 | 1 | 1 |
MapConstraints.ConstrainedAsMapEntries |  | 0% | | n/a | 12 | 12 | 16 | 16 | 12 | 12 | 1 | 1 |
FilteredKeyMultimap.AddRejectingList |  | 0% | | n/a | 6 | 6 | 13 | 13 | 6 | 6 | 1 | 1 |
RegularImmutableMultiset |  | 0% | | 0% | 9 | 9 | 13 | 13 | 8 | 8 | 1 | 1 |
EmptyImmutableSortedMap |  | 0% | | n/a | 15 | 15 | 21 | 21 | 15 | 15 | 1 | 1 |
DescendingImmutableSortedMultiset |  | 0% | | n/a | 11 | 11 | 13 | 13 | 11 | 11 | 1 | 1 |
ImmutableMultimap.Itr |  | 0% |  | 0% | 6 | 6 | 10 | 10 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.SoftExpirableEvictableEntry |  | 0% | | n/a | 11 | 11 | 22 | 22 | 11 | 11 | 1 | 1 |
Maps.FilteredMapValues |  | 0% | | 0% | 8 | 8 | 10 | 10 | 7 | 7 | 1 | 1 |
MapMakerInternalMap.WeakExpirableEvictableEntry |  | 0% | | n/a | 11 | 11 | 22 | 22 | 11 | 11 | 1 | 1 |
Maps.new ForwardingNavigableSet() {...} |  | 0% | | n/a | 11 | 11 | 11 | 11 | 11 | 11 | 1 | 1 |
CollectPreconditions |  | 0% |  | 0% | 7 | 7 | 11 | 11 | 4 | 4 | 1 | 1 |
ImmutableClassToInstanceMap.Builder |  | 0% | | 0% | 6 | 6 | 12 | 12 | 5 | 5 | 1 | 1 |
ImmutableRangeSet.new ImmutableList() {...} |  | 0% |  | 0% | 6 | 6 | 7 | 7 | 4 | 4 | 1 | 1 |
LinkedHashMultiset |  | 0% | | n/a | 7 | 7 | 17 | 17 | 7 | 7 | 1 | 1 |
TreeRangeSet.SubRangeSetRangesByLowerBound.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 10 | 10 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.StrongExpirableEvictableEntry |  | 0% | | n/a | 11 | 11 | 22 | 22 | 11 | 11 | 1 | 1 |
DenseImmutableTable.ImmutableArrayMap.1.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
ImmutableRangeMap.new ImmutableList() {...} |  | 0% |  | 0% | 6 | 6 | 7 | 7 | 4 | 4 | 1 | 1 |
Maps.FilteredEntryMap.KeySet |  | 0% | | 0% | 8 | 8 | 12 | 12 | 7 | 7 | 1 | 1 |
DenseImmutableTable.ImmutableArrayMap |  | 0% |  | 0% | 10 | 10 | 10 | 10 | 7 | 7 | 1 | 1 |
TreeTraverser.PreOrderIterator |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 3 | 3 | 1 | 1 |
Multimaps.CustomSortedSetMultimap |  | 0% | | n/a | 5 | 5 | 16 | 16 | 5 | 5 | 1 | 1 |
TreeRangeMap.SubRangeMap.SubRangeMapAsMap.2.new AbstractIterator() {...} |  | 0% |  | 0% | 5 | 5 | 9 | 9 | 2 | 2 | 1 | 1 |
AbstractMapBasedMultimap.SortedKeySet |  | 0% | | n/a | 8 | 8 | 10 | 10 | 8 | 8 | 1 | 1 |
SortedLists.KeyPresentBehavior |  | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 | 1 | 1 |
MapMaker.RemovalCause |  | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 | 1 | 1 |
MapMaker.NullComputingConcurrentMap |  | 0% | | n/a | 3 | 3 | 14 | 14 | 3 | 3 | 1 | 1 |
ArrayTable.1.new Tables.AbstractCell() {...} |  | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
Lists.TransformingRandomAccessList |  | 0% | | n/a | 8 | 8 | 12 | 12 | 8 | 8 | 1 | 1 |
Maps.UnmodifiableBiMap |  | 0% |  | 0% | 7 | 7 | 11 | 11 | 5 | 5 | 1 | 1 |
ImmutableSortedMultiset.Builder |  | 0% | | n/a | 8 | 8 | 16 | 16 | 8 | 8 | 1 | 1 |
FilteredEntryMultimap.AsMap.2.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 10 | 10 | 2 | 2 | 1 | 1 |
ImmutableSortedAsList |  | 0% |  | 0% | 10 | 10 | 9 | 9 | 7 | 7 | 1 | 1 |
MultimapBuilder |  | 0% | | n/a | 8 | 8 | 14 | 14 | 8 | 8 | 1 | 1 |
LinkedHashMultimap.ValueEntry |  | 0% |  | 0% | 12 | 12 | 17 | 17 | 10 | 10 | 1 | 1 |
ImmutableListMultimap.Builder |  | 0% | | n/a | 9 | 9 | 16 | 16 | 9 | 9 | 1 | 1 |
Maps.ImprovedAbstractMap |  | 0% |  | 0% | 9 | 9 | 9 | 9 | 6 | 6 | 1 | 1 |
MapConstraints.ConstrainedMap |  | 0% | | 0% | 6 | 6 | 13 | 13 | 5 | 5 | 1 | 1 |
AbstractMapBasedMultiset.new Iterator() {...} |  | 0% | | 0% | 5 | 5 | 10 | 10 | 4 | 4 | 1 | 1 |
ImmutableMultimap.Keys |  | 0% | | 0% | 8 | 8 | 9 | 9 | 7 | 7 | 1 | 1 |
Multisets.ElementSet |  | 0% | | 0% | 9 | 9 | 13 | 13 | 8 | 8 | 1 | 1 |
MapConstraints.ConstrainedEntries |  | 0% | | n/a | 10 | 10 | 14 | 14 | 10 | 10 | 1 | 1 |
Sets.SubSet.new UnmodifiableIterator() {...} |  | 0% |  | 0% | 5 | 5 | 9 | 9 | 3 | 3 | 1 | 1 |
Iterators.new Iterator() {...} |  | 0% |  | 0% | 7 | 7 | 13 | 13 | 4 | 4 | 1 | 1 |
TreeRangeMap.new RangeMap() {...} |  | 0% | | 0% | 11 | 11 | 15 | 15 | 10 | 10 | 1 | 1 |
HashMultiset |  | 0% | | n/a | 7 | 7 | 17 | 17 | 7 | 7 | 1 | 1 |
Maps.FilteredEntryBiMap |  | 0% | | n/a | 7 | 7 | 12 | 12 | 7 | 7 | 1 | 1 |
Maps.SortedAsMapView |  | 0% | | n/a | 9 | 9 | 10 | 10 | 9 | 9 | 1 | 1 |
BinaryTreeTraverser.1.new AbstractIterator() {...} |  | 0% |  | 0% | 6 | 6 | 12 | 12 | 2 | 2 | 1 | 1 |
Synchronized.SynchronizedListMultimap |  | 0% | | n/a | 5 | 5 | 9 | 9 | 5 | 5 | 1 | 1 |
DiscreteDomain.IntegerDomain |  | 0% |  | 0% | 10 | 10 | 10 | 10 | 8 | 8 | 1 | 1 |
MapConstraints.ConstrainedAsMapValues |  | 0% | | n/a | 10 | 10 | 14 | 14 | 10 | 10 | 1 | 1 |
ImmutableSortedSet.Builder |  | 0% | | n/a | 6 | 6 | 15 | 15 | 6 | 6 | 1 | 1 |
TreeBasedTable.new AbstractIterator() {...} |  | 0% |  | 0% | 6 | 6 | 10 | 10 | 2 | 2 | 1 | 1 |
StandardTable.ColumnMap |  | 0% |  | 0% | 9 | 9 | 8 | 8 | 7 | 7 | 1 | 1 |
RegularImmutableTable.CellSet |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 6 | 6 | 1 | 1 |
Multisets.new AbstractMultiset() {...} |  | 0% | | 0% | 6 | 6 | 7 | 7 | 5 | 5 | 1 | 1 |
AbstractMapBasedMultimap.KeySet.new Iterator() {...} |  | 0% | | 0% | 5 | 5 | 10 | 10 | 4 | 4 | 1 | 1 |
AbstractBiMap.EntrySet.new Iterator() {...} |  | 0% | | 0% | 5 | 5 | 10 | 10 | 4 | 4 | 1 | 1 |
AbstractMapBasedMultimap.AsMap.AsMapIterator |  | 0% | | n/a | 4 | 4 | 10 | 10 | 4 | 4 | 1 | 1 |
MapConstraints.ConstrainedBiMap |  | 0% | | 0% | 6 | 6 | 10 | 10 | 5 | 5 | 1 | 1 |
Maps.KeySet |  | 0% | | 0% | 9 | 9 | 14 | 14 | 8 | 8 | 1 | 1 |
ImmutableList.SubList |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
BinaryTreeTraverser.PreOrderIterator |  | 0% | | 0% | 5 | 5 | 10 | 10 | 4 | 4 | 1 | 1 |
FilteredKeyMultimap.Entries |  | 0% |  | 0% | 6 | 6 | 7 | 7 | 3 | 3 | 1 | 1 |
ImmutableMapValues |  | 0% |  | 0% | 9 | 9 | 10 | 10 | 7 | 7 | 1 | 1 |
SortedMultisets.ElementSet |  | 0% | | n/a | 8 | 8 | 10 | 10 | 8 | 8 | 1 | 1 |
TreeRangeSet.SubRangeSetRangesByLowerBound.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
Maps.TransformedEntriesSortedMap |  | 0% | | n/a | 8 | 8 | 9 | 9 | 8 | 8 | 1 | 1 |
ImmutableRangeSet.AsSet.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
Lists.Partition |  | 0% | | n/a | 4 | 4 | 10 | 10 | 4 | 4 | 1 | 1 |
TreeRangeMap.AsMapOfRanges |  | 0% |  | 0% | 8 | 8 | 9 | 9 | 4 | 4 | 1 | 1 |
Lists.AbstractListWrapper |  | 0% | | n/a | 8 | 8 | 11 | 11 | 8 | 8 | 1 | 1 |
ImmutableRangeSet.AsSet.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
Maps.SortedKeySet |  | 0% | | n/a | 8 | 8 | 9 | 9 | 8 | 8 | 1 | 1 |
ImmutableMultiset.new UnmodifiableIterator() {...} |  | 0% |  | 0% | 6 | 6 | 8 | 8 | 3 | 3 | 1 | 1 |
AbstractIterator.State |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 | 1 | 1 |
AbstractMapBasedMultiset.1.new Multisets.AbstractEntry() {...} |  | 0% |  | 0% | 7 | 7 | 8 | 8 | 3 | 3 | 1 | 1 |
Collections2.PermutationCollection |  | 0% | | 0% | 7 | 7 | 11 | 11 | 6 | 6 | 1 | 1 |
Sets.new Sets.SetView() {...} |  | 0% |  | 0% | 7 | 7 | 5 | 5 | 5 | 5 | 1 | 1 |
ImmutableSet.Builder |  | 0% | | n/a | 7 | 7 | 15 | 15 | 7 | 7 | 1 | 1 |
SortedLists.KeyPresentBehavior.new SortedLists.KeyPresentBehavior() {...} |  | 0% |  | 0% | 4 | 4 | 11 | 11 | 2 | 2 | 1 | 1 |
MapMaker.ComputingMapAdapter |  | 0% | | 0% | 3 | 3 | 11 | 11 | 2 | 2 | 1 | 1 |
Multimaps.Entries |  | 0% |  | 0% | 7 | 7 | 12 | 12 | 5 | 5 | 1 | 1 |
ForwardingQueue |  | 0% | | n/a | 9 | 9 | 15 | 15 | 9 | 9 | 1 | 1 |
Iterators.new Iterator() {...} |  | 0% |  | 0% | 7 | 7 | 8 | 8 | 4 | 4 | 1 | 1 |
Maps.FilteredEntrySortedMap.SortedKeySet |  | 0% | | n/a | 7 | 7 | 7 | 7 | 7 | 7 | 1 | 1 |
ImmutableMapEntrySet |  | 0% |  | 0% | 8 | 8 | 9 | 9 | 5 | 5 | 1 | 1 |
TreeTraverser |  | 0% | | n/a | 6 | 6 | 10 | 10 | 6 | 6 | 1 | 1 |
TreeTraverser.BreadthFirstIterator |  | 0% | | 0% | 5 | 5 | 9 | 9 | 4 | 4 | 1 | 1 |
ConcurrentHashMultiset.new ForwardingSet() {...} |  | 0% |  | 0% | 10 | 10 | 6 | 6 | 6 | 6 | 1 | 1 |
Multisets.new AbstractMultiset() {...} |  | 0% | | 0% | 5 | 5 | 6 | 6 | 4 | 4 | 1 | 1 |
AbstractBiMap.KeySet |  | 0% | | 0% | 8 | 8 | 11 | 11 | 7 | 7 | 1 | 1 |
ImmutableMultimap.Values |  | 0% | | 0% | 7 | 7 | 11 | 11 | 6 | 6 | 1 | 1 |
StandardTable.Column.EntrySetIterator |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
BinaryTreeTraverser |  | 0% | | 0% | 7 | 7 | 11 | 11 | 6 | 6 | 1 | 1 |
ComputingConcurrentHashMap.ComputingSerializationProxy |  | 0% | | n/a | 4 | 4 | 12 | 12 | 4 | 4 | 1 | 1 |
Multisets.4.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 9 | 9 | 2 | 2 | 1 | 1 |
ImmutableBiMap.Builder |  | 0% |  | 0% | 6 | 6 | 9 | 9 | 4 | 4 | 1 | 1 |
ComparatorOrdering |  | 0% |  | 0% | 7 | 7 | 12 | 12 | 5 | 5 | 1 | 1 |
AbstractMapBasedMultimap.WrappedSet |  | 0% |  | 0% | 4 | 4 | 12 | 12 | 2 | 2 | 1 | 1 |
Multisets.2.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 9 | 9 | 2 | 2 | 1 | 1 |
EmptyImmutableSet |  | 0% | | 0% | 15 | 15 | 17 | 17 | 14 | 14 | 1 | 1 |
MapMakerInternalMap.WeakEntry |   | 47% | | n/a | 10 | 16 | 10 | 23 | 10 | 16 | 0 | 1 |
Multimaps.CustomSetMultimap |  | 0% | | n/a | 4 | 4 | 13 | 13 | 4 | 4 | 1 | 1 |
FilteredEntryMultimap.Keys.new Multisets.EntrySet() {...} |  | 0% | | n/a | 7 | 7 | 7 | 7 | 7 | 7 | 1 | 1 |
Multimaps.CustomListMultimap |  | 0% | | n/a | 4 | 4 | 13 | 13 | 4 | 4 | 1 | 1 |
AbstractMapBasedMultimap.AsMap.AsMapEntries |  | 0% | | 0% | 6 | 6 | 9 | 9 | 5 | 5 | 1 | 1 |
Lists.TwoPlusArrayList |  | 0% |  | 0% | 5 | 5 | 11 | 11 | 3 | 3 | 1 | 1 |
MutableClassToInstanceMap |  | 0% | | n/a | 7 | 7 | 8 | 8 | 7 | 7 | 1 | 1 |
Multimaps.CustomMultimap |  | 0% | | n/a | 4 | 4 | 13 | 13 | 4 | 4 | 1 | 1 |
MapMakerInternalMap.CleanupMapTask |  | 0% |  | 0% | 4 | 4 | 9 | 9 | 2 | 2 | 1 | 1 |
AbstractSortedSetMultimap |  | 0% | | 0% | 8 | 8 | 11 | 11 | 7 | 7 | 1 | 1 |
StandardTable.RowMap |  | 0% |  | 0% | 7 | 7 | 6 | 6 | 5 | 5 | 1 | 1 |
TreeRangeSet.RangesByUpperBound.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 5 | 5 | 2 | 2 | 1 | 1 |
TreeRangeSet.RangesByUpperBound.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
ConcurrentHashMultiset.new ForwardingIterator() {...} |  | 0% | | 0% | 5 | 5 | 8 | 8 | 4 | 4 | 1 | 1 |
ConcurrentHashMultiset.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 9 | 9 | 2 | 2 | 1 | 1 |
Synchronized.SynchronizedObject |  | 0% | | 0% | 5 | 5 | 11 | 11 | 4 | 4 | 1 | 1 |
RegularImmutableTable.new Comparator() {...} |  | 0% |  | 0% | 5 | 5 | 5 | 5 | 2 | 2 | 1 | 1 |
ImmutableClassToInstanceMap |  | 0% | | 0% | 7 | 7 | 11 | 11 | 6 | 6 | 1 | 1 |
SortedLists.KeyPresentBehavior.new SortedLists.KeyPresentBehavior() {...} |  | 0% |  | 0% | 4 | 4 | 11 | 11 | 2 | 2 | 1 | 1 |
Sets.SubSet |  | 0% |  | 0% | 6 | 6 | 8 | 8 | 4 | 4 | 1 | 1 |
ImmutableList.Builder |  | 0% | | n/a | 7 | 7 | 13 | 13 | 7 | 7 | 1 | 1 |
StandardTable.Row.RowEntrySet |  | 0% |  | 0% | 6 | 6 | 9 | 9 | 4 | 4 | 1 | 1 |
ImmutableMapKeySet |  | 0% | | n/a | 7 | 7 | 10 | 10 | 7 | 7 | 1 | 1 |
MapMakerInternalMap.KeySet |  | 0% | | 0% | 8 | 8 | 8 | 8 | 7 | 7 | 1 | 1 |
AbstractSetMultimap |  | 0% | | n/a | 9 | 9 | 10 | 10 | 9 | 9 | 1 | 1 |
MapMakerInternalMap.NullEntry |  | 0% | | n/a | 16 | 16 | 17 | 17 | 16 | 16 | 1 | 1 |
Synchronized.SynchronizedSet |  | 0% | | 0% | 5 | 5 | 9 | 9 | 4 | 4 | 1 | 1 |
FilteredKeyMultimap.AddRejectingSet |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
SortedIterables |  | 0% |  | 0% | 5 | 5 | 12 | 12 | 2 | 2 | 1 | 1 |
CartesianList.new ImmutableList() {...} |  | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
MapMakerInternalMap.SoftExpirableEntry |  | 0% | | n/a | 7 | 7 | 14 | 14 | 7 | 7 | 1 | 1 |
MapMakerInternalMap.WeakExpirableEntry |  | 0% | | n/a | 7 | 7 | 14 | 14 | 7 | 7 | 1 | 1 |
StandardTable.Column.KeySet |  | 0% | | 0% | 5 | 5 | 6 | 6 | 4 | 4 | 1 | 1 |
RegularImmutableAsList |  | 0% | | n/a | 7 | 7 | 11 | 11 | 7 | 7 | 1 | 1 |
Iterables.10.new Iterator() {...} |  | 0% | | 0% | 5 | 5 | 9 | 9 | 4 | 4 | 1 | 1 |
Maps.FilteredKeyMap |  | 0% |  | 0% | 6 | 6 | 6 | 6 | 4 | 4 | 1 | 1 |
ImmutableMap.MapViewOfValuesAsSingletonSets |  | 0% | | 0% | 7 | 7 | 9 | 9 | 6 | 6 | 1 | 1 |
FilteredEntrySetMultimap |  | 0% | | n/a | 7 | 7 | 8 | 8 | 7 | 7 | 1 | 1 |
ImmutableSortedMap.Builder |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
MapMakerInternalMap.StrongExpirableEntry |  | 0% | | n/a | 7 | 7 | 14 | 14 | 7 | 7 | 1 | 1 |
Serialization.FieldSetter |  | 0% | | n/a | 3 | 3 | 14 | 14 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.SerializationProxy |  | 0% | | n/a | 4 | 4 | 11 | 11 | 4 | 4 | 1 | 1 |
Maps.FilteredEntryNavigableMap.new Maps.NavigableKeySet() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
AbstractBiMap.Inverse |  | 0% | | n/a | 6 | 6 | 11 | 11 | 6 | 6 | 1 | 1 |
StandardTable.Column.Values |  | 0% |  | 0% | 6 | 6 | 6 | 6 | 4 | 4 | 1 | 1 |
TreeRangeMap.RangeMapEntry |  | 0% | | n/a | 7 | 7 | 11 | 11 | 7 | 7 | 1 | 1 |
ImmutableSortedSetFauxverideShim |  | 0% | | n/a | 9 | 9 | 9 | 9 | 9 | 9 | 1 | 1 |
Multimaps.AsMap.EntrySet |  | 0% | | 0% | 5 | 5 | 8 | 8 | 4 | 4 | 1 | 1 |
StandardTable.Column.EntrySetIterator.new AbstractMapEntry() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ImmutableSortedMultisetFauxverideShim |  | 0% | | n/a | 9 | 9 | 9 | 9 | 9 | 9 | 1 | 1 |
TreeRangeSet.Complement |  | 0% | | 0% | 6 | 6 | 9 | 9 | 5 | 5 | 1 | 1 |
SortedLists.KeyAbsentBehavior |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
ArrayTable.ArrayMap.1.1.new AbstractMapEntry() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
Constraints.ConstrainedSet |  | 0% | | n/a | 4 | 4 | 8 | 8 | 4 | 4 | 1 | 1 |
AbstractListMultimap |  | 0% | | n/a | 8 | 8 | 9 | 9 | 8 | 8 | 1 | 1 |
Lists.OnePlusArrayList |  | 0% | | 0% | 4 | 4 | 7 | 7 | 3 | 3 | 1 | 1 |
TransformedListIterator |  | 0% | | n/a | 8 | 8 | 9 | 9 | 8 | 8 | 1 | 1 |
ImmutableMultimap.EntryCollection |  | 0% | | 0% | 6 | 6 | 10 | 10 | 5 | 5 | 1 | 1 |
FilteredKeySetMultimap |  | 0% | | n/a | 7 | 7 | 8 | 8 | 7 | 7 | 1 | 1 |
Constraints.ConstrainedCollection |  | 0% | | n/a | 4 | 4 | 8 | 8 | 4 | 4 | 1 | 1 |
LinkedListMultimap.new Sets.ImprovedAbstractSet() {...} |  | 0% | | 0% | 6 | 6 | 5 | 5 | 5 | 5 | 1 | 1 |
LinkedListMultimap.new AbstractSequentialList() {...} |  | 0% | | 0% | 4 | 4 | 4 | 4 | 3 | 3 | 1 | 1 |
FilteredEntryMultimap.AsMap.new Maps.EntrySet() {...} |  | 0% | | n/a | 6 | 6 | 6 | 6 | 6 | 6 | 1 | 1 |
FilteredEntryMultimap.AsMap.new Maps.KeySet() {...} |  | 0% | | 0% | 5 | 5 | 4 | 4 | 4 | 4 | 1 | 1 |
Maps.new ForwardingSortedSet() {...} |  | 0% | | n/a | 7 | 7 | 7 | 7 | 7 | 7 | 1 | 1 |
Multimaps.TransformedEntriesListMultimap |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
DiscreteDomain.BigIntegerDomain |  | 0% | | n/a | 6 | 6 | 8 | 8 | 6 | 6 | 1 | 1 |
Collections2.TransformedCollection |  | 0% | | n/a | 5 | 5 | 9 | 9 | 5 | 5 | 1 | 1 |
Constraints.ConstrainedListIterator |  | 0% | | n/a | 4 | 4 | 11 | 11 | 4 | 4 | 1 | 1 |
ForwardingSet |  | 0% |  | 0% | 8 | 8 | 6 | 6 | 6 | 6 | 1 | 1 |
StandardTable.Row.RowEntrySet.new Iterator() {...} |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
ImmutableSetMultimap.EntrySet |  | 0% | | 0% | 6 | 6 | 10 | 10 | 5 | 5 | 1 | 1 |
AbstractBiMap.ValueSet |  | 0% | | n/a | 6 | 6 | 7 | 7 | 6 | 6 | 1 | 1 |
ImmutableAsList |  | 0% | | n/a | 7 | 7 | 8 | 8 | 7 | 7 | 1 | 1 |
AbstractSequentialIterator |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 3 | 3 | 1 | 1 |
HashBiMap.Inverse.InverseKeySet |  | 0% | | 0% | 4 | 4 | 9 | 9 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.EntryFactory |   | 84% | | 50% | 4 | 7 | 9 | 22 | 2 | 5 | 0 | 1 |
WellBehavedMap |  | 0% | | 0% | 5 | 5 | 9 | 9 | 4 | 4 | 1 | 1 |
BoundType |  | 0% | | 0% | 3 | 3 | 4 | 4 | 2 | 2 | 1 | 1 |
ConcurrentHashMultiset.EntrySet |  | 0% | | n/a | 5 | 5 | 7 | 7 | 5 | 5 | 1 | 1 |
Lists.TransformingSequentialList |  | 0% | | n/a | 4 | 4 | 8 | 8 | 4 | 4 | 1 | 1 |
HashBiMap.KeySet |  | 0% | | 0% | 4 | 4 | 9 | 9 | 3 | 3 | 1 | 1 |
ArrayTable.Row |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
MapMakerInternalMap.ExpirationQueue.new MapMakerInternalMap.AbstractReferenceEntry() {...} |  | 0% | | n/a | 7 | 7 | 11 | 11 | 7 | 7 | 1 | 1 |
Interners.InternerFunction |  | 0% | | 0% | 5 | 5 | 9 | 9 | 4 | 4 | 1 | 1 |
MapMakerInternalMap.Values |  | 0% | | n/a | 6 | 6 | 7 | 7 | 6 | 6 | 1 | 1 |
WellBehavedMap.EntrySet.1.new AbstractMapEntry() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ForwardingListIterator |  | 0% | | n/a | 7 | 7 | 9 | 9 | 7 | 7 | 1 | 1 |
ImmutableRangeMap.new ImmutableRangeMap() {...} |  | 0% | | 0% | 3 | 3 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableEnumMap.2.new UnmodifiableIterator() {...} |  | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
ArrayTable.Column |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
RegularImmutableSortedMap.EntrySet.new ImmutableAsList() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
DenseImmutableTable.Row |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
ForwardingConcurrentMap |  | 0% | | n/a | 5 | 5 | 5 | 5 | 5 | 5 | 1 | 1 |
DenseImmutableTable.Column |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
EmptyImmutableBiMap |  | 0% | | n/a | 11 | 11 | 11 | 11 | 11 | 11 | 1 | 1 |
Iterators.new AbstractIterator() {...} |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.WeakEvictableEntry |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
Multimaps.UnmodifiableSetMultimap |  | 0% | | n/a | 6 | 6 | 7 | 7 | 6 | 6 | 1 | 1 |
ImmutableSortedMapFauxverideShim |  | 0% | | n/a | 7 | 7 | 7 | 7 | 7 | 7 | 1 | 1 |
RegularImmutableBiMap.new ImmutableMapEntrySet() {...} |  | 0% | | n/a | 6 | 6 | 6 | 6 | 6 | 6 | 1 | 1 |
RegularImmutableBiMap.NonTerminalBiMapEntry |  | 0% | | n/a | 4 | 4 | 10 | 10 | 4 | 4 | 1 | 1 |
TreeMultiset.new Multisets.AbstractEntry() {...} |  | 0% | | 0% | 4 | 4 | 6 | 6 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.SoftEvictableEntry |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
MapMakerInternalMap.EvictionQueue.new MapMakerInternalMap.AbstractReferenceEntry() {...} |  | 0% | | n/a | 5 | 5 | 9 | 9 | 5 | 5 | 1 | 1 |
Multimaps.UnmodifiableSortedSetMultimap |  | 0% | | n/a | 6 | 6 | 7 | 7 | 6 | 6 | 1 | 1 |
ArrayTable.RowMap |  | 0% | | n/a | 5 | 5 | 7 | 7 | 5 | 5 | 1 | 1 |
ArrayTable.ColumnMap |  | 0% | | n/a | 5 | 5 | 7 | 7 | 5 | 5 | 1 | 1 |
Iterators.new UnmodifiableIterator() {...} |  | 0% |  | 0% | 5 | 5 | 6 | 6 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.SoftValueReference |  | 0% | | n/a | 6 | 6 | 9 | 9 | 6 | 6 | 1 | 1 |
MapConstraints.ConstrainedSortedSetMultimap |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
MapMakerInternalMap.StrongEvictableEntry |  | 0% | | n/a | 5 | 5 | 10 | 10 | 5 | 5 | 1 | 1 |
MapMakerInternalMap.WeakValueReference |  | 0% | | n/a | 6 | 6 | 9 | 9 | 6 | 6 | 1 | 1 |
ImmutableRangeSet.SerializedForm |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 2 | 2 | 1 | 1 |
ComparisonChain.InactiveComparisonChain |  | 0% | | n/a | 10 | 10 | 12 | 12 | 10 | 10 | 1 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} |  | 19% | | n/a | 2 | 3 | 5 | 6 | 2 | 3 | 0 | 1 |
MapConstraints.ConstrainedSetMultimap |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
Maps.UnmodifiableEntries |  | 0% | | n/a | 5 | 5 | 8 | 8 | 5 | 5 | 1 | 1 |
TreeRangeMap.SubRangeMap.SubRangeMapAsMap.new Maps.KeySet() {...} |  | 0% | | 0% | 4 | 4 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.FilteredEntryMap.EntrySet.1.new ForwardingMapEntry() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
RegularContiguousSet.new AbstractSequentialIterator() {...} |  | 0% | | 0% | 3 | 3 | 3 | 3 | 2 | 2 | 1 | 1 |
RegularContiguousSet.new AbstractSequentialIterator() {...} |  | 0% | | 0% | 3 | 3 | 3 | 3 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
Multimaps.MapMultimap.new Sets.ImprovedAbstractSet() {...} |  | 0% | | 0% | 4 | 4 | 3 | 3 | 3 | 3 | 1 | 1 |
ImmutableEnumMap.new ImmutableSet() {...} |  | 0% | | n/a | 5 | 5 | 5 | 5 | 5 | 5 | 1 | 1 |
RegularImmutableBiMap.Inverse.InverseEntrySet |  | 0% | | n/a | 6 | 6 | 6 | 6 | 6 | 6 | 1 | 1 |
FilteredKeyListMultimap |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
ImmutableMap.MapViewOfValuesAsSingletonSets.1.new UnmodifiableIterator() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
LinkedListMultimap.new AbstractSequentialList() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
TreeRangeMap.SubRangeMap.SubRangeMapAsMap.new Maps.Values() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.EntryFunction |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
TreeMultiset.Aggregate |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
StandardRowSortedTable |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
MapConstraints.ConstrainedAsMapValues.new Iterator() {...} |  | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
Iterables.new FluentIterable() {...} |  | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} |  | 20% | | n/a | 2 | 3 | 5 | 6 | 2 | 3 | 0 | 1 |
Maps.new AbstractMapEntry() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
AbstractTable.Values |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
ForwardingSetMultimap |  | 0% | | n/a | 5 | 5 | 5 | 5 | 5 | 5 | 1 | 1 |
RegularImmutableBiMap.Inverse.InverseEntrySet.new ImmutableAsList() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
AbstractMultimap.Values |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
ForwardingSortedSetMultimap |  | 0% | | n/a | 5 | 5 | 5 | 5 | 5 | 5 | 1 | 1 |
MapConstraints.new ForwardingMapEntry() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
LinkedListMultimap.Node |  | 0% | | n/a | 4 | 4 | 9 | 9 | 4 | 4 | 1 | 1 |
Maps.FilteredEntryMap |  | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
MapConstraints.NotNullMapConstraint |  | 0% | | n/a | 3 | 3 | 6 | 6 | 3 | 3 | 1 | 1 |
Maps.SortedMapDifferenceImpl |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
Synchronized.SynchronizedAsMapEntries.1.new ForwardingMapEntry() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Synchronized.SynchronizedAsMapEntries.new ForwardingIterator() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
MultimapBuilder.LinkedListSupplier |  | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
Multimaps.UnmodifiableListMultimap |  | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
DenseImmutableTable.RowMap |  | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
MapConstraints.new ForwardingMapEntry() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
DenseImmutableTable.ColumnMap |  | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
AllEqualOrdering |  | 0% | | n/a | 8 | 8 | 8 | 8 | 8 | 8 | 1 | 1 |
TransformedIterator |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
Tables.UnmodifiableRowSortedMap |  | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} |  | 22% | | n/a | 2 | 3 | 4 | 5 | 2 | 3 | 0 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} |  | 22% | | n/a | 2 | 3 | 4 | 5 | 2 | 3 | 0 | 1 |
MapConstraints.ConstrainedEntries.new ForwardingIterator() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
RegularImmutableMap.EntrySet |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ComputingConcurrentHashMap.ComputationExceptionReference |  | 0% | | n/a | 7 | 7 | 9 | 9 | 7 | 7 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys.new MultimapBuilder.SetMultimapBuilder() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
MapConstraints.ConstrainedAsMapEntries.new ForwardingIterator() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
NaturalOrdering |  | 0% | | n/a | 5 | 5 | 7 | 7 | 5 | 5 | 1 | 1 |
Lists.CharSequenceAsList |  | 0% | | n/a | 3 | 3 | 6 | 6 | 3 | 3 | 1 | 1 |
ImmutableMap.MapViewOfValuesAsSingletonSets.new ImmutableMapEntrySet() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
Iterables.new FluentIterable() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
MapConstraints.ConstrainedListMultimap |  | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
StandardTable.Row.RowEntrySet.1.new ForwardingMapEntry() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
Tables.ImmutableCell |  | 0% | | n/a | 4 | 4 | 8 | 8 | 4 | 4 | 1 | 1 |
RegularImmutableMap.NonTerminalMapEntry |  | 0% | | n/a | 4 | 4 | 8 | 8 | 4 | 4 | 1 | 1 |
ImmutableSortedSet.SerializedForm |  | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
FilteredEntryMultimap.Keys.1.new Predicate() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.TransformedEntriesMap.new Maps.EntrySet() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Synchronized.SynchronizedAsMapValues.new ForwardingIterator() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} |  | 24% | | n/a | 2 | 3 | 4 | 5 | 2 | 3 | 0 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} |  | 24% | | n/a | 2 | 3 | 4 | 5 | 2 | 3 | 0 | 1 |
MapMakerInternalMap.EvictionQueue.new AbstractSequentialIterator() {...} |  | 0% | | 0% | 3 | 3 | 3 | 3 | 2 | 2 | 1 | 1 |
ForwardingListMultimap |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
MapMakerInternalMap.ExpirationQueue.new AbstractSequentialIterator() {...} |  | 0% | | 0% | 3 | 3 | 3 | 3 | 2 | 2 | 1 | 1 |
ComputingConcurrentHashMap.ComputedReference |  | 0% | | n/a | 7 | 7 | 9 | 9 | 7 | 7 | 1 | 1 |
Interners.new Interner() {...} |  | 0% | | 0% | 3 | 3 | 3 | 3 | 2 | 2 | 1 | 1 |
DescendingMultiset.new Multisets.EntrySet() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ImmutableMapKeySet.new ImmutableAsList() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Iterators.new UnmodifiableIterator() {...} |  | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
Maps.FilteredEntryMap.EntrySet |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Iterators.new AbstractIndexedListIterator() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys.new MultimapBuilder.SortedSetMultimapBuilder() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys.new MultimapBuilder.SetMultimapBuilder() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys.new MultimapBuilder.SetMultimapBuilder() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys.new MultimapBuilder.ListMultimapBuilder() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Sets.CartesianSet.new ImmutableList() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
TreeRangeMap.AsMapOfRanges.new AbstractSet() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Multisets.ImmutableEntry |  | 0% | | n/a | 3 | 3 | 7 | 7 | 3 | 3 | 1 | 1 |
ImmutableEntry |  | 0% | | n/a | 4 | 4 | 7 | 7 | 4 | 4 | 1 | 1 |
Iterators.new UnmodifiableListIterator() {...} |  | 0% | | n/a | 7 | 7 | 7 | 7 | 7 | 7 | 1 | 1 |
Multimaps.Keys.1.new Multisets.AbstractEntry() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.UnmodifiableEntries.new UnmodifiableIterator() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
ImmutableMapValues.new ImmutableAsList() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
ImmutableMap.MapViewOfValuesAsSingletonSets.1.1.new AbstractMapEntry() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
RegularImmutableSortedMap.EntrySet |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ImmutableRangeSet.AsSetSerializedForm |  | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
ImmutableSortedMap.SerializedForm |  | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
Tables.TransformedTable.new Function() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
TreeRangeSet.AsRanges |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
MapConstraints.ConstrainedMultimap.new Constraint() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
WellBehavedMap.EntrySet |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
LinkedListMultimap.KeyList |  | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 | 1 | 1 |
LinkedListMultimap.3.new TransformedListIterator() {...} |  | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
Interners |  | 22% | | n/a | 2 | 3 | 3 | 4 | 2 | 3 | 0 | 1 |
DiscreteDomain |  | 0% | | n/a | 6 | 6 | 6 | 6 | 6 | 6 | 1 | 1 |
LinkedListMultimap.new AbstractSequentialList() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Ordering.ArbitraryOrdering.new Function() {...} |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
Maps.AsMapView.new Maps.EntrySet() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
AbstractMultiset.EntrySet |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
Iterators.MergingIterator.new Comparator() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
RegularContiguousSet.SerializedForm |  | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
RegularImmutableTable.Values |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
AbstractSortedMultiset.new DescendingMultiset() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
TreeTraverser.new FluentIterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.new ForwardingSet() {...} |  | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ComparisonChain |  | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
BinaryTreeTraverser.new FluentIterable() {...} |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Range.new Ordering() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ImmutableMultimap.FieldSettersHolder | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
StandardTable.TableSet | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
MapConstraints.2.new Constraint() {...} | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
SortedMultisets | | 0% |  | 0% | 4 | 4 | 4 | 4 | 2 | 2 | 1 | 1 |
ArrayTable.ArrayMap.new Maps.EntrySet() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
TreeMultiset.Aggregate.new TreeMultiset.Aggregate() {...} | | 0% | | 0% | 4 | 4 | 3 | 3 | 3 | 3 | 1 | 1 |
TreeMultiset.Aggregate.new TreeMultiset.Aggregate() {...} | | 0% | | 0% | 4 | 4 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.new UnmodifiableIterator() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractSortedKeySortedSetMultimap | | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
FilteredEntryMultimap.ValuePredicate | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
Iterables.UnmodifiableIterable | | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
AbstractMultimap.EntrySet | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
ImmutableMapEntry | | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
SortedLists.KeyPresentBehavior.new SortedLists.KeyPresentBehavior() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
SortedLists.KeyPresentBehavior.new SortedLists.KeyPresentBehavior() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Sets.PowerSet.new AbstractIndexedListIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
HashBiMap.Inverse.1.new HashBiMap.Itr() {...} | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
ForwardingIterator | | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
MapMaker.RemovalNotification | | 0% | | n/a | 3 | 3 | 5 | 5 | 3 | 3 | 1 | 1 |
RegularImmutableTable.CellSet.new ImmutableAsList() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
TreeTraverser.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
TreeTraverser.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Synchronized.SynchronizedAsMapValues | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
TreeMultiset.Reference | | 0% | | 0% | 3 | 3 | 5 | 5 | 2 | 2 | 1 | 1 |
UsingToStringOrdering | | 0% | | n/a | 4 | 4 | 4 | 4 | 4 | 4 | 1 | 1 |
ImmutableMultiset.EntrySet.new ImmutableAsList() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.FilteredEntryBiMap.new Predicate() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Ordering.IncomparableValueException | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
MultimapBuilder.LinkedHashSetSupplier | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
Iterables.ConsumingQueueIterator | | 0% | | n/a | 2 | 2 | 6 | 6 | 2 | 2 | 1 | 1 |
HashBiMap.EntrySet.new HashBiMap.Itr() {...} | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
Iterators.new Enumeration() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Iterators.new UnmodifiableIterator() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
MultimapBuilder.HashSetSupplier | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ForwardingNavigableMap.StandardDescendingMap | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Collections2.new Function() {...} | | 0% | | 0% | 3 | 3 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.ArrayListSupplier | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MapConstraints.InverseConstraint | | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
DenseImmutableTable.ImmutableArrayMap.new ImmutableMapEntrySet() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
ImmutableEnumMap.new ImmutableMapEntrySet() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Iterators.new UnmodifiableIterator() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
HashBiMap.Inverse.new Maps.EntrySet() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
HashBiMap.EntrySet | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
FilteredKeySetMultimap.EntrySet | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.new AbstractMapEntry() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
BinaryTreeTraverser.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ImmutableEnumSet.EnumSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MultimapBuilder.TreeSetSupplier | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
AbstractNavigableMap.DescendingMap | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Lists.TransformingRandomAccessList.new TransformedListIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ArrayTable.new AbstractIndexedListIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ArrayTable.ArrayMap.1.new AbstractIndexedListIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ImmutableMapEntry.TerminalEntry | | 0% | | n/a | 4 | 4 | 6 | 6 | 4 | 4 | 1 | 1 |
ImmutableList.new AbstractIndexedListIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.DescendingMap.new Maps.EntrySet() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Multimaps.Keys.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractNavigableMap.new Maps.EntrySet() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
StandardTable.ColumnMap.ColumnMapEntrySet.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Sets.ImprovedAbstractSet | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
EmptyImmutableSetMultimap | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
ImmutableEnumMap.EnumSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
WellBehavedMap.EntrySet.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.FilteredEntryMap.EntrySet.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Multisets.FilteredMultiset.new Predicate() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Multimaps.AsMap.EntrySet.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractMultimap.Entries | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
StandardTable.RowMap.EntrySet.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Lists.TransformingSequentialList.new TransformedListIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ImmutableBiMap.SerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableMultimap.new ImmutableMultimap.Itr() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
TreeTraverser.PostOrderNode | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
TreeBasedTable.Factory | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MultimapBuilder.EnumSetSupplier | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MultimapBuilder.MultimapBuilderWithKeys.new MultimapBuilder.ListMultimapBuilder() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.new MultimapBuilder.MultimapBuilderWithKeys() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.new MultimapBuilder.MultimapBuilderWithKeys() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.new MultimapBuilder.MultimapBuilderWithKeys() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.new MultimapBuilder.MultimapBuilderWithKeys() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Tables.TransformedTable.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Tables.TransformedTable.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
EmptyImmutableListMultimap | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
Multimaps.TransformedEntriesMultimap.new Maps.EntryTransformer() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterators.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterators.new Iterator() {...} | | 0% | | n/a | 4 | 4 | 5 | 5 | 4 | 4 | 1 | 1 |
EmptyContiguousSet.SerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MapConstraints.ConstrainedEntrySet | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
HashBiMap.Inverse.InverseKeySet.new HashBiMap.Itr() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Sets.FilteredSet | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
Maps.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Tables.TransposeTable.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
HashBiMap.BiEntry | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
UnmodifiableListIterator | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
Maps.UnmodifiableEntrySet | | 0% | | n/a | 3 | 3 | 4 | 4 | 3 | 3 | 1 | 1 |
MapMakerInternalMap.KeyIterator | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractMapBasedMultimap.new AbstractMapBasedMultimap.Itr() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.new Maps.EntryTransformer() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
FluentIterable.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new FluentIterable() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.ValueIterator | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
HashBiMap.KeySet.new HashBiMap.Itr() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.Strength.new MapMakerInternalMap.Strength() {...} | | 37% | | n/a | 2 | 3 | 2 | 3 | 2 | 3 | 0 | 1 |
MapMakerInternalMap.new MapMakerInternalMap.ValueReference() {...} | | 28% | | n/a | 5 | 7 | 5 | 7 | 5 | 7 | 0 | 1 |
ImmutableMultimap.new ImmutableMultimap.Itr() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Multisets.ElementSet.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
HashBasedTable.Factory | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableSet.SerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
HashBiMap.InverseSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
SortedLists.KeyAbsentBehavior.new SortedLists.KeyAbsentBehavior() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
SortedLists.KeyAbsentBehavior.new SortedLists.KeyAbsentBehavior() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractMapBasedMultimap.RandomAccessWrappedList | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
ImmutableAsList.SerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableMapValues.SerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.EntryIterator | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
RegularImmutableBiMap.InverseSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableMapEntrySet.EntrySetSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableMultiset.EntrySetSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
TreeBasedTable.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractTable.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ImmutableMapKeySet.KeySetSerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
ImmutableList.SerializedForm | | 0% | | n/a | 2 | 2 | 4 | 4 | 2 | 2 | 1 | 1 |
MinMaxPriorityQueue.MoveDesc | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
AbstractMultiset.ElementSet | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Multimaps.UnmodifiableMultimap.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ForwardingSortedMultiset.StandardDescendingMultiset | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Multisets.new Ordering() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Sets.SetView | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
MultimapBuilder.SetMultimapBuilder | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
AbstractMapBasedMultimap.new AbstractMapBasedMultimap.Itr() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ForwardingMap.StandardEntrySet | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ForwardingMultiset.StandardElementSet | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Lists.new Lists.RandomAccessListWrapper() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Lists.new Lists.AbstractListWrapper() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.ListMultimapBuilder | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.EntryFunction.new Maps.EntryFunction() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Maps.EntryFunction.new Maps.EntryFunction() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.StrongValueReference | | 57% | | n/a | 4 | 7 | 4 | 9 | 4 | 7 | 0 | 1 |
MapMakerInternalMap.Strength.new MapMakerInternalMap.Strength() {...} | | 50% | | n/a | 1 | 3 | 1 | 3 | 1 | 3 | 0 | 1 |
ImmutableMultimap.BuilderMultimap | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
SortedLists.KeyPresentBehavior.new SortedLists.KeyPresentBehavior() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
BoundType.new BoundType() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
BoundType.new BoundType() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ImmutableSetMultimap.BuilderMultimap | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
MapMaker.RemovalCause.new MapMaker.RemovalCause() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMaker.RemovalCause.new MapMaker.RemovalCause() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMaker.RemovalCause.new MapMaker.RemovalCause() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMaker.RemovalCause.new MapMaker.RemovalCause() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MapMaker.RemovalCause.new MapMaker.RemovalCause() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
SortedLists.KeyAbsentBehavior.new SortedLists.KeyAbsentBehavior() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MultimapBuilder.SortedSetMultimapBuilder | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
MutableClassToInstanceMap.new MapConstraint() {...} | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} | | 46% | | n/a | 1 | 2 | 1 | 2 | 1 | 2 | 0 | 1 |
ForwardingMap.StandardKeySet | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
ForwardingObject | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new TransformedIterator() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ForwardingSortedMap.StandardKeySet | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
ForwardingSortedMultiset.StandardElementSet | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
ForwardingMap.StandardValues | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
ForwardingNavigableMap.StandardNavigableKeySet | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
UnmodifiableIterator | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
ForwardingNavigableSet.StandardDescendingSet | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
Range.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Range.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Tables.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Iterables.new Function() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
Synchronized.SynchronizedRandomAccessList | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
ConcurrentHashMultiset.FieldSettersHolder | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Ordering.ArbitraryOrderingHolder | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Lists.RandomAccessPartition | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
Constraints.ConstrainedRandomAccessList | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
MapMakerInternalMap.new AbstractQueue() {...} | | 69% | | n/a | 2 | 6 | 2 | 6 | 2 | 6 | 0 | 1 |
ComputationException | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
Lists.RandomAccessReverseList | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
Lists.RandomAccessListWrapper | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |
FluentIterable.FromIterableFunction | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Interners.WeakInterner |  | 97% |  | 66% | 2 | 5 | 1 | 12 | 0 | 2 | 0 | 1 |
GenericMapMaker.NullListener | | 93% | | n/a | 1 | 2 | 1 | 3 | 1 | 2 | 0 | 1 |
MapMakerInternalMap.Strength |  | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 | 0 | 1 |
MapMakerInternalMap.EntryFactory.new MapMakerInternalMap.EntryFactory() {...} | | 100% | | n/a | 0 | 2 | 0 | 2 | 0 | 2 | 0 | 1 |
Interners.WeakInterner.Dummy | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |
MapMakerInternalMap.Strength.new MapMakerInternalMap.Strength() {...} | | 100% | | n/a | 0 | 3 | 0 | 3 | 0 | 3 | 0 | 1 |
GenericMapMaker | | 100% | | n/a | 0 | 2 | 0 | 2 | 0 | 2 | 0 | 1 |