Package org.jboss.util.timeout

Class HashedTimeoutPriorityQueueImpl.InternalPriorityQueue

java.lang.Object

org.jboss.util.timeout.HashedTimeoutPriorityQueueImpl.InternalPriorityQueue

Enclosing class:

HashedTimeoutPriorityQueueImpl

private class HashedTimeoutPriorityQueueImpl.InternalPriorityQueue
extends java.lang.Object

Internal priority queue

Field Summary

Fields

Modifier and Type	Field	Description
private java.lang.Object	lock	The lock object
private HashedTimeoutPriorityQueueImpl.TimeoutExtImpl[]	queue	The timeouts
private int	size	The size of the timeout queue.

Constructor Summary

Constructors

Constructor	Description
InternalPriorityQueue()	Create a new InternalPriorityQueue.

Method Summary

Modifier and Type	Method	Description
void	cancel()
(package private) void	checkTree()	Check invariants of the queue.
void	clear()
(package private) boolean	compareAndSwapWithTop(boolean notify)
(package private) void	normalizeDown(int index)
private boolean	normalizeUp(int index)	A new node has been added at index index.
(package private) TimeoutExt	offer(HashedTimeoutPriorityQueueImpl.TimeoutExtImpl timeout)
(package private) boolean	remove(TimeoutExt timeout)
private HashedTimeoutPriorityQueueImpl.TimeoutExtImpl	removeNode(int index)	Remove a node from the tree and normalize.
int	size()
private void	swap(int a, int b)	Swap two nodes in the tree.

Methods inherited from class java.lang.Object

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

Field Detail

lock

private java.lang.Object lock

The lock object

size

private int size

The size of the timeout queue.

queue

private HashedTimeoutPriorityQueueImpl.TimeoutExtImpl[] queue

The timeouts

Constructor Detail

InternalPriorityQueue

InternalPriorityQueue()

Create a new InternalPriorityQueue.

Method Detail

offer

TimeoutExt offer(HashedTimeoutPriorityQueueImpl.TimeoutExtImpl timeout)

compareAndSwapWithTop

boolean compareAndSwapWithTop(boolean notify)

remove

boolean remove(TimeoutExt timeout)

clear

public void clear()

cancel

public void cancel()

size

public int size()

normalizeUp

private boolean normalizeUp(int index)

A new node has been added at index index. Normalize the tree by moving the new node up the tree.

Returns:

true if the tree was modified.

normalizeDown

void normalizeDown(int index)

swap

private void swap(int a,
                  int b)

Swap two nodes in the tree.

Parameters:

a - the first index

b - the second index

removeNode

private HashedTimeoutPriorityQueueImpl.TimeoutExtImpl removeNode(int index)

Remove a node from the tree and normalize.

Parameters:

index - the index in the queue

Returns:

the removed node.

checkTree

void checkTree()

Check invariants of the queue.