public class

ShiftList

extends Object
implements IList<T> IQueue<T>
java.lang.Object
   ↳ org.andengine.util.adt.list.ShiftList<T>
Known Direct Subclasses

Class Overview

TODO This class could take some kind of AllocationStrategy object. This implementation is particular useful/efficient for enter/poll operations. Its java.util.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 java.util.LinkedList family). Supports null items. (c) Zynga 2012

Summary

Fields
protected int mHead
protected Object[] mItems
protected int mTail
Public Constructors
ShiftList()
ShiftList(int pInitialCapacity)
Public Methods
void add(T pItem)
void add(int pIndex, 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()
[Expand]
Inherited Methods
From class java.lang.Object
From interface org.andengine.util.adt.list.IList
From interface org.andengine.util.adt.queue.IQueue

Fields

protected int mHead

protected Object[] mItems

protected int mTail

Public Constructors

public ShiftList ()

public ShiftList (int pInitialCapacity)

Public Methods

public void add (T pItem)

public void add (int pIndex, T pItem)

public void clear ()

public void enter (int pIndex, T pItem)

public void enter (T pItem)

public T get (int pIndex)

public int indexOf (T pItem)

public boolean isEmpty ()

public T peek ()

public T poll ()

public T remove (int pIndex)

public boolean remove (T pItem)

public T removeFirst ()

public T removeLast ()

public void set (int pIndex, T pItem)

public void shift ()

public int size ()