| removeInternal(LinkedTreeMap.Node, boolean) |  | 0% | | 0% | 9 | 9 | 37 | 37 | 1 | 1 |
| findByEntry(Map.Entry) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| find(Object, boolean) |  | 83% | | 77% | 5 | 12 | 2 | 31 | 0 | 1 |
| clear() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| rebalance(LinkedTreeMap.Node, boolean) | | 89% | | 70% | 14 | 28 | 1 | 41 | 0 | 1 |
| entrySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| keySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| put(Object, Object) | | 56% | | 33% | 3 | 4 | 2 | 8 | 0 | 1 |
| findByObject(Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| removeInternalByKey(Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| get(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| remove(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| containsKey(Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| LinkedTreeMap() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| writeReplace() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| replaceInParent(LinkedTreeMap.Node, LinkedTreeMap.Node) | | 89% | | 70% | 3 | 6 | 0 | 11 | 0 | 1 |
| equal(Object, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 83% | | 50% | 1 | 2 | 0 | 2 | 0 | 1 |
| LinkedTreeMap(Comparator, boolean) | | 96% | | 50% | 1 | 2 | 0 | 7 | 0 | 1 |
| rotateLeft(LinkedTreeMap.Node) | | 100% | | 100% | 0 | 5 | 0 | 14 | 0 | 1 |
| rotateRight(LinkedTreeMap.Node) | | 100% | | 100% | 0 | 5 | 0 | 14 | 0 | 1 |
| LinkedTreeMap(boolean) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |