| InMemoryTrie |  | 0% |  | 0% | 112 | 112 | 260 | 260 | 40 | 40 | 1 | 1 |
| InMemoryReadTrie.MemtableCursor |  | 0% |  | 0% | 45 | 45 | 102 | 102 | 18 | 18 | 1 | 1 |
| InMemoryReadTrie |  | 0% |  | 0% | 64 | 64 | 98 | 98 | 31 | 31 | 1 | 1 |
| InMemoryTrie.ApplyState |  | 0% |  | 0% | 40 | 40 | 86 | 86 | 18 | 18 | 1 | 1 |
| SlicedTrie.SlicedCursor |  | 0% |  | 0% | 39 | 39 | 71 | 71 | 10 | 10 | 1 | 1 |
| CollectionMergeTrie.CollectionMergeCursor |  | 0% |  | 0% | 30 | 30 | 72 | 72 | 14 | 14 | 1 | 1 |
| MergeTrie.MergeCursor |  | 0% |  | 0% | 28 | 28 | 40 | 40 | 9 | 9 | 1 | 1 |
| Trie |  | 0% |  | 0% | 32 | 32 | 48 | 48 | 21 | 21 | 1 | 1 |
| TrieDumper |  | 0% |  | 0% | 11 | 11 | 31 | 31 | 8 | 8 | 1 | 1 |
| SingletonTrie.Cursor |  | 0% |  | 0% | 12 | 12 | 28 | 28 | 7 | 7 | 1 | 1 |
| InMemoryReadTrie.CursorBacktrackingState |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 5 | 5 | 1 | 1 |
| InMemoryReadTrie.new Trie.Cursor() {...} |  | 0% |  | 0% | 13 | 13 | 22 | 22 | 7 | 7 | 1 | 1 |
| TriePathReconstructor |  | 0% |  | 0% | 7 | 7 | 16 | 16 | 5 | 5 | 1 | 1 |
| TrieEntriesIterator |  | 0% |  | 0% | 9 | 9 | 16 | 16 | 5 | 5 | 1 | 1 |
| TrieValuesIterator |  | 0% |  | 0% | 8 | 8 | 15 | 15 | 4 | 4 | 1 | 1 |
| CollectionMergeTrie |  | 0% |  | 0% | 9 | 9 | 11 | 11 | 4 | 4 | 1 | 1 |
| Trie.Cursor |  | 0% |  | 0% | 6 | 6 | 14 | 14 | 2 | 2 | 1 | 1 |
| InMemoryTrie.new Iterator() {...} |  | 0% |  | 0% | 5 | 5 | 6 | 6 | 3 | 3 | 1 | 1 |
| SlicedTrie.State |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 | 1 | 1 |
| Trie.2.new Trie.Cursor() {...} |  | 0% | | n/a | 6 | 6 | 7 | 7 | 6 | 6 | 1 | 1 |
| SlicedTrie |  | 0% | | n/a | 2 | 2 | 8 | 8 | 2 | 2 | 1 | 1 |
| MergeTrie |  | 0% | | n/a | 2 | 2 | 6 | 6 | 2 | 2 | 1 | 1 |
| TrieEntriesWalker.WithConsumer |  | 0% | | n/a | 3 | 3 | 6 | 6 | 3 | 3 | 1 | 1 |
| MergeTrie.Distinct |  | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| SingletonTrie |  | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
| TrieEntriesWalker | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| Trie.new Trie.CollectionMergeResolver() {...} | | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |
| CollectionMergeTrie.Distinct | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| TrieEntriesIterator.AsEntries | | 0% | | n/a | 2 | 2 | 3 | 3 | 2 | 2 | 1 | 1 |
| Trie.ValueConsumer | | 0% | | n/a | 5 | 5 | 6 | 6 | 5 | 5 | 1 | 1 |
| Trie.new Trie() {...} | | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
| CollectionMergeTrie.CollectionMergeCursor.AdvancingHeapOp | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 | 1 | 1 |
| Trie.CollectionMergeResolver | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| InMemoryTrie.SpaceExhaustedException | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 | 1 | 1 |