IntPriorityQueue

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

```
final class IntPriorityQueue
extends java.lang.Object
```
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

Fields
Modifier and Type Field Description

private int[] array

static int NO_VALUE

private int size

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)`

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

NO_VALUE
```
public static final int NO_VALUE
```
See Also:

Constant Field Values

array
```
private int[] array
```

size
```
private int size
```

Constructor Detail
- IntPriorityQueue
```
IntPriorityQueue()
```

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)