Source file "com/github/andrewoma/dexx/collection/internal/redblack/RedBlackTree.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,214 of 2,214 | 0% | 266 of 266 | 0% | 185 | 185 | 246 | 246 | 52 | 52 |
| append(Tree, Tree) | | 0% | | 0% | 11 | 11 | 19 | 19 | 1 | 1 |
| balance(Object, Object, Tree, Tree) | | 0% | | 0% | 8 | 8 | 15 | 15 | 1 | 1 |
| unzipBoth(Tree, Tree, List, List, int) | | 0% | | 0% | 13 | 13 | 15 | 15 | 1 | 1 |
| doRange(Tree, Object, boolean, Object, boolean) | | 0% | | 0% | 12 | 12 | 17 | 17 | 1 | 1 |
| rebalance(Tree, Tree, Tree) | | 0% | | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
| doSlice(Tree, int, int) | | 0% | | 0% | 8 | 8 | 10 | 10 | 1 | 1 |
| balanceLeft(boolean, Object, Object, Tree, Tree) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| balanceRight(boolean, Object, Object, Tree, Tree) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| upd(Tree, Object, Object, boolean) | | 0% | | 0% | 6 | 6 | 10 | 10 | 1 | 1 |
| updNth(Tree, int, Object, Object, boolean) | | 0% | | 0% | 5 | 5 | 10 | 10 | 1 | 1 |
| balLeft(Object, Object, Tree, Tree) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| balRight(Object, Object, Tree, Tree) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| doFrom(Tree, Object, boolean) | | 0% | | 0% | 8 | 8 | 8 | 8 | 1 | 1 |
| doUntil(Tree, Object, boolean) | | 0% | | 0% | 8 | 8 | 8 | 8 | 1 | 1 |
| doDrop(Tree, int) | | 0% | | 0% | 6 | 6 | 9 | 9 | 1 | 1 |
| doTake(Tree, int) | | 0% | | 0% | 6 | 6 | 8 | 8 | 1 | 1 |
| findDepth(List, int) | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| delLeft(Tree, Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| delRight(Tree, Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| del(Tree, Object) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| lookup(Tree, Object) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| forEach(Tree, Function) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| unzip(List, boolean) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| subl(Tree) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| smallest(Tree) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| greatest(Tree) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| mkTree(boolean, Object, Object, Tree, Tree) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| cons(Object, List) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| RedBlackTree(TreeFactory, Comparator, KeyFunction) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| get(Tree, Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| range(Tree, Object, boolean, Object, boolean) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getOrdering() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| contains(Tree, Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| update(Tree, Object, Object, boolean) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| isRedTree(Tree) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| isBlackTree(Tree) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| RedBlackTree() | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| from(Tree, Object, boolean) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| until(Tree, Object, boolean) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| slice(Tree, int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| compareDepth(Tree, Tree) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| count(Tree) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| delete(Tree, Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| drop(Tree, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| take(Tree, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| keysIterator(Tree) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| blacken(Tree) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isEmpty(Tree) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| iterator(Tree) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| valuesIterator(Tree) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| static {...} | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getKeyFunction() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |