protected class SafeHashMap.EntrySet extends AbstractSet<Map.Entry<K,V>> implements Serializable
Modifier and Type | Class and Description |
---|---|
protected class |
SafeHashMap.EntrySet.EntrySetIterator
An Iterator over the EntrySet that is backed by the SafeHashMap.
|
Modifier | Constructor and Description |
---|---|
protected |
EntrySet() |
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 o)
Returns true if this collection contains the specified element.
|
protected Iterator |
instantiateIterator()
Factory pattern.
|
Iterator<Map.Entry<K,V>> |
iterator()
Returns an iterator over the elements contained in this collection.
|
boolean |
remove(Object o)
Removes the specified element from this Set of entries if it is present by removing the associated entry from the underlying Map.
|
int |
size()
Returns the number of elements in this collection.
|
Object[] |
toArray()
Returns an array containing all of the elements in this collection.
|
<T> T[] |
toArray(T[] a)
Returns an array with a runtime type is that of the specified array and that contains all of the elements in this collection.
|
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 Iterator<Map.Entry<K,V>> iterator()
iterator
in interface Iterable<Map.Entry<K,V>>
iterator
in interface Collection<Map.Entry<K,V>>
iterator
in interface Set<Map.Entry<K,V>>
iterator
in class AbstractCollection<Map.Entry<K,V>>
public int size()
public boolean contains(Object o)
contains
in interface Collection<Map.Entry<K,V>>
contains
in interface Set<Map.Entry<K,V>>
contains
in class AbstractCollection<Map.Entry<K,V>>
o
- object to be checked for containment in this collectionpublic boolean remove(Object o)
public void clear()
public Object[] toArray()
public <T> T[] toArray(T[] a)
If the collection fits in the specified array with room to spare (i.e., the array has more elements than the 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 the collection only if the caller knows that the collection does not contain any null elements.)
toArray
in interface Collection<Map.Entry<K,V>>
toArray
in interface Set<Map.Entry<K,V>>
toArray
in class AbstractCollection<Map.Entry<K,V>>
a
- the array into which the elements of the collection 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 collectionprotected Iterator instantiateIterator()