Package org.jboss.netty.util.internal
Class ConcurrentIdentityWeakKeyHashMap.Segment<K,V>
- java.lang.Object
-
- java.util.concurrent.locks.ReentrantLock
-
- org.jboss.netty.util.internal.ConcurrentIdentityWeakKeyHashMap.Segment<K,V>
-
- All Implemented Interfaces:
java.io.Serializable
,java.util.concurrent.locks.Lock
- Enclosing class:
- ConcurrentIdentityWeakKeyHashMap<K,V>
static final class ConcurrentIdentityWeakKeyHashMap.Segment<K,V> extends java.util.concurrent.locks.ReentrantLock
Segments are specialized versions of hash tables. This subclasses from ReentrantLock opportunistically, just to simplify some locking and avoid separate construction.
-
-
Field Summary
Fields Modifier and Type Field Description (package private) int
count
The number of elements in this segment's region.(package private) float
loadFactor
The load factor for the hash table.(package private) int
modCount
Number of updates that alter the size of the table.(package private) java.lang.ref.ReferenceQueue<java.lang.Object>
refQueue
The collected weak-key reference queue for this segment.private static long
serialVersionUID
(package private) ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V>[]
table
The per-segment table.(package private) int
threshold
The table is rehashed when its size exceeds this threshold.
-
Constructor Summary
Constructors Constructor Description Segment(int initialCapacity, float lf)
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description (package private) void
clear()
(package private) boolean
containsKey(java.lang.Object key, int hash)
(package private) boolean
containsValue(java.lang.Object value)
(package private) V
get(java.lang.Object key, int hash)
(package private) ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V>
getFirst(int hash)
Returns properly casted first entry of bin for given hash.private static boolean
keyEq(java.lang.Object src, java.lang.Object dest)
(package private) static <K,V>
ConcurrentIdentityWeakKeyHashMap.Segment<K,V>[]newArray(int i)
(package private) ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V>
newHashEntry(K key, int hash, ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V> next, V value)
(package private) V
put(K key, int hash, V value, boolean onlyIfAbsent)
(package private) V
readValueUnderLock(ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V> e)
Reads value field of an entry under lock.(package private) int
rehash()
(package private) V
remove(java.lang.Object key, int hash, java.lang.Object value, boolean refRemove)
Remove; match on key only if value null, else match both.(package private) void
removeStale()
(package private) V
replace(K key, int hash, V newValue)
(package private) boolean
replace(K key, int hash, V oldValue, V newValue)
(package private) void
setTable(ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V>[] newTable)
Sets table to new HashEntry array.-
Methods inherited from class java.util.concurrent.locks.ReentrantLock
getHoldCount, getOwner, getQueuedThreads, getQueueLength, getWaitingThreads, getWaitQueueLength, hasQueuedThread, hasQueuedThreads, hasWaiters, isFair, isHeldByCurrentThread, isLocked, lock, lockInterruptibly, newCondition, toString, tryLock, tryLock, unlock
-
-
-
-
Field Detail
-
serialVersionUID
private static final long serialVersionUID
- See Also:
- Constant Field Values
-
count
transient volatile int count
The number of elements in this segment's region.
-
modCount
int modCount
Number of updates that alter the size of the table. This is used during bulk-read methods to make sure they see a consistent snapshot: If modCounts change during a traversal of segments computing size or checking containsValue, then we might have an inconsistent view of state so (usually) must retry.
-
threshold
int threshold
The table is rehashed when its size exceeds this threshold. (The value of this field is always (capacity * loadFactor).)
-
table
transient volatile ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V>[] table
The per-segment table.
-
loadFactor
final float loadFactor
The load factor for the hash table. Even though this value is same for all segments, it is replicated to avoid needing links to outer object.
-
refQueue
transient volatile java.lang.ref.ReferenceQueue<java.lang.Object> refQueue
The collected weak-key reference queue for this segment. This should be (re)initialized whenever table is assigned,
-
-
Method Detail
-
newArray
static <K,V> ConcurrentIdentityWeakKeyHashMap.Segment<K,V>[] newArray(int i)
-
keyEq
private static boolean keyEq(java.lang.Object src, java.lang.Object dest)
-
setTable
void setTable(ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V>[] newTable)
Sets table to new HashEntry array. Call only while holding lock or in constructor.
-
getFirst
ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V> getFirst(int hash)
Returns properly casted first entry of bin for given hash.
-
newHashEntry
ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V> newHashEntry(K key, int hash, ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V> next, V value)
-
readValueUnderLock
V readValueUnderLock(ConcurrentIdentityWeakKeyHashMap.HashEntry<K,V> e)
Reads value field of an entry under lock. Called if value field ever appears to be null. This is possible only if a compiler happens to reorder a HashEntry initialization with its table assignment, which is legal under memory model but is not known to ever occur.
-
get
V get(java.lang.Object key, int hash)
-
containsKey
boolean containsKey(java.lang.Object key, int hash)
-
containsValue
boolean containsValue(java.lang.Object value)
-
rehash
int rehash()
-
remove
V remove(java.lang.Object key, int hash, java.lang.Object value, boolean refRemove)
Remove; match on key only if value null, else match both.
-
removeStale
void removeStale()
-
clear
void clear()
-
-