|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object java.util.AbstractMap org.apache.openjpa.lib.util.concurrent.ConcurrentHashMap
public class ConcurrentHashMap
This class implements a HashMap which has limited synchronization. In particular mutators are generally synchronized while accessors are generally not. Additionally the Iterators returned by this class are not "fail-fast", but instead try to continue to iterate over the data structure after changes have been made. The synchronization semantics are built right in to the implementation rather than using a delegating wrapper like the other collection classes do because it wasn't clear to me that the how the two should be seperated or that it would be useful to do so. This can probably be a topic for further debate in the future. This class is based heavily on the HashMap class in the Java collections package.
Nested Class Summary | |
---|---|
protected static class |
ConcurrentHashMap.Entry
|
Nested classes/interfaces inherited from class java.util.AbstractMap |
---|
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V> |
Field Summary | |
---|---|
(package private) static double[] |
RANDOMS
Cache of random numbers used in "random" methods, since generating them is expensive. |
Constructor Summary | |
---|---|
ConcurrentHashMap()
Constructs an empty ConcurrentHashMap with the default initial capacity(16) and the default load factor(0.75). |
|
ConcurrentHashMap(int initialCapacity)
Constructs an empty ConcurrentHashMap with the specified initial capacity and the default load factor(0.75). |
|
ConcurrentHashMap(int initialCapacity,
float loadFactor)
Constructs an empty ConcurrentHashMap with the specified initial capacity and load factor. |
|
ConcurrentHashMap(Map m)
Constructs a new ConcurrentHashMap with the same mappings as the specified Map. |
Method Summary | |
---|---|
int |
capacity()
Returns the current capacity of backing table in this map. |
void |
clear()
Removes all mappings from this map. |
Object |
clone()
Returns a shallow copy of this ConcurrentHashMap instance: the keys and values themselves are not cloned. |
boolean |
containsKey(Object key)
Returns true if this map contains a mapping for the specified key. |
boolean |
containsValue(Object value)
Returns true if this map maps one or more keys to the specified value. |
protected ConcurrentHashMap.Entry |
createEntry(int h,
Object k,
Object v,
ConcurrentHashMap.Entry n)
|
Set |
entrySet()
Returns a collection view of the mappings contained in this map. |
Object |
get(Object key)
Returns the value to which the specified key is mapped in this identity hash map, or null if the map contains no mapping for this key. |
protected ConcurrentHashMap.Entry |
getEntry(Object key)
Returns the entry associated with the specified key in the ConcurrentHashMap. |
int |
getMaxSize()
The maximum number of entries, or Integer.MAX_VALUE for no limit. |
boolean |
isEmpty()
Returns true if this map contains no key-value mappings. |
boolean |
isFull()
Whether the map is full. |
Set |
keySet()
Returns a set view of the keys contained in this map. |
float |
loadFactor()
Returns the load factor for this map. |
void |
overflowRemoved(Object key,
Object value)
Overridable callback for when an overflow entry is automatically removed. |
Object |
put(Object key,
Object value)
Associates the specified value with the specified key in this map. |
void |
putAll(Map t)
Copies all of the mappings from the specified map to this map These mappings will replace any mappings that this map had for any of the keys currently in the specified map. |
Object |
putIfAbsent(Object key,
Object value)
|
Iterator |
randomEntryIterator()
Iterate over map entries, beginning at an arbitrary (not strictly random) entry. |
Object |
remove(Object key)
Removes the mapping for this key from this map if present. |
Map.Entry |
removeRandom()
Remove an arbitrary(not strictly random) entry from the map. |
void |
setMaxSize(int maxSize)
The maximum number of entries, or Integer.MAX_VALUE for no limit. |
int |
size()
Returns the number of key-value mappings in this map. |
Collection |
values()
Returns a collection view of the values contained in this map. |
Methods inherited from class java.util.AbstractMap |
---|
equals, hashCode, toString |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Map |
---|
equals, hashCode |
Field Detail |
---|
static final double[] RANDOMS
Constructor Detail |
---|
public ConcurrentHashMap(int initialCapacity, float loadFactor)
initialCapacity
- The initial capacity.loadFactor
- The load factor.
IllegalArgumentException
- if the initial capacity is negative
or the load factor is nonpositive.public ConcurrentHashMap(int initialCapacity)
initialCapacity
- the initial capacity.
IllegalArgumentException
- if the initial capacity is negative.public ConcurrentHashMap()
public ConcurrentHashMap(Map m)
m
- the map whose mappings are to be placed in this map.
NullPointerException
- if the specified map is null.Method Detail |
---|
public final int capacity()
public final float loadFactor()
public int getMaxSize()
SizedMap
getMaxSize
in interface SizedMap
public void setMaxSize(int maxSize)
SizedMap
setMaxSize
in interface SizedMap
public boolean isFull()
SizedMap
isFull
in interface SizedMap
public void overflowRemoved(Object key, Object value)
SizedMap
overflowRemoved
in interface SizedMap
public final int size()
size
in interface Map
size
in class AbstractMap
public final boolean isEmpty()
isEmpty
in interface Map
isEmpty
in class AbstractMap
public Object get(Object key)
get
in interface Map
get
in class AbstractMap
key
- the key whose associated value is to be returned.
put(Object, Object)
public final boolean containsKey(Object key)
containsKey
in interface Map
containsKey
in class AbstractMap
key
- The key whose presence in this map is to be tested
protected ConcurrentHashMap.Entry getEntry(Object key)
public Object put(Object key, Object value)
put
in interface Map
put
in class AbstractMap
key
- key with which the specified value is to be associated.value
- value to be associated with the specified key.
public Object putIfAbsent(Object key, Object value)
public final void putAll(Map t)
putAll
in interface Map
putAll
in class AbstractMap
t
- mappings to be stored in this map.
NullPointerException
- if the specified map is null.public Object remove(Object key)
remove
in interface Map
remove
in class AbstractMap
key
- key whose mapping is to be removed from the map.
public void clear()
clear
in interface Map
clear
in class AbstractMap
public Map.Entry removeRandom()
ConcurrentMap
removeRandom
in interface ConcurrentMap
public Iterator randomEntryIterator()
ConcurrentMap
randomEntryIterator
in interface ConcurrentMap
public final boolean containsValue(Object value)
containsValue
in interface Map
containsValue
in class AbstractMap
value
- value whose presence in this map is to be tested.
public final Object clone()
clone
in class AbstractMap
protected ConcurrentHashMap.Entry createEntry(int h, Object k, Object v, ConcurrentHashMap.Entry n)
public final Set keySet()
keySet
in interface Map
keySet
in class AbstractMap
public final Collection values()
values
in interface Map
values
in class AbstractMap
public final Set entrySet()
entrySet
in interface Map
entrySet
in class AbstractMap
ConcurrentHashMap.Entry
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |