Class CircularFifoQueue<E>
- java.lang.Object
-
- java.util.AbstractCollection<E>
-
- ptolemy.actor.lib.jjs.modules.IMUSensor.CircularFifoQueue<E>
-
- All Implemented Interfaces:
java.io.Serializable
,java.lang.Iterable<E>
,java.util.Collection<E>
,java.util.Queue<E>
public class CircularFifoQueue<E> extends java.util.AbstractCollection<E> implements java.util.Queue<E>, java.io.Serializable
CircularFifoQueue is a first-in first-out queue with a fixed size that replaces its oldest element if full.The removal order of a
CircularFifoQueue
is based on the insertion order; elements are removed in the same order in which they were added. The iteration order is the same as the removal order.The
add(Object)
,remove()
,peek()
,poll()
,offer(Object)
operations all perform in constant time. All other operations perform in linear time or worse.This queue prevents null objects from being added.
- Since:
- Ptolemy II 11.0
- Version:
- $Id$
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description CircularFifoQueue()
Constructor that creates a queue with the default size of 32.CircularFifoQueue(int size)
Constructor that creates a queue with the specified size.CircularFifoQueue(java.util.Collection<? extends E> coll)
Constructor that creates a queue from the specified collection.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(E element)
Adds the given element to this queue.void
clear()
Clears this queue.E
element()
E
get(int index)
Returns the element at the specified position in this queue.boolean
isEmpty()
Returns true if this queue is empty; false otherwise.boolean
isFull()
java.util.Iterator<E>
iterator()
Returns an iterator over this queue's elements.int
maxSize()
Gets the maximum size of the collection (the bound).boolean
offer(E element)
Adds the given element to this queue.E
peek()
E
poll()
E
remove()
int
size()
Returns the number of elements stored in the queue.-
Methods inherited from class java.util.AbstractCollection
addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toArray, toString
-
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
-
-
-
Constructor Detail
-
CircularFifoQueue
public CircularFifoQueue()
Constructor that creates a queue with the default size of 32.
-
CircularFifoQueue
public CircularFifoQueue(int size)
Constructor that creates a queue with the specified size.- Parameters:
size
- the size of the queue (cannot be changed)- Throws:
java.lang.IllegalArgumentException
- if the size is < 1
-
CircularFifoQueue
public CircularFifoQueue(java.util.Collection<? extends E> coll)
Constructor that creates a queue from the specified collection. The collection size also sets the queue size.- Parameters:
coll
- the collection to copy into the queue, may not be null- Throws:
java.lang.NullPointerException
- if the collection is null
-
-
Method Detail
-
size
public int size()
Returns the number of elements stored in the queue.
-
isEmpty
public boolean isEmpty()
Returns true if this queue is empty; false otherwise.
-
isFull
public boolean isFull()
A
CircularFifoQueue
can never be full, thus this returns alwaysfalse
.- Returns:
- always returns
false
-
maxSize
public int maxSize()
Gets the maximum size of the collection (the bound).- Returns:
- the maximum number of elements the collection can hold
-
clear
public void clear()
Clears this queue.
-
add
public boolean add(E element)
Adds the given element to this queue. If the queue is full, the least recently added element is discarded so that a new element can be inserted.
-
get
public E get(int index)
Returns the element at the specified position in this queue.- Parameters:
index
- the position of the element in the queue- Returns:
- the element at position
index
- Throws:
java.util.NoSuchElementException
- if the requested position is outside the range [0, size)
-
offer
public boolean offer(E element)
Adds the given element to this queue. If the queue is full, the least recently added element is discarded so that a new element can be inserted.- Specified by:
offer
in interfacejava.util.Queue<E>
- Parameters:
element
- the element to add- Returns:
- true, always
- Throws:
java.lang.NullPointerException
- if the given element is null
-
iterator
public java.util.Iterator<E> iterator()
Returns an iterator over this queue's elements.
-
-