org.andengine.util.adt.list

Class ShiftList<T>

java.lang.Object

org.andengine.util.adt.list.ShiftList<T>

All Implemented Interfaces:

IList<T>, IQueue<T>

Direct Known Subclasses:

ShiftQueue

public class ShiftList<T>
extends java.lang.Object
implements IQueue<T>

TODO This class could take some kind of AllocationStrategy object. This implementation is particular useful/efficient for enter/poll operations. Its Queue like behavior performs better than a plain ArrayList, since it automatically shift the contents of its internal Array only when really necessary. Besides sparse allocations to increase the size of the internal Array, ShiftList is allocation free (unlike the LinkedList family). Supports null items. (c) Zynga 2012

Since:

15:02:40 - 24.02.2012

Field Summary

Fields

Modifier and Type	Field and Description
protected int	mHead
protected java.lang.Object[]	mItems
protected int	mTail

Constructor Summary

Constructors

Constructor and Description
ShiftList()
ShiftList(int pInitialCapacity)

Method Summary

Modifier and Type	Method and Description
void	add(int pIndex, T pItem)
void	add(T pItem)
void	clear()
void	enter(int pIndex, T pItem)
void	enter(T pItem)
T	get(int pIndex)
int	indexOf(T pItem)
boolean	isEmpty()
T	peek()
T	poll()
T	remove(int pIndex)
boolean	remove(T pItem)
T	removeFirst()
T	removeLast()
void	set(int pIndex, T pItem)
void	shift()
int	size()

Methods inherited from class java.lang.Object

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

Field Detail

mItems

protected java.lang.Object[] mItems

mHead

protected int mHead

mTail

protected int mTail

Constructor Detail

ShiftList

public ShiftList()

ShiftList

public ShiftList(int pInitialCapacity)

Method Detail

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface IList<T>

get

public T get(int pIndex)
      throws java.lang.ArrayIndexOutOfBoundsException

Specified by:

get in interface IList<T>

Throws:

java.lang.ArrayIndexOutOfBoundsException

set

public void set(int pIndex,
                T pItem)
         throws java.lang.IndexOutOfBoundsException

Specified by:

set in interface IList<T>

Throws:

java.lang.IndexOutOfBoundsException

indexOf

public int indexOf(T pItem)

Specified by:

indexOf in interface IList<T>

peek

public T peek()

Specified by:

peek in interface IQueue<T>

poll

public T poll()

Specified by:

poll in interface IQueue<T>

enter

public void enter(T pItem)

Specified by:

enter in interface IQueue<T>

enter

public void enter(int pIndex,
                  T pItem)
           throws java.lang.ArrayIndexOutOfBoundsException

Specified by:

enter in interface IQueue<T>

Throws:

java.lang.ArrayIndexOutOfBoundsException

add

public void add(T pItem)

Specified by:

add in interface IList<T>

add

public void add(int pIndex,
                T pItem)
         throws java.lang.ArrayIndexOutOfBoundsException

Specified by:

add in interface IList<T>

Throws:

java.lang.ArrayIndexOutOfBoundsException

removeFirst

public T removeFirst()

Specified by:

removeFirst in interface IList<T>

removeLast

public T removeLast()

Specified by:

removeLast in interface IList<T>

remove

public boolean remove(T pItem)

Specified by:

remove in interface IList<T>

remove

public T remove(int pIndex)
         throws java.lang.ArrayIndexOutOfBoundsException

Specified by:

remove in interface IList<T>

Throws:

java.lang.ArrayIndexOutOfBoundsException

size

public int size()

Specified by:

size in interface IList<T>

clear

public void clear()

Specified by:

clear in interface IList<T>

shift

public void shift()