| 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 |
| entrySet() |  | 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 |
| containsKey(Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| containsValue(Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| get(Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getKey(Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| hashCode() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| remove(Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeValue(Object) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toString() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| clear() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| isEmpty() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| size() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| inverseBidiMap() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| TreeBidiMap.Inverse(TreeBidiMap) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |