public final class CharLongHashMap.KeysCollection extends AbstractCharCollection implements CharLookupContainer
| Modifier and Type | Field and Description |
|---|---|
protected IteratorPool<CharCursor,CharLongHashMap.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(char e)
Lookup a given element in the container.
|
<T extends CharPredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends CharProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
CharLongHashMap.KeysIterator |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
removeAll(char e)
Removes all occurrences of
e from this collection. |
int |
removeAll(CharPredicate 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.
|
char[] |
toArray(char[] 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<CharCursor,CharLongHashMap.KeysIterator> keyIteratorPool
public boolean contains(char e)
CharContainercontains in interface CharContainercontains in interface CharLookupContainertrue if this container has an element
equal to e.public <T extends CharProcedure> T forEach(T procedure)
CharContainerprocedure to all container elements. Returns the argument (any
subclass of CharProcedure. 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 CharContainerpublic <T extends CharPredicate> T forEach(T predicate)
CharContainerpredicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.forEach in interface CharContainerpublic CharLongHashMap.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 (CharCursor<char> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface CharContaineriterator in interface java.lang.Iterable<CharCursor>public int size()
O(n) time, although implementing classes
should try to maintain the current size and return in constant time.size in interface CharContainerpublic int capacity()
O(n) time.capacity in interface CharContainerpublic void clear()
CharCollectionclear in interface CharCollectionpublic int removeAll(CharPredicate predicate)
CharCollectiontrue.removeAll in interface CharCollectionpublic int removeAll(char e)
CharCollectione from this collection.removeAll in interface CharCollectione - Element to be removed from this collection, if present.public char[] toArray(char[] target)
AbstractCharCollectiontoArray in interface CharContainertoArray in class AbstractCharCollectiontarget - The target array must be large enough to hold all elements, i.e >= CharContainer.size().Copyright © 2017. All rights reserved.