Source file "org/apache/commons/collections/bidimap/TreeBidiMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,940 of 1,940 | 0% | 256 of 256 | 0% | 194 | 194 | 467 | 467 | 66 | 66 |
| swapPosition(TreeBidiMap.Node, TreeBidiMap.Node, int) | | 0% | | 0% | 19 | 19 | 56 | 56 | 1 | 1 |
| doRedBlackDeleteFixup(TreeBidiMap.Node, int) | | 0% | | 0% | 12 | 12 | 47 | 47 | 1 | 1 |
| doRedBlackInsert(TreeBidiMap.Node, int) | | 0% | | 0% | 11 | 11 | 36 | 36 | 1 | 1 |
| doPut(Comparable, Comparable, int) | | 0% | | 0% | 7 | 7 | 37 | 37 | 1 | 1 |
| doRedBlackDelete(TreeBidiMap.Node) | | 0% | | 0% | 13 | 13 | 31 | 31 | 1 | 1 |
| insertValue(TreeBidiMap.Node) | | 0% | | 0% | 5 | 5 | 21 | 21 | 1 | 1 |
| doToString(int) | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| rotateLeft(TreeBidiMap.Node, int) | | 0% | | 0% | 4 | 4 | 14 | 14 | 1 | 1 |
| rotateRight(TreeBidiMap.Node, int) | | 0% | | 0% | 4 | 4 | 14 | 14 | 1 | 1 |
| doEquals(Object, int) | | 0% | | 0% | 7 | 7 | 20 | 20 | 1 | 1 |
| nextGreater(TreeBidiMap.Node, int) | | 0% | | 0% | 5 | 5 | 14 | 14 | 1 | 1 |
| nextSmaller(TreeBidiMap.Node, int) | | 0% | | 0% | 5 | 5 | 14 | 14 | 1 | 1 |
| checkNonNullComparable(Object, int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| lookup(Comparable, int) | | 0% | | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| doHashCode(int) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| isLeftChild(TreeBidiMap.Node, int) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| isRightChild(TreeBidiMap.Node, int) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| putAll(Map) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| TreeBidiMap(Map) | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| doRemove(Comparable, int) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| nextKey(Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| previousKey(Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| doGet(Comparable, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| TreeBidiMap() | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| clear() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| firstKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| leastNode(TreeBidiMap.Node, int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| greatestNode(TreeBidiMap.Node, int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 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 |
| copyColor(TreeBidiMap.Node, TreeBidiMap.Node, int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| containsKey(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| containsValue(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| inverseOrderedBidiMap() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| static {...} | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| mapIterator() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| orderedMapIterator() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| grow() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| shrink() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| put(Object, Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| isRed(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isBlack(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getParent(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getRightChild(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| getLeftChild(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| modify() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| get(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| remove(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getKey(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| removeValue(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| makeRed(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| makeBlack(TreeBidiMap.Node, int) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getGrandParent(TreeBidiMap.Node, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| equals(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| checkKeyAndValue(Object, Object) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| hashCode() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| toString() | | 0% | n/a | 1 | 1 | 1 | 1 | 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 | |
| inverseBidiMap() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |