org.apache.lens.server.util

Class FairPriorityBlockingQueue<E>

java.lang.Object

org.apache.lens.server.util.FairPriorityBlockingQueue<E>

public class FairPriorityBlockingQueue<E>
extends Object

A priority blocking queue in which an element is not allowed to be removed from head while a bulk addAll operation is ongoing. This allows all elements added through addAll to get equal chance in scheduling.

Constructor Summary

Constructors

Constructor and Description
FairPriorityBlockingQueue(Comparator<? super E> comparator)

Method Summary

Methods

Modifier and Type	Method and Description
boolean	add(E e)
void	addAll(Collection<? extends E> c)
boolean	remove(Object o)
int	size()
E	take() take is implemented by using poll and a fairnessLock to synchronize removal from head of queue with bulk addAll operation.

Methods inherited from class java.lang.Object

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

Constructor Detail

FairPriorityBlockingQueue

public FairPriorityBlockingQueue(@NonNull
                         Comparator<? super E> comparator)

Method Detail

take

public E take()
       throws InterruptedException

take is implemented by using poll and a fairnessLock to synchronize removal from head of queue with bulk addAll operation.

Returns:

Throws:

InterruptedException

remove

public boolean remove(Object o)

addAll

public void addAll(Collection<? extends E> c)

add

public boolean add(E e)

size

public int size()