1 |
/* |
2 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
* Expert Group and released to the public domain, as explained at |
4 |
* http://creativecommons.org/licenses/publicdomain |
5 |
*/ |
6 |
|
7 |
package java.util.concurrent; |
8 |
import java.util.concurrent.locks.*; |
9 |
import java.util.*; |
10 |
import java.io.Serializable; |
11 |
import java.io.IOException; |
12 |
import java.io.ObjectInputStream; |
13 |
import java.io.ObjectOutputStream; |
14 |
|
15 |
/** |
16 |
* A hash table supporting full concurrency of retrievals and |
17 |
* adjustable expected concurrency for updates. This class obeys the |
18 |
* same functional specification as {@link java.util.Hashtable}, and |
19 |
* includes versions of methods corresponding to each method of |
20 |
* <tt>Hashtable</tt>. However, even though all operations are |
21 |
* thread-safe, retrieval operations do <em>not</em> entail locking, |
22 |
* and there is <em>not</em> any support for locking the entire table |
23 |
* in a way that prevents all access. This class is fully |
24 |
* interoperable with <tt>Hashtable</tt> in programs that rely on its |
25 |
* thread safety but not on its synchronization details. |
26 |
* |
27 |
* <p> Retrieval operations (including <tt>get</tt>) generally do not |
28 |
* block, so may overlap with update operations (including |
29 |
* <tt>put</tt> and <tt>remove</tt>). Retrievals reflect the results |
30 |
* of the most recently <em>completed</em> update operations holding |
31 |
* upon their onset. For aggregate operations such as <tt>putAll</tt> |
32 |
* and <tt>clear</tt>, concurrent retrievals may reflect insertion or |
33 |
* removal of only some entries. Similarly, Iterators and |
34 |
* Enumerations return elements reflecting the state of the hash table |
35 |
* at some point at or since the creation of the iterator/enumeration. |
36 |
* They do <em>not</em> throw |
37 |
* {@link ConcurrentModificationException}. However, iterators are |
38 |
* designed to be used by only one thread at a time. |
39 |
* |
40 |
* <p> The allowed concurrency among update operations is guided by |
41 |
* the optional <tt>concurrencyLevel</tt> constructor argument |
42 |
* (default 16), which is used as a hint for internal sizing. The |
43 |
* table is internally partitioned to try to permit the indicated |
44 |
* number of concurrent updates without contention. Because placement |
45 |
* in hash tables is essentially random, the actual concurrency will |
46 |
* vary. Ideally, you should choose a value to accommodate as many |
47 |
* threads as will ever concurrently modify the table. Using a |
48 |
* significantly higher value than you need can waste space and time, |
49 |
* and a significantly lower value can lead to thread contention. But |
50 |
* overestimates and underestimates within an order of magnitude do |
51 |
* not usually have much noticeable impact. A value of one is |
52 |
* appropriate when it is known that only one thread will modify and |
53 |
* all others will only read. Also, resizing this or any other kind of |
54 |
* hash table is a relatively slow operation, so, when possible, it is |
55 |
* a good idea to provide estimates of expected table sizes in |
56 |
* constructors. |
57 |
* |
58 |
* <p>This class and its views and iterators implement all of the |
59 |
* <em>optional</em> methods of the {@link Map} and {@link Iterator} |
60 |
* interfaces. |
61 |
* |
62 |
* <p> Like {@link java.util.Hashtable} but unlike {@link |
63 |
* java.util.HashMap}, this class does NOT allow <tt>null</tt> to be |
64 |
* used as a key or value. |
65 |
* |
66 |
* <p>This class is a member of the |
67 |
* <a href="{@docRoot}/../guide/collections/index.html"> |
68 |
* Java Collections Framework</a>. |
69 |
* |
70 |
* @since 1.5 |
71 |
* @author Doug Lea |
72 |
* @param <K> the type of keys maintained by this map |
73 |
* @param <V> the type of mapped values |
74 |
*/ |
75 |
public class ConcurrentHashMap<K, V> extends AbstractMap<K, V> |
76 |
implements ConcurrentMap<K, V>, Serializable { |
77 |
private static final long serialVersionUID = 7249069246763182397L; |
78 |
|
79 |
/* |
80 |
* The basic strategy is to subdivide the table among Segments, |
81 |
* each of which itself is a concurrently readable hash table. |
82 |
*/ |
83 |
|
84 |
/* ---------------- Constants -------------- */ |
85 |
|
86 |
/** |
87 |
* The default initial number of table slots for this table. |
88 |
* Used when not otherwise specified in constructor. |
89 |
*/ |
90 |
static int DEFAULT_INITIAL_CAPACITY = 16; |
91 |
|
92 |
/** |
93 |
* The maximum capacity, used if a higher value is implicitly |
94 |
* specified by either of the constructors with arguments. MUST |
95 |
* be a power of two <= 1<<30 to ensure that entries are indexible |
96 |
* using ints. |
97 |
*/ |
98 |
static final int MAXIMUM_CAPACITY = 1 << 30; |
99 |
|
100 |
/** |
101 |
* The default load factor for this table. Used when not |
102 |
* otherwise specified in constructor. |
103 |
*/ |
104 |
static final float DEFAULT_LOAD_FACTOR = 0.75f; |
105 |
|
106 |
/** |
107 |
* The default number of concurrency control segments. |
108 |
**/ |
109 |
static final int DEFAULT_SEGMENTS = 16; |
110 |
|
111 |
/** |
112 |
* The maximum number of segments to allow; used to bound |
113 |
* constructor arguments. |
114 |
*/ |
115 |
static final int MAX_SEGMENTS = 1 << 16; // slightly conservative |
116 |
|
117 |
/** |
118 |
* Number of unsynchronized retries in size and containsValue |
119 |
* methods before resorting to locking. This is used to avoid |
120 |
* unbounded retries if tables undergo continuous modification |
121 |
* which would make it impossible to obtain an accurate result. |
122 |
*/ |
123 |
static final int RETRIES_BEFORE_LOCK = 2; |
124 |
|
125 |
/* ---------------- Fields -------------- */ |
126 |
|
127 |
/** |
128 |
* Mask value for indexing into segments. The upper bits of a |
129 |
* key's hash code are used to choose the segment. |
130 |
**/ |
131 |
final int segmentMask; |
132 |
|
133 |
/** |
134 |
* Shift value for indexing within segments. |
135 |
**/ |
136 |
final int segmentShift; |
137 |
|
138 |
/** |
139 |
* The segments, each of which is a specialized hash table |
140 |
*/ |
141 |
final Segment[] segments; |
142 |
|
143 |
transient Set<K> keySet; |
144 |
transient Set<Map.Entry<K,V>> entrySet; |
145 |
transient Collection<V> values; |
146 |
|
147 |
/* ---------------- Small Utilities -------------- */ |
148 |
|
149 |
/** |
150 |
* Returns a hash code for non-null Object x. |
151 |
* Uses the same hash code spreader as most other java.util hash tables. |
152 |
* @param x the object serving as a key |
153 |
* @return the hash code |
154 |
*/ |
155 |
static int hash(Object x) { |
156 |
int h = x.hashCode(); |
157 |
h += ~(h << 9); |
158 |
h ^= (h >>> 14); |
159 |
h += (h << 4); |
160 |
h ^= (h >>> 10); |
161 |
return h; |
162 |
} |
163 |
|
164 |
/** |
165 |
* Returns the segment that should be used for key with given hash |
166 |
* @param hash the hash code for the key |
167 |
* @return the segment |
168 |
*/ |
169 |
final Segment<K,V> segmentFor(int hash) { |
170 |
return (Segment<K,V>) segments[(hash >>> segmentShift) & segmentMask]; |
171 |
} |
172 |
|
173 |
/* ---------------- Inner Classes -------------- */ |
174 |
|
175 |
/** |
176 |
* ConcurrentHashMap list entry. Note that this is never exported |
177 |
* out as a user-visible Map.Entry. |
178 |
* |
179 |
* Because the value field is volatile, not final, it is legal wrt |
180 |
* the Java Memory Model for an unsynchronized reader to see null |
181 |
* instead of initial value when read via a data race. Although a |
182 |
* reordering leading to this is not likely to ever actually |
183 |
* occur, the Segment.readValueUnderLock method is used as a |
184 |
* backup in case a null (pre-initialized) value is ever seen in |
185 |
* an unsynchronized access method. |
186 |
*/ |
187 |
static final class HashEntry<K,V> { |
188 |
final K key; |
189 |
final int hash; |
190 |
volatile V value; |
191 |
final HashEntry<K,V> next; |
192 |
|
193 |
HashEntry(K key, int hash, HashEntry<K,V> next, V value) { |
194 |
this.key = key; |
195 |
this.hash = hash; |
196 |
this.next = next; |
197 |
this.value = value; |
198 |
} |
199 |
} |
200 |
|
201 |
/** |
202 |
* Segments are specialized versions of hash tables. This |
203 |
* subclasses from ReentrantLock opportunistically, just to |
204 |
* simplify some locking and avoid separate construction. |
205 |
**/ |
206 |
static final class Segment<K,V> extends ReentrantLock implements Serializable { |
207 |
/* |
208 |
* Segments maintain a table of entry lists that are ALWAYS |
209 |
* kept in a consistent state, so can be read without locking. |
210 |
* Next fields of nodes are immutable (final). All list |
211 |
* additions are performed at the front of each bin. This |
212 |
* makes it easy to check changes, and also fast to traverse. |
213 |
* When nodes would otherwise be changed, new nodes are |
214 |
* created to replace them. This works well for hash tables |
215 |
* since the bin lists tend to be short. (The average length |
216 |
* is less than two for the default load factor threshold.) |
217 |
* |
218 |
* Read operations can thus proceed without locking, but rely |
219 |
* on selected uses of volatiles to ensure that completed |
220 |
* write operations performed by other threads are |
221 |
* noticed. For most purposes, the "count" field, tracking the |
222 |
* number of elements, serves as that volatile variable |
223 |
* ensuring visibility. This is convenient because this field |
224 |
* needs to be read in many read operations anyway: |
225 |
* |
226 |
* - All (unsynchronized) read operations must first read the |
227 |
* "count" field, and should not look at table entries if |
228 |
* it is 0. |
229 |
* |
230 |
* - All (synchronized) write operations should write to |
231 |
* the "count" field after structurally changing any bin. |
232 |
* The operations must not take any action that could even |
233 |
* momentarily cause a concurrent read operation to see |
234 |
* inconsistent data. This is made easier by the nature of |
235 |
* the read operations in Map. For example, no operation |
236 |
* can reveal that the table has grown but the threshold |
237 |
* has not yet been updated, so there are no atomicity |
238 |
* requirements for this with respect to reads. |
239 |
* |
240 |
* As a guide, all critical volatile reads and writes to the |
241 |
* count field are marked in code comments. |
242 |
*/ |
243 |
|
244 |
private static final long serialVersionUID = 2249069246763182397L; |
245 |
|
246 |
/** |
247 |
* The number of elements in this segment's region. |
248 |
**/ |
249 |
transient volatile int count; |
250 |
|
251 |
/** |
252 |
* Number of updates that alter the size of the table. This is |
253 |
* used during bulk-read methods to make sure they see a |
254 |
* consistent snapshot: If modCounts change during a traversal |
255 |
* of segments computing size or checking containsValue, then |
256 |
* we might have an inconsistent view of state so (usually) |
257 |
* must retry. |
258 |
*/ |
259 |
transient int modCount; |
260 |
|
261 |
/** |
262 |
* The table is rehashed when its size exceeds this threshold. |
263 |
* (The value of this field is always (int)(capacity * |
264 |
* loadFactor).) |
265 |
*/ |
266 |
transient int threshold; |
267 |
|
268 |
/** |
269 |
* The per-segment table. Declared as a raw type, casted |
270 |
* to HashEntry<K,V> on each use. |
271 |
*/ |
272 |
transient volatile HashEntry[] table; |
273 |
|
274 |
/** |
275 |
* The load factor for the hash table. Even though this value |
276 |
* is same for all segments, it is replicated to avoid needing |
277 |
* links to outer object. |
278 |
* @serial |
279 |
*/ |
280 |
final float loadFactor; |
281 |
|
282 |
Segment(int initialCapacity, float lf) { |
283 |
loadFactor = lf; |
284 |
setTable(new HashEntry[initialCapacity]); |
285 |
} |
286 |
|
287 |
/** |
288 |
* Set table to new HashEntry array. |
289 |
* Call only while holding lock or in constructor. |
290 |
**/ |
291 |
void setTable(HashEntry[] newTable) { |
292 |
threshold = (int)(newTable.length * loadFactor); |
293 |
table = newTable; |
294 |
} |
295 |
|
296 |
/** |
297 |
* Return properly casted first entry of bin for given hash |
298 |
*/ |
299 |
HashEntry<K,V> getFirst(int hash) { |
300 |
HashEntry[] tab = table; |
301 |
return (HashEntry<K,V>) tab[hash & (tab.length - 1)]; |
302 |
} |
303 |
|
304 |
/** |
305 |
* Read value field of an entry under lock. Called if value |
306 |
* field ever appears to be null. This is possible only if a |
307 |
* compiler happens to reorder a HashEntry initialization with |
308 |
* its table assignment, which is legal under memory model |
309 |
* but is not known to ever occur. |
310 |
*/ |
311 |
V readValueUnderLock(HashEntry<K,V> e) { |
312 |
lock(); |
313 |
try { |
314 |
return e.value; |
315 |
} finally { |
316 |
unlock(); |
317 |
} |
318 |
} |
319 |
|
320 |
/* Specialized implementations of map methods */ |
321 |
|
322 |
V get(Object key, int hash) { |
323 |
if (count != 0) { // read-volatile |
324 |
HashEntry<K,V> e = getFirst(hash); |
325 |
while (e != null) { |
326 |
if (e.hash == hash && key.equals(e.key)) { |
327 |
V v = e.value; |
328 |
if (v != null) |
329 |
return v; |
330 |
return readValueUnderLock(e); // recheck |
331 |
} |
332 |
e = e.next; |
333 |
} |
334 |
} |
335 |
return null; |
336 |
} |
337 |
|
338 |
boolean containsKey(Object key, int hash) { |
339 |
if (count != 0) { // read-volatile |
340 |
HashEntry<K,V> e = getFirst(hash); |
341 |
while (e != null) { |
342 |
if (e.hash == hash && key.equals(e.key)) |
343 |
return true; |
344 |
e = e.next; |
345 |
} |
346 |
} |
347 |
return false; |
348 |
} |
349 |
|
350 |
boolean containsValue(Object value) { |
351 |
if (count != 0) { // read-volatile |
352 |
HashEntry[] tab = table; |
353 |
int len = tab.length; |
354 |
for (int i = 0 ; i < len; i++) { |
355 |
for (HashEntry<K,V> e = (HashEntry<K,V>)tab[i]; |
356 |
e != null ; |
357 |
e = e.next) { |
358 |
V v = e.value; |
359 |
if (v == null) // recheck |
360 |
v = readValueUnderLock(e); |
361 |
if (value.equals(v)) |
362 |
return true; |
363 |
} |
364 |
} |
365 |
} |
366 |
return false; |
367 |
} |
368 |
|
369 |
boolean replace(K key, int hash, V oldValue, V newValue) { |
370 |
lock(); |
371 |
try { |
372 |
HashEntry<K,V> e = getFirst(hash); |
373 |
while (e != null && (e.hash != hash || !key.equals(e.key))) |
374 |
e = e.next; |
375 |
|
376 |
boolean replaced = false; |
377 |
if (e != null && oldValue.equals(e.value)) { |
378 |
replaced = true; |
379 |
e.value = newValue; |
380 |
} |
381 |
return replaced; |
382 |
} finally { |
383 |
unlock(); |
384 |
} |
385 |
} |
386 |
|
387 |
V replace(K key, int hash, V newValue) { |
388 |
lock(); |
389 |
try { |
390 |
HashEntry<K,V> e = getFirst(hash); |
391 |
while (e != null && (e.hash != hash || !key.equals(e.key))) |
392 |
e = e.next; |
393 |
|
394 |
V oldValue = null; |
395 |
if (e != null) { |
396 |
oldValue = e.value; |
397 |
e.value = newValue; |
398 |
} |
399 |
return oldValue; |
400 |
} finally { |
401 |
unlock(); |
402 |
} |
403 |
} |
404 |
|
405 |
|
406 |
V put(K key, int hash, V value, boolean onlyIfAbsent) { |
407 |
lock(); |
408 |
try { |
409 |
int c = count; |
410 |
if (c++ > threshold) // ensure capacity |
411 |
rehash(); |
412 |
HashEntry[] tab = table; |
413 |
int index = hash & (tab.length - 1); |
414 |
HashEntry<K,V> first = (HashEntry<K,V>) tab[index]; |
415 |
HashEntry<K,V> e = first; |
416 |
while (e != null && (e.hash != hash || !key.equals(e.key))) |
417 |
e = e.next; |
418 |
|
419 |
V oldValue; |
420 |
if (e != null) { |
421 |
oldValue = e.value; |
422 |
if (!onlyIfAbsent) |
423 |
e.value = value; |
424 |
} |
425 |
else { |
426 |
oldValue = null; |
427 |
++modCount; |
428 |
tab[index] = new HashEntry<K,V>(key, hash, first, value); |
429 |
count = c; // write-volatile |
430 |
} |
431 |
return oldValue; |
432 |
} finally { |
433 |
unlock(); |
434 |
} |
435 |
} |
436 |
|
437 |
void rehash() { |
438 |
HashEntry[] oldTable = table; |
439 |
int oldCapacity = oldTable.length; |
440 |
if (oldCapacity >= MAXIMUM_CAPACITY) |
441 |
return; |
442 |
|
443 |
/* |
444 |
* Reclassify nodes in each list to new Map. Because we are |
445 |
* using power-of-two expansion, the elements from each bin |
446 |
* must either stay at same index, or move with a power of two |
447 |
* offset. We eliminate unnecessary node creation by catching |
448 |
* cases where old nodes can be reused because their next |
449 |
* fields won't change. Statistically, at the default |
450 |
* threshold, only about one-sixth of them need cloning when |
451 |
* a table doubles. The nodes they replace will be garbage |
452 |
* collectable as soon as they are no longer referenced by any |
453 |
* reader thread that may be in the midst of traversing table |
454 |
* right now. |
455 |
*/ |
456 |
|
457 |
HashEntry[] newTable = new HashEntry[oldCapacity << 1]; |
458 |
threshold = (int)(newTable.length * loadFactor); |
459 |
int sizeMask = newTable.length - 1; |
460 |
for (int i = 0; i < oldCapacity ; i++) { |
461 |
// We need to guarantee that any existing reads of old Map can |
462 |
// proceed. So we cannot yet null out each bin. |
463 |
HashEntry<K,V> e = (HashEntry<K,V>)oldTable[i]; |
464 |
|
465 |
if (e != null) { |
466 |
HashEntry<K,V> next = e.next; |
467 |
int idx = e.hash & sizeMask; |
468 |
|
469 |
// Single node on list |
470 |
if (next == null) |
471 |
newTable[idx] = e; |
472 |
|
473 |
else { |
474 |
// Reuse trailing consecutive sequence at same slot |
475 |
HashEntry<K,V> lastRun = e; |
476 |
int lastIdx = idx; |
477 |
for (HashEntry<K,V> last = next; |
478 |
last != null; |
479 |
last = last.next) { |
480 |
int k = last.hash & sizeMask; |
481 |
if (k != lastIdx) { |
482 |
lastIdx = k; |
483 |
lastRun = last; |
484 |
} |
485 |
} |
486 |
newTable[lastIdx] = lastRun; |
487 |
|
488 |
// Clone all remaining nodes |
489 |
for (HashEntry<K,V> p = e; p != lastRun; p = p.next) { |
490 |
int k = p.hash & sizeMask; |
491 |
HashEntry<K,V> n = (HashEntry<K,V>)newTable[k]; |
492 |
newTable[k] = new HashEntry<K,V>(p.key, p.hash, |
493 |
n, p.value); |
494 |
} |
495 |
} |
496 |
} |
497 |
} |
498 |
table = newTable; |
499 |
} |
500 |
|
501 |
/** |
502 |
* Remove; match on key only if value null, else match both. |
503 |
*/ |
504 |
V remove(Object key, int hash, Object value) { |
505 |
lock(); |
506 |
try { |
507 |
int c = count - 1; |
508 |
HashEntry[] tab = table; |
509 |
int index = hash & (tab.length - 1); |
510 |
HashEntry<K,V> first = (HashEntry<K,V>)tab[index]; |
511 |
HashEntry<K,V> e = first; |
512 |
while (e != null && (e.hash != hash || !key.equals(e.key))) |
513 |
e = e.next; |
514 |
|
515 |
V oldValue = null; |
516 |
if (e != null) { |
517 |
V v = e.value; |
518 |
if (value == null || value.equals(v)) { |
519 |
oldValue = v; |
520 |
// All entries following removed node can stay |
521 |
// in list, but all preceding ones need to be |
522 |
// cloned. |
523 |
++modCount; |
524 |
HashEntry<K,V> newFirst = e.next; |
525 |
for (HashEntry<K,V> p = first; p != e; p = p.next) |
526 |
newFirst = new HashEntry<K,V>(p.key, p.hash, |
527 |
newFirst, p.value); |
528 |
tab[index] = newFirst; |
529 |
count = c; // write-volatile |
530 |
} |
531 |
} |
532 |
return oldValue; |
533 |
} finally { |
534 |
unlock(); |
535 |
} |
536 |
} |
537 |
|
538 |
void clear() { |
539 |
if (count != 0) { |
540 |
lock(); |
541 |
try { |
542 |
HashEntry[] tab = table; |
543 |
for (int i = 0; i < tab.length ; i++) |
544 |
tab[i] = null; |
545 |
++modCount; |
546 |
count = 0; // write-volatile |
547 |
} finally { |
548 |
unlock(); |
549 |
} |
550 |
} |
551 |
} |
552 |
} |
553 |
|
554 |
|
555 |
|
556 |
/* ---------------- Public operations -------------- */ |
557 |
|
558 |
/** |
559 |
* Creates a new, empty map with the specified initial |
560 |
* capacity and the specified load factor. |
561 |
* |
562 |
* @param initialCapacity the initial capacity. The implementation |
563 |
* performs internal sizing to accommodate this many elements. |
564 |
* @param loadFactor the load factor threshold, used to control resizing. |
565 |
* @param concurrencyLevel the estimated number of concurrently |
566 |
* updating threads. The implementation performs internal sizing |
567 |
* to try to accommodate this many threads. |
568 |
* @throws IllegalArgumentException if the initial capacity is |
569 |
* negative or the load factor or concurrencyLevel are |
570 |
* nonpositive. |
571 |
*/ |
572 |
public ConcurrentHashMap(int initialCapacity, |
573 |
float loadFactor, int concurrencyLevel) { |
574 |
if (!(loadFactor > 0) || initialCapacity < 0 || concurrencyLevel <= 0) |
575 |
throw new IllegalArgumentException(); |
576 |
|
577 |
if (concurrencyLevel > MAX_SEGMENTS) |
578 |
concurrencyLevel = MAX_SEGMENTS; |
579 |
|
580 |
// Find power-of-two sizes best matching arguments |
581 |
int sshift = 0; |
582 |
int ssize = 1; |
583 |
while (ssize < concurrencyLevel) { |
584 |
++sshift; |
585 |
ssize <<= 1; |
586 |
} |
587 |
segmentShift = 32 - sshift; |
588 |
segmentMask = ssize - 1; |
589 |
this.segments = new Segment[ssize]; |
590 |
|
591 |
if (initialCapacity > MAXIMUM_CAPACITY) |
592 |
initialCapacity = MAXIMUM_CAPACITY; |
593 |
int c = initialCapacity / ssize; |
594 |
if (c * ssize < initialCapacity) |
595 |
++c; |
596 |
int cap = 1; |
597 |
while (cap < c) |
598 |
cap <<= 1; |
599 |
|
600 |
for (int i = 0; i < this.segments.length; ++i) |
601 |
this.segments[i] = new Segment<K,V>(cap, loadFactor); |
602 |
} |
603 |
|
604 |
/** |
605 |
* Creates a new, empty map with the specified initial |
606 |
* capacity, and with default load factor and concurrencyLevel. |
607 |
* |
608 |
* @param initialCapacity The implementation performs internal |
609 |
* sizing to accommodate this many elements. |
610 |
* @throws IllegalArgumentException if the initial capacity of |
611 |
* elements is negative. |
612 |
*/ |
613 |
public ConcurrentHashMap(int initialCapacity) { |
614 |
this(initialCapacity, DEFAULT_LOAD_FACTOR, DEFAULT_SEGMENTS); |
615 |
} |
616 |
|
617 |
/** |
618 |
* Creates a new, empty map with a default initial capacity, |
619 |
* load factor, and concurrencyLevel. |
620 |
*/ |
621 |
public ConcurrentHashMap() { |
622 |
this(DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR, DEFAULT_SEGMENTS); |
623 |
} |
624 |
|
625 |
/** |
626 |
* Creates a new map with the same mappings as the given map. The |
627 |
* map is created with a capacity of twice the number of mappings in |
628 |
* the given map or 11 (whichever is greater), and a default load factor |
629 |
* and concurrencyLevel. |
630 |
* @param t the map |
631 |
*/ |
632 |
public ConcurrentHashMap(Map<? extends K, ? extends V> t) { |
633 |
this(Math.max((int) (t.size() / DEFAULT_LOAD_FACTOR) + 1, |
634 |
11), |
635 |
DEFAULT_LOAD_FACTOR, DEFAULT_SEGMENTS); |
636 |
putAll(t); |
637 |
} |
638 |
|
639 |
// inherit Map javadoc |
640 |
public boolean isEmpty() { |
641 |
final Segment[] segments = this.segments; |
642 |
/* |
643 |
* We keep track of per-segment modCounts to avoid ABA |
644 |
* problems in which an element in one segment was added and |
645 |
* in another removed during traversal, in which case the |
646 |
* table was never actually empty at any point. Note the |
647 |
* similar use of modCounts in the size() and containsValue() |
648 |
* methods, which are the only other methods also susceptible |
649 |
* to ABA problems. |
650 |
*/ |
651 |
int[] mc = new int[segments.length]; |
652 |
int mcsum = 0; |
653 |
for (int i = 0; i < segments.length; ++i) { |
654 |
if (segments[i].count != 0) |
655 |
return false; |
656 |
else |
657 |
mcsum += mc[i] = segments[i].modCount; |
658 |
} |
659 |
// If mcsum happens to be zero, then we know we got a snapshot |
660 |
// before any modifications at all were made. This is |
661 |
// probably common enough to bother tracking. |
662 |
if (mcsum != 0) { |
663 |
for (int i = 0; i < segments.length; ++i) { |
664 |
if (segments[i].count != 0 || |
665 |
mc[i] != segments[i].modCount) |
666 |
return false; |
667 |
} |
668 |
} |
669 |
return true; |
670 |
} |
671 |
|
672 |
// inherit Map javadoc |
673 |
public int size() { |
674 |
final Segment[] segments = this.segments; |
675 |
long sum = 0; |
676 |
long check = 0; |
677 |
int[] mc = new int[segments.length]; |
678 |
// Try a few times to get accurate count. On failure due to |
679 |
// continuous async changes in table, resort to locking. |
680 |
for (int k = 0; k < RETRIES_BEFORE_LOCK; ++k) { |
681 |
check = 0; |
682 |
sum = 0; |
683 |
int mcsum = 0; |
684 |
for (int i = 0; i < segments.length; ++i) { |
685 |
sum += segments[i].count; |
686 |
mcsum += mc[i] = segments[i].modCount; |
687 |
} |
688 |
if (mcsum != 0) { |
689 |
for (int i = 0; i < segments.length; ++i) { |
690 |
check += segments[i].count; |
691 |
if (mc[i] != segments[i].modCount) { |
692 |
check = -1; // force retry |
693 |
break; |
694 |
} |
695 |
} |
696 |
} |
697 |
if (check == sum) |
698 |
break; |
699 |
} |
700 |
if (check != sum) { // Resort to locking all segments |
701 |
sum = 0; |
702 |
for (int i = 0; i < segments.length; ++i) |
703 |
segments[i].lock(); |
704 |
for (int i = 0; i < segments.length; ++i) |
705 |
sum += segments[i].count; |
706 |
for (int i = 0; i < segments.length; ++i) |
707 |
segments[i].unlock(); |
708 |
} |
709 |
if (sum > Integer.MAX_VALUE) |
710 |
return Integer.MAX_VALUE; |
711 |
else |
712 |
return (int)sum; |
713 |
} |
714 |
|
715 |
|
716 |
/** |
717 |
* Returns the value to which the specified key is mapped in this table. |
718 |
* |
719 |
* @param key a key in the table. |
720 |
* @return the value to which the key is mapped in this table; |
721 |
* <tt>null</tt> if the key is not mapped to any value in |
722 |
* this table. |
723 |
* @throws NullPointerException if the key is |
724 |
* <tt>null</tt>. |
725 |
*/ |
726 |
public V get(Object key) { |
727 |
int hash = hash(key); // throws NullPointerException if key null |
728 |
return segmentFor(hash).get(key, hash); |
729 |
} |
730 |
|
731 |
/** |
732 |
* Tests if the specified object is a key in this table. |
733 |
* |
734 |
* @param key possible key. |
735 |
* @return <tt>true</tt> if and only if the specified object |
736 |
* is a key in this table, as determined by the |
737 |
* <tt>equals</tt> method; <tt>false</tt> otherwise. |
738 |
* @throws NullPointerException if the key is |
739 |
* <tt>null</tt>. |
740 |
*/ |
741 |
public boolean containsKey(Object key) { |
742 |
int hash = hash(key); // throws NullPointerException if key null |
743 |
return segmentFor(hash).containsKey(key, hash); |
744 |
} |
745 |
|
746 |
/** |
747 |
* Returns <tt>true</tt> if this map maps one or more keys to the |
748 |
* specified value. Note: This method requires a full internal |
749 |
* traversal of the hash table, and so is much slower than |
750 |
* method <tt>containsKey</tt>. |
751 |
* |
752 |
* @param value value whose presence in this map is to be tested. |
753 |
* @return <tt>true</tt> if this map maps one or more keys to the |
754 |
* specified value. |
755 |
* @throws NullPointerException if the value is <tt>null</tt>. |
756 |
*/ |
757 |
public boolean containsValue(Object value) { |
758 |
if (value == null) |
759 |
throw new NullPointerException(); |
760 |
|
761 |
// See explanation of modCount use above |
762 |
|
763 |
final Segment[] segments = this.segments; |
764 |
int[] mc = new int[segments.length]; |
765 |
|
766 |
// Try a few times without locking |
767 |
for (int k = 0; k < RETRIES_BEFORE_LOCK; ++k) { |
768 |
int sum = 0; |
769 |
int mcsum = 0; |
770 |
for (int i = 0; i < segments.length; ++i) { |
771 |
int c = segments[i].count; |
772 |
mcsum += mc[i] = segments[i].modCount; |
773 |
if (segments[i].containsValue(value)) |
774 |
return true; |
775 |
} |
776 |
boolean cleanSweep = true; |
777 |
if (mcsum != 0) { |
778 |
for (int i = 0; i < segments.length; ++i) { |
779 |
int c = segments[i].count; |
780 |
if (mc[i] != segments[i].modCount) { |
781 |
cleanSweep = false; |
782 |
break; |
783 |
} |
784 |
} |
785 |
} |
786 |
if (cleanSweep) |
787 |
return false; |
788 |
} |
789 |
// Resort to locking all segments |
790 |
for (int i = 0; i < segments.length; ++i) |
791 |
segments[i].lock(); |
792 |
boolean found = false; |
793 |
try { |
794 |
for (int i = 0; i < segments.length; ++i) { |
795 |
if (segments[i].containsValue(value)) { |
796 |
found = true; |
797 |
break; |
798 |
} |
799 |
} |
800 |
} finally { |
801 |
for (int i = 0; i < segments.length; ++i) |
802 |
segments[i].unlock(); |
803 |
} |
804 |
return found; |
805 |
} |
806 |
|
807 |
/** |
808 |
* Legacy method testing if some key maps into the specified value |
809 |
* in this table. This method is identical in functionality to |
810 |
* {@link #containsValue}, and exists solely to ensure |
811 |
* full compatibility with class {@link java.util.Hashtable}, |
812 |
* which supported this method prior to introduction of the |
813 |
* Java Collections framework. |
814 |
|
815 |
* @param value a value to search for. |
816 |
* @return <tt>true</tt> if and only if some key maps to the |
817 |
* <tt>value</tt> argument in this table as |
818 |
* determined by the <tt>equals</tt> method; |
819 |
* <tt>false</tt> otherwise. |
820 |
* @throws NullPointerException if the value is <tt>null</tt>. |
821 |
*/ |
822 |
public boolean contains(Object value) { |
823 |
return containsValue(value); |
824 |
} |
825 |
|
826 |
/** |
827 |
* Maps the specified <tt>key</tt> to the specified |
828 |
* <tt>value</tt> in this table. Neither the key nor the |
829 |
* value can be <tt>null</tt>. |
830 |
* |
831 |
* <p> The value can be retrieved by calling the <tt>get</tt> method |
832 |
* with a key that is equal to the original key. |
833 |
* |
834 |
* @param key the table key. |
835 |
* @param value the value. |
836 |
* @return the previous value of the specified key in this table, |
837 |
* or <tt>null</tt> if it did not have one. |
838 |
* @throws NullPointerException if the key or value is |
839 |
* <tt>null</tt>. |
840 |
*/ |
841 |
public V put(K key, V value) { |
842 |
if (value == null) |
843 |
throw new NullPointerException(); |
844 |
int hash = hash(key); |
845 |
return segmentFor(hash).put(key, hash, value, false); |
846 |
} |
847 |
|
848 |
/** |
849 |
* If the specified key is not already associated |
850 |
* with a value, associate it with the given value. |
851 |
* This is equivalent to |
852 |
* <pre> |
853 |
* if (!map.containsKey(key)) |
854 |
* return map.put(key, value); |
855 |
* else |
856 |
* return map.get(key); |
857 |
* </pre> |
858 |
* Except that the action is performed atomically. |
859 |
* @param key key with which the specified value is to be associated. |
860 |
* @param value value to be associated with the specified key. |
861 |
* @return previous value associated with specified key, or <tt>null</tt> |
862 |
* if there was no mapping for key. |
863 |
* @throws NullPointerException if the specified key or value is |
864 |
* <tt>null</tt>. |
865 |
*/ |
866 |
public V putIfAbsent(K key, V value) { |
867 |
if (value == null) |
868 |
throw new NullPointerException(); |
869 |
int hash = hash(key); |
870 |
return segmentFor(hash).put(key, hash, value, true); |
871 |
} |
872 |
|
873 |
|
874 |
/** |
875 |
* Copies all of the mappings from the specified map to this one. |
876 |
* |
877 |
* These mappings replace any mappings that this map had for any of the |
878 |
* keys currently in the specified Map. |
879 |
* |
880 |
* @param t Mappings to be stored in this map. |
881 |
*/ |
882 |
public void putAll(Map<? extends K, ? extends V> t) { |
883 |
for (Iterator<? extends Map.Entry<? extends K, ? extends V>> it = (Iterator<? extends Map.Entry<? extends K, ? extends V>>) t.entrySet().iterator(); it.hasNext(); ) { |
884 |
Entry<? extends K, ? extends V> e = it.next(); |
885 |
put(e.getKey(), e.getValue()); |
886 |
} |
887 |
} |
888 |
|
889 |
/** |
890 |
* Removes the key (and its corresponding value) from this |
891 |
* table. This method does nothing if the key is not in the table. |
892 |
* |
893 |
* @param key the key that needs to be removed. |
894 |
* @return the value to which the key had been mapped in this table, |
895 |
* or <tt>null</tt> if the key did not have a mapping. |
896 |
* @throws NullPointerException if the key is |
897 |
* <tt>null</tt>. |
898 |
*/ |
899 |
public V remove(Object key) { |
900 |
int hash = hash(key); |
901 |
return segmentFor(hash).remove(key, hash, null); |
902 |
} |
903 |
|
904 |
/** |
905 |
* Remove entry for key only if currently mapped to given value. |
906 |
* Acts as |
907 |
* <pre> |
908 |
* if (map.get(key).equals(value)) { |
909 |
* map.remove(key); |
910 |
* return true; |
911 |
* } else return false; |
912 |
* </pre> |
913 |
* except that the action is performed atomically. |
914 |
* @param key key with which the specified value is associated. |
915 |
* @param value value associated with the specified key. |
916 |
* @return true if the value was removed |
917 |
* @throws NullPointerException if the specified key is |
918 |
* <tt>null</tt>. |
919 |
*/ |
920 |
public boolean remove(Object key, Object value) { |
921 |
int hash = hash(key); |
922 |
return segmentFor(hash).remove(key, hash, value) != null; |
923 |
} |
924 |
|
925 |
|
926 |
/** |
927 |
* Replace entry for key only if currently mapped to given value. |
928 |
* Acts as |
929 |
* <pre> |
930 |
* if (map.get(key).equals(oldValue)) { |
931 |
* map.put(key, newValue); |
932 |
* return true; |
933 |
* } else return false; |
934 |
* </pre> |
935 |
* except that the action is performed atomically. |
936 |
* @param key key with which the specified value is associated. |
937 |
* @param oldValue value expected to be associated with the specified key. |
938 |
* @param newValue value to be associated with the specified key. |
939 |
* @return true if the value was replaced |
940 |
* @throws NullPointerException if the specified key or values are |
941 |
* <tt>null</tt>. |
942 |
*/ |
943 |
public boolean replace(K key, V oldValue, V newValue) { |
944 |
if (oldValue == null || newValue == null) |
945 |
throw new NullPointerException(); |
946 |
int hash = hash(key); |
947 |
return segmentFor(hash).replace(key, hash, oldValue, newValue); |
948 |
} |
949 |
|
950 |
/** |
951 |
* Replace entry for key only if currently mapped to some value. |
952 |
* Acts as |
953 |
* <pre> |
954 |
* if ((map.containsKey(key)) { |
955 |
* return map.put(key, value); |
956 |
* } else return null; |
957 |
* </pre> |
958 |
* except that the action is performed atomically. |
959 |
* @param key key with which the specified value is associated. |
960 |
* @param value value to be associated with the specified key. |
961 |
* @return previous value associated with specified key, or <tt>null</tt> |
962 |
* if there was no mapping for key. |
963 |
* @throws NullPointerException if the specified key or value is |
964 |
* <tt>null</tt>. |
965 |
*/ |
966 |
public V replace(K key, V value) { |
967 |
if (value == null) |
968 |
throw new NullPointerException(); |
969 |
int hash = hash(key); |
970 |
return segmentFor(hash).replace(key, hash, value); |
971 |
} |
972 |
|
973 |
|
974 |
/** |
975 |
* Removes all mappings from this map. |
976 |
*/ |
977 |
public void clear() { |
978 |
for (int i = 0; i < segments.length; ++i) |
979 |
segments[i].clear(); |
980 |
} |
981 |
|
982 |
/** |
983 |
* Returns a set view of the keys contained in this map. The set is |
984 |
* backed by the map, so changes to the map are reflected in the set, and |
985 |
* vice-versa. The set supports element removal, which removes the |
986 |
* corresponding mapping from this map, via the <tt>Iterator.remove</tt>, |
987 |
* <tt>Set.remove</tt>, <tt>removeAll</tt>, <tt>retainAll</tt>, and |
988 |
* <tt>clear</tt> operations. It does not support the <tt>add</tt> or |
989 |
* <tt>addAll</tt> operations. |
990 |
* The view's returned <tt>iterator</tt> is a "weakly consistent" iterator that |
991 |
* will never throw {@link java.util.ConcurrentModificationException}, |
992 |
* and guarantees to traverse elements as they existed upon |
993 |
* construction of the iterator, and may (but is not guaranteed to) |
994 |
* reflect any modifications subsequent to construction. |
995 |
* |
996 |
* @return a set view of the keys contained in this map. |
997 |
*/ |
998 |
public Set<K> keySet() { |
999 |
Set<K> ks = keySet; |
1000 |
return (ks != null) ? ks : (keySet = new KeySet()); |
1001 |
} |
1002 |
|
1003 |
|
1004 |
/** |
1005 |
* Returns a collection view of the values contained in this map. The |
1006 |
* collection is backed by the map, so changes to the map are reflected in |
1007 |
* the collection, and vice-versa. The collection supports element |
1008 |
* removal, which removes the corresponding mapping from this map, via the |
1009 |
* <tt>Iterator.remove</tt>, <tt>Collection.remove</tt>, |
1010 |
* <tt>removeAll</tt>, <tt>retainAll</tt>, and <tt>clear</tt> operations. |
1011 |
* It does not support the <tt>add</tt> or <tt>addAll</tt> operations. |
1012 |
* The view's returned <tt>iterator</tt> is a "weakly consistent" iterator that |
1013 |
* will never throw {@link java.util.ConcurrentModificationException}, |
1014 |
* and guarantees to traverse elements as they existed upon |
1015 |
* construction of the iterator, and may (but is not guaranteed to) |
1016 |
* reflect any modifications subsequent to construction. |
1017 |
* |
1018 |
* @return a collection view of the values contained in this map. |
1019 |
*/ |
1020 |
public Collection<V> values() { |
1021 |
Collection<V> vs = values; |
1022 |
return (vs != null) ? vs : (values = new Values()); |
1023 |
} |
1024 |
|
1025 |
|
1026 |
/** |
1027 |
* Returns a collection view of the mappings contained in this map. Each |
1028 |
* element in the returned collection is a <tt>Map.Entry</tt>. The |
1029 |
* collection is backed by the map, so changes to the map are reflected in |
1030 |
* the collection, and vice-versa. The collection supports element |
1031 |
* removal, which removes the corresponding mapping from the map, via the |
1032 |
* <tt>Iterator.remove</tt>, <tt>Collection.remove</tt>, |
1033 |
* <tt>removeAll</tt>, <tt>retainAll</tt>, and <tt>clear</tt> operations. |
1034 |
* It does not support the <tt>add</tt> or <tt>addAll</tt> operations. |
1035 |
* The view's returned <tt>iterator</tt> is a "weakly consistent" iterator that |
1036 |
* will never throw {@link java.util.ConcurrentModificationException}, |
1037 |
* and guarantees to traverse elements as they existed upon |
1038 |
* construction of the iterator, and may (but is not guaranteed to) |
1039 |
* reflect any modifications subsequent to construction. |
1040 |
* |
1041 |
* @return a collection view of the mappings contained in this map. |
1042 |
*/ |
1043 |
public Set<Map.Entry<K,V>> entrySet() { |
1044 |
Set<Map.Entry<K,V>> es = entrySet; |
1045 |
return (es != null) ? es : (entrySet = (Set<Map.Entry<K,V>>) (Set) new EntrySet()); |
1046 |
} |
1047 |
|
1048 |
|
1049 |
/** |
1050 |
* Returns an enumeration of the keys in this table. |
1051 |
* |
1052 |
* @return an enumeration of the keys in this table. |
1053 |
* @see #keySet |
1054 |
*/ |
1055 |
public Enumeration<K> keys() { |
1056 |
return new KeyIterator(); |
1057 |
} |
1058 |
|
1059 |
/** |
1060 |
* Returns an enumeration of the values in this table. |
1061 |
* |
1062 |
* @return an enumeration of the values in this table. |
1063 |
* @see #values |
1064 |
*/ |
1065 |
public Enumeration<V> elements() { |
1066 |
return new ValueIterator(); |
1067 |
} |
1068 |
|
1069 |
/* ---------------- Iterator Support -------------- */ |
1070 |
|
1071 |
abstract class HashIterator { |
1072 |
int nextSegmentIndex; |
1073 |
int nextTableIndex; |
1074 |
HashEntry[] currentTable; |
1075 |
HashEntry<K, V> nextEntry; |
1076 |
HashEntry<K, V> lastReturned; |
1077 |
|
1078 |
HashIterator() { |
1079 |
nextSegmentIndex = segments.length - 1; |
1080 |
nextTableIndex = -1; |
1081 |
advance(); |
1082 |
} |
1083 |
|
1084 |
public boolean hasMoreElements() { return hasNext(); } |
1085 |
|
1086 |
final void advance() { |
1087 |
if (nextEntry != null && (nextEntry = nextEntry.next) != null) |
1088 |
return; |
1089 |
|
1090 |
while (nextTableIndex >= 0) { |
1091 |
if ( (nextEntry = (HashEntry<K,V>)currentTable[nextTableIndex--]) != null) |
1092 |
return; |
1093 |
} |
1094 |
|
1095 |
while (nextSegmentIndex >= 0) { |
1096 |
Segment<K,V> seg = (Segment<K,V>)segments[nextSegmentIndex--]; |
1097 |
if (seg.count != 0) { |
1098 |
currentTable = seg.table; |
1099 |
for (int j = currentTable.length - 1; j >= 0; --j) { |
1100 |
if ( (nextEntry = (HashEntry<K,V>)currentTable[j]) != null) { |
1101 |
nextTableIndex = j - 1; |
1102 |
return; |
1103 |
} |
1104 |
} |
1105 |
} |
1106 |
} |
1107 |
} |
1108 |
|
1109 |
public boolean hasNext() { return nextEntry != null; } |
1110 |
|
1111 |
HashEntry<K,V> nextEntry() { |
1112 |
if (nextEntry == null) |
1113 |
throw new NoSuchElementException(); |
1114 |
lastReturned = nextEntry; |
1115 |
advance(); |
1116 |
return lastReturned; |
1117 |
} |
1118 |
|
1119 |
public void remove() { |
1120 |
if (lastReturned == null) |
1121 |
throw new IllegalStateException(); |
1122 |
ConcurrentHashMap.this.remove(lastReturned.key); |
1123 |
lastReturned = null; |
1124 |
} |
1125 |
} |
1126 |
|
1127 |
final class KeyIterator extends HashIterator implements Iterator<K>, Enumeration<K> { |
1128 |
public K next() { return super.nextEntry().key; } |
1129 |
public K nextElement() { return super.nextEntry().key; } |
1130 |
} |
1131 |
|
1132 |
final class ValueIterator extends HashIterator implements Iterator<V>, Enumeration<V> { |
1133 |
public V next() { return super.nextEntry().value; } |
1134 |
public V nextElement() { return super.nextEntry().value; } |
1135 |
} |
1136 |
|
1137 |
|
1138 |
|
1139 |
/** |
1140 |
* Entry iterator. Exported Entry objects must write-through |
1141 |
* changes in setValue, even if the nodes have been cloned. So we |
1142 |
* cannot return internal HashEntry objects. Instead, the iterator |
1143 |
* itself acts as a forwarding pseudo-entry. |
1144 |
*/ |
1145 |
final class EntryIterator extends HashIterator implements Map.Entry<K,V>, Iterator<Entry<K,V>> { |
1146 |
public Map.Entry<K,V> next() { |
1147 |
nextEntry(); |
1148 |
return this; |
1149 |
} |
1150 |
|
1151 |
public K getKey() { |
1152 |
if (lastReturned == null) |
1153 |
throw new IllegalStateException("Entry was removed"); |
1154 |
return lastReturned.key; |
1155 |
} |
1156 |
|
1157 |
public V getValue() { |
1158 |
if (lastReturned == null) |
1159 |
throw new IllegalStateException("Entry was removed"); |
1160 |
return ConcurrentHashMap.this.get(lastReturned.key); |
1161 |
} |
1162 |
|
1163 |
public V setValue(V value) { |
1164 |
if (lastReturned == null) |
1165 |
throw new IllegalStateException("Entry was removed"); |
1166 |
return ConcurrentHashMap.this.put(lastReturned.key, value); |
1167 |
} |
1168 |
|
1169 |
public boolean equals(Object o) { |
1170 |
// If not acting as entry, just use default. |
1171 |
if (lastReturned == null) |
1172 |
return super.equals(o); |
1173 |
if (!(o instanceof Map.Entry)) |
1174 |
return false; |
1175 |
Map.Entry e = (Map.Entry)o; |
1176 |
return eq(getKey(), e.getKey()) && eq(getValue(), e.getValue()); |
1177 |
} |
1178 |
|
1179 |
public int hashCode() { |
1180 |
// If not acting as entry, just use default. |
1181 |
if (lastReturned == null) |
1182 |
return super.hashCode(); |
1183 |
|
1184 |
Object k = getKey(); |
1185 |
Object v = getValue(); |
1186 |
return ((k == null) ? 0 : k.hashCode()) ^ |
1187 |
((v == null) ? 0 : v.hashCode()); |
1188 |
} |
1189 |
|
1190 |
public String toString() { |
1191 |
// If not acting as entry, just use default. |
1192 |
if (lastReturned == null) |
1193 |
return super.toString(); |
1194 |
else |
1195 |
return getKey() + "=" + getValue(); |
1196 |
} |
1197 |
|
1198 |
boolean eq(Object o1, Object o2) { |
1199 |
return (o1 == null ? o2 == null : o1.equals(o2)); |
1200 |
} |
1201 |
|
1202 |
} |
1203 |
|
1204 |
final class KeySet extends AbstractSet<K> { |
1205 |
public Iterator<K> iterator() { |
1206 |
return new KeyIterator(); |
1207 |
} |
1208 |
public int size() { |
1209 |
return ConcurrentHashMap.this.size(); |
1210 |
} |
1211 |
public boolean contains(Object o) { |
1212 |
return ConcurrentHashMap.this.containsKey(o); |
1213 |
} |
1214 |
public boolean remove(Object o) { |
1215 |
return ConcurrentHashMap.this.remove(o) != null; |
1216 |
} |
1217 |
public void clear() { |
1218 |
ConcurrentHashMap.this.clear(); |
1219 |
} |
1220 |
public Object[] toArray() { |
1221 |
Collection<K> c = new ArrayList<K>(); |
1222 |
for (Iterator<K> i = iterator(); i.hasNext(); ) |
1223 |
c.add(i.next()); |
1224 |
return c.toArray(); |
1225 |
} |
1226 |
public <T> T[] toArray(T[] a) { |
1227 |
Collection<K> c = new ArrayList<K>(); |
1228 |
for (Iterator<K> i = iterator(); i.hasNext(); ) |
1229 |
c.add(i.next()); |
1230 |
return c.toArray(a); |
1231 |
} |
1232 |
} |
1233 |
|
1234 |
final class Values extends AbstractCollection<V> { |
1235 |
public Iterator<V> iterator() { |
1236 |
return new ValueIterator(); |
1237 |
} |
1238 |
public int size() { |
1239 |
return ConcurrentHashMap.this.size(); |
1240 |
} |
1241 |
public boolean contains(Object o) { |
1242 |
return ConcurrentHashMap.this.containsValue(o); |
1243 |
} |
1244 |
public void clear() { |
1245 |
ConcurrentHashMap.this.clear(); |
1246 |
} |
1247 |
public Object[] toArray() { |
1248 |
Collection<V> c = new ArrayList<V>(); |
1249 |
for (Iterator<V> i = iterator(); i.hasNext(); ) |
1250 |
c.add(i.next()); |
1251 |
return c.toArray(); |
1252 |
} |
1253 |
public <T> T[] toArray(T[] a) { |
1254 |
Collection<V> c = new ArrayList<V>(); |
1255 |
for (Iterator<V> i = iterator(); i.hasNext(); ) |
1256 |
c.add(i.next()); |
1257 |
return c.toArray(a); |
1258 |
} |
1259 |
} |
1260 |
|
1261 |
final class EntrySet extends AbstractSet<Map.Entry<K,V>> { |
1262 |
public Iterator<Map.Entry<K,V>> iterator() { |
1263 |
return new EntryIterator(); |
1264 |
} |
1265 |
public boolean contains(Object o) { |
1266 |
if (!(o instanceof Map.Entry)) |
1267 |
return false; |
1268 |
Map.Entry<K,V> e = (Map.Entry<K,V>)o; |
1269 |
V v = ConcurrentHashMap.this.get(e.getKey()); |
1270 |
return v != null && v.equals(e.getValue()); |
1271 |
} |
1272 |
public boolean remove(Object o) { |
1273 |
if (!(o instanceof Map.Entry)) |
1274 |
return false; |
1275 |
Map.Entry<K,V> e = (Map.Entry<K,V>)o; |
1276 |
return ConcurrentHashMap.this.remove(e.getKey(), e.getValue()); |
1277 |
} |
1278 |
public int size() { |
1279 |
return ConcurrentHashMap.this.size(); |
1280 |
} |
1281 |
public void clear() { |
1282 |
ConcurrentHashMap.this.clear(); |
1283 |
} |
1284 |
public Object[] toArray() { |
1285 |
// Since we don't ordinarily have distinct Entry objects, we |
1286 |
// must pack elements using exportable SimpleEntry |
1287 |
Collection<Map.Entry<K,V>> c = new ArrayList<Map.Entry<K,V>>(size()); |
1288 |
for (Iterator<Map.Entry<K,V>> i = iterator(); i.hasNext(); ) |
1289 |
c.add(new SimpleEntry<K,V>(i.next())); |
1290 |
return c.toArray(); |
1291 |
} |
1292 |
public <T> T[] toArray(T[] a) { |
1293 |
Collection<Map.Entry<K,V>> c = new ArrayList<Map.Entry<K,V>>(size()); |
1294 |
for (Iterator<Map.Entry<K,V>> i = iterator(); i.hasNext(); ) |
1295 |
c.add(new SimpleEntry<K,V>(i.next())); |
1296 |
return c.toArray(a); |
1297 |
} |
1298 |
|
1299 |
} |
1300 |
|
1301 |
/** |
1302 |
* This duplicates java.util.AbstractMap.SimpleEntry until this class |
1303 |
* is made accessible. |
1304 |
*/ |
1305 |
static final class SimpleEntry<K,V> implements Entry<K,V> { |
1306 |
K key; |
1307 |
V value; |
1308 |
|
1309 |
public SimpleEntry(K key, V value) { |
1310 |
this.key = key; |
1311 |
this.value = value; |
1312 |
} |
1313 |
|
1314 |
public SimpleEntry(Entry<K,V> e) { |
1315 |
this.key = e.getKey(); |
1316 |
this.value = e.getValue(); |
1317 |
} |
1318 |
|
1319 |
public K getKey() { |
1320 |
return key; |
1321 |
} |
1322 |
|
1323 |
public V getValue() { |
1324 |
return value; |
1325 |
} |
1326 |
|
1327 |
public V setValue(V value) { |
1328 |
V oldValue = this.value; |
1329 |
this.value = value; |
1330 |
return oldValue; |
1331 |
} |
1332 |
|
1333 |
public boolean equals(Object o) { |
1334 |
if (!(o instanceof Map.Entry)) |
1335 |
return false; |
1336 |
Map.Entry e = (Map.Entry)o; |
1337 |
return eq(key, e.getKey()) && eq(value, e.getValue()); |
1338 |
} |
1339 |
|
1340 |
public int hashCode() { |
1341 |
return ((key == null) ? 0 : key.hashCode()) ^ |
1342 |
((value == null) ? 0 : value.hashCode()); |
1343 |
} |
1344 |
|
1345 |
public String toString() { |
1346 |
return key + "=" + value; |
1347 |
} |
1348 |
|
1349 |
static boolean eq(Object o1, Object o2) { |
1350 |
return (o1 == null ? o2 == null : o1.equals(o2)); |
1351 |
} |
1352 |
} |
1353 |
|
1354 |
/* ---------------- Serialization Support -------------- */ |
1355 |
|
1356 |
/** |
1357 |
* Save the state of the <tt>ConcurrentHashMap</tt> |
1358 |
* instance to a stream (i.e., |
1359 |
* serialize it). |
1360 |
* @param s the stream |
1361 |
* @serialData |
1362 |
* the key (Object) and value (Object) |
1363 |
* for each key-value mapping, followed by a null pair. |
1364 |
* The key-value mappings are emitted in no particular order. |
1365 |
*/ |
1366 |
private void writeObject(java.io.ObjectOutputStream s) throws IOException { |
1367 |
s.defaultWriteObject(); |
1368 |
|
1369 |
for (int k = 0; k < segments.length; ++k) { |
1370 |
Segment<K,V> seg = (Segment<K,V>)segments[k]; |
1371 |
seg.lock(); |
1372 |
try { |
1373 |
HashEntry[] tab = seg.table; |
1374 |
for (int i = 0; i < tab.length; ++i) { |
1375 |
for (HashEntry<K,V> e = (HashEntry<K,V>)tab[i]; e != null; e = e.next) { |
1376 |
s.writeObject(e.key); |
1377 |
s.writeObject(e.value); |
1378 |
} |
1379 |
} |
1380 |
} finally { |
1381 |
seg.unlock(); |
1382 |
} |
1383 |
} |
1384 |
s.writeObject(null); |
1385 |
s.writeObject(null); |
1386 |
} |
1387 |
|
1388 |
/** |
1389 |
* Reconstitute the <tt>ConcurrentHashMap</tt> |
1390 |
* instance from a stream (i.e., |
1391 |
* deserialize it). |
1392 |
* @param s the stream |
1393 |
*/ |
1394 |
private void readObject(java.io.ObjectInputStream s) |
1395 |
throws IOException, ClassNotFoundException { |
1396 |
s.defaultReadObject(); |
1397 |
|
1398 |
// Initialize each segment to be minimally sized, and let grow. |
1399 |
for (int i = 0; i < segments.length; ++i) { |
1400 |
segments[i].setTable(new HashEntry[1]); |
1401 |
} |
1402 |
|
1403 |
// Read the keys and values, and put the mappings in the table |
1404 |
for (;;) { |
1405 |
K key = (K) s.readObject(); |
1406 |
V value = (V) s.readObject(); |
1407 |
if (key == null) |
1408 |
break; |
1409 |
put(key, value); |
1410 |
} |
1411 |
} |
1412 |
} |
1413 |
|