@Generated(date="2014-01-02T13:00:30+0000",
value="HPPC generated from: IntArrayList.java")
public class IntArrayList
extends java.lang.Object
implements IntIndexedContainer, java.lang.Cloneable
ArraySizingStrategy
and may be expensive if they move around really large chunks of memory.
See ObjectArrayList class for API similarities and differences against Java
Collections.
| Modifier and Type | Field and Description |
|---|---|
int[] |
buffer
Internal array for storing the list.
|
static int |
DEFAULT_CAPACITY
Default capacity if no other capacity is given in the constructor.
|
int |
elementsCount
Current number of elements stored in
buffer. |
protected ArraySizingStrategy |
resizer
Buffer resizing strategy.
|
| Constructor and Description |
|---|
IntArrayList()
Create with default sizing strategy and initial capacity for storing
5 elements.
|
IntArrayList(int initialCapacity)
Create with default sizing strategy and the given initial capacity.
|
IntArrayList(int initialCapacity,
ArraySizingStrategy resizer)
Create with a custom buffer resizing strategy.
|
IntArrayList(IntContainer container)
Creates a new list from elements of another container.
|
| Modifier and Type | Method and Description |
|---|---|
void |
add(int... elements)
Vararg-signature method for adding elements at the end of the list.
|
void |
add(int e1)
Adds an element to the end of this container (the last index is incremented by one).
|
void |
add(int[] elements,
int start,
int length)
Add all elements from a range of given array to the list.
|
void |
add(int e1,
int e2)
Appends two elements at the end of the list.
|
int |
addAll(IntContainer container)
Adds all elements from another container.
|
int |
addAll(java.lang.Iterable<? extends IntCursor> iterable)
Adds all elements from another iterable.
|
void |
clear()
Sets the number of stored elements to zero.
|
IntArrayList |
clone()
Clone this object.
|
boolean |
contains(int e1)
Lookup a given element in the container.
|
protected void |
ensureBufferSpace(int expectedAdditions)
Ensures the internal buffer has enough free slots to store
expectedAdditions. |
void |
ensureCapacity(int minCapacity)
Increases the capacity of this instance, if necessary, to ensure
that it can hold at least the number of elements specified by
the minimum capacity argument.
|
boolean |
equals(java.lang.Object obj)
Compares the specified object with this container for equality.
|
<T extends IntPredicate> |
forEach(T predicate)
Applies a
predicate to container elements as long, as the predicate
returns true. |
<T extends IntProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
<T extends IntPredicate> |
forEach(T predicate,
int fromIndex,
int toIndex)
Applies
predicate to a slice of the list,
fromIndex, inclusive, to toIndex,
exclusive, or until predicate returns false. |
<T extends IntProcedure> |
forEach(T procedure,
int fromIndex,
int toIndex)
Applies
procedure to a slice of the list,
fromIndex, inclusive, to toIndex,
exclusive. |
static IntArrayList |
from(int... elements)
Create a list from a variable number of arguments or an array of
int. |
static IntArrayList |
from(IntContainer container)
Create a list from elements of another container.
|
int |
get(int index) |
int |
hashCode() |
int |
indexOf(int e1)
Returns the index of the first occurrence of the specified element in this list,
or -1 if this list does not contain the element.
|
void |
insert(int index,
int e1)
Inserts the specified element at the specified position in this list.
|
boolean |
isEmpty()
Shortcut for
size() == 0. |
java.util.Iterator<IntCursor> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
lastIndexOf(int e1)
Returns the index of the last occurrence of the specified element in this list,
or -1 if this list does not contain the element.
|
static IntArrayList |
newInstance()
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
static IntArrayList |
newInstanceWithCapacity(int initialCapacity)
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
void |
release()
Sets the number of stored elements to zero and releases the internal storage array.
|
int |
remove(int index)
Removes the element at the specified position in this list and returns it.
|
int |
removeAll(IntLookupContainer c)
Default implementation uses a predicate for removal.
|
int |
removeAll(IntPredicate predicate)
Removes all elements in this collection for which the
given predicate returns
true. |
int |
removeAllOccurrences(int e1)
Removes all occurrences of
e from this collection. |
int |
removeFirstOccurrence(int e1)
Removes the first element that equals
e1, returning its
deleted position or -1 if the element was not found. |
int |
removeLastOccurrence(int e1)
Removes the last element that equals
e1, returning its
deleted position or -1 if the element was not found. |
void |
removeRange(int fromIndex,
int toIndex)
Removes from this list all of the elements whose index is between
fromIndex, inclusive, and toIndex, exclusive. |
void |
resize(int newSize)
Truncate or expand the list to the new size.
|
int |
retainAll(IntLookupContainer c)
Default implementation uses a predicate for retaining.
|
int |
retainAll(IntPredicate predicate)
Default implementation redirects to
IntCollection.removeAll(IntPredicate)
and negates the predicate. |
int |
set(int index,
int e1)
Replaces the element at the specified position in this list
with the specified element.
|
int |
size()
Return the current number of elements in this container.
|
int[] |
toArray()
Default implementation of copying to an array.
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
void |
trimToSize()
Trim the internal buffer to the current size.
|
finalize, getClass, notify, notifyAll, wait, wait, waitremoveAll, retainAll, retainAllpublic static final int DEFAULT_CAPACITY
public int[] buffer
size()).public int elementsCount
buffer.protected final ArraySizingStrategy resizer
public IntArrayList()
public IntArrayList(int initialCapacity)
public IntArrayList(int initialCapacity,
ArraySizingStrategy resizer)
public IntArrayList(IntContainer container)
public void add(int e1)
add in interface IntIndexedContainerpublic void add(int e1,
int e2)
add (vararg-version) or access the buffer directly (tight
loop).public void add(int[] elements,
int start,
int length)
public void add(int... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public int addAll(IntContainer container)
public int addAll(java.lang.Iterable<? extends IntCursor> iterable)
public void insert(int index,
int e1)
insert in interface IntIndexedContainerindex - The index at which the element should be inserted, shifting
any existing and subsequent elements to the right.public int get(int index)
get in interface IntIndexedContainerindex from the list.public int set(int index,
int e1)
set in interface IntIndexedContainerpublic int remove(int index)
Careful. Do not confuse this method with the overridden signature in
Java Collections (List.remove(Object)). Use: IntCollection.removeAll(com.carrotsearch.hppc.IntLookupContainer),
IntIndexedContainer.removeFirstOccurrence(int) or IntIndexedContainer.removeLastOccurrence(int) depending
on the actual need.
remove in interface IntIndexedContainerpublic void removeRange(int fromIndex,
int toIndex)
fromIndex, inclusive, and toIndex, exclusive.removeRange in interface IntIndexedContainerpublic int removeFirstOccurrence(int e1)
e1, returning its
deleted position or -1 if the element was not found.removeFirstOccurrence in interface IntIndexedContainerpublic int removeLastOccurrence(int e1)
e1, returning its
deleted position or -1 if the element was not found.removeLastOccurrence in interface IntIndexedContainerpublic int removeAllOccurrences(int e1)
e from this collection.removeAllOccurrences in interface IntCollectione1 - Element to be removed from this collection, if present.public boolean contains(int e1)
contains in interface IntContainertrue if this container has an element
equal to e.public int indexOf(int e1)
indexOf in interface IntIndexedContainerpublic int lastIndexOf(int e1)
lastIndexOf in interface IntIndexedContainerpublic boolean isEmpty()
size() == 0.isEmpty in interface IntContainerpublic void ensureCapacity(int minCapacity)
protected void ensureBufferSpace(int expectedAdditions)
expectedAdditions. Increases internal buffer size if needed.public void resize(int newSize)
trimToSize() if you need a truncated buffer),
but the truncated values will be reset to the default value (zero). If the list is
expanded, the elements beyond the current size are initialized with JVM-defaults
(zero or null values).public int size()
O(n) time, although implementing classes
should try to maintain the current size and return in constant time.size in interface IntContainerpublic void trimToSize()
public void clear()
elementsCount field to zero.clear in interface IntCollectionpublic void release()
public int[] toArray()
The returned array is sized to match exactly the number of elements of the stack.
toArray in interface IntContainerpublic IntArrayList clone()
clone in class java.lang.Objectpublic int hashCode()
hashCode in interface IntIndexedContainerhashCode in class java.lang.ObjectList.hashCode() (should be implemented
with the same algorithm).public boolean equals(java.lang.Object obj)
IntIndexedContainer, both have the same size, and all corresponding
pairs of elements at the same index are equal. In other words, two indexed
containers are defined to be equal if they contain the same elements in the same
order.
Note that, unlike in List, containers may be of different types and still
return true from IntIndexedContainer.equals(java.lang.Object). This may be dangerous if you use
different hash functions in two containers, but don't override the default
implementation of IntIndexedContainer.equals(java.lang.Object). It is the programmer's responsibility to
enforcing these contracts properly.
equals in interface IntIndexedContainerequals in class java.lang.Objectpublic java.util.Iterator<IntCursor> iterator()
The iterator is implemented as a
cursor and it returns the same cursor instance on every call to
Iterator.next() (to avoid boxing of primitive types). To read the current
list's value (or index in the list) use the cursor's public fields. An example is
shown below.
for (IntCursor<int> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface IntContaineriterator in interface java.lang.Iterable<IntCursor>public <T extends IntProcedure> T forEach(T procedure)
procedure to all container elements. Returns the argument (any
subclass of IntProcedure. This lets the caller to call methods of the argument
by chaining the call (even if the argument is an anonymous type) to retrieve computed values,
for example (IntContainer):
int count = container.forEach(new IntProcedure() {
int count; // this is a field declaration in an anonymous class.
public void apply(int value) { count++; }}).count;
forEach in interface IntContainerpublic <T extends IntProcedure> T forEach(T procedure, int fromIndex, int toIndex)
procedure to a slice of the list,
fromIndex, inclusive, to toIndex,
exclusive.public int removeAll(IntPredicate predicate)
true.removeAll in interface IntCollectionpublic <T extends IntPredicate> T forEach(T predicate)
predicate to container elements as long, as the predicate
returns true. The iteration is interrupted otherwise.forEach in interface IntContainerpublic <T extends IntPredicate> T forEach(T predicate, int fromIndex, int toIndex)
predicate to a slice of the list,
fromIndex, inclusive, to toIndex,
exclusive, or until predicate returns false.public static IntArrayList newInstance()
public static IntArrayList newInstanceWithCapacity(int initialCapacity)
public static IntArrayList from(int... elements)
int.
The elements are copied from the argument to the internal buffer.public static IntArrayList from(IntContainer container)
public int removeAll(IntLookupContainer c)
removeAll in interface IntCollectionpublic int retainAll(IntLookupContainer c)
retainAll in interface IntCollectionpublic int retainAll(IntPredicate predicate)
IntCollection.removeAll(IntPredicate)
and negates the predicate.retainAll in interface IntCollectionpublic java.lang.String toString()
toString in class java.lang.ObjectCopyright © 2014 Carrot Search s.c.. All rights reserved.