| setCount(Comparator, Object, int, int, int[]) |  | 0% | | 0% | 21 | 21 | 38 | 38 | 1 | 1 |
| setCount(Comparator, Object, int, int[]) | | 0% | | 0% | 16 | 16 | 31 | 31 | 1 | 1 |
| remove(Comparator, Object, int, int[]) | | 0% | | 0% | 11 | 11 | 33 | 33 | 1 | 1 |
| add(Comparator, Object, int, int[]) | | 0% | | 0% | 10 | 10 | 29 | 29 | 1 | 1 |
| deleteMe() | | 0% | | 0% | 4 | 4 | 20 | 20 | 1 | 1 |
| rebalance() | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| ceiling(Comparator, Object) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| floor(Comparator, Object) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| addRightChild(Object, int) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| addLeftChild(Object, int) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| rotateLeft() | | 0% | | 0% | 2 | 2 | 9 | 9 | 1 | 1 |
| rotateRight() | | 0% | | 0% | 2 | 2 | 9 | 9 | 1 | 1 |
| removeMin(TreeMultiset.AvlNode) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| removeMax(TreeMultiset.AvlNode) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| recomputeMultiset() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| count(Comparator, Object) |  | 62% | | 62% | 3 | 5 | 1 | 6 | 0 | 1 |
| recomputeHeight() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| balanceFactor() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| totalCount(TreeMultiset.AvlNode) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| height(TreeMultiset.AvlNode) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| toString() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pred() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| recompute() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| TreeMultiset.AvlNode(Object, int) | | 96% | | 50% | 1 | 2 | 0 | 10 | 0 | 1 |
| TreeMultiset.AvlNode() | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| succ() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getElement() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getCount() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |