Source file "org/apache/commons/collections/DoubleOrderedMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,710 of 1,710 | 0% | 204 of 204 | 0% | 152 | 152 | 354 | 354 | 50 | 50 |
| swapPosition(DoubleOrderedMap.Node, DoubleOrderedMap.Node, int) | | 0% | | 0% | 19 | 19 | 50 | 50 | 1 | 1 |
| doRedBlackDeleteFixup(DoubleOrderedMap.Node, int) | | 0% | | 0% | 12 | 12 | 45 | 45 | 1 | 1 |
| doRedBlackInsert(DoubleOrderedMap.Node, int) | | 0% | | 0% | 11 | 11 | 34 | 34 | 1 | 1 |
| doRedBlackDelete(DoubleOrderedMap.Node) | | 0% | | 0% | 13 | 13 | 27 | 27 | 1 | 1 |
| put(Object, Object) | | 0% | | 0% | 6 | 6 | 32 | 32 | 1 | 1 |
| insertValue(DoubleOrderedMap.Node) | | 0% | | 0% | 5 | 5 | 19 | 19 | 1 | 1 |
| rotateLeft(DoubleOrderedMap.Node, int) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| rotateRight(DoubleOrderedMap.Node, int) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| DoubleOrderedMap(Map) | | 0% | n/a | 1 | 1 | 9 | 9 | 1 | 1 | |
| DoubleOrderedMap() | | 0% | n/a | 1 | 1 | 8 | 8 | 1 | 1 | |
| nextGreater(DoubleOrderedMap.Node, int) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| checkNonNullComparable(Object, int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| lookup(Comparable, int) | | 0% | | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| isLeftChild(DoubleOrderedMap.Node, int) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| isRightChild(DoubleOrderedMap.Node, int) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| doRemove(Comparable, int) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| entrySetByValue() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| keySetByValue() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| valuesByValue() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| doGet(Comparable, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| keySet() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| entrySet() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| clear() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| leastNode(DoubleOrderedMap.Node, int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| copyColor(DoubleOrderedMap.Node, DoubleOrderedMap.Node, int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| containsKey(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| containsValue(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| static {...} | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| grow() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| shrink() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| isRed(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isBlack(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getParent(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getRightChild(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getLeftChild(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| modify() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| getKeyForValue(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| removeValue(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| makeRed(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| makeBlack(DoubleOrderedMap.Node, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getGrandParent(DoubleOrderedMap.Node, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| get(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| remove(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| checkKeyAndValue(Object, Object) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| oppositeIndex(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| compare(Comparable, Comparable) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| checkKey(Object) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| checkValue(Object) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| size() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |