|
GNU Trove | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectgnu.trove.list.array.TByteArrayList
public class TByteArrayList
A resizable, array-backed list of byte primitives.
| Field Summary | |
|---|---|
protected byte[] |
_data
the data of the list |
protected int |
_pos
the index after the last entry in the list |
protected static int |
DEFAULT_CAPACITY
the default capacity for new lists |
protected byte |
no_entry_value
the byte value that represents null |
| Constructor Summary | |
|---|---|
|
TByteArrayList()
Creates a new TByteArrayList instance with the
default capacity. |
|
TByteArrayList(byte[] values)
Creates a new TByteArrayList instance whose
capacity is the length of values array and whose
initial contents are the specified values. |
protected |
TByteArrayList(byte[] values,
byte no_entry_value,
boolean wrap)
|
|
TByteArrayList(int capacity)
Creates a new TByteArrayList instance with the
specified capacity. |
|
TByteArrayList(int capacity,
byte no_entry_value)
Creates a new TByteArrayList instance with the
specified capacity. |
|
TByteArrayList(TByteCollection collection)
Creates a new TByteArrayList instance that contains
a copy of the collection passed to us. |
| Method Summary | |
|---|---|
boolean |
add(byte val)
Adds val to the end of the list, growing as needed. |
void |
add(byte[] vals)
Adds the values in the array vals to the end of the list, in order. |
void |
add(byte[] vals,
int offset,
int length)
Adds a subset of the values in the array vals to the end of the list, in order. |
boolean |
addAll(byte[] array)
Adds all of the elements in the array to the collection. |
boolean |
addAll(java.util.Collection<? extends java.lang.Byte> collection)
Adds all of the elements in collection to the collection. |
boolean |
addAll(TByteCollection collection)
Adds all of the elements in the TByteCollection to the collection. |
int |
binarySearch(byte value)
Performs a binary search for value in the entire list. |
int |
binarySearch(byte value,
int fromIndex,
int toIndex)
Performs a binary search for value in the specified range. |
void |
clear()
Flushes the internal state of the list, resetting the capacity to the default. |
void |
clear(int capacity)
Flushes the internal state of the list, setting the capacity of the empty list to capacity. |
boolean |
contains(byte value)
Searches the list for value |
boolean |
containsAll(byte[] array)
Tests the collection to determine if all of the elements in array are present. |
boolean |
containsAll(java.util.Collection<?> collection)
Tests the collection to determine if all of the elements in collection are present. |
boolean |
containsAll(TByteCollection collection)
Tests the collection to determine if all of the elements in TByteCollection are present. |
void |
ensureCapacity(int capacity)
Grow the internal array as needed to accommodate the specified number of elements. |
boolean |
equals(java.lang.Object other)
Compares the specified object with this collection for equality. |
void |
fill(byte val)
Fills every slot in the list with the specified value. |
void |
fill(int fromIndex,
int toIndex,
byte val)
Fills a range in the list with the specified value. |
boolean |
forEach(TByteProcedure procedure)
Applies the procedure to each value in the list in ascending (front to back) order. |
boolean |
forEachDescending(TByteProcedure procedure)
Applies the procedure to each value in the list in descending (back to front) order. |
byte |
get(int offset)
Returns the value at the specified offset. |
byte |
getNoEntryValue()
Returns the value that is used to represent null. |
byte |
getQuick(int offset)
Returns the value at the specified offset without doing any bounds checking. |
TByteList |
grep(TByteProcedure condition)
Searches the list for values satisfying condition in the manner of the *nix grep utility. |
int |
hashCode()
Returns the hash code value for this collection. |
int |
indexOf(byte value)
Searches the list front to back for the index of value. |
int |
indexOf(int offset,
byte value)
Searches the list front to back for the index of value, starting at offset. |
void |
insert(int offset,
byte value)
Inserts value into the list at offset. |
void |
insert(int offset,
byte[] values)
Inserts the array of values into the list at offset. |
void |
insert(int offset,
byte[] values,
int valOffset,
int len)
Inserts a slice of the array of values into the list at offset. |
TByteList |
inverseGrep(TByteProcedure condition)
Searches the list for values which do not satisfy condition. |
boolean |
isEmpty()
Tests whether this list contains any values. |
TByteIterator |
iterator()
Creates an iterator over the values of the collection. |
int |
lastIndexOf(byte value)
Searches the list back to front for the last index of value. |
int |
lastIndexOf(int offset,
byte value)
Searches the list back to front for the last index of value, starting at offset. |
byte |
max()
Finds the maximum value in the list. |
byte |
min()
Finds the minimum value in the list. |
void |
readExternal(java.io.ObjectInput in)
|
boolean |
remove(byte value)
Removes value from the list. |
void |
remove(int offset,
int length)
Removes length values from the list, starting at offset |
boolean |
removeAll(byte[] array)
Removes all of the elements in array from the collection. |
boolean |
removeAll(java.util.Collection<?> collection)
Removes all of the elements in collection from the collection. |
boolean |
removeAll(TByteCollection collection)
Removes all of the elements in TByteCollection from the collection. |
byte |
removeAt(int offset)
Removes value at a given offset from the list. |
byte |
replace(int offset,
byte val)
Sets the value at the specified offset and returns the previously stored value. |
void |
reset()
Sets the size of the list to 0, but does not change its capacity. |
void |
resetQuick()
Sets the size of the list to 0, but does not change its capacity. |
boolean |
retainAll(byte[] array)
Removes any values in the collection which are not contained in array. |
boolean |
retainAll(java.util.Collection<?> collection)
Removes any values in the collection which are not contained in collection. |
boolean |
retainAll(TByteCollection collection)
Removes any values in the collection which are not contained in TByteCollection. |
void |
reverse()
Reverse the order of the elements in the list. |
void |
reverse(int from,
int to)
Reverse the order of the elements in the range of the list. |
byte |
set(int offset,
byte val)
Sets the value at the specified offset. |
void |
set(int offset,
byte[] values)
Replace the values in the list starting at offset with the contents of the values array. |
void |
set(int offset,
byte[] values,
int valOffset,
int length)
Replace the values in the list starting at offset with length values from the values array, starting at valOffset. |
void |
setQuick(int offset,
byte val)
Sets the value at the specified offset without doing any bounds checking. |
void |
shuffle(java.util.Random rand)
Shuffle the elements of the list using the specified random number generator. |
int |
size()
Returns the number of values in the list. |
void |
sort()
Sort the values in the list (ascending) using the Sun quicksort implementation. |
void |
sort(int fromIndex,
int toIndex)
Sort a slice of the list (ascending) using the Sun quicksort implementation. |
TByteList |
subList(int begin,
int end)
Returns a sublist of this list. |
byte |
sum()
Calculates the sum of all the values in the list. |
byte[] |
toArray()
Copies the contents of the list into a native array. |
byte[] |
toArray(byte[] dest)
Copies a slice of the list into a native array. |
byte[] |
toArray(byte[] dest,
int offset,
int len)
Copies a slice of the list into a native array. |
byte[] |
toArray(byte[] dest,
int source_pos,
int dest_pos,
int len)
Copies a slice of the list into a native array. |
byte[] |
toArray(int offset,
int len)
Copies a slice of the list into a native array. |
java.lang.String |
toString()
|
void |
transformValues(TByteFunction function)
Transform each value in the list using the specified function. |
void |
trimToSize()
Sheds any excess capacity above and beyond the current size of the list. |
static TByteArrayList |
wrap(byte[] values)
Returns a primitive List implementation that wraps around the given primitive array. |
static TByteArrayList |
wrap(byte[] values,
byte no_entry_value)
Returns a primitive List implementation that wraps around the given primitive array. |
void |
writeExternal(java.io.ObjectOutput out)
|
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
protected byte[] _data
protected int _pos
protected static final int DEFAULT_CAPACITY
protected byte no_entry_value
| Constructor Detail |
|---|
public TByteArrayList()
TByteArrayList instance with the
default capacity.
public TByteArrayList(int capacity)
TByteArrayList instance with the
specified capacity.
capacity - an int value
public TByteArrayList(int capacity,
byte no_entry_value)
TByteArrayList instance with the
specified capacity.
capacity - an int valueno_entry_value - an byte value that represents null.public TByteArrayList(TByteCollection collection)
TByteArrayList instance that contains
a copy of the collection passed to us.
collection - the collection to copypublic TByteArrayList(byte[] values)
TByteArrayList instance whose
capacity is the length of values array and whose
initial contents are the specified values.
A defensive copy of the given values is held by the new instance.
values - an byte[] value
protected TByteArrayList(byte[] values,
byte no_entry_value,
boolean wrap)
| Method Detail |
|---|
public static TByteArrayList wrap(byte[] values)
values -
public static TByteArrayList wrap(byte[] values,
byte no_entry_value)
values - no_entry_value -
public byte getNoEntryValue()
getNoEntryValue in interface TByteListgetNoEntryValue in interface TByteCollectionpublic void ensureCapacity(int capacity)
public int size()
size in interface TByteListsize in interface TByteCollectionpublic boolean isEmpty()
isEmpty in interface TByteListisEmpty in interface TByteCollectionpublic void trimToSize()
public boolean add(byte val)
add in interface TByteListadd in interface TByteCollectionval - an byte value
public void add(byte[] vals)
add in interface TByteListvals - an byte[] value
public void add(byte[] vals,
int offset,
int length)
add in interface TByteListvals - an byte[] valueoffset - the offset at which to start copyinglength - the number of values to copy.
public void insert(int offset,
byte value)
insert in interface TByteListoffset - an int valuevalue - an byte value
public void insert(int offset,
byte[] values)
insert in interface TByteListoffset - an int valuevalues - an byte[] value
public void insert(int offset,
byte[] values,
int valOffset,
int len)
insert in interface TByteListoffset - an int valuevalues - an byte[] valuevalOffset - the offset in the values array at which to
start copying.len - the number of values to copy from the values arraypublic byte get(int offset)
get in interface TByteListoffset - an int value
byte valuepublic byte getQuick(int offset)
public byte set(int offset,
byte val)
set in interface TByteListoffset - an int valueval - an byte value
public byte replace(int offset,
byte val)
replace in interface TByteListoffset - an int valueval - an byte value
public void set(int offset,
byte[] values)
set in interface TByteListoffset - the first offset to replacevalues - the source of the new values
public void set(int offset,
byte[] values,
int valOffset,
int length)
set in interface TByteListoffset - the first offset to replacevalues - the source of the new valuesvalOffset - the first value to copy from the values arraylength - the number of values to copy
public void setQuick(int offset,
byte val)
public void clear()
clear in interface TByteListclear in interface TByteCollectionpublic void clear(int capacity)
public void reset()
clear() method if you want to recycle a
list without allocating new backing arrays.
public void resetQuick()
clear() method if you want to recycle a
list without allocating new backing arrays. This method differs from
reset() in that it does not clear the old values in the backing array.
Thus, it is possible for getQuick to return stale data if this method is used and
the caller is careless about bounds checking.
public boolean remove(byte value)
remove in interface TByteListremove in interface TByteCollectionvalue - an byte value
public byte removeAt(int offset)
removeAt in interface TByteListoffset - an int value that represents
the offset to the element to be removed
public void remove(int offset,
int length)
remove in interface TByteListoffset - an int valuelength - an int valuepublic TByteIterator iterator()
iterator in interface TByteCollectionTByteIterator valuepublic boolean containsAll(java.util.Collection<?> collection)
containsAll in interface TByteCollectioncollection - a Collection value
public boolean containsAll(TByteCollection collection)
containsAll in interface TByteCollectioncollection - a TByteCollection value
public boolean containsAll(byte[] array)
containsAll in interface TByteCollectionarray - as array of byte primitives.
public boolean addAll(java.util.Collection<? extends java.lang.Byte> collection)
addAll in interface TByteCollectioncollection - a Collection value
public boolean addAll(TByteCollection collection)
addAll in interface TByteCollectioncollection - a TByteCollection value
public boolean addAll(byte[] array)
addAll in interface TByteCollectionarray - a array of byte primitives.
public boolean retainAll(java.util.Collection<?> collection)
retainAll in interface TByteCollectioncollection - a Collection value
public boolean retainAll(TByteCollection collection)
retainAll in interface TByteCollectioncollection - a TByteCollection value
public boolean retainAll(byte[] array)
retainAll in interface TByteCollectionarray - an array of byte primitives.
public boolean removeAll(java.util.Collection<?> collection)
removeAll in interface TByteCollectioncollection - a Collection value
public boolean removeAll(TByteCollection collection)
removeAll in interface TByteCollectioncollection - a TByteCollection value
public boolean removeAll(byte[] array)
removeAll in interface TByteCollectionarray - an array of byte primitives.
public void transformValues(TByteFunction function)
transformValues in interface TByteListfunction - a TByteFunction valuepublic void reverse()
reverse in interface TByteList
public void reverse(int from,
int to)
reverse in interface TByteListfrom - the inclusive index at which to start reversingto - the exclusive index at which to stop reversingpublic void shuffle(java.util.Random rand)
shuffle in interface TByteListrand - a Random value
public TByteList subList(int begin,
int end)
subList in interface TByteListbegin - low endpoint (inclusive) of the subList.end - high endpoint (exclusive) of the subList.
public byte[] toArray()
toArray in interface TByteListtoArray in interface TByteCollectionbyte[] value
public byte[] toArray(int offset,
int len)
toArray in interface TByteListoffset - the offset at which to start copyinglen - the number of values to copy.
byte[] valuepublic byte[] toArray(byte[] dest)
If the list fits in the specified array with room to spare (i.e.,
the array has more elements than the list), the element in the array
immediately following the end of the list is set to
TByteList.getNoEntryValue().
(This is useful in determining the length of the list only if
the caller knows that the list does not contain any "null" elements.)
NOTE: Trove does not allocate a new array if the array passed in is not large enough to hold all of the data elements. It will instead fill the array passed in.
toArray in interface TByteListtoArray in interface TByteCollectiondest - the array to copy into.
public byte[] toArray(byte[] dest,
int offset,
int len)
toArray in interface TByteListdest - the array to copy into.offset - the offset where the first value should be copiedlen - the number of values to copy.
public byte[] toArray(byte[] dest,
int source_pos,
int dest_pos,
int len)
toArray in interface TByteListdest - the array to copy into.source_pos - the offset of the first value to copydest_pos - the offset where the first value should be copiedlen - the number of values to copy.
public boolean equals(java.lang.Object other)
equals in interface TByteCollectionequals in class java.lang.Objectother - object to be compared for equality with this collection
public int hashCode()
Object.hashCode().
hashCode in interface TByteCollectionhashCode in class java.lang.ObjectObject.equals(Object),
Collection.equals(Object)public boolean forEach(TByteProcedure procedure)
forEach in interface TByteListforEach in interface TByteCollectionprocedure - a TByteProcedure value
public boolean forEachDescending(TByteProcedure procedure)
forEachDescending in interface TByteListprocedure - a TByteProcedure value
public void sort()
sort in interface TByteListArrays.sort(long[])
public void sort(int fromIndex,
int toIndex)
sort in interface TByteListfromIndex - the index at which to start sorting (inclusive)toIndex - the index at which to stop sorting (exclusive)Arrays.sort(long[])public void fill(byte val)
fill in interface TByteListval - the value to use when filling
public void fill(int fromIndex,
int toIndex,
byte val)
fill in interface TByteListfromIndex - the offset at which to start filling (inclusive)toIndex - the offset at which to stop filling (exclusive)val - the value to use when fillingpublic int binarySearch(byte value)
binarySearch in interface TByteListvalue - the value to search for
public int binarySearch(byte value,
int fromIndex,
int toIndex)
binarySearch in interface TByteListvalue - the value to search forfromIndex - the lower boundary of the range (inclusive)toIndex - the upper boundary of the range (exclusive)
public int indexOf(byte value)
indexOf in interface TByteListvalue - an byte value
for faster searches on sorted lists
public int indexOf(int offset,
byte value)
indexOf in interface TByteListoffset - the offset at which to start the linear search
(inclusive)value - an byte value
for faster searches on sorted listspublic int lastIndexOf(byte value)
lastIndexOf in interface TByteListvalue - an byte value
for faster searches on sorted lists
public int lastIndexOf(int offset,
byte value)
lastIndexOf in interface TByteListoffset - the offset at which to start the linear search
(exclusive)value - an byte value
for faster searches on sorted listspublic boolean contains(byte value)
contains in interface TByteListcontains in interface TByteCollectionvalue - an byte value
public TByteList grep(TByteProcedure condition)
grep in interface TByteListcondition - a condition to apply to each element in the list
public TByteList inverseGrep(TByteProcedure condition)
grep -v.
inverseGrep in interface TByteListcondition - a condition to apply to each element in the list
public byte max()
max in interface TByteListpublic byte min()
min in interface TByteListpublic byte sum()
sum in interface TByteListpublic java.lang.String toString()
toString in class java.lang.Object
public void writeExternal(java.io.ObjectOutput out)
throws java.io.IOException
writeExternal in interface java.io.Externalizablejava.io.IOException
public void readExternal(java.io.ObjectInput in)
throws java.io.IOException,
java.lang.ClassNotFoundException
readExternal in interface java.io.Externalizablejava.io.IOException
java.lang.ClassNotFoundException
|
GNU Trove | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||