|
GNU Trove | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectgnu.trove.list.array.TShortArrayList
public class TShortArrayList
A resizable, array-backed list of short primitives.
| Field Summary | |
|---|---|
protected short[] |
_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 short |
no_entry_value
the short value that represents null |
| Constructor Summary | |
|---|---|
|
TShortArrayList()
Creates a new TShortArrayList instance with the
default capacity. |
|
TShortArrayList(int capacity)
Creates a new TShortArrayList instance with the
specified capacity. |
|
TShortArrayList(int capacity,
short no_entry_value)
Creates a new TShortArrayList instance with the
specified capacity. |
|
TShortArrayList(short[] values)
Creates a new TShortArrayList instance whose
capacity is the length of values array and whose
initial contents are the specified values. |
protected |
TShortArrayList(short[] values,
short no_entry_value,
boolean wrap)
|
|
TShortArrayList(TShortCollection collection)
Creates a new TShortArrayList instance that contains
a copy of the collection passed to us. |
| Method Summary | |
|---|---|
boolean |
add(short val)
Adds val to the end of the list, growing as needed. |
void |
add(short[] vals)
Adds the values in the array vals to the end of the list, in order. |
void |
add(short[] 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(java.util.Collection<? extends java.lang.Short> collection)
Adds all of the elements in collection to the collection. |
boolean |
addAll(short[] array)
Adds all of the elements in the array to the collection. |
boolean |
addAll(TShortCollection collection)
Adds all of the elements in the TShortCollection to the collection. |
int |
binarySearch(short value)
Performs a binary search for value in the entire list. |
int |
binarySearch(short 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(short value)
Searches the list for value |
boolean |
containsAll(java.util.Collection<?> collection)
Tests the collection to determine if all of the elements in collection are present. |
boolean |
containsAll(short[] array)
Tests the collection to determine if all of the elements in array are present. |
boolean |
containsAll(TShortCollection collection)
Tests the collection to determine if all of the elements in TShortCollection 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(int fromIndex,
int toIndex,
short val)
Fills a range in the list with the specified value. |
void |
fill(short val)
Fills every slot in the list with the specified value. |
boolean |
forEach(TShortProcedure procedure)
Applies the procedure to each value in the list in ascending (front to back) order. |
boolean |
forEachDescending(TShortProcedure procedure)
Applies the procedure to each value in the list in descending (back to front) order. |
short |
get(int offset)
Returns the value at the specified offset. |
short |
getNoEntryValue()
Returns the value that is used to represent null. |
short |
getQuick(int offset)
Returns the value at the specified offset without doing any bounds checking. |
TShortList |
grep(TShortProcedure 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(int offset,
short value)
Searches the list front to back for the index of value, starting at offset. |
int |
indexOf(short value)
Searches the list front to back for the index of value. |
void |
insert(int offset,
short value)
Inserts value into the list at offset. |
void |
insert(int offset,
short[] values)
Inserts the array of values into the list at offset. |
void |
insert(int offset,
short[] values,
int valOffset,
int len)
Inserts a slice of the array of values into the list at offset. |
TShortList |
inverseGrep(TShortProcedure condition)
Searches the list for values which do not satisfy condition. |
boolean |
isEmpty()
Tests whether this list contains any values. |
TShortIterator |
iterator()
Creates an iterator over the values of the collection. |
int |
lastIndexOf(int offset,
short value)
Searches the list back to front for the last index of value, starting at offset. |
int |
lastIndexOf(short value)
Searches the list back to front for the last index of value. |
short |
max()
Finds the maximum value in the list. |
short |
min()
Finds the minimum value in the list. |
void |
readExternal(java.io.ObjectInput in)
|
void |
remove(int offset,
int length)
Removes length values from the list, starting at offset |
boolean |
remove(short value)
Removes value from the list. |
boolean |
removeAll(java.util.Collection<?> collection)
Removes all of the elements in collection from the collection. |
boolean |
removeAll(short[] array)
Removes all of the elements in array from the collection. |
boolean |
removeAll(TShortCollection collection)
Removes all of the elements in TShortCollection from the collection. |
short |
removeAt(int offset)
Removes value at a given offset from the list. |
short |
replace(int offset,
short 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(java.util.Collection<?> collection)
Removes any values in the collection which are not contained in collection. |
boolean |
retainAll(short[] array)
Removes any values in the collection which are not contained in array. |
boolean |
retainAll(TShortCollection collection)
Removes any values in the collection which are not contained in TShortCollection. |
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. |
short |
set(int offset,
short val)
Sets the value at the specified offset. |
void |
set(int offset,
short[] values)
Replace the values in the list starting at offset with the contents of the values array. |
void |
set(int offset,
short[] 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,
short 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. |
TShortList |
subList(int begin,
int end)
Returns a sublist of this list. |
short |
sum()
Calculates the sum of all the values in the list. |
short[] |
toArray()
Copies the contents of the list into a native array. |
short[] |
toArray(int offset,
int len)
Copies a slice of the list into a native array. |
short[] |
toArray(short[] dest)
Copies a slice of the list into a native array. |
short[] |
toArray(short[] dest,
int offset,
int len)
Copies a slice of the list into a native array. |
short[] |
toArray(short[] dest,
int source_pos,
int dest_pos,
int len)
Copies a slice of the list into a native array. |
java.lang.String |
toString()
|
void |
transformValues(TShortFunction 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 TShortArrayList |
wrap(short[] values)
Returns a primitive List implementation that wraps around the given primitive array. |
static TShortArrayList |
wrap(short[] values,
short 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 short[] _data
protected int _pos
protected static final int DEFAULT_CAPACITY
protected short no_entry_value
| Constructor Detail |
|---|
public TShortArrayList()
TShortArrayList instance with the
default capacity.
public TShortArrayList(int capacity)
TShortArrayList instance with the
specified capacity.
capacity - an int value
public TShortArrayList(int capacity,
short no_entry_value)
TShortArrayList instance with the
specified capacity.
capacity - an int valueno_entry_value - an short value that represents null.public TShortArrayList(TShortCollection collection)
TShortArrayList instance that contains
a copy of the collection passed to us.
collection - the collection to copypublic TShortArrayList(short[] values)
TShortArrayList 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 short[] value
protected TShortArrayList(short[] values,
short no_entry_value,
boolean wrap)
| Method Detail |
|---|
public static TShortArrayList wrap(short[] values)
values -
public static TShortArrayList wrap(short[] values,
short no_entry_value)
values - no_entry_value -
public short getNoEntryValue()
getNoEntryValue in interface TShortListgetNoEntryValue in interface TShortCollectionpublic void ensureCapacity(int capacity)
public int size()
size in interface TShortListsize in interface TShortCollectionpublic boolean isEmpty()
isEmpty in interface TShortListisEmpty in interface TShortCollectionpublic void trimToSize()
public boolean add(short val)
add in interface TShortListadd in interface TShortCollectionval - an short value
public void add(short[] vals)
add in interface TShortListvals - an short[] value
public void add(short[] vals,
int offset,
int length)
add in interface TShortListvals - an short[] valueoffset - the offset at which to start copyinglength - the number of values to copy.
public void insert(int offset,
short value)
insert in interface TShortListoffset - an int valuevalue - an short value
public void insert(int offset,
short[] values)
insert in interface TShortListoffset - an int valuevalues - an short[] value
public void insert(int offset,
short[] values,
int valOffset,
int len)
insert in interface TShortListoffset - an int valuevalues - an short[] valuevalOffset - the offset in the values array at which to
start copying.len - the number of values to copy from the values arraypublic short get(int offset)
get in interface TShortListoffset - an int value
short valuepublic short getQuick(int offset)
public short set(int offset,
short val)
set in interface TShortListoffset - an int valueval - an short value
public short replace(int offset,
short val)
replace in interface TShortListoffset - an int valueval - an short value
public void set(int offset,
short[] values)
set in interface TShortListoffset - the first offset to replacevalues - the source of the new values
public void set(int offset,
short[] values,
int valOffset,
int length)
set in interface TShortListoffset - 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,
short val)
public void clear()
clear in interface TShortListclear in interface TShortCollectionpublic 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(short value)
remove in interface TShortListremove in interface TShortCollectionvalue - an short value
public short removeAt(int offset)
removeAt in interface TShortListoffset - an int value that represents
the offset to the element to be removed
public void remove(int offset,
int length)
remove in interface TShortListoffset - an int valuelength - an int valuepublic TShortIterator iterator()
iterator in interface TShortCollectionTShortIterator valuepublic boolean containsAll(java.util.Collection<?> collection)
containsAll in interface TShortCollectioncollection - a Collection value
public boolean containsAll(TShortCollection collection)
containsAll in interface TShortCollectioncollection - a TShortCollection value
public boolean containsAll(short[] array)
containsAll in interface TShortCollectionarray - as array of short primitives.
public boolean addAll(java.util.Collection<? extends java.lang.Short> collection)
addAll in interface TShortCollectioncollection - a Collection value
public boolean addAll(TShortCollection collection)
addAll in interface TShortCollectioncollection - a TShortCollection value
public boolean addAll(short[] array)
addAll in interface TShortCollectionarray - a array of short primitives.
public boolean retainAll(java.util.Collection<?> collection)
retainAll in interface TShortCollectioncollection - a Collection value
public boolean retainAll(TShortCollection collection)
retainAll in interface TShortCollectioncollection - a TShortCollection value
public boolean retainAll(short[] array)
retainAll in interface TShortCollectionarray - an array of short primitives.
public boolean removeAll(java.util.Collection<?> collection)
removeAll in interface TShortCollectioncollection - a Collection value
public boolean removeAll(TShortCollection collection)
removeAll in interface TShortCollectioncollection - a TShortCollection value
public boolean removeAll(short[] array)
removeAll in interface TShortCollectionarray - an array of short primitives.
public void transformValues(TShortFunction function)
transformValues in interface TShortListfunction - a TShortFunction valuepublic void reverse()
reverse in interface TShortList
public void reverse(int from,
int to)
reverse in interface TShortListfrom - 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 TShortListrand - a Random value
public TShortList subList(int begin,
int end)
subList in interface TShortListbegin - low endpoint (inclusive) of the subList.end - high endpoint (exclusive) of the subList.
public short[] toArray()
toArray in interface TShortListtoArray in interface TShortCollectionshort[] value
public short[] toArray(int offset,
int len)
toArray in interface TShortListoffset - the offset at which to start copyinglen - the number of values to copy.
short[] valuepublic short[] toArray(short[] 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
TShortList.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 TShortListtoArray in interface TShortCollectiondest - the array to copy into.
public short[] toArray(short[] dest,
int offset,
int len)
toArray in interface TShortListdest - the array to copy into.offset - the offset where the first value should be copiedlen - the number of values to copy.
public short[] toArray(short[] dest,
int source_pos,
int dest_pos,
int len)
toArray in interface TShortListdest - 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 TShortCollectionequals in class java.lang.Objectother - object to be compared for equality with this collection
public int hashCode()
Object.hashCode().
hashCode in interface TShortCollectionhashCode in class java.lang.ObjectObject.equals(Object),
Collection.equals(Object)public boolean forEach(TShortProcedure procedure)
forEach in interface TShortListforEach in interface TShortCollectionprocedure - a TShortProcedure value
public boolean forEachDescending(TShortProcedure procedure)
forEachDescending in interface TShortListprocedure - a TShortProcedure value
public void sort()
sort in interface TShortListArrays.sort(long[])
public void sort(int fromIndex,
int toIndex)
sort in interface TShortListfromIndex - the index at which to start sorting (inclusive)toIndex - the index at which to stop sorting (exclusive)Arrays.sort(long[])public void fill(short val)
fill in interface TShortListval - the value to use when filling
public void fill(int fromIndex,
int toIndex,
short val)
fill in interface TShortListfromIndex - 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(short value)
binarySearch in interface TShortListvalue - the value to search for
public int binarySearch(short value,
int fromIndex,
int toIndex)
binarySearch in interface TShortListvalue - the value to search forfromIndex - the lower boundary of the range (inclusive)toIndex - the upper boundary of the range (exclusive)
public int indexOf(short value)
indexOf in interface TShortListvalue - an short value
for faster searches on sorted lists
public int indexOf(int offset,
short value)
indexOf in interface TShortListoffset - the offset at which to start the linear search
(inclusive)value - an short value
for faster searches on sorted listspublic int lastIndexOf(short value)
lastIndexOf in interface TShortListvalue - an short value
for faster searches on sorted lists
public int lastIndexOf(int offset,
short value)
lastIndexOf in interface TShortListoffset - the offset at which to start the linear search
(exclusive)value - an short value
for faster searches on sorted listspublic boolean contains(short value)
contains in interface TShortListcontains in interface TShortCollectionvalue - an short value
public TShortList grep(TShortProcedure condition)
grep in interface TShortListcondition - a condition to apply to each element in the list
public TShortList inverseGrep(TShortProcedure condition)
grep -v.
inverseGrep in interface TShortListcondition - a condition to apply to each element in the list
public short max()
max in interface TShortListpublic short min()
min in interface TShortListpublic short sum()
sum in interface TShortListpublic 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 | ||||||||