|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface TIntList
Interface for Trove list implementations.
| Method Summary | |
|---|---|
boolean |
add(int val)
Adds val to the end of the list, growing as needed. |
void |
add(int[] vals)
Adds the values in the array vals to the end of the list, in order. |
void |
add(int[] vals,
int offset,
int length)
Adds a subset of the values in the array vals to the end of the list, in order. |
int |
binarySearch(int value)
Performs a binary search for value in the entire list. |
int |
binarySearch(int 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. |
boolean |
contains(int value)
Searches the list for value |
void |
fill(int val)
Fills every slot in the list with the specified value. |
void |
fill(int fromIndex,
int toIndex,
int val)
Fills a range in the list with the specified value. |
boolean |
forEach(TIntProcedure procedure)
Applies the procedure to each value in the list in ascending (front to back) order. |
boolean |
forEachDescending(TIntProcedure procedure)
Applies the procedure to each value in the list in descending (back to front) order. |
int |
get(int offset)
Returns the value at the specified offset. |
int |
getNoEntryValue()
Returns the value that is used to represent null. |
TIntList |
grep(TIntProcedure condition)
Searches the list for values satisfying condition in the manner of the *nix grep utility. |
int |
indexOf(int value)
Searches the list front to back for the index of value. |
int |
indexOf(int offset,
int value)
Searches the list front to back for the index of value, starting at offset. |
void |
insert(int offset,
int value)
Inserts value into the list at offset. |
void |
insert(int offset,
int[] values)
Inserts the array of values into the list at offset. |
void |
insert(int offset,
int[] values,
int valOffset,
int len)
Inserts a slice of the array of values into the list at offset. |
TIntList |
inverseGrep(TIntProcedure condition)
Searches the list for values which do not satisfy condition . |
boolean |
isEmpty()
Tests whether this list contains any values. |
int |
lastIndexOf(int value)
Searches the list back to front for the last index of value. |
int |
lastIndexOf(int offset,
int value)
Searches the list back to front for the last index of value, starting at offset. |
int |
max()
Finds the maximum value in the list. |
int |
min()
Finds the minimum value in the list. |
boolean |
remove(int value)
Removes value from the list. |
void |
remove(int offset,
int length)
Removes length values from the list, starting at offset |
int |
removeAt(int offset)
Removes value at a given offset from the list. |
int |
replace(int offset,
int val)
Sets the value at the specified offset and returns the previously stored value. |
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. |
int |
set(int offset,
int val)
Sets the value at the specified offset. |
void |
set(int offset,
int[] values)
Replace the values in the list starting at offset with the contents of the values array. |
void |
set(int offset,
int[] 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 |
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. |
TIntList |
subList(int begin,
int end)
Returns a sublist of this list. |
int[] |
toArray()
Copies the contents of the list into a native array. |
int[] |
toArray(int[] dest)
Copies a slice of the list into a native array. |
int[] |
toArray(int[] dest,
int offset,
int len)
Copies a slice of the list into a native array. |
int[] |
toArray(int[] dest,
int source_pos,
int dest_pos,
int len)
Copies a slice of the list into a native array. |
int[] |
toArray(int offset,
int len)
Copies a slice of the list into a native array. |
void |
transformValues(TIntFunction function)
Transform each value in the list using the specified function. |
| Methods inherited from interface gnu.trove.TIntCollection |
|---|
addAll, addAll, addAll, containsAll, containsAll, containsAll, equals, hashCode, iterator, removeAll, removeAll, removeAll, retainAll, retainAll, retainAll |
| Method Detail |
|---|
boolean add(int val)
add in interface TIntCollectionval - an int value
void add(int[] vals)
vals - an int[] value
void add(int[] vals,
int offset,
int length)
vals - an int[] valueoffset - the offset at which to start copyinglength - the number of values to copy.int binarySearch(int value)
value - the value to search for
int binarySearch(int value,
int fromIndex,
int toIndex)
value - the value to search forfromIndex - the lower boundary of the range (inclusive)toIndex - the upper boundary of the range (exclusive)
void clear()
clear in interface TIntCollectionboolean contains(int value)
contains in interface TIntCollectionvalue - an int value
void fill(int val)
val - the value to use when filling
void fill(int fromIndex,
int toIndex,
int val)
fromIndex - the offset at which to start filling (inclusive)toIndex - the offset at which to stop filling (exclusive)val - the value to use when fillingboolean forEach(TIntProcedure procedure)
forEach in interface TIntCollectionprocedure - a TIntProcedure value
boolean forEachDescending(TIntProcedure procedure)
procedure - a TIntProcedure value
int get(int offset)
offset - an int value
int valueint getNoEntryValue()
getNoEntryValue in interface TIntCollectionTIntList grep(TIntProcedure condition)
condition - a condition to apply to each element in the list
int indexOf(int value)
value - an int value
for faster searches on sorted lists
int indexOf(int offset,
int value)
offset - the offset at which to start the linear search (inclusive)value - an int value
for faster searches on sorted lists
void insert(int offset,
int value)
offset - an int valuevalue - an int value
void insert(int offset,
int[] values)
offset - an int valuevalues - an int[] value
void insert(int offset,
int[] values,
int valOffset,
int len)
offset - an int valuevalues - an int[] valuevalOffset - the offset in the values array at which to start copying.len - the number of values to copy from the values arrayTIntList inverseGrep(TIntProcedure condition)
grep -v.
condition - a condition to apply to each element in the list
boolean isEmpty()
isEmpty in interface TIntCollectionint lastIndexOf(int value)
value - an int value
for faster searches on sorted lists
int lastIndexOf(int offset,
int value)
offset - the offset at which to start the linear search (exclusive)value - an int value
for faster searches on sorted listsint max()
java.lang.IllegalStateException - if the list is emptyint min()
java.lang.IllegalStateException - if the list is emptyboolean remove(int value)
remove in interface TIntCollectionvalue - an int value
void remove(int offset,
int length)
offset - an int valuelength - an int valueint removeAt(int offset)
offset - an int value that represents the offset to the element
to be removed
int replace(int offset,
int val)
offset - an int valueval - an int value
void reverse()
void reverse(int from,
int to)
from - the inclusive index at which to start reversingto - the exclusive index at which to stop reversing
int set(int offset,
int val)
offset - an int valueval - an int value
void set(int offset,
int[] values)
offset - the first offset to replacevalues - the source of the new values
void set(int offset,
int[] values,
int valOffset,
int length)
offset - 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 copyvoid shuffle(java.util.Random rand)
rand - a Random valueint size()
size in interface TIntCollectionvoid sort()
Arrays.sort(long[])
void sort(int fromIndex,
int toIndex)
fromIndex - the index at which to start sorting (inclusive)toIndex - the index at which to stop sorting (exclusive)Arrays.sort(long[])
TIntList subList(int begin,
int end)
begin - low endpoint (inclusive) of the subList.end - high endpoint (exclusive) of the subList.
java.lang.IndexOutOfBoundsException - - endpoint out of range
java.lang.IllegalArgumentException - - endpoints out of order (end > begin)int[] toArray()
toArray in interface TIntCollectionint[] value
int[] toArray(int offset,
int len)
offset - the offset at which to start copyinglen - the number of values to copy.
int[] valueint[] toArray(int[] 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 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 TIntCollectiondest - the array to copy into.
int[] toArray(int[] dest,
int offset,
int len)
dest - the array to copy into.offset - the offset of the first value to copylen - the number of values to copy.
int[] toArray(int[] dest,
int source_pos,
int dest_pos,
int len)
dest - 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.
void transformValues(TIntFunction function)
function - a TIntFunction value
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||