| recursePackIndex(ResettableByteBuffersIndexOutput, long[], byte[], long, List, int, byte[], boolean) |  | 0% | | 0% | 19 | 19 | 53 | 53 | 1 | 1 |
| packIndex(long[], byte[]) | | 0% | | 0% | 8 | 8 | 25 | 25 | 1 | 1 |
| recurseBalanceTree(int, int, int, int, byte[], List) | | 0% | | 0% | 6 | 6 | 22 | 22 | 1 | 1 |
| writeBalancedTree(IndexOutput, int, List, List) | | 0% | | n/a | 1 | 1 | 15 | 15 | 1 | 1 |
| write(IndexOutput, BlockBalancedTreeIterator, BlockBalancedTreeWriter.Callback) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| BlockBalancedTreeWriter(int, int) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| getLeftMostLeafBlockFP(long[], int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| appendBlock(ResettableByteBuffersIndexOutput, List) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getValueCount() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getBytesPerValue() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMaxPointsInLeafNode() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$writeBalancedTree$0(Long) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |