MinMaxPriorityQueue

Element	Missed Instructions	Cov.	Missed Branches	Cov.	Missed	Cxty	Missed	Lines	Missed	Methods
Total	535 of 535	0%	53 of 53	0%	62	62	108	108	35	35
removeAt(int)		0%		0%	5	5	19	19	1	1
MinMaxPriorityQueue(MinMaxPriorityQueue.Builder, int)		0%		n/a	1	1	9	9	1	1
offer(Object)		0%		0%	3	3	6	6	1	1
fillHole(int, Object)		0%		0%	3	3	6	6	1	1
isEvenLevel(int)		0%		0%	3	3	3	3	1	1
growIfNeeded()		0%		0%	2	2	6	6	1	1
calculateNewCapacity()		0%		0%	2	2	4	4	1	1
initialQueueSize(int, int, Iterable)		0%		0%	3	3	8	8	1	1
addAll(Collection)		0%		0%	2	2	5	5	1	1
isIntact()		0%		0%	3	3	4	4	1	1
getMaxElementIndex()		0%		0%	4	4	4	4	1	1
clear()		0%		0%	2	2	4	4	1	1
toArray()		0%		n/a	1	1	3	3	1	1
removeLast()		0%		0%	2	2	3	3	1	1
pollLast()		0%		0%	2	2	1	1	1	1
peekLast()		0%		0%	2	2	1	1	1	1
removeAndGet(int)		0%		n/a	1	1	3	3	1	1
poll()		0%		0%	2	2	1	1	1	1
peek()		0%		0%	2	2	1	1	1	1
heapForIndex(int)		0%		0%	2	2	1	1	1	1
create(Iterable)		0%		n/a	1	1	1	1	1	1
expectedSize(int)		0%		n/a	1	1	1	1	1	1
maximumSize(int)		0%		n/a	1	1	1	1	1	1
capAtMaximumSize(int, int)		0%		n/a	1	1	1	1	1	1
create()		0%		n/a	1	1	1	1	1	1
orderedBy(Comparator)		0%		n/a	1	1	1	1	1	1
add(Object)		0%		n/a	1	1	2	2	1	1
iterator()		0%		n/a	1	1	1	1	1	1
elementData(int)		0%		n/a	1	1	1	1	1	1
comparator()		0%		n/a	1	1	1	1	1	1
capacity()		0%		n/a	1	1	1	1	1	1
size()		0%		n/a	1	1	1	1	1	1
pollFirst()		0%		n/a	1	1	1	1	1	1
removeFirst()		0%		n/a	1	1	1	1	1	1
peekFirst()		0%		n/a	1	1	1	1	1	1