| CollectionMergeTrie.CollectionMergeCursor(Trie.CollectionMergeResolver, Collection) |   | 92% | | 83% | 1 | 4 | 0 | 15 | 0 | 1 |
| heapifyDown(Trie.Cursor, int) | | 100% | | 100% | 0 | 5 | 0 | 12 | 0 | 1 |
| applyToEqualElementsInHeap(CollectionMergeTrie.CollectionMergeCursor.HeapOp, int) | | 100% | | 100% | 0 | 3 | 0 | 9 | 0 | 1 |
| maybeSwapHead(int) | | 100% | | 100% | 0 | 4 | 0 | 8 | 0 | 1 |
| content() | | 100% | | 100% | 0 | 3 | 0 | 10 | 0 | 1 |
| advanceMultiple(Trie.TransitionsReceiver) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| collectContent(Trie.Cursor, int) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| advance() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| skipChildren() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| applyToEqualOnHeap(CollectionMergeTrie.CollectionMergeCursor.HeapOp) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| advanceEqualAndRestoreHeap(CollectionMergeTrie.CollectionMergeCursor.AdvancingHeapOp) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| depth() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| incomingTransition() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |