public final class LongShortHashMap.ValuesCollection extends AbstractShortCollection
| Modifier and Type | Field and Description |
|---|---|
protected IteratorPool<ShortCursor,LongShortHashMap.ValuesIterator> |
valuesIteratorPool
internal pool of ValuesIterator
|
containsNegateTestPredicate, containsTestPredicate, negatePredicate, testContainer, testPredicate| Constructor and Description |
|---|
ValuesCollection() |
| Modifier and Type | Method and Description |
|---|---|
int |
capacity()
Return the maximum number of elements this container is guaranteed to hold without reallocating.
|
void |
clear()
Removes all elements from this collection.
|
boolean |
contains(short value)
Lookup a given element in the container.
|
<T extends ShortPredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends ShortProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
LongShortHashMap.ValuesIterator |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
removeAll(short e)
Removes all occurrences of
e from this collection. |
int |
removeAll(ShortPredicate 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.
|
short[] |
toArray(short[] target)
Default implementation for:
Copies all elements of this container to an existing array of the same type.
|
isEmpty, removeAll, retainAll, retainAll, toArray, toStringprotected final IteratorPool<ShortCursor,LongShortHashMap.ValuesIterator> valuesIteratorPool
public int size()
O(n) time, although implementing classes
should try to maintain the current size and return in constant time.public int capacity()
O(n) time.public boolean contains(short value)
ShortContainertrue if this container has an element
equal to e.public <T extends ShortProcedure> T forEach(T procedure)
ShortContainerprocedure to all container elements. Returns the argument (any
subclass of ShortProcedure. 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 ShortPredicate> T forEach(T predicate)
ShortContainerpredicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.public LongShortHashMap.ValuesIterator iterator()
ShortContainerThe 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 (ShortCursor<short> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
public int removeAll(short e)
e from this collection.
Indeed removes all the (key,value) pairs matching
(key ? , e) with the same e, from the map.e - Element to be removed from this collection, if present.public int removeAll(ShortPredicate predicate)
true.
Indeed removes all the (key,value) pairs matching
the predicate for the values, from the map.public void clear()
public short[] toArray(short[] target)
AbstractShortCollectiontoArray in interface ShortContainertoArray in class AbstractShortCollectiontarget - The target array must be large enough to hold all elements, i.e >= ShortContainer.size().Copyright © 2017. All rights reserved.