| DualTreeBidiMap(Map) |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| nextKey(Object) |  | 83% | | 83% | 1 | 4 | 1 | 10 | 0 | 1 |
| previousKey(Object) | | 80% | | 83% | 1 | 4 | 1 | 9 | 0 | 1 |
| inverseOrderedBidiMap() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| inverseSortedBidiMap() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| readObject(ObjectInputStream) | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| DualTreeBidiMap(Comparator, Comparator) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| DualTreeBidiMap(Map, Map, BidiMap) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| DualTreeBidiMap() | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| subMap(Object, Object) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| headMap(Object) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| tailMap(Object) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| createBidiMap(Map, Map, BidiMap) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| writeObject(ObjectOutputStream) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| comparator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| firstKey() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lastKey() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| mapIterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| valueComparator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| inverseBidiMap() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |