public final class LongShortHashMap.KeysCollection extends AbstractLongCollection implements LongLookupContainer
| Modifier and Type | Field and Description |
|---|---|
protected IteratorPool<LongCursor,LongShortHashMap.KeysIterator> |
keyIteratorPool
internal pool of KeysIterator
|
containsNegateTestPredicate, containsTestPredicate, negatePredicate, testContainer, testPredicate| Constructor and Description |
|---|
KeysCollection() |
| 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(long e)
Lookup a given element in the container.
|
<T extends LongPredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends LongProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
LongShortHashMap.KeysIterator |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
removeAll(long e)
Removes all occurrences of
e from this collection. |
int |
removeAll(LongPredicate 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.
|
long[] |
toArray(long[] target)
Default implementation for:
Copies all elements of this container to an existing array of the same type.
|
isEmpty, removeAll, retainAll, retainAll, toArray, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitisEmpty, toArrayprotected final IteratorPool<LongCursor,LongShortHashMap.KeysIterator> keyIteratorPool
public boolean contains(long e)
LongContainercontains in interface LongContainercontains in interface LongLookupContainertrue if this container has an element
equal to e.public <T extends LongProcedure> T forEach(T procedure)
LongContainerprocedure to all container elements. Returns the argument (any
subclass of LongProcedure. 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 LongContainerpublic <T extends LongPredicate> T forEach(T predicate)
LongContainerpredicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.forEach in interface LongContainerpublic LongShortHashMap.KeysIterator 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 (LongCursor<long> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface LongContaineriterator in interface java.lang.Iterable<LongCursor>public int size()
O(n) time, although implementing classes
should try to maintain the current size and return in constant time.size in interface LongContainerpublic int capacity()
O(n) time.capacity in interface LongContainerpublic void clear()
LongCollectionclear in interface LongCollectionpublic int removeAll(LongPredicate predicate)
LongCollectiontrue.removeAll in interface LongCollectionpublic int removeAll(long e)
LongCollectione from this collection.removeAll in interface LongCollectione - Element to be removed from this collection, if present.public long[] toArray(long[] target)
AbstractLongCollectiontoArray in interface LongContainertoArray in class AbstractLongCollectiontarget - The target array must be large enough to hold all elements, i.e >= LongContainer.size().Copyright © 2017. All rights reserved.