public class ByteArrayList extends AbstractByteList implements RandomAccess, Cloneable, Serializable
This class implements a lightweight, fast, open, optimized,
reuse-oriented version of array-based lists. Instances of this class
represent a list with an array that is enlarged as needed when new entries
are created (by doubling its current length), but is
never made smaller (even on a clear()). A family of
trimming methods lets you control the size of the
backing array; this is particularly useful if you reuse instances of this class.
Range checks are equivalent to those of java.util's classes, but
they are delayed as much as possible. The backing array is exposed by the
elements() method.
This class implements the bulk methods removeElements(),
addElements() and getElements() using
high-performance system calls (e.g., System.arraycopy() instead of
expensive loops.
ArrayList,
Serialized FormAbstractByteList.ByteSubList| Modifier and Type | Field and Description |
|---|---|
static int |
DEFAULT_INITIAL_CAPACITY
The initial default capacity of an array list.
|
| Constructor and Description |
|---|
ByteArrayList()
Creates a new array list with
DEFAULT_INITIAL_CAPACITY capacity. |
ByteArrayList(byte[] a)
Creates a new array list and fills it with the elements of a given array.
|
ByteArrayList(byte[] a,
int offset,
int length)
Creates a new array list and fills it with the elements of a given array.
|
ByteArrayList(ByteCollection c)
Creates a new array list and fills it with a given type-specific collection.
|
ByteArrayList(ByteIterator i)
Creates a new array list and fills it with the elements returned by a type-specific iterator..
|
ByteArrayList(ByteList l)
Creates a new array list and fills it with a given type-specific list.
|
ByteArrayList(Collection<? extends Byte> c)
Creates a new array list and fills it with a given collection.
|
ByteArrayList(int capacity)
Creates a new array list with given capacity.
|
ByteArrayList(Iterator<? extends Byte> i)
Creates a new array list and fills it with the elements returned by an iterator..
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(byte k) |
void |
add(int index,
byte k) |
boolean |
addAll(int index,
ByteCollection c)
Delegates to a more generic method.
|
boolean |
addAll(int index,
ByteList l)
Delegates to a more generic method.
|
void |
addElements(int index,
byte[] a,
int offset,
int length)
Adds elements to this type-specific list using optimized system calls.
|
void |
clear() |
ByteArrayList |
clone() |
int |
compareTo(ByteArrayList l)
Compares this array list to another array list.
|
byte[] |
elements()
Returns the backing array of this list.
|
void |
ensureCapacity(int capacity)
Ensures that this array list can contain the given number of entries without resizing.
|
boolean |
equals(ByteArrayList l)
Compares this type-specific array list to another one.
|
byte |
getByte(int index) |
void |
getElements(int from,
byte[] a,
int offset,
int length)
Copies element of this type-specific list into the given array using optimized system calls.
|
int |
indexOf(byte k) |
boolean |
isEmpty()
Checks whether the stack is empty.
|
int |
lastIndexOf(byte k) |
ByteListIterator |
listIterator(int index)
Returns a type-specific list iterator on the list starting at a given index.
|
boolean |
rem(byte k)
|
byte |
removeByte(int index) |
void |
removeElements(int from,
int to)
Removes elements of this type-specific list using optimized system calls.
|
byte |
set(int index,
byte k) |
int |
size() |
void |
size(int size)
Sets the size of this list.
|
byte[] |
toByteArray(byte[] a)
Returns a primitive type array containing the items of this collection.
|
void |
trim()
Trims this array list so that the capacity is equal to the size.
|
void |
trim(int n)
Trims the backing array if it is too large.
|
static ByteArrayList |
wrap(byte[] a)
Wraps a given array into an array list.
|
static ByteArrayList |
wrap(byte[] a,
int length)
Wraps a given array into an array list of given size.
|
add, addAll, addAll, addAll, addAll, addElements, byteListIterator, byteListIterator, byteSubList, compareTo, contains, equals, get, hashCode, indexOf, iterator, lastIndexOf, listIterator, peek, peekByte, pop, popByte, push, push, remove, remove, set, subList, top, topByte, toStringadd, byteIterator, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toByteArrayadd, contains, containsAll, removeAll, retainAll, toArray, toArraybyteIterator, containsAll, removeAll, retainAll, toArray, toArray, toByteArraypublic static final int DEFAULT_INITIAL_CAPACITY
public ByteArrayList(int capacity)
capacity - the initial capacity of the array list (may be 0).public ByteArrayList()
DEFAULT_INITIAL_CAPACITY capacity.public ByteArrayList(Collection<? extends Byte> c)
c - a collection that will be used to fill the array list.public ByteArrayList(ByteCollection c)
c - a type-specific collection that will be used to fill the array list.public ByteArrayList(ByteList l)
l - a type-specific list that will be used to fill the array list.public ByteArrayList(byte[] a)
a - an array whose elements will be used to fill the array list.public ByteArrayList(byte[] a,
int offset,
int length)
a - an array whose elements will be used to fill the array list.offset - the first element to use.length - the number of elements to use.public ByteArrayList(Iterator<? extends Byte> i)
i - an iterator whose returned elements will fill the array list.public ByteArrayList(ByteIterator i)
i - a type-specific iterator whose returned elements will fill the array list.public byte[] elements()
public static ByteArrayList wrap(byte[] a, int length)
a - an array to wrap.length - the length of the resulting array list.public static ByteArrayList wrap(byte[] a)
a - an array to wrap.public void ensureCapacity(int capacity)
capacity - the new minimum capacity for this array list.public void add(int index,
byte k)
add in interface ByteListadd in class AbstractByteListList.add(int,Object)public boolean add(byte k)
add in interface ByteCollectionadd in interface ByteListadd in class AbstractByteListCollection.add(Object)public byte getByte(int index)
getByte in interface ByteListList.get(int)public int indexOf(byte k)
indexOf in interface ByteListindexOf in class AbstractByteListList.indexOf(Object)public int lastIndexOf(byte k)
lastIndexOf in interface ByteListlastIndexOf in class AbstractByteListList.lastIndexOf(Object)public byte removeByte(int index)
removeByte in interface ByteListremoveByte in class AbstractByteListList.remove(int)public boolean rem(byte k)
ByteCollectionremove(), but the clash
with the similarly named index-based method in the List interface
forces us to use a distinguished name. For simplicity, the set interfaces reinstates
remove().rem in interface ByteCollectionrem in class AbstractByteListCollection.remove(Object)public byte set(int index,
byte k)
set in interface ByteListset in class AbstractByteListList.set(int,Object)public void clear()
clear in interface Collection<Byte>clear in interface List<Byte>clear in class AbstractCollection<Byte>public int size()
size in interface Collection<Byte>size in interface List<Byte>size in class AbstractCollection<Byte>public void size(int size)
ByteListIf the specified size is smaller than the current size, the last elements are
discarded. Otherwise, they are filled with 0/null/false.
size in interface ByteListsize in class AbstractByteListsize - the new size.public boolean isEmpty()
Stackpublic void trim()
ArrayList.trimToSize()public void trim(int n)
n, this method does nothing. Otherwise, it trims the
array length to the maximum between n and size().
This method is useful when reusing lists. Clearing a list leaves the array length untouched. If you are reusing a list many times, you can call this method with a typical size to avoid keeping around a very large array just because of a few large transient lists.
n - the threshold for the trimming.public void getElements(int from,
byte[] a,
int offset,
int length)
getElements in interface ByteListgetElements in class AbstractByteListfrom - the start index (inclusive).a - the destination array.offset - the offset into the destination array where to store the first element copied.length - the number of elements to be copied.public void removeElements(int from,
int to)
removeElements in interface ByteListremoveElements in class AbstractByteListfrom - the start index (inclusive).to - the end index (exclusive).public void addElements(int index,
byte[] a,
int offset,
int length)
addElements in interface ByteListaddElements in class AbstractByteListindex - the index at which to add elements.a - the array containing the elements.offset - the offset of the first element to add.length - the number of elements to add.public byte[] toByteArray(byte[] a)
ByteCollectionNote that, contrarily to Collection.toArray(Object[]), this
methods just writes all elements of this collection: no special
value will be added after the last one.
toByteArray in interface ByteCollectiontoByteArray in class AbstractByteCollectiona - if this array is big enough, it will be used to store this collection.Collection.toArray(Object[])public boolean addAll(int index,
ByteCollection c)
AbstractByteListaddAll in interface ByteListaddAll in class AbstractByteListList.add(int,Object)public boolean addAll(int index,
ByteList l)
AbstractByteListaddAll in interface ByteListaddAll in class AbstractByteListList.add(int,Object)public ByteListIterator listIterator(int index)
ByteListlistIterator in interface ByteListlistIterator in interface List<Byte>listIterator in class AbstractByteListList.listIterator(int)public ByteArrayList clone()
public boolean equals(ByteArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - a type-specific array list.public int compareTo(ByteArrayList l)
This method exists only for sake of efficiency. The implementation inherited from the abstract implementation would already work.
l - an array list.