DoubleArrayFIFOQueue (Primitive-Collections 0.2.0 API)

java.lang.Object
- speiger.src.collections.doubles.queues.DoubleArrayFIFOQueue

All Implemented Interfaces:

java.lang.Iterable<java.lang.Double>, DoubleIterable, DoublePriorityDequeue, DoublePriorityQueue, ObjectPriorityQueue<java.lang.Double>, ITrimmable
```
public class DoubleArrayFIFOQueue
extends java.lang.Object
implements DoublePriorityDequeue, ITrimmable
```
A Simple First In First Out Priority Queue that is a Good Replacement for a linked list (or ArrayDequeue) Its specific implementation uses a backing array that grows and shrinks as it is needed.

Field Summary

Fields
Modifier and Type Field and Description

static int MIN_CAPACITY
The Minimum Capacity that is allowed

Fields
Modifier and Type	Field and Description
`static int`	`MIN_CAPACITY` The Minimum Capacity that is allowed

Constructor Summary

Constructors
Constructor and Description
`DoubleArrayFIFOQueue()` Default Construtor
`DoubleArrayFIFOQueue(double[] values)` Constructor using a initial array
`DoubleArrayFIFOQueue(double[] values, int size)` Constructor using a initial array
`DoubleArrayFIFOQueue(double[] values, int offset, int size)` Constructor using a initial array
`DoubleArrayFIFOQueue(int capacity)` Constructor with a Min Capacity

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`clear()` clears all elements within the PriorityQueue, this does not resize the backing arrays
`void`	`clearAndTrim(int size)` Trims the collection down to the requested size and clears all elements while doing so
`DoubleComparator`	`comparator()`
`double`	`dequeueDouble()` Method to extract a element from the PriorityQueue
`double`	`dequeueLastDouble()` A Method to remove a element from the last place instead of the first
`void`	`enqueueDouble(double e)` Method to insert a element into the PriorityQueue
`void`	`enqueueFirstDouble(double e)` Method to insert a element into the first Index instead of the last.
`DoubleIterator`	`iterator()` Returns an iterator over elements of type `T`.
`void`	`onChanged()` Allows to notify the Queue to be revalidate its data
`double`	`peekDouble(int index)` Peeking function to see whats inside the queue.
`boolean`	`removeDouble(double e)` Removes the first found element in the queue
`boolean`	`removeLastDouble(double e)` Removes the last found element in the queue
`int`	`size()`
`java.lang.Double[]`	`toArray(java.lang.Double[] input)` A method to drop the contents of the Queue without clearing the queue
`double[]`	`toDoubleArray(double[] input)` A method to drop the contents of the Queue without clearing the queue
`boolean`	`trim(int size)` Trims the original collection down to the size of the current elements or the requested size depending which is bigger

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface speiger.src.collections.doubles.queues.DoublePriorityDequeue
dequeueLast, enqueueFirst, last, lastDouble

Methods inherited from interface speiger.src.collections.doubles.queues.DoublePriorityQueue
dequeue, enqueue, first, firstDouble, peek, remove, removeLast, toArray, toDoubleArray

Methods inherited from interface speiger.src.collections.objects.queues.ObjectPriorityQueue
isEmpty

Methods inherited from interface speiger.src.collections.doubles.collections.DoubleIterable
forEach, forEach, spliterator

Methods inherited from interface speiger.src.collections.utils.ITrimmable
clearAndTrim, trim

- Field Detail
  - MIN_CAPACITY
```
public static final int MIN_CAPACITY
```
    The Minimum Capacity that is allowed
    
    See Also:
    
    Constant Field Values
- Constructor Detail
  - DoubleArrayFIFOQueue
```
public DoubleArrayFIFOQueue(double[] values)
```
    Constructor using a initial array
    
    Parameters:
    
    values - the Array that should be used
  - DoubleArrayFIFOQueue
```
public DoubleArrayFIFOQueue(double[] values,
                            int size)
```
    Constructor using a initial array
    
    Parameters:
    
    values - the Array that should be used
    
    size - the amount of elements that are in the initial array
    
    Throws:
    
    java.lang.IllegalStateException - if values is smaller then size
  - DoubleArrayFIFOQueue
```
public DoubleArrayFIFOQueue(double[] values,
                            int offset,
                            int size)
```
    Constructor using a initial array
    
    Parameters:
    
    values - the Array that should be used
    
    offset - where to begin in the initial array
    
    size - the amount of elements that are in the initial array
    
    Throws:
    
    java.lang.IllegalStateException - if values is smaller then size
  - DoubleArrayFIFOQueue
```
public DoubleArrayFIFOQueue(int capacity)
```
    Constructor with a Min Capacity
    
    Parameters:
    
    capacity - the initial capacity of the backing array
    
    Throws:
    
    java.lang.IllegalStateException - if the initial size is smaller 0
  - DoubleArrayFIFOQueue
```
public DoubleArrayFIFOQueue()
```
    Default Construtor
- Method Detail
  - iterator
```
public DoubleIterator iterator()
```
    Description copied from interface: DoubleIterable
    
    Returns an iterator over elements of type T.
    
    Specified by:
    
    iterator in interface java.lang.Iterable<java.lang.Double>
    
    Specified by:
    
    iterator in interface DoubleIterable
    
    Returns:
    
    an Iterator.
  - size
```
public int size()
```
    Specified by:
    
    size in interface ObjectPriorityQueue<java.lang.Double>
    
    Returns:
    
    the amount of elements that are stored in the PriorityQueue
  - clear
```
public void clear()
```
    Description copied from interface: ObjectPriorityQueue
    
    clears all elements within the PriorityQueue, this does not resize the backing arrays
    
    Specified by:
    
    clear in interface ObjectPriorityQueue<java.lang.Double>
  - enqueueDouble
```
public void enqueueDouble(double e)
```
    Description copied from interface: DoublePriorityQueue
    
    Method to insert a element into the PriorityQueue
    
    Specified by:
    
    enqueueDouble in interface DoublePriorityQueue
    
    Parameters:
    
    e - the element that should be inserted
  - enqueueFirstDouble
```
public void enqueueFirstDouble(double e)
```
    Description copied from interface: DoublePriorityDequeue
    
    Method to insert a element into the first Index instead of the last.
    
    Specified by:
    
    enqueueFirstDouble in interface DoublePriorityDequeue
    
    Parameters:
    
    e - the element that should be inserted into the first place
  - dequeueDouble
```
public double dequeueDouble()
```
    Description copied from interface: DoublePriorityQueue
    
    Method to extract a element from the PriorityQueue
    
    Specified by:
    
    dequeueDouble in interface DoublePriorityQueue
    
    Returns:
    
    a element from the Queue
  - dequeueLastDouble
```
public double dequeueLastDouble()
```
    Description copied from interface: DoublePriorityDequeue
    
    A Method to remove a element from the last place instead of the first
    
    Specified by:
    
    dequeueLastDouble in interface DoublePriorityDequeue
    
    Returns:
    
    the last element inserted
  - peekDouble
```
public double peekDouble(int index)
```
    Description copied from interface: DoublePriorityQueue
    
    Peeking function to see whats inside the queue.
    
    Specified by:
    
    peekDouble in interface DoublePriorityQueue
    
    Parameters:
    
    index - of the element that is requested to be viewed.
    
    Returns:
    
    the element that is requested
  - removeDouble
```
public boolean removeDouble(double e)
```
    Description copied from interface: DoublePriorityQueue
    
    Removes the first found element in the queue
    
    Specified by:
    
    removeDouble in interface DoublePriorityQueue
    
    Parameters:
    
    e - the element that should be removed
    
    Returns:
    
    if a searched element was removed
  - removeLastDouble
```
public boolean removeLastDouble(double e)
```
    Description copied from interface: DoublePriorityQueue
    
    Removes the last found element in the queue
    
    Specified by:
    
    removeLastDouble in interface DoublePriorityQueue
    
    Parameters:
    
    e - the element that should be removed
    
    Returns:
    
    if a searched element was removed
  - onChanged
```
public void onChanged()
```
    Description copied from interface: DoublePriorityQueue
    
    Allows to notify the Queue to be revalidate its data
    
    Specified by:
    
    onChanged in interface DoublePriorityQueue
    
    Specified by:
    
    onChanged in interface ObjectPriorityQueue<java.lang.Double>
  - comparator
```
public DoubleComparator comparator()
```
    Specified by:
    
    comparator in interface DoublePriorityQueue
    
    Specified by:
    
    comparator in interface ObjectPriorityQueue<java.lang.Double>
    
    Returns:
    
    the sorter of the Queue, can be null
  - trim
```
public boolean trim(int size)
```
    Description copied from interface: ITrimmable
    
    Trims the original collection down to the size of the current elements or the requested size depending which is bigger
    
    Specified by:
    
    trim in interface ITrimmable
    
    Parameters:
    
    size - the requested trim size.
    
    Returns:
    
    if the internal array has been trimmed.
  - clearAndTrim
```
public void clearAndTrim(int size)
```
    Trims the collection down to the requested size and clears all elements while doing so
    
    Specified by:
    
    clearAndTrim in interface ITrimmable
    
    Parameters:
    
    size - the amount of elements that should be allowed
    
    Note:
    
    this will enforce minimum size of the collection itself
  - toDoubleArray
```
public double[] toDoubleArray(double[] input)
```
    Description copied from interface: DoublePriorityQueue
    
    A method to drop the contents of the Queue without clearing the queue
    
    Specified by:
    
    toDoubleArray in interface DoublePriorityQueue
    
    Parameters:
    
    input - where the elements should be inserted to. If it does not fit then it creates a new appropiatly created array
    
    Returns:
    
    the contents of the queue into a seperate array.
  - toArray
```
public java.lang.Double[] toArray(java.lang.Double[] input)
```
    Description copied from interface: ObjectPriorityQueue
    
    A method to drop the contents of the Queue without clearing the queue
    
    Specified by:
    
    toArray in interface DoublePriorityQueue
    
    Specified by:
    
    toArray in interface ObjectPriorityQueue<java.lang.Double>
    
    Parameters:
    
    input - where the elements should be inserted to. If it does not fit then it creates a new appropiatly created array
    
    Returns:
    
    the contents of the queue into a seperate array.

Class DoubleArrayFIFOQueue

Field Summary

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Methods inherited from interface speiger.src.collections.doubles.queues.DoublePriorityDequeue

Methods inherited from interface speiger.src.collections.doubles.queues.DoublePriorityQueue

Methods inherited from interface speiger.src.collections.objects.queues.ObjectPriorityQueue

Methods inherited from interface speiger.src.collections.doubles.collections.DoubleIterable

Methods inherited from interface speiger.src.collections.utils.ITrimmable

Field Detail

MIN_CAPACITY

Constructor Detail

DoubleArrayFIFOQueue

DoubleArrayFIFOQueue

DoubleArrayFIFOQueue

DoubleArrayFIFOQueue

DoubleArrayFIFOQueue

Method Detail

iterator

size

clear

enqueueDouble

enqueueFirstDouble

dequeueDouble

dequeueLastDouble

peekDouble

removeDouble

removeLastDouble

onChanged

comparator

trim

clearAndTrim

toDoubleArray

toArray