All Implemented Interfaces:
Iterable
<
Map.Entry
<K,V>>
,
Collection
<
Map.Entry
<K,V>>
,
Set
<
Map.Entry
<K,V>>
Direct Known Subclasses:
AbstractKeySetBasedMap.EntrySet
,
OpenHashMap.EntrySet
Enclosing class:
AbstractKeyBasedMap
<
K
,
V
>
public class AbstractKeyBasedMap.EntrySet
extends AbstractSet<Map.Entry<K,V>>
A set of entries backed by this map.
AbstractKeyBasedMap.EntrySet.Entry
A Map Entry implementation that defers its value acquisition from
the containing map (via
Map.get(Object)
) if the Entry is
constructed with a null value.
protected class
AbstractKeyBasedMap.EntrySet.EntrySetIterator
An Iterator over the EntrySet that is backed by the Map.
clear
public void clear()
Removes all of the elements from this set of Keys by clearing the
underlying Map.
Specified by:
clear
in interface
Collection
<
Map.Entry
<
K
,
V
>>
Specified by:
clear
in interface
Set
<
Map.Entry
<
K
,
V
>>
Overrides:
clear
in class
AbstractCollection
<
Map.Entry
<
K
,
V
>>
contains
public boolean contains(Object o)
Returns
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
(o==null ? e==null : o.equals(e))
.
contains
in interface
Collection
<
Map.Entry
<
K
,
V
>>
Specified by:
contains
in interface
Set
<
Map.Entry
<
K
,
V
>>
Overrides:
contains
in class
AbstractCollection
<
Map.Entry
<
K
,
V
>>
Parameters:
o
- object to be checked for containment in this collection
Returns:
true
if this collection contains the specified
element
isEmpty
in interface
Collection
<
Map.Entry
<
K
,
V
>>
Specified by:
isEmpty
in interface
Set
<
Map.Entry
<
K
,
V
>>
Overrides:
isEmpty
in class
AbstractCollection
<
Map.Entry
<
K
,
V
>>
Returns:
true
if this Set is empty
iterator
public Iterator<Map.Entry<K,V>> iterator()
Returns an iterator over the elements contained in this collection.
Specified by:
iterator
in interface
Collection
<
Map.Entry
<
K
,
V
>>
Specified by:
iterator
in interface
Iterable
<
Map.Entry
<
K
,
V
>>
Specified by:
iterator
in interface
Set
<
Map.Entry
<
K
,
V
>>
Specified by:
iterator
in class
AbstractCollection
<
Map.Entry
<
K
,
V
>>
Returns:
an iterator over the elements contained in this collection
remove
public 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.
Specified by:
remove
in interface
Collection
<
Map.Entry
<
K
,
V
>>
Specified by:
remove
in interface
Set
<
Map.Entry
<
K
,
V
>>
Overrides:
remove
in class
AbstractCollection
<
Map.Entry
<
K
,
V
>>
Parameters:
o
- object to be removed from this set, if present
Returns:
true if the set contained the specified element
size
in interface
Collection
<
Map.Entry
<
K
,
V
>>
Specified by:
size
in interface
Set
<
Map.Entry
<
K
,
V
>>
Specified by:
size
in class
AbstractCollection
<
Map.Entry
<
K
,
V
>>
Returns:
the number of elements in this collection
protected Map.Entry<K,V> instantiateEntry(K oKey,
V oValue)
Factory pattern. Create a Map Entry.
Parameters:
oKey
- the Entry key (required)
oValue
- the Entry value (optional; lazy loaded if necessary)
Returns:
a new instance of an Entry with the specified key and
value (if one is provided)
instantiateIterator
protected Iterator<Map.Entry<K,V>> instantiateIterator()
Factory pattern.
Returns:
a new instance of an Iterator over the EntrySet
