public final class ObjectDoubleHashMap.KeysContainer extends AbstractObjectCollection<KType> implements ObjectLookupContainer<KType>
| Modifier and Type | Field and Description |
|---|---|
private ObjectDoubleHashMap<KType> |
owner |
| Constructor and Description |
|---|
KeysContainer() |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all elements from this collection.
|
boolean |
contains(KType e)
Lookup a given element in the container.
|
<T extends ObjectPredicate<? super KType>> |
forEach(T predicate)
Applies a
predicate to container elements as long, as the
predicate returns true. |
<T extends ObjectProcedure<? super KType>> |
forEach(T procedure)
Applies a
procedure to all container elements. |
boolean |
isEmpty()
Shortcut for
size() == 0. |
java.util.Iterator<ObjectCursor<KType>> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
void |
release()
Removes all elements from the collection and additionally releases any
internal buffers.
|
int |
removeAll(KType e)
Removes all occurrences of
e from this collection. |
int |
removeAll(ObjectPredicate<? super KType> 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.
|
equals, removeAll, retainAll, retainAll, toArray, toArray, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waittoArray, toArrayprivate final ObjectDoubleHashMap<KType> owner
public boolean contains(KType e)
ObjectContainercontains in interface ObjectContainer<KType>contains in interface ObjectLookupContainer<KType>true if this container has an element equal to
e.public <T extends ObjectProcedure<? super KType>> T forEach(T procedure)
ObjectContainerprocedure to all container elements. Returns the
argument (any subclass of ObjectProcedure. 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 ObjectContainer<KType>public <T extends ObjectPredicate<? super KType>> T forEach(T predicate)
ObjectContainerpredicate to container elements as long, as the
predicate returns true. The iteration is interrupted
otherwise.forEach in interface ObjectContainer<KType>public boolean isEmpty()
ObjectContainersize() == 0.isEmpty in interface ObjectContainer<KType>public java.util.Iterator<ObjectCursor<KType>> iterator()
ObjectContainer
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 (ObjectCursor<Object> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface ObjectContainer<KType>iterator in interface java.lang.Iterable<ObjectCursor<KType>>public int size()
ObjectContainerO(n) time, although
implementing classes should try to maintain the current size and return in
constant time.size in interface ObjectContainer<KType>public void clear()
ObjectCollectionclear in interface ObjectCollection<KType>ObjectCollection.release()public void release()
ObjectCollectionObjectCollection.clear() should be a better alternative since it'll avoid
reallocation.release in interface ObjectCollection<KType>ObjectCollection.clear()public int removeAll(ObjectPredicate<? super KType> predicate)
ObjectCollectiontrue.removeAll in interface ObjectCollection<KType>public int removeAll(KType e)
ObjectCollectione from this collection.removeAll in interface ObjectCollection<KType>e - Element to be removed from this collection, if present.