public abstract class AbstractReferenceMap<K,V> extends AbstractHashedMap<K,V>
This class implements all the features necessary for a subclass reference
hash-based map. Key-value entries are stored in instances of the
ReferenceEntry
class which can be overridden and replaced.
The iterators can similarly be replaced, without the need to replace the KeySet,
EntrySet and Values view classes.
Overridable methods are provided to change the default hashing behaviour, and to change how entries are added to and removed from the map. Hopefully, all you need for unusual subclasses is here.
When you construct an AbstractReferenceMap
, you can specify what
kind of references are used to store the map's keys and values.
If non-hard references are used, then the garbage collector can remove
mappings if a key or value becomes unreachable, or if the JVM's memory is
running low. For information on how the different reference types behave,
see Reference
.
Different types of references can be specified for keys and values.
The keys can be configured to be weak but the values hard,
in which case this class will behave like a
WeakHashMap
. However, you can also specify hard keys and
weak values, or any other combination. The default constructor uses
hard keys and soft values, providing a memory-sensitive cache.
This Map
implementation does not allow null elements.
Attempting to add a null key or value to the map will raise a
NullPointerException
.
All the available iterators can be reset back to the start by casting to
ResettableIterator
and calling reset()
.
This implementation is not synchronized.
You can use Collections.synchronizedMap(java.util.Map<K, V>)
to
provide synchronized access to a ReferenceMap
.
Reference
Modifier and Type | Class and Description |
---|---|
static class |
AbstractReferenceMap.ReferenceStrength
Reference type enum.
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Clears this map.
|
boolean |
containsKey(java.lang.Object key)
Checks whether the map contains the specified key.
|
boolean |
containsValue(java.lang.Object value)
Checks whether the map contains the specified value.
|
java.util.Set<java.util.Map.Entry<K,V>> |
entrySet()
Returns a set view of this map's entries.
|
V |
get(java.lang.Object key)
Gets the value mapped to the key specified.
|
boolean |
isEmpty()
Checks whether the map is currently empty.
|
java.util.Set<K> |
keySet()
Returns a set view of this map's keys.
|
MapIterator<K,V> |
mapIterator()
Gets a MapIterator over the reference map.
|
V |
put(K key,
V value)
Puts a key-value mapping into this map.
|
V |
remove(java.lang.Object key)
Removes the specified mapping from this map.
|
int |
size()
Gets the size of the map.
|
java.util.Collection<V> |
values()
Returns a collection view of this map's values.
|
equals, hashCode, putAll, toString
public int size()
public boolean isEmpty()
public boolean containsKey(java.lang.Object key)
containsKey
in interface java.util.Map<K,V>
containsKey
in interface Get<K,V>
containsKey
in class AbstractHashedMap<K,V>
key
- the key to search forMap.containsKey(Object)
public boolean containsValue(java.lang.Object value)
containsValue
in interface java.util.Map<K,V>
containsValue
in interface Get<K,V>
containsValue
in class AbstractHashedMap<K,V>
value
- the value to search forMap.containsValue(Object)
public V get(java.lang.Object key)
public V put(K key, V value)
put
in interface java.util.Map<K,V>
put
in interface Put<K,V>
put
in class AbstractHashedMap<K,V>
key
- the key to add, must not be nullvalue
- the value to add, must not be nulljava.lang.NullPointerException
- if either the key or value is nullMap.put(Object, Object)
public V remove(java.lang.Object key)
public void clear()
public MapIterator<K,V> mapIterator()
mapIterator
in interface IterableGet<K,V>
mapIterator
in class AbstractHashedMap<K,V>
public java.util.Set<java.util.Map.Entry<K,V>> entrySet()
next()
is called again.
The setValue()
method on the toArray
entries has no effect.public java.util.Set<K> keySet()
public java.util.Collection<V> values()
"Copyright © 2010 - 2020 Adobe Systems Incorporated. All Rights Reserved"