| _updateValueOfKey(SortedAssociationImpl.Node, Class, Class, ArrayItemAccess, ArrayItemAccess, Comparator, Object, Object, boolean, int) |   | 88% | | 85% | 7 | 32 | 12 | 108 | 0 | 1 |
| _recursiveEquals(SortedAssociationImpl.Node, SortedAssociationImpl.Node, Class, Class, Comparator) | | 73% | | 55% | 7 | 11 | 4 | 15 | 0 | 1 |
| _findValueOfKey(SortedAssociationImpl.Node, ArrayItemAccess, ArrayItemAccess, Comparator, Object) | | 89% | | 84% | 3 | 14 | 1 | 24 | 0 | 1 |
| equals(Object) | | 88% | | 56% | 7 | 9 | 3 | 14 | 0 | 1 |
| _exhaustiveEquals(SortedAssociationImpl, SortedAssociationImpl) | | 97% | | 66% | 4 | 7 | 0 | 10 | 0 | 1 |
| _removeKey(SortedAssociationImpl.Node, Class, Class, ArrayItemAccess, ArrayItemAccess, Comparator, Object) | | 100% | | 100% | 0 | 14 | 0 | 56 | 0 | 1 |
| _balance(SortedAssociationImpl.Node) | | 100% | | 90% | 2 | 12 | 0 | 30 | 0 | 1 |
| put(Object, Object) | | 100% | | 100% | 0 | 6 | 0 | 14 | 0 | 1 |
| putIfAbsent(Object, Object) | | 100% | | 100% | 0 | 6 | 0 | 14 | 0 | 1 |
| toString() | | 100% | | 100% | 0 | 4 | 0 | 25 | 0 | 1 |
| hashCode() | | 100% | | 100% | 0 | 3 | 0 | 11 | 0 | 1 |
| remove(Object) | | 100% | | 100% | 0 | 5 | 0 | 10 | 0 | 1 |
| containsKey(Object) | | 100% | | 100% | 0 | 4 | 0 | 6 | 0 | 1 |
| get(Object) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
| _findRightMostElement(SortedAssociationImpl.Node, Class, Class) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| SortedAssociationImpl(Class, Class, Comparator, SortedAssociationImpl.Node) | | 100% | | n/a | 0 | 1 | 0 | 9 | 0 | 1 |
| _populateValues(SortedAssociationImpl.Node, ArrayItemAccess, List) | | 100% | | 100% | 0 | 3 | 0 | 8 | 0 | 1 |
| _findLeftMostElement(SortedAssociationImpl.Node, Class, Class) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| _createSingleEntryNode(Class, Class, Object, Object) | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| values() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| keySet() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| withNewRoot(SortedAssociationImpl.Node) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| clear() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| spliterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| BASE_ENTRIES_PER_NODE(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| SortedAssociationImpl(Class, Class, Comparator) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| _balanceNullable(SortedAssociationImpl.Node) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| iterator() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| keyType() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| valueType() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isLinked() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isSorted() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |