(int dirShift, int level, long index)
| 314 | |
| 315 | |
| 316 | protected static int treePos(int dirShift, int level, long index) { |
| 317 | int shift = dirShift*level; |
| 318 | return (int) ((index >>> shift) & ((1<<dirShift)-1)); |
| 319 | } |
| 320 | |
| 321 | static final void treePut( |
| 322 | int dirShift, |
no outgoing calls
no test coverage detected