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