public class TransactionalHashMap<K,V>
extends java.util.AbstractMap<K,V>
implements java.util.concurrent.ConcurrentMap<K,V>
| Constructor and Description | 
|---|
| TransactionalHashMap() | 
| TransactionalHashMap(int nBins) | 
| TransactionalHashMap(java.util.Map<? extends K,? extends V> m) | 
| Modifier and Type | Method and Description | 
|---|---|
| (package private) int | binFor(java.lang.Object k) | 
| void | clear() | 
| boolean | containsKey(java.lang.Object k) | 
| (package private) java.util.Map.Entry | entryAt(java.lang.Object k) | 
| java.util.Set<java.util.Map.Entry<K,V>> | entrySet() | 
| V | get(java.lang.Object k) | 
| boolean | isEmpty() | 
| (package private) IPersistentMap | mapAt(int bin) | 
| V | put(K k,
   V v) | 
| void | putAll(java.util.Map<? extends K,? extends V> map) | 
| V | putIfAbsent(K k,
           V v) | 
| V | remove(java.lang.Object k) | 
| boolean | remove(java.lang.Object k,
      java.lang.Object v) | 
| V | replace(K k,
       V v) | 
| boolean | replace(K k,
       V oldv,
       V newv) | 
| int | size() | 
clone, containsValue, equals, hashCode, keySet, toString, valuesfinal Ref[] bins
public TransactionalHashMap()
public TransactionalHashMap(int nBins)
IPersistentMap mapAt(int bin)
final int binFor(java.lang.Object k)
java.util.Map.Entry entryAt(java.lang.Object k)
public int size()
public boolean isEmpty()
public boolean containsKey(java.lang.Object k)
public V get(java.lang.Object k)
public V remove(java.lang.Object k)
public void clear()
public boolean remove(java.lang.Object k,
             java.lang.Object v)