K - the type of keysV - the type of values in the backing mapSerializable, Iterable<K>, Collection<K>, Set<K>ConcurrentHashMap<K,V> public static final class ConcurrentHashMap.KeySetView<K,V> extends Object implements Set<K>, Serializable
Set of keys, in which additions may optionally be enabled by mapping to a common value. This class cannot be directly instantiated. See keySet(), keySet(V), newKeySet(), newKeySet(int).| Modifier and Type | Method | Description |
|---|---|---|
boolean |
add |
Adds the specified key to this set view by mapping the key to the default mapped value in the backing map, if defined. |
boolean |
addAll |
Adds all of the elements in the specified collection to this set, as if by calling add(K) on each one. |
final void |
clear() |
Removes all of the elements from this view, by removing all the mappings from the map backing this view. |
boolean |
contains |
Returns true if this collection contains the specified element. |
final boolean |
containsAll |
Returns true if this collection contains all of the elements in the specified collection. |
boolean |
equals |
Compares the specified object with this collection for equality. |
ConcurrentHashMap |
getMap() |
Returns the map backing this view. |
V |
getMappedValue() |
Returns the default mapped value for additions, or null if additions are not supported. |
int |
hashCode() |
Returns the hash code value for this collection. |
final boolean |
isEmpty() |
Returns true if this collection contains no elements. |
Iterator |
iterator() |
Returns an iterator over the elements in this collection. |
boolean |
remove |
Removes the key from this map view, by removing the key (and its corresponding value) from the backing map. |
boolean |
removeAll |
Removes all of this collection's elements that are also contained in the specified collection (optional operation). |
final boolean |
retainAll |
Retains only the elements in this collection that are contained in the specified collection (optional operation). |
final int |
size() |
Returns the number of elements in this collection. |
final Object[] |
toArray() |
Returns an array containing all of the elements in this collection. |
final <T> T[] |
toArray |
Returns an array containing all of the elements in this collection; the runtime type of the returned array is that of the specified array. |
final String |
toString() |
Returns a string representation of this collection. |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
parallelStream, removeIf, stream, toArray
clear, containsAll, isEmpty, removeAll, retainAll, size, spliterator, toArray, toArray
public V getMappedValue()
null if additions are not supported.null if not supportedpublic boolean contains(Object o)
true if this collection contains the specified element. More formally, returns true if and only if this collection contains at least one element e such that Objects.equals(o, e).contains in interface Collection<K>
contains in interface Set<K>
o - element whose presence in this collection is to be testedtrue if this collection contains the specified elementNullPointerException - if the specified key is nullpublic boolean remove(Object o)
remove in interface Collection<K>
remove in interface Set<K>
o - the key to be removed from the backing maptrue if the backing map contained the specified keyNullPointerException - if the specified key is nullpublic Iterator<K> iterator()
The returned iterator is weakly consistent.
public boolean add(K e)
add in interface Collection<K>
add in interface Set<K>
e - key to be addedtrue if this set changed as a result of the callNullPointerException - if the specified key is nullUnsupportedOperationException - if no default mapped value for additions was providedpublic boolean addAll(Collection<? extends K> c)
add(K) on each one.addAll in interface Collection<K>
addAll in interface Set<K>
c - the elements to be inserted into this settrue if this set changed as a result of the callNullPointerException - if the collection or any of its elements are null
UnsupportedOperationException - if no default mapped value for additions was providedpublic int hashCode()
CollectionCollection interface adds no stipulations to the general contract for the Object.hashCode method, programmers should take note that any class that overrides the Object.equals method must also override the Object.hashCode method in order to satisfy the general contract for the Object.hashCode method. In particular, c1.equals(c2) implies that c1.hashCode()==c2.hashCode().public boolean equals(Object o)
Collection While the Collection interface adds no stipulations to the general contract for the Object.equals, programmers who implement the Collection interface "directly" (in other words, create a class that is a Collection but is not a Set or a List) must exercise care if they choose to override the Object.equals. It is not necessary to do so, and the simplest course of action is to rely on Object's implementation, but the implementor may wish to implement a "value comparison" in place of the default "reference comparison." (The List and Set interfaces mandate such value comparisons.)
The general contract for the Object.equals method states that equals must be symmetric (in other words, a.equals(b) if and only if b.equals(a)). The contracts for List.equals and Set.equals state that lists are only equal to other lists, and sets to other sets. Thus, a custom equals method for a collection class that implements neither the List nor Set interface must return false when this collection is compared to any list or set. (By the same logic, it is not possible to write a class that correctly implements both the Set and List interfaces.)
public ConcurrentHashMap<K,V> getMap()
public final void clear()
clear in interface Collection<K>
public final int size()
CollectionInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.size in interface Collection<K>
public final boolean isEmpty()
Collectiontrue if this collection contains no elements.isEmpty in interface Collection<K>
true if this collection contains no elementspublic final Object[] toArray()
CollectionObject. The returned array will be "safe" in that no references to it are maintained by this collection. (In other words, this method must allocate a new array even if this collection is backed by an array). The caller is thus free to modify the returned array.
toArray in interface Collection<K>
Object, containing all of the elements in this collectionpublic final <T> T[] toArray(T[] a)
CollectionIf this collection fits in the specified array with room to spare (i.e., the array has more elements than this collection), the element in the array immediately following the end of the collection is set to null. (This is useful in determining the length of this collection only if the caller knows that this collection does not contain any null elements.)
If this collection makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.
toArray in interface Collection<K>
T - the component type of the array to contain the collectiona - the array into which the elements of this collection are to be stored, if it is big enough; otherwise, a new array of the same runtime type is allocated for this purpose.public final String toString()
"[]"). Adjacent elements are separated by the characters ", " (comma and space). Elements are converted to strings as by String.valueOf(Object).public final boolean containsAll(Collection<?> c)
Collectiontrue if this collection contains all of the elements in the specified collection.containsAll in interface Collection<K>
c - collection to be checked for containment in this collectiontrue if this collection contains all of the elements in the specified collectionpublic boolean removeAll(Collection<?> c)
CollectionremoveAll in interface Collection<K>
c - collection containing elements to be removed from this collectiontrue if this collection changed as a result of the callpublic final boolean retainAll(Collection<?> c)
CollectionretainAll in interface Collection<K>
c - collection containing elements to be retained in this collectiontrue if this collection changed as a result of the call
© 1993, 2025, Oracle and/or its affiliates. All rights reserved.
Documentation extracted from Debian's OpenJDK Development Kit package.
Licensed under the GNU General Public License, version 2, with the Classpath Exception.
Various third party code in OpenJDK is licensed under different licenses (see Debian package).
Java and OpenJDK are trademarks or registered trademarks of Oracle and/or its affiliates.
https://docs.oracle.com/en/java/javase/25/docs/api/java.base/java/util/concurrent/ConcurrentHashMap.KeySetView.html