PoolChunk.
The implementation is based on the binary heap, as described in Algorithms by Sedgewick and Wayne.
| Modifier and Type | Field and Description |
|---|---|
| private long[] | |
| public static final int | |
| private int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public boolean | |
| private void | |
| public void | |
| public long | |
| public long | |
| public void | |
| private void | |
| private boolean | |
| private void |
| array | back to summary |
|---|---|
| private long[] array | |
| NO_VALUE | back to summary |
|---|---|
| public static final int NO_VALUE | |
| size | back to summary |
|---|---|
| private int size | |
| LongPriorityQueue | back to summary |
|---|---|
| public LongPriorityQueue() | |
| isEmpty | back to summary |
|---|---|
| public boolean isEmpty() | |
| lift | back to summary |
|---|---|
| private void lift(int index) | |
| offer | back to summary |
|---|---|
| public void offer(long handle) | |
| peek | back to summary |
|---|---|
| public long peek() | |
| poll | back to summary |
|---|---|
| public long poll() | |
| remove | back to summary |
|---|---|
| public void remove(long value) | |
| sink | back to summary |
|---|---|
| private void sink(int index) | |
| subord | back to summary |
|---|---|
| private boolean subord(int a, int b) | |
| swap | back to summary |
|---|---|
| private void swap(int a, int b) | |