public abstract class AbstractReferenceMap extends AbstractHashedMap
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 | Field and Description |
---|---|
static int |
HARD
Constant indicating that hard references should be used
|
static int |
SOFT
Constant indicating that soft references should be used
|
static int |
WEAK
Constant indicating that weak references should be used
|
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 |
entrySet()
Returns a set view of this map's entries.
|
java.lang.Object |
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 |
keySet()
Returns a set view of this map's keys.
|
MapIterator |
mapIterator()
Gets a MapIterator over the reference map.
|
java.lang.Object |
put(java.lang.Object key,
java.lang.Object value)
Puts a key-value mapping into this map.
|
java.lang.Object |
remove(java.lang.Object key)
Removes the specified mapping from this map.
|
int |
size()
Gets the size of the map.
|
java.util.Collection |
values()
Returns a collection view of this map's values.
|
equals, hashCode, putAll, toString
public static final int HARD
public static final int SOFT
public static final int WEAK
public int size()
size
in interface java.util.Map
size
in class AbstractHashedMap
public boolean isEmpty()
isEmpty
in interface java.util.Map
isEmpty
in class AbstractHashedMap
public boolean containsKey(java.lang.Object key)
containsKey
in interface java.util.Map
containsKey
in class AbstractHashedMap
key
- the key to search forpublic boolean containsValue(java.lang.Object value)
containsValue
in interface java.util.Map
containsValue
in class AbstractHashedMap
value
- the value to search forpublic java.lang.Object get(java.lang.Object key)
get
in interface java.util.Map
get
in class AbstractHashedMap
key
- the keypublic java.lang.Object put(java.lang.Object key, java.lang.Object value)
put
in interface java.util.Map
put
in class AbstractHashedMap
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 nullpublic java.lang.Object remove(java.lang.Object key)
remove
in interface java.util.Map
remove
in class AbstractHashedMap
key
- the mapping to removepublic void clear()
clear
in interface java.util.Map
clear
in class AbstractHashedMap
public MapIterator mapIterator()
mapIterator
in interface IterableMap
mapIterator
in class AbstractHashedMap
public java.util.Set entrySet()
next()
is called again.
The setValue()
method on the toArray
entries has no effect.entrySet
in interface java.util.Map
entrySet
in class AbstractHashedMap
public java.util.Set keySet()
keySet
in interface java.util.Map
keySet
in class AbstractHashedMap
public java.util.Collection values()
values
in interface java.util.Map
values
in class AbstractHashedMap
Copyright © 2010 - 2020 Adobe. All Rights Reserved