Package io.netty.buffer
Class IntPriorityQueue
- java.lang.Object
-
- io.netty.buffer.IntPriorityQueue
-
final class IntPriorityQueue extends java.lang.Object
Internal primitive priority queue, used byPoolChunk
. The implementation is based on the binary heap, as described in Algorithms by Sedgewick and Wayne.
-
-
Constructor Summary
Constructors Constructor Description IntPriorityQueue()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
isEmpty()
private void
lift(int index)
void
offer(int handle)
int
peek()
int
poll()
void
remove(int value)
private void
sink(int index)
private boolean
subord(int a, int b)
private void
swap(int a, int b)
-
-
-
Field Detail
-
NO_VALUE
public static final int NO_VALUE
- See Also:
- Constant Field Values
-
array
private int[] array
-
size
private int size
-
-
Method Detail
-
offer
public void offer(int handle)
-
remove
public void remove(int value)
-
peek
public int peek()
-
poll
public int poll()
-
isEmpty
public boolean isEmpty()
-
lift
private void lift(int index)
-
sink
private void sink(int index)
-
subord
private boolean subord(int a, int b)
-
swap
private void swap(int a, int b)
-
-