| equals(Object) |  | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| setValue(Comparable) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getData(TreeBidiMap.DataElement) |  | 73% | | 66% | 1 | 3 | 1 | 4 | 0 | 1 |
| isRightChild(TreeBidiMap.DataElement) | | 90% | | 50% | 2 | 3 | 0 | 2 | 0 | 1 |
| swapColors(TreeBidiMap.Node, TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| TreeBidiMap.Node(Comparable, Comparable) | | 100% | | n/a | 0 | 1 | 0 | 9 | 0 | 1 |
| isLeftChild(TreeBidiMap.DataElement) | | 100% | | 75% | 1 | 3 | 0 | 2 | 0 | 1 |
| hashCode() | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| copyColor(TreeBidiMap.Node, TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| isRed(TreeBidiMap.DataElement) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| setBlack(TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setLeft(TreeBidiMap.Node, TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setParent(TreeBidiMap.Node, TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setRed(TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| setRight(TreeBidiMap.Node, TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| getLeft(TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getParent(TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getRight(TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isBlack(TreeBidiMap.DataElement) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getKey() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getValue() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |