public final class IntByteOpenHashMap.KeysContainer extends java.lang.Object implements IntLookupContainer
| Constructor and Description |
|---|
IntByteOpenHashMap.KeysContainer() |
| Modifier and Type | Method and Description |
|---|---|
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. |
boolean |
isEmpty()
Shortcut for
size() == 0. |
java.util.Iterator<IntCursor> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
removeAll(IntLookupContainer c)
Default implementation uses a predicate for removal.
|
int |
removeAll(IntPredicate predicate)
Removes all elements in this collection for which the
given predicate returns
true. |
int |
removeAllOccurrences(int e)
Removes all occurrences of
e from this collection. |
int |
retainAll(IntLookupContainer c)
Default implementation uses a predicate for retaining.
|
int |
retainAll(IntPredicate predicate)
Default implementation redirects to
IntCollection.removeAll(IntPredicate)
and negates the predicate. |
int |
size()
Return the current number of elements in this container.
|
int[] |
toArray()
Default implementation of copying to an array.
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waittoArraypublic 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 boolean isEmpty()
IntContainersize() == 0.isEmpty in interface IntContainerpublic java.util.Iterator<IntCursor> iterator()
IntContainerThe 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()
IntContainerO(n) time, although implementing classes
should try to maintain the current size and return in constant time.size in interface IntContainerpublic void clear()
IntCollectionclear in interface IntCollectionpublic int removeAll(IntPredicate predicate)
IntCollectiontrue.removeAll in interface IntCollectionpublic int removeAllOccurrences(int e)
IntCollectione from this collection.removeAllOccurrences in interface IntCollectione - Element to be removed from this collection, if present.public int removeAll(IntLookupContainer c)
removeAll in interface IntCollectionpublic int retainAll(IntLookupContainer c)
retainAll in interface IntCollectionpublic int retainAll(IntPredicate predicate)
IntCollection.removeAll(IntPredicate)
and negates the predicate.retainAll in interface IntCollectionpublic int[] toArray()
toArray in interface IntContainerpublic java.lang.String toString()
toString in class java.lang.ObjectCopyright © 2014 Carrot Search s.c.. All rights reserved.