BlockBalancedTreeWriter |  | 0% |  | 0% | 51 | 51 | 154 | 154 | 13 | 13 | 1 | 1 |
BlockBalancedTreeWriter.LeafWriter |  | 0% |  | 0% | 45 | 45 | 120 | 120 | 13 | 13 | 1 | 1 |
BlockBalancedTreeReader.FilteringIntersection |  | 0% |  | 0% | 30 | 30 | 79 | 79 | 11 | 11 | 1 | 1 |
BlockBalancedTreePostingsWriter |  | 0% |  | 0% | 22 | 22 | 67 | 67 | 8 | 8 | 1 | 1 |
BlockBalancedTreeWalker.TraversalState |  | 0% |  | 0% | 22 | 22 | 58 | 58 | 11 | 11 | 1 | 1 |
BlockBalancedTreeWalker |  | 0% |  | 0% | 14 | 14 | 73 | 73 | 8 | 8 | 1 | 1 |
BlockBalancedTreeReader.Intersection |  | 0% |  | 0% | 13 | 13 | 50 | 50 | 8 | 8 | 1 | 1 |
NumericIndexWriter |  | 0% |  | 0% | 8 | 8 | 41 | 41 | 5 | 5 | 1 | 1 |
BlockBalancedTreeReader |  | 0% |  | 0% | 8 | 8 | 25 | 25 | 6 | 6 | 1 | 1 |
BlockBalancedTreeQueries |  | 0% |  | 0% | 11 | 11 | 17 | 17 | 4 | 4 | 1 | 1 |
BlockBalancedTreeRamBuffer |  | 0% | | n/a | 6 | 6 | 16 | 16 | 6 | 6 | 1 | 1 |
BlockBalancedTreeQueries.RangeQueryVisitor |  | 0% |  | 0% | 12 | 12 | 20 | 20 | 3 | 3 | 1 | 1 |
BlockBalancedTreePostingsIndex |  | 0% |  | 0% | 5 | 5 | 15 | 15 | 4 | 4 | 1 | 1 |
BlockBalancedTreeIterator.new BlockBalancedTreeIterator() {...} |  | 0% | | n/a | 3 | 3 | 8 | 8 | 3 | 3 | 1 | 1 |
BlockBalancedTreeQueries.Bound |  | 0% |  | 0% | 10 | 10 | 9 | 9 | 4 | 4 | 1 | 1 |
BlockBalancedTreeWriter.LeafWriter.new IntroSorter() {...} |  | 0% | | n/a | 4 | 4 | 8 | 8 | 4 | 4 | 1 | 1 |
BlockBalancedTreeRamBuffer.PostingsAccumulator |  | 0% |  | 0% | 4 | 4 | 10 | 10 | 3 | 3 | 1 | 1 |
LeafOrderMap |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 3 | 3 | 1 | 1 |
BlockBalancedTreeIterator.new BlockBalancedTreeIterator() {...} |  | 0% | | n/a | 3 | 3 | 6 | 6 | 3 | 3 | 1 | 1 |
NumericIndexWriter.LeafCallback |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 3 | 3 | 1 | 1 |
BlockBalancedTreeIterator.2.new PostingList() {...} |  | 0% |  | 0% | 5 | 5 | 6 | 6 | 4 | 4 | 1 | 1 |
BlockBalancedTreeWriter.RowIDAndIndex |  | 0% | | n/a | 2 | 2 | 5 | 5 | 2 | 2 | 1 | 1 |
BlockBalancedTreeIterator |  | 0% | | n/a | 2 | 2 | 2 | 2 | 2 | 2 | 1 | 1 |
BlockBalancedTreeQueries.new BlockBalancedTreeReader.IntersectVisitor() {...} |  | 0% | | n/a | 3 | 3 | 3 | 3 | 3 | 3 | 1 | 1 |