org.graalvm.compiler.truffle.runtime.collection

Class BTreeQueue<E>

java.lang.Object

org.graalvm.compiler.truffle.runtime.collection.BTreeQueue<E>

public final class BTreeQueue<E>
extends Object

Queue implementation based on the B-tree data structure.

The elements in the queue are ordered, and placed into leaf nodes. Each leaf node has at most BRANCHING_FACTOR elements, and each inner node has at most BRANCHING_FACTOR elements. The tree is kept balanced so that all the leaves are at the same depth. Nodes whose entry-count drops below a particular value are compressed to avoid wasting space.

Constructor Summary

Constructors

Constructor and Description
BTreeQueue()

Method Summary

Modifier and Type	Method and Description
void	add(E x)
int	addIndexOf(E x)
void	checkInvariants()
void	clear()
int	indexBefore(E x)
int	indexOf(E x) Returns the position in the pool, or -1 if the element is not present.
int	internalCapacity()
E	peek()
E	poll()
String	prettyString()
int	size()
Object[]	toArray()
<T> T[]	toArray(T[] a)

Methods inherited from class java.lang.Object

clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BTreeQueue

public BTreeQueue()

Method Detail

add

public void add(E x)

addIndexOf

public int addIndexOf(E x)

indexOf

public int indexOf(E x)

Returns the position in the pool, or -1 if the element is not present.

indexBefore

public int indexBefore(E x)

poll

public E poll()

peek

public E peek()

clear

public void clear()

size

public int size()

toArray

public Object[] toArray()

toArray

public <T> T[] toArray(T[] a)

internalCapacity

public int internalCapacity()

checkInvariants

public void checkInvariants()

prettyString

public String prettyString()