bak.pcj.list
Class IntArrayDeque

java.lang.Object
  bak.pcj.AbstractIntCollection
      bak.pcj.list.AbstractIntList
          bak.pcj.list.IntArrayDeque

All Implemented Interfaces:

Cloneable, IntCollection, IntDeque, IntList, Serializable

public class IntArrayDeque

extends AbstractIntList

implements IntDeque, Cloneable, Serializable

This class represents an array implementaion of deques of int values.

Since:

1.0

See Also:

LinkedList, Serialized Form

Field Summary

static int	DEFAULT_CAPACITY The default capacity of this deque.
static int	DEFAULT_GROWTH_CHUNK The default chunk size with which to increase the capacity of this deque.
static double	DEFAULT_GROWTH_FACTOR The default factor with which to increase the capacity of this deque.

Constructor Summary

IntArrayDeque()
Creates a new array deque with capacity 10 and a relative growth factor of 1.0.

IntArrayDeque(int capacity)
Creates a new array deque with a specified capacity and a relative growth factor of 1.0.

IntArrayDeque(int[] a)
Creates a new array deque with the same elements as a specified array.

IntArrayDeque(IntCollection c)
Creates a new array deque with the same elements as a specified collection.

IntArrayDeque(int capacity, double growthFactor)
Creates a new array deque with a specified capacity and relative growth factor.

IntArrayDeque(int capacity, int growthChunk)
Creates a new array deque with a specified capacity and absolute growth factor.

Method Summary

void	add(int index, int v) Adds an element to this list at a specified index.
void	addFirst(int v) Adds an element to the beginning of this deque.
void	addLast(int v) Adds an element to the end of this deque.
int	capacity() Returns the current capacity of this deque.
void	clear() Clears this collection.
Object	clone() Returns a clone of this array deque.
boolean	contains(int v) Indicates whether this collection contains a specified element.
int	ensureCapacity(int capacity) Ensures that this deque has at least a specified capacity.
boolean	equals(Object obj) Indicates whether this collection is equal to some object.
int	get(int index) Returns the element at a specified position in this list.
int	getFirst() Returns the first element of this deque.
int	getLast() Returns the last element of this deque.
int	hashCode() Returns a hash code value for this collection.
int	indexOf(int c) Returns the index of the first occurance of a specified element in this list.
boolean	isEmpty() Indicates whether this collection is empty.
int	lastIndexOf(int c) Returns the index of the last occurance of a specified element in this list.
boolean	remove(int v) Removes a specified element from this collection.
int	removeElementAt(int index) Removes the element at a specified index in this list.
int	removeFirst() Removes the first element of this deque.
int	removeLast() Removes the last element of this deque.
int	set(int index, int v) Sets a specified element to a new value.
int	size() Returns the number of elements in this collection.
int[]	toArray(int[] a) Returns the elements of this collection as an array.
void	trimToSize() Minimizes the memory used by this array deque.

Methods inherited from class bak.pcj.list.AbstractIntList

add, addAll, indexOf, iterator, lastIndexOf, listIterator, listIterator

Methods inherited from class bak.pcj.AbstractIntCollection

addAll, containsAll, removeAll, retainAll, toArray, toString

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface bak.pcj.list.IntList

addAll, indexOf, lastIndexOf, listIterator, listIterator

Methods inherited from interface bak.pcj.IntCollection

add, addAll, containsAll, iterator, removeAll, retainAll, toArray

Field Detail

DEFAULT_GROWTH_FACTOR

public static final double DEFAULT_GROWTH_FACTOR

The default factor with which to increase the capacity of this deque.

See Also:

Constant Field Values

DEFAULT_GROWTH_CHUNK

public static final int DEFAULT_GROWTH_CHUNK

The default chunk size with which to increase the capacity of this deque.

See Also:

Constant Field Values

DEFAULT_CAPACITY

public static final int DEFAULT_CAPACITY

The default capacity of this deque.

See Also:

Constant Field Values

Constructor Detail

IntArrayDeque

public IntArrayDeque()

Creates a new array deque with capacity 10 and a relative growth factor of 1.0.

See Also:

IntArrayDeque(int,double)

IntArrayDeque

public IntArrayDeque(IntCollection c)

Creates a new array deque with the same elements as a specified collection. The elements of the specified collection are added to the end of the deque in the collection's iteration order.

Parameters:

c - the collection whose elements to add to the new deque.

Throws:

NullPointerException - if c is null.

IntArrayDeque

public IntArrayDeque(int[] a)

Creates a new array deque with the same elements as a specified array. The elements of the specified array are added the end of the deque in the order in which they appear in the array.

Parameters:

a - the array whose elements to add to the new deque.

Throws:

NullPointerException - if a is null.

Since:

1.1

IntArrayDeque

public IntArrayDeque(int capacity)

Creates a new array deque with a specified capacity and a relative growth factor of 1.0.

Parameters:

capacity - the initial capacity of the deque.

Throws:

IllegalArgumentException - if capacity is negative.

See Also:

IntArrayDeque(int,double)

IntArrayDeque

public IntArrayDeque(int capacity,
                     double growthFactor)

Creates a new array deque with a specified capacity and relative growth factor.

The array capacity increases to capacity()*(1+growthFactor). This strategy is good for avoiding many capacity increases, but the amount of wasted memory is approximately the size of the deque.

Parameters:

capacity - the initial capacity of the deque.

growthFactor - the relative amount with which to increase the the capacity when a capacity increase is needed.

Throws:

IllegalArgumentException - if capacity is negative; if growthFactor is negative.

IntArrayDeque

public IntArrayDeque(int capacity,
                     int growthChunk)

Creates a new array deque with a specified capacity and absolute growth factor.

The array capacity increases to capacity()+growthChunk. This strategy is good for avoiding wasting memory. However, an overhead is potentially introduced by frequent capacity increases.

Parameters:

capacity - the initial capacity of the deque.

growthChunk - the absolute amount with which to increase the the capacity when a capacity increase is needed.

Throws:

IllegalArgumentException - if capacity is negative; if growthChunk is negative.

Method Detail

ensureCapacity

public int ensureCapacity(int capacity)

Ensures that this deque has at least a specified capacity. The actual capacity is calculated from the growth factor or growth chunk specified to the constructor.

Parameters:

capacity - the minimum capacity of this deque.

Returns:

the new capacity of this deque.

See Also:

capacity()

capacity

public int capacity()

Returns the current capacity of this deque. The capacity is the number of elements that the deque can contain without having to increase the amount of memory used.

Returns:

the current capacity of this deque.

See Also:

ensureCapacity(int)

add

public void add(int index,
                int v)

Description copied from interface: IntList

Adds an element to this list at a specified index. All elements from the specified index and forward are pushed to their successor's indices.

Specified by:

add in interface IntList

Overrides:

add in class AbstractIntList

get

public int get(int index)

Description copied from interface: IntList

Returns the element at a specified position in this list.

Specified by:

get in interface IntList

Parameters:

index - the position of the element to return.

Returns:

the element at the specified position.

set

public int set(int index,
               int v)

Description copied from interface: IntList

Sets a specified element to a new value.

Specified by:

set in interface IntList

Parameters:

index - the index of the element whose value to set.

v - the new value of the specified element.

Returns:

the previous value of the element.

removeElementAt

public int removeElementAt(int index)

Description copied from interface: IntList

Removes the element at a specified index in this list. All elements following the removed element are pushed to their predecessor's indices.

Specified by:

removeElementAt in interface IntList

Overrides:

removeElementAt in class AbstractIntList

trimToSize

public void trimToSize()

Minimizes the memory used by this array deque. The underlying array is replaced by an array whose size is exactly the number of elements in this array deque. The method can be used to free up memory after many removals.

Specified by:

trimToSize in interface IntCollection

Overrides:

trimToSize in class AbstractIntCollection

clone

public Object clone()

Returns a clone of this array deque.

Returns:

a clone of this array deque.

Since:

1.1

getFirst

public int getFirst()

Description copied from interface: IntDeque

Returns the first element of this deque.

Specified by:

getFirst in interface IntDeque

Returns:

the first element of this deque.

getLast

public int getLast()

Description copied from interface: IntDeque

Returns the last element of this deque.

Specified by:

getLast in interface IntDeque

Returns:

the first element of this deque.

addFirst

public void addFirst(int v)

Description copied from interface: IntDeque

Adds an element to the beginning of this deque.

Specified by:

addFirst in interface IntDeque

Parameters:

v - the element to add to this deque.

addLast

public void addLast(int v)

Description copied from interface: IntDeque

Adds an element to the end of this deque.

Specified by:

addLast in interface IntDeque

Parameters:

v - the element to add to this deque.

removeFirst

public int removeFirst()

Description copied from interface: IntDeque

Removes the first element of this deque.

Specified by:

removeFirst in interface IntDeque

Returns:

the element that was removed.

removeLast

public int removeLast()

Description copied from interface: IntDeque

Removes the last element of this deque.

Specified by:

removeLast in interface IntDeque

Returns:

the element that was removed.

size

public int size()

Description copied from interface: IntCollection

Returns the number of elements in this collection.

Specified by:

size in interface IntCollection

Overrides:

size in class AbstractIntCollection

isEmpty

public boolean isEmpty()

Description copied from interface: IntCollection

Indicates whether this collection is empty.

Specified by:

isEmpty in interface IntCollection

Overrides:

isEmpty in class AbstractIntCollection

clear

public void clear()

Description copied from interface: IntCollection

Clears this collection.

Specified by:

clear in interface IntCollection

Overrides:

clear in class AbstractIntCollection

contains

public boolean contains(int v)

Description copied from interface: IntCollection

Indicates whether this collection contains a specified element.

Specified by:

contains in interface IntCollection

Overrides:

contains in class AbstractIntCollection

indexOf

public int indexOf(int c)

Description copied from interface: IntList

Returns the index of the first occurance of a specified element in this list.

Specified by:

indexOf in interface IntList

Overrides:

indexOf in class AbstractIntList

lastIndexOf

public int lastIndexOf(int c)

Description copied from interface: IntList

Returns the index of the last occurance of a specified element in this list.

Specified by:

lastIndexOf in interface IntList

Overrides:

lastIndexOf in class AbstractIntList

remove

public boolean remove(int v)

Description copied from interface: IntCollection

Removes a specified element from this collection.

Specified by:

remove in interface IntCollection

Overrides:

remove in class AbstractIntCollection

toArray

public int[] toArray(int[] a)

Description copied from interface: IntCollection

Returns the elements of this collection as an array.

Specified by:

toArray in interface IntCollection

Overrides:

toArray in class AbstractIntCollection

equals

public boolean equals(Object obj)

Description copied from interface: IntCollection

Indicates whether this collection is equal to some object.

Specified by:

equals in interface IntCollection

Overrides:

equals in class AbstractIntList

hashCode

public int hashCode()

Description copied from interface: IntCollection

Returns a hash code value for this collection.

Specified by:

hashCode in interface IntCollection

Overrides:

hashCode in class AbstractIntList