@Beta protected abstract class ForwardingMap.StandardEntrySet extends java.util.AbstractSet<E>
Map.entrySet()
in terms of the following methods: ForwardingMap.clear()
, ForwardingMap.containsKey(java.lang.Object)
, ForwardingMap.get(java.lang.Object)
, ForwardingMap.isEmpty()
, ForwardingMap.remove(java.lang.Object)
, and ForwardingMap.size()
. In many
cases, you may wish to override ForwardingMap.entrySet()
to forward to this implementation or a
subclass thereof.Constructor and Description |
---|
StandardEntrySet()
Constructor for use by subclasses.
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all of the elements from this collection (optional operation).
|
boolean |
contains(java.lang.Object o)
Returns true if this collection contains the specified element.
|
boolean |
isEmpty()
Returns true if this collection contains no elements.
|
boolean |
remove(java.lang.Object o)
Removes a single instance of the specified element from this
collection, if it is present (optional operation).
|
boolean |
removeAll(java.util.Collection<?> c)
Removes from this set all of its elements that are contained in the
specified collection (optional operation).
|
boolean |
retainAll(java.util.Collection<?> c)
Retains only the elements in this collection that are contained in the
specified collection (optional operation).
|
int |
size()
Returns the number of elements in this collection.
|
add, addAll, containsAll, iterator, toArray, toArray, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
public StandardEntrySet()
public int size()
java.util.Collection
size
in interface java.util.Collection<java.util.Map.Entry<K,V>>
size
in interface java.util.Set<java.util.Map.Entry<K,V>>
size
in class java.util.AbstractCollection<java.util.Map.Entry<K,V>>
public void clear()
java.util.AbstractCollection
This implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
clear
in interface java.util.Collection<java.util.Map.Entry<K,V>>
clear
in interface java.util.Set<java.util.Map.Entry<K,V>>
clear
in class java.util.AbstractCollection<java.util.Map.Entry<K,V>>
public boolean contains(java.lang.Object o)
java.util.AbstractCollection
This implementation iterates over the elements in the collection, checking each element in turn for equality with the specified element.
contains
in interface java.util.Collection<java.util.Map.Entry<K,V>>
contains
in interface java.util.Set<java.util.Map.Entry<K,V>>
contains
in class java.util.AbstractCollection<java.util.Map.Entry<K,V>>
o
- element whose presence in this collection is to be testedpublic boolean isEmpty()
java.util.AbstractCollection
This implementation returns size() == 0.
isEmpty
in interface java.util.Collection<java.util.Map.Entry<K,V>>
isEmpty
in interface java.util.Set<java.util.Map.Entry<K,V>>
isEmpty
in class java.util.AbstractCollection<java.util.Map.Entry<K,V>>
public boolean remove(java.lang.Object o)
java.util.AbstractCollection
This implementation iterates over the collection looking for the specified element. If it finds the element, it removes the element from the collection using the iterator's remove method.
Note that this implementation throws an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection contains the specified object.
remove
in interface java.util.Collection<java.util.Map.Entry<K,V>>
remove
in interface java.util.Set<java.util.Map.Entry<K,V>>
remove
in class java.util.AbstractCollection<java.util.Map.Entry<K,V>>
o
- element to be removed from this collection, if presentpublic boolean removeAll(java.util.Collection<?> c)
java.util.AbstractSet
This implementation determines which is the smaller of this set and the specified collection, by invoking the size method on each. If this set has fewer elements, then the implementation iterates over this set, checking each element returned by the iterator in turn to see if it is contained in the specified collection. If it is so contained, it is removed from this set with the iterator's remove method. If the specified collection has fewer elements, then the implementation iterates over the specified collection, removing from this set each element returned by the iterator, using this set's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method.
removeAll
in interface java.util.Collection<java.util.Map.Entry<K,V>>
removeAll
in interface java.util.Set<java.util.Map.Entry<K,V>>
c
- collection containing elements to be removed from this setAbstractCollection.remove(Object)
,
AbstractCollection.contains(Object)
public boolean retainAll(java.util.Collection<?> c)
java.util.AbstractCollection
This implementation iterates over this collection, checking each element returned by the iterator in turn to see if it's contained in the specified collection. If it's not so contained, it's removed from this collection with the iterator's remove method.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by the iterator method does not implement the remove method and this collection contains one or more elements not present in the specified collection.
retainAll
in interface java.util.Collection<java.util.Map.Entry<K,V>>
retainAll
in interface java.util.Set<java.util.Map.Entry<K,V>>
c
- collection containing elements to be retained in this collectionAbstractCollection.remove(Object)
,
AbstractCollection.contains(Object)
Copyright © 2010–2021. All rights reserved.