public final class ObjectDoubleHashMap.KeysContainer extends java.lang.Object implements ObjectLookupContainer<KType>
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.
|
protected boolean |
equals(java.lang.Object v1,
java.lang.Object v2) |
<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(ObjectLookupContainer<? super KType> c)
Default implementation uses a predicate for removal.
|
int |
removeAll(ObjectPredicate<? super KType> predicate)
Removes all elements in this collection for which the given predicate
returns
true . |
int |
retainAll(ObjectLookupContainer<? super KType> c)
Default implementation uses a predicate for retaining.
|
int |
retainAll(ObjectPredicate<? super KType> predicate)
Default implementation redirects to
ObjectCollection.removeAll(ObjectPredicate) and
negates the predicate. |
int |
size()
Return the current number of elements in this container.
|
java.lang.Object[] |
toArray()
Default implementation of copying to an array.
|
<T> T[] |
toArray(java.lang.Class<T> componentClass)
Copies all elements of this container to a dynamically created array of the
given component type.
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
toArray, toArray
public boolean contains(KType e)
ObjectContainer
contains
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)
ObjectContainer
procedure
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)
ObjectContainer
predicate
to container elements as long, as the
predicate returns true
. The iteration is interrupted
otherwise.forEach
in interface ObjectContainer<KType>
public boolean isEmpty()
ObjectContainer
size() == 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()
ObjectContainer
O(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()
ObjectCollection
clear
in interface ObjectCollection<KType>
ObjectCollection.release()
public void release()
ObjectCollection
ObjectCollection.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)
ObjectCollection
true
.removeAll
in interface ObjectCollection<KType>
public int removeAll(KType e)
ObjectCollection
e
from this collection.removeAll
in interface ObjectCollection<KType>
e
- Element to be removed from this collection, if present.public int removeAll(ObjectLookupContainer<? super KType> c)
removeAll
in interface ObjectCollection<KType>
public int retainAll(ObjectLookupContainer<? super KType> c)
retainAll
in interface ObjectCollection<KType>
public int retainAll(ObjectPredicate<? super KType> predicate)
ObjectCollection.removeAll(ObjectPredicate)
and
negates the predicate.retainAll
in interface ObjectCollection<KType>
public java.lang.Object[] toArray()
toArray
in interface ObjectContainer<KType>
public <T> T[] toArray(java.lang.Class<T> componentClass)
ObjectContainer
toArray
in interface ObjectContainer<KType>
public java.lang.String toString()
toString
in class java.lang.Object
protected boolean equals(java.lang.Object v1, java.lang.Object v2)
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.