Top Description Fields Constructors Methods

io.netty.buffer

pack-priv final Class IntPriorityQueue

Class Inheritance

extends Object

java.lang.Object
io.netty.buffer.IntPriorityQueue

Imports

java.util.Arrays

Internal primitive priority queue, used by PoolChunk. The implementation is based on the binary heap, as described in Algorithms by Sedgewick and Wayne.

Field Summary

Modifier and Type	Field and Description
private int[]	array
public static final int	NO_VALUE
private int	size

Constructor Summary

Access	Constructor and Description
pack-priv	IntPriorityQueue()

Method Summary

Modifier and Type	Method and Description
public boolean	isEmpty()
private void	lift(int index)
public void	offer(int handle)
public int	peek()
public int	poll()
public void	remove(int value)
private void	sink(int index)
private boolean	subord(int a, int b)
private void	swap(int a, int b)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

array	back to summary
private int[] array

NO_VALUE	back to summary
public static final int NO_VALUE

size	back to summary
private int size

Constructor Detail

IntPriorityQueue	back to summary
pack-priv IntPriorityQueue()

Method Detail

isEmpty	back to summary
public boolean isEmpty()

lift	back to summary
private void lift(int index)

offer	back to summary
public void offer(int handle)

peek	back to summary
public int peek()

poll	back to summary
public int poll()

remove	back to summary
public void remove(int 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)