public class TIntArrayList extends Objectimplements Externalizable , Cloneable
| Modifier and Type | Field and Description |
|---|---|
protected int[] |
_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
|
| Constructor and Description |
|---|
TIntArrayList()
Creates a new
TIntArrayList instance with the default capacity.
|
TIntArrayList(int capacity)
Creates a new
TIntArrayList instance with the specified capacity.
|
TIntArrayList(int[] values)
Creates a new
TIntArrayList instance whose capacity is the greater of the length of
values and DEFAULT_CAPACITY and whose initial contents are the specified values.
|
| Modifier and Type | Method and Description |
|---|---|
void |
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.
|
void |
clear(int capacity)
Flushes the internal state of the list, setting the capacity of the empty list to
capacity.
|
Object |
clone()
Returns a clone of this list.
|
boolean |
contains(int value)
Searches the list for
value
|
void |
ensureCapacity(int capacity)
Grow the internal array as needed to accommodate the specified number of elements.
|
boolean |
equals(Object
Compares this list to another list, value by 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
Applies the procedure to each value in the list in ascending (front to back) order.
|
boolean |
forEachDescending(TIntProcedure
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 |
getQuick(int offset)
Returns the value at the specified offset without doing any bounds checking.
|
int |
getSet(int offset, int val)
Sets the value at the specified offset and returns the previously stored value.
|
TIntArrayList |
grep(TIntProcedure
Searches the list for values satisfying
condition in the manner of the *nix
grep utility.
|
int |
hashCode()
|
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.
|
TIntArrayList |
inverseGrep(TIntProcedure
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.
|
void |
readExternal(ObjectInput
|
int |
remove(int offset)
Removes the value at
offset from the list.
|
void |
remove(int offset, int length)
Removes
length values from the list, starting at
offset
|
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.
|
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.
|
void |
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 |
setQuick(int offset, int val)
Sets the value at the specified offset without doing any bounds checking.
|
void |
shuffle(Random
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.
|
TIntArrayList |
subList(int begin, int end)
Returns a sublist of this list.
|
int[] |
toNativeArray()
Copies the contents of the list into a native array.
|
void |
toNativeArray(int[] dest, int offset, int len)
Copies a slice of the list into a native array.
|
int[] |
toNativeArray(int offset, int len)
Copies a slice of the list into a native array.
|
String |
toString()
Returns a String representation of the list, front to back.
|
void |
transformValues(TIntFunction
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.
|
void |
writeExternal(ObjectOutput
|
protected int[] _data
protected int _pos
protected static final int DEFAULT_CAPACITY
public TIntArrayList()
TIntArrayList instance with the default capacity.
public TIntArrayList(int capacity)
TIntArrayList instance with the specified capacity.
capacity - an
int value
public TIntArrayList(int[] values)
TIntArrayList instance whose capacity is the greater of the length of
values and DEFAULT_CAPACITY and whose initial contents are the specified values.
values - an
int[] value
public void ensureCapacity(int capacity)
capacity - an
int value
public int size()
public boolean isEmpty()
public void trimToSize()
public void add(int val)
val - an
int value
public void add(int[] vals)
vals - an
int[] value
public void add(int[] vals,
int offset,
int length)
vals - an
int[] value
offset - the offset at which to start copying
length - the number of values to copy.
public void insert(int offset,
int value)
offset - an
int value
value - an
int value
public void insert(int offset,
int[] values)
offset - an
int value
values - an
int[] value
public void insert(int offset,
int[] values,
int valOffset,
int len)
offset - an
int value
values - an
int[] value
valOffset - the offset in the values array at which to start copying.
len - the number of values to copy from the values array
public int get(int offset)
offset - an
int value
int value
public int getQuick(int offset)
offset - an
int value
int value
public void set(int offset,
int val)
offset - an
int value
val - an
int value
public int getSet(int offset,
int val)
offset - an
int value
val - an
int value
public void set(int offset,
int[] values)
offset - the first offset to replace
values - the source of the new values
public void set(int offset,
int[] values,
int valOffset,
int length)
offset - the first offset to replace
values - the source of the new values
valOffset - the first value to copy from the values array
length - the number of values to copy
public void setQuick(int offset,
int val)
offset - an
int value
val - an
int value
public void clear()
public void clear(int capacity)
capacity - an
int value
public void reset()
clear method if you want to recyle a list without allocating new backing arrays.
clear()
public void resetQuick()
clear method if you want to recyle 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.
reset(),
clear(),
getQuick(int)
public int remove(int offset)
offset - an
int value
public void remove(int offset,
int length)
offset - an
int value
length - an
int value
public void transformValues(TIntFunctionfunction)
function - a
TIntFunction value
public void reverse()
public void reverse(int from,
int to)
from - the inclusive index at which to start reversing
to - the exclusive index at which to stop reversing
public void shuffle(Randomrand)
rand - a
Random value
public Objectclone()
public TIntArrayListsubList(int begin, int end)
begin - low endpoint (inclusive) of the subList.
end - high endpoint (exclusive) of the subList.
IndexOutOfBoundsException - - endpoint out of range
IllegalArgumentException - - endpoints out of order (end > begin)
public int[] toNativeArray()
int[] value
public int[] toNativeArray(int offset,
int len)
offset - the offset at which to start copying
len - the number of values to copy.
int[] value
public void toNativeArray(int[] dest,
int offset,
int len)
dest - the array to copy into.
offset - the offset of the first value to copy
len - the number of values to copy.
public boolean equals(Objectother)
public int hashCode()
public boolean forEach(TIntProcedureprocedure)
procedure - a
TIntProcedure value
public boolean forEachDescending(TIntProcedureprocedure)
procedure - a
TIntProcedure value
public void sort()
Arrays.sort(int[])
public 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(int[])
public void fill(int val)
val - the value to use when filling
public 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 filling
public int binarySearch(int value)
value - the value to search for
public int binarySearch(int value,
int fromIndex,
int toIndex)
value - the value to search for
fromIndex - the lower boundary of the range (inclusive)
toIndex - the upper boundary of the range (exclusive)
public int indexOf(int value)
value - an
int value
for faster searches on sorted lists
public 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
public int lastIndexOf(int value)
value - an
int value
for faster searches on sorted lists
public 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 lists
public boolean contains(int value)
value - an
int value
public TIntArrayListgrep(TIntProcedure condition)
condition - a condition to apply to each element in the list
public TIntArrayListinverseGrep(TIntProcedure condition)
grep -v.
condition - a condition to apply to each element in the list
public int max()
IllegalStateException - if the list is empty
public int min()
IllegalStateException - if the list is empty
public StringtoString()
public void writeExternal(ObjectOutputout) throws IOException
writeExternal in interface
Externalizable
IOException
public void readExternal(ObjectInputin) throws IOException , ClassNotFoundException
readExternal in interface
Externalizable
IOException
ClassNotFoundException