public class IntList extends Object
Constructor and Description |
---|
IntList()
create an IntList of default size
|
IntList(int initialCapacity) |
IntList(int initialCapacity,
int fillvalue)
create an IntList with a predefined initial size
|
IntList(IntList list)
create a copy of an existing IntList
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(int value)
Appends the specified element to the end of this list
|
void |
add(int index,
int value)
add the specfied value at the specified index
|
boolean |
addAll(int index,
IntList c)
Inserts all of the elements in the specified collection into
this list at the specified position.
|
boolean |
addAll(IntList c)
Appends all of the elements in the specified collection to the
end of this list, in the order that they are returned by the
specified collection's iterator.
|
void |
clear()
Removes all of the elements from this list.
|
boolean |
contains(int o)
Returns true if this list contains the specified element.
|
boolean |
containsAll(IntList c)
Returns true if this list contains all of the elements of the
specified collection.
|
boolean |
equals(Object o)
Compares the specified object with this list for equality.
|
int |
get(int index)
Returns the element at the specified position in this list.
|
int |
hashCode()
Returns the hash code value for this list.
|
int |
indexOf(int o)
Returns the index in this list of the first occurrence of the
specified element, or -1 if this list does not contain this
element.
|
boolean |
isEmpty()
Returns true if this list contains no elements.
|
int |
lastIndexOf(int o)
Returns the index in this list of the last occurrence of the
specified element, or -1 if this list does not contain this
element.
|
int |
remove(int index)
Removes the element at the specified position in this list.
|
boolean |
removeAll(IntList c)
Removes from this list all the elements that are contained in
the specified collection
|
boolean |
removeValue(int o)
Removes the first occurrence in this list of the specified
element (optional operation).
|
boolean |
retainAll(IntList c)
Retains only the elements in this list that are contained in
the specified collection.
|
int |
set(int index,
int element)
Replaces the element at the specified position in this list
with the specified element
|
int |
size()
Returns the number of elements in this list.
|
int[] |
toArray()
Returns an array containing all of the elements in this list in
proper sequence.
|
int[] |
toArray(int[] a)
Returns an array containing all of the elements in this list in
proper sequence.
|
public IntList()
public IntList(int initialCapacity)
public IntList(IntList list)
list
- the existing IntListpublic IntList(int initialCapacity, int fillvalue)
initialCapacity
- the size for the internal arraypublic void add(int index, int value)
index
- the index where the new value is to be addedvalue
- the new valueIndexOutOfBoundsException
- if the index is out of
range (index < 0 || index > size()).public boolean add(int value)
value
- element to be appended to this list.public boolean addAll(IntList c)
c
- collection whose elements are to be added to this
list.public boolean addAll(int index, IntList c)
index
- index at which to insert first element from the
specified collection.c
- elements to be inserted into this list.IndexOutOfBoundsException
- if the index is out of
range (index < 0 || index > size())public void clear()
public boolean contains(int o)
o
- element whose presence in this list is to be tested.public boolean containsAll(IntList c)
c
- collection to be checked for containment in this list.public boolean equals(Object o)
public int get(int index)
index
- index of element to return.IndexOutOfBoundsException
- if the index is out of
range (index < 0 || index >= size()).public int hashCode()
hashCode = 1;
Iterator i = list.iterator();
while (i.hasNext()) {
Object obj = i.next();
hashCode = 31*hashCode + (obj==null ? 0 : obj.hashCode());
}
This ensures that list1.equals(list2) implies that
list1.hashCode()==list2.hashCode() for any two lists, list1 and
list2, as required by the general contract of Object.hashCode.public int indexOf(int o)
o
- element to search for.public boolean isEmpty()
public int lastIndexOf(int o)
o
- element to search for.public int remove(int index)
index
- the index of the element to removed.IndexOutOfBoundsException
- if the index is out of
range (index < 0 || index >= size()).public boolean removeValue(int o)
o
- element to be removed from this list, if present.public boolean removeAll(IntList c)
c
- collection that defines which elements will be removed
from this list.public boolean retainAll(IntList c)
c
- collection that defines which elements this set will
retain.public int set(int index, int element)
index
- index of element to replace.element
- element to be stored at the specified position.IndexOutOfBoundsException
- if the index is out of
range (index < 0 || index >= size()).public int size()
public int[] toArray()
public int[] toArray(int[] a)
a
- the array into which the elements of this list are to
be stored, if it is big enough; otherwise, a new array
is allocated for this purpose.Copyright © 2014 Open Microscopy Environment