Top Description Fields Constructors Methods
io.netty5.util.internal

public final Class LongPriorityQueue

extends Object
Class Inheritance
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 TypeField and Description
private long[]
public static final int
private int

Constructor Summary

AccessConstructor and Description
public

Method Summary

Modifier and TypeMethod and Description
public boolean
private void
lift(int index)

public void
offer(long handle)

public long
peek()

public long
poll()

public void
remove(long 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:
cloneequalsfinalizegetClasshashCodenotifynotifyAlltoStringwaitwaitwait

Field Detail

arrayback to summary
private long[] array
NO_VALUEback to summary
public static final int NO_VALUE
sizeback to summary
private int size

Constructor Detail

LongPriorityQueueback to summary
public LongPriorityQueue()

Method Detail

isEmptyback to summary
public boolean isEmpty()
liftback to summary
private void lift(int index)
offerback to summary
public void offer(long handle)
peekback to summary
public long peek()
pollback to summary
public long poll()
removeback to summary
public void remove(long value)
sinkback to summary
private void sink(int index)
subordback to summary
private boolean subord(int a, int b)
swapback to summary
private void swap(int a, int b)