ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/main/java/util/concurrent/ConcurrentHashMap.java

Comparing jsr166/src/main/java/util/concurrent/ConcurrentHashMap.java (file contents):
Revision 1.143 by jsr166, Fri Nov 9 03:30:03 2012 UTC vs.
Revision 1.273 by jsr166, Wed Apr 29 18:01:41 2015 UTC

#	Line 5 | Line 5
5		*/
6
7		package java.util.concurrent;
8	–	import java.util.concurrent.atomic.LongAdder;
9	–	import java.util.concurrent.ForkJoinPool;
10	–	import java.util.concurrent.ForkJoinTask;
8
9	<	import java.util.Comparator;
9	>	import java.io.ObjectStreamField;
10	>	import java.io.Serializable;
11	>	import java.lang.reflect.ParameterizedType;
12	>	import java.lang.reflect.Type;
13	>	import java.util.AbstractMap;
14		import java.util.Arrays;
14	–	import java.util.Map;
15	–	import java.util.Set;
15		import java.util.Collection;
16	<	import java.util.AbstractMap;
18	<	import java.util.AbstractSet;
19	<	import java.util.AbstractCollection;
20	<	import java.util.Hashtable;
16	>	import java.util.Enumeration;
17		import java.util.HashMap;
18	+	import java.util.Hashtable;
19		import java.util.Iterator;
20	<	import java.util.Enumeration;
24	<	import java.util.ConcurrentModificationException;
20	>	import java.util.Map;
21		import java.util.NoSuchElementException;
22	<	import java.util.concurrent.ConcurrentMap;
23	<	import java.util.concurrent.ThreadLocalRandom;
28	<	import java.util.concurrent.locks.LockSupport;
29	<	import java.util.concurrent.locks.AbstractQueuedSynchronizer;
22	>	import java.util.Set;
23	>	import java.util.Spliterator;
24		import java.util.concurrent.atomic.AtomicReference;
25	<
26	<	import java.io.Serializable;
25	>	import java.util.concurrent.locks.LockSupport;
26	>	import java.util.concurrent.locks.ReentrantLock;
27	>	import java.util.function.BiConsumer;
28	>	import java.util.function.BiFunction;
29	>	import java.util.function.Consumer;
30	>	import java.util.function.DoubleBinaryOperator;
31	>	import java.util.function.Function;
32	>	import java.util.function.IntBinaryOperator;
33	>	import java.util.function.LongBinaryOperator;
34	>	import java.util.function.Predicate;
35	>	import java.util.function.ToDoubleBiFunction;
36	>	import java.util.function.ToDoubleFunction;
37	>	import java.util.function.ToIntBiFunction;
38	>	import java.util.function.ToIntFunction;
39	>	import java.util.function.ToLongBiFunction;
40	>	import java.util.function.ToLongFunction;
41	>	import java.util.stream.Stream;
42
43		/**
44		* A hash table supporting full concurrency of retrievals and
#	Line 43 | Line 52 | import java.io.Serializable;
52		* interoperable with {@code Hashtable} in programs that rely on its
53		* thread safety but not on its synchronization details.
54		*
55	<	* <p> Retrieval operations (including {@code get}) generally do not
55	>	* <p>Retrieval operations (including {@code get}) generally do not
56		* block, so may overlap with update operations (including {@code put}
57		* and {@code remove}). Retrievals reflect the results of the most
58		* recently <em>completed</em> update operations holding upon their
#	Line 52 | Line 61 | import java.io.Serializable;
61		* that key reporting the updated value.)  For aggregate operations
62		* such as {@code putAll} and {@code clear}, concurrent retrievals may
63		* reflect insertion or removal of only some entries.  Similarly,
64	<	* Iterators and Enumerations return elements reflecting the state of
65	<	* the hash table at some point at or since the creation of the
64	>	* Iterators, Spliterators and Enumerations return elements reflecting the
65	>	* state of the hash table at some point at or since the creation of the
66		* iterator/enumeration.  They do <em>not</em> throw {@link
67	<	* ConcurrentModificationException}.  However, iterators are designed
68	<	* to be used by only one thread at a time.  Bear in mind that the
69	<	* results of aggregate status methods including {@code size}, {@code
70	<	* isEmpty}, and {@code containsValue} are typically useful only when
71	<	* a map is not undergoing concurrent updates in other threads.
67	>	* java.util.ConcurrentModificationException ConcurrentModificationException}.
68	>	* However, iterators are designed to be used by only one thread at a time.
69	>	* Bear in mind that the results of aggregate status methods including
70	>	* {@code size}, {@code isEmpty}, and {@code containsValue} are typically
71	>	* useful only when a map is not undergoing concurrent updates in other threads.
72		* Otherwise the results of these methods reflect transient states
73		* that may be adequate for monitoring or estimation purposes, but not
74		* for program control.
75		*
76	<	* <p> The table is dynamically expanded when there are too many
76	>	* <p>The table is dynamically expanded when there are too many
77		* collisions (i.e., keys that have distinct hash codes but fall into
78		* the same slot modulo the table size), with the expected average
79		* effect of maintaining roughly two bins per mapping (corresponding
#	Line 83 | Line 92 | import java.io.Serializable;
92		* expected {@code concurrencyLevel} as an additional hint for
93		* internal sizing.  Note that using many keys with exactly the same
94		* {@code hashCode()} is a sure way to slow down performance of any
95	<	* hash table.
95	>	* hash table. To ameliorate impact, when keys are {@link Comparable},
96	>	* this class may use comparison order among keys to help break ties.
97		*
98	<	* <p> A {@link Set} projection of a ConcurrentHashMap may be created
98	>	* <p>A {@link Set} projection of a ConcurrentHashMap may be created
99		* (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
100		* (using {@link #keySet(Object)} when only keys are of interest, and the
101		* mapped values are (perhaps transiently) not used or all take the
102		* same mapping value.
103		*
104	<	* <p> A ConcurrentHashMap can be used as scalable frequency map (a
105	<	* form of histogram or multiset) by using {@link LongAdder} values
106	<	* and initializing via {@link #computeIfAbsent}. For example, to add
107	<	* a count to a {@code ConcurrentHashMap<String,LongAdder> freqs}, you
108	<	* can use {@code freqs.computeIfAbsent(k -> new
109	<	* LongAdder()).increment();}
104	>	* <p>A ConcurrentHashMap can be used as a scalable frequency map (a
105	>	* form of histogram or multiset) by using {@link
106	>	* java.util.concurrent.atomic.LongAdder} values and initializing via
107	>	* {@link #computeIfAbsent computeIfAbsent}. For example, to add a count
108	>	* to a {@code ConcurrentHashMap<String,LongAdder> freqs}, you can use
109	>	* {@code freqs.computeIfAbsent(key, k -> new LongAdder()).increment();}
110		*
111		* <p>This class and its views and iterators implement all of the
112		* <em>optional</em> methods of the {@link Map} and {@link Iterator}
113		* interfaces.
114		*
115	<	* <p> Like {@link Hashtable} but unlike {@link HashMap}, this class
115	>	* <p>Like {@link Hashtable} but unlike {@link HashMap}, this class
116		* does <em>not</em> allow {@code null} to be used as a key or value.
117		*
118	<	* <p>ConcurrentHashMaps support parallel operations using the {@link
119	<	* ForkJoinPool#commonPool}. (Tasks that may be used in other contexts
120	<	* are available in class {@link ForkJoinTasks}). These operations are
121	<	* designed to be safely, and often sensibly, applied even with maps
122	<	* that are being concurrently updated by other threads; for example,
123	<	* when computing a snapshot summary of the values in a shared
124	<	* registry.  There are three kinds of operation, each with four
125	<	* forms, accepting functions with Keys, Values, Entries, and (Key,
126	<	* Value) arguments and/or return values. (The first three forms are
127	<	* also available via the {@link #keySet()}, {@link #values()} and
128	<	* {@link #entrySet()} views). Because the elements of a
129	<	* ConcurrentHashMap are not ordered in any particular way, and may be
130	<	* processed in different orders in different parallel executions, the
131	<	* correctness of supplied functions should not depend on any
132	<	* ordering, or on any other objects or values that may transiently
123	<	* change while computation is in progress; and except for forEach
124	<	* actions, should ideally be side-effect-free.
118	>	* <p>ConcurrentHashMaps support a set of sequential and parallel bulk
119	>	* operations that, unlike most {@link Stream} methods, are designed
120	>	* to be safely, and often sensibly, applied even with maps that are
121	>	* being concurrently updated by other threads; for example, when
122	>	* computing a snapshot summary of the values in a shared registry.
123	>	* There are three kinds of operation, each with four forms, accepting
124	>	* functions with Keys, Values, Entries, and (Key, Value) arguments
125	>	* and/or return values. Because the elements of a ConcurrentHashMap
126	>	* are not ordered in any particular way, and may be processed in
127	>	* different orders in different parallel executions, the correctness
128	>	* of supplied functions should not depend on any ordering, or on any
129	>	* other objects or values that may transiently change while
130	>	* computation is in progress; and except for forEach actions, should
131	>	* ideally be side-effect-free. Bulk operations on {@link java.util.Map.Entry}
132	>	* objects do not support method {@code setValue}.
133		*
134		* <ul>
135		* <li> forEach: Perform a given action on each element.
#	Line 148 | Line 156 | import java.io.Serializable;
156		* <li> Reductions to scalar doubles, longs, and ints, using a
157		* given basis value.</li>
158		*
151	–	* </li>
159		* </ul>
160	+	* </li>
161		* </ul>
162		*
163	+	* <p>These bulk operations accept a {@code parallelismThreshold}
164	+	* argument. Methods proceed sequentially if the current map size is
165	+	* estimated to be less than the given threshold. Using a value of
166	+	* {@code Long.MAX_VALUE} suppresses all parallelism.  Using a value
167	+	* of {@code 1} results in maximal parallelism by partitioning into
168	+	* enough subtasks to fully utilize the {@link
169	+	* ForkJoinPool#commonPool()} that is used for all parallel
170	+	* computations. Normally, you would initially choose one of these
171	+	* extreme values, and then measure performance of using in-between
172	+	* values that trade off overhead versus throughput.
173	+	*
174		* <p>The concurrency properties of bulk operations follow
175		* from those of ConcurrentHashMap: Any non-null result returned
176		* from {@code get(key)} and related access methods bears a
#	Line 187 | Line 206 | import java.io.Serializable;
206		* arguments can be supplied using {@code new
207		* AbstractMap.SimpleEntry(k,v)}.
208		*
209	<	* <p> Bulk operations may complete abruptly, throwing an
209	>	* <p>Bulk operations may complete abruptly, throwing an
210		* exception encountered in the application of a supplied
211		* function. Bear in mind when handling such exceptions that other
212		* concurrently executing functions could also have thrown
213		* exceptions, or would have done so if the first exception had
214		* not occurred.
215		*
216	<	* <p>Parallel speedups for bulk operations compared to sequential
217	<	* processing are common but not guaranteed.  Operations involving
218	<	* brief functions on small maps may execute more slowly than
219	<	* sequential loops if the underlying work to parallelize the
220	<	* computation is more expensive than the computation itself.
221	<	* Similarly, parallelization may not lead to much actual parallelism
222	<	* if all processors are busy performing unrelated tasks.
204	<	*
205	<	* <p> All arguments to all task methods must be non-null.
216	>	* <p>Speedups for parallel compared to sequential forms are common
217	>	* but not guaranteed.  Parallel operations involving brief functions
218	>	* on small maps may execute more slowly than sequential forms if the
219	>	* underlying work to parallelize the computation is more expensive
220	>	* than the computation itself.  Similarly, parallelization may not
221	>	* lead to much actual parallelism if all processors are busy
222	>	* performing unrelated tasks.
223		*
224	<	* <p><em>jsr166e note: During transition, this class
208	<	* uses nested functional interfaces with different names but the
209	<	* same forms as those expected for JDK8.<em>
224	>	* <p>All arguments to all task methods must be non-null.
225		*
226		* <p>This class is a member of the
227		* <a href="{@docRoot}/../technotes/guides/collections/index.html">
#	Line 217 | Line 232 | import java.io.Serializable;
232		* @param <K> the type of keys maintained by this map
233		* @param <V> the type of mapped values
234		*/
235	<	public class ConcurrentHashMap<K, V>
236	<	implements ConcurrentMap<K, V>, Serializable {
235	>	public class ConcurrentHashMap<K,V> extends AbstractMap<K,V>
236	>	implements ConcurrentMap<K,V>, Serializable {
237		private static final long serialVersionUID = 7249069246763182397L;
238
224	–	/**
225	–	* A partitionable iterator. A Spliterator can be traversed
226	–	* directly, but can also be partitioned (before traversal) by
227	–	* creating another Spliterator that covers a non-overlapping
228	–	* portion of the elements, and so may be amenable to parallel
229	–	* execution.
230	–	*
231	–	* <p> This interface exports a subset of expected JDK8
232	–	* functionality.
233	–	*
234	–	* <p>Sample usage: Here is one (of the several) ways to compute
235	–	* the sum of the values held in a map using the ForkJoin
236	–	* framework. As illustrated here, Spliterators are well suited to
237	–	* designs in which a task repeatedly splits off half its work
238	–	* into forked subtasks until small enough to process directly,
239	–	* and then joins these subtasks. Variants of this style can also
240	–	* be used in completion-based designs.
241	–	*
242	–	* <pre>
243	–	* {@code ConcurrentHashMap<String, Long> m = ...
244	–	* // split as if have 8 * parallelism, for load balance
245	–	* int n = m.size();
246	–	* int p = aForkJoinPool.getParallelism() * 8;
247	–	* int split = (n < p)? n : p;
248	–	* long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
249	–	* // ...
250	–	* static class SumValues extends RecursiveTask<Long> {
251	–	*   final Spliterator<Long> s;
252	–	*   final int split;             // split while > 1
253	–	*   final SumValues nextJoin;    // records forked subtasks to join
254	–	*   SumValues(Spliterator<Long> s, int depth, SumValues nextJoin) {
255	–	*     this.s = s; this.depth = depth; this.nextJoin = nextJoin;
256	–	*   }
257	–	*   public Long compute() {
258	–	*     long sum = 0;
259	–	*     SumValues subtasks = null; // fork subtasks
260	–	*     for (int s = split >>> 1; s > 0; s >>>= 1)
261	–	*       (subtasks = new SumValues(s.split(), s, subtasks)).fork();
262	–	*     while (s.hasNext())        // directly process remaining elements
263	–	*       sum += s.next();
264	–	*     for (SumValues t = subtasks; t != null; t = t.nextJoin)
265	–	*       sum += t.join();         // collect subtask results
266	–	*     return sum;
267	–	*   }
268	–	* }
269	–	* }</pre>
270	–	*/
271	–	public static interface Spliterator<T> extends Iterator<T> {
272	–	/**
273	–	* Returns a Spliterator covering approximately half of the
274	–	* elements, guaranteed not to overlap with those subsequently
275	–	* returned by this Spliterator.  After invoking this method,
276	–	* the current Spliterator will <em>not</em> produce any of
277	–	* the elements of the returned Spliterator, but the two
278	–	* Spliterators together will produce all of the elements that
279	–	* would have been produced by this Spliterator had this
280	–	* method not been called. The exact number of elements
281	–	* produced by the returned Spliterator is not guaranteed, and
282	–	* may be zero (i.e., with {@code hasNext()} reporting {@code
283	–	* false}) if this Spliterator cannot be further split.
284	–	*
285	–	* @return a Spliterator covering approximately half of the
286	–	* elements
287	–	* @throws IllegalStateException if this Spliterator has
288	–	* already commenced traversing elements
289	–	*/
290	–	Spliterator<T> split();
291	–	}
292	–
293	–
239		/*
240		* Overview:
241		*
#	Line 301 | Line 246 | public class ConcurrentHashMap<K, V>
246		* the same or better than java.util.HashMap, and to support high
247		* initial insertion rates on an empty table by many threads.
248		*
249	<	* Each key-value mapping is held in a Node.  Because Node fields
250	<	* can contain special values, they are defined using plain Object
251	<	* types. Similarly in turn, all internal methods that use them
252	<	* work off Object types. And similarly, so do the internal
253	<	* methods of auxiliary iterator and view classes.  All public
254	<	* generic typed methods relay in/out of these internal methods,
255	<	* supplying null-checks and casts as needed. This also allows
256	<	* many of the public methods to be factored into a smaller number
257	<	* of internal methods (although sadly not so for the five
258	<	* variants of put-related operations). The validation-based
259	<	* approach explained below leads to a lot of code sprawl because
260	<	* retry-control precludes factoring into smaller methods.
249	>	* This map usually acts as a binned (bucketed) hash table.  Each
250	>	* key-value mapping is held in a Node.  Most nodes are instances
251	>	* of the basic Node class with hash, key, value, and next
252	>	* fields. However, various subclasses exist: TreeNodes are
253	>	* arranged in balanced trees, not lists.  TreeBins hold the roots
254	>	* of sets of TreeNodes. ForwardingNodes are placed at the heads
255	>	* of bins during resizing. ReservationNodes are used as
256	>	* placeholders while establishing values in computeIfAbsent and
257	>	* related methods.  The types TreeBin, ForwardingNode, and
258	>	* ReservationNode do not hold normal user keys, values, or
259	>	* hashes, and are readily distinguishable during search etc
260	>	* because they have negative hash fields and null key and value
261	>	* fields. (These special nodes are either uncommon or transient,
262	>	* so the impact of carrying around some unused fields is
263	>	* insignificant.)
264		*
265		* The table is lazily initialized to a power-of-two size upon the
266		* first insertion.  Each bin in the table normally contains a
#	Line 320 | Line 268 | public class ConcurrentHashMap<K, V>
268		* Table accesses require volatile/atomic reads, writes, and
269		* CASes.  Because there is no other way to arrange this without
270		* adding further indirections, we use intrinsics
271	<	* (sun.misc.Unsafe) operations.  The lists of nodes within bins
272	<	* are always accurately traversable under volatile reads, so long
273	<	* as lookups check hash code and non-nullness of value before
274	<	* checking key equality.
275	<	*
276	<	* We use the top two bits of Node hash fields for control
329	<	* purposes -- they are available anyway because of addressing
330	<	* constraints.  As explained further below, these top bits are
331	<	* used as follows:
332	<	*  00 - Normal
333	<	*  01 - Locked
334	<	*  11 - Locked and may have a thread waiting for lock
335	<	*  10 - Node is a forwarding node
336	<	*
337	<	* The lower 30 bits of each Node's hash field contain a
338	<	* transformation of the key's hash code, except for forwarding
339	<	* nodes, for which the lower bits are zero (and so always have
340	<	* hash field == MOVED).
271	>	* (sun.misc.Unsafe) operations.
272	>	*
273	>	* We use the top (sign) bit of Node hash fields for control
274	>	* purposes -- it is available anyway because of addressing
275	>	* constraints.  Nodes with negative hash fields are specially
276	>	* handled or ignored in map methods.
277		*
278		* Insertion (via put or its variants) of the first node in an
279		* empty bin is performed by just CASing it to the bin.  This is
#	Line 346 | Line 282 | public class ConcurrentHashMap<K, V>
282		* delete, and replace) require locks.  We do not want to waste
283		* the space required to associate a distinct lock object with
284		* each bin, so instead use the first node of a bin list itself as
285	<	* a lock. Blocking support for these locks relies on the builtin
286	<	* "synchronized" monitors.  However, we also need a tryLock
351	<	* construction, so we overlay these by using bits of the Node
352	<	* hash field for lock control (see above), and so normally use
353	<	* builtin monitors only for blocking and signalling using
354	<	* wait/notifyAll constructions. See Node.tryAwaitLock.
285	>	* a lock. Locking support for these locks relies on builtin
286	>	* "synchronized" monitors.
287		*
288		* Using the first node of a list as a lock does not by itself
289		* suffice though: When a node is locked, any update must first
290		* validate that it is still the first node after locking it, and
291		* retry if not. Because new nodes are always appended to lists,
292		* once a node is first in a bin, it remains first until deleted
293	<	* or the bin becomes invalidated (upon resizing).  However,
362	<	* operations that only conditionally update may inspect nodes
363	<	* until the point of update. This is a converse of sorts to the
364	<	* lazy locking technique described by Herlihy & Shavit.
293	>	* or the bin becomes invalidated (upon resizing).
294		*
295		* The main disadvantage of per-bin locks is that other update
296		* operations on other nodes in a bin list protected by the same
#	Line 394 | Line 323 | public class ConcurrentHashMap<K, V>
323		* sometimes deviate significantly from uniform randomness.  This
324		* includes the case when N > (1<<30), so some keys MUST collide.
325		* Similarly for dumb or hostile usages in which multiple keys are
326	<	* designed to have identical hash codes. Also, although we guard
327	<	* against the worst effects of this (see method spread), sets of
328	<	* hashes may differ only in bits that do not impact their bin
329	<	* index for a given power-of-two mask.  So we use a secondary
330	<	* strategy that applies when the number of nodes in a bin exceeds
331	<	* a threshold, and at least one of the keys implements
403	<	* Comparable.  These TreeBins use a balanced tree to hold nodes
404	<	* (a specialized form of red-black trees), bounding search time
405	<	* to O(log N).  Each search step in a TreeBin is around twice as
326	>	* designed to have identical hash codes or ones that differs only
327	>	* in masked-out high bits. So we use a secondary strategy that
328	>	* applies when the number of nodes in a bin exceeds a
329	>	* threshold. These TreeBins use a balanced tree to hold nodes (a
330	>	* specialized form of red-black trees), bounding search time to
331	>	* O(log N).  Each search step in a TreeBin is at least twice as
332		* slow as in a regular list, but given that N cannot exceed
333		* (1<<64) (before running out of addresses) this bounds search
334		* steps, lock hold times, etc, to reasonable constants (roughly
#	Line 413 | Line 339 | public class ConcurrentHashMap<K, V>
339		* iterators in the same way.
340		*
341		* The table is resized when occupancy exceeds a percentage
342	<	* threshold (nominally, 0.75, but see below).  Only a single
343	<	* thread performs the resize (using field "sizeCtl", to arrange
344	<	* exclusion), but the table otherwise remains usable for reads
345	<	* and updates. Resizing proceeds by transferring bins, one by
346	<	* one, from the table to the next table.  Because we are using
347	<	* power-of-two expansion, the elements from each bin must either
348	<	* stay at same index, or move with a power of two offset. We
349	<	* eliminate unnecessary node creation by catching cases where old
350	<	* nodes can be reused because their next fields won't change.  On
351	<	* average, only about one-sixth of them need cloning when a table
352	<	* doubles. The nodes they replace will be garbage collectable as
353	<	* soon as they are no longer referenced by any reader thread that
354	<	* may be in the midst of concurrently traversing table.  Upon
355	<	* transfer, the old table bin contains only a special forwarding
356	<	* node (with hash field "MOVED") that contains the next table as
357	<	* its key. On encountering a forwarding node, access and update
358	<	* operations restart, using the new table.
359	<	*
360	<	* Each bin transfer requires its bin lock. However, unlike other
361	<	* cases, a transfer can skip a bin if it fails to acquire its
362	<	* lock, and revisit it later (unless it is a TreeBin). Method
363	<	* rebuild maintains a buffer of TRANSFER_BUFFER_SIZE bins that
364	<	* have been skipped because of failure to acquire a lock, and
365	<	* blocks only if none are available (i.e., only very rarely).
366	<	* The transfer operation must also ensure that all accessible
367	<	* bins in both the old and new table are usable by any traversal.
368	<	* When there are no lock acquisition failures, this is arranged
369	<	* simply by proceeding from the last bin (table.length - 1) up
370	<	* towards the first.  Upon seeing a forwarding node, traversals
371	<	* (see class Iter) arrange to move to the new table
372	<	* without revisiting nodes.  However, when any node is skipped
373	<	* during a transfer, all earlier table bins may have become
374	<	* visible, so are initialized with a reverse-forwarding node back
375	<	* to the old table until the new ones are established. (This
376	<	* sometimes requires transiently locking a forwarding node, which
377	<	* is possible under the above encoding.) These more expensive
378	<	* mechanics trigger only when necessary.
342	>	* threshold (nominally, 0.75, but see below).  Any thread
343	>	* noticing an overfull bin may assist in resizing after the
344	>	* initiating thread allocates and sets up the replacement array.
345	>	* However, rather than stalling, these other threads may proceed
346	>	* with insertions etc.  The use of TreeBins shields us from the
347	>	* worst case effects of overfilling while resizes are in
348	>	* progress.  Resizing proceeds by transferring bins, one by one,
349	>	* from the table to the next table. However, threads claim small
350	>	* blocks of indices to transfer (via field transferIndex) before
351	>	* doing so, reducing contention.  A generation stamp in field
352	>	* sizeCtl ensures that resizings do not overlap. Because we are
353	>	* using power-of-two expansion, the elements from each bin must
354	>	* either stay at same index, or move with a power of two
355	>	* offset. We eliminate unnecessary node creation by catching
356	>	* cases where old nodes can be reused because their next fields
357	>	* won't change.  On average, only about one-sixth of them need
358	>	* cloning when a table doubles. The nodes they replace will be
359	>	* garbage collectable as soon as they are no longer referenced by
360	>	* any reader thread that may be in the midst of concurrently
361	>	* traversing table.  Upon transfer, the old table bin contains
362	>	* only a special forwarding node (with hash field "MOVED") that
363	>	* contains the next table as its key. On encountering a
364	>	* forwarding node, access and update operations restart, using
365	>	* the new table.
366	>	*
367	>	* Each bin transfer requires its bin lock, which can stall
368	>	* waiting for locks while resizing. However, because other
369	>	* threads can join in and help resize rather than contend for
370	>	* locks, average aggregate waits become shorter as resizing
371	>	* progresses.  The transfer operation must also ensure that all
372	>	* accessible bins in both the old and new table are usable by any
373	>	* traversal.  This is arranged in part by proceeding from the
374	>	* last bin (table.length - 1) up towards the first.  Upon seeing
375	>	* a forwarding node, traversals (see class Traverser) arrange to
376	>	* move to the new table without revisiting nodes.  To ensure that
377	>	* no intervening nodes are skipped even when moved out of order,
378	>	* a stack (see class TableStack) is created on first encounter of
379	>	* a forwarding node during a traversal, to maintain its place if
380	>	* later processing the current table. The need for these
381	>	* save/restore mechanics is relatively rare, but when one
382	>	* forwarding node is encountered, typically many more will be.
383	>	* So Traversers use a simple caching scheme to avoid creating so
384	>	* many new TableStack nodes. (Thanks to Peter Levart for
385	>	* suggesting use of a stack here.)
386		*
387		* The traversal scheme also applies to partial traversals of
388		* ranges of bins (via an alternate Traverser constructor)
#	Line 464 | Line 397 | public class ConcurrentHashMap<K, V>
397		* These cases attempt to override the initial capacity settings,
398		* but harmlessly fail to take effect in cases of races.
399		*
400	<	* The element count is maintained using a LongAdder, which avoids
401	<	* contention on updates but can encounter cache thrashing if read
402	<	* too frequently during concurrent access. To avoid reading so
403	<	* often, resizing is attempted either when a bin lock is
404	<	* contended, or upon adding to a bin already holding two or more
405	<	* nodes (checked before adding in the xIfAbsent methods, after
406	<	* adding in others). Under uniform hash distributions, the
407	<	* probability of this occurring at threshold is around 13%,
408	<	* meaning that only about 1 in 8 puts check threshold (and after
409	<	* resizing, many fewer do so). But this approximation has high
410	<	* variance for small table sizes, so we check on any collision
411	<	* for sizes <= 64. The bulk putAll operation further reduces
412	<	* contention by only committing count updates upon these size
413	<	* checks.
400	>	* The element count is maintained using a specialization of
401	>	* LongAdder. We need to incorporate a specialization rather than
402	>	* just use a LongAdder in order to access implicit
403	>	* contention-sensing that leads to creation of multiple
404	>	* CounterCells.  The counter mechanics avoid contention on
405	>	* updates but can encounter cache thrashing if read too
406	>	* frequently during concurrent access. To avoid reading so often,
407	>	* resizing under contention is attempted only upon adding to a
408	>	* bin already holding two or more nodes. Under uniform hash
409	>	* distributions, the probability of this occurring at threshold
410	>	* is around 13%, meaning that only about 1 in 8 puts check
411	>	* threshold (and after resizing, many fewer do so).
412	>	*
413	>	* TreeBins use a special form of comparison for search and
414	>	* related operations (which is the main reason we cannot use
415	>	* existing collections such as TreeMaps). TreeBins contain
416	>	* Comparable elements, but may contain others, as well as
417	>	* elements that are Comparable but not necessarily Comparable for
418	>	* the same T, so we cannot invoke compareTo among them. To handle
419	>	* this, the tree is ordered primarily by hash value, then by
420	>	* Comparable.compareTo order if applicable.  On lookup at a node,
421	>	* if elements are not comparable or compare as 0 then both left
422	>	* and right children may need to be searched in the case of tied
423	>	* hash values. (This corresponds to the full list search that
424	>	* would be necessary if all elements were non-Comparable and had
425	>	* tied hashes.) On insertion, to keep a total ordering (or as
426	>	* close as is required here) across rebalancings, we compare
427	>	* classes and identityHashCodes as tie-breakers. The red-black
428	>	* balancing code is updated from pre-jdk-collections
429	>	* (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
430	>	* based in turn on Cormen, Leiserson, and Rivest "Introduction to
431	>	* Algorithms" (CLR).
432	>	*
433	>	* TreeBins also require an additional locking mechanism.  While
434	>	* list traversal is always possible by readers even during
435	>	* updates, tree traversal is not, mainly because of tree-rotations
436	>	* that may change the root node and/or its linkages.  TreeBins
437	>	* include a simple read-write lock mechanism parasitic on the
438	>	* main bin-synchronization strategy: Structural adjustments
439	>	* associated with an insertion or removal are already bin-locked
440	>	* (and so cannot conflict with other writers) but must wait for
441	>	* ongoing readers to finish. Since there can be only one such
442	>	* waiter, we use a simple scheme using a single "waiter" field to
443	>	* block writers.  However, readers need never block.  If the root
444	>	* lock is held, they proceed along the slow traversal path (via
445	>	* next-pointers) until the lock becomes available or the list is
446	>	* exhausted, whichever comes first. These cases are not fast, but
447	>	* maximize aggregate expected throughput.
448		*
449		* Maintaining API and serialization compatibility with previous
450		* versions of this class introduces several oddities. Mainly: We
#	Line 487 | Line 454 | public class ConcurrentHashMap<K, V>
454		* time that we can guarantee to honor it.) We also declare an
455		* unused "Segment" class that is instantiated in minimal form
456		* only when serializing.
457	+	*
458	+	* Also, solely for compatibility with previous versions of this
459	+	* class, it extends AbstractMap, even though all of its methods
460	+	* are overridden, so it is just useless baggage.
461	+	*
462	+	* This file is organized to make things a little easier to follow
463	+	* while reading than they might otherwise: First the main static
464	+	* declarations and utilities, then fields, then main public
465	+	* methods (with a few factorings of multiple public methods into
466	+	* internal ones), then sizing methods, trees, traversers, and
467	+	* bulk operations.
468		*/
469
470		/* ---------------- Constants -------------- */
#	Line 528 | Line 506 | public class ConcurrentHashMap<K, V>
506		private static final float LOAD_FACTOR = 0.75f;
507
508		/**
509	<	* The buffer size for skipped bins during transfers. The
510	<	* value is arbitrary but should be large enough to avoid
511	<	* most locking stalls during resizes.
509	>	* The bin count threshold for using a tree rather than list for a
510	>	* bin.  Bins are converted to trees when adding an element to a
511	>	* bin with at least this many nodes. The value must be greater
512	>	* than 2, and should be at least 8 to mesh with assumptions in
513	>	* tree removal about conversion back to plain bins upon
514	>	* shrinkage.
515		*/
516	<	private static final int TRANSFER_BUFFER_SIZE = 32;
516	>	static final int TREEIFY_THRESHOLD = 8;
517
518		/**
519	<	* The bin count threshold for using a tree rather than list for a
520	<	* bin.  The value reflects the approximate break-even point for
521	<	* using tree-based operations.
519	>	* The bin count threshold for untreeifying a (split) bin during a
520	>	* resize operation. Should be less than TREEIFY_THRESHOLD, and at
521	>	* most 6 to mesh with shrinkage detection under removal.
522		*/
523	<	private static final int TREE_THRESHOLD = 8;
523	>	static final int UNTREEIFY_THRESHOLD = 6;
524
525	<	/*
526	<	* Encodings for special uses of Node hash fields. See above for
527	<	* explanation.
525	>	/**
526	>	* The smallest table capacity for which bins may be treeified.
527	>	* (Otherwise the table is resized if too many nodes in a bin.)
528	>	* The value should be at least 4 * TREEIFY_THRESHOLD to avoid
529	>	* conflicts between resizing and treeification thresholds.
530		*/
531	<	static final int MOVED     = 0x80000000; // hash field for forwarding nodes
549	<	static final int LOCKED    = 0x40000000; // set/tested only as a bit
550	<	static final int WAITING   = 0xc0000000; // both bits set/tested together
551	<	static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash
552	<
553	<	/* ---------------- Fields -------------- */
531	>	static final int MIN_TREEIFY_CAPACITY = 64;
532
533		/**
534	<	* The array of bins. Lazily initialized upon first insertion.
535	<	* Size is always a power of two. Accessed directly by iterators.
534	>	* Minimum number of rebinnings per transfer step. Ranges are
535	>	* subdivided to allow multiple resizer threads.  This value
536	>	* serves as a lower bound to avoid resizers encountering
537	>	* excessive memory contention.  The value should be at least
538	>	* DEFAULT_CAPACITY.
539		*/
540	<	transient volatile Node[] table;
540	>	private static final int MIN_TRANSFER_STRIDE = 16;
541
542		/**
543	<	* The counter maintaining number of elements.
543	>	* The number of bits used for generation stamp in sizeCtl.
544	>	* Must be at least 6 for 32bit arrays.
545		*/
546	<	private transient final LongAdder counter;
546	>	private static int RESIZE_STAMP_BITS = 16;
547
548		/**
549	<	* Table initialization and resizing control.  When negative, the
550	<	* table is being initialized or resized. Otherwise, when table is
569	<	* null, holds the initial table size to use upon creation, or 0
570	<	* for default. After initialization, holds the next element count
571	<	* value upon which to resize the table.
549	>	* The maximum number of threads that can help resize.
550	>	* Must fit in 32 - RESIZE_STAMP_BITS bits.
551		*/
552	<	private transient volatile int sizeCtl;
552	>	private static final int MAX_RESIZERS = (1 << (32 - RESIZE_STAMP_BITS)) - 1;
553
554	<	// views
555	<	private transient KeySetView<K,V> keySet;
556	<	private transient ValuesView<K,V> values;
557	<	private transient EntrySetView<K,V> entrySet;
579	<
580	<	/** For serialization compatibility. Null unless serialized; see below */
581	<	private Segment<K,V>[] segments;
582	<
583	<	/* ---------------- Table element access -------------- */
554	>	/**
555	>	* The bit shift for recording size stamp in sizeCtl.
556	>	*/
557	>	private static final int RESIZE_STAMP_SHIFT = 32 - RESIZE_STAMP_BITS;
558
559		/*
560	<	* Volatile access methods are used for table elements as well as
587	<	* elements of in-progress next table while resizing.  Uses are
588	<	* null checked by callers, and implicitly bounds-checked, relying
589	<	* on the invariants that tab arrays have non-zero size, and all
590	<	* indices are masked with (tab.length - 1) which is never
591	<	* negative and always less than length. Note that, to be correct
592	<	* wrt arbitrary concurrency errors by users, bounds checks must
593	<	* operate on local variables, which accounts for some odd-looking
594	<	* inline assignments below.
560	>	* Encodings for Node hash fields. See above for explanation.
561		*/
562	<
563	<	static final Node tabAt(Node[] tab, int i) { // used by Iter
564	<	return (Node)UNSAFE.getObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE);
565	<	}
566	<
567	<	private static final boolean casTabAt(Node[] tab, int i, Node c, Node v) {
568	<	return UNSAFE.compareAndSwapObject(tab, ((long)i<<ASHIFT)+ABASE, c, v);
569	<	}
570	<
571	<	private static final void setTabAt(Node[] tab, int i, Node v) {
572	<	UNSAFE.putObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE, v);
573	<	}
562	>	static final int MOVED     = -1; // hash for forwarding nodes
563	>	static final int TREEBIN   = -2; // hash for roots of trees
564	>	static final int RESERVED  = -3; // hash for transient reservations
565	>	static final int HASH_BITS = 0x7fffffff; // usable bits of normal node hash
566	>
567	>	/** Number of CPUS, to place bounds on some sizings */
568	>	static final int NCPU = Runtime.getRuntime().availableProcessors();
569	>
570	>	/** For serialization compatibility. */
571	>	private static final ObjectStreamField[] serialPersistentFields = {
572	>	new ObjectStreamField("segments", Segment[].class),
573	>	new ObjectStreamField("segmentMask", Integer.TYPE),
574	>	new ObjectStreamField("segmentShift", Integer.TYPE)
575	>	};
576
577		/* ---------------- Nodes -------------- */
578
579		/**
580	<	* Key-value entry. Note that this is never exported out as a
581	<	* user-visible Map.Entry (see MapEntry below). Nodes with a hash
582	<	* field of MOVED are special, and do not contain user keys or
583	<	* values.  Otherwise, keys are never null, and null val fields
584	<	* indicate that a node is in the process of being deleted or
585	<	* created. For purposes of read-only access, a key may be read
586	<	* before a val, but can only be used after checking val to be
587	<	* non-null.
588	<	*/
589	<	static class Node {
590	<	volatile int hash;
591	<	final Object key;
624	<	volatile Object val;
625	<	volatile Node next;
580	>	* Key-value entry.  This class is never exported out as a
581	>	* user-mutable Map.Entry (i.e., one supporting setValue; see
582	>	* MapEntry below), but can be used for read-only traversals used
583	>	* in bulk tasks.  Subclasses of Node with a negative hash field
584	>	* are special, and contain null keys and values (but are never
585	>	* exported).  Otherwise, keys and vals are never null.
586	>	*/
587	>	static class Node<K,V> implements Map.Entry<K,V> {
588	>	final int hash;
589	>	final K key;
590	>	volatile V val;
591	>	volatile Node<K,V> next;
592
593	<	Node(int hash, Object key, Object val, Node next) {
593	>	Node(int hash, K key, V val, Node<K,V> next) {
594		this.hash = hash;
595		this.key = key;
596		this.val = val;
597		this.next = next;
598		}
599
600	<	/** CompareAndSet the hash field */
601	<	final boolean casHash(int cmp, int val) {
602	<	return UNSAFE.compareAndSwapInt(this, hashOffset, cmp, val);
603	<	}
604	<
639	<	/** The number of spins before blocking for a lock */
640	<	static final int MAX_SPINS =
641	<	Runtime.getRuntime().availableProcessors() > 1 ? 64 : 1;
642	<
643	<	/**
644	<	* Spins a while if LOCKED bit set and this node is the first
645	<	* of its bin, and then sets WAITING bits on hash field and
646	<	* blocks (once) if they are still set.  It is OK for this
647	<	* method to return even if lock is not available upon exit,
648	<	* which enables these simple single-wait mechanics.
649	<	*
650	<	* The corresponding signalling operation is performed within
651	<	* callers: Upon detecting that WAITING has been set when
652	<	* unlocking lock (via a failed CAS from non-waiting LOCKED
653	<	* state), unlockers acquire the sync lock and perform a
654	<	* notifyAll.
655	<	*
656	<	* The initial sanity check on tab and bounds is not currently
657	<	* necessary in the only usages of this method, but enables
658	<	* use in other future contexts.
659	<	*/
660	<	final void tryAwaitLock(Node[] tab, int i) {
661	<	if (tab != null && i >= 0 && i < tab.length) { // sanity check
662	<	int r = ThreadLocalRandom.current().nextInt(); // randomize spins
663	<	int spins = MAX_SPINS, h;
664	<	while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) {
665	<	if (spins >= 0) {
666	<	r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
667	<	if (r >= 0 && --spins == 0)
668	<	Thread.yield();  // yield before block
669	<	}
670	<	else if (casHash(h, h | WAITING)) {
671	<	synchronized (this) {
672	<	if (tabAt(tab, i) == this &&
673	<	(hash & WAITING) == WAITING) {
674	<	try {
675	<	wait();
676	<	} catch (InterruptedException ie) {
677	<	try {
678	<	Thread.currentThread().interrupt();
679	<	} catch (SecurityException ignore) {
680	<	}
681	<	}
682	<	}
683	<	else
684	<	notifyAll(); // possibly won race vs signaller
685	<	}
686	<	break;
687	<	}
688	<	}
689	<	}
690	<	}
691	<
692	<	// Unsafe mechanics for casHash
693	<	private static final sun.misc.Unsafe UNSAFE;
694	<	private static final long hashOffset;
695	<
696	<	static {
697	<	try {
698	<	UNSAFE = sun.misc.Unsafe.getUnsafe();
699	<	Class<?> k = Node.class;
700	<	hashOffset = UNSAFE.objectFieldOffset
701	<	(k.getDeclaredField("hash"));
702	<	} catch (Exception e) {
703	<	throw new Error(e);
704	<	}
705	<	}
706	<	}
707	<
708	<	/* ---------------- TreeBins -------------- */
709	<
710	<	/**
711	<	* Nodes for use in TreeBins
712	<	*/
713	<	static final class TreeNode extends Node {
714	<	TreeNode parent;  // red-black tree links
715	<	TreeNode left;
716	<	TreeNode right;
717	<	TreeNode prev;    // needed to unlink next upon deletion
718	<	boolean red;
719	<
720	<	TreeNode(int hash, Object key, Object val, Node next, TreeNode parent) {
721	<	super(hash, key, val, next);
722	<	this.parent = parent;
723	<	}
724	<	}
725	<
726	<	/**
727	<	* A specialized form of red-black tree for use in bins
728	<	* whose size exceeds a threshold.
729	<	*
730	<	* TreeBins use a special form of comparison for search and
731	<	* related operations (which is the main reason we cannot use
732	<	* existing collections such as TreeMaps). TreeBins contain
733	<	* Comparable elements, but may contain others, as well as
734	<	* elements that are Comparable but not necessarily Comparable<T>
735	<	* for the same T, so we cannot invoke compareTo among them. To
736	<	* handle this, the tree is ordered primarily by hash value, then
737	<	* by getClass().getName() order, and then by Comparator order
738	<	* among elements of the same class.  On lookup at a node, if
739	<	* elements are not comparable or compare as 0, both left and
740	<	* right children may need to be searched in the case of tied hash
741	<	* values. (This corresponds to the full list search that would be
742	<	* necessary if all elements were non-Comparable and had tied
743	<	* hashes.)  The red-black balancing code is updated from
744	<	* pre-jdk-collections
745	<	* (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
746	<	* based in turn on Cormen, Leiserson, and Rivest "Introduction to
747	<	* Algorithms" (CLR).
748	<	*
749	<	* TreeBins also maintain a separate locking discipline than
750	<	* regular bins. Because they are forwarded via special MOVED
751	<	* nodes at bin heads (which can never change once established),
752	<	* we cannot use those nodes as locks. Instead, TreeBin
753	<	* extends AbstractQueuedSynchronizer to support a simple form of
754	<	* read-write lock. For update operations and table validation,
755	<	* the exclusive form of lock behaves in the same way as bin-head
756	<	* locks. However, lookups use shared read-lock mechanics to allow
757	<	* multiple readers in the absence of writers.  Additionally,
758	<	* these lookups do not ever block: While the lock is not
759	<	* available, they proceed along the slow traversal path (via
760	<	* next-pointers) until the lock becomes available or the list is
761	<	* exhausted, whichever comes first. (These cases are not fast,
762	<	* but maximize aggregate expected throughput.)  The AQS mechanics
763	<	* for doing this are straightforward.  The lock state is held as
764	<	* AQS getState().  Read counts are negative; the write count (1)
765	<	* is positive.  There are no signalling preferences among readers
766	<	* and writers. Since we don't need to export full Lock API, we
767	<	* just override the minimal AQS methods and use them directly.
768	<	*/
769	<	static final class TreeBin extends AbstractQueuedSynchronizer {
770	<	private static final long serialVersionUID = 2249069246763182397L;
771	<	transient TreeNode root;  // root of tree
772	<	transient TreeNode first; // head of next-pointer list
773	<
774	<	/* AQS overrides */
775	<	public final boolean isHeldExclusively() { return getState() > 0; }
776	<	public final boolean tryAcquire(int ignore) {
777	<	if (compareAndSetState(0, 1)) {
778	<	setExclusiveOwnerThread(Thread.currentThread());
779	<	return true;
780	<	}
781	<	return false;
782	<	}
783	<	public final boolean tryRelease(int ignore) {
784	<	setExclusiveOwnerThread(null);
785	<	setState(0);
786	<	return true;
787	<	}
788	<	public final int tryAcquireShared(int ignore) {
789	<	for (int c;;) {
790	<	if ((c = getState()) > 0)
791	<	return -1;
792	<	if (compareAndSetState(c, c -1))
793	<	return 1;
794	<	}
795	<	}
796	<	public final boolean tryReleaseShared(int ignore) {
797	<	int c;
798	<	do {} while (!compareAndSetState(c = getState(), c + 1));
799	<	return c == -1;
800	<	}
801	<
802	<	/** From CLR */
803	<	private void rotateLeft(TreeNode p) {
804	<	if (p != null) {
805	<	TreeNode r = p.right, pp, rl;
806	<	if ((rl = p.right = r.left) != null)
807	<	rl.parent = p;
808	<	if ((pp = r.parent = p.parent) == null)
809	<	root = r;
810	<	else if (pp.left == p)
811	<	pp.left = r;
812	<	else
813	<	pp.right = r;
814	<	r.left = p;
815	<	p.parent = r;
816	<	}
817	<	}
818	<
819	<	/** From CLR */
820	<	private void rotateRight(TreeNode p) {
821	<	if (p != null) {
822	<	TreeNode l = p.left, pp, lr;
823	<	if ((lr = p.left = l.right) != null)
824	<	lr.parent = p;
825	<	if ((pp = l.parent = p.parent) == null)
826	<	root = l;
827	<	else if (pp.right == p)
828	<	pp.right = l;
829	<	else
830	<	pp.left = l;
831	<	l.right = p;
832	<	p.parent = l;
833	<	}
600	>	public final K getKey()     { return key; }
601	>	public final V getValue()   { return val; }
602	>	public final int hashCode() { return key.hashCode() ^ val.hashCode(); }
603	>	public final String toString() {
604	>	return Helpers.mapEntryToString(key, val);
605		}
606	<
607	<	/**
837	<	* Returns the TreeNode (or null if not found) for the given key
838	<	* starting at given root.
839	<	*/
840	<	@SuppressWarnings("unchecked") final TreeNode getTreeNode
841	<	(int h, Object k, TreeNode p) {
842	<	Class<?> c = k.getClass();
843	<	while (p != null) {
844	<	int dir, ph;  Object pk; Class<?> pc;
845	<	if ((ph = p.hash) == h) {
846	<	if ((pk = p.key) == k || k.equals(pk))
847	<	return p;
848	<	if (c != (pc = pk.getClass()) ||
849	<	!(k instanceof Comparable) ||
850	<	(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
851	<	dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
852	<	TreeNode r = null, s = null, pl, pr;
853	<	if (dir >= 0) {
854	<	if ((pl = p.left) != null && h <= pl.hash)
855	<	s = pl;
856	<	}
857	<	else if ((pr = p.right) != null && h >= pr.hash)
858	<	s = pr;
859	<	if (s != null && (r = getTreeNode(h, k, s)) != null)
860	<	return r;
861	<	}
862	<	}
863	<	else
864	<	dir = (h < ph) ? -1 : 1;
865	<	p = (dir > 0) ? p.right : p.left;
866	<	}
867	<	return null;
606	>	public final V setValue(V value) {
607	>	throw new UnsupportedOperationException();
608		}
609
610	<	/**
611	<	* Wrapper for getTreeNode used by CHM.get. Tries to obtain
612	<	* read-lock to call getTreeNode, but during failure to get
613	<	* lock, searches along next links.
614	<	*/
615	<	final Object getValue(int h, Object k) {
616	<	Node r = null;
877	<	int c = getState(); // Must read lock state first
878	<	for (Node e = first; e != null; e = e.next) {
879	<	if (c <= 0 && compareAndSetState(c, c - 1)) {
880	<	try {
881	<	r = getTreeNode(h, k, root);
882	<	} finally {
883	<	releaseShared(0);
884	<	}
885	<	break;
886	<	}
887	<	else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) {
888	<	r = e;
889	<	break;
890	<	}
891	<	else
892	<	c = getState();
893	<	}
894	<	return r == null ? null : r.val;
610	>	public final boolean equals(Object o) {
611	>	Object k, v, u; Map.Entry<?,?> e;
612	>	return ((o instanceof Map.Entry) &&
613	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
614	>	(v = e.getValue()) != null &&
615	>	(k == key || k.equals(key)) &&
616	>	(v == (u = val) || v.equals(u)));
617		}
618
619		/**
620	<	* Finds or adds a node.
899	<	* @return null if added
620	>	* Virtualized support for map.get(); overridden in subclasses.
621		*/
622	<	@SuppressWarnings("unchecked") final TreeNode putTreeNode
623	<	(int h, Object k, Object v) {
624	<	Class<?> c = k.getClass();
625	<	TreeNode pp = root, p = null;
626	<	int dir = 0;
627	<	while (pp != null) { // find existing node or leaf to insert at
628	<	int ph;  Object pk; Class<?> pc;
629	<	p = pp;
630	<	if ((ph = p.hash) == h) {
910	<	if ((pk = p.key) == k || k.equals(pk))
911	<	return p;
912	<	if (c != (pc = pk.getClass()) ||
913	<	!(k instanceof Comparable) ||
914	<	(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
915	<	dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
916	<	TreeNode r = null, s = null, pl, pr;
917	<	if (dir >= 0) {
918	<	if ((pl = p.left) != null && h <= pl.hash)
919	<	s = pl;
920	<	}
921	<	else if ((pr = p.right) != null && h >= pr.hash)
922	<	s = pr;
923	<	if (s != null && (r = getTreeNode(h, k, s)) != null)
924	<	return r;
925	<	}
926	<	}
927	<	else
928	<	dir = (h < ph) ? -1 : 1;
929	<	pp = (dir > 0) ? p.right : p.left;
930	<	}
931	<
932	<	TreeNode f = first;
933	<	TreeNode x = first = new TreeNode(h, k, v, f, p);
934	<	if (p == null)
935	<	root = x;
936	<	else { // attach and rebalance; adapted from CLR
937	<	TreeNode xp, xpp;
938	<	if (f != null)
939	<	f.prev = x;
940	<	if (dir <= 0)
941	<	p.left = x;
942	<	else
943	<	p.right = x;
944	<	x.red = true;
945	<	while (x != null && (xp = x.parent) != null && xp.red &&
946	<	(xpp = xp.parent) != null) {
947	<	TreeNode xppl = xpp.left;
948	<	if (xp == xppl) {
949	<	TreeNode y = xpp.right;
950	<	if (y != null && y.red) {
951	<	y.red = false;
952	<	xp.red = false;
953	<	xpp.red = true;
954	<	x = xpp;
955	<	}
956	<	else {
957	<	if (x == xp.right) {
958	<	rotateLeft(x = xp);
959	<	xpp = (xp = x.parent) == null ? null : xp.parent;
960	<	}
961	<	if (xp != null) {
962	<	xp.red = false;
963	<	if (xpp != null) {
964	<	xpp.red = true;
965	<	rotateRight(xpp);
966	<	}
967	<	}
968	<	}
969	<	}
970	<	else {
971	<	TreeNode y = xppl;
972	<	if (y != null && y.red) {
973	<	y.red = false;
974	<	xp.red = false;
975	<	xpp.red = true;
976	<	x = xpp;
977	<	}
978	<	else {
979	<	if (x == xp.left) {
980	<	rotateRight(x = xp);
981	<	xpp = (xp = x.parent) == null ? null : xp.parent;
982	<	}
983	<	if (xp != null) {
984	<	xp.red = false;
985	<	if (xpp != null) {
986	<	xpp.red = true;
987	<	rotateLeft(xpp);
988	<	}
989	<	}
990	<	}
991	<	}
992	<	}
993	<	TreeNode r = root;
994	<	if (r != null && r.red)
995	<	r.red = false;
622	>	Node<K,V> find(int h, Object k) {
623	>	Node<K,V> e = this;
624	>	if (k != null) {
625	>	do {
626	>	K ek;
627	>	if (e.hash == h &&
628	>	((ek = e.key) == k || (ek != null && k.equals(ek))))
629	>	return e;
630	>	} while ((e = e.next) != null);
631		}
632		return null;
633		}
999	–
1000	–	/**
1001	–	* Removes the given node, that must be present before this
1002	–	* call.  This is messier than typical red-black deletion code
1003	–	* because we cannot swap the contents of an interior node
1004	–	* with a leaf successor that is pinned by "next" pointers
1005	–	* that are accessible independently of lock. So instead we
1006	–	* swap the tree linkages.
1007	–	*/
1008	–	final void deleteTreeNode(TreeNode p) {
1009	–	TreeNode next = (TreeNode)p.next; // unlink traversal pointers
1010	–	TreeNode pred = p.prev;
1011	–	if (pred == null)
1012	–	first = next;
1013	–	else
1014	–	pred.next = next;
1015	–	if (next != null)
1016	–	next.prev = pred;
1017	–	TreeNode replacement;
1018	–	TreeNode pl = p.left;
1019	–	TreeNode pr = p.right;
1020	–	if (pl != null && pr != null) {
1021	–	TreeNode s = pr, sl;
1022	–	while ((sl = s.left) != null) // find successor
1023	–	s = sl;
1024	–	boolean c = s.red; s.red = p.red; p.red = c; // swap colors
1025	–	TreeNode sr = s.right;
1026	–	TreeNode pp = p.parent;
1027	–	if (s == pr) { // p was s's direct parent
1028	–	p.parent = s;
1029	–	s.right = p;
1030	–	}
1031	–	else {
1032	–	TreeNode sp = s.parent;
1033	–	if ((p.parent = sp) != null) {
1034	–	if (s == sp.left)
1035	–	sp.left = p;
1036	–	else
1037	–	sp.right = p;
1038	–	}
1039	–	if ((s.right = pr) != null)
1040	–	pr.parent = s;
1041	–	}
1042	–	p.left = null;
1043	–	if ((p.right = sr) != null)
1044	–	sr.parent = p;
1045	–	if ((s.left = pl) != null)
1046	–	pl.parent = s;
1047	–	if ((s.parent = pp) == null)
1048	–	root = s;
1049	–	else if (p == pp.left)
1050	–	pp.left = s;
1051	–	else
1052	–	pp.right = s;
1053	–	replacement = sr;
1054	–	}
1055	–	else
1056	–	replacement = (pl != null) ? pl : pr;
1057	–	TreeNode pp = p.parent;
1058	–	if (replacement == null) {
1059	–	if (pp == null) {
1060	–	root = null;
1061	–	return;
1062	–	}
1063	–	replacement = p;
1064	–	}
1065	–	else {
1066	–	replacement.parent = pp;
1067	–	if (pp == null)
1068	–	root = replacement;
1069	–	else if (p == pp.left)
1070	–	pp.left = replacement;
1071	–	else
1072	–	pp.right = replacement;
1073	–	p.left = p.right = p.parent = null;
1074	–	}
1075	–	if (!p.red) { // rebalance, from CLR
1076	–	TreeNode x = replacement;
1077	–	while (x != null) {
1078	–	TreeNode xp, xpl;
1079	–	if (x.red || (xp = x.parent) == null) {
1080	–	x.red = false;
1081	–	break;
1082	–	}
1083	–	if (x == (xpl = xp.left)) {
1084	–	TreeNode sib = xp.right;
1085	–	if (sib != null && sib.red) {
1086	–	sib.red = false;
1087	–	xp.red = true;
1088	–	rotateLeft(xp);
1089	–	sib = (xp = x.parent) == null ? null : xp.right;
1090	–	}
1091	–	if (sib == null)
1092	–	x = xp;
1093	–	else {
1094	–	TreeNode sl = sib.left, sr = sib.right;
1095	–	if ((sr == null || !sr.red) &&
1096	–	(sl == null || !sl.red)) {
1097	–	sib.red = true;
1098	–	x = xp;
1099	–	}
1100	–	else {
1101	–	if (sr == null || !sr.red) {
1102	–	if (sl != null)
1103	–	sl.red = false;
1104	–	sib.red = true;
1105	–	rotateRight(sib);
1106	–	sib = (xp = x.parent) == null ? null : xp.right;
1107	–	}
1108	–	if (sib != null) {
1109	–	sib.red = (xp == null) ? false : xp.red;
1110	–	if ((sr = sib.right) != null)
1111	–	sr.red = false;
1112	–	}
1113	–	if (xp != null) {
1114	–	xp.red = false;
1115	–	rotateLeft(xp);
1116	–	}
1117	–	x = root;
1118	–	}
1119	–	}
1120	–	}
1121	–	else { // symmetric
1122	–	TreeNode sib = xpl;
1123	–	if (sib != null && sib.red) {
1124	–	sib.red = false;
1125	–	xp.red = true;
1126	–	rotateRight(xp);
1127	–	sib = (xp = x.parent) == null ? null : xp.left;
1128	–	}
1129	–	if (sib == null)
1130	–	x = xp;
1131	–	else {
1132	–	TreeNode sl = sib.left, sr = sib.right;
1133	–	if ((sl == null || !sl.red) &&
1134	–	(sr == null || !sr.red)) {
1135	–	sib.red = true;
1136	–	x = xp;
1137	–	}
1138	–	else {
1139	–	if (sl == null || !sl.red) {
1140	–	if (sr != null)
1141	–	sr.red = false;
1142	–	sib.red = true;
1143	–	rotateLeft(sib);
1144	–	sib = (xp = x.parent) == null ? null : xp.left;
1145	–	}
1146	–	if (sib != null) {
1147	–	sib.red = (xp == null) ? false : xp.red;
1148	–	if ((sl = sib.left) != null)
1149	–	sl.red = false;
1150	–	}
1151	–	if (xp != null) {
1152	–	xp.red = false;
1153	–	rotateRight(xp);
1154	–	}
1155	–	x = root;
1156	–	}
1157	–	}
1158	–	}
1159	–	}
1160	–	}
1161	–	if (p == replacement && (pp = p.parent) != null) {
1162	–	if (p == pp.left) // detach pointers
1163	–	pp.left = null;
1164	–	else if (p == pp.right)
1165	–	pp.right = null;
1166	–	p.parent = null;
1167	–	}
1168	–	}
634		}
635
636	<	/* ---------------- Collision reduction methods -------------- */
636	>	/* ---------------- Static utilities -------------- */
637
638		/**
639	<	* Spreads higher bits to lower, and also forces top 2 bits to 0.
640	<	* Because the table uses power-of-two masking, sets of hashes
641	<	* that vary only in bits above the current mask will always
642	<	* collide. (Among known examples are sets of Float keys holding
643	<	* consecutive whole numbers in small tables.)  To counter this,
644	<	* we apply a transform that spreads the impact of higher bits
639	>	* Spreads (XORs) higher bits of hash to lower and also forces top
640	>	* bit to 0. Because the table uses power-of-two masking, sets of
641	>	* hashes that vary only in bits above the current mask will
642	>	* always collide. (Among known examples are sets of Float keys
643	>	* holding consecutive whole numbers in small tables.)  So we
644	>	* apply a transform that spreads the impact of higher bits
645		* downward. There is a tradeoff between speed, utility, and
646		* quality of bit-spreading. Because many common sets of hashes
647	<	* are already reasonably distributed across bits (so don't benefit
648	<	* from spreading), and because we use trees to handle large sets
649	<	* of collisions in bins, we don't need excessively high quality.
650	<	*/
651	<	private static final int spread(int h) {
652	<	h ^= (h >>> 18) ^ (h >>> 12);
1188	<	return (h ^ (h >>> 10)) & HASH_BITS;
1189	<	}
1190	<
1191	<	/**
1192	<	* Replaces a list bin with a tree bin. Call only when locked.
1193	<	* Fails to replace if the given key is non-comparable or table
1194	<	* is, or needs, resizing.
647	>	* are already reasonably distributed (so don't benefit from
648	>	* spreading), and because we use trees to handle large sets of
649	>	* collisions in bins, we just XOR some shifted bits in the
650	>	* cheapest possible way to reduce systematic lossage, as well as
651	>	* to incorporate impact of the highest bits that would otherwise
652	>	* never be used in index calculations because of table bounds.
653		*/
654	<	private final void replaceWithTreeBin(Node[] tab, int index, Object key) {
655	<	if ((key instanceof Comparable) &&
1198	<	(tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) {
1199	<	TreeBin t = new TreeBin();
1200	<	for (Node e = tabAt(tab, index); e != null; e = e.next)
1201	<	t.putTreeNode(e.hash & HASH_BITS, e.key, e.val);
1202	<	setTabAt(tab, index, new Node(MOVED, t, null, null));
1203	<	}
1204	<	}
1205	<
1206	<	/* ---------------- Internal access and update methods -------------- */
1207	<
1208	<	/** Implementation for get and containsKey */
1209	<	private final Object internalGet(Object k) {
1210	<	int h = spread(k.hashCode());
1211	<	retry: for (Node[] tab = table; tab != null;) {
1212	<	Node e, p; Object ek, ev; int eh;      // locals to read fields once
1213	<	for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) {
1214	<	if ((eh = e.hash) == MOVED) {
1215	<	if ((ek = e.key) instanceof TreeBin)  // search TreeBin
1216	<	return ((TreeBin)ek).getValue(h, k);
1217	<	else {                        // restart with new table
1218	<	tab = (Node[])ek;
1219	<	continue retry;
1220	<	}
1221	<	}
1222	<	else if ((eh & HASH_BITS) == h && (ev = e.val) != null &&
1223	<	((ek = e.key) == k || k.equals(ek)))
1224	<	return ev;
1225	<	}
1226	<	break;
1227	<	}
1228	<	return null;
654	>	static final int spread(int h) {
655	>	return (h ^ (h >>> 16)) & HASH_BITS;
656		}
657
658		/**
1232	–	* Implementation for the four public remove/replace methods:
1233	–	* Replaces node value with v, conditional upon match of cv if
1234	–	* non-null.  If resulting value is null, delete.
1235	–	*/
1236	–	private final Object internalReplace(Object k, Object v, Object cv) {
1237	–	int h = spread(k.hashCode());
1238	–	Object oldVal = null;
1239	–	for (Node[] tab = table;;) {
1240	–	Node f; int i, fh; Object fk;
1241	–	if (tab == null ||
1242	–	(f = tabAt(tab, i = (tab.length - 1) & h)) == null)
1243	–	break;
1244	–	else if ((fh = f.hash) == MOVED) {
1245	–	if ((fk = f.key) instanceof TreeBin) {
1246	–	TreeBin t = (TreeBin)fk;
1247	–	boolean validated = false;
1248	–	boolean deleted = false;
1249	–	t.acquire(0);
1250	–	try {
1251	–	if (tabAt(tab, i) == f) {
1252	–	validated = true;
1253	–	TreeNode p = t.getTreeNode(h, k, t.root);
1254	–	if (p != null) {
1255	–	Object pv = p.val;
1256	–	if (cv == null || cv == pv || cv.equals(pv)) {
1257	–	oldVal = pv;
1258	–	if ((p.val = v) == null) {
1259	–	deleted = true;
1260	–	t.deleteTreeNode(p);
1261	–	}
1262	–	}
1263	–	}
1264	–	}
1265	–	} finally {
1266	–	t.release(0);
1267	–	}
1268	–	if (validated) {
1269	–	if (deleted)
1270	–	counter.add(-1L);
1271	–	break;
1272	–	}
1273	–	}
1274	–	else
1275	–	tab = (Node[])fk;
1276	–	}
1277	–	else if ((fh & HASH_BITS) != h && f.next == null) // precheck
1278	–	break;                          // rules out possible existence
1279	–	else if ((fh & LOCKED) != 0) {
1280	–	checkForResize();               // try resizing if can't get lock
1281	–	f.tryAwaitLock(tab, i);
1282	–	}
1283	–	else if (f.casHash(fh, fh | LOCKED)) {
1284	–	boolean validated = false;
1285	–	boolean deleted = false;
1286	–	try {
1287	–	if (tabAt(tab, i) == f) {
1288	–	validated = true;
1289	–	for (Node e = f, pred = null;;) {
1290	–	Object ek, ev;
1291	–	if ((e.hash & HASH_BITS) == h &&
1292	–	((ev = e.val) != null) &&
1293	–	((ek = e.key) == k || k.equals(ek))) {
1294	–	if (cv == null || cv == ev || cv.equals(ev)) {
1295	–	oldVal = ev;
1296	–	if ((e.val = v) == null) {
1297	–	deleted = true;
1298	–	Node en = e.next;
1299	–	if (pred != null)
1300	–	pred.next = en;
1301	–	else
1302	–	setTabAt(tab, i, en);
1303	–	}
1304	–	}
1305	–	break;
1306	–	}
1307	–	pred = e;
1308	–	if ((e = e.next) == null)
1309	–	break;
1310	–	}
1311	–	}
1312	–	} finally {
1313	–	if (!f.casHash(fh | LOCKED, fh)) {
1314	–	f.hash = fh;
1315	–	synchronized (f) { f.notifyAll(); };
1316	–	}
1317	–	}
1318	–	if (validated) {
1319	–	if (deleted)
1320	–	counter.add(-1L);
1321	–	break;
1322	–	}
1323	–	}
1324	–	}
1325	–	return oldVal;
1326	–	}
1327	–
1328	–	/*
1329	–	* Internal versions of the six insertion methods, each a
1330	–	* little more complicated than the last. All have
1331	–	* the same basic structure as the first (internalPut):
1332	–	*  1. If table uninitialized, create
1333	–	*  2. If bin empty, try to CAS new node
1334	–	*  3. If bin stale, use new table
1335	–	*  4. if bin converted to TreeBin, validate and relay to TreeBin methods
1336	–	*  5. Lock and validate; if valid, scan and add or update
1337	–	*
1338	–	* The others interweave other checks and/or alternative actions:
1339	–	*  * Plain put checks for and performs resize after insertion.
1340	–	*  * putIfAbsent prescans for mapping without lock (and fails to add
1341	–	*    if present), which also makes pre-emptive resize checks worthwhile.
1342	–	*  * computeIfAbsent extends form used in putIfAbsent with additional
1343	–	*    mechanics to deal with, calls, potential exceptions and null
1344	–	*    returns from function call.
1345	–	*  * compute uses the same function-call mechanics, but without
1346	–	*    the prescans
1347	–	*  * merge acts as putIfAbsent in the absent case, but invokes the
1348	–	*    update function if present
1349	–	*  * putAll attempts to pre-allocate enough table space
1350	–	*    and more lazily performs count updates and checks.
1351	–	*
1352	–	* Someday when details settle down a bit more, it might be worth
1353	–	* some factoring to reduce sprawl.
1354	–	*/
1355	–
1356	–	/** Implementation for put */
1357	–	private final Object internalPut(Object k, Object v) {
1358	–	int h = spread(k.hashCode());
1359	–	int count = 0;
1360	–	for (Node[] tab = table;;) {
1361	–	int i; Node f; int fh; Object fk;
1362	–	if (tab == null)
1363	–	tab = initTable();
1364	–	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1365	–	if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1366	–	break;                   // no lock when adding to empty bin
1367	–	}
1368	–	else if ((fh = f.hash) == MOVED) {
1369	–	if ((fk = f.key) instanceof TreeBin) {
1370	–	TreeBin t = (TreeBin)fk;
1371	–	Object oldVal = null;
1372	–	t.acquire(0);
1373	–	try {
1374	–	if (tabAt(tab, i) == f) {
1375	–	count = 2;
1376	–	TreeNode p = t.putTreeNode(h, k, v);
1377	–	if (p != null) {
1378	–	oldVal = p.val;
1379	–	p.val = v;
1380	–	}
1381	–	}
1382	–	} finally {
1383	–	t.release(0);
1384	–	}
1385	–	if (count != 0) {
1386	–	if (oldVal != null)
1387	–	return oldVal;
1388	–	break;
1389	–	}
1390	–	}
1391	–	else
1392	–	tab = (Node[])fk;
1393	–	}
1394	–	else if ((fh & LOCKED) != 0) {
1395	–	checkForResize();
1396	–	f.tryAwaitLock(tab, i);
1397	–	}
1398	–	else if (f.casHash(fh, fh | LOCKED)) {
1399	–	Object oldVal = null;
1400	–	try {                        // needed in case equals() throws
1401	–	if (tabAt(tab, i) == f) {
1402	–	count = 1;
1403	–	for (Node e = f;; ++count) {
1404	–	Object ek, ev;
1405	–	if ((e.hash & HASH_BITS) == h &&
1406	–	(ev = e.val) != null &&
1407	–	((ek = e.key) == k || k.equals(ek))) {
1408	–	oldVal = ev;
1409	–	e.val = v;
1410	–	break;
1411	–	}
1412	–	Node last = e;
1413	–	if ((e = e.next) == null) {
1414	–	last.next = new Node(h, k, v, null);
1415	–	if (count >= TREE_THRESHOLD)
1416	–	replaceWithTreeBin(tab, i, k);
1417	–	break;
1418	–	}
1419	–	}
1420	–	}
1421	–	} finally {                  // unlock and signal if needed
1422	–	if (!f.casHash(fh | LOCKED, fh)) {
1423	–	f.hash = fh;
1424	–	synchronized (f) { f.notifyAll(); };
1425	–	}
1426	–	}
1427	–	if (count != 0) {
1428	–	if (oldVal != null)
1429	–	return oldVal;
1430	–	if (tab.length <= 64)
1431	–	count = 2;
1432	–	break;
1433	–	}
1434	–	}
1435	–	}
1436	–	counter.add(1L);
1437	–	if (count > 1)
1438	–	checkForResize();
1439	–	return null;
1440	–	}
1441	–
1442	–	/** Implementation for putIfAbsent */
1443	–	private final Object internalPutIfAbsent(Object k, Object v) {
1444	–	int h = spread(k.hashCode());
1445	–	int count = 0;
1446	–	for (Node[] tab = table;;) {
1447	–	int i; Node f; int fh; Object fk, fv;
1448	–	if (tab == null)
1449	–	tab = initTable();
1450	–	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1451	–	if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1452	–	break;
1453	–	}
1454	–	else if ((fh = f.hash) == MOVED) {
1455	–	if ((fk = f.key) instanceof TreeBin) {
1456	–	TreeBin t = (TreeBin)fk;
1457	–	Object oldVal = null;
1458	–	t.acquire(0);
1459	–	try {
1460	–	if (tabAt(tab, i) == f) {
1461	–	count = 2;
1462	–	TreeNode p = t.putTreeNode(h, k, v);
1463	–	if (p != null)
1464	–	oldVal = p.val;
1465	–	}
1466	–	} finally {
1467	–	t.release(0);
1468	–	}
1469	–	if (count != 0) {
1470	–	if (oldVal != null)
1471	–	return oldVal;
1472	–	break;
1473	–	}
1474	–	}
1475	–	else
1476	–	tab = (Node[])fk;
1477	–	}
1478	–	else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1479	–	((fk = f.key) == k || k.equals(fk)))
1480	–	return fv;
1481	–	else {
1482	–	Node g = f.next;
1483	–	if (g != null) { // at least 2 nodes -- search and maybe resize
1484	–	for (Node e = g;;) {
1485	–	Object ek, ev;
1486	–	if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1487	–	((ek = e.key) == k || k.equals(ek)))
1488	–	return ev;
1489	–	if ((e = e.next) == null) {
1490	–	checkForResize();
1491	–	break;
1492	–	}
1493	–	}
1494	–	}
1495	–	if (((fh = f.hash) & LOCKED) != 0) {
1496	–	checkForResize();
1497	–	f.tryAwaitLock(tab, i);
1498	–	}
1499	–	else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1500	–	Object oldVal = null;
1501	–	try {
1502	–	if (tabAt(tab, i) == f) {
1503	–	count = 1;
1504	–	for (Node e = f;; ++count) {
1505	–	Object ek, ev;
1506	–	if ((e.hash & HASH_BITS) == h &&
1507	–	(ev = e.val) != null &&
1508	–	((ek = e.key) == k || k.equals(ek))) {
1509	–	oldVal = ev;
1510	–	break;
1511	–	}
1512	–	Node last = e;
1513	–	if ((e = e.next) == null) {
1514	–	last.next = new Node(h, k, v, null);
1515	–	if (count >= TREE_THRESHOLD)
1516	–	replaceWithTreeBin(tab, i, k);
1517	–	break;
1518	–	}
1519	–	}
1520	–	}
1521	–	} finally {
1522	–	if (!f.casHash(fh | LOCKED, fh)) {
1523	–	f.hash = fh;
1524	–	synchronized (f) { f.notifyAll(); };
1525	–	}
1526	–	}
1527	–	if (count != 0) {
1528	–	if (oldVal != null)
1529	–	return oldVal;
1530	–	if (tab.length <= 64)
1531	–	count = 2;
1532	–	break;
1533	–	}
1534	–	}
1535	–	}
1536	–	}
1537	–	counter.add(1L);
1538	–	if (count > 1)
1539	–	checkForResize();
1540	–	return null;
1541	–	}
1542	–
1543	–	/** Implementation for computeIfAbsent */
1544	–	private final Object internalComputeIfAbsent(K k,
1545	–	Fun<? super K, ?> mf) {
1546	–	int h = spread(k.hashCode());
1547	–	Object val = null;
1548	–	int count = 0;
1549	–	for (Node[] tab = table;;) {
1550	–	Node f; int i, fh; Object fk, fv;
1551	–	if (tab == null)
1552	–	tab = initTable();
1553	–	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1554	–	Node node = new Node(fh = h | LOCKED, k, null, null);
1555	–	if (casTabAt(tab, i, null, node)) {
1556	–	count = 1;
1557	–	try {
1558	–	if ((val = mf.apply(k)) != null)
1559	–	node.val = val;
1560	–	} finally {
1561	–	if (val == null)
1562	–	setTabAt(tab, i, null);
1563	–	if (!node.casHash(fh, h)) {
1564	–	node.hash = h;
1565	–	synchronized (node) { node.notifyAll(); };
1566	–	}
1567	–	}
1568	–	}
1569	–	if (count != 0)
1570	–	break;
1571	–	}
1572	–	else if ((fh = f.hash) == MOVED) {
1573	–	if ((fk = f.key) instanceof TreeBin) {
1574	–	TreeBin t = (TreeBin)fk;
1575	–	boolean added = false;
1576	–	t.acquire(0);
1577	–	try {
1578	–	if (tabAt(tab, i) == f) {
1579	–	count = 1;
1580	–	TreeNode p = t.getTreeNode(h, k, t.root);
1581	–	if (p != null)
1582	–	val = p.val;
1583	–	else if ((val = mf.apply(k)) != null) {
1584	–	added = true;
1585	–	count = 2;
1586	–	t.putTreeNode(h, k, val);
1587	–	}
1588	–	}
1589	–	} finally {
1590	–	t.release(0);
1591	–	}
1592	–	if (count != 0) {
1593	–	if (!added)
1594	–	return val;
1595	–	break;
1596	–	}
1597	–	}
1598	–	else
1599	–	tab = (Node[])fk;
1600	–	}
1601	–	else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1602	–	((fk = f.key) == k || k.equals(fk)))
1603	–	return fv;
1604	–	else {
1605	–	Node g = f.next;
1606	–	if (g != null) {
1607	–	for (Node e = g;;) {
1608	–	Object ek, ev;
1609	–	if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1610	–	((ek = e.key) == k || k.equals(ek)))
1611	–	return ev;
1612	–	if ((e = e.next) == null) {
1613	–	checkForResize();
1614	–	break;
1615	–	}
1616	–	}
1617	–	}
1618	–	if (((fh = f.hash) & LOCKED) != 0) {
1619	–	checkForResize();
1620	–	f.tryAwaitLock(tab, i);
1621	–	}
1622	–	else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1623	–	boolean added = false;
1624	–	try {
1625	–	if (tabAt(tab, i) == f) {
1626	–	count = 1;
1627	–	for (Node e = f;; ++count) {
1628	–	Object ek, ev;
1629	–	if ((e.hash & HASH_BITS) == h &&
1630	–	(ev = e.val) != null &&
1631	–	((ek = e.key) == k || k.equals(ek))) {
1632	–	val = ev;
1633	–	break;
1634	–	}
1635	–	Node last = e;
1636	–	if ((e = e.next) == null) {
1637	–	if ((val = mf.apply(k)) != null) {
1638	–	added = true;
1639	–	last.next = new Node(h, k, val, null);
1640	–	if (count >= TREE_THRESHOLD)
1641	–	replaceWithTreeBin(tab, i, k);
1642	–	}
1643	–	break;
1644	–	}
1645	–	}
1646	–	}
1647	–	} finally {
1648	–	if (!f.casHash(fh | LOCKED, fh)) {
1649	–	f.hash = fh;
1650	–	synchronized (f) { f.notifyAll(); };
1651	–	}
1652	–	}
1653	–	if (count != 0) {
1654	–	if (!added)
1655	–	return val;
1656	–	if (tab.length <= 64)
1657	–	count = 2;
1658	–	break;
1659	–	}
1660	–	}
1661	–	}
1662	–	}
1663	–	if (val != null) {
1664	–	counter.add(1L);
1665	–	if (count > 1)
1666	–	checkForResize();
1667	–	}
1668	–	return val;
1669	–	}
1670	–
1671	–	/** Implementation for compute */
1672	–	@SuppressWarnings("unchecked") private final Object internalCompute
1673	–	(K k, boolean onlyIfPresent, BiFun<? super K, ? super V, ? extends V> mf) {
1674	–	int h = spread(k.hashCode());
1675	–	Object val = null;
1676	–	int delta = 0;
1677	–	int count = 0;
1678	–	for (Node[] tab = table;;) {
1679	–	Node f; int i, fh; Object fk;
1680	–	if (tab == null)
1681	–	tab = initTable();
1682	–	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1683	–	if (onlyIfPresent)
1684	–	break;
1685	–	Node node = new Node(fh = h | LOCKED, k, null, null);
1686	–	if (casTabAt(tab, i, null, node)) {
1687	–	try {
1688	–	count = 1;
1689	–	if ((val = mf.apply(k, null)) != null) {
1690	–	node.val = val;
1691	–	delta = 1;
1692	–	}
1693	–	} finally {
1694	–	if (delta == 0)
1695	–	setTabAt(tab, i, null);
1696	–	if (!node.casHash(fh, h)) {
1697	–	node.hash = h;
1698	–	synchronized (node) { node.notifyAll(); };
1699	–	}
1700	–	}
1701	–	}
1702	–	if (count != 0)
1703	–	break;
1704	–	}
1705	–	else if ((fh = f.hash) == MOVED) {
1706	–	if ((fk = f.key) instanceof TreeBin) {
1707	–	TreeBin t = (TreeBin)fk;
1708	–	t.acquire(0);
1709	–	try {
1710	–	if (tabAt(tab, i) == f) {
1711	–	count = 1;
1712	–	TreeNode p = t.getTreeNode(h, k, t.root);
1713	–	Object pv = (p == null) ? null : p.val;
1714	–	if ((val = mf.apply(k, (V)pv)) != null) {
1715	–	if (p != null)
1716	–	p.val = val;
1717	–	else {
1718	–	count = 2;
1719	–	delta = 1;
1720	–	t.putTreeNode(h, k, val);
1721	–	}
1722	–	}
1723	–	else if (p != null) {
1724	–	delta = -1;
1725	–	t.deleteTreeNode(p);
1726	–	}
1727	–	}
1728	–	} finally {
1729	–	t.release(0);
1730	–	}
1731	–	if (count != 0)
1732	–	break;
1733	–	}
1734	–	else
1735	–	tab = (Node[])fk;
1736	–	}
1737	–	else if ((fh & LOCKED) != 0) {
1738	–	checkForResize();
1739	–	f.tryAwaitLock(tab, i);
1740	–	}
1741	–	else if (f.casHash(fh, fh | LOCKED)) {
1742	–	try {
1743	–	if (tabAt(tab, i) == f) {
1744	–	count = 1;
1745	–	for (Node e = f, pred = null;; ++count) {
1746	–	Object ek, ev;
1747	–	if ((e.hash & HASH_BITS) == h &&
1748	–	(ev = e.val) != null &&
1749	–	((ek = e.key) == k || k.equals(ek))) {
1750	–	val = mf.apply(k, (V)ev);
1751	–	if (val != null)
1752	–	e.val = val;
1753	–	else {
1754	–	delta = -1;
1755	–	Node en = e.next;
1756	–	if (pred != null)
1757	–	pred.next = en;
1758	–	else
1759	–	setTabAt(tab, i, en);
1760	–	}
1761	–	break;
1762	–	}
1763	–	pred = e;
1764	–	if ((e = e.next) == null) {
1765	–	if (!onlyIfPresent && (val = mf.apply(k, null)) != null) {
1766	–	pred.next = new Node(h, k, val, null);
1767	–	delta = 1;
1768	–	if (count >= TREE_THRESHOLD)
1769	–	replaceWithTreeBin(tab, i, k);
1770	–	}
1771	–	break;
1772	–	}
1773	–	}
1774	–	}
1775	–	} finally {
1776	–	if (!f.casHash(fh | LOCKED, fh)) {
1777	–	f.hash = fh;
1778	–	synchronized (f) { f.notifyAll(); };
1779	–	}
1780	–	}
1781	–	if (count != 0) {
1782	–	if (tab.length <= 64)
1783	–	count = 2;
1784	–	break;
1785	–	}
1786	–	}
1787	–	}
1788	–	if (delta != 0) {
1789	–	counter.add((long)delta);
1790	–	if (count > 1)
1791	–	checkForResize();
1792	–	}
1793	–	return val;
1794	–	}
1795	–
1796	–	/** Implementation for merge */
1797	–	@SuppressWarnings("unchecked") private final Object internalMerge
1798	–	(K k, V v, BiFun<? super V, ? super V, ? extends V> mf) {
1799	–	int h = spread(k.hashCode());
1800	–	Object val = null;
1801	–	int delta = 0;
1802	–	int count = 0;
1803	–	for (Node[] tab = table;;) {
1804	–	int i; Node f; int fh; Object fk, fv;
1805	–	if (tab == null)
1806	–	tab = initTable();
1807	–	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1808	–	if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
1809	–	delta = 1;
1810	–	val = v;
1811	–	break;
1812	–	}
1813	–	}
1814	–	else if ((fh = f.hash) == MOVED) {
1815	–	if ((fk = f.key) instanceof TreeBin) {
1816	–	TreeBin t = (TreeBin)fk;
1817	–	t.acquire(0);
1818	–	try {
1819	–	if (tabAt(tab, i) == f) {
1820	–	count = 1;
1821	–	TreeNode p = t.getTreeNode(h, k, t.root);
1822	–	val = (p == null) ? v : mf.apply((V)p.val, v);
1823	–	if (val != null) {
1824	–	if (p != null)
1825	–	p.val = val;
1826	–	else {
1827	–	count = 2;
1828	–	delta = 1;
1829	–	t.putTreeNode(h, k, val);
1830	–	}
1831	–	}
1832	–	else if (p != null) {
1833	–	delta = -1;
1834	–	t.deleteTreeNode(p);
1835	–	}
1836	–	}
1837	–	} finally {
1838	–	t.release(0);
1839	–	}
1840	–	if (count != 0)
1841	–	break;
1842	–	}
1843	–	else
1844	–	tab = (Node[])fk;
1845	–	}
1846	–	else if ((fh & LOCKED) != 0) {
1847	–	checkForResize();
1848	–	f.tryAwaitLock(tab, i);
1849	–	}
1850	–	else if (f.casHash(fh, fh | LOCKED)) {
1851	–	try {
1852	–	if (tabAt(tab, i) == f) {
1853	–	count = 1;
1854	–	for (Node e = f, pred = null;; ++count) {
1855	–	Object ek, ev;
1856	–	if ((e.hash & HASH_BITS) == h &&
1857	–	(ev = e.val) != null &&
1858	–	((ek = e.key) == k || k.equals(ek))) {
1859	–	val = mf.apply(v, (V)ev);
1860	–	if (val != null)
1861	–	e.val = val;
1862	–	else {
1863	–	delta = -1;
1864	–	Node en = e.next;
1865	–	if (pred != null)
1866	–	pred.next = en;
1867	–	else
1868	–	setTabAt(tab, i, en);
1869	–	}
1870	–	break;
1871	–	}
1872	–	pred = e;
1873	–	if ((e = e.next) == null) {
1874	–	val = v;
1875	–	pred.next = new Node(h, k, val, null);
1876	–	delta = 1;
1877	–	if (count >= TREE_THRESHOLD)
1878	–	replaceWithTreeBin(tab, i, k);
1879	–	break;
1880	–	}
1881	–	}
1882	–	}
1883	–	} finally {
1884	–	if (!f.casHash(fh | LOCKED, fh)) {
1885	–	f.hash = fh;
1886	–	synchronized (f) { f.notifyAll(); };
1887	–	}
1888	–	}
1889	–	if (count != 0) {
1890	–	if (tab.length <= 64)
1891	–	count = 2;
1892	–	break;
1893	–	}
1894	–	}
1895	–	}
1896	–	if (delta != 0) {
1897	–	counter.add((long)delta);
1898	–	if (count > 1)
1899	–	checkForResize();
1900	–	}
1901	–	return val;
1902	–	}
1903	–
1904	–	/** Implementation for putAll */
1905	–	private final void internalPutAll(Map<?, ?> m) {
1906	–	tryPresize(m.size());
1907	–	long delta = 0L;     // number of uncommitted additions
1908	–	boolean npe = false; // to throw exception on exit for nulls
1909	–	try {                // to clean up counts on other exceptions
1910	–	for (Map.Entry<?, ?> entry : m.entrySet()) {
1911	–	Object k, v;
1912	–	if (entry == null || (k = entry.getKey()) == null ||
1913	–	(v = entry.getValue()) == null) {
1914	–	npe = true;
1915	–	break;
1916	–	}
1917	–	int h = spread(k.hashCode());
1918	–	for (Node[] tab = table;;) {
1919	–	int i; Node f; int fh; Object fk;
1920	–	if (tab == null)
1921	–	tab = initTable();
1922	–	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){
1923	–	if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
1924	–	++delta;
1925	–	break;
1926	–	}
1927	–	}
1928	–	else if ((fh = f.hash) == MOVED) {
1929	–	if ((fk = f.key) instanceof TreeBin) {
1930	–	TreeBin t = (TreeBin)fk;
1931	–	boolean validated = false;
1932	–	t.acquire(0);
1933	–	try {
1934	–	if (tabAt(tab, i) == f) {
1935	–	validated = true;
1936	–	TreeNode p = t.getTreeNode(h, k, t.root);
1937	–	if (p != null)
1938	–	p.val = v;
1939	–	else {
1940	–	t.putTreeNode(h, k, v);
1941	–	++delta;
1942	–	}
1943	–	}
1944	–	} finally {
1945	–	t.release(0);
1946	–	}
1947	–	if (validated)
1948	–	break;
1949	–	}
1950	–	else
1951	–	tab = (Node[])fk;
1952	–	}
1953	–	else if ((fh & LOCKED) != 0) {
1954	–	counter.add(delta);
1955	–	delta = 0L;
1956	–	checkForResize();
1957	–	f.tryAwaitLock(tab, i);
1958	–	}
1959	–	else if (f.casHash(fh, fh | LOCKED)) {
1960	–	int count = 0;
1961	–	try {
1962	–	if (tabAt(tab, i) == f) {
1963	–	count = 1;
1964	–	for (Node e = f;; ++count) {
1965	–	Object ek, ev;
1966	–	if ((e.hash & HASH_BITS) == h &&
1967	–	(ev = e.val) != null &&
1968	–	((ek = e.key) == k || k.equals(ek))) {
1969	–	e.val = v;
1970	–	break;
1971	–	}
1972	–	Node last = e;
1973	–	if ((e = e.next) == null) {
1974	–	++delta;
1975	–	last.next = new Node(h, k, v, null);
1976	–	if (count >= TREE_THRESHOLD)
1977	–	replaceWithTreeBin(tab, i, k);
1978	–	break;
1979	–	}
1980	–	}
1981	–	}
1982	–	} finally {
1983	–	if (!f.casHash(fh | LOCKED, fh)) {
1984	–	f.hash = fh;
1985	–	synchronized (f) { f.notifyAll(); };
1986	–	}
1987	–	}
1988	–	if (count != 0) {
1989	–	if (count > 1) {
1990	–	counter.add(delta);
1991	–	delta = 0L;
1992	–	checkForResize();
1993	–	}
1994	–	break;
1995	–	}
1996	–	}
1997	–	}
1998	–	}
1999	–	} finally {
2000	–	if (delta != 0)
2001	–	counter.add(delta);
2002	–	}
2003	–	if (npe)
2004	–	throw new NullPointerException();
2005	–	}
2006	–
2007	–	/* ---------------- Table Initialization and Resizing -------------- */
2008	–
2009	–	/**
659		* Returns a power of two table size for the given desired capacity.
660		* See Hackers Delight, sec 3.2
661		*/
#	Line 2021 | Line 670 | public class ConcurrentHashMap<K, V>
670		}
671
672		/**
673	<	* Initializes table, using the size recorded in sizeCtl.
673	>	* Returns x's Class if it is of the form "class C implements
674	>	* Comparable<C>", else null.
675		*/
676	<	private final Node[] initTable() {
677	<	Node[] tab; int sc;
678	<	while ((tab = table) == null) {
679	<	if ((sc = sizeCtl) < 0)
680	<	Thread.yield(); // lost initialization race; just spin
681	<	else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
682	<	try {
683	<	if ((tab = table) == null) {
684	<	int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
685	<	tab = table = new Node[n];
686	<	sc = n - (n >>> 2);
687	<	}
688	<	} finally {
2039	<	sizeCtl = sc;
676	>	static Class<?> comparableClassFor(Object x) {
677	>	if (x instanceof Comparable) {
678	>	Class<?> c; Type[] ts, as; Type t; ParameterizedType p;
679	>	if ((c = x.getClass()) == String.class) // bypass checks
680	>	return c;
681	>	if ((ts = c.getGenericInterfaces()) != null) {
682	>	for (int i = 0; i < ts.length; ++i) {
683	>	if (((t = ts[i]) instanceof ParameterizedType) &&
684	>	((p = (ParameterizedType)t).getRawType() ==
685	>	Comparable.class) &&
686	>	(as = p.getActualTypeArguments()) != null &&
687	>	as.length == 1 && as[0] == c) // type arg is c
688	>	return c;
689		}
2041	–	break;
2042	–	}
2043	–	}
2044	–	return tab;
2045	–	}
2046	–
2047	–	/**
2048	–	* If table is too small and not already resizing, creates next
2049	–	* table and transfers bins.  Rechecks occupancy after a transfer
2050	–	* to see if another resize is already needed because resizings
2051	–	* are lagging additions.
2052	–	*/
2053	–	private final void checkForResize() {
2054	–	Node[] tab; int n, sc;
2055	–	while ((tab = table) != null &&
2056	–	(n = tab.length) < MAXIMUM_CAPACITY &&
2057	–	(sc = sizeCtl) >= 0 && counter.sum() >= (long)sc &&
2058	–	UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2059	–	try {
2060	–	if (tab == table) {
2061	–	table = rebuild(tab);
2062	–	sc = (n << 1) - (n >>> 1);
2063	–	}
2064	–	} finally {
2065	–	sizeCtl = sc;
690		}
691		}
692	+	return null;
693		}
694
695		/**
696	<	* Tries to presize table to accommodate the given number of elements.
697	<	*
2073	<	* @param size number of elements (doesn't need to be perfectly accurate)
696	>	* Returns k.compareTo(x) if x matches kc (k's screened comparable
697	>	* class), else 0.
698		*/
699	<	private final void tryPresize(int size) {
700	<	int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
701	<	tableSizeFor(size + (size >>> 1) + 1);
702	<	int sc;
2079	<	while ((sc = sizeCtl) >= 0) {
2080	<	Node[] tab = table; int n;
2081	<	if (tab == null || (n = tab.length) == 0) {
2082	<	n = (sc > c) ? sc : c;
2083	<	if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2084	<	try {
2085	<	if (table == tab) {
2086	<	table = new Node[n];
2087	<	sc = n - (n >>> 2);
2088	<	}
2089	<	} finally {
2090	<	sizeCtl = sc;
2091	<	}
2092	<	}
2093	<	}
2094	<	else if (c <= sc || n >= MAXIMUM_CAPACITY)
2095	<	break;
2096	<	else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2097	<	try {
2098	<	if (table == tab) {
2099	<	table = rebuild(tab);
2100	<	sc = (n << 1) - (n >>> 1);
2101	<	}
2102	<	} finally {
2103	<	sizeCtl = sc;
2104	<	}
2105	<	}
2106	<	}
699	>	@SuppressWarnings({"rawtypes","unchecked"}) // for cast to Comparable
700	>	static int compareComparables(Class<?> kc, Object k, Object x) {
701	>	return (x == null || x.getClass() != kc ? 0 :
702	>	((Comparable)k).compareTo(x));
703		}
704
705	+	/* ---------------- Table element access -------------- */
706	+
707		/*
708	<	* Moves and/or copies the nodes in each bin to new table. See
709	<	* above for explanation.
710	<	*
711	<	* @return the new table
712	<	*/
713	<	private static final Node[] rebuild(Node[] tab) {
714	<	int n = tab.length;
715	<	Node[] nextTab = new Node[n << 1];
716	<	Node fwd = new Node(MOVED, nextTab, null, null);
717	<	int[] buffer = null;       // holds bins to revisit; null until needed
718	<	Node rev = null;           // reverse forwarder; null until needed
719	<	int nbuffered = 0;         // the number of bins in buffer list
720	<	int bufferIndex = 0;       // buffer index of current buffered bin
721	<	int bin = n - 1;           // current non-buffered bin or -1 if none
722	<
723	<	for (int i = bin;;) {      // start upwards sweep
724	<	int fh; Node f;
725	<	if ((f = tabAt(tab, i)) == null) {
726	<	if (bin >= 0) {    // Unbuffered; no lock needed (or available)
727	<	if (!casTabAt(tab, i, f, fwd))
728	<	continue;
729	<	}
730	<	else {             // transiently use a locked forwarding node
2133	<	Node g = new Node(MOVED|LOCKED, nextTab, null, null);
2134	<	if (!casTabAt(tab, i, f, g))
2135	<	continue;
2136	<	setTabAt(nextTab, i, null);
2137	<	setTabAt(nextTab, i + n, null);
2138	<	setTabAt(tab, i, fwd);
2139	<	if (!g.casHash(MOVED|LOCKED, MOVED)) {
2140	<	g.hash = MOVED;
2141	<	synchronized (g) { g.notifyAll(); }
2142	<	}
2143	<	}
2144	<	}
2145	<	else if ((fh = f.hash) == MOVED) {
2146	<	Object fk = f.key;
2147	<	if (fk instanceof TreeBin) {
2148	<	TreeBin t = (TreeBin)fk;
2149	<	boolean validated = false;
2150	<	t.acquire(0);
2151	<	try {
2152	<	if (tabAt(tab, i) == f) {
2153	<	validated = true;
2154	<	splitTreeBin(nextTab, i, t);
2155	<	setTabAt(tab, i, fwd);
2156	<	}
2157	<	} finally {
2158	<	t.release(0);
2159	<	}
2160	<	if (!validated)
2161	<	continue;
2162	<	}
2163	<	}
2164	<	else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) {
2165	<	boolean validated = false;
2166	<	try {              // split to lo and hi lists; copying as needed
2167	<	if (tabAt(tab, i) == f) {
2168	<	validated = true;
2169	<	splitBin(nextTab, i, f);
2170	<	setTabAt(tab, i, fwd);
2171	<	}
2172	<	} finally {
2173	<	if (!f.casHash(fh | LOCKED, fh)) {
2174	<	f.hash = fh;
2175	<	synchronized (f) { f.notifyAll(); };
2176	<	}
2177	<	}
2178	<	if (!validated)
2179	<	continue;
2180	<	}
2181	<	else {
2182	<	if (buffer == null) // initialize buffer for revisits
2183	<	buffer = new int[TRANSFER_BUFFER_SIZE];
2184	<	if (bin < 0 && bufferIndex > 0) {
2185	<	int j = buffer[--bufferIndex];
2186	<	buffer[bufferIndex] = i;
2187	<	i = j;         // swap with another bin
2188	<	continue;
2189	<	}
2190	<	if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) {
2191	<	f.tryAwaitLock(tab, i);
2192	<	continue;      // no other options -- block
2193	<	}
2194	<	if (rev == null)   // initialize reverse-forwarder
2195	<	rev = new Node(MOVED, tab, null, null);
2196	<	if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0)
2197	<	continue;      // recheck before adding to list
2198	<	buffer[nbuffered++] = i;
2199	<	setTabAt(nextTab, i, rev);     // install place-holders
2200	<	setTabAt(nextTab, i + n, rev);
2201	<	}
2202	<
2203	<	if (bin > 0)
2204	<	i = --bin;
2205	<	else if (buffer != null && nbuffered > 0) {
2206	<	bin = -1;
2207	<	i = buffer[bufferIndex = --nbuffered];
2208	<	}
2209	<	else
2210	<	return nextTab;
2211	<	}
708	>	* Volatile access methods are used for table elements as well as
709	>	* elements of in-progress next table while resizing.  All uses of
710	>	* the tab arguments must be null checked by callers.  All callers
711	>	* also paranoically precheck that tab's length is not zero (or an
712	>	* equivalent check), thus ensuring that any index argument taking
713	>	* the form of a hash value anded with (length - 1) is a valid
714	>	* index.  Note that, to be correct wrt arbitrary concurrency
715	>	* errors by users, these checks must operate on local variables,
716	>	* which accounts for some odd-looking inline assignments below.
717	>	* Note that calls to setTabAt always occur within locked regions,
718	>	* and so in principle require only release ordering, not
719	>	* full volatile semantics, but are currently coded as volatile
720	>	* writes to be conservative.
721	>	*/
722	>
723	>	@SuppressWarnings("unchecked")
724	>	static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) {
725	>	return (Node<K,V>)U.getObjectVolatile(tab, ((long)i << ASHIFT) + ABASE);
726	>	}
727	>
728	>	static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i,
729	>	Node<K,V> c, Node<K,V> v) {
730	>	return U.compareAndSwapObject(tab, ((long)i << ASHIFT) + ABASE, c, v);
731		}
732
733	<	/**
734	<	* Splits a normal bin with list headed by e into lo and hi parts;
2216	<	* installs in given table.
2217	<	*/
2218	<	private static void splitBin(Node[] nextTab, int i, Node e) {
2219	<	int bit = nextTab.length >>> 1; // bit to split on
2220	<	int runBit = e.hash & bit;
2221	<	Node lastRun = e, lo = null, hi = null;
2222	<	for (Node p = e.next; p != null; p = p.next) {
2223	<	int b = p.hash & bit;
2224	<	if (b != runBit) {
2225	<	runBit = b;
2226	<	lastRun = p;
2227	<	}
2228	<	}
2229	<	if (runBit == 0)
2230	<	lo = lastRun;
2231	<	else
2232	<	hi = lastRun;
2233	<	for (Node p = e; p != lastRun; p = p.next) {
2234	<	int ph = p.hash & HASH_BITS;
2235	<	Object pk = p.key, pv = p.val;
2236	<	if ((ph & bit) == 0)
2237	<	lo = new Node(ph, pk, pv, lo);
2238	<	else
2239	<	hi = new Node(ph, pk, pv, hi);
2240	<	}
2241	<	setTabAt(nextTab, i, lo);
2242	<	setTabAt(nextTab, i + bit, hi);
733	>	static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) {
734	>	U.putObjectVolatile(tab, ((long)i << ASHIFT) + ABASE, v);
735		}
736
737	+	/* ---------------- Fields -------------- */
738	+
739		/**
740	<	* Splits a tree bin into lo and hi parts; installs in given table.
740	>	* The array of bins. Lazily initialized upon first insertion.
741	>	* Size is always a power of two. Accessed directly by iterators.
742		*/
743	<	private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) {
2249	<	int bit = nextTab.length >>> 1;
2250	<	TreeBin lt = new TreeBin();
2251	<	TreeBin ht = new TreeBin();
2252	<	int lc = 0, hc = 0;
2253	<	for (Node e = t.first; e != null; e = e.next) {
2254	<	int h = e.hash & HASH_BITS;
2255	<	Object k = e.key, v = e.val;
2256	<	if ((h & bit) == 0) {
2257	<	++lc;
2258	<	lt.putTreeNode(h, k, v);
2259	<	}
2260	<	else {
2261	<	++hc;
2262	<	ht.putTreeNode(h, k, v);
2263	<	}
2264	<	}
2265	<	Node ln, hn; // throw away trees if too small
2266	<	if (lc <= (TREE_THRESHOLD >>> 1)) {
2267	<	ln = null;
2268	<	for (Node p = lt.first; p != null; p = p.next)
2269	<	ln = new Node(p.hash, p.key, p.val, ln);
2270	<	}
2271	<	else
2272	<	ln = new Node(MOVED, lt, null, null);
2273	<	setTabAt(nextTab, i, ln);
2274	<	if (hc <= (TREE_THRESHOLD >>> 1)) {
2275	<	hn = null;
2276	<	for (Node p = ht.first; p != null; p = p.next)
2277	<	hn = new Node(p.hash, p.key, p.val, hn);
2278	<	}
2279	<	else
2280	<	hn = new Node(MOVED, ht, null, null);
2281	<	setTabAt(nextTab, i + bit, hn);
2282	<	}
743	>	transient volatile Node<K,V>[] table;
744
745		/**
746	<	* Implementation for clear. Steps through each bin, removing all
2286	<	* nodes.
746	>	* The next table to use; non-null only while resizing.
747		*/
748	<	private final void internalClear() {
2289	<	long delta = 0L; // negative number of deletions
2290	<	int i = 0;
2291	<	Node[] tab = table;
2292	<	while (tab != null && i < tab.length) {
2293	<	int fh; Object fk;
2294	<	Node f = tabAt(tab, i);
2295	<	if (f == null)
2296	<	++i;
2297	<	else if ((fh = f.hash) == MOVED) {
2298	<	if ((fk = f.key) instanceof TreeBin) {
2299	<	TreeBin t = (TreeBin)fk;
2300	<	t.acquire(0);
2301	<	try {
2302	<	if (tabAt(tab, i) == f) {
2303	<	for (Node p = t.first; p != null; p = p.next) {
2304	<	if (p.val != null) { // (currently always true)
2305	<	p.val = null;
2306	<	--delta;
2307	<	}
2308	<	}
2309	<	t.first = null;
2310	<	t.root = null;
2311	<	++i;
2312	<	}
2313	<	} finally {
2314	<	t.release(0);
2315	<	}
2316	<	}
2317	<	else
2318	<	tab = (Node[])fk;
2319	<	}
2320	<	else if ((fh & LOCKED) != 0) {
2321	<	counter.add(delta); // opportunistically update count
2322	<	delta = 0L;
2323	<	f.tryAwaitLock(tab, i);
2324	<	}
2325	<	else if (f.casHash(fh, fh | LOCKED)) {
2326	<	try {
2327	<	if (tabAt(tab, i) == f) {
2328	<	for (Node e = f; e != null; e = e.next) {
2329	<	if (e.val != null) {  // (currently always true)
2330	<	e.val = null;
2331	<	--delta;
2332	<	}
2333	<	}
2334	<	setTabAt(tab, i, null);
2335	<	++i;
2336	<	}
2337	<	} finally {
2338	<	if (!f.casHash(fh | LOCKED, fh)) {
2339	<	f.hash = fh;
2340	<	synchronized (f) { f.notifyAll(); };
2341	<	}
2342	<	}
2343	<	}
2344	<	}
2345	<	if (delta != 0)
2346	<	counter.add(delta);
2347	<	}
2348	<
2349	<	/* ----------------Table Traversal -------------- */
748	>	private transient volatile Node<K,V>[] nextTable;
749
750		/**
751	<	* Encapsulates traversal for methods such as containsValue; also
752	<	* serves as a base class for other iterators and bulk tasks.
753	<	*
754	<	* At each step, the iterator snapshots the key ("nextKey") and
755	<	* value ("nextVal") of a valid node (i.e., one that, at point of
2357	<	* snapshot, has a non-null user value). Because val fields can
2358	<	* change (including to null, indicating deletion), field nextVal
2359	<	* might not be accurate at point of use, but still maintains the
2360	<	* weak consistency property of holding a value that was once
2361	<	* valid. To support iterator.remove, the nextKey field is not
2362	<	* updated (nulled out) when the iterator cannot advance.
2363	<	*
2364	<	* Internal traversals directly access these fields, as in:
2365	<	* {@code while (it.advance() != null) { process(it.nextKey); }}
2366	<	*
2367	<	* Exported iterators must track whether the iterator has advanced
2368	<	* (in hasNext vs next) (by setting/checking/nulling field
2369	<	* nextVal), and then extract key, value, or key-value pairs as
2370	<	* return values of next().
2371	<	*
2372	<	* The iterator visits once each still-valid node that was
2373	<	* reachable upon iterator construction. It might miss some that
2374	<	* were added to a bin after the bin was visited, which is OK wrt
2375	<	* consistency guarantees. Maintaining this property in the face
2376	<	* of possible ongoing resizes requires a fair amount of
2377	<	* bookkeeping state that is difficult to optimize away amidst
2378	<	* volatile accesses.  Even so, traversal maintains reasonable
2379	<	* throughput.
2380	<	*
2381	<	* Normally, iteration proceeds bin-by-bin traversing lists.
2382	<	* However, if the table has been resized, then all future steps
2383	<	* must traverse both the bin at the current index as well as at
2384	<	* (index + baseSize); and so on for further resizings. To
2385	<	* paranoically cope with potential sharing by users of iterators
2386	<	* across threads, iteration terminates if a bounds checks fails
2387	<	* for a table read.
2388	<	*
2389	<	* This class extends ForkJoinTask to streamline parallel
2390	<	* iteration in bulk operations (see BulkTask). This adds only an
2391	<	* int of space overhead, which is close enough to negligible in
2392	<	* cases where it is not needed to not worry about it.  Because
2393	<	* ForkJoinTask is Serializable, but iterators need not be, we
2394	<	* need to add warning suppressions.
2395	<	*/
2396	<	@SuppressWarnings("serial") static class Traverser<K,V,R> extends ForkJoinTask<R> {
2397	<	final ConcurrentHashMap<K, V> map;
2398	<	Node next;           // the next entry to use
2399	<	Object nextKey;      // cached key field of next
2400	<	Object nextVal;      // cached val field of next
2401	<	Node[] tab;          // current table; updated if resized
2402	<	int index;           // index of bin to use next
2403	<	int baseIndex;       // current index of initial table
2404	<	int baseLimit;       // index bound for initial table
2405	<	int baseSize;        // initial table size
751	>	* Base counter value, used mainly when there is no contention,
752	>	* but also as a fallback during table initialization
753	>	* races. Updated via CAS.
754	>	*/
755	>	private transient volatile long baseCount;
756
757	<	/** Creates iterator for all entries in the table. */
758	<	Traverser(ConcurrentHashMap<K, V> map) {
759	<	this.map = map;
760	<	}
757	>	/**
758	>	* Table initialization and resizing control.  When negative, the
759	>	* table is being initialized or resized: -1 for initialization,
760	>	* else -(1 + the number of active resizing threads).  Otherwise,
761	>	* when table is null, holds the initial table size to use upon
762	>	* creation, or 0 for default. After initialization, holds the
763	>	* next element count value upon which to resize the table.
764	>	*/
765	>	private transient volatile int sizeCtl;
766
767	<	/** Creates iterator for split() methods */
768	<	Traverser(Traverser<K,V,?> it) {
769	<	ConcurrentHashMap<K, V> m; Node[] t;
770	<	if ((m = this.map = it.map) == null)
2416	<	t = null;
2417	<	else if ((t = it.tab) == null && // force parent tab initialization
2418	<	(t = it.tab = m.table) != null)
2419	<	it.baseLimit = it.baseSize = t.length;
2420	<	this.tab = t;
2421	<	this.baseSize = it.baseSize;
2422	<	it.baseLimit = this.index = this.baseIndex =
2423	<	((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1;
2424	<	}
767	>	/**
768	>	* The next table index (plus one) to split while resizing.
769	>	*/
770	>	private transient volatile int transferIndex;
771
772	<	/**
773	<	* Advances next; returns nextVal or null if terminated.
774	<	* See above for explanation.
775	<	*/
2430	<	final Object advance() {
2431	<	Node e = next;
2432	<	Object ev = null;
2433	<	outer: do {
2434	<	if (e != null)                  // advance past used/skipped node
2435	<	e = e.next;
2436	<	while (e == null) {             // get to next non-null bin
2437	<	ConcurrentHashMap<K, V> m;
2438	<	Node[] t; int b, i, n; Object ek; // checks must use locals
2439	<	if ((t = tab) != null)
2440	<	n = t.length;
2441	<	else if ((m = map) != null && (t = tab = m.table) != null)
2442	<	n = baseLimit = baseSize = t.length;
2443	<	else
2444	<	break outer;
2445	<	if ((b = baseIndex) >= baseLimit ||
2446	<	(i = index) < 0 || i >= n)
2447	<	break outer;
2448	<	if ((e = tabAt(t, i)) != null && e.hash == MOVED) {
2449	<	if ((ek = e.key) instanceof TreeBin)
2450	<	e = ((TreeBin)ek).first;
2451	<	else {
2452	<	tab = (Node[])ek;
2453	<	continue;           // restarts due to null val
2454	<	}
2455	<	}                           // visit upper slots if present
2456	<	index = (i += baseSize) < n ? i : (baseIndex = b + 1);
2457	<	}
2458	<	nextKey = e.key;
2459	<	} while ((ev = e.val) == null);    // skip deleted or special nodes
2460	<	next = e;
2461	<	return nextVal = ev;
2462	<	}
772	>	/**
773	>	* Spinlock (locked via CAS) used when resizing and/or creating CounterCells.
774	>	*/
775	>	private transient volatile int cellsBusy;
776
777	<	public final void remove() {
778	<	Object k = nextKey;
779	<	if (k == null && (advance() == null || (k = nextKey) == null))
780	<	throw new IllegalStateException();
2468	<	map.internalReplace(k, null, null);
2469	<	}
777	>	/**
778	>	* Table of counter cells. When non-null, size is a power of 2.
779	>	*/
780	>	private transient volatile CounterCell[] counterCells;
781
782	<	public final boolean hasNext() {
783	<	return nextVal != null || advance() != null;
784	<	}
782	>	// views
783	>	private transient KeySetView<K,V> keySet;
784	>	private transient ValuesView<K,V> values;
785	>	private transient EntrySetView<K,V> entrySet;
786
2475	–	public final boolean hasMoreElements() { return hasNext(); }
2476	–	public final void setRawResult(Object x) { }
2477	–	public R getRawResult() { return null; }
2478	–	public boolean exec() { return true; }
2479	–	}
787
788		/* ---------------- Public operations -------------- */
789
#	Line 2484 | Line 791 | public class ConcurrentHashMap<K, V>
791		* Creates a new, empty map with the default initial table size (16).
792		*/
793		public ConcurrentHashMap() {
2487	–	this.counter = new LongAdder();
794		}
795
796		/**
#	Line 2503 | Line 809 | public class ConcurrentHashMap<K, V>
809		int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
810		MAXIMUM_CAPACITY :
811		tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
2506	–	this.counter = new LongAdder();
812		this.sizeCtl = cap;
813		}
814
#	Line 2513 | Line 818 | public class ConcurrentHashMap<K, V>
818		* @param m the map
819		*/
820		public ConcurrentHashMap(Map<? extends K, ? extends V> m) {
2516	–	this.counter = new LongAdder();
821		this.sizeCtl = DEFAULT_CAPACITY;
822	<	internalPutAll(m);
822	>	putAll(m);
823		}
824
825		/**
#	Line 2556 | Line 860 | public class ConcurrentHashMap<K, V>
860		* nonpositive
861		*/
862		public ConcurrentHashMap(int initialCapacity,
863	<	float loadFactor, int concurrencyLevel) {
863	>	float loadFactor, int concurrencyLevel) {
864		if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)
865		throw new IllegalArgumentException();
866		if (initialCapacity < concurrencyLevel)   // Use at least as many bins
#	Line 2564 | Line 868 | public class ConcurrentHashMap<K, V>
868		long size = (long)(1.0 + (long)initialCapacity / loadFactor);
869		int cap = (size >= (long)MAXIMUM_CAPACITY) ?
870		MAXIMUM_CAPACITY : tableSizeFor((int)size);
2567	–	this.counter = new LongAdder();
871		this.sizeCtl = cap;
872		}
873
874	<	/**
2572	<	* Creates a new {@link Set} backed by a ConcurrentHashMap
2573	<	* from the given type to {@code Boolean.TRUE}.
2574	<	*
2575	<	* @return the new set
2576	<	*/
2577	<	public static <K> KeySetView<K,Boolean> newKeySet() {
2578	<	return new KeySetView<K,Boolean>(new ConcurrentHashMap<K,Boolean>(),
2579	<	Boolean.TRUE);
2580	<	}
2581	<
2582	<	/**
2583	<	* Creates a new {@link Set} backed by a ConcurrentHashMap
2584	<	* from the given type to {@code Boolean.TRUE}.
2585	<	*
2586	<	* @param initialCapacity The implementation performs internal
2587	<	* sizing to accommodate this many elements.
2588	<	* @throws IllegalArgumentException if the initial capacity of
2589	<	* elements is negative
2590	<	* @return the new set
2591	<	*/
2592	<	public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
2593	<	return new KeySetView<K,Boolean>(new ConcurrentHashMap<K,Boolean>(initialCapacity),
2594	<	Boolean.TRUE);
2595	<	}
2596	<
2597	<	/**
2598	<	* {@inheritDoc}
2599	<	*/
2600	<	public boolean isEmpty() {
2601	<	return counter.sum() <= 0L; // ignore transient negative values
2602	<	}
874	>	// Original (since JDK1.2) Map methods
875
876		/**
877		* {@inheritDoc}
878		*/
879		public int size() {
880	<	long n = counter.sum();
880	>	long n = sumCount();
881		return ((n < 0L) ? 0 :
882		(n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
883		(int)n);
884		}
885
886		/**
887	<	* Returns the number of mappings. This method should be used
2616	<	* instead of {@link #size} because a ConcurrentHashMap may
2617	<	* contain more mappings than can be represented as an int. The
2618	<	* value returned is a snapshot; the actual count may differ if
2619	<	* there are ongoing concurrent insertions or removals.
2620	<	*
2621	<	* @return the number of mappings
887	>	* {@inheritDoc}
888		*/
889	<	public long mappingCount() {
890	<	long n = counter.sum();
2625	<	return (n < 0L) ? 0L : n; // ignore transient negative values
889	>	public boolean isEmpty() {
890	>	return sumCount() <= 0L; // ignore transient negative values
891		}
892
893		/**
#	Line 2636 | Line 901 | public class ConcurrentHashMap<K, V>
901		*
902		* @throws NullPointerException if the specified key is null
903		*/
904	<	@SuppressWarnings("unchecked") public V get(Object key) {
905	<	if (key == null)
906	<	throw new NullPointerException();
907	<	return (V)internalGet(key);
908	<	}
909	<
910	<	/**
911	<	* Returns the value to which the specified key is mapped,
912	<	* or the given defaultValue if this map contains no mapping for the key.
913	<	*
914	<	* @param key the key
915	<	* @param defaultValue the value to return if this map contains
916	<	* no mapping for the given key
917	<	* @return the mapping for the key, if present; else the defaultValue
918	<	* @throws NullPointerException if the specified key is null
919	<	*/
920	<	@SuppressWarnings("unchecked") public V getValueOrDefault(Object key, V defaultValue) {
921	<	if (key == null)
2657	<	throw new NullPointerException();
2658	<	V v = (V) internalGet(key);
2659	<	return v == null ? defaultValue : v;
904	>	public V get(Object key) {
905	>	Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek;
906	>	int h = spread(key.hashCode());
907	>	if ((tab = table) != null && (n = tab.length) > 0 &&
908	>	(e = tabAt(tab, (n - 1) & h)) != null) {
909	>	if ((eh = e.hash) == h) {
910	>	if ((ek = e.key) == key || (ek != null && key.equals(ek)))
911	>	return e.val;
912	>	}
913	>	else if (eh < 0)
914	>	return (p = e.find(h, key)) != null ? p.val : null;
915	>	while ((e = e.next) != null) {
916	>	if (e.hash == h &&
917	>	((ek = e.key) == key || (ek != null && key.equals(ek))))
918	>	return e.val;
919	>	}
920	>	}
921	>	return null;
922		}
923
924		/**
925		* Tests if the specified object is a key in this table.
926		*
927	<	* @param  key   possible key
927	>	* @param  key possible key
928		* @return {@code true} if and only if the specified object
929		*         is a key in this table, as determined by the
930		*         {@code equals} method; {@code false} otherwise
931		* @throws NullPointerException if the specified key is null
932		*/
933		public boolean containsKey(Object key) {
934	<	if (key == null)
2673	<	throw new NullPointerException();
2674	<	return internalGet(key) != null;
934	>	return get(key) != null;
935		}
936
937		/**
#	Line 2687 | Line 947 | public class ConcurrentHashMap<K, V>
947		public boolean containsValue(Object value) {
948		if (value == null)
949		throw new NullPointerException();
950	<	Object v;
951	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
952	<	while ((v = it.advance()) != null) {
953	<	if (v == value || value.equals(v))
954	<	return true;
950	>	Node<K,V>[] t;
951	>	if ((t = table) != null) {
952	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
953	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
954	>	V v;
955	>	if ((v = p.val) == value || (v != null && value.equals(v)))
956	>	return true;
957	>	}
958		}
959		return false;
960		}
961
962		/**
2700	–	* Legacy method testing if some key maps into the specified value
2701	–	* in this table.  This method is identical in functionality to
2702	–	* {@link #containsValue}, and exists solely to ensure
2703	–	* full compatibility with class {@link java.util.Hashtable},
2704	–	* which supported this method prior to introduction of the
2705	–	* Java Collections framework.
2706	–	*
2707	–	* @param  value a value to search for
2708	–	* @return {@code true} if and only if some key maps to the
2709	–	*         {@code value} argument in this table as
2710	–	*         determined by the {@code equals} method;
2711	–	*         {@code false} otherwise
2712	–	* @throws NullPointerException if the specified value is null
2713	–	*/
2714	–	public boolean contains(Object value) {
2715	–	return containsValue(value);
2716	–	}
2717	–
2718	–	/**
963		* Maps the specified key to the specified value in this table.
964		* Neither the key nor the value can be null.
965		*
966	<	* <p> The value can be retrieved by calling the {@code get} method
966	>	* <p>The value can be retrieved by calling the {@code get} method
967		* with a key that is equal to the original key.
968		*
969		* @param key key with which the specified value is to be associated
#	Line 2728 | Line 972 | public class ConcurrentHashMap<K, V>
972		*         {@code null} if there was no mapping for {@code key}
973		* @throws NullPointerException if the specified key or value is null
974		*/
975	<	@SuppressWarnings("unchecked") public V put(K key, V value) {
976	<	if (key == null || value == null)
975	>	public V put(K key, V value) {
976	>	return putVal(key, value, false);
977	>	}
978	>
979	>	/** Implementation for put and putIfAbsent */
980	>	final V putVal(K key, V value, boolean onlyIfAbsent) {
981	>	if (key == null || value == null) throw new NullPointerException();
982	>	int hash = spread(key.hashCode());
983	>	int binCount = 0;
984	>	for (Node<K,V>[] tab = table;;) {
985	>	Node<K,V> f; int n, i, fh;
986	>	if (tab == null || (n = tab.length) == 0)
987	>	tab = initTable();
988	>	else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {
989	>	if (casTabAt(tab, i, null,
990	>	new Node<K,V>(hash, key, value, null)))
991	>	break;                   // no lock when adding to empty bin
992	>	}
993	>	else if ((fh = f.hash) == MOVED)
994	>	tab = helpTransfer(tab, f);
995	>	else {
996	>	V oldVal = null;
997	>	synchronized (f) {
998	>	if (tabAt(tab, i) == f) {
999	>	if (fh >= 0) {
1000	>	binCount = 1;
1001	>	for (Node<K,V> e = f;; ++binCount) {
1002	>	K ek;
1003	>	if (e.hash == hash &&
1004	>	((ek = e.key) == key ||
1005	>	(ek != null && key.equals(ek)))) {
1006	>	oldVal = e.val;
1007	>	if (!onlyIfAbsent)
1008	>	e.val = value;
1009	>	break;
1010	>	}
1011	>	Node<K,V> pred = e;
1012	>	if ((e = e.next) == null) {
1013	>	pred.next = new Node<K,V>(hash, key,
1014	>	value, null);
1015	>	break;
1016	>	}
1017	>	}
1018	>	}
1019	>	else if (f instanceof TreeBin) {
1020	>	Node<K,V> p;
1021	>	binCount = 2;
1022	>	if ((p = ((TreeBin<K,V>)f).putTreeVal(hash, key,
1023	>	value)) != null) {
1024	>	oldVal = p.val;
1025	>	if (!onlyIfAbsent)
1026	>	p.val = value;
1027	>	}
1028	>	}
1029	>	else if (f instanceof ReservationNode)
1030	>	throw new IllegalStateException("Recursive update");
1031	>	}
1032	>	}
1033	>	if (binCount != 0) {
1034	>	if (binCount >= TREEIFY_THRESHOLD)
1035	>	treeifyBin(tab, i);
1036	>	if (oldVal != null)
1037	>	return oldVal;
1038	>	break;
1039	>	}
1040	>	}
1041	>	}
1042	>	addCount(1L, binCount);
1043	>	return null;
1044	>	}
1045	>
1046	>	/**
1047	>	* Copies all of the mappings from the specified map to this one.
1048	>	* These mappings replace any mappings that this map had for any of the
1049	>	* keys currently in the specified map.
1050	>	*
1051	>	* @param m mappings to be stored in this map
1052	>	*/
1053	>	public void putAll(Map<? extends K, ? extends V> m) {
1054	>	tryPresize(m.size());
1055	>	for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
1056	>	putVal(e.getKey(), e.getValue(), false);
1057	>	}
1058	>
1059	>	/**
1060	>	* Removes the key (and its corresponding value) from this map.
1061	>	* This method does nothing if the key is not in the map.
1062	>	*
1063	>	* @param  key the key that needs to be removed
1064	>	* @return the previous value associated with {@code key}, or
1065	>	*         {@code null} if there was no mapping for {@code key}
1066	>	* @throws NullPointerException if the specified key is null
1067	>	*/
1068	>	public V remove(Object key) {
1069	>	return replaceNode(key, null, null);
1070	>	}
1071	>
1072	>	/**
1073	>	* Implementation for the four public remove/replace methods:
1074	>	* Replaces node value with v, conditional upon match of cv if
1075	>	* non-null.  If resulting value is null, delete.
1076	>	*/
1077	>	final V replaceNode(Object key, V value, Object cv) {
1078	>	int hash = spread(key.hashCode());
1079	>	for (Node<K,V>[] tab = table;;) {
1080	>	Node<K,V> f; int n, i, fh;
1081	>	if (tab == null || (n = tab.length) == 0 ||
1082	>	(f = tabAt(tab, i = (n - 1) & hash)) == null)
1083	>	break;
1084	>	else if ((fh = f.hash) == MOVED)
1085	>	tab = helpTransfer(tab, f);
1086	>	else {
1087	>	V oldVal = null;
1088	>	boolean validated = false;
1089	>	synchronized (f) {
1090	>	if (tabAt(tab, i) == f) {
1091	>	if (fh >= 0) {
1092	>	validated = true;
1093	>	for (Node<K,V> e = f, pred = null;;) {
1094	>	K ek;
1095	>	if (e.hash == hash &&
1096	>	((ek = e.key) == key ||
1097	>	(ek != null && key.equals(ek)))) {
1098	>	V ev = e.val;
1099	>	if (cv == null || cv == ev ||
1100	>	(ev != null && cv.equals(ev))) {
1101	>	oldVal = ev;
1102	>	if (value != null)
1103	>	e.val = value;
1104	>	else if (pred != null)
1105	>	pred.next = e.next;
1106	>	else
1107	>	setTabAt(tab, i, e.next);
1108	>	}
1109	>	break;
1110	>	}
1111	>	pred = e;
1112	>	if ((e = e.next) == null)
1113	>	break;
1114	>	}
1115	>	}
1116	>	else if (f instanceof TreeBin) {
1117	>	validated = true;
1118	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1119	>	TreeNode<K,V> r, p;
1120	>	if ((r = t.root) != null &&
1121	>	(p = r.findTreeNode(hash, key, null)) != null) {
1122	>	V pv = p.val;
1123	>	if (cv == null || cv == pv ||
1124	>	(pv != null && cv.equals(pv))) {
1125	>	oldVal = pv;
1126	>	if (value != null)
1127	>	p.val = value;
1128	>	else if (t.removeTreeNode(p))
1129	>	setTabAt(tab, i, untreeify(t.first));
1130	>	}
1131	>	}
1132	>	}
1133	>	else if (f instanceof ReservationNode)
1134	>	throw new IllegalStateException("Recursive update");
1135	>	}
1136	>	}
1137	>	if (validated) {
1138	>	if (oldVal != null) {
1139	>	if (value == null)
1140	>	addCount(-1L, -1);
1141	>	return oldVal;
1142	>	}
1143	>	break;
1144	>	}
1145	>	}
1146	>	}
1147	>	return null;
1148	>	}
1149	>
1150	>	/**
1151	>	* Removes all of the mappings from this map.
1152	>	*/
1153	>	public void clear() {
1154	>	long delta = 0L; // negative number of deletions
1155	>	int i = 0;
1156	>	Node<K,V>[] tab = table;
1157	>	while (tab != null && i < tab.length) {
1158	>	int fh;
1159	>	Node<K,V> f = tabAt(tab, i);
1160	>	if (f == null)
1161	>	++i;
1162	>	else if ((fh = f.hash) == MOVED) {
1163	>	tab = helpTransfer(tab, f);
1164	>	i = 0; // restart
1165	>	}
1166	>	else {
1167	>	synchronized (f) {
1168	>	if (tabAt(tab, i) == f) {
1169	>	Node<K,V> p = (fh >= 0 ? f :
1170	>	(f instanceof TreeBin) ?
1171	>	((TreeBin<K,V>)f).first : null);
1172	>	while (p != null) {
1173	>	--delta;
1174	>	p = p.next;
1175	>	}
1176	>	setTabAt(tab, i++, null);
1177	>	}
1178	>	}
1179	>	}
1180	>	}
1181	>	if (delta != 0L)
1182	>	addCount(delta, -1);
1183	>	}
1184	>
1185	>	/**
1186	>	* Returns a {@link Set} view of the keys contained in this map.
1187	>	* The set is backed by the map, so changes to the map are
1188	>	* reflected in the set, and vice-versa. The set supports element
1189	>	* removal, which removes the corresponding mapping from this map,
1190	>	* via the {@code Iterator.remove}, {@code Set.remove},
1191	>	* {@code removeAll}, {@code retainAll}, and {@code clear}
1192	>	* operations.  It does not support the {@code add} or
1193	>	* {@code addAll} operations.
1194	>	*
1195	>	* <p>The view's iterators and spliterators are
1196	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
1197	>	*
1198	>	* <p>The view's {@code spliterator} reports {@link Spliterator#CONCURRENT},
1199	>	* {@link Spliterator#DISTINCT}, and {@link Spliterator#NONNULL}.
1200	>	*
1201	>	* @return the set view
1202	>	*/
1203	>	public KeySetView<K,V> keySet() {
1204	>	KeySetView<K,V> ks;
1205	>	return (ks = keySet) != null ? ks : (keySet = new KeySetView<K,V>(this, null));
1206	>	}
1207	>
1208	>	/**
1209	>	* Returns a {@link Collection} view of the values contained in this map.
1210	>	* The collection is backed by the map, so changes to the map are
1211	>	* reflected in the collection, and vice-versa.  The collection
1212	>	* supports element removal, which removes the corresponding
1213	>	* mapping from this map, via the {@code Iterator.remove},
1214	>	* {@code Collection.remove}, {@code removeAll},
1215	>	* {@code retainAll}, and {@code clear} operations.  It does not
1216	>	* support the {@code add} or {@code addAll} operations.
1217	>	*
1218	>	* <p>The view's iterators and spliterators are
1219	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
1220	>	*
1221	>	* <p>The view's {@code spliterator} reports {@link Spliterator#CONCURRENT}
1222	>	* and {@link Spliterator#NONNULL}.
1223	>	*
1224	>	* @return the collection view
1225	>	*/
1226	>	public Collection<V> values() {
1227	>	ValuesView<K,V> vs;
1228	>	return (vs = values) != null ? vs : (values = new ValuesView<K,V>(this));
1229	>	}
1230	>
1231	>	/**
1232	>	* Returns a {@link Set} view of the mappings contained in this map.
1233	>	* The set is backed by the map, so changes to the map are
1234	>	* reflected in the set, and vice-versa.  The set supports element
1235	>	* removal, which removes the corresponding mapping from the map,
1236	>	* via the {@code Iterator.remove}, {@code Set.remove},
1237	>	* {@code removeAll}, {@code retainAll}, and {@code clear}
1238	>	* operations.
1239	>	*
1240	>	* <p>The view's iterators and spliterators are
1241	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
1242	>	*
1243	>	* <p>The view's {@code spliterator} reports {@link Spliterator#CONCURRENT},
1244	>	* {@link Spliterator#DISTINCT}, and {@link Spliterator#NONNULL}.
1245	>	*
1246	>	* @return the set view
1247	>	*/
1248	>	public Set<Map.Entry<K,V>> entrySet() {
1249	>	EntrySetView<K,V> es;
1250	>	return (es = entrySet) != null ? es : (entrySet = new EntrySetView<K,V>(this));
1251	>	}
1252	>
1253	>	/**
1254	>	* Returns the hash code value for this {@link Map}, i.e.,
1255	>	* the sum of, for each key-value pair in the map,
1256	>	* {@code key.hashCode() ^ value.hashCode()}.
1257	>	*
1258	>	* @return the hash code value for this map
1259	>	*/
1260	>	public int hashCode() {
1261	>	int h = 0;
1262	>	Node<K,V>[] t;
1263	>	if ((t = table) != null) {
1264	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1265	>	for (Node<K,V> p; (p = it.advance()) != null; )
1266	>	h += p.key.hashCode() ^ p.val.hashCode();
1267	>	}
1268	>	return h;
1269	>	}
1270	>
1271	>	/**
1272	>	* Returns a string representation of this map.  The string
1273	>	* representation consists of a list of key-value mappings (in no
1274	>	* particular order) enclosed in braces ("{@code {}}").  Adjacent
1275	>	* mappings are separated by the characters {@code ", "} (comma
1276	>	* and space).  Each key-value mapping is rendered as the key
1277	>	* followed by an equals sign ("{@code =}") followed by the
1278	>	* associated value.
1279	>	*
1280	>	* @return a string representation of this map
1281	>	*/
1282	>	public String toString() {
1283	>	Node<K,V>[] t;
1284	>	int f = (t = table) == null ? 0 : t.length;
1285	>	Traverser<K,V> it = new Traverser<K,V>(t, f, 0, f);
1286	>	StringBuilder sb = new StringBuilder();
1287	>	sb.append('{');
1288	>	Node<K,V> p;
1289	>	if ((p = it.advance()) != null) {
1290	>	for (;;) {
1291	>	K k = p.key;
1292	>	V v = p.val;
1293	>	sb.append(k == this ? "(this Map)" : k);
1294	>	sb.append('=');
1295	>	sb.append(v == this ? "(this Map)" : v);
1296	>	if ((p = it.advance()) == null)
1297	>	break;
1298	>	sb.append(',').append(' ');
1299	>	}
1300	>	}
1301	>	return sb.append('}').toString();
1302	>	}
1303	>
1304	>	/**
1305	>	* Compares the specified object with this map for equality.
1306	>	* Returns {@code true} if the given object is a map with the same
1307	>	* mappings as this map.  This operation may return misleading
1308	>	* results if either map is concurrently modified during execution
1309	>	* of this method.
1310	>	*
1311	>	* @param o object to be compared for equality with this map
1312	>	* @return {@code true} if the specified object is equal to this map
1313	>	*/
1314	>	public boolean equals(Object o) {
1315	>	if (o != this) {
1316	>	if (!(o instanceof Map))
1317	>	return false;
1318	>	Map<?,?> m = (Map<?,?>) o;
1319	>	Node<K,V>[] t;
1320	>	int f = (t = table) == null ? 0 : t.length;
1321	>	Traverser<K,V> it = new Traverser<K,V>(t, f, 0, f);
1322	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1323	>	V val = p.val;
1324	>	Object v = m.get(p.key);
1325	>	if (v == null || (v != val && !v.equals(val)))
1326	>	return false;
1327	>	}
1328	>	for (Map.Entry<?,?> e : m.entrySet()) {
1329	>	Object mk, mv, v;
1330	>	if ((mk = e.getKey()) == null ||
1331	>	(mv = e.getValue()) == null ||
1332	>	(v = get(mk)) == null ||
1333	>	(mv != v && !mv.equals(v)))
1334	>	return false;
1335	>	}
1336	>	}
1337	>	return true;
1338	>	}
1339	>
1340	>	/**
1341	>	* Stripped-down version of helper class used in previous version,
1342	>	* declared for the sake of serialization compatibility
1343	>	*/
1344	>	static class Segment<K,V> extends ReentrantLock implements Serializable {
1345	>	private static final long serialVersionUID = 2249069246763182397L;
1346	>	final float loadFactor;
1347	>	Segment(float lf) { this.loadFactor = lf; }
1348	>	}
1349	>
1350	>	/**
1351	>	* Saves the state of the {@code ConcurrentHashMap} instance to a
1352	>	* stream (i.e., serializes it).
1353	>	* @param s the stream
1354	>	* @throws java.io.IOException if an I/O error occurs
1355	>	* @serialData
1356	>	* the key (Object) and value (Object)
1357	>	* for each key-value mapping, followed by a null pair.
1358	>	* The key-value mappings are emitted in no particular order.
1359	>	*/
1360	>	private void writeObject(java.io.ObjectOutputStream s)
1361	>	throws java.io.IOException {
1362	>	// For serialization compatibility
1363	>	// Emulate segment calculation from previous version of this class
1364	>	int sshift = 0;
1365	>	int ssize = 1;
1366	>	while (ssize < DEFAULT_CONCURRENCY_LEVEL) {
1367	>	++sshift;
1368	>	ssize <<= 1;
1369	>	}
1370	>	int segmentShift = 32 - sshift;
1371	>	int segmentMask = ssize - 1;
1372	>	@SuppressWarnings("unchecked")
1373	>	Segment<K,V>[] segments = (Segment<K,V>[])
1374	>	new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
1375	>	for (int i = 0; i < segments.length; ++i)
1376	>	segments[i] = new Segment<K,V>(LOAD_FACTOR);
1377	>	java.io.ObjectOutputStream.PutField streamFields = s.putFields();
1378	>	streamFields.put("segments", segments);
1379	>	streamFields.put("segmentShift", segmentShift);
1380	>	streamFields.put("segmentMask", segmentMask);
1381	>	s.writeFields();
1382	>
1383	>	Node<K,V>[] t;
1384	>	if ((t = table) != null) {
1385	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1386	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1387	>	s.writeObject(p.key);
1388	>	s.writeObject(p.val);
1389	>	}
1390	>	}
1391	>	s.writeObject(null);
1392	>	s.writeObject(null);
1393	>	segments = null; // throw away
1394	>	}
1395	>
1396	>	/**
1397	>	* Reconstitutes the instance from a stream (that is, deserializes it).
1398	>	* @param s the stream
1399	>	* @throws ClassNotFoundException if the class of a serialized object
1400	>	*         could not be found
1401	>	* @throws java.io.IOException if an I/O error occurs
1402	>	*/
1403	>	private void readObject(java.io.ObjectInputStream s)
1404	>	throws java.io.IOException, ClassNotFoundException {
1405	>	/*
1406	>	* To improve performance in typical cases, we create nodes
1407	>	* while reading, then place in table once size is known.
1408	>	* However, we must also validate uniqueness and deal with
1409	>	* overpopulated bins while doing so, which requires
1410	>	* specialized versions of putVal mechanics.
1411	>	*/
1412	>	sizeCtl = -1; // force exclusion for table construction
1413	>	s.defaultReadObject();
1414	>	long size = 0L;
1415	>	Node<K,V> p = null;
1416	>	for (;;) {
1417	>	@SuppressWarnings("unchecked")
1418	>	K k = (K) s.readObject();
1419	>	@SuppressWarnings("unchecked")
1420	>	V v = (V) s.readObject();
1421	>	if (k != null && v != null) {
1422	>	p = new Node<K,V>(spread(k.hashCode()), k, v, p);
1423	>	++size;
1424	>	}
1425	>	else
1426	>	break;
1427	>	}
1428	>	if (size == 0L)
1429	>	sizeCtl = 0;
1430	>	else {
1431	>	int n;
1432	>	if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
1433	>	n = MAXIMUM_CAPACITY;
1434	>	else {
1435	>	int sz = (int)size;
1436	>	n = tableSizeFor(sz + (sz >>> 1) + 1);
1437	>	}
1438	>	@SuppressWarnings("unchecked")
1439	>	Node<K,V>[] tab = (Node<K,V>[])new Node<?,?>[n];
1440	>	int mask = n - 1;
1441	>	long added = 0L;
1442	>	while (p != null) {
1443	>	boolean insertAtFront;
1444	>	Node<K,V> next = p.next, first;
1445	>	int h = p.hash, j = h & mask;
1446	>	if ((first = tabAt(tab, j)) == null)
1447	>	insertAtFront = true;
1448	>	else {
1449	>	K k = p.key;
1450	>	if (first.hash < 0) {
1451	>	TreeBin<K,V> t = (TreeBin<K,V>)first;
1452	>	if (t.putTreeVal(h, k, p.val) == null)
1453	>	++added;
1454	>	insertAtFront = false;
1455	>	}
1456	>	else {
1457	>	int binCount = 0;
1458	>	insertAtFront = true;
1459	>	Node<K,V> q; K qk;
1460	>	for (q = first; q != null; q = q.next) {
1461	>	if (q.hash == h &&
1462	>	((qk = q.key) == k ||
1463	>	(qk != null && k.equals(qk)))) {
1464	>	insertAtFront = false;
1465	>	break;
1466	>	}
1467	>	++binCount;
1468	>	}
1469	>	if (insertAtFront && binCount >= TREEIFY_THRESHOLD) {
1470	>	insertAtFront = false;
1471	>	++added;
1472	>	p.next = first;
1473	>	TreeNode<K,V> hd = null, tl = null;
1474	>	for (q = p; q != null; q = q.next) {
1475	>	TreeNode<K,V> t = new TreeNode<K,V>
1476	>	(q.hash, q.key, q.val, null, null);
1477	>	if ((t.prev = tl) == null)
1478	>	hd = t;
1479	>	else
1480	>	tl.next = t;
1481	>	tl = t;
1482	>	}
1483	>	setTabAt(tab, j, new TreeBin<K,V>(hd));
1484	>	}
1485	>	}
1486	>	}
1487	>	if (insertAtFront) {
1488	>	++added;
1489	>	p.next = first;
1490	>	setTabAt(tab, j, p);
1491	>	}
1492	>	p = next;
1493	>	}
1494	>	table = tab;
1495	>	sizeCtl = n - (n >>> 2);
1496	>	baseCount = added;
1497	>	}
1498	>	}
1499	>
1500	>	// ConcurrentMap methods
1501	>
1502	>	/**
1503	>	* {@inheritDoc}
1504	>	*
1505	>	* @return the previous value associated with the specified key,
1506	>	*         or {@code null} if there was no mapping for the key
1507	>	* @throws NullPointerException if the specified key or value is null
1508	>	*/
1509	>	public V putIfAbsent(K key, V value) {
1510	>	return putVal(key, value, true);
1511	>	}
1512	>
1513	>	/**
1514	>	* {@inheritDoc}
1515	>	*
1516	>	* @throws NullPointerException if the specified key is null
1517	>	*/
1518	>	public boolean remove(Object key, Object value) {
1519	>	if (key == null)
1520	>	throw new NullPointerException();
1521	>	return value != null && replaceNode(key, null, value) != null;
1522	>	}
1523	>
1524	>	/**
1525	>	* {@inheritDoc}
1526	>	*
1527	>	* @throws NullPointerException if any of the arguments are null
1528	>	*/
1529	>	public boolean replace(K key, V oldValue, V newValue) {
1530	>	if (key == null || oldValue == null || newValue == null)
1531		throw new NullPointerException();
1532	<	return (V)internalPut(key, value);
1532	>	return replaceNode(key, newValue, oldValue) != null;
1533		}
1534
1535		/**
#	Line 2741 | Line 1539 | public class ConcurrentHashMap<K, V>
1539		*         or {@code null} if there was no mapping for the key
1540		* @throws NullPointerException if the specified key or value is null
1541		*/
1542	<	@SuppressWarnings("unchecked") public V putIfAbsent(K key, V value) {
1542	>	public V replace(K key, V value) {
1543		if (key == null || value == null)
1544		throw new NullPointerException();
1545	<	return (V)internalPutIfAbsent(key, value);
1545	>	return replaceNode(key, value, null);
1546		}
1547
1548	+	// Overrides of JDK8+ Map extension method defaults
1549	+
1550		/**
1551	<	* Copies all of the mappings from the specified map to this one.
1552	<	* These mappings replace any mappings that this map had for any of the
1553	<	* keys currently in the specified map.
1551	>	* Returns the value to which the specified key is mapped, or the
1552	>	* given default value if this map contains no mapping for the
1553	>	* key.
1554		*
1555	<	* @param m mappings to be stored in this map
1555	>	* @param key the key whose associated value is to be returned
1556	>	* @param defaultValue the value to return if this map contains
1557	>	* no mapping for the given key
1558	>	* @return the mapping for the key, if present; else the default value
1559	>	* @throws NullPointerException if the specified key is null
1560		*/
1561	<	public void putAll(Map<? extends K, ? extends V> m) {
1562	<	internalPutAll(m);
1561	>	public V getOrDefault(Object key, V defaultValue) {
1562	>	V v;
1563	>	return (v = get(key)) == null ? defaultValue : v;
1564	>	}
1565	>
1566	>	public void forEach(BiConsumer<? super K, ? super V> action) {
1567	>	if (action == null) throw new NullPointerException();
1568	>	Node<K,V>[] t;
1569	>	if ((t = table) != null) {
1570	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1571	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1572	>	action.accept(p.key, p.val);
1573	>	}
1574	>	}
1575	>	}
1576	>
1577	>	public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) {
1578	>	if (function == null) throw new NullPointerException();
1579	>	Node<K,V>[] t;
1580	>	if ((t = table) != null) {
1581	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1582	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1583	>	V oldValue = p.val;
1584	>	for (K key = p.key;;) {
1585	>	V newValue = function.apply(key, oldValue);
1586	>	if (newValue == null)
1587	>	throw new NullPointerException();
1588	>	if (replaceNode(key, newValue, oldValue) != null ||
1589	>	(oldValue = get(key)) == null)
1590	>	break;
1591	>	}
1592	>	}
1593	>	}
1594	>	}
1595	>
1596	>	/**
1597	>	* Helper method for EntrySet.removeIf
1598	>	*/
1599	>	boolean removeEntryIf(Predicate<? super Entry<K,V>> function) {
1600	>	if (function == null) throw new NullPointerException();
1601	>	Node<K,V>[] t;
1602	>	boolean removed = false;
1603	>	if ((t = table) != null) {
1604	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1605	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1606	>	K k = p.key;
1607	>	V v = p.val;
1608	>	Map.Entry<K,V> e = new AbstractMap.SimpleImmutableEntry<>(k, v);
1609	>	if (function.test(e) && replaceNode(k, null, v) != null)
1610	>	removed = true;
1611	>	}
1612	>	}
1613	>	return removed;
1614	>	}
1615	>
1616	>	/**
1617	>	* Helper method for Values.removeIf
1618	>	*/
1619	>	boolean removeValueIf(Predicate<? super  V> function) {
1620	>	if (function == null) throw new NullPointerException();
1621	>	Node<K,V>[] t;
1622	>	boolean removed = false;
1623	>	if ((t = table) != null) {
1624	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1625	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1626	>	K k = p.key;
1627	>	V v = p.val;
1628	>	if (function.test(v) && replaceNode(k, null, v) != null)
1629	>	removed = true;
1630	>	}
1631	>	}
1632	>	return removed;
1633		}
1634
1635		/**
1636		* If the specified key is not already associated with a value,
1637	<	* computes its value using the given mappingFunction and enters
1638	<	* it into the map unless null.  This is equivalent to
1639	<	* <pre> {@code
1640	<	* if (map.containsKey(key))
1641	<	*   return map.get(key);
1642	<	* value = mappingFunction.apply(key);
1643	<	* if (value != null)
2770	<	*   map.put(key, value);
2771	<	* return value;}</pre>
2772	<	*
2773	<	* except that the action is performed atomically.  If the
2774	<	* function returns {@code null} no mapping is recorded. If the
2775	<	* function itself throws an (unchecked) exception, the exception
2776	<	* is rethrown to its caller, and no mapping is recorded.  Some
2777	<	* attempted update operations on this map by other threads may be
2778	<	* blocked while computation is in progress, so the computation
2779	<	* should be short and simple, and must not attempt to update any
2780	<	* other mappings of this Map. The most appropriate usage is to
2781	<	* construct a new object serving as an initial mapped value, or
2782	<	* memoized result, as in:
2783	<	*
2784	<	*  <pre> {@code
2785	<	* map.computeIfAbsent(key, new Fun<K, V>() {
2786	<	*   public V map(K k) { return new Value(f(k)); }});}</pre>
1637	>	* attempts to compute its value using the given mapping function
1638	>	* and enters it into this map unless {@code null}.  The entire
1639	>	* method invocation is performed atomically, so the function is
1640	>	* applied at most once per key.  Some attempted update operations
1641	>	* on this map by other threads may be blocked while computation
1642	>	* is in progress, so the computation should be short and simple,
1643	>	* and must not attempt to update any other mappings of this map.
1644		*
1645		* @param key key with which the specified value is to be associated
1646		* @param mappingFunction the function to compute a value
#	Line 2797 | Line 1654 | public class ConcurrentHashMap<K, V>
1654		* @throws RuntimeException or Error if the mappingFunction does so,
1655		*         in which case the mapping is left unestablished
1656		*/
1657	<	@SuppressWarnings("unchecked") public V computeIfAbsent
2801	<	(K key, Fun<? super K, ? extends V> mappingFunction) {
1657	>	public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) {
1658		if (key == null || mappingFunction == null)
1659		throw new NullPointerException();
1660	<	return (V)internalComputeIfAbsent(key, mappingFunction);
1660	>	int h = spread(key.hashCode());
1661	>	V val = null;
1662	>	int binCount = 0;
1663	>	for (Node<K,V>[] tab = table;;) {
1664	>	Node<K,V> f; int n, i, fh;
1665	>	if (tab == null || (n = tab.length) == 0)
1666	>	tab = initTable();
1667	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null) {
1668	>	Node<K,V> r = new ReservationNode<K,V>();
1669	>	synchronized (r) {
1670	>	if (casTabAt(tab, i, null, r)) {
1671	>	binCount = 1;
1672	>	Node<K,V> node = null;
1673	>	try {
1674	>	if ((val = mappingFunction.apply(key)) != null)
1675	>	node = new Node<K,V>(h, key, val, null);
1676	>	} finally {
1677	>	setTabAt(tab, i, node);
1678	>	}
1679	>	}
1680	>	}
1681	>	if (binCount != 0)
1682	>	break;
1683	>	}
1684	>	else if ((fh = f.hash) == MOVED)
1685	>	tab = helpTransfer(tab, f);
1686	>	else {
1687	>	boolean added = false;
1688	>	synchronized (f) {
1689	>	if (tabAt(tab, i) == f) {
1690	>	if (fh >= 0) {
1691	>	binCount = 1;
1692	>	for (Node<K,V> e = f;; ++binCount) {
1693	>	K ek;
1694	>	if (e.hash == h &&
1695	>	((ek = e.key) == key ||
1696	>	(ek != null && key.equals(ek)))) {
1697	>	val = e.val;
1698	>	break;
1699	>	}
1700	>	Node<K,V> pred = e;
1701	>	if ((e = e.next) == null) {
1702	>	if ((val = mappingFunction.apply(key)) != null) {
1703	>	if (pred.next != null)
1704	>	throw new IllegalStateException("Recursive update");
1705	>	added = true;
1706	>	pred.next = new Node<K,V>(h, key, val, null);
1707	>	}
1708	>	break;
1709	>	}
1710	>	}
1711	>	}
1712	>	else if (f instanceof TreeBin) {
1713	>	binCount = 2;
1714	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1715	>	TreeNode<K,V> r, p;
1716	>	if ((r = t.root) != null &&
1717	>	(p = r.findTreeNode(h, key, null)) != null)
1718	>	val = p.val;
1719	>	else if ((val = mappingFunction.apply(key)) != null) {
1720	>	added = true;
1721	>	t.putTreeVal(h, key, val);
1722	>	}
1723	>	}
1724	>	else if (f instanceof ReservationNode)
1725	>	throw new IllegalStateException("Recursive update");
1726	>	}
1727	>	}
1728	>	if (binCount != 0) {
1729	>	if (binCount >= TREEIFY_THRESHOLD)
1730	>	treeifyBin(tab, i);
1731	>	if (!added)
1732	>	return val;
1733	>	break;
1734	>	}
1735	>	}
1736	>	}
1737	>	if (val != null)
1738	>	addCount(1L, binCount);
1739	>	return val;
1740		}
1741
1742		/**
1743	<	* If the given key is present, computes a new mapping value given a key and
1744	<	* its current mapped value. This is equivalent to
1745	<	*  <pre> {@code
1746	<	*   if (map.containsKey(key)) {
1747	<	*     value = remappingFunction.apply(key, map.get(key));
1748	<	*     if (value != null)
1749	<	*       map.put(key, value);
2815	<	*     else
2816	<	*       map.remove(key);
2817	<	*   }
2818	<	* }</pre>
2819	<	*
2820	<	* except that the action is performed atomically.  If the
2821	<	* function returns {@code null}, the mapping is removed.  If the
2822	<	* function itself throws an (unchecked) exception, the exception
2823	<	* is rethrown to its caller, and the current mapping is left
2824	<	* unchanged.  Some attempted update operations on this map by
2825	<	* other threads may be blocked while computation is in progress,
2826	<	* so the computation should be short and simple, and must not
2827	<	* attempt to update any other mappings of this Map. For example,
2828	<	* to either create or append new messages to a value mapping:
1743	>	* If the value for the specified key is present, attempts to
1744	>	* compute a new mapping given the key and its current mapped
1745	>	* value.  The entire method invocation is performed atomically.
1746	>	* Some attempted update operations on this map by other threads
1747	>	* may be blocked while computation is in progress, so the
1748	>	* computation should be short and simple, and must not attempt to
1749	>	* update any other mappings of this map.
1750		*
1751	<	* @param key key with which the specified value is to be associated
1751	>	* @param key key with which a value may be associated
1752		* @param remappingFunction the function to compute a value
1753		* @return the new value associated with the specified key, or null if none
1754		* @throws NullPointerException if the specified key or remappingFunction
#	Line 2838 | Line 1759 | public class ConcurrentHashMap<K, V>
1759		* @throws RuntimeException or Error if the remappingFunction does so,
1760		*         in which case the mapping is unchanged
1761		*/
1762	<	@SuppressWarnings("unchecked") public V computeIfPresent
2842	<	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
1762	>	public V computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) {
1763		if (key == null || remappingFunction == null)
1764		throw new NullPointerException();
1765	<	return (V)internalCompute(key, true, remappingFunction);
1765	>	int h = spread(key.hashCode());
1766	>	V val = null;
1767	>	int delta = 0;
1768	>	int binCount = 0;
1769	>	for (Node<K,V>[] tab = table;;) {
1770	>	Node<K,V> f; int n, i, fh;
1771	>	if (tab == null || (n = tab.length) == 0)
1772	>	tab = initTable();
1773	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null)
1774	>	break;
1775	>	else if ((fh = f.hash) == MOVED)
1776	>	tab = helpTransfer(tab, f);
1777	>	else {
1778	>	synchronized (f) {
1779	>	if (tabAt(tab, i) == f) {
1780	>	if (fh >= 0) {
1781	>	binCount = 1;
1782	>	for (Node<K,V> e = f, pred = null;; ++binCount) {
1783	>	K ek;
1784	>	if (e.hash == h &&
1785	>	((ek = e.key) == key ||
1786	>	(ek != null && key.equals(ek)))) {
1787	>	val = remappingFunction.apply(key, e.val);
1788	>	if (val != null)
1789	>	e.val = val;
1790	>	else {
1791	>	delta = -1;
1792	>	Node<K,V> en = e.next;
1793	>	if (pred != null)
1794	>	pred.next = en;
1795	>	else
1796	>	setTabAt(tab, i, en);
1797	>	}
1798	>	break;
1799	>	}
1800	>	pred = e;
1801	>	if ((e = e.next) == null)
1802	>	break;
1803	>	}
1804	>	}
1805	>	else if (f instanceof TreeBin) {
1806	>	binCount = 2;
1807	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1808	>	TreeNode<K,V> r, p;
1809	>	if ((r = t.root) != null &&
1810	>	(p = r.findTreeNode(h, key, null)) != null) {
1811	>	val = remappingFunction.apply(key, p.val);
1812	>	if (val != null)
1813	>	p.val = val;
1814	>	else {
1815	>	delta = -1;
1816	>	if (t.removeTreeNode(p))
1817	>	setTabAt(tab, i, untreeify(t.first));
1818	>	}
1819	>	}
1820	>	}
1821	>	else if (f instanceof ReservationNode)
1822	>	throw new IllegalStateException("Recursive update");
1823	>	}
1824	>	}
1825	>	if (binCount != 0)
1826	>	break;
1827	>	}
1828	>	}
1829	>	if (delta != 0)
1830	>	addCount((long)delta, binCount);
1831	>	return val;
1832		}
1833
1834		/**
1835	<	* Computes a new mapping value given a key and
1836	<	* its current mapped value (or {@code null} if there is no current
1837	<	* mapping). This is equivalent to
1838	<	*  <pre> {@code
1839	<	*   value = remappingFunction.apply(key, map.get(key));
1840	<	*   if (value != null)
1841	<	*     map.put(key, value);
2856	<	*   else
2857	<	*     map.remove(key);
2858	<	* }</pre>
2859	<	*
2860	<	* except that the action is performed atomically.  If the
2861	<	* function returns {@code null}, the mapping is removed.  If the
2862	<	* function itself throws an (unchecked) exception, the exception
2863	<	* is rethrown to its caller, and the current mapping is left
2864	<	* unchanged.  Some attempted update operations on this map by
2865	<	* other threads may be blocked while computation is in progress,
2866	<	* so the computation should be short and simple, and must not
2867	<	* attempt to update any other mappings of this Map. For example,
2868	<	* to either create or append new messages to a value mapping:
2869	<	*
2870	<	* <pre> {@code
2871	<	* Map<Key, String> map = ...;
2872	<	* final String msg = ...;
2873	<	* map.compute(key, new BiFun<Key, String, String>() {
2874	<	*   public String apply(Key k, String v) {
2875	<	*    return (v == null) ? msg : v + msg;});}}</pre>
1835	>	* Attempts to compute a mapping for the specified key and its
1836	>	* current mapped value (or {@code null} if there is no current
1837	>	* mapping). The entire method invocation is performed atomically.
1838	>	* Some attempted update operations on this map by other threads
1839	>	* may be blocked while computation is in progress, so the
1840	>	* computation should be short and simple, and must not attempt to
1841	>	* update any other mappings of this Map.
1842		*
1843		* @param key key with which the specified value is to be associated
1844		* @param remappingFunction the function to compute a value
#	Line 2885 | Line 1851 | public class ConcurrentHashMap<K, V>
1851		* @throws RuntimeException or Error if the remappingFunction does so,
1852		*         in which case the mapping is unchanged
1853		*/
1854	<	@SuppressWarnings("unchecked") public V compute
1855	<	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
1854	>	public V compute(K key,
1855	>	BiFunction<? super K, ? super V, ? extends V> remappingFunction) {
1856		if (key == null || remappingFunction == null)
1857		throw new NullPointerException();
1858	<	return (V)internalCompute(key, false, remappingFunction);
1858	>	int h = spread(key.hashCode());
1859	>	V val = null;
1860	>	int delta = 0;
1861	>	int binCount = 0;
1862	>	for (Node<K,V>[] tab = table;;) {
1863	>	Node<K,V> f; int n, i, fh;
1864	>	if (tab == null || (n = tab.length) == 0)
1865	>	tab = initTable();
1866	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null) {
1867	>	Node<K,V> r = new ReservationNode<K,V>();
1868	>	synchronized (r) {
1869	>	if (casTabAt(tab, i, null, r)) {
1870	>	binCount = 1;
1871	>	Node<K,V> node = null;
1872	>	try {
1873	>	if ((val = remappingFunction.apply(key, null)) != null) {
1874	>	delta = 1;
1875	>	node = new Node<K,V>(h, key, val, null);
1876	>	}
1877	>	} finally {
1878	>	setTabAt(tab, i, node);
1879	>	}
1880	>	}
1881	>	}
1882	>	if (binCount != 0)
1883	>	break;
1884	>	}
1885	>	else if ((fh = f.hash) == MOVED)
1886	>	tab = helpTransfer(tab, f);
1887	>	else {
1888	>	synchronized (f) {
1889	>	if (tabAt(tab, i) == f) {
1890	>	if (fh >= 0) {
1891	>	binCount = 1;
1892	>	for (Node<K,V> e = f, pred = null;; ++binCount) {
1893	>	K ek;
1894	>	if (e.hash == h &&
1895	>	((ek = e.key) == key ||
1896	>	(ek != null && key.equals(ek)))) {
1897	>	val = remappingFunction.apply(key, e.val);
1898	>	if (val != null)
1899	>	e.val = val;
1900	>	else {
1901	>	delta = -1;
1902	>	Node<K,V> en = e.next;
1903	>	if (pred != null)
1904	>	pred.next = en;
1905	>	else
1906	>	setTabAt(tab, i, en);
1907	>	}
1908	>	break;
1909	>	}
1910	>	pred = e;
1911	>	if ((e = e.next) == null) {
1912	>	val = remappingFunction.apply(key, null);
1913	>	if (val != null) {
1914	>	if (pred.next != null)
1915	>	throw new IllegalStateException("Recursive update");
1916	>	delta = 1;
1917	>	pred.next =
1918	>	new Node<K,V>(h, key, val, null);
1919	>	}
1920	>	break;
1921	>	}
1922	>	}
1923	>	}
1924	>	else if (f instanceof TreeBin) {
1925	>	binCount = 1;
1926	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1927	>	TreeNode<K,V> r, p;
1928	>	if ((r = t.root) != null)
1929	>	p = r.findTreeNode(h, key, null);
1930	>	else
1931	>	p = null;
1932	>	V pv = (p == null) ? null : p.val;
1933	>	val = remappingFunction.apply(key, pv);
1934	>	if (val != null) {
1935	>	if (p != null)
1936	>	p.val = val;
1937	>	else {
1938	>	delta = 1;
1939	>	t.putTreeVal(h, key, val);
1940	>	}
1941	>	}
1942	>	else if (p != null) {
1943	>	delta = -1;
1944	>	if (t.removeTreeNode(p))
1945	>	setTabAt(tab, i, untreeify(t.first));
1946	>	}
1947	>	}
1948	>	else if (f instanceof ReservationNode)
1949	>	throw new IllegalStateException("Recursive update");
1950	>	}
1951	>	}
1952	>	if (binCount != 0) {
1953	>	if (binCount >= TREEIFY_THRESHOLD)
1954	>	treeifyBin(tab, i);
1955	>	break;
1956	>	}
1957	>	}
1958	>	}
1959	>	if (delta != 0)
1960	>	addCount((long)delta, binCount);
1961	>	return val;
1962		}
1963
1964		/**
1965	<	* If the specified key is not already associated
1966	<	* with a value, associate it with the given value.
1967	<	* Otherwise, replace the value with the results of
1968	<	* the given remapping function. This is equivalent to:
1969	<	*  <pre> {@code
1970	<	*   if (!map.containsKey(key))
1971	<	*     map.put(value);
1972	<	*   else {
1973	<	*     newValue = remappingFunction.apply(map.get(key), value);
1974	<	*     if (value != null)
1975	<	*       map.put(key, value);
1976	<	*     else
1977	<	*       map.remove(key);
1978	<	*   }
1979	<	* }</pre>
1980	<	* except that the action is performed atomically.  If the
1981	<	* function returns {@code null}, the mapping is removed.  If the
1982	<	* function itself throws an (unchecked) exception, the exception
2914	<	* is rethrown to its caller, and the current mapping is left
2915	<	* unchanged.  Some attempted update operations on this map by
2916	<	* other threads may be blocked while computation is in progress,
2917	<	* so the computation should be short and simple, and must not
2918	<	* attempt to update any other mappings of this Map.
1965	>	* If the specified key is not already associated with a
1966	>	* (non-null) value, associates it with the given value.
1967	>	* Otherwise, replaces the value with the results of the given
1968	>	* remapping function, or removes if {@code null}. The entire
1969	>	* method invocation is performed atomically.  Some attempted
1970	>	* update operations on this map by other threads may be blocked
1971	>	* while computation is in progress, so the computation should be
1972	>	* short and simple, and must not attempt to update any other
1973	>	* mappings of this Map.
1974	>	*
1975	>	* @param key key with which the specified value is to be associated
1976	>	* @param value the value to use if absent
1977	>	* @param remappingFunction the function to recompute a value if present
1978	>	* @return the new value associated with the specified key, or null if none
1979	>	* @throws NullPointerException if the specified key or the
1980	>	*         remappingFunction is null
1981	>	* @throws RuntimeException or Error if the remappingFunction does so,
1982	>	*         in which case the mapping is unchanged
1983		*/
1984	<	@SuppressWarnings("unchecked") public V merge
2921	<	(K key, V value, BiFun<? super V, ? super V, ? extends V> remappingFunction) {
1984	>	public V merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
1985		if (key == null || value == null || remappingFunction == null)
1986		throw new NullPointerException();
1987	<	return (V)internalMerge(key, value, remappingFunction);
1987	>	int h = spread(key.hashCode());
1988	>	V val = null;
1989	>	int delta = 0;
1990	>	int binCount = 0;
1991	>	for (Node<K,V>[] tab = table;;) {
1992	>	Node<K,V> f; int n, i, fh;
1993	>	if (tab == null || (n = tab.length) == 0)
1994	>	tab = initTable();
1995	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null) {
1996	>	if (casTabAt(tab, i, null, new Node<K,V>(h, key, value, null))) {
1997	>	delta = 1;
1998	>	val = value;
1999	>	break;
2000	>	}
2001	>	}
2002	>	else if ((fh = f.hash) == MOVED)
2003	>	tab = helpTransfer(tab, f);
2004	>	else {
2005	>	synchronized (f) {
2006	>	if (tabAt(tab, i) == f) {
2007	>	if (fh >= 0) {
2008	>	binCount = 1;
2009	>	for (Node<K,V> e = f, pred = null;; ++binCount) {
2010	>	K ek;
2011	>	if (e.hash == h &&
2012	>	((ek = e.key) == key ||
2013	>	(ek != null && key.equals(ek)))) {
2014	>	val = remappingFunction.apply(e.val, value);
2015	>	if (val != null)
2016	>	e.val = val;
2017	>	else {
2018	>	delta = -1;
2019	>	Node<K,V> en = e.next;
2020	>	if (pred != null)
2021	>	pred.next = en;
2022	>	else
2023	>	setTabAt(tab, i, en);
2024	>	}
2025	>	break;
2026	>	}
2027	>	pred = e;
2028	>	if ((e = e.next) == null) {
2029	>	delta = 1;
2030	>	val = value;
2031	>	pred.next =
2032	>	new Node<K,V>(h, key, val, null);
2033	>	break;
2034	>	}
2035	>	}
2036	>	}
2037	>	else if (f instanceof TreeBin) {
2038	>	binCount = 2;
2039	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
2040	>	TreeNode<K,V> r = t.root;
2041	>	TreeNode<K,V> p = (r == null) ? null :
2042	>	r.findTreeNode(h, key, null);
2043	>	val = (p == null) ? value :
2044	>	remappingFunction.apply(p.val, value);
2045	>	if (val != null) {
2046	>	if (p != null)
2047	>	p.val = val;
2048	>	else {
2049	>	delta = 1;
2050	>	t.putTreeVal(h, key, val);
2051	>	}
2052	>	}
2053	>	else if (p != null) {
2054	>	delta = -1;
2055	>	if (t.removeTreeNode(p))
2056	>	setTabAt(tab, i, untreeify(t.first));
2057	>	}
2058	>	}
2059	>	else if (f instanceof ReservationNode)
2060	>	throw new IllegalStateException("Recursive update");
2061	>	}
2062	>	}
2063	>	if (binCount != 0) {
2064	>	if (binCount >= TREEIFY_THRESHOLD)
2065	>	treeifyBin(tab, i);
2066	>	break;
2067	>	}
2068	>	}
2069	>	}
2070	>	if (delta != 0)
2071	>	addCount((long)delta, binCount);
2072	>	return val;
2073		}
2074
2075	+	// Hashtable legacy methods
2076	+
2077		/**
2078	<	* Removes the key (and its corresponding value) from this map.
2079	<	* This method does nothing if the key is not in the map.
2078	>	* Legacy method testing if some key maps into the specified value
2079	>	* in this table.
2080		*
2081	<	* @param  key the key that needs to be removed
2082	<	* @return the previous value associated with {@code key}, or
2083	<	*         {@code null} if there was no mapping for {@code key}
2084	<	* @throws NullPointerException if the specified key is null
2081	>	* @deprecated This method is identical in functionality to
2082	>	* {@link #containsValue(Object)}, and exists solely to ensure
2083	>	* full compatibility with class {@link java.util.Hashtable},
2084	>	* which supported this method prior to introduction of the
2085	>	* Java Collections framework.
2086	>	*
2087	>	* @param  value a value to search for
2088	>	* @return {@code true} if and only if some key maps to the
2089	>	*         {@code value} argument in this table as
2090	>	*         determined by the {@code equals} method;
2091	>	*         {@code false} otherwise
2092	>	* @throws NullPointerException if the specified value is null
2093		*/
2094	<	@SuppressWarnings("unchecked") public V remove(Object key) {
2095	<	if (key == null)
2096	<	throw new NullPointerException();
2939	<	return (V)internalReplace(key, null, null);
2094	>	@Deprecated
2095	>	public boolean contains(Object value) {
2096	>	return containsValue(value);
2097		}
2098
2099		/**
2100	<	* {@inheritDoc}
2100	>	* Returns an enumeration of the keys in this table.
2101		*
2102	<	* @throws NullPointerException if the specified key is null
2102	>	* @return an enumeration of the keys in this table
2103	>	* @see #keySet()
2104		*/
2105	<	public boolean remove(Object key, Object value) {
2106	<	if (key == null)
2107	<	throw new NullPointerException();
2108	<	if (value == null)
2951	<	return false;
2952	<	return internalReplace(key, null, value) != null;
2105	>	public Enumeration<K> keys() {
2106	>	Node<K,V>[] t;
2107	>	int f = (t = table) == null ? 0 : t.length;
2108	>	return new KeyIterator<K,V>(t, f, 0, f, this);
2109		}
2110
2111		/**
2112	<	* {@inheritDoc}
2112	>	* Returns an enumeration of the values in this table.
2113		*
2114	<	* @throws NullPointerException if any of the arguments are null
2114	>	* @return an enumeration of the values in this table
2115	>	* @see #values()
2116		*/
2117	<	public boolean replace(K key, V oldValue, V newValue) {
2118	<	if (key == null || oldValue == null || newValue == null)
2119	<	throw new NullPointerException();
2120	<	return internalReplace(key, newValue, oldValue) != null;
2117	>	public Enumeration<V> elements() {
2118	>	Node<K,V>[] t;
2119	>	int f = (t = table) == null ? 0 : t.length;
2120	>	return new ValueIterator<K,V>(t, f, 0, f, this);
2121		}
2122
2123	+	// ConcurrentHashMap-only methods
2124	+
2125		/**
2126	<	* {@inheritDoc}
2126	>	* Returns the number of mappings. This method should be used
2127	>	* instead of {@link #size} because a ConcurrentHashMap may
2128	>	* contain more mappings than can be represented as an int. The
2129	>	* value returned is an estimate; the actual count may differ if
2130	>	* there are concurrent insertions or removals.
2131		*
2132	<	* @return the previous value associated with the specified key,
2133	<	*         or {@code null} if there was no mapping for the key
2971	<	* @throws NullPointerException if the specified key or value is null
2132	>	* @return the number of mappings
2133	>	* @since 1.8
2134		*/
2135	<	@SuppressWarnings("unchecked") public V replace(K key, V value) {
2136	<	if (key == null || value == null)
2137	<	throw new NullPointerException();
2976	<	return (V)internalReplace(key, value, null);
2135	>	public long mappingCount() {
2136	>	long n = sumCount();
2137	>	return (n < 0L) ? 0L : n; // ignore transient negative values
2138		}
2139
2140		/**
2141	<	* Removes all of the mappings from this map.
2141	>	* Creates a new {@link Set} backed by a ConcurrentHashMap
2142	>	* from the given type to {@code Boolean.TRUE}.
2143	>	*
2144	>	* @param <K> the element type of the returned set
2145	>	* @return the new set
2146	>	* @since 1.8
2147		*/
2148	<	public void clear() {
2149	<	internalClear();
2148	>	public static <K> KeySetView<K,Boolean> newKeySet() {
2149	>	return new KeySetView<K,Boolean>
2150	>	(new ConcurrentHashMap<K,Boolean>(), Boolean.TRUE);
2151		}
2152
2153		/**
2154	<	* Returns a {@link Set} view of the keys contained in this map.
2155	<	* The set is backed by the map, so changes to the map are
2989	<	* reflected in the set, and vice-versa.
2154	>	* Creates a new {@link Set} backed by a ConcurrentHashMap
2155	>	* from the given type to {@code Boolean.TRUE}.
2156		*
2157	<	* @return the set view
2157	>	* @param initialCapacity The implementation performs internal
2158	>	* sizing to accommodate this many elements.
2159	>	* @param <K> the element type of the returned set
2160	>	* @return the new set
2161	>	* @throws IllegalArgumentException if the initial capacity of
2162	>	* elements is negative
2163	>	* @since 1.8
2164		*/
2165	<	public KeySetView<K,V> keySet() {
2166	<	KeySetView<K,V> ks = keySet;
2167	<	return (ks != null) ? ks : (keySet = new KeySetView<K,V>(this, null));
2165	>	public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
2166	>	return new KeySetView<K,Boolean>
2167	>	(new ConcurrentHashMap<K,Boolean>(initialCapacity), Boolean.TRUE);
2168		}
2169
2170		/**
2171		* Returns a {@link Set} view of the keys in this map, using the
2172		* given common mapped value for any additions (i.e., {@link
2173	<	* Collection#add} and {@link Collection#addAll}). This is of
2174	<	* course only appropriate if it is acceptable to use the same
2175	<	* value for all additions from this view.
2173	>	* Collection#add} and {@link Collection#addAll(Collection)}).
2174	>	* This is of course only appropriate if it is acceptable to use
2175	>	* the same value for all additions from this view.
2176		*
2177	<	* @param mappedValue the mapped value to use for any
3006	<	* additions.
2177	>	* @param mappedValue the mapped value to use for any additions
2178		* @return the set view
2179		* @throws NullPointerException if the mappedValue is null
2180		*/
#	Line 3013 | Line 2184 | public class ConcurrentHashMap<K, V>
2184		return new KeySetView<K,V>(this, mappedValue);
2185		}
2186
2187	+	/* ---------------- Special Nodes -------------- */
2188	+
2189		/**
2190	<	* Returns a {@link Collection} view of the values contained in this map.
3018	<	* The collection is backed by the map, so changes to the map are
3019	<	* reflected in the collection, and vice-versa.
2190	>	* A node inserted at head of bins during transfer operations.
2191		*/
2192	<	public ValuesView<K,V> values() {
2193	<	ValuesView<K,V> vs = values;
2194	<	return (vs != null) ? vs : (values = new ValuesView<K,V>(this));
2192	>	static final class ForwardingNode<K,V> extends Node<K,V> {
2193	>	final Node<K,V>[] nextTable;
2194	>	ForwardingNode(Node<K,V>[] tab) {
2195	>	super(MOVED, null, null, null);
2196	>	this.nextTable = tab;
2197	>	}
2198	>
2199	>	Node<K,V> find(int h, Object k) {
2200	>	// loop to avoid arbitrarily deep recursion on forwarding nodes
2201	>	outer: for (Node<K,V>[] tab = nextTable;;) {
2202	>	Node<K,V> e; int n;
2203	>	if (k == null || tab == null || (n = tab.length) == 0 ||
2204	>	(e = tabAt(tab, (n - 1) & h)) == null)
2205	>	return null;
2206	>	for (;;) {
2207	>	int eh; K ek;
2208	>	if ((eh = e.hash) == h &&
2209	>	((ek = e.key) == k || (ek != null && k.equals(ek))))
2210	>	return e;
2211	>	if (eh < 0) {
2212	>	if (e instanceof ForwardingNode) {
2213	>	tab = ((ForwardingNode<K,V>)e).nextTable;
2214	>	continue outer;
2215	>	}
2216	>	else
2217	>	return e.find(h, k);
2218	>	}
2219	>	if ((e = e.next) == null)
2220	>	return null;
2221	>	}
2222	>	}
2223	>	}
2224		}
2225
2226		/**
2227	<	* Returns a {@link Set} view of the mappings contained in this map.
3028	<	* The set is backed by the map, so changes to the map are
3029	<	* reflected in the set, and vice-versa.  The set supports element
3030	<	* removal, which removes the corresponding mapping from the map,
3031	<	* via the {@code Iterator.remove}, {@code Set.remove},
3032	<	* {@code removeAll}, {@code retainAll}, and {@code clear}
3033	<	* operations.  It does not support the {@code add} or
3034	<	* {@code addAll} operations.
3035	<	*
3036	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
3037	<	* that will never throw {@link ConcurrentModificationException},
3038	<	* and guarantees to traverse elements as they existed upon
3039	<	* construction of the iterator, and may (but is not guaranteed to)
3040	<	* reflect any modifications subsequent to construction.
2227	>	* A place-holder node used in computeIfAbsent and compute
2228		*/
2229	<	public Set<Map.Entry<K,V>> entrySet() {
2230	<	EntrySetView<K,V> es = entrySet;
2231	<	return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this));
2229	>	static final class ReservationNode<K,V> extends Node<K,V> {
2230	>	ReservationNode() {
2231	>	super(RESERVED, null, null, null);
2232	>	}
2233	>
2234	>	Node<K,V> find(int h, Object k) {
2235	>	return null;
2236	>	}
2237		}
2238
2239	+	/* ---------------- Table Initialization and Resizing -------------- */
2240	+
2241		/**
2242	<	* Returns an enumeration of the keys in this table.
2243	<	*
3050	<	* @return an enumeration of the keys in this table
3051	<	* @see #keySet()
2242	>	* Returns the stamp bits for resizing a table of size n.
2243	>	* Must be negative when shifted left by RESIZE_STAMP_SHIFT.
2244		*/
2245	<	public Enumeration<K> keys() {
2246	<	return new KeyIterator<K,V>(this);
2245	>	static final int resizeStamp(int n) {
2246	>	return Integer.numberOfLeadingZeros(n) | (1 << (RESIZE_STAMP_BITS - 1));
2247		}
2248
2249		/**
2250	<	* Returns an enumeration of the values in this table.
3059	<	*
3060	<	* @return an enumeration of the values in this table
3061	<	* @see #values()
2250	>	* Initializes table, using the size recorded in sizeCtl.
2251		*/
2252	<	public Enumeration<V> elements() {
2253	<	return new ValueIterator<K,V>(this);
2252	>	private final Node<K,V>[] initTable() {
2253	>	Node<K,V>[] tab; int sc;
2254	>	while ((tab = table) == null || tab.length == 0) {
2255	>	if ((sc = sizeCtl) < 0)
2256	>	Thread.yield(); // lost initialization race; just spin
2257	>	else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
2258	>	try {
2259	>	if ((tab = table) == null || tab.length == 0) {
2260	>	int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
2261	>	@SuppressWarnings("unchecked")
2262	>	Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
2263	>	table = tab = nt;
2264	>	sc = n - (n >>> 2);
2265	>	}
2266	>	} finally {
2267	>	sizeCtl = sc;
2268	>	}
2269	>	break;
2270	>	}
2271	>	}
2272	>	return tab;
2273		}
2274
2275		/**
2276	<	* Returns a partitionable iterator of the keys in this map.
2277	<	*
2278	<	* @return a partitionable iterator of the keys in this map
2276	>	* Adds to count, and if table is too small and not already
2277	>	* resizing, initiates transfer. If already resizing, helps
2278	>	* perform transfer if work is available.  Rechecks occupancy
2279	>	* after a transfer to see if another resize is already needed
2280	>	* because resizings are lagging additions.
2281	>	*
2282	>	* @param x the count to add
2283	>	* @param check if <0, don't check resize, if <= 1 only check if uncontended
2284	>	*/
2285	>	private final void addCount(long x, int check) {
2286	>	CounterCell[] as; long b, s;
2287	>	if ((as = counterCells) != null ||
2288	>	!U.compareAndSwapLong(this, BASECOUNT, b = baseCount, s = b + x)) {
2289	>	CounterCell a; long v; int m;
2290	>	boolean uncontended = true;
2291	>	if (as == null || (m = as.length - 1) < 0 ||
2292	>	(a = as[ThreadLocalRandom.getProbe() & m]) == null ||
2293	>	!(uncontended =
2294	>	U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))) {
2295	>	fullAddCount(x, uncontended);
2296	>	return;
2297	>	}
2298	>	if (check <= 1)
2299	>	return;
2300	>	s = sumCount();
2301	>	}
2302	>	if (check >= 0) {
2303	>	Node<K,V>[] tab, nt; int n, sc;
2304	>	while (s >= (long)(sc = sizeCtl) && (tab = table) != null &&
2305	>	(n = tab.length) < MAXIMUM_CAPACITY) {
2306	>	int rs = resizeStamp(n);
2307	>	if (sc < 0) {
2308	>	if ((sc >>> RESIZE_STAMP_SHIFT) != rs || sc == rs + 1 ||
2309	>	sc == rs + MAX_RESIZERS || (nt = nextTable) == null ||
2310	>	transferIndex <= 0)
2311	>	break;
2312	>	if (U.compareAndSwapInt(this, SIZECTL, sc, sc + 1))
2313	>	transfer(tab, nt);
2314	>	}
2315	>	else if (U.compareAndSwapInt(this, SIZECTL, sc,
2316	>	(rs << RESIZE_STAMP_SHIFT) + 2))
2317	>	transfer(tab, null);
2318	>	s = sumCount();
2319	>	}
2320	>	}
2321	>	}
2322	>
2323	>	/**
2324	>	* Helps transfer if a resize is in progress.
2325		*/
2326	<	public Spliterator<K> keySpliterator() {
2327	<	return new KeyIterator<K,V>(this);
2326	>	final Node<K,V>[] helpTransfer(Node<K,V>[] tab, Node<K,V> f) {
2327	>	Node<K,V>[] nextTab; int sc;
2328	>	if (tab != null && (f instanceof ForwardingNode) &&
2329	>	(nextTab = ((ForwardingNode<K,V>)f).nextTable) != null) {
2330	>	int rs = resizeStamp(tab.length);
2331	>	while (nextTab == nextTable && table == tab &&
2332	>	(sc = sizeCtl) < 0) {
2333	>	if ((sc >>> RESIZE_STAMP_SHIFT) != rs || sc == rs + 1 ||
2334	>	sc == rs + MAX_RESIZERS || transferIndex <= 0)
2335	>	break;
2336	>	if (U.compareAndSwapInt(this, SIZECTL, sc, sc + 1)) {
2337	>	transfer(tab, nextTab);
2338	>	break;
2339	>	}
2340	>	}
2341	>	return nextTab;
2342	>	}
2343	>	return table;
2344		}
2345
2346		/**
2347	<	* Returns a partitionable iterator of the values in this map.
2347	>	* Tries to presize table to accommodate the given number of elements.
2348		*
2349	<	* @return a partitionable iterator of the values in this map
2349	>	* @param size number of elements (doesn't need to be perfectly accurate)
2350		*/
2351	<	public Spliterator<V> valueSpliterator() {
2352	<	return new ValueIterator<K,V>(this);
2351	>	private final void tryPresize(int size) {
2352	>	int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
2353	>	tableSizeFor(size + (size >>> 1) + 1);
2354	>	int sc;
2355	>	while ((sc = sizeCtl) >= 0) {
2356	>	Node<K,V>[] tab = table; int n;
2357	>	if (tab == null || (n = tab.length) == 0) {
2358	>	n = (sc > c) ? sc : c;
2359	>	if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
2360	>	try {
2361	>	if (table == tab) {
2362	>	@SuppressWarnings("unchecked")
2363	>	Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
2364	>	table = nt;
2365	>	sc = n - (n >>> 2);
2366	>	}
2367	>	} finally {
2368	>	sizeCtl = sc;
2369	>	}
2370	>	}
2371	>	}
2372	>	else if (c <= sc || n >= MAXIMUM_CAPACITY)
2373	>	break;
2374	>	else if (tab == table) {
2375	>	int rs = resizeStamp(n);
2376	>	if (U.compareAndSwapInt(this, SIZECTL, sc,
2377	>	(rs << RESIZE_STAMP_SHIFT) + 2))
2378	>	transfer(tab, null);
2379	>	}
2380	>	}
2381		}
2382
2383		/**
2384	<	* Returns a partitionable iterator of the entries in this map.
2385	<	*
2386	<	* @return a partitionable iterator of the entries in this map
2384	>	* Moves and/or copies the nodes in each bin to new table. See
2385	>	* above for explanation.
2386	>	*/
2387	>	private final void transfer(Node<K,V>[] tab, Node<K,V>[] nextTab) {
2388	>	int n = tab.length, stride;
2389	>	if ((stride = (NCPU > 1) ? (n >>> 3) / NCPU : n) < MIN_TRANSFER_STRIDE)
2390	>	stride = MIN_TRANSFER_STRIDE; // subdivide range
2391	>	if (nextTab == null) {            // initiating
2392	>	try {
2393	>	@SuppressWarnings("unchecked")
2394	>	Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n << 1];
2395	>	nextTab = nt;
2396	>	} catch (Throwable ex) {      // try to cope with OOME
2397	>	sizeCtl = Integer.MAX_VALUE;
2398	>	return;
2399	>	}
2400	>	nextTable = nextTab;
2401	>	transferIndex = n;
2402	>	}
2403	>	int nextn = nextTab.length;
2404	>	ForwardingNode<K,V> fwd = new ForwardingNode<K,V>(nextTab);
2405	>	boolean advance = true;
2406	>	boolean finishing = false; // to ensure sweep before committing nextTab
2407	>	for (int i = 0, bound = 0;;) {
2408	>	Node<K,V> f; int fh;
2409	>	while (advance) {
2410	>	int nextIndex, nextBound;
2411	>	if (--i >= bound || finishing)
2412	>	advance = false;
2413	>	else if ((nextIndex = transferIndex) <= 0) {
2414	>	i = -1;
2415	>	advance = false;
2416	>	}
2417	>	else if (U.compareAndSwapInt
2418	>	(this, TRANSFERINDEX, nextIndex,
2419	>	nextBound = (nextIndex > stride ?
2420	>	nextIndex - stride : 0))) {
2421	>	bound = nextBound;
2422	>	i = nextIndex - 1;
2423	>	advance = false;
2424	>	}
2425	>	}
2426	>	if (i < 0 || i >= n || i + n >= nextn) {
2427	>	int sc;
2428	>	if (finishing) {
2429	>	nextTable = null;
2430	>	table = nextTab;
2431	>	sizeCtl = (n << 1) - (n >>> 1);
2432	>	return;
2433	>	}
2434	>	if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, sc - 1)) {
2435	>	if ((sc - 2) != resizeStamp(n) << RESIZE_STAMP_SHIFT)
2436	>	return;
2437	>	finishing = advance = true;
2438	>	i = n; // recheck before commit
2439	>	}
2440	>	}
2441	>	else if ((f = tabAt(tab, i)) == null)
2442	>	advance = casTabAt(tab, i, null, fwd);
2443	>	else if ((fh = f.hash) == MOVED)
2444	>	advance = true; // already processed
2445	>	else {
2446	>	synchronized (f) {
2447	>	if (tabAt(tab, i) == f) {
2448	>	Node<K,V> ln, hn;
2449	>	if (fh >= 0) {
2450	>	int runBit = fh & n;
2451	>	Node<K,V> lastRun = f;
2452	>	for (Node<K,V> p = f.next; p != null; p = p.next) {
2453	>	int b = p.hash & n;
2454	>	if (b != runBit) {
2455	>	runBit = b;
2456	>	lastRun = p;
2457	>	}
2458	>	}
2459	>	if (runBit == 0) {
2460	>	ln = lastRun;
2461	>	hn = null;
2462	>	}
2463	>	else {
2464	>	hn = lastRun;
2465	>	ln = null;
2466	>	}
2467	>	for (Node<K,V> p = f; p != lastRun; p = p.next) {
2468	>	int ph = p.hash; K pk = p.key; V pv = p.val;
2469	>	if ((ph & n) == 0)
2470	>	ln = new Node<K,V>(ph, pk, pv, ln);
2471	>	else
2472	>	hn = new Node<K,V>(ph, pk, pv, hn);
2473	>	}
2474	>	setTabAt(nextTab, i, ln);
2475	>	setTabAt(nextTab, i + n, hn);
2476	>	setTabAt(tab, i, fwd);
2477	>	advance = true;
2478	>	}
2479	>	else if (f instanceof TreeBin) {
2480	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
2481	>	TreeNode<K,V> lo = null, loTail = null;
2482	>	TreeNode<K,V> hi = null, hiTail = null;
2483	>	int lc = 0, hc = 0;
2484	>	for (Node<K,V> e = t.first; e != null; e = e.next) {
2485	>	int h = e.hash;
2486	>	TreeNode<K,V> p = new TreeNode<K,V>
2487	>	(h, e.key, e.val, null, null);
2488	>	if ((h & n) == 0) {
2489	>	if ((p.prev = loTail) == null)
2490	>	lo = p;
2491	>	else
2492	>	loTail.next = p;
2493	>	loTail = p;
2494	>	++lc;
2495	>	}
2496	>	else {
2497	>	if ((p.prev = hiTail) == null)
2498	>	hi = p;
2499	>	else
2500	>	hiTail.next = p;
2501	>	hiTail = p;
2502	>	++hc;
2503	>	}
2504	>	}
2505	>	ln = (lc <= UNTREEIFY_THRESHOLD) ? untreeify(lo) :
2506	>	(hc != 0) ? new TreeBin<K,V>(lo) : t;
2507	>	hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) :
2508	>	(lc != 0) ? new TreeBin<K,V>(hi) : t;
2509	>	setTabAt(nextTab, i, ln);
2510	>	setTabAt(nextTab, i + n, hn);
2511	>	setTabAt(tab, i, fwd);
2512	>	advance = true;
2513	>	}
2514	>	}
2515	>	}
2516	>	}
2517	>	}
2518	>	}
2519	>
2520	>	/* ---------------- Counter support -------------- */
2521	>
2522	>	/**
2523	>	* A padded cell for distributing counts.  Adapted from LongAdder
2524	>	* and Striped64.  See their internal docs for explanation.
2525		*/
2526	<	public Spliterator<Map.Entry<K,V>> entrySpliterator() {
2527	<	return new EntryIterator<K,V>(this);
2526	>	@sun.misc.Contended static final class CounterCell {
2527	>	volatile long value;
2528	>	CounterCell(long x) { value = x; }
2529		}
2530
2531	+	final long sumCount() {
2532	+	CounterCell[] as = counterCells; CounterCell a;
2533	+	long sum = baseCount;
2534	+	if (as != null) {
2535	+	for (int i = 0; i < as.length; ++i) {
2536	+	if ((a = as[i]) != null)
2537	+	sum += a.value;
2538	+	}
2539	+	}
2540	+	return sum;
2541	+	}
2542	+
2543	+	// See LongAdder version for explanation
2544	+	private final void fullAddCount(long x, boolean wasUncontended) {
2545	+	int h;
2546	+	if ((h = ThreadLocalRandom.getProbe()) == 0) {
2547	+	ThreadLocalRandom.localInit();      // force initialization
2548	+	h = ThreadLocalRandom.getProbe();
2549	+	wasUncontended = true;
2550	+	}
2551	+	boolean collide = false;                // True if last slot nonempty
2552	+	for (;;) {
2553	+	CounterCell[] as; CounterCell a; int n; long v;
2554	+	if ((as = counterCells) != null && (n = as.length) > 0) {
2555	+	if ((a = as[(n - 1) & h]) == null) {
2556	+	if (cellsBusy == 0) {            // Try to attach new Cell
2557	+	CounterCell r = new CounterCell(x); // Optimistic create
2558	+	if (cellsBusy == 0 &&
2559	+	U.compareAndSwapInt(this, CELLSBUSY, 0, 1)) {
2560	+	boolean created = false;
2561	+	try {               // Recheck under lock
2562	+	CounterCell[] rs; int m, j;
2563	+	if ((rs = counterCells) != null &&
2564	+	(m = rs.length) > 0 &&
2565	+	rs[j = (m - 1) & h] == null) {
2566	+	rs[j] = r;
2567	+	created = true;
2568	+	}
2569	+	} finally {
2570	+	cellsBusy = 0;
2571	+	}
2572	+	if (created)
2573	+	break;
2574	+	continue;           // Slot is now non-empty
2575	+	}
2576	+	}
2577	+	collide = false;
2578	+	}
2579	+	else if (!wasUncontended)       // CAS already known to fail
2580	+	wasUncontended = true;      // Continue after rehash
2581	+	else if (U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))
2582	+	break;
2583	+	else if (counterCells != as || n >= NCPU)
2584	+	collide = false;            // At max size or stale
2585	+	else if (!collide)
2586	+	collide = true;
2587	+	else if (cellsBusy == 0 &&
2588	+	U.compareAndSwapInt(this, CELLSBUSY, 0, 1)) {
2589	+	try {
2590	+	if (counterCells == as) {// Expand table unless stale
2591	+	CounterCell[] rs = new CounterCell[n << 1];
2592	+	for (int i = 0; i < n; ++i)
2593	+	rs[i] = as[i];
2594	+	counterCells = rs;
2595	+	}
2596	+	} finally {
2597	+	cellsBusy = 0;
2598	+	}
2599	+	collide = false;
2600	+	continue;                   // Retry with expanded table
2601	+	}
2602	+	h = ThreadLocalRandom.advanceProbe(h);
2603	+	}
2604	+	else if (cellsBusy == 0 && counterCells == as &&
2605	+	U.compareAndSwapInt(this, CELLSBUSY, 0, 1)) {
2606	+	boolean init = false;
2607	+	try {                           // Initialize table
2608	+	if (counterCells == as) {
2609	+	CounterCell[] rs = new CounterCell[2];
2610	+	rs[h & 1] = new CounterCell(x);
2611	+	counterCells = rs;
2612	+	init = true;
2613	+	}
2614	+	} finally {
2615	+	cellsBusy = 0;
2616	+	}
2617	+	if (init)
2618	+	break;
2619	+	}
2620	+	else if (U.compareAndSwapLong(this, BASECOUNT, v = baseCount, v + x))
2621	+	break;                          // Fall back on using base
2622	+	}
2623	+	}
2624	+
2625	+	/* ---------------- Conversion from/to TreeBins -------------- */
2626	+
2627		/**
2628	<	* Returns the hash code value for this {@link Map}, i.e.,
2629	<	* the sum of, for each key-value pair in the map,
2630	<	* {@code key.hashCode() ^ value.hashCode()}.
2631	<	*
2632	<	* @return the hash code value for this map
2628	>	* Replaces all linked nodes in bin at given index unless table is
2629	>	* too small, in which case resizes instead.
2630	>	*/
2631	>	private final void treeifyBin(Node<K,V>[] tab, int index) {
2632	>	Node<K,V> b; int n;
2633	>	if (tab != null) {
2634	>	if ((n = tab.length) < MIN_TREEIFY_CAPACITY)
2635	>	tryPresize(n << 1);
2636	>	else if ((b = tabAt(tab, index)) != null && b.hash >= 0) {
2637	>	synchronized (b) {
2638	>	if (tabAt(tab, index) == b) {
2639	>	TreeNode<K,V> hd = null, tl = null;
2640	>	for (Node<K,V> e = b; e != null; e = e.next) {
2641	>	TreeNode<K,V> p =
2642	>	new TreeNode<K,V>(e.hash, e.key, e.val,
2643	>	null, null);
2644	>	if ((p.prev = tl) == null)
2645	>	hd = p;
2646	>	else
2647	>	tl.next = p;
2648	>	tl = p;
2649	>	}
2650	>	setTabAt(tab, index, new TreeBin<K,V>(hd));
2651	>	}
2652	>	}
2653	>	}
2654	>	}
2655	>	}
2656	>
2657	>	/**
2658	>	* Returns a list on non-TreeNodes replacing those in given list.
2659		*/
2660	<	public int hashCode() {
2661	<	int h = 0;
2662	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2663	<	Object v;
2664	<	while ((v = it.advance()) != null) {
2665	<	h += it.nextKey.hashCode() ^ v.hashCode();
2660	>	static <K,V> Node<K,V> untreeify(Node<K,V> b) {
2661	>	Node<K,V> hd = null, tl = null;
2662	>	for (Node<K,V> q = b; q != null; q = q.next) {
2663	>	Node<K,V> p = new Node<K,V>(q.hash, q.key, q.val, null);
2664	>	if (tl == null)
2665	>	hd = p;
2666	>	else
2667	>	tl.next = p;
2668	>	tl = p;
2669		}
2670	<	return h;
2670	>	return hd;
2671		}
2672
2673	+	/* ---------------- TreeNodes -------------- */
2674	+
2675		/**
2676	<	* Returns a string representation of this map.  The string
3113	<	* representation consists of a list of key-value mappings (in no
3114	<	* particular order) enclosed in braces ("{@code {}}").  Adjacent
3115	<	* mappings are separated by the characters {@code ", "} (comma
3116	<	* and space).  Each key-value mapping is rendered as the key
3117	<	* followed by an equals sign ("{@code =}") followed by the
3118	<	* associated value.
3119	<	*
3120	<	* @return a string representation of this map
2676	>	* Nodes for use in TreeBins
2677		*/
2678	<	public String toString() {
2679	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2680	<	StringBuilder sb = new StringBuilder();
2681	<	sb.append('{');
2682	<	Object v;
2683	<	if ((v = it.advance()) != null) {
2684	<	for (;;) {
2685	<	Object k = it.nextKey;
2686	<	sb.append(k == this ? "(this Map)" : k);
2687	<	sb.append('=');
2688	<	sb.append(v == this ? "(this Map)" : v);
2689	<	if ((v = it.advance()) == null)
2678	>	static final class TreeNode<K,V> extends Node<K,V> {
2679	>	TreeNode<K,V> parent;  // red-black tree links
2680	>	TreeNode<K,V> left;
2681	>	TreeNode<K,V> right;
2682	>	TreeNode<K,V> prev;    // needed to unlink next upon deletion
2683	>	boolean red;
2684	>
2685	>	TreeNode(int hash, K key, V val, Node<K,V> next,
2686	>	TreeNode<K,V> parent) {
2687	>	super(hash, key, val, next);
2688	>	this.parent = parent;
2689	>	}
2690	>
2691	>	Node<K,V> find(int h, Object k) {
2692	>	return findTreeNode(h, k, null);
2693	>	}
2694	>
2695	>	/**
2696	>	* Returns the TreeNode (or null if not found) for the given key
2697	>	* starting at given root.
2698	>	*/
2699	>	final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) {
2700	>	if (k != null) {
2701	>	TreeNode<K,V> p = this;
2702	>	do {
2703	>	int ph, dir; K pk; TreeNode<K,V> q;
2704	>	TreeNode<K,V> pl = p.left, pr = p.right;
2705	>	if ((ph = p.hash) > h)
2706	>	p = pl;
2707	>	else if (ph < h)
2708	>	p = pr;
2709	>	else if ((pk = p.key) == k || (pk != null && k.equals(pk)))
2710	>	return p;
2711	>	else if (pl == null)
2712	>	p = pr;
2713	>	else if (pr == null)
2714	>	p = pl;
2715	>	else if ((kc != null ||
2716	>	(kc = comparableClassFor(k)) != null) &&
2717	>	(dir = compareComparables(kc, k, pk)) != 0)
2718	>	p = (dir < 0) ? pl : pr;
2719	>	else if ((q = pr.findTreeNode(h, k, kc)) != null)
2720	>	return q;
2721	>	else
2722	>	p = pl;
2723	>	} while (p != null);
2724	>	}
2725	>	return null;
2726	>	}
2727	>	}
2728	>
2729	>	/* ---------------- TreeBins -------------- */
2730	>
2731	>	/**
2732	>	* TreeNodes used at the heads of bins. TreeBins do not hold user
2733	>	* keys or values, but instead point to list of TreeNodes and
2734	>	* their root. They also maintain a parasitic read-write lock
2735	>	* forcing writers (who hold bin lock) to wait for readers (who do
2736	>	* not) to complete before tree restructuring operations.
2737	>	*/
2738	>	static final class TreeBin<K,V> extends Node<K,V> {
2739	>	TreeNode<K,V> root;
2740	>	volatile TreeNode<K,V> first;
2741	>	volatile Thread waiter;
2742	>	volatile int lockState;
2743	>	// values for lockState
2744	>	static final int WRITER = 1; // set while holding write lock
2745	>	static final int WAITER = 2; // set when waiting for write lock
2746	>	static final int READER = 4; // increment value for setting read lock
2747	>
2748	>	/**
2749	>	* Tie-breaking utility for ordering insertions when equal
2750	>	* hashCodes and non-comparable. We don't require a total
2751	>	* order, just a consistent insertion rule to maintain
2752	>	* equivalence across rebalancings. Tie-breaking further than
2753	>	* necessary simplifies testing a bit.
2754	>	*/
2755	>	static int tieBreakOrder(Object a, Object b) {
2756	>	int d;
2757	>	if (a == null || b == null ||
2758	>	(d = a.getClass().getName().
2759	>	compareTo(b.getClass().getName())) == 0)
2760	>	d = (System.identityHashCode(a) <= System.identityHashCode(b) ?
2761	>	-1 : 1);
2762	>	return d;
2763	>	}
2764	>
2765	>	/**
2766	>	* Creates bin with initial set of nodes headed by b.
2767	>	*/
2768	>	TreeBin(TreeNode<K,V> b) {
2769	>	super(TREEBIN, null, null, null);
2770	>	this.first = b;
2771	>	TreeNode<K,V> r = null;
2772	>	for (TreeNode<K,V> x = b, next; x != null; x = next) {
2773	>	next = (TreeNode<K,V>)x.next;
2774	>	x.left = x.right = null;
2775	>	if (r == null) {
2776	>	x.parent = null;
2777	>	x.red = false;
2778	>	r = x;
2779	>	}
2780	>	else {
2781	>	K k = x.key;
2782	>	int h = x.hash;
2783	>	Class<?> kc = null;
2784	>	for (TreeNode<K,V> p = r;;) {
2785	>	int dir, ph;
2786	>	K pk = p.key;
2787	>	if ((ph = p.hash) > h)
2788	>	dir = -1;
2789	>	else if (ph < h)
2790	>	dir = 1;
2791	>	else if ((kc == null &&
2792	>	(kc = comparableClassFor(k)) == null) ||
2793	>	(dir = compareComparables(kc, k, pk)) == 0)
2794	>	dir = tieBreakOrder(k, pk);
2795	>	TreeNode<K,V> xp = p;
2796	>	if ((p = (dir <= 0) ? p.left : p.right) == null) {
2797	>	x.parent = xp;
2798	>	if (dir <= 0)
2799	>	xp.left = x;
2800	>	else
2801	>	xp.right = x;
2802	>	r = balanceInsertion(r, x);
2803	>	break;
2804	>	}
2805	>	}
2806	>	}
2807	>	}
2808	>	this.root = r;
2809	>	assert checkInvariants(root);
2810	>	}
2811	>
2812	>	/**
2813	>	* Acquires write lock for tree restructuring.
2814	>	*/
2815	>	private final void lockRoot() {
2816	>	if (!U.compareAndSwapInt(this, LOCKSTATE, 0, WRITER))
2817	>	contendedLock(); // offload to separate method
2818	>	}
2819	>
2820	>	/**
2821	>	* Releases write lock for tree restructuring.
2822	>	*/
2823	>	private final void unlockRoot() {
2824	>	lockState = 0;
2825	>	}
2826	>
2827	>	/**
2828	>	* Possibly blocks awaiting root lock.
2829	>	*/
2830	>	private final void contendedLock() {
2831	>	boolean waiting = false;
2832	>	for (int s;;) {
2833	>	if (((s = lockState) & ~WAITER) == 0) {
2834	>	if (U.compareAndSwapInt(this, LOCKSTATE, s, WRITER)) {
2835	>	if (waiting)
2836	>	waiter = null;
2837	>	return;
2838	>	}
2839	>	}
2840	>	else if ((s & WAITER) == 0) {
2841	>	if (U.compareAndSwapInt(this, LOCKSTATE, s, s | WAITER)) {
2842	>	waiting = true;
2843	>	waiter = Thread.currentThread();
2844	>	}
2845	>	}
2846	>	else if (waiting)
2847	>	LockSupport.park(this);
2848	>	}
2849	>	}
2850	>
2851	>	/**
2852	>	* Returns matching node or null if none. Tries to search
2853	>	* using tree comparisons from root, but continues linear
2854	>	* search when lock not available.
2855	>	*/
2856	>	final Node<K,V> find(int h, Object k) {
2857	>	if (k != null) {
2858	>	for (Node<K,V> e = first; e != null; ) {
2859	>	int s; K ek;
2860	>	if (((s = lockState) & (WAITER|WRITER)) != 0) {
2861	>	if (e.hash == h &&
2862	>	((ek = e.key) == k || (ek != null && k.equals(ek))))
2863	>	return e;
2864	>	e = e.next;
2865	>	}
2866	>	else if (U.compareAndSwapInt(this, LOCKSTATE, s,
2867	>	s + READER)) {
2868	>	TreeNode<K,V> r, p;
2869	>	try {
2870	>	p = ((r = root) == null ? null :
2871	>	r.findTreeNode(h, k, null));
2872	>	} finally {
2873	>	Thread w;
2874	>	if (U.getAndAddInt(this, LOCKSTATE, -READER) ==
2875	>	(READER|WAITER) && (w = waiter) != null)
2876	>	LockSupport.unpark(w);
2877	>	}
2878	>	return p;
2879	>	}
2880	>	}
2881	>	}
2882	>	return null;
2883	>	}
2884	>
2885	>	/**
2886	>	* Finds or adds a node.
2887	>	* @return null if added
2888	>	*/
2889	>	final TreeNode<K,V> putTreeVal(int h, K k, V v) {
2890	>	Class<?> kc = null;
2891	>	boolean searched = false;
2892	>	for (TreeNode<K,V> p = root;;) {
2893	>	int dir, ph; K pk;
2894	>	if (p == null) {
2895	>	first = root = new TreeNode<K,V>(h, k, v, null, null);
2896		break;
2897	<	sb.append(',').append(' ');
2897	>	}
2898	>	else if ((ph = p.hash) > h)
2899	>	dir = -1;
2900	>	else if (ph < h)
2901	>	dir = 1;
2902	>	else if ((pk = p.key) == k || (pk != null && k.equals(pk)))
2903	>	return p;
2904	>	else if ((kc == null &&
2905	>	(kc = comparableClassFor(k)) == null) ||
2906	>	(dir = compareComparables(kc, k, pk)) == 0) {
2907	>	if (!searched) {
2908	>	TreeNode<K,V> q, ch;
2909	>	searched = true;
2910	>	if (((ch = p.left) != null &&
2911	>	(q = ch.findTreeNode(h, k, kc)) != null) ||
2912	>	((ch = p.right) != null &&
2913	>	(q = ch.findTreeNode(h, k, kc)) != null))
2914	>	return q;
2915	>	}
2916	>	dir = tieBreakOrder(k, pk);
2917	>	}
2918	>
2919	>	TreeNode<K,V> xp = p;
2920	>	if ((p = (dir <= 0) ? p.left : p.right) == null) {
2921	>	TreeNode<K,V> x, f = first;
2922	>	first = x = new TreeNode<K,V>(h, k, v, f, xp);
2923	>	if (f != null)
2924	>	f.prev = x;
2925	>	if (dir <= 0)
2926	>	xp.left = x;
2927	>	else
2928	>	xp.right = x;
2929	>	if (!xp.red)
2930	>	x.red = true;
2931	>	else {
2932	>	lockRoot();
2933	>	try {
2934	>	root = balanceInsertion(root, x);
2935	>	} finally {
2936	>	unlockRoot();
2937	>	}
2938	>	}
2939	>	break;
2940	>	}
2941	>	}
2942	>	assert checkInvariants(root);
2943	>	return null;
2944	>	}
2945	>
2946	>	/**
2947	>	* Removes the given node, that must be present before this
2948	>	* call.  This is messier than typical red-black deletion code
2949	>	* because we cannot swap the contents of an interior node
2950	>	* with a leaf successor that is pinned by "next" pointers
2951	>	* that are accessible independently of lock. So instead we
2952	>	* swap the tree linkages.
2953	>	*
2954	>	* @return true if now too small, so should be untreeified
2955	>	*/
2956	>	final boolean removeTreeNode(TreeNode<K,V> p) {
2957	>	TreeNode<K,V> next = (TreeNode<K,V>)p.next;
2958	>	TreeNode<K,V> pred = p.prev;  // unlink traversal pointers
2959	>	TreeNode<K,V> r, rl;
2960	>	if (pred == null)
2961	>	first = next;
2962	>	else
2963	>	pred.next = next;
2964	>	if (next != null)
2965	>	next.prev = pred;
2966	>	if (first == null) {
2967	>	root = null;
2968	>	return true;
2969	>	}
2970	>	if ((r = root) == null || r.right == null || // too small
2971	>	(rl = r.left) == null || rl.left == null)
2972	>	return true;
2973	>	lockRoot();
2974	>	try {
2975	>	TreeNode<K,V> replacement;
2976	>	TreeNode<K,V> pl = p.left;
2977	>	TreeNode<K,V> pr = p.right;
2978	>	if (pl != null && pr != null) {
2979	>	TreeNode<K,V> s = pr, sl;
2980	>	while ((sl = s.left) != null) // find successor
2981	>	s = sl;
2982	>	boolean c = s.red; s.red = p.red; p.red = c; // swap colors
2983	>	TreeNode<K,V> sr = s.right;
2984	>	TreeNode<K,V> pp = p.parent;
2985	>	if (s == pr) { // p was s's direct parent
2986	>	p.parent = s;
2987	>	s.right = p;
2988	>	}
2989	>	else {
2990	>	TreeNode<K,V> sp = s.parent;
2991	>	if ((p.parent = sp) != null) {
2992	>	if (s == sp.left)
2993	>	sp.left = p;
2994	>	else
2995	>	sp.right = p;
2996	>	}
2997	>	if ((s.right = pr) != null)
2998	>	pr.parent = s;
2999	>	}
3000	>	p.left = null;
3001	>	if ((p.right = sr) != null)
3002	>	sr.parent = p;
3003	>	if ((s.left = pl) != null)
3004	>	pl.parent = s;
3005	>	if ((s.parent = pp) == null)
3006	>	r = s;
3007	>	else if (p == pp.left)
3008	>	pp.left = s;
3009	>	else
3010	>	pp.right = s;
3011	>	if (sr != null)
3012	>	replacement = sr;
3013	>	else
3014	>	replacement = p;
3015	>	}
3016	>	else if (pl != null)
3017	>	replacement = pl;
3018	>	else if (pr != null)
3019	>	replacement = pr;
3020	>	else
3021	>	replacement = p;
3022	>	if (replacement != p) {
3023	>	TreeNode<K,V> pp = replacement.parent = p.parent;
3024	>	if (pp == null)
3025	>	r = replacement;
3026	>	else if (p == pp.left)
3027	>	pp.left = replacement;
3028	>	else
3029	>	pp.right = replacement;
3030	>	p.left = p.right = p.parent = null;
3031	>	}
3032	>
3033	>	root = (p.red) ? r : balanceDeletion(r, replacement);
3034	>
3035	>	if (p == replacement) {  // detach pointers
3036	>	TreeNode<K,V> pp;
3037	>	if ((pp = p.parent) != null) {
3038	>	if (p == pp.left)
3039	>	pp.left = null;
3040	>	else if (p == pp.right)
3041	>	pp.right = null;
3042	>	p.parent = null;
3043	>	}
3044	>	}
3045	>	} finally {
3046	>	unlockRoot();
3047	>	}
3048	>	assert checkInvariants(root);
3049	>	return false;
3050	>	}
3051	>
3052	>	/* ------------------------------------------------------------ */
3053	>	// Red-black tree methods, all adapted from CLR
3054	>
3055	>	static <K,V> TreeNode<K,V> rotateLeft(TreeNode<K,V> root,
3056	>	TreeNode<K,V> p) {
3057	>	TreeNode<K,V> r, pp, rl;
3058	>	if (p != null && (r = p.right) != null) {
3059	>	if ((rl = p.right = r.left) != null)
3060	>	rl.parent = p;
3061	>	if ((pp = r.parent = p.parent) == null)
3062	>	(root = r).red = false;
3063	>	else if (pp.left == p)
3064	>	pp.left = r;
3065	>	else
3066	>	pp.right = r;
3067	>	r.left = p;
3068	>	p.parent = r;
3069	>	}
3070	>	return root;
3071	>	}
3072	>
3073	>	static <K,V> TreeNode<K,V> rotateRight(TreeNode<K,V> root,
3074	>	TreeNode<K,V> p) {
3075	>	TreeNode<K,V> l, pp, lr;
3076	>	if (p != null && (l = p.left) != null) {
3077	>	if ((lr = p.left = l.right) != null)
3078	>	lr.parent = p;
3079	>	if ((pp = l.parent = p.parent) == null)
3080	>	(root = l).red = false;
3081	>	else if (pp.right == p)
3082	>	pp.right = l;
3083	>	else
3084	>	pp.left = l;
3085	>	l.right = p;
3086	>	p.parent = l;
3087	>	}
3088	>	return root;
3089	>	}
3090	>
3091	>	static <K,V> TreeNode<K,V> balanceInsertion(TreeNode<K,V> root,
3092	>	TreeNode<K,V> x) {
3093	>	x.red = true;
3094	>	for (TreeNode<K,V> xp, xpp, xppl, xppr;;) {
3095	>	if ((xp = x.parent) == null) {
3096	>	x.red = false;
3097	>	return x;
3098	>	}
3099	>	else if (!xp.red || (xpp = xp.parent) == null)
3100	>	return root;
3101	>	if (xp == (xppl = xpp.left)) {
3102	>	if ((xppr = xpp.right) != null && xppr.red) {
3103	>	xppr.red = false;
3104	>	xp.red = false;
3105	>	xpp.red = true;
3106	>	x = xpp;
3107	>	}
3108	>	else {
3109	>	if (x == xp.right) {
3110	>	root = rotateLeft(root, x = xp);
3111	>	xpp = (xp = x.parent) == null ? null : xp.parent;
3112	>	}
3113	>	if (xp != null) {
3114	>	xp.red = false;
3115	>	if (xpp != null) {
3116	>	xpp.red = true;
3117	>	root = rotateRight(root, xpp);
3118	>	}
3119	>	}
3120	>	}
3121	>	}
3122	>	else {
3123	>	if (xppl != null && xppl.red) {
3124	>	xppl.red = false;
3125	>	xp.red = false;
3126	>	xpp.red = true;
3127	>	x = xpp;
3128	>	}
3129	>	else {
3130	>	if (x == xp.left) {
3131	>	root = rotateRight(root, x = xp);
3132	>	xpp = (xp = x.parent) == null ? null : xp.parent;
3133	>	}
3134	>	if (xp != null) {
3135	>	xp.red = false;
3136	>	if (xpp != null) {
3137	>	xpp.red = true;
3138	>	root = rotateLeft(root, xpp);
3139	>	}
3140	>	}
3141	>	}
3142	>	}
3143	>	}
3144	>	}
3145	>
3146	>	static <K,V> TreeNode<K,V> balanceDeletion(TreeNode<K,V> root,
3147	>	TreeNode<K,V> x) {
3148	>	for (TreeNode<K,V> xp, xpl, xpr;;) {
3149	>	if (x == null || x == root)
3150	>	return root;
3151	>	else if ((xp = x.parent) == null) {
3152	>	x.red = false;
3153	>	return x;
3154	>	}
3155	>	else if (x.red) {
3156	>	x.red = false;
3157	>	return root;
3158	>	}
3159	>	else if ((xpl = xp.left) == x) {
3160	>	if ((xpr = xp.right) != null && xpr.red) {
3161	>	xpr.red = false;
3162	>	xp.red = true;
3163	>	root = rotateLeft(root, xp);
3164	>	xpr = (xp = x.parent) == null ? null : xp.right;
3165	>	}
3166	>	if (xpr == null)
3167	>	x = xp;
3168	>	else {
3169	>	TreeNode<K,V> sl = xpr.left, sr = xpr.right;
3170	>	if ((sr == null || !sr.red) &&
3171	>	(sl == null || !sl.red)) {
3172	>	xpr.red = true;
3173	>	x = xp;
3174	>	}
3175	>	else {
3176	>	if (sr == null || !sr.red) {
3177	>	if (sl != null)
3178	>	sl.red = false;
3179	>	xpr.red = true;
3180	>	root = rotateRight(root, xpr);
3181	>	xpr = (xp = x.parent) == null ?
3182	>	null : xp.right;
3183	>	}
3184	>	if (xpr != null) {
3185	>	xpr.red = (xp == null) ? false : xp.red;
3186	>	if ((sr = xpr.right) != null)
3187	>	sr.red = false;
3188	>	}
3189	>	if (xp != null) {
3190	>	xp.red = false;
3191	>	root = rotateLeft(root, xp);
3192	>	}
3193	>	x = root;
3194	>	}
3195	>	}
3196	>	}
3197	>	else { // symmetric
3198	>	if (xpl != null && xpl.red) {
3199	>	xpl.red = false;
3200	>	xp.red = true;
3201	>	root = rotateRight(root, xp);
3202	>	xpl = (xp = x.parent) == null ? null : xp.left;
3203	>	}
3204	>	if (xpl == null)
3205	>	x = xp;
3206	>	else {
3207	>	TreeNode<K,V> sl = xpl.left, sr = xpl.right;
3208	>	if ((sl == null || !sl.red) &&
3209	>	(sr == null || !sr.red)) {
3210	>	xpl.red = true;
3211	>	x = xp;
3212	>	}
3213	>	else {
3214	>	if (sl == null || !sl.red) {
3215	>	if (sr != null)
3216	>	sr.red = false;
3217	>	xpl.red = true;
3218	>	root = rotateLeft(root, xpl);
3219	>	xpl = (xp = x.parent) == null ?
3220	>	null : xp.left;
3221	>	}
3222	>	if (xpl != null) {
3223	>	xpl.red = (xp == null) ? false : xp.red;
3224	>	if ((sl = xpl.left) != null)
3225	>	sl.red = false;
3226	>	}
3227	>	if (xp != null) {
3228	>	xp.red = false;
3229	>	root = rotateRight(root, xp);
3230	>	}
3231	>	x = root;
3232	>	}
3233	>	}
3234	>	}
3235	>	}
3236	>	}
3237	>
3238	>	/**
3239	>	* Recursive invariant check
3240	>	*/
3241	>	static <K,V> boolean checkInvariants(TreeNode<K,V> t) {
3242	>	TreeNode<K,V> tp = t.parent, tl = t.left, tr = t.right,
3243	>	tb = t.prev, tn = (TreeNode<K,V>)t.next;
3244	>	if (tb != null && tb.next != t)
3245	>	return false;
3246	>	if (tn != null && tn.prev != t)
3247	>	return false;
3248	>	if (tp != null && t != tp.left && t != tp.right)
3249	>	return false;
3250	>	if (tl != null && (tl.parent != t || tl.hash > t.hash))
3251	>	return false;
3252	>	if (tr != null && (tr.parent != t || tr.hash < t.hash))
3253	>	return false;
3254	>	if (t.red && tl != null && tl.red && tr != null && tr.red)
3255	>	return false;
3256	>	if (tl != null && !checkInvariants(tl))
3257	>	return false;
3258	>	if (tr != null && !checkInvariants(tr))
3259	>	return false;
3260	>	return true;
3261	>	}
3262	>
3263	>	private static final sun.misc.Unsafe U = sun.misc.Unsafe.getUnsafe();
3264	>	private static final long LOCKSTATE;
3265	>	static {
3266	>	try {
3267	>	LOCKSTATE = U.objectFieldOffset
3268	>	(TreeBin.class.getDeclaredField("lockState"));
3269	>	} catch (ReflectiveOperationException e) {
3270	>	throw new Error(e);
3271		}
3272		}
3138	–	return sb.append('}').toString();
3273		}
3274
3275	+	/* ----------------Table Traversal -------------- */
3276	+
3277		/**
3278	<	* Compares the specified object with this map for equality.
3279	<	* Returns {@code true} if the given object is a map with the same
3280	<	* mappings as this map.  This operation may return misleading
3281	<	* results if either map is concurrently modified during execution
3282	<	* of this method.
3278	>	* Records the table, its length, and current traversal index for a
3279	>	* traverser that must process a region of a forwarded table before
3280	>	* proceeding with current table.
3281	>	*/
3282	>	static final class TableStack<K,V> {
3283	>	int length;
3284	>	int index;
3285	>	Node<K,V>[] tab;
3286	>	TableStack<K,V> next;
3287	>	}
3288	>
3289	>	/**
3290	>	* Encapsulates traversal for methods such as containsValue; also
3291	>	* serves as a base class for other iterators and spliterators.
3292		*
3293	<	* @param o object to be compared for equality with this map
3294	<	* @return {@code true} if the specified object is equal to this map
3293	>	* Method advance visits once each still-valid node that was
3294	>	* reachable upon iterator construction. It might miss some that
3295	>	* were added to a bin after the bin was visited, which is OK wrt
3296	>	* consistency guarantees. Maintaining this property in the face
3297	>	* of possible ongoing resizes requires a fair amount of
3298	>	* bookkeeping state that is difficult to optimize away amidst
3299	>	* volatile accesses.  Even so, traversal maintains reasonable
3300	>	* throughput.
3301	>	*
3302	>	* Normally, iteration proceeds bin-by-bin traversing lists.
3303	>	* However, if the table has been resized, then all future steps
3304	>	* must traverse both the bin at the current index as well as at
3305	>	* (index + baseSize); and so on for further resizings. To
3306	>	* paranoically cope with potential sharing by users of iterators
3307	>	* across threads, iteration terminates if a bounds checks fails
3308	>	* for a table read.
3309		*/
3310	<	public boolean equals(Object o) {
3311	<	if (o != this) {
3312	<	if (!(o instanceof Map))
3313	<	return false;
3314	<	Map<?,?> m = (Map<?,?>) o;
3315	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3316	<	Object val;
3317	<	while ((val = it.advance()) != null) {
3318	<	Object v = m.get(it.nextKey);
3319	<	if (v == null || (v != val && !v.equals(val)))
3320	<	return false;
3310	>	static class Traverser<K,V> {
3311	>	Node<K,V>[] tab;        // current table; updated if resized
3312	>	Node<K,V> next;         // the next entry to use
3313	>	TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes
3314	>	int index;              // index of bin to use next
3315	>	int baseIndex;          // current index of initial table
3316	>	int baseLimit;          // index bound for initial table
3317	>	final int baseSize;     // initial table size
3318	>
3319	>	Traverser(Node<K,V>[] tab, int size, int index, int limit) {
3320	>	this.tab = tab;
3321	>	this.baseSize = size;
3322	>	this.baseIndex = this.index = index;
3323	>	this.baseLimit = limit;
3324	>	this.next = null;
3325	>	}
3326	>
3327	>	/**
3328	>	* Advances if possible, returning next valid node, or null if none.
3329	>	*/
3330	>	final Node<K,V> advance() {
3331	>	Node<K,V> e;
3332	>	if ((e = next) != null)
3333	>	e = e.next;
3334	>	for (;;) {
3335	>	Node<K,V>[] t; int i, n;  // must use locals in checks
3336	>	if (e != null)
3337	>	return next = e;
3338	>	if (baseIndex >= baseLimit || (t = tab) == null ||
3339	>	(n = t.length) <= (i = index) || i < 0)
3340	>	return next = null;
3341	>	if ((e = tabAt(t, i)) != null && e.hash < 0) {
3342	>	if (e instanceof ForwardingNode) {
3343	>	tab = ((ForwardingNode<K,V>)e).nextTable;
3344	>	e = null;
3345	>	pushState(t, i, n);
3346	>	continue;
3347	>	}
3348	>	else if (e instanceof TreeBin)
3349	>	e = ((TreeBin<K,V>)e).first;
3350	>	else
3351	>	e = null;
3352	>	}
3353	>	if (stack != null)
3354	>	recoverState(n);
3355	>	else if ((index = i + baseSize) >= n)
3356	>	index = ++baseIndex; // visit upper slots if present
3357		}
3358	<	for (Map.Entry<?,?> e : m.entrySet()) {
3359	<	Object mk, mv, v;
3360	<	if ((mk = e.getKey()) == null ||
3361	<	(mv = e.getValue()) == null ||
3362	<	(v = internalGet(mk)) == null ||
3363	<	(mv != v && !mv.equals(v)))
3364	<	return false;
3358	>	}
3359	>
3360	>	/**
3361	>	* Saves traversal state upon encountering a forwarding node.
3362	>	*/
3363	>	private void pushState(Node<K,V>[] t, int i, int n) {
3364	>	TableStack<K,V> s = spare;  // reuse if possible
3365	>	if (s != null)
3366	>	spare = s.next;
3367	>	else
3368	>	s = new TableStack<K,V>();
3369	>	s.tab = t;
3370	>	s.length = n;
3371	>	s.index = i;
3372	>	s.next = stack;
3373	>	stack = s;
3374	>	}
3375	>
3376	>	/**
3377	>	* Possibly pops traversal state.
3378	>	*
3379	>	* @param n length of current table
3380	>	*/
3381	>	private void recoverState(int n) {
3382	>	TableStack<K,V> s; int len;
3383	>	while ((s = stack) != null && (index += (len = s.length)) >= n) {
3384	>	n = len;
3385	>	index = s.index;
3386	>	tab = s.tab;
3387	>	s.tab = null;
3388	>	TableStack<K,V> next = s.next;
3389	>	s.next = spare; // save for reuse
3390	>	stack = next;
3391	>	spare = s;
3392		}
3393	+	if (s == null && (index += baseSize) >= n)
3394	+	index = ++baseIndex;
3395		}
3172	–	return true;
3396		}
3397
3398	<	/* ----------------Iterators -------------- */
3399	<
3400	<	@SuppressWarnings("serial") static final class KeyIterator<K,V> extends Traverser<K,V,Object>
3401	<	implements Spliterator<K>, Enumeration<K> {
3402	<	KeyIterator(ConcurrentHashMap<K, V> map) { super(map); }
3403	<	KeyIterator(Traverser<K,V,Object> it) {
3404	<	super(it);
3398	>	/**
3399	>	* Base of key, value, and entry Iterators. Adds fields to
3400	>	* Traverser to support iterator.remove.
3401	>	*/
3402	>	static class BaseIterator<K,V> extends Traverser<K,V> {
3403	>	final ConcurrentHashMap<K,V> map;
3404	>	Node<K,V> lastReturned;
3405	>	BaseIterator(Node<K,V>[] tab, int size, int index, int limit,
3406	>	ConcurrentHashMap<K,V> map) {
3407	>	super(tab, size, index, limit);
3408	>	this.map = map;
3409	>	advance();
3410		}
3411	<	public KeyIterator<K,V> split() {
3412	<	if (nextKey != null)
3411	>
3412	>	public final boolean hasNext() { return next != null; }
3413	>	public final boolean hasMoreElements() { return next != null; }
3414	>
3415	>	public final void remove() {
3416	>	Node<K,V> p;
3417	>	if ((p = lastReturned) == null)
3418		throw new IllegalStateException();
3419	<	return new KeyIterator<K,V>(this);
3419	>	lastReturned = null;
3420	>	map.replaceNode(p.key, null, null);
3421		}
3422	<	@SuppressWarnings("unchecked") public final K next() {
3423	<	if (nextVal == null && advance() == null)
3422	>	}
3423	>
3424	>	static final class KeyIterator<K,V> extends BaseIterator<K,V>
3425	>	implements Iterator<K>, Enumeration<K> {
3426	>	KeyIterator(Node<K,V>[] tab, int index, int size, int limit,
3427	>	ConcurrentHashMap<K,V> map) {
3428	>	super(tab, index, size, limit, map);
3429	>	}
3430	>
3431	>	public final K next() {
3432	>	Node<K,V> p;
3433	>	if ((p = next) == null)
3434		throw new NoSuchElementException();
3435	<	Object k = nextKey;
3436	<	nextVal = null;
3437	<	return (K) k;
3435	>	K k = p.key;
3436	>	lastReturned = p;
3437	>	advance();
3438	>	return k;
3439		}
3440
3441		public final K nextElement() { return next(); }
3442		}
3443
3444	<	@SuppressWarnings("serial") static final class ValueIterator<K,V> extends Traverser<K,V,Object>
3445	<	implements Spliterator<V>, Enumeration<V> {
3446	<	ValueIterator(ConcurrentHashMap<K, V> map) { super(map); }
3447	<	ValueIterator(Traverser<K,V,Object> it) {
3448	<	super(it);
3204	<	}
3205	<	public ValueIterator<K,V> split() {
3206	<	if (nextKey != null)
3207	<	throw new IllegalStateException();
3208	<	return new ValueIterator<K,V>(this);
3444	>	static final class ValueIterator<K,V> extends BaseIterator<K,V>
3445	>	implements Iterator<V>, Enumeration<V> {
3446	>	ValueIterator(Node<K,V>[] tab, int index, int size, int limit,
3447	>	ConcurrentHashMap<K,V> map) {
3448	>	super(tab, index, size, limit, map);
3449		}
3450
3451	<	@SuppressWarnings("unchecked") public final V next() {
3452	<	Object v;
3453	<	if ((v = nextVal) == null && (v = advance()) == null)
3451	>	public final V next() {
3452	>	Node<K,V> p;
3453	>	if ((p = next) == null)
3454		throw new NoSuchElementException();
3455	<	nextVal = null;
3456	<	return (V) v;
3455	>	V v = p.val;
3456	>	lastReturned = p;
3457	>	advance();
3458	>	return v;
3459		}
3460
3461		public final V nextElement() { return next(); }
3462		}
3463
3464	<	@SuppressWarnings("serial") static final class EntryIterator<K,V> extends Traverser<K,V,Object>
3465	<	implements Spliterator<Map.Entry<K,V>> {
3466	<	EntryIterator(ConcurrentHashMap<K, V> map) { super(map); }
3467	<	EntryIterator(Traverser<K,V,Object> it) {
3468	<	super(it);
3227	<	}
3228	<	public EntryIterator<K,V> split() {
3229	<	if (nextKey != null)
3230	<	throw new IllegalStateException();
3231	<	return new EntryIterator<K,V>(this);
3464	>	static final class EntryIterator<K,V> extends BaseIterator<K,V>
3465	>	implements Iterator<Map.Entry<K,V>> {
3466	>	EntryIterator(Node<K,V>[] tab, int index, int size, int limit,
3467	>	ConcurrentHashMap<K,V> map) {
3468	>	super(tab, index, size, limit, map);
3469		}
3470
3471	<	@SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
3472	<	Object v;
3473	<	if ((v = nextVal) == null && (v = advance()) == null)
3471	>	public final Map.Entry<K,V> next() {
3472	>	Node<K,V> p;
3473	>	if ((p = next) == null)
3474		throw new NoSuchElementException();
3475	<	Object k = nextKey;
3476	<	nextVal = null;
3477	<	return new MapEntry<K,V>((K)k, (V)v, map);
3475	>	K k = p.key;
3476	>	V v = p.val;
3477	>	lastReturned = p;
3478	>	advance();
3479	>	return new MapEntry<K,V>(k, v, map);
3480		}
3481		}
3482
3483		/**
3484	<	* Exported Entry for iterators
3484	>	* Exported Entry for EntryIterator
3485		*/
3486	<	static final class MapEntry<K,V> implements Map.Entry<K, V> {
3486	>	static final class MapEntry<K,V> implements Map.Entry<K,V> {
3487		final K key; // non-null
3488		V val;       // non-null
3489	<	final ConcurrentHashMap<K, V> map;
3490	<	MapEntry(K key, V val, ConcurrentHashMap<K, V> map) {
3489	>	final ConcurrentHashMap<K,V> map;
3490	>	MapEntry(K key, V val, ConcurrentHashMap<K,V> map) {
3491		this.key = key;
3492		this.val = val;
3493		this.map = map;
3494		}
3495	<	public final K getKey()       { return key; }
3496	<	public final V getValue()     { return val; }
3497	<	public final int hashCode()   { return key.hashCode() ^ val.hashCode(); }
3498	<	public final String toString(){ return key + "=" + val; }
3495	>	public K getKey()        { return key; }
3496	>	public V getValue()      { return val; }
3497	>	public int hashCode()    { return key.hashCode() ^ val.hashCode(); }
3498	>	public String toString() {
3499	>	return Helpers.mapEntryToString(key, val);
3500	>	}
3501
3502	<	public final boolean equals(Object o) {
3502	>	public boolean equals(Object o) {
3503		Object k, v; Map.Entry<?,?> e;
3504		return ((o instanceof Map.Entry) &&
3505		(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
#	Line 3272 | Line 3513 | public class ConcurrentHashMap<K, V>
3513		* value to return is somewhat arbitrary here. Since we do not
3514		* necessarily track asynchronous changes, the most recent
3515		* "previous" value could be different from what we return (or
3516	<	* could even have been removed in which case the put will
3516	>	* could even have been removed, in which case the put will
3517		* re-establish). We do not and cannot guarantee more.
3518		*/
3519	<	public final V setValue(V value) {
3519	>	public V setValue(V value) {
3520		if (value == null) throw new NullPointerException();
3521		V v = val;
3522		val = value;
#	Line 3284 | Line 3525 | public class ConcurrentHashMap<K, V>
3525		}
3526		}
3527
3528	<	/* ---------------- Serialization Support -------------- */
3528	>	static final class KeySpliterator<K,V> extends Traverser<K,V>
3529	>	implements Spliterator<K> {
3530	>	long est;               // size estimate
3531	>	KeySpliterator(Node<K,V>[] tab, int size, int index, int limit,
3532	>	long est) {
3533	>	super(tab, size, index, limit);
3534	>	this.est = est;
3535	>	}
3536	>
3537	>	public Spliterator<K> trySplit() {
3538	>	int i, f, h;
3539	>	return (h = ((i = baseIndex) + (f = baseLimit)) >>> 1) <= i ? null :
3540	>	new KeySpliterator<K,V>(tab, baseSize, baseLimit = h,
3541	>	f, est >>>= 1);
3542	>	}
3543
3544	<	/**
3545	<	* Stripped-down version of helper class used in previous version,
3546	<	* declared for the sake of serialization compatibility
3547	<	*/
3548	<	static class Segment<K,V> implements Serializable {
3294	<	private static final long serialVersionUID = 2249069246763182397L;
3295	<	final float loadFactor;
3296	<	Segment(float lf) { this.loadFactor = lf; }
3297	<	}
3544	>	public void forEachRemaining(Consumer<? super K> action) {
3545	>	if (action == null) throw new NullPointerException();
3546	>	for (Node<K,V> p; (p = advance()) != null;)
3547	>	action.accept(p.key);
3548	>	}
3549
3550	<	/**
3551	<	* Saves the state of the {@code ConcurrentHashMap} instance to a
3552	<	* stream (i.e., serializes it).
3553	<	* @param s the stream
3554	<	* @serialData
3555	<	* the key (Object) and value (Object)
3556	<	* for each key-value mapping, followed by a null pair.
3557	<	* The key-value mappings are emitted in no particular order.
3558	<	*/
3559	<	@SuppressWarnings("unchecked") private void writeObject(java.io.ObjectOutputStream s)
3560	<	throws java.io.IOException {
3561	<	if (segments == null) { // for serialization compatibility
3562	<	segments = (Segment<K,V>[])
3563	<	new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
3313	<	for (int i = 0; i < segments.length; ++i)
3314	<	segments[i] = new Segment<K,V>(LOAD_FACTOR);
3315	<	}
3316	<	s.defaultWriteObject();
3317	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3318	<	Object v;
3319	<	while ((v = it.advance()) != null) {
3320	<	s.writeObject(it.nextKey);
3321	<	s.writeObject(v);
3550	>	public boolean tryAdvance(Consumer<? super K> action) {
3551	>	if (action == null) throw new NullPointerException();
3552	>	Node<K,V> p;
3553	>	if ((p = advance()) == null)
3554	>	return false;
3555	>	action.accept(p.key);
3556	>	return true;
3557	>	}
3558	>
3559	>	public long estimateSize() { return est; }
3560	>
3561	>	public int characteristics() {
3562	>	return Spliterator.DISTINCT | Spliterator.CONCURRENT |
3563	>	Spliterator.NONNULL;
3564		}
3323	–	s.writeObject(null);
3324	–	s.writeObject(null);
3325	–	segments = null; // throw away
3565		}
3566
3567	<	/**
3568	<	* Reconstitutes the instance from a stream (that is, deserializes it).
3569	<	* @param s the stream
3570	<	*/
3571	<	@SuppressWarnings("unchecked") private void readObject(java.io.ObjectInputStream s)
3572	<	throws java.io.IOException, ClassNotFoundException {
3573	<	s.defaultReadObject();
3574	<	this.segments = null; // unneeded
3336	<	// initialize transient final field
3337	<	UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder());
3567	>	static final class ValueSpliterator<K,V> extends Traverser<K,V>
3568	>	implements Spliterator<V> {
3569	>	long est;               // size estimate
3570	>	ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit,
3571	>	long est) {
3572	>	super(tab, size, index, limit);
3573	>	this.est = est;
3574	>	}
3575
3576	<	// Create all nodes, then place in table once size is known
3577	<	long size = 0L;
3578	<	Node p = null;
3579	<	for (;;) {
3580	<	K k = (K) s.readObject();
3344	<	V v = (V) s.readObject();
3345	<	if (k != null && v != null) {
3346	<	int h = spread(k.hashCode());
3347	<	p = new Node(h, k, v, p);
3348	<	++size;
3349	<	}
3350	<	else
3351	<	break;
3576	>	public Spliterator<V> trySplit() {
3577	>	int i, f, h;
3578	>	return (h = ((i = baseIndex) + (f = baseLimit)) >>> 1) <= i ? null :
3579	>	new ValueSpliterator<K,V>(tab, baseSize, baseLimit = h,
3580	>	f, est >>>= 1);
3581		}
3582	<	if (p != null) {
3583	<	boolean init = false;
3584	<	int n;
3585	<	if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
3586	<	n = MAXIMUM_CAPACITY;
3587	<	else {
3588	<	int sz = (int)size;
3589	<	n = tableSizeFor(sz + (sz >>> 1) + 1);
3590	<	}
3591	<	int sc = sizeCtl;
3592	<	boolean collide = false;
3593	<	if (n > sc &&
3594	<	UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
3595	<	try {
3596	<	if (table == null) {
3597	<	init = true;
3598	<	Node[] tab = new Node[n];
3599	<	int mask = n - 1;
3600	<	while (p != null) {
3601	<	int j = p.hash & mask;
3373	<	Node next = p.next;
3374	<	Node q = p.next = tabAt(tab, j);
3375	<	setTabAt(tab, j, p);
3376	<	if (!collide && q != null && q.hash == p.hash)
3377	<	collide = true;
3378	<	p = next;
3379	<	}
3380	<	table = tab;
3381	<	counter.add(size);
3382	<	sc = n - (n >>> 2);
3383	<	}
3384	<	} finally {
3385	<	sizeCtl = sc;
3386	<	}
3387	<	if (collide) { // rescan and convert to TreeBins
3388	<	Node[] tab = table;
3389	<	for (int i = 0; i < tab.length; ++i) {
3390	<	int c = 0;
3391	<	for (Node e = tabAt(tab, i); e != null; e = e.next) {
3392	<	if (++c > TREE_THRESHOLD &&
3393	<	(e.key instanceof Comparable)) {
3394	<	replaceWithTreeBin(tab, i, e.key);
3395	<	break;
3396	<	}
3397	<	}
3398	<	}
3399	<	}
3400	<	}
3401	<	if (!init) { // Can only happen if unsafely published.
3402	<	while (p != null) {
3403	<	internalPut(p.key, p.val);
3404	<	p = p.next;
3405	<	}
3406	<	}
3582	>
3583	>	public void forEachRemaining(Consumer<? super V> action) {
3584	>	if (action == null) throw new NullPointerException();
3585	>	for (Node<K,V> p; (p = advance()) != null;)
3586	>	action.accept(p.val);
3587	>	}
3588	>
3589	>	public boolean tryAdvance(Consumer<? super V> action) {
3590	>	if (action == null) throw new NullPointerException();
3591	>	Node<K,V> p;
3592	>	if ((p = advance()) == null)
3593	>	return false;
3594	>	action.accept(p.val);
3595	>	return true;
3596	>	}
3597	>
3598	>	public long estimateSize() { return est; }
3599	>
3600	>	public int characteristics() {
3601	>	return Spliterator.CONCURRENT | Spliterator.NONNULL;
3602		}
3603		}
3604
3605	+	static final class EntrySpliterator<K,V> extends Traverser<K,V>
3606	+	implements Spliterator<Map.Entry<K,V>> {
3607	+	final ConcurrentHashMap<K,V> map; // To export MapEntry
3608	+	long est;               // size estimate
3609	+	EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit,
3610	+	long est, ConcurrentHashMap<K,V> map) {
3611	+	super(tab, size, index, limit);
3612	+	this.map = map;
3613	+	this.est = est;
3614	+	}
3615
3616	<	// -------------------------------------------------------
3616	>	public Spliterator<Map.Entry<K,V>> trySplit() {
3617	>	int i, f, h;
3618	>	return (h = ((i = baseIndex) + (f = baseLimit)) >>> 1) <= i ? null :
3619	>	new EntrySpliterator<K,V>(tab, baseSize, baseLimit = h,
3620	>	f, est >>>= 1, map);
3621	>	}
3622
3623	<	// Sams
3624	<	/** Interface describing a void action of one argument */
3625	<	public interface Action<A> { void apply(A a); }
3626	<	/** Interface describing a void action of two arguments */
3627	<	public interface BiAction<A,B> { void apply(A a, B b); }
3418	<	/** Interface describing a function of one argument */
3419	<	public interface Fun<A,T> { T apply(A a); }
3420	<	/** Interface describing a function of two arguments */
3421	<	public interface BiFun<A,B,T> { T apply(A a, B b); }
3422	<	/** Interface describing a function of no arguments */
3423	<	public interface Generator<T> { T apply(); }
3424	<	/** Interface describing a function mapping its argument to a double */
3425	<	public interface ObjectToDouble<A> { double apply(A a); }
3426	<	/** Interface describing a function mapping its argument to a long */
3427	<	public interface ObjectToLong<A> { long apply(A a); }
3428	<	/** Interface describing a function mapping its argument to an int */
3429	<	public interface ObjectToInt<A> {int apply(A a); }
3430	<	/** Interface describing a function mapping two arguments to a double */
3431	<	public interface ObjectByObjectToDouble<A,B> { double apply(A a, B b); }
3432	<	/** Interface describing a function mapping two arguments to a long */
3433	<	public interface ObjectByObjectToLong<A,B> { long apply(A a, B b); }
3434	<	/** Interface describing a function mapping two arguments to an int */
3435	<	public interface ObjectByObjectToInt<A,B> {int apply(A a, B b); }
3436	<	/** Interface describing a function mapping a double to a double */
3437	<	public interface DoubleToDouble { double apply(double a); }
3438	<	/** Interface describing a function mapping a long to a long */
3439	<	public interface LongToLong { long apply(long a); }
3440	<	/** Interface describing a function mapping an int to an int */
3441	<	public interface IntToInt { int apply(int a); }
3442	<	/** Interface describing a function mapping two doubles to a double */
3443	<	public interface DoubleByDoubleToDouble { double apply(double a, double b); }
3444	<	/** Interface describing a function mapping two longs to a long */
3445	<	public interface LongByLongToLong { long apply(long a, long b); }
3446	<	/** Interface describing a function mapping two ints to an int */
3447	<	public interface IntByIntToInt { int apply(int a, int b); }
3623	>	public void forEachRemaining(Consumer<? super Map.Entry<K,V>> action) {
3624	>	if (action == null) throw new NullPointerException();
3625	>	for (Node<K,V> p; (p = advance()) != null; )
3626	>	action.accept(new MapEntry<K,V>(p.key, p.val, map));
3627	>	}
3628
3629	+	public boolean tryAdvance(Consumer<? super Map.Entry<K,V>> action) {
3630	+	if (action == null) throw new NullPointerException();
3631	+	Node<K,V> p;
3632	+	if ((p = advance()) == null)
3633	+	return false;
3634	+	action.accept(new MapEntry<K,V>(p.key, p.val, map));
3635	+	return true;
3636	+	}
3637
3638	<	// -------------------------------------------------------
3638	>	public long estimateSize() { return est; }
3639	>
3640	>	public int characteristics() {
3641	>	return Spliterator.DISTINCT | Spliterator.CONCURRENT |
3642	>	Spliterator.NONNULL;
3643	>	}
3644	>	}
3645	>
3646	>	// Parallel bulk operations
3647	>
3648	>	/**
3649	>	* Computes initial batch value for bulk tasks. The returned value
3650	>	* is approximately exp2 of the number of times (minus one) to
3651	>	* split task by two before executing leaf action. This value is
3652	>	* faster to compute and more convenient to use as a guide to
3653	>	* splitting than is the depth, since it is used while dividing by
3654	>	* two anyway.
3655	>	*/
3656	>	final int batchFor(long b) {
3657	>	long n;
3658	>	if (b == Long.MAX_VALUE || (n = sumCount()) <= 1L || n < b)
3659	>	return 0;
3660	>	int sp = ForkJoinPool.getCommonPoolParallelism() << 2; // slack of 4
3661	>	return (b <= 0L || (n /= b) >= sp) ? sp : (int)n;
3662	>	}
3663
3664		/**
3665		* Performs the given action for each (key, value).
3666		*
3667	+	* @param parallelismThreshold the (estimated) number of elements
3668	+	* needed for this operation to be executed in parallel
3669		* @param action the action
3670	+	* @since 1.8
3671		*/
3672	<	public void forEach(BiAction<K,V> action) {
3673	<	ForkJoinTasks.forEach
3674	<	(this, action).invoke();
3672	>	public void forEach(long parallelismThreshold,
3673	>	BiConsumer<? super K,? super V> action) {
3674	>	if (action == null) throw new NullPointerException();
3675	>	new ForEachMappingTask<K,V>
3676	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3677	>	action).invoke();
3678		}
3679
3680		/**
3681		* Performs the given action for each non-null transformation
3682		* of each (key, value).
3683		*
3684	+	* @param parallelismThreshold the (estimated) number of elements
3685	+	* needed for this operation to be executed in parallel
3686		* @param transformer a function returning the transformation
3687	<	* for an element, or null of there is no transformation (in
3688	<	* which case the action is not applied).
3687	>	* for an element, or null if there is no transformation (in
3688	>	* which case the action is not applied)
3689		* @param action the action
3690	+	* @param <U> the return type of the transformer
3691	+	* @since 1.8
3692		*/
3693	<	public <U> void forEach(BiFun<? super K, ? super V, ? extends U> transformer,
3694	<	Action<U> action) {
3695	<	ForkJoinTasks.forEach
3696	<	(this, transformer, action).invoke();
3693	>	public <U> void forEach(long parallelismThreshold,
3694	>	BiFunction<? super K, ? super V, ? extends U> transformer,
3695	>	Consumer<? super U> action) {
3696	>	if (transformer == null || action == null)
3697	>	throw new NullPointerException();
3698	>	new ForEachTransformedMappingTask<K,V,U>
3699	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3700	>	transformer, action).invoke();
3701		}
3702
3703		/**
#	Line 3481 | Line 3707 | public class ConcurrentHashMap<K, V>
3707		* results of any other parallel invocations of the search
3708		* function are ignored.
3709		*
3710	+	* @param parallelismThreshold the (estimated) number of elements
3711	+	* needed for this operation to be executed in parallel
3712		* @param searchFunction a function returning a non-null
3713		* result on success, else null
3714	+	* @param <U> the return type of the search function
3715		* @return a non-null result from applying the given search
3716		* function on each (key, value), or null if none
3717	+	* @since 1.8
3718		*/
3719	<	public <U> U search(BiFun<? super K, ? super V, ? extends U> searchFunction) {
3720	<	return ForkJoinTasks.search
3721	<	(this, searchFunction).invoke();
3719	>	public <U> U search(long parallelismThreshold,
3720	>	BiFunction<? super K, ? super V, ? extends U> searchFunction) {
3721	>	if (searchFunction == null) throw new NullPointerException();
3722	>	return new SearchMappingsTask<K,V,U>
3723	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3724	>	searchFunction, new AtomicReference<U>()).invoke();
3725		}
3726
3727		/**
#	Line 3496 | Line 3729 | public class ConcurrentHashMap<K, V>
3729		* of all (key, value) pairs using the given reducer to
3730		* combine values, or null if none.
3731		*
3732	+	* @param parallelismThreshold the (estimated) number of elements
3733	+	* needed for this operation to be executed in parallel
3734		* @param transformer a function returning the transformation
3735	<	* for an element, or null of there is no transformation (in
3736	<	* which case it is not combined).
3735	>	* for an element, or null if there is no transformation (in
3736	>	* which case it is not combined)
3737		* @param reducer a commutative associative combining function
3738	+	* @param <U> the return type of the transformer
3739		* @return the result of accumulating the given transformation
3740		* of all (key, value) pairs
3741	+	* @since 1.8
3742		*/
3743	<	public <U> U reduce(BiFun<? super K, ? super V, ? extends U> transformer,
3744	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3745	<	return ForkJoinTasks.reduce
3746	<	(this, transformer, reducer).invoke();
3743	>	public <U> U reduce(long parallelismThreshold,
3744	>	BiFunction<? super K, ? super V, ? extends U> transformer,
3745	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
3746	>	if (transformer == null || reducer == null)
3747	>	throw new NullPointerException();
3748	>	return new MapReduceMappingsTask<K,V,U>
3749	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3750	>	null, transformer, reducer).invoke();
3751		}
3752
3753		/**
#	Line 3514 | Line 3755 | public class ConcurrentHashMap<K, V>
3755		* of all (key, value) pairs using the given reducer to
3756		* combine values, and the given basis as an identity value.
3757		*
3758	+	* @param parallelismThreshold the (estimated) number of elements
3759	+	* needed for this operation to be executed in parallel
3760		* @param transformer a function returning the transformation
3761		* for an element
3762		* @param basis the identity (initial default value) for the reduction
3763		* @param reducer a commutative associative combining function
3764		* @return the result of accumulating the given transformation
3765		* of all (key, value) pairs
3766	+	* @since 1.8
3767		*/
3768	<	public double reduceToDouble(ObjectByObjectToDouble<? super K, ? super V> transformer,
3768	>	public double reduceToDouble(long parallelismThreshold,
3769	>	ToDoubleBiFunction<? super K, ? super V> transformer,
3770		double basis,
3771	<	DoubleByDoubleToDouble reducer) {
3772	<	return ForkJoinTasks.reduceToDouble
3773	<	(this, transformer, basis, reducer).invoke();
3771	>	DoubleBinaryOperator reducer) {
3772	>	if (transformer == null || reducer == null)
3773	>	throw new NullPointerException();
3774	>	return new MapReduceMappingsToDoubleTask<K,V>
3775	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3776	>	null, transformer, basis, reducer).invoke();
3777		}
3778
3779		/**
#	Line 3533 | Line 3781 | public class ConcurrentHashMap<K, V>
3781		* of all (key, value) pairs using the given reducer to
3782		* combine values, and the given basis as an identity value.
3783		*
3784	+	* @param parallelismThreshold the (estimated) number of elements
3785	+	* needed for this operation to be executed in parallel
3786		* @param transformer a function returning the transformation
3787		* for an element
3788		* @param basis the identity (initial default value) for the reduction
3789		* @param reducer a commutative associative combining function
3790		* @return the result of accumulating the given transformation
3791		* of all (key, value) pairs
3792	+	* @since 1.8
3793		*/
3794	<	public long reduceToLong(ObjectByObjectToLong<? super K, ? super V> transformer,
3794	>	public long reduceToLong(long parallelismThreshold,
3795	>	ToLongBiFunction<? super K, ? super V> transformer,
3796		long basis,
3797	<	LongByLongToLong reducer) {
3798	<	return ForkJoinTasks.reduceToLong
3799	<	(this, transformer, basis, reducer).invoke();
3797	>	LongBinaryOperator reducer) {
3798	>	if (transformer == null || reducer == null)
3799	>	throw new NullPointerException();
3800	>	return new MapReduceMappingsToLongTask<K,V>
3801	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3802	>	null, transformer, basis, reducer).invoke();
3803		}
3804
3805		/**
#	Line 3552 | Line 3807 | public class ConcurrentHashMap<K, V>
3807		* of all (key, value) pairs using the given reducer to
3808		* combine values, and the given basis as an identity value.
3809		*
3810	+	* @param parallelismThreshold the (estimated) number of elements
3811	+	* needed for this operation to be executed in parallel
3812		* @param transformer a function returning the transformation
3813		* for an element
3814		* @param basis the identity (initial default value) for the reduction
3815		* @param reducer a commutative associative combining function
3816		* @return the result of accumulating the given transformation
3817		* of all (key, value) pairs
3818	+	* @since 1.8
3819		*/
3820	<	public int reduceToInt(ObjectByObjectToInt<? super K, ? super V> transformer,
3820	>	public int reduceToInt(long parallelismThreshold,
3821	>	ToIntBiFunction<? super K, ? super V> transformer,
3822		int basis,
3823	<	IntByIntToInt reducer) {
3824	<	return ForkJoinTasks.reduceToInt
3825	<	(this, transformer, basis, reducer).invoke();
3823	>	IntBinaryOperator reducer) {
3824	>	if (transformer == null || reducer == null)
3825	>	throw new NullPointerException();
3826	>	return new MapReduceMappingsToIntTask<K,V>
3827	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3828	>	null, transformer, basis, reducer).invoke();
3829		}
3830
3831		/**
3832		* Performs the given action for each key.
3833		*
3834	+	* @param parallelismThreshold the (estimated) number of elements
3835	+	* needed for this operation to be executed in parallel
3836		* @param action the action
3837	+	* @since 1.8
3838		*/
3839	<	public void forEachKey(Action<K> action) {
3840	<	ForkJoinTasks.forEachKey
3841	<	(this, action).invoke();
3839	>	public void forEachKey(long parallelismThreshold,
3840	>	Consumer<? super K> action) {
3841	>	if (action == null) throw new NullPointerException();
3842	>	new ForEachKeyTask<K,V>
3843	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3844	>	action).invoke();
3845		}
3846
3847		/**
3848		* Performs the given action for each non-null transformation
3849		* of each key.
3850		*
3851	+	* @param parallelismThreshold the (estimated) number of elements
3852	+	* needed for this operation to be executed in parallel
3853		* @param transformer a function returning the transformation
3854	<	* for an element, or null of there is no transformation (in
3855	<	* which case the action is not applied).
3854	>	* for an element, or null if there is no transformation (in
3855	>	* which case the action is not applied)
3856		* @param action the action
3857	+	* @param <U> the return type of the transformer
3858	+	* @since 1.8
3859		*/
3860	<	public <U> void forEachKey(Fun<? super K, ? extends U> transformer,
3861	<	Action<U> action) {
3862	<	ForkJoinTasks.forEachKey
3863	<	(this, transformer, action).invoke();
3860	>	public <U> void forEachKey(long parallelismThreshold,
3861	>	Function<? super K, ? extends U> transformer,
3862	>	Consumer<? super U> action) {
3863	>	if (transformer == null || action == null)
3864	>	throw new NullPointerException();
3865	>	new ForEachTransformedKeyTask<K,V,U>
3866	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3867	>	transformer, action).invoke();
3868		}
3869
3870		/**
#	Line 3598 | Line 3874 | public class ConcurrentHashMap<K, V>
3874		* any other parallel invocations of the search function are
3875		* ignored.
3876		*
3877	+	* @param parallelismThreshold the (estimated) number of elements
3878	+	* needed for this operation to be executed in parallel
3879		* @param searchFunction a function returning a non-null
3880		* result on success, else null
3881	+	* @param <U> the return type of the search function
3882		* @return a non-null result from applying the given search
3883		* function on each key, or null if none
3884	+	* @since 1.8
3885		*/
3886	<	public <U> U searchKeys(Fun<? super K, ? extends U> searchFunction) {
3887	<	return ForkJoinTasks.searchKeys
3888	<	(this, searchFunction).invoke();
3886	>	public <U> U searchKeys(long parallelismThreshold,
3887	>	Function<? super K, ? extends U> searchFunction) {
3888	>	if (searchFunction == null) throw new NullPointerException();
3889	>	return new SearchKeysTask<K,V,U>
3890	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3891	>	searchFunction, new AtomicReference<U>()).invoke();
3892		}
3893
3894		/**
3895		* Returns the result of accumulating all keys using the given
3896		* reducer to combine values, or null if none.
3897		*
3898	+	* @param parallelismThreshold the (estimated) number of elements
3899	+	* needed for this operation to be executed in parallel
3900		* @param reducer a commutative associative combining function
3901		* @return the result of accumulating all keys using the given
3902		* reducer to combine values, or null if none
3903	+	* @since 1.8
3904		*/
3905	<	public K reduceKeys(BiFun<? super K, ? super K, ? extends K> reducer) {
3906	<	return ForkJoinTasks.reduceKeys
3907	<	(this, reducer).invoke();
3905	>	public K reduceKeys(long parallelismThreshold,
3906	>	BiFunction<? super K, ? super K, ? extends K> reducer) {
3907	>	if (reducer == null) throw new NullPointerException();
3908	>	return new ReduceKeysTask<K,V>
3909	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3910	>	null, reducer).invoke();
3911		}
3912
3913		/**
#	Line 3626 | Line 3915 | public class ConcurrentHashMap<K, V>
3915		* of all keys using the given reducer to combine values, or
3916		* null if none.
3917		*
3918	+	* @param parallelismThreshold the (estimated) number of elements
3919	+	* needed for this operation to be executed in parallel
3920		* @param transformer a function returning the transformation
3921	<	* for an element, or null of there is no transformation (in
3922	<	* which case it is not combined).
3921	>	* for an element, or null if there is no transformation (in
3922	>	* which case it is not combined)
3923		* @param reducer a commutative associative combining function
3924	+	* @param <U> the return type of the transformer
3925		* @return the result of accumulating the given transformation
3926		* of all keys
3927	+	* @since 1.8
3928		*/
3929	<	public <U> U reduceKeys(Fun<? super K, ? extends U> transformer,
3930	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3931	<	return ForkJoinTasks.reduceKeys
3932	<	(this, transformer, reducer).invoke();
3929	>	public <U> U reduceKeys(long parallelismThreshold,
3930	>	Function<? super K, ? extends U> transformer,
3931	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
3932	>	if (transformer == null || reducer == null)
3933	>	throw new NullPointerException();
3934	>	return new MapReduceKeysTask<K,V,U>
3935	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3936	>	null, transformer, reducer).invoke();
3937		}
3938
3939		/**
#	Line 3644 | Line 3941 | public class ConcurrentHashMap<K, V>
3941		* of all keys using the given reducer to combine values, and
3942		* the given basis as an identity value.
3943		*
3944	+	* @param parallelismThreshold the (estimated) number of elements
3945	+	* needed for this operation to be executed in parallel
3946		* @param transformer a function returning the transformation
3947		* for an element
3948		* @param basis the identity (initial default value) for the reduction
3949		* @param reducer a commutative associative combining function
3950	<	* @return  the result of accumulating the given transformation
3950	>	* @return the result of accumulating the given transformation
3951		* of all keys
3952	+	* @since 1.8
3953		*/
3954	<	public double reduceKeysToDouble(ObjectToDouble<? super K> transformer,
3954	>	public double reduceKeysToDouble(long parallelismThreshold,
3955	>	ToDoubleFunction<? super K> transformer,
3956		double basis,
3957	<	DoubleByDoubleToDouble reducer) {
3958	<	return ForkJoinTasks.reduceKeysToDouble
3959	<	(this, transformer, basis, reducer).invoke();
3957	>	DoubleBinaryOperator reducer) {
3958	>	if (transformer == null || reducer == null)
3959	>	throw new NullPointerException();
3960	>	return new MapReduceKeysToDoubleTask<K,V>
3961	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3962	>	null, transformer, basis, reducer).invoke();
3963		}
3964
3965		/**
#	Line 3663 | Line 3967 | public class ConcurrentHashMap<K, V>
3967		* of all keys using the given reducer to combine values, and
3968		* the given basis as an identity value.
3969		*
3970	+	* @param parallelismThreshold the (estimated) number of elements
3971	+	* needed for this operation to be executed in parallel
3972		* @param transformer a function returning the transformation
3973		* for an element
3974		* @param basis the identity (initial default value) for the reduction
3975		* @param reducer a commutative associative combining function
3976		* @return the result of accumulating the given transformation
3977		* of all keys
3978	+	* @since 1.8
3979		*/
3980	<	public long reduceKeysToLong(ObjectToLong<? super K> transformer,
3980	>	public long reduceKeysToLong(long parallelismThreshold,
3981	>	ToLongFunction<? super K> transformer,
3982		long basis,
3983	<	LongByLongToLong reducer) {
3984	<	return ForkJoinTasks.reduceKeysToLong
3985	<	(this, transformer, basis, reducer).invoke();
3983	>	LongBinaryOperator reducer) {
3984	>	if (transformer == null || reducer == null)
3985	>	throw new NullPointerException();
3986	>	return new MapReduceKeysToLongTask<K,V>
3987	>	(null, batchFor(parallelismThreshold), 0, 0, table,
3988	>	null, transformer, basis, reducer).invoke();
3989		}
3990
3991		/**
#	Line 3682 | Line 3993 | public class ConcurrentHashMap<K, V>
3993		* of all keys using the given reducer to combine values, and
3994		* the given basis as an identity value.
3995		*
3996	+	* @param parallelismThreshold the (estimated) number of elements
3997	+	* needed for this operation to be executed in parallel
3998		* @param transformer a function returning the transformation
3999		* for an element
4000		* @param basis the identity (initial default value) for the reduction
4001		* @param reducer a commutative associative combining function
4002		* @return the result of accumulating the given transformation
4003		* of all keys
4004	+	* @since 1.8
4005		*/
4006	<	public int reduceKeysToInt(ObjectToInt<? super K> transformer,
4006	>	public int reduceKeysToInt(long parallelismThreshold,
4007	>	ToIntFunction<? super K> transformer,
4008		int basis,
4009	<	IntByIntToInt reducer) {
4010	<	return ForkJoinTasks.reduceKeysToInt
4011	<	(this, transformer, basis, reducer).invoke();
4009	>	IntBinaryOperator reducer) {
4010	>	if (transformer == null || reducer == null)
4011	>	throw new NullPointerException();
4012	>	return new MapReduceKeysToIntTask<K,V>
4013	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4014	>	null, transformer, basis, reducer).invoke();
4015		}
4016
4017		/**
4018		* Performs the given action for each value.
4019		*
4020	+	* @param parallelismThreshold the (estimated) number of elements
4021	+	* needed for this operation to be executed in parallel
4022		* @param action the action
4023	+	* @since 1.8
4024		*/
4025	<	public void forEachValue(Action<V> action) {
4026	<	ForkJoinTasks.forEachValue
4027	<	(this, action).invoke();
4025	>	public void forEachValue(long parallelismThreshold,
4026	>	Consumer<? super V> action) {
4027	>	if (action == null)
4028	>	throw new NullPointerException();
4029	>	new ForEachValueTask<K,V>
4030	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4031	>	action).invoke();
4032		}
4033
4034		/**
4035		* Performs the given action for each non-null transformation
4036		* of each value.
4037		*
4038	+	* @param parallelismThreshold the (estimated) number of elements
4039	+	* needed for this operation to be executed in parallel
4040		* @param transformer a function returning the transformation
4041	<	* for an element, or null of there is no transformation (in
4042	<	* which case the action is not applied).
4041	>	* for an element, or null if there is no transformation (in
4042	>	* which case the action is not applied)
4043	>	* @param action the action
4044	>	* @param <U> the return type of the transformer
4045	>	* @since 1.8
4046		*/
4047	<	public <U> void forEachValue(Fun<? super V, ? extends U> transformer,
4048	<	Action<U> action) {
4049	<	ForkJoinTasks.forEachValue
4050	<	(this, transformer, action).invoke();
4047	>	public <U> void forEachValue(long parallelismThreshold,
4048	>	Function<? super V, ? extends U> transformer,
4049	>	Consumer<? super U> action) {
4050	>	if (transformer == null || action == null)
4051	>	throw new NullPointerException();
4052	>	new ForEachTransformedValueTask<K,V,U>
4053	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4054	>	transformer, action).invoke();
4055		}
4056
4057		/**
#	Line 3727 | Line 4061 | public class ConcurrentHashMap<K, V>
4061		* any other parallel invocations of the search function are
4062		* ignored.
4063		*
4064	+	* @param parallelismThreshold the (estimated) number of elements
4065	+	* needed for this operation to be executed in parallel
4066		* @param searchFunction a function returning a non-null
4067		* result on success, else null
4068	+	* @param <U> the return type of the search function
4069		* @return a non-null result from applying the given search
4070		* function on each value, or null if none
4071	<	*
4071	>	* @since 1.8
4072		*/
4073	<	public <U> U searchValues(Fun<? super V, ? extends U> searchFunction) {
4074	<	return ForkJoinTasks.searchValues
4075	<	(this, searchFunction).invoke();
4073	>	public <U> U searchValues(long parallelismThreshold,
4074	>	Function<? super V, ? extends U> searchFunction) {
4075	>	if (searchFunction == null) throw new NullPointerException();
4076	>	return new SearchValuesTask<K,V,U>
4077	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4078	>	searchFunction, new AtomicReference<U>()).invoke();
4079		}
4080
4081		/**
4082		* Returns the result of accumulating all values using the
4083		* given reducer to combine values, or null if none.
4084		*
4085	+	* @param parallelismThreshold the (estimated) number of elements
4086	+	* needed for this operation to be executed in parallel
4087		* @param reducer a commutative associative combining function
4088	<	* @return  the result of accumulating all values
4088	>	* @return the result of accumulating all values
4089	>	* @since 1.8
4090		*/
4091	<	public V reduceValues(BiFun<? super V, ? super V, ? extends V> reducer) {
4092	<	return ForkJoinTasks.reduceValues
4093	<	(this, reducer).invoke();
4091	>	public V reduceValues(long parallelismThreshold,
4092	>	BiFunction<? super V, ? super V, ? extends V> reducer) {
4093	>	if (reducer == null) throw new NullPointerException();
4094	>	return new ReduceValuesTask<K,V>
4095	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4096	>	null, reducer).invoke();
4097		}
4098
4099		/**
#	Line 3755 | Line 4101 | public class ConcurrentHashMap<K, V>
4101		* of all values using the given reducer to combine values, or
4102		* null if none.
4103		*
4104	+	* @param parallelismThreshold the (estimated) number of elements
4105	+	* needed for this operation to be executed in parallel
4106		* @param transformer a function returning the transformation
4107	<	* for an element, or null of there is no transformation (in
4108	<	* which case it is not combined).
4107	>	* for an element, or null if there is no transformation (in
4108	>	* which case it is not combined)
4109		* @param reducer a commutative associative combining function
4110	+	* @param <U> the return type of the transformer
4111		* @return the result of accumulating the given transformation
4112		* of all values
4113	+	* @since 1.8
4114		*/
4115	<	public <U> U reduceValues(Fun<? super V, ? extends U> transformer,
4116	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4117	<	return ForkJoinTasks.reduceValues
4118	<	(this, transformer, reducer).invoke();
4115	>	public <U> U reduceValues(long parallelismThreshold,
4116	>	Function<? super V, ? extends U> transformer,
4117	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
4118	>	if (transformer == null || reducer == null)
4119	>	throw new NullPointerException();
4120	>	return new MapReduceValuesTask<K,V,U>
4121	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4122	>	null, transformer, reducer).invoke();
4123		}
4124
4125		/**
#	Line 3773 | Line 4127 | public class ConcurrentHashMap<K, V>
4127		* of all values using the given reducer to combine values,
4128		* and the given basis as an identity value.
4129		*
4130	+	* @param parallelismThreshold the (estimated) number of elements
4131	+	* needed for this operation to be executed in parallel
4132		* @param transformer a function returning the transformation
4133		* for an element
4134		* @param basis the identity (initial default value) for the reduction
4135		* @param reducer a commutative associative combining function
4136		* @return the result of accumulating the given transformation
4137		* of all values
4138	+	* @since 1.8
4139		*/
4140	<	public double reduceValuesToDouble(ObjectToDouble<? super V> transformer,
4140	>	public double reduceValuesToDouble(long parallelismThreshold,
4141	>	ToDoubleFunction<? super V> transformer,
4142		double basis,
4143	<	DoubleByDoubleToDouble reducer) {
4144	<	return ForkJoinTasks.reduceValuesToDouble
4145	<	(this, transformer, basis, reducer).invoke();
4143	>	DoubleBinaryOperator reducer) {
4144	>	if (transformer == null || reducer == null)
4145	>	throw new NullPointerException();
4146	>	return new MapReduceValuesToDoubleTask<K,V>
4147	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4148	>	null, transformer, basis, reducer).invoke();
4149		}
4150
4151		/**
#	Line 3792 | Line 4153 | public class ConcurrentHashMap<K, V>
4153		* of all values using the given reducer to combine values,
4154		* and the given basis as an identity value.
4155		*
4156	+	* @param parallelismThreshold the (estimated) number of elements
4157	+	* needed for this operation to be executed in parallel
4158		* @param transformer a function returning the transformation
4159		* for an element
4160		* @param basis the identity (initial default value) for the reduction
4161		* @param reducer a commutative associative combining function
4162		* @return the result of accumulating the given transformation
4163		* of all values
4164	+	* @since 1.8
4165		*/
4166	<	public long reduceValuesToLong(ObjectToLong<? super V> transformer,
4166	>	public long reduceValuesToLong(long parallelismThreshold,
4167	>	ToLongFunction<? super V> transformer,
4168		long basis,
4169	<	LongByLongToLong reducer) {
4170	<	return ForkJoinTasks.reduceValuesToLong
4171	<	(this, transformer, basis, reducer).invoke();
4169	>	LongBinaryOperator reducer) {
4170	>	if (transformer == null || reducer == null)
4171	>	throw new NullPointerException();
4172	>	return new MapReduceValuesToLongTask<K,V>
4173	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4174	>	null, transformer, basis, reducer).invoke();
4175		}
4176
4177		/**
#	Line 3811 | Line 4179 | public class ConcurrentHashMap<K, V>
4179		* of all values using the given reducer to combine values,
4180		* and the given basis as an identity value.
4181		*
4182	+	* @param parallelismThreshold the (estimated) number of elements
4183	+	* needed for this operation to be executed in parallel
4184		* @param transformer a function returning the transformation
4185		* for an element
4186		* @param basis the identity (initial default value) for the reduction
4187		* @param reducer a commutative associative combining function
4188		* @return the result of accumulating the given transformation
4189		* of all values
4190	+	* @since 1.8
4191		*/
4192	<	public int reduceValuesToInt(ObjectToInt<? super V> transformer,
4192	>	public int reduceValuesToInt(long parallelismThreshold,
4193	>	ToIntFunction<? super V> transformer,
4194		int basis,
4195	<	IntByIntToInt reducer) {
4196	<	return ForkJoinTasks.reduceValuesToInt
4197	<	(this, transformer, basis, reducer).invoke();
4195	>	IntBinaryOperator reducer) {
4196	>	if (transformer == null || reducer == null)
4197	>	throw new NullPointerException();
4198	>	return new MapReduceValuesToIntTask<K,V>
4199	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4200	>	null, transformer, basis, reducer).invoke();
4201		}
4202
4203		/**
4204		* Performs the given action for each entry.
4205		*
4206	+	* @param parallelismThreshold the (estimated) number of elements
4207	+	* needed for this operation to be executed in parallel
4208		* @param action the action
4209	+	* @since 1.8
4210		*/
4211	<	public void forEachEntry(Action<Map.Entry<K,V>> action) {
4212	<	ForkJoinTasks.forEachEntry
4213	<	(this, action).invoke();
4211	>	public void forEachEntry(long parallelismThreshold,
4212	>	Consumer<? super Map.Entry<K,V>> action) {
4213	>	if (action == null) throw new NullPointerException();
4214	>	new ForEachEntryTask<K,V>(null, batchFor(parallelismThreshold), 0, 0, table,
4215	>	action).invoke();
4216		}
4217
4218		/**
4219		* Performs the given action for each non-null transformation
4220		* of each entry.
4221		*
4222	+	* @param parallelismThreshold the (estimated) number of elements
4223	+	* needed for this operation to be executed in parallel
4224		* @param transformer a function returning the transformation
4225	<	* for an element, or null of there is no transformation (in
4226	<	* which case the action is not applied).
4225	>	* for an element, or null if there is no transformation (in
4226	>	* which case the action is not applied)
4227		* @param action the action
4228	+	* @param <U> the return type of the transformer
4229	+	* @since 1.8
4230		*/
4231	<	public <U> void forEachEntry(Fun<Map.Entry<K,V>, ? extends U> transformer,
4232	<	Action<U> action) {
4233	<	ForkJoinTasks.forEachEntry
4234	<	(this, transformer, action).invoke();
4231	>	public <U> void forEachEntry(long parallelismThreshold,
4232	>	Function<Map.Entry<K,V>, ? extends U> transformer,
4233	>	Consumer<? super U> action) {
4234	>	if (transformer == null || action == null)
4235	>	throw new NullPointerException();
4236	>	new ForEachTransformedEntryTask<K,V,U>
4237	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4238	>	transformer, action).invoke();
4239		}
4240
4241		/**
#	Line 3857 | Line 4245 | public class ConcurrentHashMap<K, V>
4245		* any other parallel invocations of the search function are
4246		* ignored.
4247		*
4248	+	* @param parallelismThreshold the (estimated) number of elements
4249	+	* needed for this operation to be executed in parallel
4250		* @param searchFunction a function returning a non-null
4251		* result on success, else null
4252	+	* @param <U> the return type of the search function
4253		* @return a non-null result from applying the given search
4254		* function on each entry, or null if none
4255	+	* @since 1.8
4256		*/
4257	<	public <U> U searchEntries(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4258	<	return ForkJoinTasks.searchEntries
4259	<	(this, searchFunction).invoke();
4257	>	public <U> U searchEntries(long parallelismThreshold,
4258	>	Function<Map.Entry<K,V>, ? extends U> searchFunction) {
4259	>	if (searchFunction == null) throw new NullPointerException();
4260	>	return new SearchEntriesTask<K,V,U>
4261	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4262	>	searchFunction, new AtomicReference<U>()).invoke();
4263		}
4264
4265		/**
4266		* Returns the result of accumulating all entries using the
4267		* given reducer to combine values, or null if none.
4268		*
4269	+	* @param parallelismThreshold the (estimated) number of elements
4270	+	* needed for this operation to be executed in parallel
4271		* @param reducer a commutative associative combining function
4272		* @return the result of accumulating all entries
4273	+	* @since 1.8
4274		*/
4275	<	public Map.Entry<K,V> reduceEntries(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4276	<	return ForkJoinTasks.reduceEntries
4277	<	(this, reducer).invoke();
4275	>	public Map.Entry<K,V> reduceEntries(long parallelismThreshold,
4276	>	BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4277	>	if (reducer == null) throw new NullPointerException();
4278	>	return new ReduceEntriesTask<K,V>
4279	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4280	>	null, reducer).invoke();
4281		}
4282
4283		/**
#	Line 3884 | Line 4285 | public class ConcurrentHashMap<K, V>
4285		* of all entries using the given reducer to combine values,
4286		* or null if none.
4287		*
4288	+	* @param parallelismThreshold the (estimated) number of elements
4289	+	* needed for this operation to be executed in parallel
4290		* @param transformer a function returning the transformation
4291	<	* for an element, or null of there is no transformation (in
4292	<	* which case it is not combined).
4291	>	* for an element, or null if there is no transformation (in
4292	>	* which case it is not combined)
4293		* @param reducer a commutative associative combining function
4294	+	* @param <U> the return type of the transformer
4295		* @return the result of accumulating the given transformation
4296		* of all entries
4297	+	* @since 1.8
4298		*/
4299	<	public <U> U reduceEntries(Fun<Map.Entry<K,V>, ? extends U> transformer,
4300	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4301	<	return ForkJoinTasks.reduceEntries
4302	<	(this, transformer, reducer).invoke();
4299	>	public <U> U reduceEntries(long parallelismThreshold,
4300	>	Function<Map.Entry<K,V>, ? extends U> transformer,
4301	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
4302	>	if (transformer == null || reducer == null)
4303	>	throw new NullPointerException();
4304	>	return new MapReduceEntriesTask<K,V,U>
4305	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4306	>	null, transformer, reducer).invoke();
4307		}
4308
4309		/**
#	Line 3902 | Line 4311 | public class ConcurrentHashMap<K, V>
4311		* of all entries using the given reducer to combine values,
4312		* and the given basis as an identity value.
4313		*
4314	+	* @param parallelismThreshold the (estimated) number of elements
4315	+	* needed for this operation to be executed in parallel
4316		* @param transformer a function returning the transformation
4317		* for an element
4318		* @param basis the identity (initial default value) for the reduction
4319		* @param reducer a commutative associative combining function
4320		* @return the result of accumulating the given transformation
4321		* of all entries
4322	+	* @since 1.8
4323		*/
4324	<	public double reduceEntriesToDouble(ObjectToDouble<Map.Entry<K,V>> transformer,
4324	>	public double reduceEntriesToDouble(long parallelismThreshold,
4325	>	ToDoubleFunction<Map.Entry<K,V>> transformer,
4326		double basis,
4327	<	DoubleByDoubleToDouble reducer) {
4328	<	return ForkJoinTasks.reduceEntriesToDouble
4329	<	(this, transformer, basis, reducer).invoke();
4327	>	DoubleBinaryOperator reducer) {
4328	>	if (transformer == null || reducer == null)
4329	>	throw new NullPointerException();
4330	>	return new MapReduceEntriesToDoubleTask<K,V>
4331	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4332	>	null, transformer, basis, reducer).invoke();
4333		}
4334
4335		/**
#	Line 3921 | Line 4337 | public class ConcurrentHashMap<K, V>
4337		* of all entries using the given reducer to combine values,
4338		* and the given basis as an identity value.
4339		*
4340	+	* @param parallelismThreshold the (estimated) number of elements
4341	+	* needed for this operation to be executed in parallel
4342		* @param transformer a function returning the transformation
4343		* for an element
4344		* @param basis the identity (initial default value) for the reduction
4345		* @param reducer a commutative associative combining function
4346	<	* @return  the result of accumulating the given transformation
4346	>	* @return the result of accumulating the given transformation
4347		* of all entries
4348	+	* @since 1.8
4349		*/
4350	<	public long reduceEntriesToLong(ObjectToLong<Map.Entry<K,V>> transformer,
4350	>	public long reduceEntriesToLong(long parallelismThreshold,
4351	>	ToLongFunction<Map.Entry<K,V>> transformer,
4352		long basis,
4353	<	LongByLongToLong reducer) {
4354	<	return ForkJoinTasks.reduceEntriesToLong
4355	<	(this, transformer, basis, reducer).invoke();
4353	>	LongBinaryOperator reducer) {
4354	>	if (transformer == null || reducer == null)
4355	>	throw new NullPointerException();
4356	>	return new MapReduceEntriesToLongTask<K,V>
4357	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4358	>	null, transformer, basis, reducer).invoke();
4359		}
4360
4361		/**
#	Line 3940 | Line 4363 | public class ConcurrentHashMap<K, V>
4363		* of all entries using the given reducer to combine values,
4364		* and the given basis as an identity value.
4365		*
4366	+	* @param parallelismThreshold the (estimated) number of elements
4367	+	* needed for this operation to be executed in parallel
4368		* @param transformer a function returning the transformation
4369		* for an element
4370		* @param basis the identity (initial default value) for the reduction
4371		* @param reducer a commutative associative combining function
4372		* @return the result of accumulating the given transformation
4373		* of all entries
4374	+	* @since 1.8
4375		*/
4376	<	public int reduceEntriesToInt(ObjectToInt<Map.Entry<K,V>> transformer,
4376	>	public int reduceEntriesToInt(long parallelismThreshold,
4377	>	ToIntFunction<Map.Entry<K,V>> transformer,
4378		int basis,
4379	<	IntByIntToInt reducer) {
4380	<	return ForkJoinTasks.reduceEntriesToInt
4381	<	(this, transformer, basis, reducer).invoke();
4379	>	IntBinaryOperator reducer) {
4380	>	if (transformer == null || reducer == null)
4381	>	throw new NullPointerException();
4382	>	return new MapReduceEntriesToIntTask<K,V>
4383	>	(null, batchFor(parallelismThreshold), 0, 0, table,
4384	>	null, transformer, basis, reducer).invoke();
4385		}
4386
4387	+
4388		/* ----------------Views -------------- */
4389
4390		/**
4391		* Base class for views.
4392		*/
4393	<	static abstract class CHMView<K, V> {
4394	<	final ConcurrentHashMap<K, V> map;
4395	<	CHMView(ConcurrentHashMap<K, V> map)  { this.map = map; }
4393	>	abstract static class CollectionView<K,V,E>
4394	>	implements Collection<E>, java.io.Serializable {
4395	>	private static final long serialVersionUID = 7249069246763182397L;
4396	>	final ConcurrentHashMap<K,V> map;
4397	>	CollectionView(ConcurrentHashMap<K,V> map)  { this.map = map; }
4398
4399		/**
4400		* Returns the map backing this view.
#	Line 3970 | Line 4403 | public class ConcurrentHashMap<K, V>
4403		*/
4404		public ConcurrentHashMap<K,V> getMap() { return map; }
4405
4406	<	public final int size()                 { return map.size(); }
4407	<	public final boolean isEmpty()          { return map.isEmpty(); }
4408	<	public final void clear()               { map.clear(); }
4406	>	/**
4407	>	* Removes all of the elements from this view, by removing all
4408	>	* the mappings from the map backing this view.
4409	>	*/
4410	>	public final void clear()      { map.clear(); }
4411	>	public final int size()        { return map.size(); }
4412	>	public final boolean isEmpty() { return map.isEmpty(); }
4413
4414		// implementations below rely on concrete classes supplying these
4415	<	abstract public Iterator<?> iterator();
4416	<	abstract public boolean contains(Object o);
4417	<	abstract public boolean remove(Object o);
4415	>	// abstract methods
4416	>	/**
4417	>	* Returns an iterator over the elements in this collection.
4418	>	*
4419	>	* <p>The returned iterator is
4420	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
4421	>	*
4422	>	* @return an iterator over the elements in this collection
4423	>	*/
4424	>	public abstract Iterator<E> iterator();
4425	>	public abstract boolean contains(Object o);
4426	>	public abstract boolean remove(Object o);
4427
4428		private static final String oomeMsg = "Required array size too large";
4429
4430		public final Object[] toArray() {
4431		long sz = map.mappingCount();
4432	<	if (sz > (long)(MAX_ARRAY_SIZE))
4432	>	if (sz > MAX_ARRAY_SIZE)
4433		throw new OutOfMemoryError(oomeMsg);
4434		int n = (int)sz;
4435		Object[] r = new Object[n];
4436		int i = 0;
4437	<	Iterator<?> it = iterator();
3992	<	while (it.hasNext()) {
4437	>	for (E e : this) {
4438		if (i == n) {
4439		if (n >= MAX_ARRAY_SIZE)
4440		throw new OutOfMemoryError(oomeMsg);
#	Line 3999 | Line 4444 | public class ConcurrentHashMap<K, V>
4444		n += (n >>> 1) + 1;
4445		r = Arrays.copyOf(r, n);
4446		}
4447	<	r[i++] = it.next();
4447	>	r[i++] = e;
4448		}
4449		return (i == n) ? r : Arrays.copyOf(r, i);
4450		}
4451
4452	<	@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
4452	>	@SuppressWarnings("unchecked")
4453	>	public final <T> T[] toArray(T[] a) {
4454		long sz = map.mappingCount();
4455	<	if (sz > (long)(MAX_ARRAY_SIZE))
4455	>	if (sz > MAX_ARRAY_SIZE)
4456		throw new OutOfMemoryError(oomeMsg);
4457		int m = (int)sz;
4458		T[] r = (a.length >= m) ? a :
#	Line 4014 | Line 4460 | public class ConcurrentHashMap<K, V>
4460		.newInstance(a.getClass().getComponentType(), m);
4461		int n = r.length;
4462		int i = 0;
4463	<	Iterator<?> it = iterator();
4018	<	while (it.hasNext()) {
4463	>	for (E e : this) {
4464		if (i == n) {
4465		if (n >= MAX_ARRAY_SIZE)
4466		throw new OutOfMemoryError(oomeMsg);
#	Line 4025 | Line 4470 | public class ConcurrentHashMap<K, V>
4470		n += (n >>> 1) + 1;
4471		r = Arrays.copyOf(r, n);
4472		}
4473	<	r[i++] = (T)it.next();
4473	>	r[i++] = (T)e;
4474		}
4475		if (a == r && i < n) {
4476		r[i] = null; // null-terminate
#	Line 4034 | Line 4479 | public class ConcurrentHashMap<K, V>
4479		return (i == n) ? r : Arrays.copyOf(r, i);
4480		}
4481
4482	<	public final int hashCode() {
4483	<	int h = 0;
4484	<	for (Iterator<?> it = iterator(); it.hasNext();)
4485	<	h += it.next().hashCode();
4486	<	return h;
4487	<	}
4488	<
4482	>	/**
4483	>	* Returns a string representation of this collection.
4484	>	* The string representation consists of the string representations
4485	>	* of the collection's elements in the order they are returned by
4486	>	* its iterator, enclosed in square brackets ({@code "[]"}).
4487	>	* Adjacent elements are separated by the characters {@code ", "}
4488	>	* (comma and space).  Elements are converted to strings as by
4489	>	* {@link String#valueOf(Object)}.
4490	>	*
4491	>	* @return a string representation of this collection
4492	>	*/
4493		public final String toString() {
4494		StringBuilder sb = new StringBuilder();
4495		sb.append('[');
4496	<	Iterator<?> it = iterator();
4496	>	Iterator<E> it = iterator();
4497		if (it.hasNext()) {
4498		for (;;) {
4499		Object e = it.next();
#	Line 4059 | Line 4508 | public class ConcurrentHashMap<K, V>
4508
4509		public final boolean containsAll(Collection<?> c) {
4510		if (c != this) {
4511	<	for (Iterator<?> it = c.iterator(); it.hasNext();) {
4063	<	Object e = it.next();
4511	>	for (Object e : c) {
4512		if (e == null || !contains(e))
4513		return false;
4514		}
#	Line 4069 | Line 4517 | public class ConcurrentHashMap<K, V>
4517		}
4518
4519		public final boolean removeAll(Collection<?> c) {
4520	+	if (c == null) throw new NullPointerException();
4521		boolean modified = false;
4522	<	for (Iterator<?> it = iterator(); it.hasNext();) {
4522	>	for (Iterator<E> it = iterator(); it.hasNext();) {
4523		if (c.contains(it.next())) {
4524		it.remove();
4525		modified = true;
#	Line 4080 | Line 4529 | public class ConcurrentHashMap<K, V>
4529		}
4530
4531		public final boolean retainAll(Collection<?> c) {
4532	+	if (c == null) throw new NullPointerException();
4533		boolean modified = false;
4534	<	for (Iterator<?> it = iterator(); it.hasNext();) {
4534	>	for (Iterator<E> it = iterator(); it.hasNext();) {
4535		if (!c.contains(it.next())) {
4536		it.remove();
4537		modified = true;
#	Line 4095 | Line 4545 | public class ConcurrentHashMap<K, V>
4545		/**
4546		* A view of a ConcurrentHashMap as a {@link Set} of keys, in
4547		* which additions may optionally be enabled by mapping to a
4548	<	* common value.  This class cannot be directly instantiated. See
4549	<	* {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()},
4550	<	* {@link #newKeySet(int)}.
4548	>	* common value.  This class cannot be directly instantiated.
4549	>	* See {@link #keySet() keySet()},
4550	>	* {@link #keySet(Object) keySet(V)},
4551	>	* {@link #newKeySet() newKeySet()},
4552	>	* {@link #newKeySet(int) newKeySet(int)}.
4553	>	*
4554	>	* @since 1.8
4555		*/
4556	<	public static class KeySetView<K,V> extends CHMView<K,V> implements Set<K>, java.io.Serializable {
4556	>	public static class KeySetView<K,V> extends CollectionView<K,V,K>
4557	>	implements Set<K>, java.io.Serializable {
4558		private static final long serialVersionUID = 7249069246763182397L;
4559		private final V value;
4560	<	KeySetView(ConcurrentHashMap<K, V> map, V value) {  // non-public
4560	>	KeySetView(ConcurrentHashMap<K,V> map, V value) {  // non-public
4561		super(map);
4562		this.value = value;
4563		}
#	Line 4112 | Line 4567 | public class ConcurrentHashMap<K, V>
4567		* or {@code null} if additions are not supported.
4568		*
4569		* @return the default mapped value for additions, or {@code null}
4570	<	* if not supported.
4570	>	* if not supported
4571		*/
4572		public V getMappedValue() { return value; }
4573
4574	<	// implement Set API
4575	<
4574	>	/**
4575	>	* {@inheritDoc}
4576	>	* @throws NullPointerException if the specified key is null
4577	>	*/
4578		public boolean contains(Object o) { return map.containsKey(o); }
4122	–	public boolean remove(Object o)   { return map.remove(o) != null; }
4579
4580		/**
4581	<	* Returns a "weakly consistent" iterator that will never
4582	<	* throw {@link ConcurrentModificationException}, and
4583	<	* guarantees to traverse elements as they existed upon
4128	<	* construction of the iterator, and may (but is not
4129	<	* guaranteed to) reflect any modifications subsequent to
4130	<	* construction.
4581	>	* Removes the key from this map view, by removing the key (and its
4582	>	* corresponding value) from the backing map.  This method does
4583	>	* nothing if the key is not in the map.
4584		*
4585	<	* @return an iterator over the keys of this map
4585	>	* @param  o the key to be removed from the backing map
4586	>	* @return {@code true} if the backing map contained the specified key
4587	>	* @throws NullPointerException if the specified key is null
4588	>	*/
4589	>	public boolean remove(Object o) { return map.remove(o) != null; }
4590	>
4591	>	/**
4592	>	* @return an iterator over the keys of the backing map
4593	>	*/
4594	>	public Iterator<K> iterator() {
4595	>	Node<K,V>[] t;
4596	>	ConcurrentHashMap<K,V> m = map;
4597	>	int f = (t = m.table) == null ? 0 : t.length;
4598	>	return new KeyIterator<K,V>(t, f, 0, f, m);
4599	>	}
4600	>
4601	>	/**
4602	>	* Adds the specified key to this set view by mapping the key to
4603	>	* the default mapped value in the backing map, if defined.
4604	>	*
4605	>	* @param e key to be added
4606	>	* @return {@code true} if this set changed as a result of the call
4607	>	* @throws NullPointerException if the specified key is null
4608	>	* @throws UnsupportedOperationException if no default mapped value
4609	>	* for additions was provided
4610		*/
4134	–	public Iterator<K> iterator()     { return new KeyIterator<K,V>(map); }
4611		public boolean add(K e) {
4612		V v;
4613		if ((v = value) == null)
4614		throw new UnsupportedOperationException();
4615	<	if (e == null)
4140	<	throw new NullPointerException();
4141	<	return map.internalPutIfAbsent(e, v) == null;
4615	>	return map.putVal(e, v, true) == null;
4616		}
4617	+
4618	+	/**
4619	+	* Adds all of the elements in the specified collection to this set,
4620	+	* as if by calling {@link #add} on each one.
4621	+	*
4622	+	* @param c the elements to be inserted into this set
4623	+	* @return {@code true} if this set changed as a result of the call
4624	+	* @throws NullPointerException if the collection or any of its
4625	+	* elements are {@code null}
4626	+	* @throws UnsupportedOperationException if no default mapped value
4627	+	* for additions was provided
4628	+	*/
4629		public boolean addAll(Collection<? extends K> c) {
4630		boolean added = false;
4631		V v;
4632		if ((v = value) == null)
4633		throw new UnsupportedOperationException();
4634		for (K e : c) {
4635	<	if (e == null)
4150	<	throw new NullPointerException();
4151	<	if (map.internalPutIfAbsent(e, v) == null)
4635	>	if (map.putVal(e, v, true) == null)
4636		added = true;
4637		}
4638		return added;
4639		}
4640	+
4641	+	public int hashCode() {
4642	+	int h = 0;
4643	+	for (K e : this)
4644	+	h += e.hashCode();
4645	+	return h;
4646	+	}
4647	+
4648		public boolean equals(Object o) {
4649		Set<?> c;
4650		return ((o instanceof Set) &&
#	Line 4160 | Line 4652 | public class ConcurrentHashMap<K, V>
4652		(containsAll(c) && c.containsAll(this))));
4653		}
4654
4655	<	/**
4656	<	* Performs the given action for each key.
4657	<	*
4658	<	* @param action the action
4659	<	*/
4660	<	public void forEach(Action<K> action) {
4169	<	ForkJoinTasks.forEachKey
4170	<	(map, action).invoke();
4171	<	}
4172	<
4173	<	/**
4174	<	* Performs the given action for each non-null transformation
4175	<	* of each key.
4176	<	*
4177	<	* @param transformer a function returning the transformation
4178	<	* for an element, or null of there is no transformation (in
4179	<	* which case the action is not applied).
4180	<	* @param action the action
4181	<	*/
4182	<	public <U> void forEach(Fun<? super K, ? extends U> transformer,
4183	<	Action<U> action) {
4184	<	ForkJoinTasks.forEachKey
4185	<	(map, transformer, action).invoke();
4186	<	}
4187	<
4188	<	/**
4189	<	* Returns a non-null result from applying the given search
4190	<	* function on each key, or null if none. Upon success,
4191	<	* further element processing is suppressed and the results of
4192	<	* any other parallel invocations of the search function are
4193	<	* ignored.
4194	<	*
4195	<	* @param searchFunction a function returning a non-null
4196	<	* result on success, else null
4197	<	* @return a non-null result from applying the given search
4198	<	* function on each key, or null if none
4199	<	*/
4200	<	public <U> U search(Fun<? super K, ? extends U> searchFunction) {
4201	<	return ForkJoinTasks.searchKeys
4202	<	(map, searchFunction).invoke();
4203	<	}
4204	<
4205	<	/**
4206	<	* Returns the result of accumulating all keys using the given
4207	<	* reducer to combine values, or null if none.
4208	<	*
4209	<	* @param reducer a commutative associative combining function
4210	<	* @return the result of accumulating all keys using the given
4211	<	* reducer to combine values, or null if none
4212	<	*/
4213	<	public K reduce(BiFun<? super K, ? super K, ? extends K> reducer) {
4214	<	return ForkJoinTasks.reduceKeys
4215	<	(map, reducer).invoke();
4216	<	}
4217	<
4218	<	/**
4219	<	* Returns the result of accumulating the given transformation
4220	<	* of all keys using the given reducer to combine values, and
4221	<	* the given basis as an identity value.
4222	<	*
4223	<	* @param transformer a function returning the transformation
4224	<	* for an element
4225	<	* @param basis the identity (initial default value) for the reduction
4226	<	* @param reducer a commutative associative combining function
4227	<	* @return  the result of accumulating the given transformation
4228	<	* of all keys
4229	<	*/
4230	<	public double reduceToDouble(ObjectToDouble<? super K> transformer,
4231	<	double basis,
4232	<	DoubleByDoubleToDouble reducer) {
4233	<	return ForkJoinTasks.reduceKeysToDouble
4234	<	(map, transformer, basis, reducer).invoke();
4235	<	}
4236	<
4237	<
4238	<	/**
4239	<	* Returns the result of accumulating the given transformation
4240	<	* of all keys using the given reducer to combine values, and
4241	<	* the given basis as an identity value.
4242	<	*
4243	<	* @param transformer a function returning the transformation
4244	<	* for an element
4245	<	* @param basis the identity (initial default value) for the reduction
4246	<	* @param reducer a commutative associative combining function
4247	<	* @return the result of accumulating the given transformation
4248	<	* of all keys
4249	<	*/
4250	<	public long reduceToLong(ObjectToLong<? super K> transformer,
4251	<	long basis,
4252	<	LongByLongToLong reducer) {
4253	<	return ForkJoinTasks.reduceKeysToLong
4254	<	(map, transformer, basis, reducer).invoke();
4655	>	public Spliterator<K> spliterator() {
4656	>	Node<K,V>[] t;
4657	>	ConcurrentHashMap<K,V> m = map;
4658	>	long n = m.sumCount();
4659	>	int f = (t = m.table) == null ? 0 : t.length;
4660	>	return new KeySpliterator<K,V>(t, f, 0, f, n < 0L ? 0L : n);
4661		}
4662
4663	<	/**
4664	<	* Returns the result of accumulating the given transformation
4665	<	* of all keys using the given reducer to combine values, and
4666	<	* the given basis as an identity value.
4667	<	*
4668	<	* @param transformer a function returning the transformation
4669	<	* for an element
4670	<	* @param basis the identity (initial default value) for the reduction
4265	<	* @param reducer a commutative associative combining function
4266	<	* @return the result of accumulating the given transformation
4267	<	* of all keys
4268	<	*/
4269	<	public int reduceToInt(ObjectToInt<? super K> transformer,
4270	<	int basis,
4271	<	IntByIntToInt reducer) {
4272	<	return ForkJoinTasks.reduceKeysToInt
4273	<	(map, transformer, basis, reducer).invoke();
4663	>	public void forEach(Consumer<? super K> action) {
4664	>	if (action == null) throw new NullPointerException();
4665	>	Node<K,V>[] t;
4666	>	if ((t = map.table) != null) {
4667	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4668	>	for (Node<K,V> p; (p = it.advance()) != null; )
4669	>	action.accept(p.key);
4670	>	}
4671		}
4275	–
4672		}
4673
4674		/**
4675		* A view of a ConcurrentHashMap as a {@link Collection} of
4676		* values, in which additions are disabled. This class cannot be
4677	<	* directly instantiated. See {@link #values},
4678	<	*
4679	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
4680	<	* that will never throw {@link ConcurrentModificationException},
4681	<	* and guarantees to traverse elements as they existed upon
4682	<	* construction of the iterator, and may (but is not guaranteed to)
4683	<	* reflect any modifications subsequent to construction.
4684	<	*/
4685	<	public static final class ValuesView<K,V> extends CHMView<K,V>
4686	<	implements Collection<V> {
4291	<	ValuesView(ConcurrentHashMap<K, V> map)   { super(map); }
4292	<	public final boolean contains(Object o) { return map.containsValue(o); }
4677	>	* directly instantiated. See {@link #values()}.
4678	>	*/
4679	>	static final class ValuesView<K,V> extends CollectionView<K,V,V>
4680	>	implements Collection<V>, java.io.Serializable {
4681	>	private static final long serialVersionUID = 2249069246763182397L;
4682	>	ValuesView(ConcurrentHashMap<K,V> map) { super(map); }
4683	>	public final boolean contains(Object o) {
4684	>	return map.containsValue(o);
4685	>	}
4686	>
4687		public final boolean remove(Object o) {
4688		if (o != null) {
4689	<	Iterator<V> it = new ValueIterator<K,V>(map);
4296	<	while (it.hasNext()) {
4689	>	for (Iterator<V> it = iterator(); it.hasNext();) {
4690		if (o.equals(it.next())) {
4691		it.remove();
4692		return true;
#	Line 4303 | Line 4696 | public class ConcurrentHashMap<K, V>
4696		return false;
4697		}
4698
4306	–	/**
4307	–	* Returns a "weakly consistent" iterator that will never
4308	–	* throw {@link ConcurrentModificationException}, and
4309	–	* guarantees to traverse elements as they existed upon
4310	–	* construction of the iterator, and may (but is not
4311	–	* guaranteed to) reflect any modifications subsequent to
4312	–	* construction.
4313	–	*
4314	–	* @return an iterator over the values of this map
4315	–	*/
4699		public final Iterator<V> iterator() {
4700	<	return new ValueIterator<K,V>(map);
4700	>	ConcurrentHashMap<K,V> m = map;
4701	>	Node<K,V>[] t;
4702	>	int f = (t = m.table) == null ? 0 : t.length;
4703	>	return new ValueIterator<K,V>(t, f, 0, f, m);
4704		}
4705	+
4706		public final boolean add(V e) {
4707		throw new UnsupportedOperationException();
4708		}
#	Line 4323 | Line 4710 | public class ConcurrentHashMap<K, V>
4710		throw new UnsupportedOperationException();
4711		}
4712
4713	<	/**
4714	<	* Performs the given action for each value.
4328	<	*
4329	<	* @param action the action
4330	<	*/
4331	<	public void forEach(Action<V> action) {
4332	<	ForkJoinTasks.forEachValue
4333	<	(map, action).invoke();
4334	<	}
4335	<
4336	<	/**
4337	<	* Performs the given action for each non-null transformation
4338	<	* of each value.
4339	<	*
4340	<	* @param transformer a function returning the transformation
4341	<	* for an element, or null of there is no transformation (in
4342	<	* which case the action is not applied).
4343	<	*/
4344	<	public <U> void forEach(Fun<? super V, ? extends U> transformer,
4345	<	Action<U> action) {
4346	<	ForkJoinTasks.forEachValue
4347	<	(map, transformer, action).invoke();
4713	>	public boolean removeIf(Predicate<? super V> filter) {
4714	>	return map.removeValueIf(filter);
4715		}
4716
4717	<	/**
4718	<	* Returns a non-null result from applying the given search
4719	<	* function on each value, or null if none.  Upon success,
4720	<	* further element processing is suppressed and the results of
4721	<	* any other parallel invocations of the search function are
4722	<	* ignored.
4356	<	*
4357	<	* @param searchFunction a function returning a non-null
4358	<	* result on success, else null
4359	<	* @return a non-null result from applying the given search
4360	<	* function on each value, or null if none
4361	<	*
4362	<	*/
4363	<	public <U> U search(Fun<? super V, ? extends U> searchFunction) {
4364	<	return ForkJoinTasks.searchValues
4365	<	(map, searchFunction).invoke();
4717	>	public Spliterator<V> spliterator() {
4718	>	Node<K,V>[] t;
4719	>	ConcurrentHashMap<K,V> m = map;
4720	>	long n = m.sumCount();
4721	>	int f = (t = m.table) == null ? 0 : t.length;
4722	>	return new ValueSpliterator<K,V>(t, f, 0, f, n < 0L ? 0L : n);
4723		}
4724
4725	<	/**
4726	<	* Returns the result of accumulating all values using the
4727	<	* given reducer to combine values, or null if none.
4728	<	*
4729	<	* @param reducer a commutative associative combining function
4730	<	* @return  the result of accumulating all values
4731	<	*/
4732	<	public V reduce(BiFun<? super V, ? super V, ? extends V> reducer) {
4376	<	return ForkJoinTasks.reduceValues
4377	<	(map, reducer).invoke();
4378	<	}
4379	<
4380	<	/**
4381	<	* Returns the result of accumulating the given transformation
4382	<	* of all values using the given reducer to combine values, or
4383	<	* null if none.
4384	<	*
4385	<	* @param transformer a function returning the transformation
4386	<	* for an element, or null of there is no transformation (in
4387	<	* which case it is not combined).
4388	<	* @param reducer a commutative associative combining function
4389	<	* @return the result of accumulating the given transformation
4390	<	* of all values
4391	<	*/
4392	<	public <U> U reduce(Fun<? super V, ? extends U> transformer,
4393	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4394	<	return ForkJoinTasks.reduceValues
4395	<	(map, transformer, reducer).invoke();
4396	<	}
4397	<
4398	<	/**
4399	<	* Returns the result of accumulating the given transformation
4400	<	* of all values using the given reducer to combine values,
4401	<	* and the given basis as an identity value.
4402	<	*
4403	<	* @param transformer a function returning the transformation
4404	<	* for an element
4405	<	* @param basis the identity (initial default value) for the reduction
4406	<	* @param reducer a commutative associative combining function
4407	<	* @return the result of accumulating the given transformation
4408	<	* of all values
4409	<	*/
4410	<	public double reduceToDouble(ObjectToDouble<? super V> transformer,
4411	<	double basis,
4412	<	DoubleByDoubleToDouble reducer) {
4413	<	return ForkJoinTasks.reduceValuesToDouble
4414	<	(map, transformer, basis, reducer).invoke();
4415	<	}
4416	<
4417	<	/**
4418	<	* Returns the result of accumulating the given transformation
4419	<	* of all values using the given reducer to combine values,
4420	<	* and the given basis as an identity value.
4421	<	*
4422	<	* @param transformer a function returning the transformation
4423	<	* for an element
4424	<	* @param basis the identity (initial default value) for the reduction
4425	<	* @param reducer a commutative associative combining function
4426	<	* @return the result of accumulating the given transformation
4427	<	* of all values
4428	<	*/
4429	<	public long reduceToLong(ObjectToLong<? super V> transformer,
4430	<	long basis,
4431	<	LongByLongToLong reducer) {
4432	<	return ForkJoinTasks.reduceValuesToLong
4433	<	(map, transformer, basis, reducer).invoke();
4434	<	}
4435	<
4436	<	/**
4437	<	* Returns the result of accumulating the given transformation
4438	<	* of all values using the given reducer to combine values,
4439	<	* and the given basis as an identity value.
4440	<	*
4441	<	* @param transformer a function returning the transformation
4442	<	* for an element
4443	<	* @param basis the identity (initial default value) for the reduction
4444	<	* @param reducer a commutative associative combining function
4445	<	* @return the result of accumulating the given transformation
4446	<	* of all values
4447	<	*/
4448	<	public int reduceToInt(ObjectToInt<? super V> transformer,
4449	<	int basis,
4450	<	IntByIntToInt reducer) {
4451	<	return ForkJoinTasks.reduceValuesToInt
4452	<	(map, transformer, basis, reducer).invoke();
4725	>	public void forEach(Consumer<? super V> action) {
4726	>	if (action == null) throw new NullPointerException();
4727	>	Node<K,V>[] t;
4728	>	if ((t = map.table) != null) {
4729	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4730	>	for (Node<K,V> p; (p = it.advance()) != null; )
4731	>	action.accept(p.val);
4732	>	}
4733		}
4454	–
4734		}
4735
4736		/**
4737		* A view of a ConcurrentHashMap as a {@link Set} of (key, value)
4738		* entries.  This class cannot be directly instantiated. See
4739	<	* {@link #entrySet}.
4739	>	* {@link #entrySet()}.
4740		*/
4741	<	public static final class EntrySetView<K,V> extends CHMView<K,V>
4742	<	implements Set<Map.Entry<K,V>> {
4743	<	EntrySetView(ConcurrentHashMap<K, V> map) { super(map); }
4744	<	public final boolean contains(Object o) {
4741	>	static final class EntrySetView<K,V> extends CollectionView<K,V,Map.Entry<K,V>>
4742	>	implements Set<Map.Entry<K,V>>, java.io.Serializable {
4743	>	private static final long serialVersionUID = 2249069246763182397L;
4744	>	EntrySetView(ConcurrentHashMap<K,V> map) { super(map); }
4745	>
4746	>	public boolean contains(Object o) {
4747		Object k, v, r; Map.Entry<?,?> e;
4748		return ((o instanceof Map.Entry) &&
4749		(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
#	Line 4470 | Line 4751 | public class ConcurrentHashMap<K, V>
4751		(v = e.getValue()) != null &&
4752		(v == r || v.equals(r)));
4753		}
4754	<	public final boolean remove(Object o) {
4754	>
4755	>	public boolean remove(Object o) {
4756		Object k, v; Map.Entry<?,?> e;
4757		return ((o instanceof Map.Entry) &&
4758		(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
#	Line 4479 | Line 4761 | public class ConcurrentHashMap<K, V>
4761		}
4762
4763		/**
4764	<	* Returns a "weakly consistent" iterator that will never
4483	<	* throw {@link ConcurrentModificationException}, and
4484	<	* guarantees to traverse elements as they existed upon
4485	<	* construction of the iterator, and may (but is not
4486	<	* guaranteed to) reflect any modifications subsequent to
4487	<	* construction.
4488	<	*
4489	<	* @return an iterator over the entries of this map
4764	>	* @return an iterator over the entries of the backing map
4765		*/
4766	<	public final Iterator<Map.Entry<K,V>> iterator() {
4767	<	return new EntryIterator<K,V>(map);
4766	>	public Iterator<Map.Entry<K,V>> iterator() {
4767	>	ConcurrentHashMap<K,V> m = map;
4768	>	Node<K,V>[] t;
4769	>	int f = (t = m.table) == null ? 0 : t.length;
4770	>	return new EntryIterator<K,V>(t, f, 0, f, m);
4771		}
4772
4773	<	public final boolean add(Entry<K,V> e) {
4774	<	K key = e.getKey();
4497	<	V value = e.getValue();
4498	<	if (key == null || value == null)
4499	<	throw new NullPointerException();
4500	<	return map.internalPut(key, value) == null;
4773	>	public boolean add(Entry<K,V> e) {
4774	>	return map.putVal(e.getKey(), e.getValue(), false) == null;
4775		}
4776	<	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
4776	>
4777	>	public boolean addAll(Collection<? extends Entry<K,V>> c) {
4778		boolean added = false;
4779		for (Entry<K,V> e : c) {
4780		if (add(e))
#	Line 4507 | Line 4782 | public class ConcurrentHashMap<K, V>
4782		}
4783		return added;
4784		}
4510	–	public boolean equals(Object o) {
4511	–	Set<?> c;
4512	–	return ((o instanceof Set) &&
4513	–	((c = (Set<?>)o) == this ||
4514	–	(containsAll(c) && c.containsAll(this))));
4515	–	}
4516	–
4517	–	/**
4518	–	* Performs the given action for each entry.
4519	–	*
4520	–	* @param action the action
4521	–	*/
4522	–	public void forEach(Action<Map.Entry<K,V>> action) {
4523	–	ForkJoinTasks.forEachEntry
4524	–	(map, action).invoke();
4525	–	}
4785
4786	<	/**
4787	<	* Performs the given action for each non-null transformation
4529	<	* of each entry.
4530	<	*
4531	<	* @param transformer a function returning the transformation
4532	<	* for an element, or null of there is no transformation (in
4533	<	* which case the action is not applied).
4534	<	* @param action the action
4535	<	*/
4536	<	public <U> void forEach(Fun<Map.Entry<K,V>, ? extends U> transformer,
4537	<	Action<U> action) {
4538	<	ForkJoinTasks.forEachEntry
4539	<	(map, transformer, action).invoke();
4786	>	public boolean removeIf(Predicate<? super Entry<K,V>> filter) {
4787	>	return map.removeEntryIf(filter);
4788		}
4789
4790	<	/**
4791	<	* Returns a non-null result from applying the given search
4792	<	* function on each entry, or null if none.  Upon success,
4793	<	* further element processing is suppressed and the results of
4794	<	* any other parallel invocations of the search function are
4795	<	* ignored.
4796	<	*
4797	<	* @param searchFunction a function returning a non-null
4798	<	* result on success, else null
4799	<	* @return a non-null result from applying the given search
4552	<	* function on each entry, or null if none
4553	<	*/
4554	<	public <U> U search(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4555	<	return ForkJoinTasks.searchEntries
4556	<	(map, searchFunction).invoke();
4557	<	}
4558	<
4559	<	/**
4560	<	* Returns the result of accumulating all entries using the
4561	<	* given reducer to combine values, or null if none.
4562	<	*
4563	<	* @param reducer a commutative associative combining function
4564	<	* @return the result of accumulating all entries
4565	<	*/
4566	<	public Map.Entry<K,V> reduce(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4567	<	return ForkJoinTasks.reduceEntries
4568	<	(map, reducer).invoke();
4569	<	}
4570	<
4571	<	/**
4572	<	* Returns the result of accumulating the given transformation
4573	<	* of all entries using the given reducer to combine values,
4574	<	* or null if none.
4575	<	*
4576	<	* @param transformer a function returning the transformation
4577	<	* for an element, or null of there is no transformation (in
4578	<	* which case it is not combined).
4579	<	* @param reducer a commutative associative combining function
4580	<	* @return the result of accumulating the given transformation
4581	<	* of all entries
4582	<	*/
4583	<	public <U> U reduce(Fun<Map.Entry<K,V>, ? extends U> transformer,
4584	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4585	<	return ForkJoinTasks.reduceEntries
4586	<	(map, transformer, reducer).invoke();
4587	<	}
4588	<
4589	<	/**
4590	<	* Returns the result of accumulating the given transformation
4591	<	* of all entries using the given reducer to combine values,
4592	<	* and the given basis as an identity value.
4593	<	*
4594	<	* @param transformer a function returning the transformation
4595	<	* for an element
4596	<	* @param basis the identity (initial default value) for the reduction
4597	<	* @param reducer a commutative associative combining function
4598	<	* @return the result of accumulating the given transformation
4599	<	* of all entries
4600	<	*/
4601	<	public double reduceToDouble(ObjectToDouble<Map.Entry<K,V>> transformer,
4602	<	double basis,
4603	<	DoubleByDoubleToDouble reducer) {
4604	<	return ForkJoinTasks.reduceEntriesToDouble
4605	<	(map, transformer, basis, reducer).invoke();
4606	<	}
4607	<
4608	<	/**
4609	<	* Returns the result of accumulating the given transformation
4610	<	* of all entries using the given reducer to combine values,
4611	<	* and the given basis as an identity value.
4612	<	*
4613	<	* @param transformer a function returning the transformation
4614	<	* for an element
4615	<	* @param basis the identity (initial default value) for the reduction
4616	<	* @param reducer a commutative associative combining function
4617	<	* @return  the result of accumulating the given transformation
4618	<	* of all entries
4619	<	*/
4620	<	public long reduceToLong(ObjectToLong<Map.Entry<K,V>> transformer,
4621	<	long basis,
4622	<	LongByLongToLong reducer) {
4623	<	return ForkJoinTasks.reduceEntriesToLong
4624	<	(map, transformer, basis, reducer).invoke();
4625	<	}
4626	<
4627	<	/**
4628	<	* Returns the result of accumulating the given transformation
4629	<	* of all entries using the given reducer to combine values,
4630	<	* and the given basis as an identity value.
4631	<	*
4632	<	* @param transformer a function returning the transformation
4633	<	* for an element
4634	<	* @param basis the identity (initial default value) for the reduction
4635	<	* @param reducer a commutative associative combining function
4636	<	* @return the result of accumulating the given transformation
4637	<	* of all entries
4638	<	*/
4639	<	public int reduceToInt(ObjectToInt<Map.Entry<K,V>> transformer,
4640	<	int basis,
4641	<	IntByIntToInt reducer) {
4642	<	return ForkJoinTasks.reduceEntriesToInt
4643	<	(map, transformer, basis, reducer).invoke();
4644	<	}
4645	<
4646	<	}
4647	<
4648	<	// ---------------------------------------------------------------------
4649	<
4650	<	/**
4651	<	* Predefined tasks for performing bulk parallel operations on
4652	<	* ConcurrentHashMaps. These tasks follow the forms and rules used
4653	<	* for bulk operations. Each method has the same name, but returns
4654	<	* a task rather than invoking it. These methods may be useful in
4655	<	* custom applications such as submitting a task without waiting
4656	<	* for completion, using a custom pool, or combining with other
4657	<	* tasks.
4658	<	*/
4659	<	public static class ForkJoinTasks {
4660	<	private ForkJoinTasks() {}
4661	<
4662	<	/**
4663	<	* Returns a task that when invoked, performs the given
4664	<	* action for each (key, value)
4665	<	*
4666	<	* @param map the map
4667	<	* @param action the action
4668	<	* @return the task
4669	<	*/
4670	<	public static <K,V> ForkJoinTask<Void> forEach
4671	<	(ConcurrentHashMap<K,V> map,
4672	<	BiAction<K,V> action) {
4673	<	if (action == null) throw new NullPointerException();
4674	<	return new ForEachMappingTask<K,V>(map, null, -1, null, action);
4675	<	}
4676	<
4677	<	/**
4678	<	* Returns a task that when invoked, performs the given
4679	<	* action for each non-null transformation of each (key, value)
4680	<	*
4681	<	* @param map the map
4682	<	* @param transformer a function returning the transformation
4683	<	* for an element, or null if there is no transformation (in
4684	<	* which case the action is not applied)
4685	<	* @param action the action
4686	<	* @return the task
4687	<	*/
4688	<	public static <K,V,U> ForkJoinTask<Void> forEach
4689	<	(ConcurrentHashMap<K,V> map,
4690	<	BiFun<? super K, ? super V, ? extends U> transformer,
4691	<	Action<U> action) {
4692	<	if (transformer == null || action == null)
4693	<	throw new NullPointerException();
4694	<	return new ForEachTransformedMappingTask<K,V,U>
4695	<	(map, null, -1, null, transformer, action);
4696	<	}
4697	<
4698	<	/**
4699	<	* Returns a task that when invoked, returns a non-null result
4700	<	* from applying the given search function on each (key,
4701	<	* value), or null if none. Upon success, further element
4702	<	* processing is suppressed and the results of any other
4703	<	* parallel invocations of the search function are ignored.
4704	<	*
4705	<	* @param map the map
4706	<	* @param searchFunction a function returning a non-null
4707	<	* result on success, else null
4708	<	* @return the task
4709	<	*/
4710	<	public static <K,V,U> ForkJoinTask<U> search
4711	<	(ConcurrentHashMap<K,V> map,
4712	<	BiFun<? super K, ? super V, ? extends U> searchFunction) {
4713	<	if (searchFunction == null) throw new NullPointerException();
4714	<	return new SearchMappingsTask<K,V,U>
4715	<	(map, null, -1, null, searchFunction,
4716	<	new AtomicReference<U>());
4717	<	}
4718	<
4719	<	/**
4720	<	* Returns a task that when invoked, returns the result of
4721	<	* accumulating the given transformation of all (key, value) pairs
4722	<	* using the given reducer to combine values, or null if none.
4723	<	*
4724	<	* @param map the map
4725	<	* @param transformer a function returning the transformation
4726	<	* for an element, or null if there is no transformation (in
4727	<	* which case it is not combined).
4728	<	* @param reducer a commutative associative combining function
4729	<	* @return the task
4730	<	*/
4731	<	public static <K,V,U> ForkJoinTask<U> reduce
4732	<	(ConcurrentHashMap<K,V> map,
4733	<	BiFun<? super K, ? super V, ? extends U> transformer,
4734	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4735	<	if (transformer == null || reducer == null)
4736	<	throw new NullPointerException();
4737	<	return new MapReduceMappingsTask<K,V,U>
4738	<	(map, null, -1, null, transformer, reducer);
4739	<	}
4740	<
4741	<	/**
4742	<	* Returns a task that when invoked, returns the result of
4743	<	* accumulating the given transformation of all (key, value) pairs
4744	<	* using the given reducer to combine values, and the given
4745	<	* basis as an identity value.
4746	<	*
4747	<	* @param map the map
4748	<	* @param transformer a function returning the transformation
4749	<	* for an element
4750	<	* @param basis the identity (initial default value) for the reduction
4751	<	* @param reducer a commutative associative combining function
4752	<	* @return the task
4753	<	*/
4754	<	public static <K,V> ForkJoinTask<Double> reduceToDouble
4755	<	(ConcurrentHashMap<K,V> map,
4756	<	ObjectByObjectToDouble<? super K, ? super V> transformer,
4757	<	double basis,
4758	<	DoubleByDoubleToDouble reducer) {
4759	<	if (transformer == null || reducer == null)
4760	<	throw new NullPointerException();
4761	<	return new MapReduceMappingsToDoubleTask<K,V>
4762	<	(map, null, -1, null, transformer, basis, reducer);
4763	<	}
4764	<
4765	<	/**
4766	<	* Returns a task that when invoked, returns the result of
4767	<	* accumulating the given transformation of all (key, value) pairs
4768	<	* using the given reducer to combine values, and the given
4769	<	* basis as an identity value.
4770	<	*
4771	<	* @param map the map
4772	<	* @param transformer a function returning the transformation
4773	<	* for an element
4774	<	* @param basis the identity (initial default value) for the reduction
4775	<	* @param reducer a commutative associative combining function
4776	<	* @return the task
4777	<	*/
4778	<	public static <K,V> ForkJoinTask<Long> reduceToLong
4779	<	(ConcurrentHashMap<K,V> map,
4780	<	ObjectByObjectToLong<? super K, ? super V> transformer,
4781	<	long basis,
4782	<	LongByLongToLong reducer) {
4783	<	if (transformer == null || reducer == null)
4784	<	throw new NullPointerException();
4785	<	return new MapReduceMappingsToLongTask<K,V>
4786	<	(map, null, -1, null, transformer, basis, reducer);
4787	<	}
4788	<
4789	<	/**
4790	<	* Returns a task that when invoked, returns the result of
4791	<	* accumulating the given transformation of all (key, value) pairs
4792	<	* using the given reducer to combine values, and the given
4793	<	* basis as an identity value.
4794	<	*
4795	<	* @param transformer a function returning the transformation
4796	<	* for an element
4797	<	* @param basis the identity (initial default value) for the reduction
4798	<	* @param reducer a commutative associative combining function
4799	<	* @return the task
4800	<	*/
4801	<	public static <K,V> ForkJoinTask<Integer> reduceToInt
4802	<	(ConcurrentHashMap<K,V> map,
4803	<	ObjectByObjectToInt<? super K, ? super V> transformer,
4804	<	int basis,
4805	<	IntByIntToInt reducer) {
4806	<	if (transformer == null || reducer == null)
4807	<	throw new NullPointerException();
4808	<	return new MapReduceMappingsToIntTask<K,V>
4809	<	(map, null, -1, null, transformer, basis, reducer);
4810	<	}
4811	<
4812	<	/**
4813	<	* Returns a task that when invoked, performs the given action
4814	<	* for each key.
4815	<	*
4816	<	* @param map the map
4817	<	* @param action the action
4818	<	* @return the task
4819	<	*/
4820	<	public static <K,V> ForkJoinTask<Void> forEachKey
4821	<	(ConcurrentHashMap<K,V> map,
4822	<	Action<K> action) {
4823	<	if (action == null) throw new NullPointerException();
4824	<	return new ForEachKeyTask<K,V>(map, null, -1, null, action);
4825	<	}
4826	<
4827	<	/**
4828	<	* Returns a task that when invoked, performs the given action
4829	<	* for each non-null transformation of each key.
4830	<	*
4831	<	* @param map the map
4832	<	* @param transformer a function returning the transformation
4833	<	* for an element, or null if there is no transformation (in
4834	<	* which case the action is not applied)
4835	<	* @param action the action
4836	<	* @return the task
4837	<	*/
4838	<	public static <K,V,U> ForkJoinTask<Void> forEachKey
4839	<	(ConcurrentHashMap<K,V> map,
4840	<	Fun<? super K, ? extends U> transformer,
4841	<	Action<U> action) {
4842	<	if (transformer == null || action == null)
4843	<	throw new NullPointerException();
4844	<	return new ForEachTransformedKeyTask<K,V,U>
4845	<	(map, null, -1, null, transformer, action);
4846	<	}
4847	<
4848	<	/**
4849	<	* Returns a task that when invoked, returns a non-null result
4850	<	* from applying the given search function on each key, or
4851	<	* null if none.  Upon success, further element processing is
4852	<	* suppressed and the results of any other parallel
4853	<	* invocations of the search function are ignored.
4854	<	*
4855	<	* @param map the map
4856	<	* @param searchFunction a function returning a non-null
4857	<	* result on success, else null
4858	<	* @return the task
4859	<	*/
4860	<	public static <K,V,U> ForkJoinTask<U> searchKeys
4861	<	(ConcurrentHashMap<K,V> map,
4862	<	Fun<? super K, ? extends U> searchFunction) {
4863	<	if (searchFunction == null) throw new NullPointerException();
4864	<	return new SearchKeysTask<K,V,U>
4865	<	(map, null, -1, null, searchFunction,
4866	<	new AtomicReference<U>());
4867	<	}
4868	<
4869	<	/**
4870	<	* Returns a task that when invoked, returns the result of
4871	<	* accumulating all keys using the given reducer to combine
4872	<	* values, or null if none.
4873	<	*
4874	<	* @param map the map
4875	<	* @param reducer a commutative associative combining function
4876	<	* @return the task
4877	<	*/
4878	<	public static <K,V> ForkJoinTask<K> reduceKeys
4879	<	(ConcurrentHashMap<K,V> map,
4880	<	BiFun<? super K, ? super K, ? extends K> reducer) {
4881	<	if (reducer == null) throw new NullPointerException();
4882	<	return new ReduceKeysTask<K,V>
4883	<	(map, null, -1, null, reducer);
4884	<	}
4885	<
4886	<	/**
4887	<	* Returns a task that when invoked, returns the result of
4888	<	* accumulating the given transformation of all keys using the given
4889	<	* reducer to combine values, or null if none.
4890	<	*
4891	<	* @param map the map
4892	<	* @param transformer a function returning the transformation
4893	<	* for an element, or null if there is no transformation (in
4894	<	* which case it is not combined).
4895	<	* @param reducer a commutative associative combining function
4896	<	* @return the task
4897	<	*/
4898	<	public static <K,V,U> ForkJoinTask<U> reduceKeys
4899	<	(ConcurrentHashMap<K,V> map,
4900	<	Fun<? super K, ? extends U> transformer,
4901	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4902	<	if (transformer == null || reducer == null)
4903	<	throw new NullPointerException();
4904	<	return new MapReduceKeysTask<K,V,U>
4905	<	(map, null, -1, null, transformer, reducer);
4906	<	}
4907	<
4908	<	/**
4909	<	* Returns a task that when invoked, returns the result of
4910	<	* accumulating the given transformation of all keys using the given
4911	<	* reducer to combine values, and the given basis as an
4912	<	* identity value.
4913	<	*
4914	<	* @param map the map
4915	<	* @param transformer a function returning the transformation
4916	<	* for an element
4917	<	* @param basis the identity (initial default value) for the reduction
4918	<	* @param reducer a commutative associative combining function
4919	<	* @return the task
4920	<	*/
4921	<	public static <K,V> ForkJoinTask<Double> reduceKeysToDouble
4922	<	(ConcurrentHashMap<K,V> map,
4923	<	ObjectToDouble<? super K> transformer,
4924	<	double basis,
4925	<	DoubleByDoubleToDouble reducer) {
4926	<	if (transformer == null || reducer == null)
4927	<	throw new NullPointerException();
4928	<	return new MapReduceKeysToDoubleTask<K,V>
4929	<	(map, null, -1, null, transformer, basis, reducer);
4930	<	}
4931	<
4932	<	/**
4933	<	* Returns a task that when invoked, returns the result of
4934	<	* accumulating the given transformation of all keys using the given
4935	<	* reducer to combine values, and the given basis as an
4936	<	* identity value.
4937	<	*
4938	<	* @param map the map
4939	<	* @param transformer a function returning the transformation
4940	<	* for an element
4941	<	* @param basis the identity (initial default value) for the reduction
4942	<	* @param reducer a commutative associative combining function
4943	<	* @return the task
4944	<	*/
4945	<	public static <K,V> ForkJoinTask<Long> reduceKeysToLong
4946	<	(ConcurrentHashMap<K,V> map,
4947	<	ObjectToLong<? super K> transformer,
4948	<	long basis,
4949	<	LongByLongToLong reducer) {
4950	<	if (transformer == null || reducer == null)
4951	<	throw new NullPointerException();
4952	<	return new MapReduceKeysToLongTask<K,V>
4953	<	(map, null, -1, null, transformer, basis, reducer);
4954	<	}
4955	<
4956	<	/**
4957	<	* Returns a task that when invoked, returns the result of
4958	<	* accumulating the given transformation of all keys using the given
4959	<	* reducer to combine values, and the given basis as an
4960	<	* identity value.
4961	<	*
4962	<	* @param map the map
4963	<	* @param transformer a function returning the transformation
4964	<	* for an element
4965	<	* @param basis the identity (initial default value) for the reduction
4966	<	* @param reducer a commutative associative combining function
4967	<	* @return the task
4968	<	*/
4969	<	public static <K,V> ForkJoinTask<Integer> reduceKeysToInt
4970	<	(ConcurrentHashMap<K,V> map,
4971	<	ObjectToInt<? super K> transformer,
4972	<	int basis,
4973	<	IntByIntToInt reducer) {
4974	<	if (transformer == null || reducer == null)
4975	<	throw new NullPointerException();
4976	<	return new MapReduceKeysToIntTask<K,V>
4977	<	(map, null, -1, null, transformer, basis, reducer);
4978	<	}
4979	<
4980	<	/**
4981	<	* Returns a task that when invoked, performs the given action
4982	<	* for each value.
4983	<	*
4984	<	* @param map the map
4985	<	* @param action the action
4986	<	*/
4987	<	public static <K,V> ForkJoinTask<Void> forEachValue
4988	<	(ConcurrentHashMap<K,V> map,
4989	<	Action<V> action) {
4990	<	if (action == null) throw new NullPointerException();
4991	<	return new ForEachValueTask<K,V>(map, null, -1, null, action);
4992	<	}
4993	<
4994	<	/**
4995	<	* Returns a task that when invoked, performs the given action
4996	<	* for each non-null transformation of each value.
4997	<	*
4998	<	* @param map the map
4999	<	* @param transformer a function returning the transformation
5000	<	* for an element, or null if there is no transformation (in
5001	<	* which case the action is not applied)
5002	<	* @param action the action
5003	<	*/
5004	<	public static <K,V,U> ForkJoinTask<Void> forEachValue
5005	<	(ConcurrentHashMap<K,V> map,
5006	<	Fun<? super V, ? extends U> transformer,
5007	<	Action<U> action) {
5008	<	if (transformer == null || action == null)
5009	<	throw new NullPointerException();
5010	<	return new ForEachTransformedValueTask<K,V,U>
5011	<	(map, null, -1, null, transformer, action);
5012	<	}
5013	<
5014	<	/**
5015	<	* Returns a task that when invoked, returns a non-null result
5016	<	* from applying the given search function on each value, or
5017	<	* null if none.  Upon success, further element processing is
5018	<	* suppressed and the results of any other parallel
5019	<	* invocations of the search function are ignored.
5020	<	*
5021	<	* @param map the map
5022	<	* @param searchFunction a function returning a non-null
5023	<	* result on success, else null
5024	<	* @return the task
5025	<	*/
5026	<	public static <K,V,U> ForkJoinTask<U> searchValues
5027	<	(ConcurrentHashMap<K,V> map,
5028	<	Fun<? super V, ? extends U> searchFunction) {
5029	<	if (searchFunction == null) throw new NullPointerException();
5030	<	return new SearchValuesTask<K,V,U>
5031	<	(map, null, -1, null, searchFunction,
5032	<	new AtomicReference<U>());
5033	<	}
5034	<
5035	<	/**
5036	<	* Returns a task that when invoked, returns the result of
5037	<	* accumulating all values using the given reducer to combine
5038	<	* values, or null if none.
5039	<	*
5040	<	* @param map the map
5041	<	* @param reducer a commutative associative combining function
5042	<	* @return the task
5043	<	*/
5044	<	public static <K,V> ForkJoinTask<V> reduceValues
5045	<	(ConcurrentHashMap<K,V> map,
5046	<	BiFun<? super V, ? super V, ? extends V> reducer) {
5047	<	if (reducer == null) throw new NullPointerException();
5048	<	return new ReduceValuesTask<K,V>
5049	<	(map, null, -1, null, reducer);
5050	<	}
5051	<
5052	<	/**
5053	<	* Returns a task that when invoked, returns the result of
5054	<	* accumulating the given transformation of all values using the
5055	<	* given reducer to combine values, or null if none.
5056	<	*
5057	<	* @param map the map
5058	<	* @param transformer a function returning the transformation
5059	<	* for an element, or null if there is no transformation (in
5060	<	* which case it is not combined).
5061	<	* @param reducer a commutative associative combining function
5062	<	* @return the task
5063	<	*/
5064	<	public static <K,V,U> ForkJoinTask<U> reduceValues
5065	<	(ConcurrentHashMap<K,V> map,
5066	<	Fun<? super V, ? extends U> transformer,
5067	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5068	<	if (transformer == null || reducer == null)
5069	<	throw new NullPointerException();
5070	<	return new MapReduceValuesTask<K,V,U>
5071	<	(map, null, -1, null, transformer, reducer);
5072	<	}
5073	<
5074	<	/**
5075	<	* Returns a task that when invoked, returns the result of
5076	<	* accumulating the given transformation of all values using the
5077	<	* given reducer to combine values, and the given basis as an
5078	<	* identity value.
5079	<	*
5080	<	* @param map the map
5081	<	* @param transformer a function returning the transformation
5082	<	* for an element
5083	<	* @param basis the identity (initial default value) for the reduction
5084	<	* @param reducer a commutative associative combining function
5085	<	* @return the task
5086	<	*/
5087	<	public static <K,V> ForkJoinTask<Double> reduceValuesToDouble
5088	<	(ConcurrentHashMap<K,V> map,
5089	<	ObjectToDouble<? super V> transformer,
5090	<	double basis,
5091	<	DoubleByDoubleToDouble reducer) {
5092	<	if (transformer == null || reducer == null)
5093	<	throw new NullPointerException();
5094	<	return new MapReduceValuesToDoubleTask<K,V>
5095	<	(map, null, -1, null, transformer, basis, reducer);
4790	>	public final int hashCode() {
4791	>	int h = 0;
4792	>	Node<K,V>[] t;
4793	>	if ((t = map.table) != null) {
4794	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4795	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
4796	>	h += p.hashCode();
4797	>	}
4798	>	}
4799	>	return h;
4800		}
4801
4802	<	/**
4803	<	* Returns a task that when invoked, returns the result of
4804	<	* accumulating the given transformation of all values using the
4805	<	* given reducer to combine values, and the given basis as an
4806	<	* identity value.
5103	<	*
5104	<	* @param map the map
5105	<	* @param transformer a function returning the transformation
5106	<	* for an element
5107	<	* @param basis the identity (initial default value) for the reduction
5108	<	* @param reducer a commutative associative combining function
5109	<	* @return the task
5110	<	*/
5111	<	public static <K,V> ForkJoinTask<Long> reduceValuesToLong
5112	<	(ConcurrentHashMap<K,V> map,
5113	<	ObjectToLong<? super V> transformer,
5114	<	long basis,
5115	<	LongByLongToLong reducer) {
5116	<	if (transformer == null || reducer == null)
5117	<	throw new NullPointerException();
5118	<	return new MapReduceValuesToLongTask<K,V>
5119	<	(map, null, -1, null, transformer, basis, reducer);
4802	>	public final boolean equals(Object o) {
4803	>	Set<?> c;
4804	>	return ((o instanceof Set) &&
4805	>	((c = (Set<?>)o) == this ||
4806	>	(containsAll(c) && c.containsAll(this))));
4807		}
4808
4809	<	/**
4810	<	* Returns a task that when invoked, returns the result of
4811	<	* accumulating the given transformation of all values using the
4812	<	* given reducer to combine values, and the given basis as an
4813	<	* identity value.
4814	<	*
5128	<	* @param map the map
5129	<	* @param transformer a function returning the transformation
5130	<	* for an element
5131	<	* @param basis the identity (initial default value) for the reduction
5132	<	* @param reducer a commutative associative combining function
5133	<	* @return the task
5134	<	*/
5135	<	public static <K,V> ForkJoinTask<Integer> reduceValuesToInt
5136	<	(ConcurrentHashMap<K,V> map,
5137	<	ObjectToInt<? super V> transformer,
5138	<	int basis,
5139	<	IntByIntToInt reducer) {
5140	<	if (transformer == null || reducer == null)
5141	<	throw new NullPointerException();
5142	<	return new MapReduceValuesToIntTask<K,V>
5143	<	(map, null, -1, null, transformer, basis, reducer);
4809	>	public Spliterator<Map.Entry<K,V>> spliterator() {
4810	>	Node<K,V>[] t;
4811	>	ConcurrentHashMap<K,V> m = map;
4812	>	long n = m.sumCount();
4813	>	int f = (t = m.table) == null ? 0 : t.length;
4814	>	return new EntrySpliterator<K,V>(t, f, 0, f, n < 0L ? 0L : n, m);
4815		}
4816
4817	<	/**
5147	<	* Returns a task that when invoked, perform the given action
5148	<	* for each entry.
5149	<	*
5150	<	* @param map the map
5151	<	* @param action the action
5152	<	*/
5153	<	public static <K,V> ForkJoinTask<Void> forEachEntry
5154	<	(ConcurrentHashMap<K,V> map,
5155	<	Action<Map.Entry<K,V>> action) {
4817	>	public void forEach(Consumer<? super Map.Entry<K,V>> action) {
4818		if (action == null) throw new NullPointerException();
4819	<	return new ForEachEntryTask<K,V>(map, null, -1, null, action);
4820	<	}
4821	<
4822	<	/**
4823	<	* Returns a task that when invoked, perform the given action
4824	<	* for each non-null transformation of each entry.
5163	<	*
5164	<	* @param map the map
5165	<	* @param transformer a function returning the transformation
5166	<	* for an element, or null if there is no transformation (in
5167	<	* which case the action is not applied)
5168	<	* @param action the action
5169	<	*/
5170	<	public static <K,V,U> ForkJoinTask<Void> forEachEntry
5171	<	(ConcurrentHashMap<K,V> map,
5172	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5173	<	Action<U> action) {
5174	<	if (transformer == null || action == null)
5175	<	throw new NullPointerException();
5176	<	return new ForEachTransformedEntryTask<K,V,U>
5177	<	(map, null, -1, null, transformer, action);
5178	<	}
5179	<
5180	<	/**
5181	<	* Returns a task that when invoked, returns a non-null result
5182	<	* from applying the given search function on each entry, or
5183	<	* null if none.  Upon success, further element processing is
5184	<	* suppressed and the results of any other parallel
5185	<	* invocations of the search function are ignored.
5186	<	*
5187	<	* @param map the map
5188	<	* @param searchFunction a function returning a non-null
5189	<	* result on success, else null
5190	<	* @return the task
5191	<	*/
5192	<	public static <K,V,U> ForkJoinTask<U> searchEntries
5193	<	(ConcurrentHashMap<K,V> map,
5194	<	Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
5195	<	if (searchFunction == null) throw new NullPointerException();
5196	<	return new SearchEntriesTask<K,V,U>
5197	<	(map, null, -1, null, searchFunction,
5198	<	new AtomicReference<U>());
5199	<	}
5200	<
5201	<	/**
5202	<	* Returns a task that when invoked, returns the result of
5203	<	* accumulating all entries using the given reducer to combine
5204	<	* values, or null if none.
5205	<	*
5206	<	* @param map the map
5207	<	* @param reducer a commutative associative combining function
5208	<	* @return the task
5209	<	*/
5210	<	public static <K,V> ForkJoinTask<Map.Entry<K,V>> reduceEntries
5211	<	(ConcurrentHashMap<K,V> map,
5212	<	BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5213	<	if (reducer == null) throw new NullPointerException();
5214	<	return new ReduceEntriesTask<K,V>
5215	<	(map, null, -1, null, reducer);
5216	<	}
5217	<
5218	<	/**
5219	<	* Returns a task that when invoked, returns the result of
5220	<	* accumulating the given transformation of all entries using the
5221	<	* given reducer to combine values, or null if none.
5222	<	*
5223	<	* @param map the map
5224	<	* @param transformer a function returning the transformation
5225	<	* for an element, or null if there is no transformation (in
5226	<	* which case it is not combined).
5227	<	* @param reducer a commutative associative combining function
5228	<	* @return the task
5229	<	*/
5230	<	public static <K,V,U> ForkJoinTask<U> reduceEntries
5231	<	(ConcurrentHashMap<K,V> map,
5232	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5233	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5234	<	if (transformer == null || reducer == null)
5235	<	throw new NullPointerException();
5236	<	return new MapReduceEntriesTask<K,V,U>
5237	<	(map, null, -1, null, transformer, reducer);
5238	<	}
5239	<
5240	<	/**
5241	<	* Returns a task that when invoked, returns the result of
5242	<	* accumulating the given transformation of all entries using the
5243	<	* given reducer to combine values, and the given basis as an
5244	<	* identity value.
5245	<	*
5246	<	* @param map the map
5247	<	* @param transformer a function returning the transformation
5248	<	* for an element
5249	<	* @param basis the identity (initial default value) for the reduction
5250	<	* @param reducer a commutative associative combining function
5251	<	* @return the task
5252	<	*/
5253	<	public static <K,V> ForkJoinTask<Double> reduceEntriesToDouble
5254	<	(ConcurrentHashMap<K,V> map,
5255	<	ObjectToDouble<Map.Entry<K,V>> transformer,
5256	<	double basis,
5257	<	DoubleByDoubleToDouble reducer) {
5258	<	if (transformer == null || reducer == null)
5259	<	throw new NullPointerException();
5260	<	return new MapReduceEntriesToDoubleTask<K,V>
5261	<	(map, null, -1, null, transformer, basis, reducer);
5262	<	}
5263	<
5264	<	/**
5265	<	* Returns a task that when invoked, returns the result of
5266	<	* accumulating the given transformation of all entries using the
5267	<	* given reducer to combine values, and the given basis as an
5268	<	* identity value.
5269	<	*
5270	<	* @param map the map
5271	<	* @param transformer a function returning the transformation
5272	<	* for an element
5273	<	* @param basis the identity (initial default value) for the reduction
5274	<	* @param reducer a commutative associative combining function
5275	<	* @return the task
5276	<	*/
5277	<	public static <K,V> ForkJoinTask<Long> reduceEntriesToLong
5278	<	(ConcurrentHashMap<K,V> map,
5279	<	ObjectToLong<Map.Entry<K,V>> transformer,
5280	<	long basis,
5281	<	LongByLongToLong reducer) {
5282	<	if (transformer == null || reducer == null)
5283	<	throw new NullPointerException();
5284	<	return new MapReduceEntriesToLongTask<K,V>
5285	<	(map, null, -1, null, transformer, basis, reducer);
4819	>	Node<K,V>[] t;
4820	>	if ((t = map.table) != null) {
4821	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4822	>	for (Node<K,V> p; (p = it.advance()) != null; )
4823	>	action.accept(new MapEntry<K,V>(p.key, p.val, map));
4824	>	}
4825		}
4826
5288	–	/**
5289	–	* Returns a task that when invoked, returns the result of
5290	–	* accumulating the given transformation of all entries using the
5291	–	* given reducer to combine values, and the given basis as an
5292	–	* identity value.
5293	–	*
5294	–	* @param map the map
5295	–	* @param transformer a function returning the transformation
5296	–	* for an element
5297	–	* @param basis the identity (initial default value) for the reduction
5298	–	* @param reducer a commutative associative combining function
5299	–	* @return the task
5300	–	*/
5301	–	public static <K,V> ForkJoinTask<Integer> reduceEntriesToInt
5302	–	(ConcurrentHashMap<K,V> map,
5303	–	ObjectToInt<Map.Entry<K,V>> transformer,
5304	–	int basis,
5305	–	IntByIntToInt reducer) {
5306	–	if (transformer == null || reducer == null)
5307	–	throw new NullPointerException();
5308	–	return new MapReduceEntriesToIntTask<K,V>
5309	–	(map, null, -1, null, transformer, basis, reducer);
5310	–	}
4827		}
4828
4829		// -------------------------------------------------------
4830
4831		/**
4832	<	* Base for FJ tasks for bulk operations. This adds a variant of
4833	<	* CountedCompleters and some split and merge bookkeeping to
4834	<	* iterator functionality. The forEach and reduce methods are
4835	<	* similar to those illustrated in CountedCompleter documentation,
4836	<	* except that bottom-up reduction completions perform them within
4837	<	* their compute methods. The search methods are like forEach
4838	<	* except they continually poll for success and exit early.  Also,
4839	<	* exceptions are handled in a simpler manner, by just trying to
4840	<	* complete root task exceptionally.
4841	<	*/
4842	<	@SuppressWarnings("serial") static abstract class BulkTask<K,V,R> extends Traverser<K,V,R> {
4843	<	final BulkTask<K,V,?> parent;  // completion target
4844	<	int batch;                     // split control; -1 for unknown
4845	<	int pending;                   // completion control
4846	<
4847	<	BulkTask(ConcurrentHashMap<K,V> map, BulkTask<K,V,?> parent,
4848	<	int batch) {
4849	<	super(map);
4850	<	this.parent = parent;
4851	<	this.batch = batch;
4852	<	if (parent != null && map != null) { // split parent
4853	<	Node[] t;
4854	<	if ((t = parent.tab) == null &&
4855	<	(t = parent.tab = map.table) != null)
4856	<	parent.baseLimit = parent.baseSize = t.length;
5341	<	this.tab = t;
5342	<	this.baseSize = parent.baseSize;
5343	<	int hi = this.baseLimit = parent.baseLimit;
5344	<	parent.baseLimit = this.index = this.baseIndex =
5345	<	(hi + parent.baseIndex + 1) >>> 1;
4832	>	* Base class for bulk tasks. Repeats some fields and code from
4833	>	* class Traverser, because we need to subclass CountedCompleter.
4834	>	*/
4835	>	@SuppressWarnings("serial")
4836	>	abstract static class BulkTask<K,V,R> extends CountedCompleter<R> {
4837	>	Node<K,V>[] tab;        // same as Traverser
4838	>	Node<K,V> next;
4839	>	TableStack<K,V> stack, spare;
4840	>	int index;
4841	>	int baseIndex;
4842	>	int baseLimit;
4843	>	final int baseSize;
4844	>	int batch;              // split control
4845	>
4846	>	BulkTask(BulkTask<K,V,?> par, int b, int i, int f, Node<K,V>[] t) {
4847	>	super(par);
4848	>	this.batch = b;
4849	>	this.index = this.baseIndex = i;
4850	>	if ((this.tab = t) == null)
4851	>	this.baseSize = this.baseLimit = 0;
4852	>	else if (par == null)
4853	>	this.baseSize = this.baseLimit = t.length;
4854	>	else {
4855	>	this.baseLimit = f;
4856	>	this.baseSize = par.baseSize;
4857		}
4858		}
4859
4860		/**
4861	<	* Forces root task to complete.
5351	<	* @param ex if null, complete normally, else exceptionally
5352	<	* @return false to simplify use
4861	>	* Same as Traverser version
4862		*/
4863	<	final boolean tryCompleteComputation(Throwable ex) {
4864	<	for (BulkTask<K,V,?> a = this;;) {
4865	<	BulkTask<K,V,?> p = a.parent;
4866	<	if (p == null) {
4867	<	if (ex != null)
4868	<	a.completeExceptionally(ex);
4863	>	final Node<K,V> advance() {
4864	>	Node<K,V> e;
4865	>	if ((e = next) != null)
4866	>	e = e.next;
4867	>	for (;;) {
4868	>	Node<K,V>[] t; int i, n;
4869	>	if (e != null)
4870	>	return next = e;
4871	>	if (baseIndex >= baseLimit || (t = tab) == null ||
4872	>	(n = t.length) <= (i = index) || i < 0)
4873	>	return next = null;
4874	>	if ((e = tabAt(t, i)) != null && e.hash < 0) {
4875	>	if (e instanceof ForwardingNode) {
4876	>	tab = ((ForwardingNode<K,V>)e).nextTable;
4877	>	e = null;
4878	>	pushState(t, i, n);
4879	>	continue;
4880	>	}
4881	>	else if (e instanceof TreeBin)
4882	>	e = ((TreeBin<K,V>)e).first;
4883		else
4884	<	a.quietlyComplete();
5362	<	return false;
4884	>	e = null;
4885		}
4886	<	a = p;
4886	>	if (stack != null)
4887	>	recoverState(n);
4888	>	else if ((index = i + baseSize) >= n)
4889	>	index = ++baseIndex;
4890		}
4891		}
4892
4893	<	/**
4894	<	* Version of tryCompleteComputation for function screening checks
4895	<	*/
4896	<	final boolean abortOnNullFunction() {
4897	<	return tryCompleteComputation(new Error("Unexpected null function"));
4898	<	}
4899	<
4900	<	// utilities
4901	<
4902	<	/** CompareAndSet pending count */
4903	<	final boolean casPending(int cmp, int val) {
4904	<	return U.compareAndSwapInt(this, PENDING, cmp, val);
4905	<	}
4906	<
4907	<	/**
4908	<	* Returns approx exp2 of the number of times (minus one) to
4909	<	* split task by two before executing leaf action. This value
4910	<	* is faster to compute and more convenient to use as a guide
4911	<	* to splitting than is the depth, since it is used while
4912	<	* dividing by two anyway.
4913	<	*/
4914	<	final int batch() {
4915	<	ConcurrentHashMap<K, V> m; int b; Node[] t;  ForkJoinPool pool;
4916	<	if ((b = batch) < 0 && (m = map) != null) { // force initialization
5392	<	if ((t = tab) == null && (t = tab = m.table) != null)
5393	<	baseLimit = baseSize = t.length;
5394	<	if (t != null) {
5395	<	long n = m.counter.sum();
5396	<	int par = ((pool = getPool()) == null) ?
5397	<	ForkJoinPool.getCommonPoolParallelism() :
5398	<	pool.getParallelism();
5399	<	int sp = par << 3; // slack of 8
5400	<	b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
5401	<	}
5402	<	}
5403	<	return b;
5404	<	}
5405	<
5406	<	/**
5407	<	* Returns exportable snapshot entry.
5408	<	*/
5409	<	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
5410	<	return new AbstractMap.SimpleEntry<K,V>(k, v);
5411	<	}
5412	<
5413	<	// Unsafe mechanics
5414	<	private static final sun.misc.Unsafe U;
5415	<	private static final long PENDING;
5416	<	static {
5417	<	try {
5418	<	U = sun.misc.Unsafe.getUnsafe();
5419	<	PENDING = U.objectFieldOffset
5420	<	(BulkTask.class.getDeclaredField("pending"));
5421	<	} catch (Exception e) {
5422	<	throw new Error(e);
5423	<	}
5424	<	}
5425	<	}
5426	<
5427	<	/**
5428	<	* Base class for non-reductive actions
5429	<	*/
5430	<	@SuppressWarnings("serial") static abstract class BulkAction<K,V,R> extends BulkTask<K,V,R> {
5431	<	BulkAction<K,V,?> nextTask;
5432	<	BulkAction(ConcurrentHashMap<K,V> map, BulkTask<K,V,?> parent,
5433	<	int batch, BulkAction<K,V,?> nextTask) {
5434	<	super(map, parent, batch);
5435	<	this.nextTask = nextTask;
5436	<	}
5437	<
5438	<	/**
5439	<	* Try to complete task and upward parents. Upon hitting
5440	<	* non-completed parent, if a non-FJ task, try to help out the
5441	<	* computation.
5442	<	*/
5443	<	final void tryComplete(BulkAction<K,V,?> subtasks) {
5444	<	BulkTask<K,V,?> a = this, s = a;
5445	<	for (int c;;) {
5446	<	if ((c = a.pending) == 0) {
5447	<	if ((a = (s = a).parent) == null) {
5448	<	s.quietlyComplete();
5449	<	break;
5450	<	}
5451	<	}
5452	<	else if (a.casPending(c, c - 1)) {
5453	<	if (subtasks != null && !inForkJoinPool()) {
5454	<	while ((s = a.parent) != null)
5455	<	a = s;
5456	<	while (!a.isDone()) {
5457	<	BulkAction<K,V,?> next = subtasks.nextTask;
5458	<	if (subtasks.tryUnfork())
5459	<	subtasks.exec();
5460	<	if ((subtasks = next) == null)
5461	<	break;
5462	<	}
5463	<	}
5464	<	break;
5465	<	}
4893	>	private void pushState(Node<K,V>[] t, int i, int n) {
4894	>	TableStack<K,V> s = spare;
4895	>	if (s != null)
4896	>	spare = s.next;
4897	>	else
4898	>	s = new TableStack<K,V>();
4899	>	s.tab = t;
4900	>	s.length = n;
4901	>	s.index = i;
4902	>	s.next = stack;
4903	>	stack = s;
4904	>	}
4905	>
4906	>	private void recoverState(int n) {
4907	>	TableStack<K,V> s; int len;
4908	>	while ((s = stack) != null && (index += (len = s.length)) >= n) {
4909	>	n = len;
4910	>	index = s.index;
4911	>	tab = s.tab;
4912	>	s.tab = null;
4913	>	TableStack<K,V> next = s.next;
4914	>	s.next = spare; // save for reuse
4915	>	stack = next;
4916	>	spare = s;
4917		}
4918	+	if (s == null && (index += baseSize) >= n)
4919	+	index = ++baseIndex;
4920		}
5468	–
4921		}
4922
4923		/*
4924		* Task classes. Coded in a regular but ugly format/style to
4925		* simplify checks that each variant differs in the right way from
4926	<	* others.
4927	<	*/
4928	<
4929	<	@SuppressWarnings("serial") static final class ForEachKeyTask<K,V>
4930	<	extends BulkAction<K,V,Void> {
4931	<	final Action<K> action;
4926	>	* others. The null screenings exist because compilers cannot tell
4927	>	* that we've already null-checked task arguments, so we force
4928	>	* simplest hoisted bypass to help avoid convoluted traps.
4929	>	*/
4930	>	@SuppressWarnings("serial")
4931	>	static final class ForEachKeyTask<K,V>
4932	>	extends BulkTask<K,V,Void> {
4933	>	final Consumer<? super K> action;
4934		ForEachKeyTask
4935	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
4936	<	ForEachKeyTask<K,V> nextTask,
4937	<	Action<K> action) {
5484	<	super(m, p, b, nextTask);
4935	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
4936	>	Consumer<? super K> action) {
4937	>	super(p, b, i, f, t);
4938		this.action = action;
4939		}
4940	<	@SuppressWarnings("unchecked") public final boolean exec() {
4941	<	final Action<K> action = this.action;
4942	<	if (action == null)
4943	<	return abortOnNullFunction();
4944	<	ForEachKeyTask<K,V> subtasks = null;
4945	<	try {
4946	<	int b = batch(), c;
4947	<	while (b > 1 && baseIndex != baseLimit) {
4948	<	do {} while (!casPending(c = pending, c+1));
4949	<	(subtasks = new ForEachKeyTask<K,V>
4950	<	(map, this, b >>>= 1, subtasks, action)).fork();
4951	<	}
4952	<	while (advance() != null)
5500	<	action.apply((K)nextKey);
5501	<	} catch (Throwable ex) {
5502	<	return tryCompleteComputation(ex);
4940	>	public final void compute() {
4941	>	final Consumer<? super K> action;
4942	>	if ((action = this.action) != null) {
4943	>	for (int i = baseIndex, f, h; batch > 0 &&
4944	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
4945	>	addToPendingCount(1);
4946	>	new ForEachKeyTask<K,V>
4947	>	(this, batch >>>= 1, baseLimit = h, f, tab,
4948	>	action).fork();
4949	>	}
4950	>	for (Node<K,V> p; (p = advance()) != null;)
4951	>	action.accept(p.key);
4952	>	propagateCompletion();
4953		}
5504	–	tryComplete(subtasks);
5505	–	return false;
4954		}
4955		}
4956
4957	<	@SuppressWarnings("serial") static final class ForEachValueTask<K,V>
4958	<	extends BulkAction<K,V,Void> {
4959	<	final Action<V> action;
4957	>	@SuppressWarnings("serial")
4958	>	static final class ForEachValueTask<K,V>
4959	>	extends BulkTask<K,V,Void> {
4960	>	final Consumer<? super V> action;
4961		ForEachValueTask
4962	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
4963	<	ForEachValueTask<K,V> nextTask,
4964	<	Action<V> action) {
5516	<	super(m, p, b, nextTask);
4962	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
4963	>	Consumer<? super V> action) {
4964	>	super(p, b, i, f, t);
4965		this.action = action;
4966		}
4967	<	@SuppressWarnings("unchecked") public final boolean exec() {
4968	<	final Action<V> action = this.action;
4969	<	if (action == null)
4970	<	return abortOnNullFunction();
4971	<	ForEachValueTask<K,V> subtasks = null;
4972	<	try {
4973	<	int b = batch(), c;
4974	<	while (b > 1 && baseIndex != baseLimit) {
4975	<	do {} while (!casPending(c = pending, c+1));
4976	<	(subtasks = new ForEachValueTask<K,V>
4977	<	(map, this, b >>>= 1, subtasks, action)).fork();
4978	<	}
4979	<	Object v;
5532	<	while ((v = advance()) != null)
5533	<	action.apply((V)v);
5534	<	} catch (Throwable ex) {
5535	<	return tryCompleteComputation(ex);
4967	>	public final void compute() {
4968	>	final Consumer<? super V> action;
4969	>	if ((action = this.action) != null) {
4970	>	for (int i = baseIndex, f, h; batch > 0 &&
4971	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
4972	>	addToPendingCount(1);
4973	>	new ForEachValueTask<K,V>
4974	>	(this, batch >>>= 1, baseLimit = h, f, tab,
4975	>	action).fork();
4976	>	}
4977	>	for (Node<K,V> p; (p = advance()) != null;)
4978	>	action.accept(p.val);
4979	>	propagateCompletion();
4980		}
5537	–	tryComplete(subtasks);
5538	–	return false;
4981		}
4982		}
4983
4984	<	@SuppressWarnings("serial") static final class ForEachEntryTask<K,V>
4985	<	extends BulkAction<K,V,Void> {
4986	<	final Action<Entry<K,V>> action;
4984	>	@SuppressWarnings("serial")
4985	>	static final class ForEachEntryTask<K,V>
4986	>	extends BulkTask<K,V,Void> {
4987	>	final Consumer<? super Entry<K,V>> action;
4988		ForEachEntryTask
4989	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
4990	<	ForEachEntryTask<K,V> nextTask,
4991	<	Action<Entry<K,V>> action) {
5549	<	super(m, p, b, nextTask);
4989	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
4990	>	Consumer<? super Entry<K,V>> action) {
4991	>	super(p, b, i, f, t);
4992		this.action = action;
4993		}
4994	<	@SuppressWarnings("unchecked") public final boolean exec() {
4995	<	final Action<Entry<K,V>> action = this.action;
4996	<	if (action == null)
4997	<	return abortOnNullFunction();
4998	<	ForEachEntryTask<K,V> subtasks = null;
4999	<	try {
5000	<	int b = batch(), c;
5001	<	while (b > 1 && baseIndex != baseLimit) {
5002	<	do {} while (!casPending(c = pending, c+1));
5003	<	(subtasks = new ForEachEntryTask<K,V>
5004	<	(map, this, b >>>= 1, subtasks, action)).fork();
5005	<	}
5006	<	Object v;
5565	<	while ((v = advance()) != null)
5566	<	action.apply(entryFor((K)nextKey, (V)v));
5567	<	} catch (Throwable ex) {
5568	<	return tryCompleteComputation(ex);
4994	>	public final void compute() {
4995	>	final Consumer<? super Entry<K,V>> action;
4996	>	if ((action = this.action) != null) {
4997	>	for (int i = baseIndex, f, h; batch > 0 &&
4998	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
4999	>	addToPendingCount(1);
5000	>	new ForEachEntryTask<K,V>
5001	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5002	>	action).fork();
5003	>	}
5004	>	for (Node<K,V> p; (p = advance()) != null; )
5005	>	action.accept(p);
5006	>	propagateCompletion();
5007		}
5570	–	tryComplete(subtasks);
5571	–	return false;
5008		}
5009		}
5010
5011	<	@SuppressWarnings("serial") static final class ForEachMappingTask<K,V>
5012	<	extends BulkAction<K,V,Void> {
5013	<	final BiAction<K,V> action;
5011	>	@SuppressWarnings("serial")
5012	>	static final class ForEachMappingTask<K,V>
5013	>	extends BulkTask<K,V,Void> {
5014	>	final BiConsumer<? super K, ? super V> action;
5015		ForEachMappingTask
5016	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5017	<	ForEachMappingTask<K,V> nextTask,
5018	<	BiAction<K,V> action) {
5582	<	super(m, p, b, nextTask);
5016	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5017	>	BiConsumer<? super K,? super V> action) {
5018	>	super(p, b, i, f, t);
5019		this.action = action;
5020		}
5021	<	@SuppressWarnings("unchecked") public final boolean exec() {
5022	<	final BiAction<K,V> action = this.action;
5023	<	if (action == null)
5024	<	return abortOnNullFunction();
5025	<	ForEachMappingTask<K,V> subtasks = null;
5026	<	try {
5027	<	int b = batch(), c;
5028	<	while (b > 1 && baseIndex != baseLimit) {
5029	<	do {} while (!casPending(c = pending, c+1));
5030	<	(subtasks = new ForEachMappingTask<K,V>
5031	<	(map, this, b >>>= 1, subtasks, action)).fork();
5032	<	}
5033	<	Object v;
5598	<	while ((v = advance()) != null)
5599	<	action.apply((K)nextKey, (V)v);
5600	<	} catch (Throwable ex) {
5601	<	return tryCompleteComputation(ex);
5021	>	public final void compute() {
5022	>	final BiConsumer<? super K, ? super V> action;
5023	>	if ((action = this.action) != null) {
5024	>	for (int i = baseIndex, f, h; batch > 0 &&
5025	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5026	>	addToPendingCount(1);
5027	>	new ForEachMappingTask<K,V>
5028	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5029	>	action).fork();
5030	>	}
5031	>	for (Node<K,V> p; (p = advance()) != null; )
5032	>	action.accept(p.key, p.val);
5033	>	propagateCompletion();
5034		}
5603	–	tryComplete(subtasks);
5604	–	return false;
5035		}
5036		}
5037
5038	<	@SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U>
5039	<	extends BulkAction<K,V,Void> {
5040	<	final Fun<? super K, ? extends U> transformer;
5041	<	final Action<U> action;
5038	>	@SuppressWarnings("serial")
5039	>	static final class ForEachTransformedKeyTask<K,V,U>
5040	>	extends BulkTask<K,V,Void> {
5041	>	final Function<? super K, ? extends U> transformer;
5042	>	final Consumer<? super U> action;
5043		ForEachTransformedKeyTask
5044	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5045	<	ForEachTransformedKeyTask<K,V,U> nextTask,
5046	<	Fun<? super K, ? extends U> transformer,
5047	<	Action<U> action) {
5048	<	super(m, p, b, nextTask);
5049	<	this.transformer = transformer;
5050	<	this.action = action;
5051	<
5052	<	}
5053	<	@SuppressWarnings("unchecked") public final boolean exec() {
5054	<	final Fun<? super K, ? extends U> transformer =
5055	<	this.transformer;
5056	<	final Action<U> action = this.action;
5057	<	if (transformer == null || action == null)
5058	<	return abortOnNullFunction();
5059	<	ForEachTransformedKeyTask<K,V,U> subtasks = null;
5060	<	try {
5061	<	int b = batch(), c;
5062	<	while (b > 1 && baseIndex != baseLimit) {
5063	<	do {} while (!casPending(c = pending, c+1));
5064	<	(subtasks = new ForEachTransformedKeyTask<K,V,U>
5065	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5066	<	}
5636	<	U u;
5637	<	while (advance() != null) {
5638	<	if ((u = transformer.apply((K)nextKey)) != null)
5639	<	action.apply(u);
5640	<	}
5641	<	} catch (Throwable ex) {
5642	<	return tryCompleteComputation(ex);
5044	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5045	>	Function<? super K, ? extends U> transformer, Consumer<? super U> action) {
5046	>	super(p, b, i, f, t);
5047	>	this.transformer = transformer; this.action = action;
5048	>	}
5049	>	public final void compute() {
5050	>	final Function<? super K, ? extends U> transformer;
5051	>	final Consumer<? super U> action;
5052	>	if ((transformer = this.transformer) != null &&
5053	>	(action = this.action) != null) {
5054	>	for (int i = baseIndex, f, h; batch > 0 &&
5055	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5056	>	addToPendingCount(1);
5057	>	new ForEachTransformedKeyTask<K,V,U>
5058	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5059	>	transformer, action).fork();
5060	>	}
5061	>	for (Node<K,V> p; (p = advance()) != null; ) {
5062	>	U u;
5063	>	if ((u = transformer.apply(p.key)) != null)
5064	>	action.accept(u);
5065	>	}
5066	>	propagateCompletion();
5067		}
5644	–	tryComplete(subtasks);
5645	–	return false;
5068		}
5069		}
5070
5071	<	@SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U>
5072	<	extends BulkAction<K,V,Void> {
5073	<	final Fun<? super V, ? extends U> transformer;
5074	<	final Action<U> action;
5071	>	@SuppressWarnings("serial")
5072	>	static final class ForEachTransformedValueTask<K,V,U>
5073	>	extends BulkTask<K,V,Void> {
5074	>	final Function<? super V, ? extends U> transformer;
5075	>	final Consumer<? super U> action;
5076		ForEachTransformedValueTask
5077	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5078	<	ForEachTransformedValueTask<K,V,U> nextTask,
5079	<	Fun<? super V, ? extends U> transformer,
5080	<	Action<U> action) {
5081	<	super(m, p, b, nextTask);
5082	<	this.transformer = transformer;
5083	<	this.action = action;
5084	<
5085	<	}
5086	<	@SuppressWarnings("unchecked") public final boolean exec() {
5087	<	final Fun<? super V, ? extends U> transformer =
5088	<	this.transformer;
5089	<	final Action<U> action = this.action;
5090	<	if (transformer == null || action == null)
5091	<	return abortOnNullFunction();
5092	<	ForEachTransformedValueTask<K,V,U> subtasks = null;
5093	<	try {
5094	<	int b = batch(), c;
5095	<	while (b > 1 && baseIndex != baseLimit) {
5096	<	do {} while (!casPending(c = pending, c+1));
5097	<	(subtasks = new ForEachTransformedValueTask<K,V,U>
5098	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5099	<	}
5677	<	Object v; U u;
5678	<	while ((v = advance()) != null) {
5679	<	if ((u = transformer.apply((V)v)) != null)
5680	<	action.apply(u);
5681	<	}
5682	<	} catch (Throwable ex) {
5683	<	return tryCompleteComputation(ex);
5077	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5078	>	Function<? super V, ? extends U> transformer, Consumer<? super U> action) {
5079	>	super(p, b, i, f, t);
5080	>	this.transformer = transformer; this.action = action;
5081	>	}
5082	>	public final void compute() {
5083	>	final Function<? super V, ? extends U> transformer;
5084	>	final Consumer<? super U> action;
5085	>	if ((transformer = this.transformer) != null &&
5086	>	(action = this.action) != null) {
5087	>	for (int i = baseIndex, f, h; batch > 0 &&
5088	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5089	>	addToPendingCount(1);
5090	>	new ForEachTransformedValueTask<K,V,U>
5091	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5092	>	transformer, action).fork();
5093	>	}
5094	>	for (Node<K,V> p; (p = advance()) != null; ) {
5095	>	U u;
5096	>	if ((u = transformer.apply(p.val)) != null)
5097	>	action.accept(u);
5098	>	}
5099	>	propagateCompletion();
5100		}
5685	–	tryComplete(subtasks);
5686	–	return false;
5101		}
5102		}
5103
5104	<	@SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U>
5105	<	extends BulkAction<K,V,Void> {
5106	<	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5107	<	final Action<U> action;
5104	>	@SuppressWarnings("serial")
5105	>	static final class ForEachTransformedEntryTask<K,V,U>
5106	>	extends BulkTask<K,V,Void> {
5107	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5108	>	final Consumer<? super U> action;
5109		ForEachTransformedEntryTask
5110	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5111	<	ForEachTransformedEntryTask<K,V,U> nextTask,
5112	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5113	<	Action<U> action) {
5114	<	super(m, p, b, nextTask);
5115	<	this.transformer = transformer;
5116	<	this.action = action;
5117	<
5118	<	}
5119	<	@SuppressWarnings("unchecked") public final boolean exec() {
5120	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5121	<	this.transformer;
5122	<	final Action<U> action = this.action;
5123	<	if (transformer == null || action == null)
5124	<	return abortOnNullFunction();
5125	<	ForEachTransformedEntryTask<K,V,U> subtasks = null;
5126	<	try {
5127	<	int b = batch(), c;
5128	<	while (b > 1 && baseIndex != baseLimit) {
5129	<	do {} while (!casPending(c = pending, c+1));
5130	<	(subtasks = new ForEachTransformedEntryTask<K,V,U>
5131	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5132	<	}
5718	<	Object v; U u;
5719	<	while ((v = advance()) != null) {
5720	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5721	<	action.apply(u);
5722	<	}
5723	<	} catch (Throwable ex) {
5724	<	return tryCompleteComputation(ex);
5110	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5111	>	Function<Map.Entry<K,V>, ? extends U> transformer, Consumer<? super U> action) {
5112	>	super(p, b, i, f, t);
5113	>	this.transformer = transformer; this.action = action;
5114	>	}
5115	>	public final void compute() {
5116	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5117	>	final Consumer<? super U> action;
5118	>	if ((transformer = this.transformer) != null &&
5119	>	(action = this.action) != null) {
5120	>	for (int i = baseIndex, f, h; batch > 0 &&
5121	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5122	>	addToPendingCount(1);
5123	>	new ForEachTransformedEntryTask<K,V,U>
5124	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5125	>	transformer, action).fork();
5126	>	}
5127	>	for (Node<K,V> p; (p = advance()) != null; ) {
5128	>	U u;
5129	>	if ((u = transformer.apply(p)) != null)
5130	>	action.accept(u);
5131	>	}
5132	>	propagateCompletion();
5133		}
5726	–	tryComplete(subtasks);
5727	–	return false;
5134		}
5135		}
5136
5137	<	@SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U>
5138	<	extends BulkAction<K,V,Void> {
5139	<	final BiFun<? super K, ? super V, ? extends U> transformer;
5140	<	final Action<U> action;
5137	>	@SuppressWarnings("serial")
5138	>	static final class ForEachTransformedMappingTask<K,V,U>
5139	>	extends BulkTask<K,V,Void> {
5140	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5141	>	final Consumer<? super U> action;
5142		ForEachTransformedMappingTask
5143	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5144	<	ForEachTransformedMappingTask<K,V,U> nextTask,
5145	<	BiFun<? super K, ? super V, ? extends U> transformer,
5146	<	Action<U> action) {
5147	<	super(m, p, b, nextTask);
5148	<	this.transformer = transformer;
5149	<	this.action = action;
5150	<
5151	<	}
5152	<	@SuppressWarnings("unchecked") public final boolean exec() {
5153	<	final BiFun<? super K, ? super V, ? extends U> transformer =
5154	<	this.transformer;
5155	<	final Action<U> action = this.action;
5156	<	if (transformer == null || action == null)
5157	<	return abortOnNullFunction();
5158	<	ForEachTransformedMappingTask<K,V,U> subtasks = null;
5159	<	try {
5160	<	int b = batch(), c;
5161	<	while (b > 1 && baseIndex != baseLimit) {
5162	<	do {} while (!casPending(c = pending, c+1));
5163	<	(subtasks = new ForEachTransformedMappingTask<K,V,U>
5164	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5758	<	}
5759	<	Object v; U u;
5760	<	while ((v = advance()) != null) {
5761	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5762	<	action.apply(u);
5143	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5144	>	BiFunction<? super K, ? super V, ? extends U> transformer,
5145	>	Consumer<? super U> action) {
5146	>	super(p, b, i, f, t);
5147	>	this.transformer = transformer; this.action = action;
5148	>	}
5149	>	public final void compute() {
5150	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5151	>	final Consumer<? super U> action;
5152	>	if ((transformer = this.transformer) != null &&
5153	>	(action = this.action) != null) {
5154	>	for (int i = baseIndex, f, h; batch > 0 &&
5155	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5156	>	addToPendingCount(1);
5157	>	new ForEachTransformedMappingTask<K,V,U>
5158	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5159	>	transformer, action).fork();
5160	>	}
5161	>	for (Node<K,V> p; (p = advance()) != null; ) {
5162	>	U u;
5163	>	if ((u = transformer.apply(p.key, p.val)) != null)
5164	>	action.accept(u);
5165		}
5166	<	} catch (Throwable ex) {
5765	<	return tryCompleteComputation(ex);
5166	>	propagateCompletion();
5167		}
5767	–	tryComplete(subtasks);
5768	–	return false;
5168		}
5169		}
5170
5171	<	@SuppressWarnings("serial") static final class SearchKeysTask<K,V,U>
5172	<	extends BulkAction<K,V,U> {
5173	<	final Fun<? super K, ? extends U> searchFunction;
5171	>	@SuppressWarnings("serial")
5172	>	static final class SearchKeysTask<K,V,U>
5173	>	extends BulkTask<K,V,U> {
5174	>	final Function<? super K, ? extends U> searchFunction;
5175		final AtomicReference<U> result;
5176		SearchKeysTask
5177	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5178	<	SearchKeysTask<K,V,U> nextTask,
5779	<	Fun<? super K, ? extends U> searchFunction,
5177	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5178	>	Function<? super K, ? extends U> searchFunction,
5179		AtomicReference<U> result) {
5180	<	super(m, p, b, nextTask);
5180	>	super(p, b, i, f, t);
5181		this.searchFunction = searchFunction; this.result = result;
5182		}
5183	<	@SuppressWarnings("unchecked") public final boolean exec() {
5184	<	AtomicReference<U> result = this.result;
5185	<	final Fun<? super K, ? extends U> searchFunction =
5186	<	this.searchFunction;
5187	<	if (searchFunction == null || result == null)
5188	<	return abortOnNullFunction();
5189	<	SearchKeysTask<K,V,U> subtasks = null;
5190	<	try {
5191	<	int b = batch(), c;
5192	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5193	<	do {} while (!casPending(c = pending, c+1));
5194	<	(subtasks = new SearchKeysTask<K,V,U>
5195	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5196	<	}
5197	<	U u;
5198	<	while (result.get() == null && advance() != null) {
5199	<	if ((u = searchFunction.apply((K)nextKey)) != null) {
5183	>	public final U getRawResult() { return result.get(); }
5184	>	public final void compute() {
5185	>	final Function<? super K, ? extends U> searchFunction;
5186	>	final AtomicReference<U> result;
5187	>	if ((searchFunction = this.searchFunction) != null &&
5188	>	(result = this.result) != null) {
5189	>	for (int i = baseIndex, f, h; batch > 0 &&
5190	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5191	>	if (result.get() != null)
5192	>	return;
5193	>	addToPendingCount(1);
5194	>	new SearchKeysTask<K,V,U>
5195	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5196	>	searchFunction, result).fork();
5197	>	}
5198	>	while (result.get() == null) {
5199	>	U u;
5200	>	Node<K,V> p;
5201	>	if ((p = advance()) == null) {
5202	>	propagateCompletion();
5203	>	break;
5204	>	}
5205	>	if ((u = searchFunction.apply(p.key)) != null) {
5206		if (result.compareAndSet(null, u))
5207	<	tryCompleteComputation(null);
5207	>	quietlyCompleteRoot();
5208		break;
5209		}
5210		}
5806	–	} catch (Throwable ex) {
5807	–	return tryCompleteComputation(ex);
5211		}
5809	–	tryComplete(subtasks);
5810	–	return false;
5212		}
5812	–	public final U getRawResult() { return result.get(); }
5213		}
5214
5215	<	@SuppressWarnings("serial") static final class SearchValuesTask<K,V,U>
5216	<	extends BulkAction<K,V,U> {
5217	<	final Fun<? super V, ? extends U> searchFunction;
5215	>	@SuppressWarnings("serial")
5216	>	static final class SearchValuesTask<K,V,U>
5217	>	extends BulkTask<K,V,U> {
5218	>	final Function<? super V, ? extends U> searchFunction;
5219		final AtomicReference<U> result;
5220		SearchValuesTask
5221	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5222	<	SearchValuesTask<K,V,U> nextTask,
5822	<	Fun<? super V, ? extends U> searchFunction,
5221	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5222	>	Function<? super V, ? extends U> searchFunction,
5223		AtomicReference<U> result) {
5224	<	super(m, p, b, nextTask);
5224	>	super(p, b, i, f, t);
5225		this.searchFunction = searchFunction; this.result = result;
5226		}
5227	<	@SuppressWarnings("unchecked") public final boolean exec() {
5228	<	AtomicReference<U> result = this.result;
5229	<	final Fun<? super V, ? extends U> searchFunction =
5230	<	this.searchFunction;
5231	<	if (searchFunction == null || result == null)
5232	<	return abortOnNullFunction();
5233	<	SearchValuesTask<K,V,U> subtasks = null;
5234	<	try {
5235	<	int b = batch(), c;
5236	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5237	<	do {} while (!casPending(c = pending, c+1));
5238	<	(subtasks = new SearchValuesTask<K,V,U>
5239	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5240	<	}
5241	<	Object v; U u;
5242	<	while (result.get() == null && (v = advance()) != null) {
5243	<	if ((u = searchFunction.apply((V)v)) != null) {
5227	>	public final U getRawResult() { return result.get(); }
5228	>	public final void compute() {
5229	>	final Function<? super V, ? extends U> searchFunction;
5230	>	final AtomicReference<U> result;
5231	>	if ((searchFunction = this.searchFunction) != null &&
5232	>	(result = this.result) != null) {
5233	>	for (int i = baseIndex, f, h; batch > 0 &&
5234	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5235	>	if (result.get() != null)
5236	>	return;
5237	>	addToPendingCount(1);
5238	>	new SearchValuesTask<K,V,U>
5239	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5240	>	searchFunction, result).fork();
5241	>	}
5242	>	while (result.get() == null) {
5243	>	U u;
5244	>	Node<K,V> p;
5245	>	if ((p = advance()) == null) {
5246	>	propagateCompletion();
5247	>	break;
5248	>	}
5249	>	if ((u = searchFunction.apply(p.val)) != null) {
5250		if (result.compareAndSet(null, u))
5251	<	tryCompleteComputation(null);
5251	>	quietlyCompleteRoot();
5252		break;
5253		}
5254		}
5849	–	} catch (Throwable ex) {
5850	–	return tryCompleteComputation(ex);
5255		}
5852	–	tryComplete(subtasks);
5853	–	return false;
5256		}
5855	–	public final U getRawResult() { return result.get(); }
5257		}
5258
5259	<	@SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U>
5260	<	extends BulkAction<K,V,U> {
5261	<	final Fun<Entry<K,V>, ? extends U> searchFunction;
5259	>	@SuppressWarnings("serial")
5260	>	static final class SearchEntriesTask<K,V,U>
5261	>	extends BulkTask<K,V,U> {
5262	>	final Function<Entry<K,V>, ? extends U> searchFunction;
5263		final AtomicReference<U> result;
5264		SearchEntriesTask
5265	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5266	<	SearchEntriesTask<K,V,U> nextTask,
5865	<	Fun<Entry<K,V>, ? extends U> searchFunction,
5265	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5266	>	Function<Entry<K,V>, ? extends U> searchFunction,
5267		AtomicReference<U> result) {
5268	<	super(m, p, b, nextTask);
5268	>	super(p, b, i, f, t);
5269		this.searchFunction = searchFunction; this.result = result;
5270		}
5271	<	@SuppressWarnings("unchecked") public final boolean exec() {
5272	<	AtomicReference<U> result = this.result;
5273	<	final Fun<Entry<K,V>, ? extends U> searchFunction =
5274	<	this.searchFunction;
5275	<	if (searchFunction == null || result == null)
5276	<	return abortOnNullFunction();
5277	<	SearchEntriesTask<K,V,U> subtasks = null;
5278	<	try {
5279	<	int b = batch(), c;
5280	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5281	<	do {} while (!casPending(c = pending, c+1));
5282	<	(subtasks = new SearchEntriesTask<K,V,U>
5283	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5284	<	}
5285	<	Object v; U u;
5286	<	while (result.get() == null && (v = advance()) != null) {
5287	<	if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) {
5288	<	if (result.compareAndSet(null, u))
5289	<	tryCompleteComputation(null);
5271	>	public final U getRawResult() { return result.get(); }
5272	>	public final void compute() {
5273	>	final Function<Entry<K,V>, ? extends U> searchFunction;
5274	>	final AtomicReference<U> result;
5275	>	if ((searchFunction = this.searchFunction) != null &&
5276	>	(result = this.result) != null) {
5277	>	for (int i = baseIndex, f, h; batch > 0 &&
5278	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5279	>	if (result.get() != null)
5280	>	return;
5281	>	addToPendingCount(1);
5282	>	new SearchEntriesTask<K,V,U>
5283	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5284	>	searchFunction, result).fork();
5285	>	}
5286	>	while (result.get() == null) {
5287	>	U u;
5288	>	Node<K,V> p;
5289	>	if ((p = advance()) == null) {
5290	>	propagateCompletion();
5291		break;
5292		}
5293	+	if ((u = searchFunction.apply(p)) != null) {
5294	+	if (result.compareAndSet(null, u))
5295	+	quietlyCompleteRoot();
5296	+	return;
5297	+	}
5298		}
5892	–	} catch (Throwable ex) {
5893	–	return tryCompleteComputation(ex);
5299		}
5895	–	tryComplete(subtasks);
5896	–	return false;
5300		}
5898	–	public final U getRawResult() { return result.get(); }
5301		}
5302
5303	<	@SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U>
5304	<	extends BulkAction<K,V,U> {
5305	<	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5303	>	@SuppressWarnings("serial")
5304	>	static final class SearchMappingsTask<K,V,U>
5305	>	extends BulkTask<K,V,U> {
5306	>	final BiFunction<? super K, ? super V, ? extends U> searchFunction;
5307		final AtomicReference<U> result;
5308		SearchMappingsTask
5309	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5310	<	SearchMappingsTask<K,V,U> nextTask,
5908	<	BiFun<? super K, ? super V, ? extends U> searchFunction,
5309	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5310	>	BiFunction<? super K, ? super V, ? extends U> searchFunction,
5311		AtomicReference<U> result) {
5312	<	super(m, p, b, nextTask);
5312	>	super(p, b, i, f, t);
5313		this.searchFunction = searchFunction; this.result = result;
5314		}
5315	<	@SuppressWarnings("unchecked") public final boolean exec() {
5316	<	AtomicReference<U> result = this.result;
5317	<	final BiFun<? super K, ? super V, ? extends U> searchFunction =
5318	<	this.searchFunction;
5319	<	if (searchFunction == null || result == null)
5320	<	return abortOnNullFunction();
5321	<	SearchMappingsTask<K,V,U> subtasks = null;
5322	<	try {
5323	<	int b = batch(), c;
5324	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5325	<	do {} while (!casPending(c = pending, c+1));
5326	<	(subtasks = new SearchMappingsTask<K,V,U>
5327	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5328	<	}
5329	<	Object v; U u;
5330	<	while (result.get() == null && (v = advance()) != null) {
5331	<	if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) {
5315	>	public final U getRawResult() { return result.get(); }
5316	>	public final void compute() {
5317	>	final BiFunction<? super K, ? super V, ? extends U> searchFunction;
5318	>	final AtomicReference<U> result;
5319	>	if ((searchFunction = this.searchFunction) != null &&
5320	>	(result = this.result) != null) {
5321	>	for (int i = baseIndex, f, h; batch > 0 &&
5322	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5323	>	if (result.get() != null)
5324	>	return;
5325	>	addToPendingCount(1);
5326	>	new SearchMappingsTask<K,V,U>
5327	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5328	>	searchFunction, result).fork();
5329	>	}
5330	>	while (result.get() == null) {
5331	>	U u;
5332	>	Node<K,V> p;
5333	>	if ((p = advance()) == null) {
5334	>	propagateCompletion();
5335	>	break;
5336	>	}
5337	>	if ((u = searchFunction.apply(p.key, p.val)) != null) {
5338		if (result.compareAndSet(null, u))
5339	<	tryCompleteComputation(null);
5339	>	quietlyCompleteRoot();
5340		break;
5341		}
5342		}
5935	–	} catch (Throwable ex) {
5936	–	return tryCompleteComputation(ex);
5343		}
5938	–	tryComplete(subtasks);
5939	–	return false;
5344		}
5941	–	public final U getRawResult() { return result.get(); }
5345		}
5346
5347	<	@SuppressWarnings("serial") static final class ReduceKeysTask<K,V>
5347	>	@SuppressWarnings("serial")
5348	>	static final class ReduceKeysTask<K,V>
5349		extends BulkTask<K,V,K> {
5350	<	final BiFun<? super K, ? super K, ? extends K> reducer;
5350	>	final BiFunction<? super K, ? super K, ? extends K> reducer;
5351		K result;
5352		ReduceKeysTask<K,V> rights, nextRight;
5353		ReduceKeysTask
5354	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5354	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5355		ReduceKeysTask<K,V> nextRight,
5356	<	BiFun<? super K, ? super K, ? extends K> reducer) {
5357	<	super(m, p, b); this.nextRight = nextRight;
5356	>	BiFunction<? super K, ? super K, ? extends K> reducer) {
5357	>	super(p, b, i, f, t); this.nextRight = nextRight;
5358		this.reducer = reducer;
5359		}
5360	<	@SuppressWarnings("unchecked") public final boolean exec() {
5361	<	final BiFun<? super K, ? super K, ? extends K> reducer =
5362	<	this.reducer;
5363	<	if (reducer == null)
5364	<	return abortOnNullFunction();
5365	<	try {
5366	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5963	<	do {} while (!casPending(c = pending, c+1));
5360	>	public final K getRawResult() { return result; }
5361	>	public final void compute() {
5362	>	final BiFunction<? super K, ? super K, ? extends K> reducer;
5363	>	if ((reducer = this.reducer) != null) {
5364	>	for (int i = baseIndex, f, h; batch > 0 &&
5365	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5366	>	addToPendingCount(1);
5367		(rights = new ReduceKeysTask<K,V>
5368	<	(map, this, b >>>= 1, rights, reducer)).fork();
5368	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5369	>	rights, reducer)).fork();
5370		}
5371		K r = null;
5372	<	while (advance() != null) {
5373	<	K u = (K)nextKey;
5374	<	r = (r == null) ? u : reducer.apply(r, u);
5372	>	for (Node<K,V> p; (p = advance()) != null; ) {
5373	>	K u = p.key;
5374	>	r = (r == null) ? u : u == null ? r : reducer.apply(r, u);
5375		}
5376		result = r;
5377	<	for (ReduceKeysTask<K,V> t = this, s;;) {
5378	<	int c; BulkTask<K,V,?> par; K tr, sr;
5379	<	if ((c = t.pending) == 0) {
5380	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5381	<	if ((sr = s.result) != null)
5382	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5383	<	}
5384	<	if ((par = t.parent) == null ||
5385	<	!(par instanceof ReduceKeysTask)) {
5386	<	t.quietlyComplete();
5387	<	break;
5388	<	}
5985	<	t = (ReduceKeysTask<K,V>)par;
5377	>	CountedCompleter<?> c;
5378	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5379	>	@SuppressWarnings("unchecked")
5380	>	ReduceKeysTask<K,V>
5381	>	t = (ReduceKeysTask<K,V>)c,
5382	>	s = t.rights;
5383	>	while (s != null) {
5384	>	K tr, sr;
5385	>	if ((sr = s.result) != null)
5386	>	t.result = (((tr = t.result) == null) ? sr :
5387	>	reducer.apply(tr, sr));
5388	>	s = t.rights = s.nextRight;
5389		}
5987	–	else if (t.casPending(c, c - 1))
5988	–	break;
5390		}
5990	–	} catch (Throwable ex) {
5991	–	return tryCompleteComputation(ex);
5391		}
5993	–	ReduceKeysTask<K,V> s = rights;
5994	–	if (s != null && !inForkJoinPool()) {
5995	–	do  {
5996	–	if (s.tryUnfork())
5997	–	s.exec();
5998	–	} while ((s = s.nextRight) != null);
5999	–	}
6000	–	return false;
5392		}
6002	–	public final K getRawResult() { return result; }
5393		}
5394
5395	<	@SuppressWarnings("serial") static final class ReduceValuesTask<K,V>
5395	>	@SuppressWarnings("serial")
5396	>	static final class ReduceValuesTask<K,V>
5397		extends BulkTask<K,V,V> {
5398	<	final BiFun<? super V, ? super V, ? extends V> reducer;
5398	>	final BiFunction<? super V, ? super V, ? extends V> reducer;
5399		V result;
5400		ReduceValuesTask<K,V> rights, nextRight;
5401		ReduceValuesTask
5402	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5402	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5403		ReduceValuesTask<K,V> nextRight,
5404	<	BiFun<? super V, ? super V, ? extends V> reducer) {
5405	<	super(m, p, b); this.nextRight = nextRight;
5404	>	BiFunction<? super V, ? super V, ? extends V> reducer) {
5405	>	super(p, b, i, f, t); this.nextRight = nextRight;
5406		this.reducer = reducer;
5407		}
5408	<	@SuppressWarnings("unchecked") public final boolean exec() {
5409	<	final BiFun<? super V, ? super V, ? extends V> reducer =
5410	<	this.reducer;
5411	<	if (reducer == null)
5412	<	return abortOnNullFunction();
5413	<	try {
5414	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6024	<	do {} while (!casPending(c = pending, c+1));
5408	>	public final V getRawResult() { return result; }
5409	>	public final void compute() {
5410	>	final BiFunction<? super V, ? super V, ? extends V> reducer;
5411	>	if ((reducer = this.reducer) != null) {
5412	>	for (int i = baseIndex, f, h; batch > 0 &&
5413	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5414	>	addToPendingCount(1);
5415		(rights = new ReduceValuesTask<K,V>
5416	<	(map, this, b >>>= 1, rights, reducer)).fork();
5416	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5417	>	rights, reducer)).fork();
5418		}
5419		V r = null;
5420	<	Object v;
5421	<	while ((v = advance()) != null) {
5422	<	V u = (V)v;
6032	<	r = (r == null) ? u : reducer.apply(r, u);
5420	>	for (Node<K,V> p; (p = advance()) != null; ) {
5421	>	V v = p.val;
5422	>	r = (r == null) ? v : reducer.apply(r, v);
5423		}
5424		result = r;
5425	<	for (ReduceValuesTask<K,V> t = this, s;;) {
5426	<	int c; BulkTask<K,V,?> par; V tr, sr;
5427	<	if ((c = t.pending) == 0) {
5428	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5429	<	if ((sr = s.result) != null)
5430	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5431	<	}
5432	<	if ((par = t.parent) == null ||
5433	<	!(par instanceof ReduceValuesTask)) {
5434	<	t.quietlyComplete();
5435	<	break;
5436	<	}
6047	<	t = (ReduceValuesTask<K,V>)par;
5425	>	CountedCompleter<?> c;
5426	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5427	>	@SuppressWarnings("unchecked")
5428	>	ReduceValuesTask<K,V>
5429	>	t = (ReduceValuesTask<K,V>)c,
5430	>	s = t.rights;
5431	>	while (s != null) {
5432	>	V tr, sr;
5433	>	if ((sr = s.result) != null)
5434	>	t.result = (((tr = t.result) == null) ? sr :
5435	>	reducer.apply(tr, sr));
5436	>	s = t.rights = s.nextRight;
5437		}
6049	–	else if (t.casPending(c, c - 1))
6050	–	break;
5438		}
6052	–	} catch (Throwable ex) {
6053	–	return tryCompleteComputation(ex);
6054	–	}
6055	–	ReduceValuesTask<K,V> s = rights;
6056	–	if (s != null && !inForkJoinPool()) {
6057	–	do  {
6058	–	if (s.tryUnfork())
6059	–	s.exec();
6060	–	} while ((s = s.nextRight) != null);
5439		}
6062	–	return false;
5440		}
6064	–	public final V getRawResult() { return result; }
5441		}
5442
5443	<	@SuppressWarnings("serial") static final class ReduceEntriesTask<K,V>
5443	>	@SuppressWarnings("serial")
5444	>	static final class ReduceEntriesTask<K,V>
5445		extends BulkTask<K,V,Map.Entry<K,V>> {
5446	<	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5446	>	final BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5447		Map.Entry<K,V> result;
5448		ReduceEntriesTask<K,V> rights, nextRight;
5449		ReduceEntriesTask
5450	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5450	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5451		ReduceEntriesTask<K,V> nextRight,
5452	<	BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5453	<	super(m, p, b); this.nextRight = nextRight;
5452	>	BiFunction<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5453	>	super(p, b, i, f, t); this.nextRight = nextRight;
5454		this.reducer = reducer;
5455		}
5456	<	@SuppressWarnings("unchecked") public final boolean exec() {
5457	<	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer =
5458	<	this.reducer;
5459	<	if (reducer == null)
5460	<	return abortOnNullFunction();
5461	<	try {
5462	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6086	<	do {} while (!casPending(c = pending, c+1));
5456	>	public final Map.Entry<K,V> getRawResult() { return result; }
5457	>	public final void compute() {
5458	>	final BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5459	>	if ((reducer = this.reducer) != null) {
5460	>	for (int i = baseIndex, f, h; batch > 0 &&
5461	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5462	>	addToPendingCount(1);
5463		(rights = new ReduceEntriesTask<K,V>
5464	<	(map, this, b >>>= 1, rights, reducer)).fork();
5464	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5465	>	rights, reducer)).fork();
5466		}
5467		Map.Entry<K,V> r = null;
5468	<	Object v;
5469	<	while ((v = advance()) != null) {
6093	<	Map.Entry<K,V> u = entryFor((K)nextKey, (V)v);
6094	<	r = (r == null) ? u : reducer.apply(r, u);
6095	<	}
5468	>	for (Node<K,V> p; (p = advance()) != null; )
5469	>	r = (r == null) ? p : reducer.apply(r, p);
5470		result = r;
5471	<	for (ReduceEntriesTask<K,V> t = this, s;;) {
5472	<	int c; BulkTask<K,V,?> par; Map.Entry<K,V> tr, sr;
5473	<	if ((c = t.pending) == 0) {
5474	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5475	<	if ((sr = s.result) != null)
5476	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5477	<	}
5478	<	if ((par = t.parent) == null ||
5479	<	!(par instanceof ReduceEntriesTask)) {
5480	<	t.quietlyComplete();
5481	<	break;
5482	<	}
6109	<	t = (ReduceEntriesTask<K,V>)par;
5471	>	CountedCompleter<?> c;
5472	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5473	>	@SuppressWarnings("unchecked")
5474	>	ReduceEntriesTask<K,V>
5475	>	t = (ReduceEntriesTask<K,V>)c,
5476	>	s = t.rights;
5477	>	while (s != null) {
5478	>	Map.Entry<K,V> tr, sr;
5479	>	if ((sr = s.result) != null)
5480	>	t.result = (((tr = t.result) == null) ? sr :
5481	>	reducer.apply(tr, sr));
5482	>	s = t.rights = s.nextRight;
5483		}
6111	–	else if (t.casPending(c, c - 1))
6112	–	break;
5484		}
6114	–	} catch (Throwable ex) {
6115	–	return tryCompleteComputation(ex);
6116	–	}
6117	–	ReduceEntriesTask<K,V> s = rights;
6118	–	if (s != null && !inForkJoinPool()) {
6119	–	do  {
6120	–	if (s.tryUnfork())
6121	–	s.exec();
6122	–	} while ((s = s.nextRight) != null);
5485		}
6124	–	return false;
5486		}
6126	–	public final Map.Entry<K,V> getRawResult() { return result; }
5487		}
5488
5489	<	@SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U>
5489	>	@SuppressWarnings("serial")
5490	>	static final class MapReduceKeysTask<K,V,U>
5491		extends BulkTask<K,V,U> {
5492	<	final Fun<? super K, ? extends U> transformer;
5493	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5492	>	final Function<? super K, ? extends U> transformer;
5493	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5494		U result;
5495		MapReduceKeysTask<K,V,U> rights, nextRight;
5496		MapReduceKeysTask
5497	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5497	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5498		MapReduceKeysTask<K,V,U> nextRight,
5499	<	Fun<? super K, ? extends U> transformer,
5500	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5501	<	super(m, p, b); this.nextRight = nextRight;
5499	>	Function<? super K, ? extends U> transformer,
5500	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5501	>	super(p, b, i, f, t); this.nextRight = nextRight;
5502		this.transformer = transformer;
5503		this.reducer = reducer;
5504		}
5505	<	@SuppressWarnings("unchecked") public final boolean exec() {
5506	<	final Fun<? super K, ? extends U> transformer =
5507	<	this.transformer;
5508	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5509	<	this.reducer;
5510	<	if (transformer == null || reducer == null)
5511	<	return abortOnNullFunction();
5512	<	try {
5513	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6153	<	do {} while (!casPending(c = pending, c+1));
5505	>	public final U getRawResult() { return result; }
5506	>	public final void compute() {
5507	>	final Function<? super K, ? extends U> transformer;
5508	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5509	>	if ((transformer = this.transformer) != null &&
5510	>	(reducer = this.reducer) != null) {
5511	>	for (int i = baseIndex, f, h; batch > 0 &&
5512	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5513	>	addToPendingCount(1);
5514		(rights = new MapReduceKeysTask<K,V,U>
5515	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5515	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5516	>	rights, transformer, reducer)).fork();
5517		}
5518	<	U r = null, u;
5519	<	while (advance() != null) {
5520	<	if ((u = transformer.apply((K)nextKey)) != null)
5518	>	U r = null;
5519	>	for (Node<K,V> p; (p = advance()) != null; ) {
5520	>	U u;
5521	>	if ((u = transformer.apply(p.key)) != null)
5522		r = (r == null) ? u : reducer.apply(r, u);
5523		}
5524		result = r;
5525	<	for (MapReduceKeysTask<K,V,U> t = this, s;;) {
5526	<	int c; BulkTask<K,V,?> par; U tr, sr;
5527	<	if ((c = t.pending) == 0) {
5528	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5529	<	if ((sr = s.result) != null)
5530	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5531	<	}
5532	<	if ((par = t.parent) == null ||
5533	<	!(par instanceof MapReduceKeysTask)) {
5534	<	t.quietlyComplete();
5535	<	break;
5536	<	}
6175	<	t = (MapReduceKeysTask<K,V,U>)par;
5525	>	CountedCompleter<?> c;
5526	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5527	>	@SuppressWarnings("unchecked")
5528	>	MapReduceKeysTask<K,V,U>
5529	>	t = (MapReduceKeysTask<K,V,U>)c,
5530	>	s = t.rights;
5531	>	while (s != null) {
5532	>	U tr, sr;
5533	>	if ((sr = s.result) != null)
5534	>	t.result = (((tr = t.result) == null) ? sr :
5535	>	reducer.apply(tr, sr));
5536	>	s = t.rights = s.nextRight;
5537		}
6177	–	else if (t.casPending(c, c - 1))
6178	–	break;
5538		}
6180	–	} catch (Throwable ex) {
6181	–	return tryCompleteComputation(ex);
6182	–	}
6183	–	MapReduceKeysTask<K,V,U> s = rights;
6184	–	if (s != null && !inForkJoinPool()) {
6185	–	do  {
6186	–	if (s.tryUnfork())
6187	–	s.exec();
6188	–	} while ((s = s.nextRight) != null);
5539		}
6190	–	return false;
5540		}
6192	–	public final U getRawResult() { return result; }
5541		}
5542
5543	<	@SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U>
5543	>	@SuppressWarnings("serial")
5544	>	static final class MapReduceValuesTask<K,V,U>
5545		extends BulkTask<K,V,U> {
5546	<	final Fun<? super V, ? extends U> transformer;
5547	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5546	>	final Function<? super V, ? extends U> transformer;
5547	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5548		U result;
5549		MapReduceValuesTask<K,V,U> rights, nextRight;
5550		MapReduceValuesTask
5551	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5551	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5552		MapReduceValuesTask<K,V,U> nextRight,
5553	<	Fun<? super V, ? extends U> transformer,
5554	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5555	<	super(m, p, b); this.nextRight = nextRight;
5553	>	Function<? super V, ? extends U> transformer,
5554	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5555	>	super(p, b, i, f, t); this.nextRight = nextRight;
5556		this.transformer = transformer;
5557		this.reducer = reducer;
5558		}
5559	<	@SuppressWarnings("unchecked") public final boolean exec() {
5560	<	final Fun<? super V, ? extends U> transformer =
5561	<	this.transformer;
5562	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5563	<	this.reducer;
5564	<	if (transformer == null || reducer == null)
5565	<	return abortOnNullFunction();
5566	<	try {
5567	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6219	<	do {} while (!casPending(c = pending, c+1));
5559	>	public final U getRawResult() { return result; }
5560	>	public final void compute() {
5561	>	final Function<? super V, ? extends U> transformer;
5562	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5563	>	if ((transformer = this.transformer) != null &&
5564	>	(reducer = this.reducer) != null) {
5565	>	for (int i = baseIndex, f, h; batch > 0 &&
5566	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5567	>	addToPendingCount(1);
5568		(rights = new MapReduceValuesTask<K,V,U>
5569	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5569	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5570	>	rights, transformer, reducer)).fork();
5571		}
5572	<	U r = null, u;
5573	<	Object v;
5574	<	while ((v = advance()) != null) {
5575	<	if ((u = transformer.apply((V)v)) != null)
5572	>	U r = null;
5573	>	for (Node<K,V> p; (p = advance()) != null; ) {
5574	>	U u;
5575	>	if ((u = transformer.apply(p.val)) != null)
5576		r = (r == null) ? u : reducer.apply(r, u);
5577		}
5578		result = r;
5579	<	for (MapReduceValuesTask<K,V,U> t = this, s;;) {
5580	<	int c; BulkTask<K,V,?> par; U tr, sr;
5581	<	if ((c = t.pending) == 0) {
5582	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5583	<	if ((sr = s.result) != null)
5584	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5585	<	}
5586	<	if ((par = t.parent) == null ||
5587	<	!(par instanceof MapReduceValuesTask)) {
5588	<	t.quietlyComplete();
5589	<	break;
5590	<	}
6242	<	t = (MapReduceValuesTask<K,V,U>)par;
5579	>	CountedCompleter<?> c;
5580	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5581	>	@SuppressWarnings("unchecked")
5582	>	MapReduceValuesTask<K,V,U>
5583	>	t = (MapReduceValuesTask<K,V,U>)c,
5584	>	s = t.rights;
5585	>	while (s != null) {
5586	>	U tr, sr;
5587	>	if ((sr = s.result) != null)
5588	>	t.result = (((tr = t.result) == null) ? sr :
5589	>	reducer.apply(tr, sr));
5590	>	s = t.rights = s.nextRight;
5591		}
6244	–	else if (t.casPending(c, c - 1))
6245	–	break;
5592		}
6247	–	} catch (Throwable ex) {
6248	–	return tryCompleteComputation(ex);
5593		}
6250	–	MapReduceValuesTask<K,V,U> s = rights;
6251	–	if (s != null && !inForkJoinPool()) {
6252	–	do  {
6253	–	if (s.tryUnfork())
6254	–	s.exec();
6255	–	} while ((s = s.nextRight) != null);
6256	–	}
6257	–	return false;
5594		}
6259	–	public final U getRawResult() { return result; }
5595		}
5596
5597	<	@SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U>
5597	>	@SuppressWarnings("serial")
5598	>	static final class MapReduceEntriesTask<K,V,U>
5599		extends BulkTask<K,V,U> {
5600	<	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5601	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5600	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5601	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5602		U result;
5603		MapReduceEntriesTask<K,V,U> rights, nextRight;
5604		MapReduceEntriesTask
5605	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5605	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5606		MapReduceEntriesTask<K,V,U> nextRight,
5607	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5608	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5609	<	super(m, p, b); this.nextRight = nextRight;
5607	>	Function<Map.Entry<K,V>, ? extends U> transformer,
5608	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5609	>	super(p, b, i, f, t); this.nextRight = nextRight;
5610		this.transformer = transformer;
5611		this.reducer = reducer;
5612		}
5613	<	@SuppressWarnings("unchecked") public final boolean exec() {
5614	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5615	<	this.transformer;
5616	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5617	<	this.reducer;
5618	<	if (transformer == null || reducer == null)
5619	<	return abortOnNullFunction();
5620	<	try {
5621	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6286	<	do {} while (!casPending(c = pending, c+1));
5613	>	public final U getRawResult() { return result; }
5614	>	public final void compute() {
5615	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5616	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5617	>	if ((transformer = this.transformer) != null &&
5618	>	(reducer = this.reducer) != null) {
5619	>	for (int i = baseIndex, f, h; batch > 0 &&
5620	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5621	>	addToPendingCount(1);
5622		(rights = new MapReduceEntriesTask<K,V,U>
5623	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5623	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5624	>	rights, transformer, reducer)).fork();
5625		}
5626	<	U r = null, u;
5627	<	Object v;
5628	<	while ((v = advance()) != null) {
5629	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5626	>	U r = null;
5627	>	for (Node<K,V> p; (p = advance()) != null; ) {
5628	>	U u;
5629	>	if ((u = transformer.apply(p)) != null)
5630		r = (r == null) ? u : reducer.apply(r, u);
5631		}
5632		result = r;
5633	<	for (MapReduceEntriesTask<K,V,U> t = this, s;;) {
5634	<	int c; BulkTask<K,V,?> par; U tr, sr;
5635	<	if ((c = t.pending) == 0) {
5636	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5637	<	if ((sr = s.result) != null)
5638	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5639	<	}
5640	<	if ((par = t.parent) == null ||
5641	<	!(par instanceof MapReduceEntriesTask)) {
5642	<	t.quietlyComplete();
5643	<	break;
5644	<	}
6309	<	t = (MapReduceEntriesTask<K,V,U>)par;
5633	>	CountedCompleter<?> c;
5634	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5635	>	@SuppressWarnings("unchecked")
5636	>	MapReduceEntriesTask<K,V,U>
5637	>	t = (MapReduceEntriesTask<K,V,U>)c,
5638	>	s = t.rights;
5639	>	while (s != null) {
5640	>	U tr, sr;
5641	>	if ((sr = s.result) != null)
5642	>	t.result = (((tr = t.result) == null) ? sr :
5643	>	reducer.apply(tr, sr));
5644	>	s = t.rights = s.nextRight;
5645		}
6311	–	else if (t.casPending(c, c - 1))
6312	–	break;
5646		}
6314	–	} catch (Throwable ex) {
6315	–	return tryCompleteComputation(ex);
6316	–	}
6317	–	MapReduceEntriesTask<K,V,U> s = rights;
6318	–	if (s != null && !inForkJoinPool()) {
6319	–	do  {
6320	–	if (s.tryUnfork())
6321	–	s.exec();
6322	–	} while ((s = s.nextRight) != null);
5647		}
6324	–	return false;
5648		}
6326	–	public final U getRawResult() { return result; }
5649		}
5650
5651	<	@SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U>
5651	>	@SuppressWarnings("serial")
5652	>	static final class MapReduceMappingsTask<K,V,U>
5653		extends BulkTask<K,V,U> {
5654	<	final BiFun<? super K, ? super V, ? extends U> transformer;
5655	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5654	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5655	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5656		U result;
5657		MapReduceMappingsTask<K,V,U> rights, nextRight;
5658		MapReduceMappingsTask
5659	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5659	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5660		MapReduceMappingsTask<K,V,U> nextRight,
5661	<	BiFun<? super K, ? super V, ? extends U> transformer,
5662	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5663	<	super(m, p, b); this.nextRight = nextRight;
5661	>	BiFunction<? super K, ? super V, ? extends U> transformer,
5662	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5663	>	super(p, b, i, f, t); this.nextRight = nextRight;
5664		this.transformer = transformer;
5665		this.reducer = reducer;
5666		}
5667	<	@SuppressWarnings("unchecked") public final boolean exec() {
5668	<	final BiFun<? super K, ? super V, ? extends U> transformer =
5669	<	this.transformer;
5670	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5671	<	this.reducer;
5672	<	if (transformer == null || reducer == null)
5673	<	return abortOnNullFunction();
5674	<	try {
5675	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6353	<	do {} while (!casPending(c = pending, c+1));
5667	>	public final U getRawResult() { return result; }
5668	>	public final void compute() {
5669	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5670	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5671	>	if ((transformer = this.transformer) != null &&
5672	>	(reducer = this.reducer) != null) {
5673	>	for (int i = baseIndex, f, h; batch > 0 &&
5674	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5675	>	addToPendingCount(1);
5676		(rights = new MapReduceMappingsTask<K,V,U>
5677	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5677	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5678	>	rights, transformer, reducer)).fork();
5679		}
5680	<	U r = null, u;
5681	<	Object v;
5682	<	while ((v = advance()) != null) {
5683	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5680	>	U r = null;
5681	>	for (Node<K,V> p; (p = advance()) != null; ) {
5682	>	U u;
5683	>	if ((u = transformer.apply(p.key, p.val)) != null)
5684		r = (r == null) ? u : reducer.apply(r, u);
5685		}
5686		result = r;
5687	<	for (MapReduceMappingsTask<K,V,U> t = this, s;;) {
5688	<	int c; BulkTask<K,V,?> par; U tr, sr;
5689	<	if ((c = t.pending) == 0) {
5690	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5691	<	if ((sr = s.result) != null)
5692	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5693	<	}
5694	<	if ((par = t.parent) == null ||
5695	<	!(par instanceof MapReduceMappingsTask)) {
5696	<	t.quietlyComplete();
5697	<	break;
5698	<	}
6376	<	t = (MapReduceMappingsTask<K,V,U>)par;
5687	>	CountedCompleter<?> c;
5688	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5689	>	@SuppressWarnings("unchecked")
5690	>	MapReduceMappingsTask<K,V,U>
5691	>	t = (MapReduceMappingsTask<K,V,U>)c,
5692	>	s = t.rights;
5693	>	while (s != null) {
5694	>	U tr, sr;
5695	>	if ((sr = s.result) != null)
5696	>	t.result = (((tr = t.result) == null) ? sr :
5697	>	reducer.apply(tr, sr));
5698	>	s = t.rights = s.nextRight;
5699		}
6378	–	else if (t.casPending(c, c - 1))
6379	–	break;
5700		}
6381	–	} catch (Throwable ex) {
6382	–	return tryCompleteComputation(ex);
5701		}
6384	–	MapReduceMappingsTask<K,V,U> s = rights;
6385	–	if (s != null && !inForkJoinPool()) {
6386	–	do  {
6387	–	if (s.tryUnfork())
6388	–	s.exec();
6389	–	} while ((s = s.nextRight) != null);
6390	–	}
6391	–	return false;
5702		}
6393	–	public final U getRawResult() { return result; }
5703		}
5704
5705	<	@SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V>
5705	>	@SuppressWarnings("serial")
5706	>	static final class MapReduceKeysToDoubleTask<K,V>
5707		extends BulkTask<K,V,Double> {
5708	<	final ObjectToDouble<? super K> transformer;
5709	<	final DoubleByDoubleToDouble reducer;
5708	>	final ToDoubleFunction<? super K> transformer;
5709	>	final DoubleBinaryOperator reducer;
5710		final double basis;
5711		double result;
5712		MapReduceKeysToDoubleTask<K,V> rights, nextRight;
5713		MapReduceKeysToDoubleTask
5714	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5714	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5715		MapReduceKeysToDoubleTask<K,V> nextRight,
5716	<	ObjectToDouble<? super K> transformer,
5716	>	ToDoubleFunction<? super K> transformer,
5717		double basis,
5718	<	DoubleByDoubleToDouble reducer) {
5719	<	super(m, p, b); this.nextRight = nextRight;
5718	>	DoubleBinaryOperator reducer) {
5719	>	super(p, b, i, f, t); this.nextRight = nextRight;
5720		this.transformer = transformer;
5721		this.basis = basis; this.reducer = reducer;
5722		}
5723	<	@SuppressWarnings("unchecked") public final boolean exec() {
5724	<	final ObjectToDouble<? super K> transformer =
5725	<	this.transformer;
5726	<	final DoubleByDoubleToDouble reducer = this.reducer;
5727	<	if (transformer == null || reducer == null)
5728	<	return abortOnNullFunction();
5729	<	try {
5730	<	final double id = this.basis;
5731	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5732	<	do {} while (!casPending(c = pending, c+1));
5723	>	public final Double getRawResult() { return result; }
5724	>	public final void compute() {
5725	>	final ToDoubleFunction<? super K> transformer;
5726	>	final DoubleBinaryOperator reducer;
5727	>	if ((transformer = this.transformer) != null &&
5728	>	(reducer = this.reducer) != null) {
5729	>	double r = this.basis;
5730	>	for (int i = baseIndex, f, h; batch > 0 &&
5731	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5732	>	addToPendingCount(1);
5733		(rights = new MapReduceKeysToDoubleTask<K,V>
5734	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5734	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5735	>	rights, transformer, r, reducer)).fork();
5736		}
5737	<	double r = id;
5738	<	while (advance() != null)
6428	<	r = reducer.apply(r, transformer.apply((K)nextKey));
5737	>	for (Node<K,V> p; (p = advance()) != null; )
5738	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p.key));
5739		result = r;
5740	<	for (MapReduceKeysToDoubleTask<K,V> t = this, s;;) {
5741	<	int c; BulkTask<K,V,?> par;
5742	<	if ((c = t.pending) == 0) {
5743	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5744	<	t.result = reducer.apply(t.result, s.result);
5745	<	}
5746	<	if ((par = t.parent) == null ||
5747	<	!(par instanceof MapReduceKeysToDoubleTask)) {
5748	<	t.quietlyComplete();
6439	<	break;
6440	<	}
6441	<	t = (MapReduceKeysToDoubleTask<K,V>)par;
5740	>	CountedCompleter<?> c;
5741	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5742	>	@SuppressWarnings("unchecked")
5743	>	MapReduceKeysToDoubleTask<K,V>
5744	>	t = (MapReduceKeysToDoubleTask<K,V>)c,
5745	>	s = t.rights;
5746	>	while (s != null) {
5747	>	t.result = reducer.applyAsDouble(t.result, s.result);
5748	>	s = t.rights = s.nextRight;
5749		}
6443	–	else if (t.casPending(c, c - 1))
6444	–	break;
5750		}
6446	–	} catch (Throwable ex) {
6447	–	return tryCompleteComputation(ex);
6448	–	}
6449	–	MapReduceKeysToDoubleTask<K,V> s = rights;
6450	–	if (s != null && !inForkJoinPool()) {
6451	–	do  {
6452	–	if (s.tryUnfork())
6453	–	s.exec();
6454	–	} while ((s = s.nextRight) != null);
5751		}
6456	–	return false;
5752		}
6458	–	public final Double getRawResult() { return result; }
5753		}
5754
5755	<	@SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V>
5755	>	@SuppressWarnings("serial")
5756	>	static final class MapReduceValuesToDoubleTask<K,V>
5757		extends BulkTask<K,V,Double> {
5758	<	final ObjectToDouble<? super V> transformer;
5759	<	final DoubleByDoubleToDouble reducer;
5758	>	final ToDoubleFunction<? super V> transformer;
5759	>	final DoubleBinaryOperator reducer;
5760		final double basis;
5761		double result;
5762		MapReduceValuesToDoubleTask<K,V> rights, nextRight;
5763		MapReduceValuesToDoubleTask
5764	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5764	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5765		MapReduceValuesToDoubleTask<K,V> nextRight,
5766	<	ObjectToDouble<? super V> transformer,
5766	>	ToDoubleFunction<? super V> transformer,
5767		double basis,
5768	<	DoubleByDoubleToDouble reducer) {
5769	<	super(m, p, b); this.nextRight = nextRight;
5768	>	DoubleBinaryOperator reducer) {
5769	>	super(p, b, i, f, t); this.nextRight = nextRight;
5770		this.transformer = transformer;
5771		this.basis = basis; this.reducer = reducer;
5772		}
5773	<	@SuppressWarnings("unchecked") public final boolean exec() {
5774	<	final ObjectToDouble<? super V> transformer =
5775	<	this.transformer;
5776	<	final DoubleByDoubleToDouble reducer = this.reducer;
5777	<	if (transformer == null || reducer == null)
5778	<	return abortOnNullFunction();
5779	<	try {
5780	<	final double id = this.basis;
5781	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5782	<	do {} while (!casPending(c = pending, c+1));
5773	>	public final Double getRawResult() { return result; }
5774	>	public final void compute() {
5775	>	final ToDoubleFunction<? super V> transformer;
5776	>	final DoubleBinaryOperator reducer;
5777	>	if ((transformer = this.transformer) != null &&
5778	>	(reducer = this.reducer) != null) {
5779	>	double r = this.basis;
5780	>	for (int i = baseIndex, f, h; batch > 0 &&
5781	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5782	>	addToPendingCount(1);
5783		(rights = new MapReduceValuesToDoubleTask<K,V>
5784	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5784	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5785	>	rights, transformer, r, reducer)).fork();
5786		}
5787	<	double r = id;
5788	<	Object v;
6493	<	while ((v = advance()) != null)
6494	<	r = reducer.apply(r, transformer.apply((V)v));
5787	>	for (Node<K,V> p; (p = advance()) != null; )
5788	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p.val));
5789		result = r;
5790	<	for (MapReduceValuesToDoubleTask<K,V> t = this, s;;) {
5791	<	int c; BulkTask<K,V,?> par;
5792	<	if ((c = t.pending) == 0) {
5793	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5794	<	t.result = reducer.apply(t.result, s.result);
5795	<	}
5796	<	if ((par = t.parent) == null ||
5797	<	!(par instanceof MapReduceValuesToDoubleTask)) {
5798	<	t.quietlyComplete();
6505	<	break;
6506	<	}
6507	<	t = (MapReduceValuesToDoubleTask<K,V>)par;
5790	>	CountedCompleter<?> c;
5791	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5792	>	@SuppressWarnings("unchecked")
5793	>	MapReduceValuesToDoubleTask<K,V>
5794	>	t = (MapReduceValuesToDoubleTask<K,V>)c,
5795	>	s = t.rights;
5796	>	while (s != null) {
5797	>	t.result = reducer.applyAsDouble(t.result, s.result);
5798	>	s = t.rights = s.nextRight;
5799		}
6509	–	else if (t.casPending(c, c - 1))
6510	–	break;
5800		}
6512	–	} catch (Throwable ex) {
6513	–	return tryCompleteComputation(ex);
5801		}
6515	–	MapReduceValuesToDoubleTask<K,V> s = rights;
6516	–	if (s != null && !inForkJoinPool()) {
6517	–	do  {
6518	–	if (s.tryUnfork())
6519	–	s.exec();
6520	–	} while ((s = s.nextRight) != null);
6521	–	}
6522	–	return false;
5802		}
6524	–	public final Double getRawResult() { return result; }
5803		}
5804
5805	<	@SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V>
5805	>	@SuppressWarnings("serial")
5806	>	static final class MapReduceEntriesToDoubleTask<K,V>
5807		extends BulkTask<K,V,Double> {
5808	<	final ObjectToDouble<Map.Entry<K,V>> transformer;
5809	<	final DoubleByDoubleToDouble reducer;
5808	>	final ToDoubleFunction<Map.Entry<K,V>> transformer;
5809	>	final DoubleBinaryOperator reducer;
5810		final double basis;
5811		double result;
5812		MapReduceEntriesToDoubleTask<K,V> rights, nextRight;
5813		MapReduceEntriesToDoubleTask
5814	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5814	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5815		MapReduceEntriesToDoubleTask<K,V> nextRight,
5816	<	ObjectToDouble<Map.Entry<K,V>> transformer,
5816	>	ToDoubleFunction<Map.Entry<K,V>> transformer,
5817		double basis,
5818	<	DoubleByDoubleToDouble reducer) {
5819	<	super(m, p, b); this.nextRight = nextRight;
5818	>	DoubleBinaryOperator reducer) {
5819	>	super(p, b, i, f, t); this.nextRight = nextRight;
5820		this.transformer = transformer;
5821		this.basis = basis; this.reducer = reducer;
5822		}
5823	<	@SuppressWarnings("unchecked") public final boolean exec() {
5824	<	final ObjectToDouble<Map.Entry<K,V>> transformer =
5825	<	this.transformer;
5826	<	final DoubleByDoubleToDouble reducer = this.reducer;
5827	<	if (transformer == null || reducer == null)
5828	<	return abortOnNullFunction();
5829	<	try {
5830	<	final double id = this.basis;
5831	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5832	<	do {} while (!casPending(c = pending, c+1));
5823	>	public final Double getRawResult() { return result; }
5824	>	public final void compute() {
5825	>	final ToDoubleFunction<Map.Entry<K,V>> transformer;
5826	>	final DoubleBinaryOperator reducer;
5827	>	if ((transformer = this.transformer) != null &&
5828	>	(reducer = this.reducer) != null) {
5829	>	double r = this.basis;
5830	>	for (int i = baseIndex, f, h; batch > 0 &&
5831	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5832	>	addToPendingCount(1);
5833		(rights = new MapReduceEntriesToDoubleTask<K,V>
5834	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5834	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5835	>	rights, transformer, r, reducer)).fork();
5836		}
5837	<	double r = id;
5838	<	Object v;
6559	<	while ((v = advance()) != null)
6560	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
5837	>	for (Node<K,V> p; (p = advance()) != null; )
5838	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p));
5839		result = r;
5840	<	for (MapReduceEntriesToDoubleTask<K,V> t = this, s;;) {
5841	<	int c; BulkTask<K,V,?> par;
5842	<	if ((c = t.pending) == 0) {
5843	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5844	<	t.result = reducer.apply(t.result, s.result);
5845	<	}
5846	<	if ((par = t.parent) == null ||
5847	<	!(par instanceof MapReduceEntriesToDoubleTask)) {
5848	<	t.quietlyComplete();
6571	<	break;
6572	<	}
6573	<	t = (MapReduceEntriesToDoubleTask<K,V>)par;
5840	>	CountedCompleter<?> c;
5841	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5842	>	@SuppressWarnings("unchecked")
5843	>	MapReduceEntriesToDoubleTask<K,V>
5844	>	t = (MapReduceEntriesToDoubleTask<K,V>)c,
5845	>	s = t.rights;
5846	>	while (s != null) {
5847	>	t.result = reducer.applyAsDouble(t.result, s.result);
5848	>	s = t.rights = s.nextRight;
5849		}
6575	–	else if (t.casPending(c, c - 1))
6576	–	break;
5850		}
6578	–	} catch (Throwable ex) {
6579	–	return tryCompleteComputation(ex);
6580	–	}
6581	–	MapReduceEntriesToDoubleTask<K,V> s = rights;
6582	–	if (s != null && !inForkJoinPool()) {
6583	–	do  {
6584	–	if (s.tryUnfork())
6585	–	s.exec();
6586	–	} while ((s = s.nextRight) != null);
5851		}
6588	–	return false;
5852		}
6590	–	public final Double getRawResult() { return result; }
5853		}
5854
5855	<	@SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V>
5855	>	@SuppressWarnings("serial")
5856	>	static final class MapReduceMappingsToDoubleTask<K,V>
5857		extends BulkTask<K,V,Double> {
5858	<	final ObjectByObjectToDouble<? super K, ? super V> transformer;
5859	<	final DoubleByDoubleToDouble reducer;
5858	>	final ToDoubleBiFunction<? super K, ? super V> transformer;
5859	>	final DoubleBinaryOperator reducer;
5860		final double basis;
5861		double result;
5862		MapReduceMappingsToDoubleTask<K,V> rights, nextRight;
5863		MapReduceMappingsToDoubleTask
5864	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5864	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5865		MapReduceMappingsToDoubleTask<K,V> nextRight,
5866	<	ObjectByObjectToDouble<? super K, ? super V> transformer,
5866	>	ToDoubleBiFunction<? super K, ? super V> transformer,
5867		double basis,
5868	<	DoubleByDoubleToDouble reducer) {
5869	<	super(m, p, b); this.nextRight = nextRight;
5868	>	DoubleBinaryOperator reducer) {
5869	>	super(p, b, i, f, t); this.nextRight = nextRight;
5870		this.transformer = transformer;
5871		this.basis = basis; this.reducer = reducer;
5872		}
5873	<	@SuppressWarnings("unchecked") public final boolean exec() {
5874	<	final ObjectByObjectToDouble<? super K, ? super V> transformer =
5875	<	this.transformer;
5876	<	final DoubleByDoubleToDouble reducer = this.reducer;
5877	<	if (transformer == null || reducer == null)
5878	<	return abortOnNullFunction();
5879	<	try {
5880	<	final double id = this.basis;
5881	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5882	<	do {} while (!casPending(c = pending, c+1));
5873	>	public final Double getRawResult() { return result; }
5874	>	public final void compute() {
5875	>	final ToDoubleBiFunction<? super K, ? super V> transformer;
5876	>	final DoubleBinaryOperator reducer;
5877	>	if ((transformer = this.transformer) != null &&
5878	>	(reducer = this.reducer) != null) {
5879	>	double r = this.basis;
5880	>	for (int i = baseIndex, f, h; batch > 0 &&
5881	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5882	>	addToPendingCount(1);
5883		(rights = new MapReduceMappingsToDoubleTask<K,V>
5884	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5884	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5885	>	rights, transformer, r, reducer)).fork();
5886		}
5887	<	double r = id;
5888	<	Object v;
6625	<	while ((v = advance()) != null)
6626	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
5887	>	for (Node<K,V> p; (p = advance()) != null; )
5888	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p.key, p.val));
5889		result = r;
5890	<	for (MapReduceMappingsToDoubleTask<K,V> t = this, s;;) {
5891	<	int c; BulkTask<K,V,?> par;
5892	<	if ((c = t.pending) == 0) {
5893	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5894	<	t.result = reducer.apply(t.result, s.result);
5895	<	}
5896	<	if ((par = t.parent) == null ||
5897	<	!(par instanceof MapReduceMappingsToDoubleTask)) {
5898	<	t.quietlyComplete();
6637	<	break;
6638	<	}
6639	<	t = (MapReduceMappingsToDoubleTask<K,V>)par;
5890	>	CountedCompleter<?> c;
5891	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5892	>	@SuppressWarnings("unchecked")
5893	>	MapReduceMappingsToDoubleTask<K,V>
5894	>	t = (MapReduceMappingsToDoubleTask<K,V>)c,
5895	>	s = t.rights;
5896	>	while (s != null) {
5897	>	t.result = reducer.applyAsDouble(t.result, s.result);
5898	>	s = t.rights = s.nextRight;
5899		}
6641	–	else if (t.casPending(c, c - 1))
6642	–	break;
5900		}
6644	–	} catch (Throwable ex) {
6645	–	return tryCompleteComputation(ex);
5901		}
6647	–	MapReduceMappingsToDoubleTask<K,V> s = rights;
6648	–	if (s != null && !inForkJoinPool()) {
6649	–	do  {
6650	–	if (s.tryUnfork())
6651	–	s.exec();
6652	–	} while ((s = s.nextRight) != null);
6653	–	}
6654	–	return false;
5902		}
6656	–	public final Double getRawResult() { return result; }
5903		}
5904
5905	<	@SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V>
5905	>	@SuppressWarnings("serial")
5906	>	static final class MapReduceKeysToLongTask<K,V>
5907		extends BulkTask<K,V,Long> {
5908	<	final ObjectToLong<? super K> transformer;
5909	<	final LongByLongToLong reducer;
5908	>	final ToLongFunction<? super K> transformer;
5909	>	final LongBinaryOperator reducer;
5910		final long basis;
5911		long result;
5912		MapReduceKeysToLongTask<K,V> rights, nextRight;
5913		MapReduceKeysToLongTask
5914	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5914	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5915		MapReduceKeysToLongTask<K,V> nextRight,
5916	<	ObjectToLong<? super K> transformer,
5916	>	ToLongFunction<? super K> transformer,
5917		long basis,
5918	<	LongByLongToLong reducer) {
5919	<	super(m, p, b); this.nextRight = nextRight;
5918	>	LongBinaryOperator reducer) {
5919	>	super(p, b, i, f, t); this.nextRight = nextRight;
5920		this.transformer = transformer;
5921		this.basis = basis; this.reducer = reducer;
5922		}
5923	<	@SuppressWarnings("unchecked") public final boolean exec() {
5924	<	final ObjectToLong<? super K> transformer =
5925	<	this.transformer;
5926	<	final LongByLongToLong reducer = this.reducer;
5927	<	if (transformer == null || reducer == null)
5928	<	return abortOnNullFunction();
5929	<	try {
5930	<	final long id = this.basis;
5931	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5932	<	do {} while (!casPending(c = pending, c+1));
5923	>	public final Long getRawResult() { return result; }
5924	>	public final void compute() {
5925	>	final ToLongFunction<? super K> transformer;
5926	>	final LongBinaryOperator reducer;
5927	>	if ((transformer = this.transformer) != null &&
5928	>	(reducer = this.reducer) != null) {
5929	>	long r = this.basis;
5930	>	for (int i = baseIndex, f, h; batch > 0 &&
5931	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5932	>	addToPendingCount(1);
5933		(rights = new MapReduceKeysToLongTask<K,V>
5934	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5934	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5935	>	rights, transformer, r, reducer)).fork();
5936		}
5937	<	long r = id;
5938	<	while (advance() != null)
6691	<	r = reducer.apply(r, transformer.apply((K)nextKey));
5937	>	for (Node<K,V> p; (p = advance()) != null; )
5938	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p.key));
5939		result = r;
5940	<	for (MapReduceKeysToLongTask<K,V> t = this, s;;) {
5941	<	int c; BulkTask<K,V,?> par;
5942	<	if ((c = t.pending) == 0) {
5943	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5944	<	t.result = reducer.apply(t.result, s.result);
5945	<	}
5946	<	if ((par = t.parent) == null ||
5947	<	!(par instanceof MapReduceKeysToLongTask)) {
5948	<	t.quietlyComplete();
6702	<	break;
6703	<	}
6704	<	t = (MapReduceKeysToLongTask<K,V>)par;
5940	>	CountedCompleter<?> c;
5941	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5942	>	@SuppressWarnings("unchecked")
5943	>	MapReduceKeysToLongTask<K,V>
5944	>	t = (MapReduceKeysToLongTask<K,V>)c,
5945	>	s = t.rights;
5946	>	while (s != null) {
5947	>	t.result = reducer.applyAsLong(t.result, s.result);
5948	>	s = t.rights = s.nextRight;
5949		}
6706	–	else if (t.casPending(c, c - 1))
6707	–	break;
5950		}
6709	–	} catch (Throwable ex) {
6710	–	return tryCompleteComputation(ex);
6711	–	}
6712	–	MapReduceKeysToLongTask<K,V> s = rights;
6713	–	if (s != null && !inForkJoinPool()) {
6714	–	do  {
6715	–	if (s.tryUnfork())
6716	–	s.exec();
6717	–	} while ((s = s.nextRight) != null);
5951		}
6719	–	return false;
5952		}
6721	–	public final Long getRawResult() { return result; }
5953		}
5954
5955	<	@SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V>
5955	>	@SuppressWarnings("serial")
5956	>	static final class MapReduceValuesToLongTask<K,V>
5957		extends BulkTask<K,V,Long> {
5958	<	final ObjectToLong<? super V> transformer;
5959	<	final LongByLongToLong reducer;
5958	>	final ToLongFunction<? super V> transformer;
5959	>	final LongBinaryOperator reducer;
5960		final long basis;
5961		long result;
5962		MapReduceValuesToLongTask<K,V> rights, nextRight;
5963		MapReduceValuesToLongTask
5964	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5964	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5965		MapReduceValuesToLongTask<K,V> nextRight,
5966	<	ObjectToLong<? super V> transformer,
5966	>	ToLongFunction<? super V> transformer,
5967		long basis,
5968	<	LongByLongToLong reducer) {
5969	<	super(m, p, b); this.nextRight = nextRight;
5968	>	LongBinaryOperator reducer) {
5969	>	super(p, b, i, f, t); this.nextRight = nextRight;
5970		this.transformer = transformer;
5971		this.basis = basis; this.reducer = reducer;
5972		}
5973	<	@SuppressWarnings("unchecked") public final boolean exec() {
5974	<	final ObjectToLong<? super V> transformer =
5975	<	this.transformer;
5976	<	final LongByLongToLong reducer = this.reducer;
5977	<	if (transformer == null || reducer == null)
5978	<	return abortOnNullFunction();
5979	<	try {
5980	<	final long id = this.basis;
5981	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5982	<	do {} while (!casPending(c = pending, c+1));
5973	>	public final Long getRawResult() { return result; }
5974	>	public final void compute() {
5975	>	final ToLongFunction<? super V> transformer;
5976	>	final LongBinaryOperator reducer;
5977	>	if ((transformer = this.transformer) != null &&
5978	>	(reducer = this.reducer) != null) {
5979	>	long r = this.basis;
5980	>	for (int i = baseIndex, f, h; batch > 0 &&
5981	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5982	>	addToPendingCount(1);
5983		(rights = new MapReduceValuesToLongTask<K,V>
5984	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5984	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5985	>	rights, transformer, r, reducer)).fork();
5986		}
5987	<	long r = id;
5988	<	Object v;
6756	<	while ((v = advance()) != null)
6757	<	r = reducer.apply(r, transformer.apply((V)v));
5987	>	for (Node<K,V> p; (p = advance()) != null; )
5988	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p.val));
5989		result = r;
5990	<	for (MapReduceValuesToLongTask<K,V> t = this, s;;) {
5991	<	int c; BulkTask<K,V,?> par;
5992	<	if ((c = t.pending) == 0) {
5993	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5994	<	t.result = reducer.apply(t.result, s.result);
5995	<	}
5996	<	if ((par = t.parent) == null ||
5997	<	!(par instanceof MapReduceValuesToLongTask)) {
5998	<	t.quietlyComplete();
6768	<	break;
6769	<	}
6770	<	t = (MapReduceValuesToLongTask<K,V>)par;
5990	>	CountedCompleter<?> c;
5991	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5992	>	@SuppressWarnings("unchecked")
5993	>	MapReduceValuesToLongTask<K,V>
5994	>	t = (MapReduceValuesToLongTask<K,V>)c,
5995	>	s = t.rights;
5996	>	while (s != null) {
5997	>	t.result = reducer.applyAsLong(t.result, s.result);
5998	>	s = t.rights = s.nextRight;
5999		}
6772	–	else if (t.casPending(c, c - 1))
6773	–	break;
6000		}
6775	–	} catch (Throwable ex) {
6776	–	return tryCompleteComputation(ex);
6001		}
6778	–	MapReduceValuesToLongTask<K,V> s = rights;
6779	–	if (s != null && !inForkJoinPool()) {
6780	–	do  {
6781	–	if (s.tryUnfork())
6782	–	s.exec();
6783	–	} while ((s = s.nextRight) != null);
6784	–	}
6785	–	return false;
6002		}
6787	–	public final Long getRawResult() { return result; }
6003		}
6004
6005	<	@SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V>
6005	>	@SuppressWarnings("serial")
6006	>	static final class MapReduceEntriesToLongTask<K,V>
6007		extends BulkTask<K,V,Long> {
6008	<	final ObjectToLong<Map.Entry<K,V>> transformer;
6009	<	final LongByLongToLong reducer;
6008	>	final ToLongFunction<Map.Entry<K,V>> transformer;
6009	>	final LongBinaryOperator reducer;
6010		final long basis;
6011		long result;
6012		MapReduceEntriesToLongTask<K,V> rights, nextRight;
6013		MapReduceEntriesToLongTask
6014	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6014	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6015		MapReduceEntriesToLongTask<K,V> nextRight,
6016	<	ObjectToLong<Map.Entry<K,V>> transformer,
6016	>	ToLongFunction<Map.Entry<K,V>> transformer,
6017		long basis,
6018	<	LongByLongToLong reducer) {
6019	<	super(m, p, b); this.nextRight = nextRight;
6018	>	LongBinaryOperator reducer) {
6019	>	super(p, b, i, f, t); this.nextRight = nextRight;
6020		this.transformer = transformer;
6021		this.basis = basis; this.reducer = reducer;
6022		}
6023	<	@SuppressWarnings("unchecked") public final boolean exec() {
6024	<	final ObjectToLong<Map.Entry<K,V>> transformer =
6025	<	this.transformer;
6026	<	final LongByLongToLong reducer = this.reducer;
6027	<	if (transformer == null || reducer == null)
6028	<	return abortOnNullFunction();
6029	<	try {
6030	<	final long id = this.basis;
6031	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6032	<	do {} while (!casPending(c = pending, c+1));
6023	>	public final Long getRawResult() { return result; }
6024	>	public final void compute() {
6025	>	final ToLongFunction<Map.Entry<K,V>> transformer;
6026	>	final LongBinaryOperator reducer;
6027	>	if ((transformer = this.transformer) != null &&
6028	>	(reducer = this.reducer) != null) {
6029	>	long r = this.basis;
6030	>	for (int i = baseIndex, f, h; batch > 0 &&
6031	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6032	>	addToPendingCount(1);
6033		(rights = new MapReduceEntriesToLongTask<K,V>
6034	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6034	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6035	>	rights, transformer, r, reducer)).fork();
6036		}
6037	<	long r = id;
6038	<	Object v;
6822	<	while ((v = advance()) != null)
6823	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6037	>	for (Node<K,V> p; (p = advance()) != null; )
6038	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p));
6039		result = r;
6040	<	for (MapReduceEntriesToLongTask<K,V> t = this, s;;) {
6041	<	int c; BulkTask<K,V,?> par;
6042	<	if ((c = t.pending) == 0) {
6043	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6044	<	t.result = reducer.apply(t.result, s.result);
6045	<	}
6046	<	if ((par = t.parent) == null ||
6047	<	!(par instanceof MapReduceEntriesToLongTask)) {
6048	<	t.quietlyComplete();
6834	<	break;
6835	<	}
6836	<	t = (MapReduceEntriesToLongTask<K,V>)par;
6040	>	CountedCompleter<?> c;
6041	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6042	>	@SuppressWarnings("unchecked")
6043	>	MapReduceEntriesToLongTask<K,V>
6044	>	t = (MapReduceEntriesToLongTask<K,V>)c,
6045	>	s = t.rights;
6046	>	while (s != null) {
6047	>	t.result = reducer.applyAsLong(t.result, s.result);
6048	>	s = t.rights = s.nextRight;
6049		}
6838	–	else if (t.casPending(c, c - 1))
6839	–	break;
6050		}
6841	–	} catch (Throwable ex) {
6842	–	return tryCompleteComputation(ex);
6843	–	}
6844	–	MapReduceEntriesToLongTask<K,V> s = rights;
6845	–	if (s != null && !inForkJoinPool()) {
6846	–	do  {
6847	–	if (s.tryUnfork())
6848	–	s.exec();
6849	–	} while ((s = s.nextRight) != null);
6051		}
6851	–	return false;
6052		}
6853	–	public final Long getRawResult() { return result; }
6053		}
6054
6055	<	@SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V>
6055	>	@SuppressWarnings("serial")
6056	>	static final class MapReduceMappingsToLongTask<K,V>
6057		extends BulkTask<K,V,Long> {
6058	<	final ObjectByObjectToLong<? super K, ? super V> transformer;
6059	<	final LongByLongToLong reducer;
6058	>	final ToLongBiFunction<? super K, ? super V> transformer;
6059	>	final LongBinaryOperator reducer;
6060		final long basis;
6061		long result;
6062		MapReduceMappingsToLongTask<K,V> rights, nextRight;
6063		MapReduceMappingsToLongTask
6064	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6064	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6065		MapReduceMappingsToLongTask<K,V> nextRight,
6066	<	ObjectByObjectToLong<? super K, ? super V> transformer,
6066	>	ToLongBiFunction<? super K, ? super V> transformer,
6067		long basis,
6068	<	LongByLongToLong reducer) {
6069	<	super(m, p, b); this.nextRight = nextRight;
6068	>	LongBinaryOperator reducer) {
6069	>	super(p, b, i, f, t); this.nextRight = nextRight;
6070		this.transformer = transformer;
6071		this.basis = basis; this.reducer = reducer;
6072		}
6073	<	@SuppressWarnings("unchecked") public final boolean exec() {
6074	<	final ObjectByObjectToLong<? super K, ? super V> transformer =
6075	<	this.transformer;
6076	<	final LongByLongToLong reducer = this.reducer;
6077	<	if (transformer == null || reducer == null)
6078	<	return abortOnNullFunction();
6079	<	try {
6080	<	final long id = this.basis;
6081	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6082	<	do {} while (!casPending(c = pending, c+1));
6073	>	public final Long getRawResult() { return result; }
6074	>	public final void compute() {
6075	>	final ToLongBiFunction<? super K, ? super V> transformer;
6076	>	final LongBinaryOperator reducer;
6077	>	if ((transformer = this.transformer) != null &&
6078	>	(reducer = this.reducer) != null) {
6079	>	long r = this.basis;
6080	>	for (int i = baseIndex, f, h; batch > 0 &&
6081	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6082	>	addToPendingCount(1);
6083		(rights = new MapReduceMappingsToLongTask<K,V>
6084	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6084	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6085	>	rights, transformer, r, reducer)).fork();
6086		}
6087	<	long r = id;
6088	<	Object v;
6888	<	while ((v = advance()) != null)
6889	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6087	>	for (Node<K,V> p; (p = advance()) != null; )
6088	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p.key, p.val));
6089		result = r;
6090	<	for (MapReduceMappingsToLongTask<K,V> t = this, s;;) {
6091	<	int c; BulkTask<K,V,?> par;
6092	<	if ((c = t.pending) == 0) {
6093	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6094	<	t.result = reducer.apply(t.result, s.result);
6095	<	}
6096	<	if ((par = t.parent) == null ||
6097	<	!(par instanceof MapReduceMappingsToLongTask)) {
6098	<	t.quietlyComplete();
6900	<	break;
6901	<	}
6902	<	t = (MapReduceMappingsToLongTask<K,V>)par;
6090	>	CountedCompleter<?> c;
6091	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6092	>	@SuppressWarnings("unchecked")
6093	>	MapReduceMappingsToLongTask<K,V>
6094	>	t = (MapReduceMappingsToLongTask<K,V>)c,
6095	>	s = t.rights;
6096	>	while (s != null) {
6097	>	t.result = reducer.applyAsLong(t.result, s.result);
6098	>	s = t.rights = s.nextRight;
6099		}
6904	–	else if (t.casPending(c, c - 1))
6905	–	break;
6100		}
6907	–	} catch (Throwable ex) {
6908	–	return tryCompleteComputation(ex);
6909	–	}
6910	–	MapReduceMappingsToLongTask<K,V> s = rights;
6911	–	if (s != null && !inForkJoinPool()) {
6912	–	do  {
6913	–	if (s.tryUnfork())
6914	–	s.exec();
6915	–	} while ((s = s.nextRight) != null);
6101		}
6917	–	return false;
6102		}
6919	–	public final Long getRawResult() { return result; }
6103		}
6104
6105	<	@SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V>
6105	>	@SuppressWarnings("serial")
6106	>	static final class MapReduceKeysToIntTask<K,V>
6107		extends BulkTask<K,V,Integer> {
6108	<	final ObjectToInt<? super K> transformer;
6109	<	final IntByIntToInt reducer;
6108	>	final ToIntFunction<? super K> transformer;
6109	>	final IntBinaryOperator reducer;
6110		final int basis;
6111		int result;
6112		MapReduceKeysToIntTask<K,V> rights, nextRight;
6113		MapReduceKeysToIntTask
6114	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6114	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6115		MapReduceKeysToIntTask<K,V> nextRight,
6116	<	ObjectToInt<? super K> transformer,
6116	>	ToIntFunction<? super K> transformer,
6117		int basis,
6118	<	IntByIntToInt reducer) {
6119	<	super(m, p, b); this.nextRight = nextRight;
6118	>	IntBinaryOperator reducer) {
6119	>	super(p, b, i, f, t); this.nextRight = nextRight;
6120		this.transformer = transformer;
6121		this.basis = basis; this.reducer = reducer;
6122		}
6123	<	@SuppressWarnings("unchecked") public final boolean exec() {
6124	<	final ObjectToInt<? super K> transformer =
6125	<	this.transformer;
6126	<	final IntByIntToInt reducer = this.reducer;
6127	<	if (transformer == null || reducer == null)
6128	<	return abortOnNullFunction();
6129	<	try {
6130	<	final int id = this.basis;
6131	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6132	<	do {} while (!casPending(c = pending, c+1));
6123	>	public final Integer getRawResult() { return result; }
6124	>	public final void compute() {
6125	>	final ToIntFunction<? super K> transformer;
6126	>	final IntBinaryOperator reducer;
6127	>	if ((transformer = this.transformer) != null &&
6128	>	(reducer = this.reducer) != null) {
6129	>	int r = this.basis;
6130	>	for (int i = baseIndex, f, h; batch > 0 &&
6131	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6132	>	addToPendingCount(1);
6133		(rights = new MapReduceKeysToIntTask<K,V>
6134	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6134	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6135	>	rights, transformer, r, reducer)).fork();
6136		}
6137	<	int r = id;
6138	<	while (advance() != null)
6954	<	r = reducer.apply(r, transformer.apply((K)nextKey));
6137	>	for (Node<K,V> p; (p = advance()) != null; )
6138	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p.key));
6139		result = r;
6140	<	for (MapReduceKeysToIntTask<K,V> t = this, s;;) {
6141	<	int c; BulkTask<K,V,?> par;
6142	<	if ((c = t.pending) == 0) {
6143	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6144	<	t.result = reducer.apply(t.result, s.result);
6145	<	}
6146	<	if ((par = t.parent) == null ||
6147	<	!(par instanceof MapReduceKeysToIntTask)) {
6148	<	t.quietlyComplete();
6965	<	break;
6966	<	}
6967	<	t = (MapReduceKeysToIntTask<K,V>)par;
6140	>	CountedCompleter<?> c;
6141	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6142	>	@SuppressWarnings("unchecked")
6143	>	MapReduceKeysToIntTask<K,V>
6144	>	t = (MapReduceKeysToIntTask<K,V>)c,
6145	>	s = t.rights;
6146	>	while (s != null) {
6147	>	t.result = reducer.applyAsInt(t.result, s.result);
6148	>	s = t.rights = s.nextRight;
6149		}
6969	–	else if (t.casPending(c, c - 1))
6970	–	break;
6150		}
6972	–	} catch (Throwable ex) {
6973	–	return tryCompleteComputation(ex);
6974	–	}
6975	–	MapReduceKeysToIntTask<K,V> s = rights;
6976	–	if (s != null && !inForkJoinPool()) {
6977	–	do  {
6978	–	if (s.tryUnfork())
6979	–	s.exec();
6980	–	} while ((s = s.nextRight) != null);
6151		}
6982	–	return false;
6152		}
6984	–	public final Integer getRawResult() { return result; }
6153		}
6154
6155	<	@SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V>
6155	>	@SuppressWarnings("serial")
6156	>	static final class MapReduceValuesToIntTask<K,V>
6157		extends BulkTask<K,V,Integer> {
6158	<	final ObjectToInt<? super V> transformer;
6159	<	final IntByIntToInt reducer;
6158	>	final ToIntFunction<? super V> transformer;
6159	>	final IntBinaryOperator reducer;
6160		final int basis;
6161		int result;
6162		MapReduceValuesToIntTask<K,V> rights, nextRight;
6163		MapReduceValuesToIntTask
6164	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6164	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6165		MapReduceValuesToIntTask<K,V> nextRight,
6166	<	ObjectToInt<? super V> transformer,
6166	>	ToIntFunction<? super V> transformer,
6167		int basis,
6168	<	IntByIntToInt reducer) {
6169	<	super(m, p, b); this.nextRight = nextRight;
6168	>	IntBinaryOperator reducer) {
6169	>	super(p, b, i, f, t); this.nextRight = nextRight;
6170		this.transformer = transformer;
6171		this.basis = basis; this.reducer = reducer;
6172		}
6173	<	@SuppressWarnings("unchecked") public final boolean exec() {
6174	<	final ObjectToInt<? super V> transformer =
6175	<	this.transformer;
6176	<	final IntByIntToInt reducer = this.reducer;
6177	<	if (transformer == null || reducer == null)
6178	<	return abortOnNullFunction();
6179	<	try {
6180	<	final int id = this.basis;
6181	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6182	<	do {} while (!casPending(c = pending, c+1));
6173	>	public final Integer getRawResult() { return result; }
6174	>	public final void compute() {
6175	>	final ToIntFunction<? super V> transformer;
6176	>	final IntBinaryOperator reducer;
6177	>	if ((transformer = this.transformer) != null &&
6178	>	(reducer = this.reducer) != null) {
6179	>	int r = this.basis;
6180	>	for (int i = baseIndex, f, h; batch > 0 &&
6181	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6182	>	addToPendingCount(1);
6183		(rights = new MapReduceValuesToIntTask<K,V>
6184	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6184	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6185	>	rights, transformer, r, reducer)).fork();
6186		}
6187	<	int r = id;
6188	<	Object v;
7019	<	while ((v = advance()) != null)
7020	<	r = reducer.apply(r, transformer.apply((V)v));
6187	>	for (Node<K,V> p; (p = advance()) != null; )
6188	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p.val));
6189		result = r;
6190	<	for (MapReduceValuesToIntTask<K,V> t = this, s;;) {
6191	<	int c; BulkTask<K,V,?> par;
6192	<	if ((c = t.pending) == 0) {
6193	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6194	<	t.result = reducer.apply(t.result, s.result);
6195	<	}
6196	<	if ((par = t.parent) == null ||
6197	<	!(par instanceof MapReduceValuesToIntTask)) {
6198	<	t.quietlyComplete();
7031	<	break;
7032	<	}
7033	<	t = (MapReduceValuesToIntTask<K,V>)par;
6190	>	CountedCompleter<?> c;
6191	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6192	>	@SuppressWarnings("unchecked")
6193	>	MapReduceValuesToIntTask<K,V>
6194	>	t = (MapReduceValuesToIntTask<K,V>)c,
6195	>	s = t.rights;
6196	>	while (s != null) {
6197	>	t.result = reducer.applyAsInt(t.result, s.result);
6198	>	s = t.rights = s.nextRight;
6199		}
7035	–	else if (t.casPending(c, c - 1))
7036	–	break;
6200		}
7038	–	} catch (Throwable ex) {
7039	–	return tryCompleteComputation(ex);
6201		}
7041	–	MapReduceValuesToIntTask<K,V> s = rights;
7042	–	if (s != null && !inForkJoinPool()) {
7043	–	do  {
7044	–	if (s.tryUnfork())
7045	–	s.exec();
7046	–	} while ((s = s.nextRight) != null);
7047	–	}
7048	–	return false;
6202		}
7050	–	public final Integer getRawResult() { return result; }
6203		}
6204
6205	<	@SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V>
6205	>	@SuppressWarnings("serial")
6206	>	static final class MapReduceEntriesToIntTask<K,V>
6207		extends BulkTask<K,V,Integer> {
6208	<	final ObjectToInt<Map.Entry<K,V>> transformer;
6209	<	final IntByIntToInt reducer;
6208	>	final ToIntFunction<Map.Entry<K,V>> transformer;
6209	>	final IntBinaryOperator reducer;
6210		final int basis;
6211		int result;
6212		MapReduceEntriesToIntTask<K,V> rights, nextRight;
6213		MapReduceEntriesToIntTask
6214	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6214	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6215		MapReduceEntriesToIntTask<K,V> nextRight,
6216	<	ObjectToInt<Map.Entry<K,V>> transformer,
6216	>	ToIntFunction<Map.Entry<K,V>> transformer,
6217		int basis,
6218	<	IntByIntToInt reducer) {
6219	<	super(m, p, b); this.nextRight = nextRight;
6218	>	IntBinaryOperator reducer) {
6219	>	super(p, b, i, f, t); this.nextRight = nextRight;
6220		this.transformer = transformer;
6221		this.basis = basis; this.reducer = reducer;
6222		}
6223	<	@SuppressWarnings("unchecked") public final boolean exec() {
6224	<	final ObjectToInt<Map.Entry<K,V>> transformer =
6225	<	this.transformer;
6226	<	final IntByIntToInt reducer = this.reducer;
6227	<	if (transformer == null || reducer == null)
6228	<	return abortOnNullFunction();
6229	<	try {
6230	<	final int id = this.basis;
6231	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6232	<	do {} while (!casPending(c = pending, c+1));
6223	>	public final Integer getRawResult() { return result; }
6224	>	public final void compute() {
6225	>	final ToIntFunction<Map.Entry<K,V>> transformer;
6226	>	final IntBinaryOperator reducer;
6227	>	if ((transformer = this.transformer) != null &&
6228	>	(reducer = this.reducer) != null) {
6229	>	int r = this.basis;
6230	>	for (int i = baseIndex, f, h; batch > 0 &&
6231	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6232	>	addToPendingCount(1);
6233		(rights = new MapReduceEntriesToIntTask<K,V>
6234	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6234	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6235	>	rights, transformer, r, reducer)).fork();
6236		}
6237	<	int r = id;
6238	<	Object v;
7085	<	while ((v = advance()) != null)
7086	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6237	>	for (Node<K,V> p; (p = advance()) != null; )
6238	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p));
6239		result = r;
6240	<	for (MapReduceEntriesToIntTask<K,V> t = this, s;;) {
6241	<	int c; BulkTask<K,V,?> par;
6242	<	if ((c = t.pending) == 0) {
6243	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6244	<	t.result = reducer.apply(t.result, s.result);
6245	<	}
6246	<	if ((par = t.parent) == null ||
6247	<	!(par instanceof MapReduceEntriesToIntTask)) {
6248	<	t.quietlyComplete();
7097	<	break;
7098	<	}
7099	<	t = (MapReduceEntriesToIntTask<K,V>)par;
6240	>	CountedCompleter<?> c;
6241	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6242	>	@SuppressWarnings("unchecked")
6243	>	MapReduceEntriesToIntTask<K,V>
6244	>	t = (MapReduceEntriesToIntTask<K,V>)c,
6245	>	s = t.rights;
6246	>	while (s != null) {
6247	>	t.result = reducer.applyAsInt(t.result, s.result);
6248	>	s = t.rights = s.nextRight;
6249		}
7101	–	else if (t.casPending(c, c - 1))
7102	–	break;
6250		}
7104	–	} catch (Throwable ex) {
7105	–	return tryCompleteComputation(ex);
7106	–	}
7107	–	MapReduceEntriesToIntTask<K,V> s = rights;
7108	–	if (s != null && !inForkJoinPool()) {
7109	–	do  {
7110	–	if (s.tryUnfork())
7111	–	s.exec();
7112	–	} while ((s = s.nextRight) != null);
6251		}
7114	–	return false;
6252		}
7116	–	public final Integer getRawResult() { return result; }
6253		}
6254
6255	<	@SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V>
6255	>	@SuppressWarnings("serial")
6256	>	static final class MapReduceMappingsToIntTask<K,V>
6257		extends BulkTask<K,V,Integer> {
6258	<	final ObjectByObjectToInt<? super K, ? super V> transformer;
6259	<	final IntByIntToInt reducer;
6258	>	final ToIntBiFunction<? super K, ? super V> transformer;
6259	>	final IntBinaryOperator reducer;
6260		final int basis;
6261		int result;
6262		MapReduceMappingsToIntTask<K,V> rights, nextRight;
6263		MapReduceMappingsToIntTask
6264	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6265	<	MapReduceMappingsToIntTask<K,V> rights,
6266	<	ObjectByObjectToInt<? super K, ? super V> transformer,
6264	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6265	>	MapReduceMappingsToIntTask<K,V> nextRight,
6266	>	ToIntBiFunction<? super K, ? super V> transformer,
6267		int basis,
6268	<	IntByIntToInt reducer) {
6269	<	super(m, p, b); this.nextRight = nextRight;
6268	>	IntBinaryOperator reducer) {
6269	>	super(p, b, i, f, t); this.nextRight = nextRight;
6270		this.transformer = transformer;
6271		this.basis = basis; this.reducer = reducer;
6272		}
6273	<	@SuppressWarnings("unchecked") public final boolean exec() {
6274	<	final ObjectByObjectToInt<? super K, ? super V> transformer =
6275	<	this.transformer;
6276	<	final IntByIntToInt reducer = this.reducer;
6277	<	if (transformer == null || reducer == null)
6278	<	return abortOnNullFunction();
6279	<	try {
6280	<	final int id = this.basis;
6281	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6282	<	do {} while (!casPending(c = pending, c+1));
6273	>	public final Integer getRawResult() { return result; }
6274	>	public final void compute() {
6275	>	final ToIntBiFunction<? super K, ? super V> transformer;
6276	>	final IntBinaryOperator reducer;
6277	>	if ((transformer = this.transformer) != null &&
6278	>	(reducer = this.reducer) != null) {
6279	>	int r = this.basis;
6280	>	for (int i = baseIndex, f, h; batch > 0 &&
6281	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6282	>	addToPendingCount(1);
6283		(rights = new MapReduceMappingsToIntTask<K,V>
6284	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6284	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6285	>	rights, transformer, r, reducer)).fork();
6286		}
6287	<	int r = id;
6288	<	Object v;
7151	<	while ((v = advance()) != null)
7152	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6287	>	for (Node<K,V> p; (p = advance()) != null; )
6288	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p.key, p.val));
6289		result = r;
6290	<	for (MapReduceMappingsToIntTask<K,V> t = this, s;;) {
6291	<	int c; BulkTask<K,V,?> par;
6292	<	if ((c = t.pending) == 0) {
6293	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6294	<	t.result = reducer.apply(t.result, s.result);
6295	<	}
6296	<	if ((par = t.parent) == null ||
6297	<	!(par instanceof MapReduceMappingsToIntTask)) {
6298	<	t.quietlyComplete();
7163	<	break;
7164	<	}
7165	<	t = (MapReduceMappingsToIntTask<K,V>)par;
6290	>	CountedCompleter<?> c;
6291	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6292	>	@SuppressWarnings("unchecked")
6293	>	MapReduceMappingsToIntTask<K,V>
6294	>	t = (MapReduceMappingsToIntTask<K,V>)c,
6295	>	s = t.rights;
6296	>	while (s != null) {
6297	>	t.result = reducer.applyAsInt(t.result, s.result);
6298	>	s = t.rights = s.nextRight;
6299		}
7167	–	else if (t.casPending(c, c - 1))
7168	–	break;
6300		}
7170	–	} catch (Throwable ex) {
7171	–	return tryCompleteComputation(ex);
7172	–	}
7173	–	MapReduceMappingsToIntTask<K,V> s = rights;
7174	–	if (s != null && !inForkJoinPool()) {
7175	–	do  {
7176	–	if (s.tryUnfork())
7177	–	s.exec();
7178	–	} while ((s = s.nextRight) != null);
6301		}
7180	–	return false;
6302		}
7182	–	public final Integer getRawResult() { return result; }
6303		}
6304
6305		// Unsafe mechanics
6306	<	private static final sun.misc.Unsafe UNSAFE;
6307	<	private static final long counterOffset;
6308	<	private static final long sizeCtlOffset;
6309	<	private static final long ABASE;
6306	>	private static final sun.misc.Unsafe U = sun.misc.Unsafe.getUnsafe();
6307	>	private static final long SIZECTL;
6308	>	private static final long TRANSFERINDEX;
6309	>	private static final long BASECOUNT;
6310	>	private static final long CELLSBUSY;
6311	>	private static final long CELLVALUE;
6312	>	private static final int ABASE;
6313		private static final int ASHIFT;
6314
6315		static {
7193	–	int ss;
6316		try {
6317	<	UNSAFE = sun.misc.Unsafe.getUnsafe();
6318	<	Class<?> k = ConcurrentHashMap.class;
6319	<	counterOffset = UNSAFE.objectFieldOffset
6320	<	(k.getDeclaredField("counter"));
6321	<	sizeCtlOffset = UNSAFE.objectFieldOffset
6322	<	(k.getDeclaredField("sizeCtl"));
6323	<	Class<?> sc = Node[].class;
6324	<	ABASE = UNSAFE.arrayBaseOffset(sc);
6325	<	ss = UNSAFE.arrayIndexScale(sc);
6326	<	} catch (Exception e) {
6317	>	SIZECTL = U.objectFieldOffset
6318	>	(ConcurrentHashMap.class.getDeclaredField("sizeCtl"));
6319	>	TRANSFERINDEX = U.objectFieldOffset
6320	>	(ConcurrentHashMap.class.getDeclaredField("transferIndex"));
6321	>	BASECOUNT = U.objectFieldOffset
6322	>	(ConcurrentHashMap.class.getDeclaredField("baseCount"));
6323	>	CELLSBUSY = U.objectFieldOffset
6324	>	(ConcurrentHashMap.class.getDeclaredField("cellsBusy"));
6325	>
6326	>	CELLVALUE = U.objectFieldOffset
6327	>	(CounterCell.class.getDeclaredField("value"));
6328	>
6329	>	ABASE = U.arrayBaseOffset(Node[].class);
6330	>	int scale = U.arrayIndexScale(Node[].class);
6331	>	if ((scale & (scale - 1)) != 0)
6332	>	throw new Error("array index scale not a power of two");
6333	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(scale);
6334	>	} catch (ReflectiveOperationException e) {
6335		throw new Error(e);
6336		}
6337	<	if ((ss & (ss-1)) != 0)
6338	<	throw new Error("data type scale not a power of two");
6339	<	ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
6337	>
6338	>	// Reduce the risk of rare disastrous classloading in first call to
6339	>	// LockSupport.park: https://bugs.openjdk.java.net/browse/JDK-8074773
6340	>	Class<?> ensureLoaded = LockSupport.class;
6341		}
6342		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines