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