private final class DoubleIntHashMap.ValuesContainer extends AbstractIntCollection
| Modifier and Type | Field and Description |
|---|---|
private DoubleIntHashMap |
owner |
| Modifier | Constructor and Description |
|---|---|
private |
ValuesContainer() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all elements from this collection.
|
boolean |
contains(int value)
Lookup a given element in the container.
|
<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. |
boolean |
isEmpty()
Shortcut for
size() == 0. |
java.util.Iterator<IntCursor> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
void |
release()
Removes all elements from the collection and additionally releases any
internal buffers.
|
int |
removeAll(int e)
Removes all occurrences of
e from this collection. |
int |
removeAll(IntPredicate predicate)
Removes all elements in this collection for which the given predicate
returns
true. |
int |
size()
Return the current number of elements in this container.
|
removeAll, retainAll, retainAll, toArray, toStringprivate final DoubleIntHashMap owner
public int size()
IntContainerO(n) time, although
implementing classes should try to maintain the current size and return in
constant time.public boolean isEmpty()
IntContainersize() == 0.public boolean contains(int value)
IntContainertrue if this container has an element equal to
e.public <T extends IntProcedure> T forEach(T procedure)
IntContainerprocedure 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;
public <T extends IntPredicate> T forEach(T predicate)
IntContainerpredicate to container elements as long, as the
predicate returns true. The iteration is interrupted
otherwise.public java.util.Iterator<IntCursor> iterator()
IntContainer
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);
}
public int removeAll(int e)
IntCollectione from this collection.e - Element to be removed from this collection, if present.public int removeAll(IntPredicate predicate)
IntCollectiontrue.public void clear()
IntCollectionIntCollection.release()public void release()
IntCollectionIntCollection.clear() should be a better alternative since it'll avoid
reallocation.IntCollection.clear()