|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.AbstractCollection<E>
java.util.AbstractQueue<E>
org.apache.synapse.commons.executors.queues.FixedSizeQueue<E>
E - Should implement the Importance interfacepublic class FixedSizeQueue<E>
A bounded queue implementation for internal queues. This queue is backed by an fixed size array.
| Constructor Summary | |
|---|---|
FixedSizeQueue(int priority,
int capacity)
Create a queue with the given priority and capacity. |
|
| Method Summary | |
|---|---|
boolean |
contains(Object o)
|
int |
drainTo(Collection<? super E> c)
Drain items from this queue to the specified collection |
int |
drainTo(Collection<? super E> c,
int maxElements)
Drain items from this queue to the specified collection |
int |
getCapacity()
Return the capacity of the queue |
Condition |
getNotFullCond()
Get not full condition |
int |
getPriority()
Get the Priority of the queue |
Iterator<E> |
iterator()
|
boolean |
offer(E e)
|
E |
peek()
|
E |
poll()
|
int |
remainingCapacity()
Remaining capacity of the queue. |
boolean |
remove(Object o)
|
void |
setNotFullCond(Condition notFullCond)
Get not full condition |
void |
setPriority(int p)
Set the priority |
int |
size()
|
String |
toString()
|
| Methods inherited from class java.util.AbstractQueue |
|---|
add, addAll, clear, element, remove |
| Methods inherited from class java.util.AbstractCollection |
|---|
containsAll, isEmpty, removeAll, retainAll, toArray, toArray |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.Queue |
|---|
element, remove |
| Methods inherited from interface java.util.Collection |
|---|
add, addAll, clear, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, toArray, toArray |
| Constructor Detail |
|---|
public FixedSizeQueue(int priority,
int capacity)
priority - priority of the elements in the queuecapacity - capacity of the queue| Method Detail |
|---|
public int getPriority()
InternalQueue
getPriority in interface InternalQueue<E>public void setPriority(int p)
InternalQueue
setPriority in interface InternalQueue<E>p - prioritypublic Condition getNotFullCond()
InternalQueue
getNotFullCond in interface InternalQueue<E>public void setNotFullCond(Condition notFullCond)
InternalQueue
setNotFullCond in interface InternalQueue<E>notFullCond - conditionpublic Iterator<E> iterator()
iterator in interface Iterable<E>iterator in interface Collection<E>iterator in class AbstractCollection<E>public int size()
size in interface Collection<E>size in class AbstractCollection<E>public String toString()
toString in class AbstractCollection<E>public boolean offer(E e)
offer in interface Queue<E>public E poll()
poll in interface Queue<E>public E peek()
peek in interface Queue<E>public int remainingCapacity()
InternalQueue
remainingCapacity in interface InternalQueue<E>public int drainTo(Collection<? super E> c)
InternalQueue
drainTo in interface InternalQueue<E>c - collection to add item
public int drainTo(Collection<? super E> c,
int maxElements)
InternalQueue
drainTo in interface InternalQueue<E>c - collection to add itemmaxElements - maximum number of element to drain
public int getCapacity()
InternalQueue
getCapacity in interface InternalQueue<E>public boolean contains(Object o)
contains in interface Collection<E>contains in class AbstractCollection<E>public boolean remove(Object o)
remove in interface Collection<E>remove in class AbstractCollection<E>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||