public final class DoubleIndexedHeapPriorityQueue.KeysCollection extends AbstractIntCollection implements IntLookupContainer
| Modifier and Type | Field and Description |
|---|---|
protected IteratorPool<IntCursor,DoubleIndexedHeapPriorityQueue.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(int e)
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. |
DoubleIndexedHeapPriorityQueue.KeysIterator |
iterator()
Returns an iterator to a cursor traversing the collection.
|
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.
|
int[] |
toArray(int[] 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<IntCursor,DoubleIndexedHeapPriorityQueue.KeysIterator> keyIteratorPool
public boolean contains(int e)
IntContainercontains in interface IntContainercontains in interface IntLookupContainertrue 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;
forEach in interface IntContainerpublic <T extends IntPredicate> T forEach(T predicate)
IntContainerpredicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.forEach in interface IntContainerpublic DoubleIndexedHeapPriorityQueue.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 (IntCursor<int> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface IntContaineriterator in interface java.lang.Iterable<IntCursor>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 int capacity()
O(n) time.capacity in interface IntContainerpublic void clear()
IntCollectionclear in interface IntCollectionpublic int removeAll(IntPredicate predicate)
IntCollectiontrue.removeAll in interface IntCollectionpublic int removeAll(int e)
IntCollectione from this collection.removeAll in interface IntCollectione - Element to be removed from this collection, if present.public int[] toArray(int[] target)
AbstractIntCollectiontoArray in interface IntContainertoArray in class AbstractIntCollectiontarget - The target array must be large enough to hold all elements, i.e >= IntContainer.size().Copyright © 2017. All rights reserved.