Source file "com/google/common/collect/MinMaxPriorityQueue.java" was not found during generation of report.
Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
Total | 462 of 462 | 0% | 64 of 64 | 0% | 49 | 49 | 97 | 97 | 17 | 17 |
crossOverUp(int, Object) | ![]() | 0% | ![]() | 0% | 7 | 7 | 19 | 19 | 1 | 1 |
swapWithConceptuallyLastElement(Object) | ![]() | 0% | ![]() | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
verifyIndex(int) | ![]() | 0% | ![]() | 0% | 9 | 9 | 9 | 9 | 1 | 1 |
findMin(int, int) | ![]() | 0% | ![]() | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
tryCrossOverAndBubbleUp(int, int, Object) | ![]() | 0% | ![]() | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
crossOver(int, Object) | ![]() | 0% | ![]() | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
bubbleUpAlternatingLevels(int, Object) | ![]() | 0% | ![]() | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
bubbleUp(int, Object) | ![]() | 0% | ![]() | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
fillHoleAt(int) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
findMinGrandChild(int) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
compareElements(int, int) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
MinMaxPriorityQueue.Heap(MinMaxPriorityQueue, Ordering) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
findMinChild(int) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
getLeftChildIndex(int) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
getRightChildIndex(int) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
getParentIndex(int) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
getGrandparentIndex(int) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |