| putAll(Map) |  | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| firstKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| nextKey(Comparable) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| previousKey(Comparable) | | 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 |
| mapIterator() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| put(Comparable, Comparable) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| equals(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| hashCode() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toString() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| entrySet() |  | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| TreeBidiMap.Inverse(TreeBidiMap) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| containsKey(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| containsValue(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| get(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getKey(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| remove(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| removeValue(Object) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| clear() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| isEmpty() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| inverseBidiMap() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |