protected class SafeHashMap.KeySet extends AbstractSet<K> implements Serializable
Modifier | Constructor and Description |
---|---|
protected |
KeySet() |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all of the elements from this set of Keys by clearing the underlying Map.
|
boolean |
contains(Object oKey)
Determine if a particular key is present in the Set.
|
Iterator<K> |
iterator()
Obtain an iterator over the keys in the Map.
|
boolean |
remove(Object o)
Removes the specified element from this Set of keys if it is present by removing the associated entry from the underlying Map.
|
int |
size()
Determine the number of keys in the Set.
|
Object[] |
toArray()
Returns an array containing all of the keys in this set.
|
<T> T[] |
toArray(T[] a)
Returns an array with a runtime type is that of the specified array and that contains all of the keys in this Set.
|
equals, hashCode, removeAll
add, addAll, containsAll, isEmpty, retainAll, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
add, addAll, containsAll, isEmpty, retainAll, spliterator
parallelStream, removeIf, stream
public int size()
size
in interface Collection<K>
size
in interface Set<K>
size
in class AbstractCollection<K>
public boolean contains(Object oKey)
contains
in interface Collection<K>
contains
in interface Set<K>
contains
in class AbstractCollection<K>
public boolean remove(Object o)
remove
in interface Collection<K>
remove
in interface Set<K>
remove
in class AbstractCollection<K>
o
- object to be removed from this set, if presentpublic void clear()
clear
in interface Collection<K>
clear
in interface Set<K>
clear
in class AbstractCollection<K>
public Object[] toArray()
toArray
in interface Collection<K>
toArray
in interface Set<K>
toArray
in class AbstractCollection<K>
public <T> T[] toArray(T[] a)
If the Set fits in the specified array with room to spare (i.e., the array has more elements than the Set), the element in the array immediately following the end of the Set is set to null. This is useful in determining the length of the Set only if the caller knows that the Set does not contain any null keys.)
toArray
in interface Collection<K>
toArray
in interface Set<K>
toArray
in class AbstractCollection<K>
a
- the array into which the elements of the Set are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purposeArrayStoreException
- if the runtime type of the specified array is not a supertype of the runtime type of every element in this Set of keys