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.131 by jsr166, Tue Oct 2 05:08:35 2012 UTC vs.
Revision 1.318 by jsr166, Sat Aug 10 16:48:05 2019 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	>	import jdk.internal.misc.Unsafe;
43
44		/**
45		* A hash table supporting full concurrency of retrievals and
#	Line 43 | Line 53 | import java.io.Serializable;
53		* interoperable with {@code Hashtable} in programs that rely on its
54		* thread safety but not on its synchronization details.
55		*
56	<	* <p> Retrieval operations (including {@code get}) generally do not
56	>	* <p>Retrieval operations (including {@code get}) generally do not
57		* block, so may overlap with update operations (including {@code put}
58		* and {@code remove}). Retrievals reflect the results of the most
59		* recently <em>completed</em> update operations holding upon their
#	Line 52 | Line 62 | import java.io.Serializable;
62		* that key reporting the updated value.)  For aggregate operations
63		* such as {@code putAll} and {@code clear}, concurrent retrievals may
64		* reflect insertion or removal of only some entries.  Similarly,
65	<	* Iterators and Enumerations return elements reflecting the state of
66	<	* the hash table at some point at or since the creation of the
65	>	* Iterators, Spliterators and Enumerations return elements reflecting the
66	>	* state of the hash table at some point at or since the creation of the
67		* iterator/enumeration.  They do <em>not</em> throw {@link
68	<	* ConcurrentModificationException}.  However, iterators are designed
69	<	* to be used by only one thread at a time.  Bear in mind that the
70	<	* results of aggregate status methods including {@code size}, {@code
71	<	* isEmpty}, and {@code containsValue} are typically useful only when
72	<	* a map is not undergoing concurrent updates in other threads.
68	>	* java.util.ConcurrentModificationException ConcurrentModificationException}.
69	>	* However, iterators are designed to be used by only one thread at a time.
70	>	* Bear in mind that the results of aggregate status methods including
71	>	* {@code size}, {@code isEmpty}, and {@code containsValue} are typically
72	>	* useful only when a map is not undergoing concurrent updates in other threads.
73		* Otherwise the results of these methods reflect transient states
74		* that may be adequate for monitoring or estimation purposes, but not
75		* for program control.
76		*
77	<	* <p> The table is dynamically expanded when there are too many
77	>	* <p>The table is dynamically expanded when there are too many
78		* collisions (i.e., keys that have distinct hash codes but fall into
79		* the same slot modulo the table size), with the expected average
80		* effect of maintaining roughly two bins per mapping (corresponding
#	Line 83 | Line 93 | import java.io.Serializable;
93		* expected {@code concurrencyLevel} as an additional hint for
94		* internal sizing.  Note that using many keys with exactly the same
95		* {@code hashCode()} is a sure way to slow down performance of any
96	<	* hash table.
96	>	* hash table. To ameliorate impact, when keys are {@link Comparable},
97	>	* this class may use comparison order among keys to help break ties.
98	>	*
99	>	* <p>A {@link Set} projection of a ConcurrentHashMap may be created
100	>	* (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
101	>	* (using {@link #keySet(Object)} when only keys are of interest, and the
102	>	* mapped values are (perhaps transiently) not used or all take the
103	>	* same mapping value.
104	>	*
105	>	* <p>A ConcurrentHashMap can be used as a scalable frequency map (a
106	>	* form of histogram or multiset) by using {@link
107	>	* java.util.concurrent.atomic.LongAdder} values and initializing via
108	>	* {@link #computeIfAbsent computeIfAbsent}. For example, to add a count
109	>	* to a {@code ConcurrentHashMap<String,LongAdder> freqs}, you can use
110	>	* {@code freqs.computeIfAbsent(key, k -> new LongAdder()).increment();}
111		*
112		* <p>This class and its views and iterators implement all of the
113		* <em>optional</em> methods of the {@link Map} and {@link Iterator}
114		* interfaces.
115		*
116	<	* <p> Like {@link Hashtable} but unlike {@link HashMap}, this class
116	>	* <p>Like {@link Hashtable} but unlike {@link HashMap}, this class
117		* does <em>not</em> allow {@code null} to be used as a key or value.
118		*
119	+	* <p>ConcurrentHashMaps support a set of sequential and parallel bulk
120	+	* operations that, unlike most {@link Stream} methods, are designed
121	+	* to be safely, and often sensibly, applied even with maps that are
122	+	* being concurrently updated by other threads; for example, when
123	+	* computing a snapshot summary of the values in a shared registry.
124	+	* There are three kinds of operation, each with four forms, accepting
125	+	* functions with keys, values, entries, and (key, value) pairs as
126	+	* arguments and/or return values. Because the elements of a
127	+	* ConcurrentHashMap are not ordered in any particular way, and may be
128	+	* processed in different orders in different parallel executions, the
129	+	* correctness of supplied functions should not depend on any
130	+	* ordering, or on any other objects or values that may transiently
131	+	* change while computation is in progress; and except for forEach
132	+	* actions, should ideally be side-effect-free. Bulk operations on
133	+	* {@link Map.Entry} objects do not support method {@code setValue}.
134	+	*
135	+	* <ul>
136	+	* <li>forEach: Performs a given action on each element.
137	+	* A variant form applies a given transformation on each element
138	+	* before performing the action.
139	+	*
140	+	* <li>search: Returns the first available non-null result of
141	+	* applying a given function on each element; skipping further
142	+	* search when a result is found.
143	+	*
144	+	* <li>reduce: Accumulates each element.  The supplied reduction
145	+	* function cannot rely on ordering (more formally, it should be
146	+	* both associative and commutative).  There are five variants:
147	+	*
148	+	* <ul>
149	+	*
150	+	* <li>Plain reductions. (There is not a form of this method for
151	+	* (key, value) function arguments since there is no corresponding
152	+	* return type.)
153	+	*
154	+	* <li>Mapped reductions that accumulate the results of a given
155	+	* function applied to each element.
156	+	*
157	+	* <li>Reductions to scalar doubles, longs, and ints, using a
158	+	* given basis value.
159	+	*
160	+	* </ul>
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
177	+	* happens-before relation with the associated insertion or
178	+	* update.  The result of any bulk operation reflects the
179	+	* composition of these per-element relations (but is not
180	+	* necessarily atomic with respect to the map as a whole unless it
181	+	* is somehow known to be quiescent).  Conversely, because keys
182	+	* and values in the map are never null, null serves as a reliable
183	+	* atomic indicator of the current lack of any result.  To
184	+	* maintain this property, null serves as an implicit basis for
185	+	* all non-scalar reduction operations. For the double, long, and
186	+	* int versions, the basis should be one that, when combined with
187	+	* any other value, returns that other value (more formally, it
188	+	* should be the identity element for the reduction). Most common
189	+	* reductions have these properties; for example, computing a sum
190	+	* with basis 0 or a minimum with basis MAX_VALUE.
191	+	*
192	+	* <p>Search and transformation functions provided as arguments
193	+	* should similarly return null to indicate the lack of any result
194	+	* (in which case it is not used). In the case of mapped
195	+	* reductions, this also enables transformations to serve as
196	+	* filters, returning null (or, in the case of primitive
197	+	* specializations, the identity basis) if the element should not
198	+	* be combined. You can create compound transformations and
199	+	* filterings by composing them yourself under this "null means
200	+	* there is nothing there now" rule before using them in search or
201	+	* reduce operations.
202	+	*
203	+	* <p>Methods accepting and/or returning Entry arguments maintain
204	+	* key-value associations. They may be useful for example when
205	+	* finding the key for the greatest value. Note that "plain" Entry
206	+	* arguments can be supplied using {@code new
207	+	* AbstractMap.SimpleEntry(k,v)}.
208	+	*
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>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>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">
227	>	* <a href="{@docRoot}/java.base/java/util/package-summary.html#CollectionsFramework">
228		* Java Collections Framework</a>.
229		*
99	–	* <p><em> During transition to JDK8, this
100	–	* class declares and uses nested functional interfaces with different
101	–	* names but the same forms as those expected for JDK8.<em>
102	–	*
230		* @since 1.5
231		* @author Doug Lea
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
112	–	/**
113	–	* A partitionable iterator. A Spliterator can be traversed
114	–	* directly, but can also be partitioned (before traversal) by
115	–	* creating another Spliterator that covers a non-overlapping
116	–	* portion of the elements, and so may be amenable to parallel
117	–	* execution.
118	–	*
119	–	* <p> This interface exports a subset of expected JDK8
120	–	* functionality.
121	–	*
122	–	* <p>Sample usage: Here is one (of the several) ways to compute
123	–	* the sum of the values held in a map using the ForkJoin
124	–	* framework. As illustrated here, Spliterators are well suited to
125	–	* designs in which a task repeatedly splits off half its work
126	–	* into forked subtasks until small enough to process directly,
127	–	* and then joins these subtasks. Variants of this style can also
128	–	* be used in completion-based designs.
129	–	*
130	–	* <pre>
131	–	* {@code ConcurrentHashMap<String, Long> m = ...
132	–	* // split as if have 8 * parallelism, for load balance
133	–	* int n = m.size();
134	–	* int p = aForkJoinPool.getParallelism() * 8;
135	–	* int split = (n < p)? n : p;
136	–	* long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
137	–	* // ...
138	–	* static class SumValues extends RecursiveTask<Long> {
139	–	*   final Spliterator<Long> s;
140	–	*   final int split;             // split while > 1
141	–	*   final SumValues nextJoin;    // records forked subtasks to join
142	–	*   SumValues(Spliterator<Long> s, int depth, SumValues nextJoin) {
143	–	*     this.s = s; this.depth = depth; this.nextJoin = nextJoin;
144	–	*   }
145	–	*   public Long compute() {
146	–	*     long sum = 0;
147	–	*     SumValues subtasks = null; // fork subtasks
148	–	*     for (int s = split >>> 1; s > 0; s >>>= 1)
149	–	*       (subtasks = new SumValues(s.split(), s, subtasks)).fork();
150	–	*     while (s.hasNext())        // directly process remaining elements
151	–	*       sum += s.next();
152	–	*     for (SumValues t = subtasks; t != null; t = t.nextJoin)
153	–	*       sum += t.join();         // collect subtask results
154	–	*     return sum;
155	–	*   }
156	–	* }
157	–	* }</pre>
158	–	*/
159	–	public static interface Spliterator<T> extends Iterator<T> {
160	–	/**
161	–	* Returns a Spliterator covering approximately half of the
162	–	* elements, guaranteed not to overlap with those subsequently
163	–	* returned by this Spliterator.  After invoking this method,
164	–	* the current Spliterator will <em>not</em> produce any of
165	–	* the elements of the returned Spliterator, but the two
166	–	* Spliterators together will produce all of the elements that
167	–	* would have been produced by this Spliterator had this
168	–	* method not been called. The exact number of elements
169	–	* produced by the returned Spliterator is not guaranteed, and
170	–	* may be zero (i.e., with {@code hasNext()} reporting {@code
171	–	* false}) if this Spliterator cannot be further split.
172	–	*
173	–	* @return a Spliterator covering approximately half of the
174	–	* elements
175	–	* @throws IllegalStateException if this Spliterator has
176	–	* already commenced traversing elements
177	–	*/
178	–	Spliterator<T> split();
179	–	}
180	–
239		/*
240		* Overview:
241		*
#	Line 188 | 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 207 | 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
216	<	* purposes -- they are available anyway because of addressing
217	<	* constraints.  As explained further below, these top bits are
218	<	* used as follows:
219	<	*  00 - Normal
220	<	*  01 - Locked
221	<	*  11 - Locked and may have a thread waiting for lock
222	<	*  10 - Node is a forwarding node
223	<	*
224	<	* The lower 30 bits of each Node's hash field contain a
225	<	* transformation of the key's hash code, except for forwarding
226	<	* nodes, for which the lower bits are zero (and so always have
227	<	* hash field == MOVED).
271	>	* (jdk.internal.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 233 | 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
238	<	* construction, so we overlay these by using bits of the Node
239	<	* hash field for lock control (see above), and so normally use
240	<	* builtin monitors only for blocking and signalling using
241	<	* 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,
249	<	* operations that only conditionally update may inspect nodes
250	<	* until the point of update. This is a converse of sorts to the
251	<	* 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 281 | 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
290	<	* Comparable.  These TreeBins use a balanced tree to hold nodes
291	<	* (a specialized form of red-black trees), bounding search time
292	<	* 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 300 | 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 collectible 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 351 | 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
451	<	* leave untouched but unused constructor arguments refering to
451	>	* leave untouched but unused constructor arguments referring to
452		* concurrencyLevel. We accept a loadFactor constructor argument,
453		* but apply it only to initial table capacity (which is the only
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 415 | 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
436	<	static final int LOCKED    = 0x40000000; // set/tested only as a bit
437	<	static final int WAITING   = 0xc0000000; // both bits set/tested together
438	<	static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash
439	<
440	<	/* ---------------- 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 final 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
456	<	* null, holds the initial table size to use upon creation, or 0
457	<	* for default. After initialization, holds the next element count
458	<	* 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 KeySet<K,V> keySet;
556	<	private transient Values<K,V> values;
557	<	private transient EntrySet<K,V> entrySet;
466	<
467	<	/** For serialization compatibility. Null unless serialized; see below */
468	<	private Segment<K,V>[] segments;
469	<
470	<	/* ---------------- 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
474	<	* elements of in-progress next table while resizing.  Uses are
475	<	* null checked by callers, and implicitly bounds-checked, relying
476	<	* on the invariants that tab arrays have non-zero size, and all
477	<	* indices are masked with (tab.length - 1) which is never
478	<	* negative and always less than length. Note that, to be correct
479	<	* wrt arbitrary concurrency errors by users, bounds checks must
480	<	* operate on local variables, which accounts for some odd-looking
481	<	* 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	>	/**
571	>	* Serialized pseudo-fields, provided only for jdk7 compatibility.
572	>	* @serialField segments Segment[]
573	>	*   The segments, each of which is a specialized hash table.
574	>	* @serialField segmentMask int
575	>	*   Mask value for indexing into segments. The upper bits of a
576	>	*   key's hash code are used to choose the segment.
577	>	* @serialField segmentShift int
578	>	*   Shift value for indexing within segments.
579	>	*/
580	>	private static final ObjectStreamField[] serialPersistentFields = {
581	>	new ObjectStreamField("segments", Segment[].class),
582	>	new ObjectStreamField("segmentMask", Integer.TYPE),
583	>	new ObjectStreamField("segmentShift", Integer.TYPE),
584	>	};
585
586		/* ---------------- Nodes -------------- */
587
588		/**
589	<	* Key-value entry. Note that this is never exported out as a
590	<	* user-visible Map.Entry (see MapEntry below). Nodes with a hash
591	<	* field of MOVED are special, and do not contain user keys or
592	<	* values.  Otherwise, keys are never null, and null val fields
593	<	* indicate that a node is in the process of being deleted or
594	<	* created. For purposes of read-only access, a key may be read
595	<	* before a val, but can only be used after checking val to be
596	<	* non-null.
597	<	*/
598	<	static class Node {
599	<	volatile int hash;
600	<	final Object key;
511	<	volatile Object val;
512	<	volatile Node next;
589	>	* Key-value entry.  This class is never exported out as a
590	>	* user-mutable Map.Entry (i.e., one supporting setValue; see
591	>	* MapEntry below), but can be used for read-only traversals used
592	>	* in bulk tasks.  Subclasses of Node with a negative hash field
593	>	* are special, and contain null keys and values (but are never
594	>	* exported).  Otherwise, keys and vals are never null.
595	>	*/
596	>	static class Node<K,V> implements Map.Entry<K,V> {
597	>	final int hash;
598	>	final K key;
599	>	volatile V val;
600	>	volatile Node<K,V> next;
601
602	<	Node(int hash, Object key, Object val, Node next) {
602	>	Node(int hash, K key, V val) {
603		this.hash = hash;
604		this.key = key;
605		this.val = val;
518	–	this.next = next;
519	–	}
520	–
521	–	/** CompareAndSet the hash field */
522	–	final boolean casHash(int cmp, int val) {
523	–	return UNSAFE.compareAndSwapInt(this, hashOffset, cmp, val);
524	–	}
525	–
526	–	/** The number of spins before blocking for a lock */
527	–	static final int MAX_SPINS =
528	–	Runtime.getRuntime().availableProcessors() > 1 ? 64 : 1;
529	–
530	–	/**
531	–	* Spins a while if LOCKED bit set and this node is the first
532	–	* of its bin, and then sets WAITING bits on hash field and
533	–	* blocks (once) if they are still set.  It is OK for this
534	–	* method to return even if lock is not available upon exit,
535	–	* which enables these simple single-wait mechanics.
536	–	*
537	–	* The corresponding signalling operation is performed within
538	–	* callers: Upon detecting that WAITING has been set when
539	–	* unlocking lock (via a failed CAS from non-waiting LOCKED
540	–	* state), unlockers acquire the sync lock and perform a
541	–	* notifyAll.
542	–	*
543	–	* The initial sanity check on tab and bounds is not currently
544	–	* necessary in the only usages of this method, but enables
545	–	* use in other future contexts.
546	–	*/
547	–	final void tryAwaitLock(Node[] tab, int i) {
548	–	if (tab != null && i >= 0 && i < tab.length) { // sanity check
549	–	int r = ThreadLocalRandom.current().nextInt(); // randomize spins
550	–	int spins = MAX_SPINS, h;
551	–	while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) {
552	–	if (spins >= 0) {
553	–	r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
554	–	if (r >= 0 && --spins == 0)
555	–	Thread.yield();  // yield before block
556	–	}
557	–	else if (casHash(h, h | WAITING)) {
558	–	synchronized (this) {
559	–	if (tabAt(tab, i) == this &&
560	–	(hash & WAITING) == WAITING) {
561	–	try {
562	–	wait();
563	–	} catch (InterruptedException ie) {
564	–	Thread.currentThread().interrupt();
565	–	}
566	–	}
567	–	else
568	–	notifyAll(); // possibly won race vs signaller
569	–	}
570	–	break;
571	–	}
572	–	}
573	–	}
574	–	}
575	–
576	–	// Unsafe mechanics for casHash
577	–	private static final sun.misc.Unsafe UNSAFE;
578	–	private static final long hashOffset;
579	–
580	–	static {
581	–	try {
582	–	UNSAFE = sun.misc.Unsafe.getUnsafe();
583	–	Class<?> k = Node.class;
584	–	hashOffset = UNSAFE.objectFieldOffset
585	–	(k.getDeclaredField("hash"));
586	–	} catch (Exception e) {
587	–	throw new Error(e);
588	–	}
589	–	}
590	–	}
591	–
592	–	/* ---------------- TreeBins -------------- */
593	–
594	–	/**
595	–	* Nodes for use in TreeBins
596	–	*/
597	–	static final class TreeNode extends Node {
598	–	TreeNode parent;  // red-black tree links
599	–	TreeNode left;
600	–	TreeNode right;
601	–	TreeNode prev;    // needed to unlink next upon deletion
602	–	boolean red;
603	–
604	–	TreeNode(int hash, Object key, Object val, Node next, TreeNode parent) {
605	–	super(hash, key, val, next);
606	–	this.parent = parent;
606		}
608	–	}
607
608	<	/**
609	<	* A specialized form of red-black tree for use in bins
610	<	* whose size exceeds a threshold.
613	<	*
614	<	* TreeBins use a special form of comparison for search and
615	<	* related operations (which is the main reason we cannot use
616	<	* existing collections such as TreeMaps). TreeBins contain
617	<	* Comparable elements, but may contain others, as well as
618	<	* elements that are Comparable but not necessarily Comparable<T>
619	<	* for the same T, so we cannot invoke compareTo among them. To
620	<	* handle this, the tree is ordered primarily by hash value, then
621	<	* by getClass().getName() order, and then by Comparator order
622	<	* among elements of the same class.  On lookup at a node, if
623	<	* elements are not comparable or compare as 0, both left and
624	<	* right children may need to be searched in the case of tied hash
625	<	* values. (This corresponds to the full list search that would be
626	<	* necessary if all elements were non-Comparable and had tied
627	<	* hashes.)  The red-black balancing code is updated from
628	<	* pre-jdk-collections
629	<	* (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
630	<	* based in turn on Cormen, Leiserson, and Rivest "Introduction to
631	<	* Algorithms" (CLR).
632	<	*
633	<	* TreeBins also maintain a separate locking discipline than
634	<	* regular bins. Because they are forwarded via special MOVED
635	<	* nodes at bin heads (which can never change once established),
636	<	* we cannot use those nodes as locks. Instead, TreeBin
637	<	* extends AbstractQueuedSynchronizer to support a simple form of
638	<	* read-write lock. For update operations and table validation,
639	<	* the exclusive form of lock behaves in the same way as bin-head
640	<	* locks. However, lookups use shared read-lock mechanics to allow
641	<	* multiple readers in the absence of writers.  Additionally,
642	<	* these lookups do not ever block: While the lock is not
643	<	* available, they proceed along the slow traversal path (via
644	<	* next-pointers) until the lock becomes available or the list is
645	<	* exhausted, whichever comes first. (These cases are not fast,
646	<	* but maximize aggregate expected throughput.)  The AQS mechanics
647	<	* for doing this are straightforward.  The lock state is held as
648	<	* AQS getState().  Read counts are negative; the write count (1)
649	<	* is positive.  There are no signalling preferences among readers
650	<	* and writers. Since we don't need to export full Lock API, we
651	<	* just override the minimal AQS methods and use them directly.
652	<	*/
653	<	static final class TreeBin extends AbstractQueuedSynchronizer {
654	<	private static final long serialVersionUID = 2249069246763182397L;
655	<	transient TreeNode root;  // root of tree
656	<	transient TreeNode first; // head of next-pointer list
657	<
658	<	/* AQS overrides */
659	<	public final boolean isHeldExclusively() { return getState() > 0; }
660	<	public final boolean tryAcquire(int ignore) {
661	<	if (compareAndSetState(0, 1)) {
662	<	setExclusiveOwnerThread(Thread.currentThread());
663	<	return true;
664	<	}
665	<	return false;
666	<	}
667	<	public final boolean tryRelease(int ignore) {
668	<	setExclusiveOwnerThread(null);
669	<	setState(0);
670	<	return true;
671	<	}
672	<	public final int tryAcquireShared(int ignore) {
673	<	for (int c;;) {
674	<	if ((c = getState()) > 0)
675	<	return -1;
676	<	if (compareAndSetState(c, c -1))
677	<	return 1;
678	<	}
679	<	}
680	<	public final boolean tryReleaseShared(int ignore) {
681	<	int c;
682	<	do {} while (!compareAndSetState(c = getState(), c + 1));
683	<	return c == -1;
684	<	}
685	<
686	<	/** From CLR */
687	<	private void rotateLeft(TreeNode p) {
688	<	if (p != null) {
689	<	TreeNode r = p.right, pp, rl;
690	<	if ((rl = p.right = r.left) != null)
691	<	rl.parent = p;
692	<	if ((pp = r.parent = p.parent) == null)
693	<	root = r;
694	<	else if (pp.left == p)
695	<	pp.left = r;
696	<	else
697	<	pp.right = r;
698	<	r.left = p;
699	<	p.parent = r;
700	<	}
608	>	Node(int hash, K key, V val, Node<K,V> next) {
609	>	this(hash, key, val);
610	>	this.next = next;
611		}
612
613	<	/** From CLR */
614	<	private void rotateRight(TreeNode p) {
615	<	if (p != null) {
616	<	TreeNode l = p.left, pp, lr;
617	<	if ((lr = p.left = l.right) != null)
708	<	lr.parent = p;
709	<	if ((pp = l.parent = p.parent) == null)
710	<	root = l;
711	<	else if (pp.right == p)
712	<	pp.right = l;
713	<	else
714	<	pp.left = l;
715	<	l.right = p;
716	<	p.parent = l;
717	<	}
613	>	public final K getKey()     { return key; }
614	>	public final V getValue()   { return val; }
615	>	public final int hashCode() { return key.hashCode() ^ val.hashCode(); }
616	>	public final String toString() {
617	>	return Helpers.mapEntryToString(key, val);
618		}
619	<
620	<	/**
721	<	* Returns the TreeNode (or null if not found) for the given key
722	<	* starting at given root.
723	<	*/
724	<	@SuppressWarnings("unchecked") final TreeNode getTreeNode
725	<	(int h, Object k, TreeNode p) {
726	<	Class<?> c = k.getClass();
727	<	while (p != null) {
728	<	int dir, ph;  Object pk; Class<?> pc;
729	<	if ((ph = p.hash) == h) {
730	<	if ((pk = p.key) == k || k.equals(pk))
731	<	return p;
732	<	if (c != (pc = pk.getClass()) ||
733	<	!(k instanceof Comparable) ||
734	<	(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
735	<	dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
736	<	TreeNode r = null, s = null, pl, pr;
737	<	if (dir >= 0) {
738	<	if ((pl = p.left) != null && h <= pl.hash)
739	<	s = pl;
740	<	}
741	<	else if ((pr = p.right) != null && h >= pr.hash)
742	<	s = pr;
743	<	if (s != null && (r = getTreeNode(h, k, s)) != null)
744	<	return r;
745	<	}
746	<	}
747	<	else
748	<	dir = (h < ph) ? -1 : 1;
749	<	p = (dir > 0) ? p.right : p.left;
750	<	}
751	<	return null;
619	>	public final V setValue(V value) {
620	>	throw new UnsupportedOperationException();
621		}
622
623	<	/**
624	<	* Wrapper for getTreeNode used by CHM.get. Tries to obtain
625	<	* read-lock to call getTreeNode, but during failure to get
626	<	* lock, searches along next links.
627	<	*/
628	<	final Object getValue(int h, Object k) {
629	<	Node r = null;
761	<	int c = getState(); // Must read lock state first
762	<	for (Node e = first; e != null; e = e.next) {
763	<	if (c <= 0 && compareAndSetState(c, c - 1)) {
764	<	try {
765	<	r = getTreeNode(h, k, root);
766	<	} finally {
767	<	releaseShared(0);
768	<	}
769	<	break;
770	<	}
771	<	else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) {
772	<	r = e;
773	<	break;
774	<	}
775	<	else
776	<	c = getState();
777	<	}
778	<	return r == null ? null : r.val;
623	>	public final boolean equals(Object o) {
624	>	Object k, v, u; Map.Entry<?,?> e;
625	>	return ((o instanceof Map.Entry) &&
626	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
627	>	(v = e.getValue()) != null &&
628	>	(k == key || k.equals(key)) &&
629	>	(v == (u = val) || v.equals(u)));
630		}
631
632		/**
633	<	* Finds or adds a node.
783	<	* @return null if added
633	>	* Virtualized support for map.get(); overridden in subclasses.
634		*/
635	<	@SuppressWarnings("unchecked") final TreeNode putTreeNode
636	<	(int h, Object k, Object v) {
637	<	Class<?> c = k.getClass();
638	<	TreeNode pp = root, p = null;
639	<	int dir = 0;
640	<	while (pp != null) { // find existing node or leaf to insert at
641	<	int ph;  Object pk; Class<?> pc;
642	<	p = pp;
643	<	if ((ph = p.hash) == h) {
794	<	if ((pk = p.key) == k || k.equals(pk))
795	<	return p;
796	<	if (c != (pc = pk.getClass()) ||
797	<	!(k instanceof Comparable) ||
798	<	(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
799	<	dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
800	<	TreeNode r = null, s = null, pl, pr;
801	<	if (dir >= 0) {
802	<	if ((pl = p.left) != null && h <= pl.hash)
803	<	s = pl;
804	<	}
805	<	else if ((pr = p.right) != null && h >= pr.hash)
806	<	s = pr;
807	<	if (s != null && (r = getTreeNode(h, k, s)) != null)
808	<	return r;
809	<	}
810	<	}
811	<	else
812	<	dir = (h < ph) ? -1 : 1;
813	<	pp = (dir > 0) ? p.right : p.left;
814	<	}
815	<
816	<	TreeNode f = first;
817	<	TreeNode x = first = new TreeNode(h, k, v, f, p);
818	<	if (p == null)
819	<	root = x;
820	<	else { // attach and rebalance; adapted from CLR
821	<	TreeNode xp, xpp;
822	<	if (f != null)
823	<	f.prev = x;
824	<	if (dir <= 0)
825	<	p.left = x;
826	<	else
827	<	p.right = x;
828	<	x.red = true;
829	<	while (x != null && (xp = x.parent) != null && xp.red &&
830	<	(xpp = xp.parent) != null) {
831	<	TreeNode xppl = xpp.left;
832	<	if (xp == xppl) {
833	<	TreeNode y = xpp.right;
834	<	if (y != null && y.red) {
835	<	y.red = false;
836	<	xp.red = false;
837	<	xpp.red = true;
838	<	x = xpp;
839	<	}
840	<	else {
841	<	if (x == xp.right) {
842	<	rotateLeft(x = xp);
843	<	xpp = (xp = x.parent) == null ? null : xp.parent;
844	<	}
845	<	if (xp != null) {
846	<	xp.red = false;
847	<	if (xpp != null) {
848	<	xpp.red = true;
849	<	rotateRight(xpp);
850	<	}
851	<	}
852	<	}
853	<	}
854	<	else {
855	<	TreeNode y = xppl;
856	<	if (y != null && y.red) {
857	<	y.red = false;
858	<	xp.red = false;
859	<	xpp.red = true;
860	<	x = xpp;
861	<	}
862	<	else {
863	<	if (x == xp.left) {
864	<	rotateRight(x = xp);
865	<	xpp = (xp = x.parent) == null ? null : xp.parent;
866	<	}
867	<	if (xp != null) {
868	<	xp.red = false;
869	<	if (xpp != null) {
870	<	xpp.red = true;
871	<	rotateLeft(xpp);
872	<	}
873	<	}
874	<	}
875	<	}
876	<	}
877	<	TreeNode r = root;
878	<	if (r != null && r.red)
879	<	r.red = false;
635	>	Node<K,V> find(int h, Object k) {
636	>	Node<K,V> e = this;
637	>	if (k != null) {
638	>	do {
639	>	K ek;
640	>	if (e.hash == h &&
641	>	((ek = e.key) == k || (ek != null && k.equals(ek))))
642	>	return e;
643	>	} while ((e = e.next) != null);
644		}
645		return null;
646		}
883	–
884	–	/**
885	–	* Removes the given node, that must be present before this
886	–	* call.  This is messier than typical red-black deletion code
887	–	* because we cannot swap the contents of an interior node
888	–	* with a leaf successor that is pinned by "next" pointers
889	–	* that are accessible independently of lock. So instead we
890	–	* swap the tree linkages.
891	–	*/
892	–	final void deleteTreeNode(TreeNode p) {
893	–	TreeNode next = (TreeNode)p.next; // unlink traversal pointers
894	–	TreeNode pred = p.prev;
895	–	if (pred == null)
896	–	first = next;
897	–	else
898	–	pred.next = next;
899	–	if (next != null)
900	–	next.prev = pred;
901	–	TreeNode replacement;
902	–	TreeNode pl = p.left;
903	–	TreeNode pr = p.right;
904	–	if (pl != null && pr != null) {
905	–	TreeNode s = pr, sl;
906	–	while ((sl = s.left) != null) // find successor
907	–	s = sl;
908	–	boolean c = s.red; s.red = p.red; p.red = c; // swap colors
909	–	TreeNode sr = s.right;
910	–	TreeNode pp = p.parent;
911	–	if (s == pr) { // p was s's direct parent
912	–	p.parent = s;
913	–	s.right = p;
914	–	}
915	–	else {
916	–	TreeNode sp = s.parent;
917	–	if ((p.parent = sp) != null) {
918	–	if (s == sp.left)
919	–	sp.left = p;
920	–	else
921	–	sp.right = p;
922	–	}
923	–	if ((s.right = pr) != null)
924	–	pr.parent = s;
925	–	}
926	–	p.left = null;
927	–	if ((p.right = sr) != null)
928	–	sr.parent = p;
929	–	if ((s.left = pl) != null)
930	–	pl.parent = s;
931	–	if ((s.parent = pp) == null)
932	–	root = s;
933	–	else if (p == pp.left)
934	–	pp.left = s;
935	–	else
936	–	pp.right = s;
937	–	replacement = sr;
938	–	}
939	–	else
940	–	replacement = (pl != null) ? pl : pr;
941	–	TreeNode pp = p.parent;
942	–	if (replacement == null) {
943	–	if (pp == null) {
944	–	root = null;
945	–	return;
946	–	}
947	–	replacement = p;
948	–	}
949	–	else {
950	–	replacement.parent = pp;
951	–	if (pp == null)
952	–	root = replacement;
953	–	else if (p == pp.left)
954	–	pp.left = replacement;
955	–	else
956	–	pp.right = replacement;
957	–	p.left = p.right = p.parent = null;
958	–	}
959	–	if (!p.red) { // rebalance, from CLR
960	–	TreeNode x = replacement;
961	–	while (x != null) {
962	–	TreeNode xp, xpl;
963	–	if (x.red || (xp = x.parent) == null) {
964	–	x.red = false;
965	–	break;
966	–	}
967	–	if (x == (xpl = xp.left)) {
968	–	TreeNode sib = xp.right;
969	–	if (sib != null && sib.red) {
970	–	sib.red = false;
971	–	xp.red = true;
972	–	rotateLeft(xp);
973	–	sib = (xp = x.parent) == null ? null : xp.right;
974	–	}
975	–	if (sib == null)
976	–	x = xp;
977	–	else {
978	–	TreeNode sl = sib.left, sr = sib.right;
979	–	if ((sr == null || !sr.red) &&
980	–	(sl == null || !sl.red)) {
981	–	sib.red = true;
982	–	x = xp;
983	–	}
984	–	else {
985	–	if (sr == null || !sr.red) {
986	–	if (sl != null)
987	–	sl.red = false;
988	–	sib.red = true;
989	–	rotateRight(sib);
990	–	sib = (xp = x.parent) == null ? null : xp.right;
991	–	}
992	–	if (sib != null) {
993	–	sib.red = (xp == null) ? false : xp.red;
994	–	if ((sr = sib.right) != null)
995	–	sr.red = false;
996	–	}
997	–	if (xp != null) {
998	–	xp.red = false;
999	–	rotateLeft(xp);
1000	–	}
1001	–	x = root;
1002	–	}
1003	–	}
1004	–	}
1005	–	else { // symmetric
1006	–	TreeNode sib = xpl;
1007	–	if (sib != null && sib.red) {
1008	–	sib.red = false;
1009	–	xp.red = true;
1010	–	rotateRight(xp);
1011	–	sib = (xp = x.parent) == null ? null : xp.left;
1012	–	}
1013	–	if (sib == null)
1014	–	x = xp;
1015	–	else {
1016	–	TreeNode sl = sib.left, sr = sib.right;
1017	–	if ((sl == null || !sl.red) &&
1018	–	(sr == null || !sr.red)) {
1019	–	sib.red = true;
1020	–	x = xp;
1021	–	}
1022	–	else {
1023	–	if (sl == null || !sl.red) {
1024	–	if (sr != null)
1025	–	sr.red = false;
1026	–	sib.red = true;
1027	–	rotateLeft(sib);
1028	–	sib = (xp = x.parent) == null ? null : xp.left;
1029	–	}
1030	–	if (sib != null) {
1031	–	sib.red = (xp == null) ? false : xp.red;
1032	–	if ((sl = sib.left) != null)
1033	–	sl.red = false;
1034	–	}
1035	–	if (xp != null) {
1036	–	xp.red = false;
1037	–	rotateRight(xp);
1038	–	}
1039	–	x = root;
1040	–	}
1041	–	}
1042	–	}
1043	–	}
1044	–	}
1045	–	if (p == replacement && (pp = p.parent) != null) {
1046	–	if (p == pp.left) // detach pointers
1047	–	pp.left = null;
1048	–	else if (p == pp.right)
1049	–	pp.right = null;
1050	–	p.parent = null;
1051	–	}
1052	–	}
647		}
648
649	<	/* ---------------- Collision reduction methods -------------- */
649	>	/* ---------------- Static utilities -------------- */
650
651		/**
652	<	* Spreads higher bits to lower, and also forces top 2 bits to 0.
653	<	* Because the table uses power-of-two masking, sets of hashes
654	<	* that vary only in bits above the current mask will always
655	<	* collide. (Among known examples are sets of Float keys holding
656	<	* consecutive whole numbers in small tables.)  To counter this,
657	<	* we apply a transform that spreads the impact of higher bits
652	>	* Spreads (XORs) higher bits of hash to lower and also forces top
653	>	* bit to 0. Because the table uses power-of-two masking, sets of
654	>	* hashes that vary only in bits above the current mask will
655	>	* always collide. (Among known examples are sets of Float keys
656	>	* holding consecutive whole numbers in small tables.)  So we
657	>	* apply a transform that spreads the impact of higher bits
658		* downward. There is a tradeoff between speed, utility, and
659		* quality of bit-spreading. Because many common sets of hashes
660	<	* are already reasonably distributed across bits (so don't benefit
661	<	* from spreading), and because we use trees to handle large sets
662	<	* of collisions in bins, we don't need excessively high quality.
660	>	* are already reasonably distributed (so don't benefit from
661	>	* spreading), and because we use trees to handle large sets of
662	>	* collisions in bins, we just XOR some shifted bits in the
663	>	* cheapest possible way to reduce systematic lossage, as well as
664	>	* to incorporate impact of the highest bits that would otherwise
665	>	* never be used in index calculations because of table bounds.
666		*/
667	<	private static final int spread(int h) {
668	<	h ^= (h >>> 18) ^ (h >>> 12);
1072	<	return (h ^ (h >>> 10)) & HASH_BITS;
667	>	static final int spread(int h) {
668	>	return (h ^ (h >>> 16)) & HASH_BITS;
669		}
670
671		/**
672	<	* Replaces a list bin with a tree bin. Call only when locked.
673	<	* Fails to replace if the given key is non-comparable or table
1078	<	* is, or needs, resizing.
672	>	* Returns a power of two table size for the given desired capacity.
673	>	* See Hackers Delight, sec 3.2
674		*/
675	<	private final void replaceWithTreeBin(Node[] tab, int index, Object key) {
676	<	if ((key instanceof Comparable) &&
677	<	(tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) {
1083	<	TreeBin t = new TreeBin();
1084	<	for (Node e = tabAt(tab, index); e != null; e = e.next)
1085	<	t.putTreeNode(e.hash & HASH_BITS, e.key, e.val);
1086	<	setTabAt(tab, index, new Node(MOVED, t, null, null));
1087	<	}
1088	<	}
1089	<
1090	<	/* ---------------- Internal access and update methods -------------- */
1091	<
1092	<	/** Implementation for get and containsKey */
1093	<	private final Object internalGet(Object k) {
1094	<	int h = spread(k.hashCode());
1095	<	retry: for (Node[] tab = table; tab != null;) {
1096	<	Node e, p; Object ek, ev; int eh;      // locals to read fields once
1097	<	for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) {
1098	<	if ((eh = e.hash) == MOVED) {
1099	<	if ((ek = e.key) instanceof TreeBin)  // search TreeBin
1100	<	return ((TreeBin)ek).getValue(h, k);
1101	<	else {                        // restart with new table
1102	<	tab = (Node[])ek;
1103	<	continue retry;
1104	<	}
1105	<	}
1106	<	else if ((eh & HASH_BITS) == h && (ev = e.val) != null &&
1107	<	((ek = e.key) == k || k.equals(ek)))
1108	<	return ev;
1109	<	}
1110	<	break;
1111	<	}
1112	<	return null;
675	>	private static final int tableSizeFor(int c) {
676	>	int n = -1 >>> Integer.numberOfLeadingZeros(c - 1);
677	>	return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
678		}
679
680		/**
681	<	* Implementation for the four public remove/replace methods:
682	<	* Replaces node value with v, conditional upon match of cv if
1118	<	* non-null.  If resulting value is null, delete.
681	>	* Returns x's Class if it is of the form "class C implements
682	>	* Comparable<C>", else null.
683		*/
684	<	private final Object internalReplace(Object k, Object v, Object cv) {
685	<	int h = spread(k.hashCode());
686	<	Object oldVal = null;
687	<	for (Node[] tab = table;;) {
688	<	Node f; int i, fh; Object fk;
689	<	if (tab == null ||
690	<	(f = tabAt(tab, i = (tab.length - 1) & h)) == null)
691	<	break;
692	<	else if ((fh = f.hash) == MOVED) {
693	<	if ((fk = f.key) instanceof TreeBin) {
694	<	TreeBin t = (TreeBin)fk;
695	<	boolean validated = false;
696	<	boolean deleted = false;
1133	<	t.acquire(0);
1134	<	try {
1135	<	if (tabAt(tab, i) == f) {
1136	<	validated = true;
1137	<	TreeNode p = t.getTreeNode(h, k, t.root);
1138	<	if (p != null) {
1139	<	Object pv = p.val;
1140	<	if (cv == null || cv == pv || cv.equals(pv)) {
1141	<	oldVal = pv;
1142	<	if ((p.val = v) == null) {
1143	<	deleted = true;
1144	<	t.deleteTreeNode(p);
1145	<	}
1146	<	}
1147	<	}
1148	<	}
1149	<	} finally {
1150	<	t.release(0);
1151	<	}
1152	<	if (validated) {
1153	<	if (deleted)
1154	<	counter.add(-1L);
1155	<	break;
1156	<	}
1157	<	}
1158	<	else
1159	<	tab = (Node[])fk;
1160	<	}
1161	<	else if ((fh & HASH_BITS) != h && f.next == null) // precheck
1162	<	break;                          // rules out possible existence
1163	<	else if ((fh & LOCKED) != 0) {
1164	<	checkForResize();               // try resizing if can't get lock
1165	<	f.tryAwaitLock(tab, i);
1166	<	}
1167	<	else if (f.casHash(fh, fh | LOCKED)) {
1168	<	boolean validated = false;
1169	<	boolean deleted = false;
1170	<	try {
1171	<	if (tabAt(tab, i) == f) {
1172	<	validated = true;
1173	<	for (Node e = f, pred = null;;) {
1174	<	Object ek, ev;
1175	<	if ((e.hash & HASH_BITS) == h &&
1176	<	((ev = e.val) != null) &&
1177	<	((ek = e.key) == k || k.equals(ek))) {
1178	<	if (cv == null || cv == ev || cv.equals(ev)) {
1179	<	oldVal = ev;
1180	<	if ((e.val = v) == null) {
1181	<	deleted = true;
1182	<	Node en = e.next;
1183	<	if (pred != null)
1184	<	pred.next = en;
1185	<	else
1186	<	setTabAt(tab, i, en);
1187	<	}
1188	<	}
1189	<	break;
1190	<	}
1191	<	pred = e;
1192	<	if ((e = e.next) == null)
1193	<	break;
1194	<	}
1195	<	}
1196	<	} finally {
1197	<	if (!f.casHash(fh | LOCKED, fh)) {
1198	<	f.hash = fh;
1199	<	synchronized (f) { f.notifyAll(); };
1200	<	}
1201	<	}
1202	<	if (validated) {
1203	<	if (deleted)
1204	<	counter.add(-1L);
1205	<	break;
1206	<	}
1207	<	}
1208	<	}
1209	<	return oldVal;
1210	<	}
1211	<
1212	<	/*
1213	<	* Internal versions of the six insertion methods, each a
1214	<	* little more complicated than the last. All have
1215	<	* the same basic structure as the first (internalPut):
1216	<	*  1. If table uninitialized, create
1217	<	*  2. If bin empty, try to CAS new node
1218	<	*  3. If bin stale, use new table
1219	<	*  4. if bin converted to TreeBin, validate and relay to TreeBin methods
1220	<	*  5. Lock and validate; if valid, scan and add or update
1221	<	*
1222	<	* The others interweave other checks and/or alternative actions:
1223	<	*  * Plain put checks for and performs resize after insertion.
1224	<	*  * putIfAbsent prescans for mapping without lock (and fails to add
1225	<	*    if present), which also makes pre-emptive resize checks worthwhile.
1226	<	*  * computeIfAbsent extends form used in putIfAbsent with additional
1227	<	*    mechanics to deal with, calls, potential exceptions and null
1228	<	*    returns from function call.
1229	<	*  * compute uses the same function-call mechanics, but without
1230	<	*    the prescans
1231	<	*  * merge acts as putIfAbsent in the absent case, but invokes the
1232	<	*    update function if present
1233	<	*  * putAll attempts to pre-allocate enough table space
1234	<	*    and more lazily performs count updates and checks.
1235	<	*
1236	<	* Someday when details settle down a bit more, it might be worth
1237	<	* some factoring to reduce sprawl.
1238	<	*/
1239	<
1240	<	/** Implementation for put */
1241	<	private final Object internalPut(Object k, Object v) {
1242	<	int h = spread(k.hashCode());
1243	<	int count = 0;
1244	<	for (Node[] tab = table;;) {
1245	<	int i; Node f; int fh; Object fk;
1246	<	if (tab == null)
1247	<	tab = initTable();
1248	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1249	<	if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1250	<	break;                   // no lock when adding to empty bin
1251	<	}
1252	<	else if ((fh = f.hash) == MOVED) {
1253	<	if ((fk = f.key) instanceof TreeBin) {
1254	<	TreeBin t = (TreeBin)fk;
1255	<	Object oldVal = null;
1256	<	t.acquire(0);
1257	<	try {
1258	<	if (tabAt(tab, i) == f) {
1259	<	count = 2;
1260	<	TreeNode p = t.putTreeNode(h, k, v);
1261	<	if (p != null) {
1262	<	oldVal = p.val;
1263	<	p.val = v;
1264	<	}
1265	<	}
1266	<	} finally {
1267	<	t.release(0);
1268	<	}
1269	<	if (count != 0) {
1270	<	if (oldVal != null)
1271	<	return oldVal;
1272	<	break;
1273	<	}
1274	<	}
1275	<	else
1276	<	tab = (Node[])fk;
1277	<	}
1278	<	else if ((fh & LOCKED) != 0) {
1279	<	checkForResize();
1280	<	f.tryAwaitLock(tab, i);
1281	<	}
1282	<	else if (f.casHash(fh, fh | LOCKED)) {
1283	<	Object oldVal = null;
1284	<	try {                        // needed in case equals() throws
1285	<	if (tabAt(tab, i) == f) {
1286	<	count = 1;
1287	<	for (Node e = f;; ++count) {
1288	<	Object ek, ev;
1289	<	if ((e.hash & HASH_BITS) == h &&
1290	<	(ev = e.val) != null &&
1291	<	((ek = e.key) == k || k.equals(ek))) {
1292	<	oldVal = ev;
1293	<	e.val = v;
1294	<	break;
1295	<	}
1296	<	Node last = e;
1297	<	if ((e = e.next) == null) {
1298	<	last.next = new Node(h, k, v, null);
1299	<	if (count >= TREE_THRESHOLD)
1300	<	replaceWithTreeBin(tab, i, k);
1301	<	break;
1302	<	}
1303	<	}
1304	<	}
1305	<	} finally {                  // unlock and signal if needed
1306	<	if (!f.casHash(fh | LOCKED, fh)) {
1307	<	f.hash = fh;
1308	<	synchronized (f) { f.notifyAll(); };
1309	<	}
1310	<	}
1311	<	if (count != 0) {
1312	<	if (oldVal != null)
1313	<	return oldVal;
1314	<	if (tab.length <= 64)
1315	<	count = 2;
1316	<	break;
684	>	static Class<?> comparableClassFor(Object x) {
685	>	if (x instanceof Comparable) {
686	>	Class<?> c; Type[] ts, as; ParameterizedType p;
687	>	if ((c = x.getClass()) == String.class) // bypass checks
688	>	return c;
689	>	if ((ts = c.getGenericInterfaces()) != null) {
690	>	for (Type t : ts) {
691	>	if ((t instanceof ParameterizedType) &&
692	>	((p = (ParameterizedType)t).getRawType() ==
693	>	Comparable.class) &&
694	>	(as = p.getActualTypeArguments()) != null &&
695	>	as.length == 1 && as[0] == c) // type arg is c
696	>	return c;
697		}
698		}
699		}
1320	–	counter.add(1L);
1321	–	if (count > 1)
1322	–	checkForResize();
700		return null;
701		}
702
703	<	/** Implementation for putIfAbsent */
704	<	private final Object internalPutIfAbsent(Object k, Object v) {
705	<	int h = spread(k.hashCode());
706	<	int count = 0;
707	<	for (Node[] tab = table;;) {
708	<	int i; Node f; int fh; Object fk, fv;
709	<	if (tab == null)
710	<	tab = initTable();
1334	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1335	<	if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1336	<	break;
1337	<	}
1338	<	else if ((fh = f.hash) == MOVED) {
1339	<	if ((fk = f.key) instanceof TreeBin) {
1340	<	TreeBin t = (TreeBin)fk;
1341	<	Object oldVal = null;
1342	<	t.acquire(0);
1343	<	try {
1344	<	if (tabAt(tab, i) == f) {
1345	<	count = 2;
1346	<	TreeNode p = t.putTreeNode(h, k, v);
1347	<	if (p != null)
1348	<	oldVal = p.val;
1349	<	}
1350	<	} finally {
1351	<	t.release(0);
1352	<	}
1353	<	if (count != 0) {
1354	<	if (oldVal != null)
1355	<	return oldVal;
1356	<	break;
1357	<	}
1358	<	}
1359	<	else
1360	<	tab = (Node[])fk;
1361	<	}
1362	<	else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1363	<	((fk = f.key) == k || k.equals(fk)))
1364	<	return fv;
1365	<	else {
1366	<	Node g = f.next;
1367	<	if (g != null) { // at least 2 nodes -- search and maybe resize
1368	<	for (Node e = g;;) {
1369	<	Object ek, ev;
1370	<	if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1371	<	((ek = e.key) == k || k.equals(ek)))
1372	<	return ev;
1373	<	if ((e = e.next) == null) {
1374	<	checkForResize();
1375	<	break;
1376	<	}
1377	<	}
1378	<	}
1379	<	if (((fh = f.hash) & LOCKED) != 0) {
1380	<	checkForResize();
1381	<	f.tryAwaitLock(tab, i);
1382	<	}
1383	<	else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1384	<	Object oldVal = null;
1385	<	try {
1386	<	if (tabAt(tab, i) == f) {
1387	<	count = 1;
1388	<	for (Node e = f;; ++count) {
1389	<	Object ek, ev;
1390	<	if ((e.hash & HASH_BITS) == h &&
1391	<	(ev = e.val) != null &&
1392	<	((ek = e.key) == k || k.equals(ek))) {
1393	<	oldVal = ev;
1394	<	break;
1395	<	}
1396	<	Node last = e;
1397	<	if ((e = e.next) == null) {
1398	<	last.next = new Node(h, k, v, null);
1399	<	if (count >= TREE_THRESHOLD)
1400	<	replaceWithTreeBin(tab, i, k);
1401	<	break;
1402	<	}
1403	<	}
1404	<	}
1405	<	} finally {
1406	<	if (!f.casHash(fh | LOCKED, fh)) {
1407	<	f.hash = fh;
1408	<	synchronized (f) { f.notifyAll(); };
1409	<	}
1410	<	}
1411	<	if (count != 0) {
1412	<	if (oldVal != null)
1413	<	return oldVal;
1414	<	if (tab.length <= 64)
1415	<	count = 2;
1416	<	break;
1417	<	}
1418	<	}
1419	<	}
1420	<	}
1421	<	counter.add(1L);
1422	<	if (count > 1)
1423	<	checkForResize();
1424	<	return null;
1425	<	}
1426	<
1427	<	/** Implementation for computeIfAbsent */
1428	<	private final Object internalComputeIfAbsent(K k,
1429	<	Fun<? super K, ?> mf) {
1430	<	int h = spread(k.hashCode());
1431	<	Object val = null;
1432	<	int count = 0;
1433	<	for (Node[] tab = table;;) {
1434	<	Node f; int i, fh; Object fk, fv;
1435	<	if (tab == null)
1436	<	tab = initTable();
1437	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1438	<	Node node = new Node(fh = h | LOCKED, k, null, null);
1439	<	if (casTabAt(tab, i, null, node)) {
1440	<	count = 1;
1441	<	try {
1442	<	if ((val = mf.apply(k)) != null)
1443	<	node.val = val;
1444	<	} finally {
1445	<	if (val == null)
1446	<	setTabAt(tab, i, null);
1447	<	if (!node.casHash(fh, h)) {
1448	<	node.hash = h;
1449	<	synchronized (node) { node.notifyAll(); };
1450	<	}
1451	<	}
1452	<	}
1453	<	if (count != 0)
1454	<	break;
1455	<	}
1456	<	else if ((fh = f.hash) == MOVED) {
1457	<	if ((fk = f.key) instanceof TreeBin) {
1458	<	TreeBin t = (TreeBin)fk;
1459	<	boolean added = false;
1460	<	t.acquire(0);
1461	<	try {
1462	<	if (tabAt(tab, i) == f) {
1463	<	count = 1;
1464	<	TreeNode p = t.getTreeNode(h, k, t.root);
1465	<	if (p != null)
1466	<	val = p.val;
1467	<	else if ((val = mf.apply(k)) != null) {
1468	<	added = true;
1469	<	count = 2;
1470	<	t.putTreeNode(h, k, val);
1471	<	}
1472	<	}
1473	<	} finally {
1474	<	t.release(0);
1475	<	}
1476	<	if (count != 0) {
1477	<	if (!added)
1478	<	return val;
1479	<	break;
1480	<	}
1481	<	}
1482	<	else
1483	<	tab = (Node[])fk;
1484	<	}
1485	<	else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1486	<	((fk = f.key) == k || k.equals(fk)))
1487	<	return fv;
1488	<	else {
1489	<	Node g = f.next;
1490	<	if (g != null) {
1491	<	for (Node e = g;;) {
1492	<	Object ek, ev;
1493	<	if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1494	<	((ek = e.key) == k || k.equals(ek)))
1495	<	return ev;
1496	<	if ((e = e.next) == null) {
1497	<	checkForResize();
1498	<	break;
1499	<	}
1500	<	}
1501	<	}
1502	<	if (((fh = f.hash) & LOCKED) != 0) {
1503	<	checkForResize();
1504	<	f.tryAwaitLock(tab, i);
1505	<	}
1506	<	else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1507	<	boolean added = false;
1508	<	try {
1509	<	if (tabAt(tab, i) == f) {
1510	<	count = 1;
1511	<	for (Node e = f;; ++count) {
1512	<	Object ek, ev;
1513	<	if ((e.hash & HASH_BITS) == h &&
1514	<	(ev = e.val) != null &&
1515	<	((ek = e.key) == k || k.equals(ek))) {
1516	<	val = ev;
1517	<	break;
1518	<	}
1519	<	Node last = e;
1520	<	if ((e = e.next) == null) {
1521	<	if ((val = mf.apply(k)) != null) {
1522	<	added = true;
1523	<	last.next = new Node(h, k, val, null);
1524	<	if (count >= TREE_THRESHOLD)
1525	<	replaceWithTreeBin(tab, i, k);
1526	<	}
1527	<	break;
1528	<	}
1529	<	}
1530	<	}
1531	<	} finally {
1532	<	if (!f.casHash(fh | LOCKED, fh)) {
1533	<	f.hash = fh;
1534	<	synchronized (f) { f.notifyAll(); };
1535	<	}
1536	<	}
1537	<	if (count != 0) {
1538	<	if (!added)
1539	<	return val;
1540	<	if (tab.length <= 64)
1541	<	count = 2;
1542	<	break;
1543	<	}
1544	<	}
1545	<	}
1546	<	}
1547	<	if (val != null) {
1548	<	counter.add(1L);
1549	<	if (count > 1)
1550	<	checkForResize();
1551	<	}
1552	<	return val;
703	>	/**
704	>	* Returns k.compareTo(x) if x matches kc (k's screened comparable
705	>	* class), else 0.
706	>	*/
707	>	@SuppressWarnings({"rawtypes","unchecked"}) // for cast to Comparable
708	>	static int compareComparables(Class<?> kc, Object k, Object x) {
709	>	return (x == null || x.getClass() != kc ? 0 :
710	>	((Comparable)k).compareTo(x));
711		}
712
713	<	/** Implementation for compute */
1556	<	@SuppressWarnings("unchecked") private final Object internalCompute
1557	<	(K k, boolean onlyIfPresent, BiFun<? super K, ? super V, ? extends V> mf) {
1558	<	int h = spread(k.hashCode());
1559	<	Object val = null;
1560	<	int delta = 0;
1561	<	int count = 0;
1562	<	for (Node[] tab = table;;) {
1563	<	Node f; int i, fh; Object fk;
1564	<	if (tab == null)
1565	<	tab = initTable();
1566	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1567	<	if (onlyIfPresent)
1568	<	break;
1569	<	Node node = new Node(fh = h | LOCKED, k, null, null);
1570	<	if (casTabAt(tab, i, null, node)) {
1571	<	try {
1572	<	count = 1;
1573	<	if ((val = mf.apply(k, null)) != null) {
1574	<	node.val = val;
1575	<	delta = 1;
1576	<	}
1577	<	} finally {
1578	<	if (delta == 0)
1579	<	setTabAt(tab, i, null);
1580	<	if (!node.casHash(fh, h)) {
1581	<	node.hash = h;
1582	<	synchronized (node) { node.notifyAll(); };
1583	<	}
1584	<	}
1585	<	}
1586	<	if (count != 0)
1587	<	break;
1588	<	}
1589	<	else if ((fh = f.hash) == MOVED) {
1590	<	if ((fk = f.key) instanceof TreeBin) {
1591	<	TreeBin t = (TreeBin)fk;
1592	<	t.acquire(0);
1593	<	try {
1594	<	if (tabAt(tab, i) == f) {
1595	<	count = 1;
1596	<	TreeNode p = t.getTreeNode(h, k, t.root);
1597	<	Object pv = (p == null) ? null : p.val;
1598	<	if ((val = mf.apply(k, (V)pv)) != null) {
1599	<	if (p != null)
1600	<	p.val = val;
1601	<	else {
1602	<	count = 2;
1603	<	delta = 1;
1604	<	t.putTreeNode(h, k, val);
1605	<	}
1606	<	}
1607	<	else if (p != null) {
1608	<	delta = -1;
1609	<	t.deleteTreeNode(p);
1610	<	}
1611	<	}
1612	<	} finally {
1613	<	t.release(0);
1614	<	}
1615	<	if (count != 0)
1616	<	break;
1617	<	}
1618	<	else
1619	<	tab = (Node[])fk;
1620	<	}
1621	<	else if ((fh & LOCKED) != 0) {
1622	<	checkForResize();
1623	<	f.tryAwaitLock(tab, i);
1624	<	}
1625	<	else if (f.casHash(fh, fh | LOCKED)) {
1626	<	try {
1627	<	if (tabAt(tab, i) == f) {
1628	<	count = 1;
1629	<	for (Node e = f, pred = null;; ++count) {
1630	<	Object ek, ev;
1631	<	if ((e.hash & HASH_BITS) == h &&
1632	<	(ev = e.val) != null &&
1633	<	((ek = e.key) == k || k.equals(ek))) {
1634	<	val = mf.apply(k, (V)ev);
1635	<	if (val != null)
1636	<	e.val = val;
1637	<	else {
1638	<	delta = -1;
1639	<	Node en = e.next;
1640	<	if (pred != null)
1641	<	pred.next = en;
1642	<	else
1643	<	setTabAt(tab, i, en);
1644	<	}
1645	<	break;
1646	<	}
1647	<	pred = e;
1648	<	if ((e = e.next) == null) {
1649	<	if (!onlyIfPresent && (val = mf.apply(k, null)) != null) {
1650	<	pred.next = new Node(h, k, val, null);
1651	<	delta = 1;
1652	<	if (count >= TREE_THRESHOLD)
1653	<	replaceWithTreeBin(tab, i, k);
1654	<	}
1655	<	break;
1656	<	}
1657	<	}
1658	<	}
1659	<	} finally {
1660	<	if (!f.casHash(fh | LOCKED, fh)) {
1661	<	f.hash = fh;
1662	<	synchronized (f) { f.notifyAll(); };
1663	<	}
1664	<	}
1665	<	if (count != 0) {
1666	<	if (tab.length <= 64)
1667	<	count = 2;
1668	<	break;
1669	<	}
1670	<	}
1671	<	}
1672	<	if (delta != 0) {
1673	<	counter.add((long)delta);
1674	<	if (count > 1)
1675	<	checkForResize();
1676	<	}
1677	<	return val;
1678	<	}
713	>	/* ---------------- Table element access -------------- */
714
715	<	/** Implementation for merge */
716	<	@SuppressWarnings("unchecked") private final Object internalMerge
717	<	(K k, V v, BiFun<? super V, ? super V, ? extends V> mf) {
718	<	int h = spread(k.hashCode());
719	<	Object val = null;
720	<	int delta = 0;
721	<	int count = 0;
722	<	for (Node[] tab = table;;) {
723	<	int i; Node f; int fh; Object fk, fv;
724	<	if (tab == null)
725	<	tab = initTable();
726	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
727	<	if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
728	<	delta = 1;
729	<	val = v;
730	<	break;
731	<	}
732	<	}
733	<	else if ((fh = f.hash) == MOVED) {
734	<	if ((fk = f.key) instanceof TreeBin) {
735	<	TreeBin t = (TreeBin)fk;
736	<	t.acquire(0);
1702	<	try {
1703	<	if (tabAt(tab, i) == f) {
1704	<	count = 1;
1705	<	TreeNode p = t.getTreeNode(h, k, t.root);
1706	<	val = (p == null) ? v : mf.apply((V)p.val, v);
1707	<	if (val != null) {
1708	<	if (p != null)
1709	<	p.val = val;
1710	<	else {
1711	<	count = 2;
1712	<	delta = 1;
1713	<	t.putTreeNode(h, k, val);
1714	<	}
1715	<	}
1716	<	else if (p != null) {
1717	<	delta = -1;
1718	<	t.deleteTreeNode(p);
1719	<	}
1720	<	}
1721	<	} finally {
1722	<	t.release(0);
1723	<	}
1724	<	if (count != 0)
1725	<	break;
1726	<	}
1727	<	else
1728	<	tab = (Node[])fk;
1729	<	}
1730	<	else if ((fh & LOCKED) != 0) {
1731	<	checkForResize();
1732	<	f.tryAwaitLock(tab, i);
1733	<	}
1734	<	else if (f.casHash(fh, fh | LOCKED)) {
1735	<	try {
1736	<	if (tabAt(tab, i) == f) {
1737	<	count = 1;
1738	<	for (Node e = f, pred = null;; ++count) {
1739	<	Object ek, ev;
1740	<	if ((e.hash & HASH_BITS) == h &&
1741	<	(ev = e.val) != null &&
1742	<	((ek = e.key) == k || k.equals(ek))) {
1743	<	val = mf.apply(v, (V)ev);
1744	<	if (val != null)
1745	<	e.val = val;
1746	<	else {
1747	<	delta = -1;
1748	<	Node en = e.next;
1749	<	if (pred != null)
1750	<	pred.next = en;
1751	<	else
1752	<	setTabAt(tab, i, en);
1753	<	}
1754	<	break;
1755	<	}
1756	<	pred = e;
1757	<	if ((e = e.next) == null) {
1758	<	val = v;
1759	<	pred.next = new Node(h, k, val, null);
1760	<	delta = 1;
1761	<	if (count >= TREE_THRESHOLD)
1762	<	replaceWithTreeBin(tab, i, k);
1763	<	break;
1764	<	}
1765	<	}
1766	<	}
1767	<	} finally {
1768	<	if (!f.casHash(fh | LOCKED, fh)) {
1769	<	f.hash = fh;
1770	<	synchronized (f) { f.notifyAll(); };
1771	<	}
1772	<	}
1773	<	if (count != 0) {
1774	<	if (tab.length <= 64)
1775	<	count = 2;
1776	<	break;
1777	<	}
1778	<	}
1779	<	}
1780	<	if (delta != 0) {
1781	<	counter.add((long)delta);
1782	<	if (count > 1)
1783	<	checkForResize();
1784	<	}
1785	<	return val;
715	>	/*
716	>	* Atomic access methods are used for table elements as well as
717	>	* elements of in-progress next table while resizing.  All uses of
718	>	* the tab arguments must be null checked by callers.  All callers
719	>	* also paranoically precheck that tab's length is not zero (or an
720	>	* equivalent check), thus ensuring that any index argument taking
721	>	* the form of a hash value anded with (length - 1) is a valid
722	>	* index.  Note that, to be correct wrt arbitrary concurrency
723	>	* errors by users, these checks must operate on local variables,
724	>	* which accounts for some odd-looking inline assignments below.
725	>	* Note that calls to setTabAt always occur within locked regions,
726	>	* and so require only release ordering.
727	>	*/
728	>
729	>	@SuppressWarnings("unchecked")
730	>	static final <K,V> Node<K,V> tabAt(Node<K,V>[] tab, int i) {
731	>	return (Node<K,V>)U.getObjectAcquire(tab, ((long)i << ASHIFT) + ABASE);
732	>	}
733	>
734	>	static final <K,V> boolean casTabAt(Node<K,V>[] tab, int i,
735	>	Node<K,V> c, Node<K,V> v) {
736	>	return U.compareAndSetObject(tab, ((long)i << ASHIFT) + ABASE, c, v);
737		}
738
739	<	/** Implementation for putAll */
740	<	private final void internalPutAll(Map<?, ?> m) {
1790	<	tryPresize(m.size());
1791	<	long delta = 0L;     // number of uncommitted additions
1792	<	boolean npe = false; // to throw exception on exit for nulls
1793	<	try {                // to clean up counts on other exceptions
1794	<	for (Map.Entry<?, ?> entry : m.entrySet()) {
1795	<	Object k, v;
1796	<	if (entry == null || (k = entry.getKey()) == null ||
1797	<	(v = entry.getValue()) == null) {
1798	<	npe = true;
1799	<	break;
1800	<	}
1801	<	int h = spread(k.hashCode());
1802	<	for (Node[] tab = table;;) {
1803	<	int i; Node f; int fh; Object fk;
1804	<	if (tab == null)
1805	<	tab = initTable();
1806	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){
1807	<	if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
1808	<	++delta;
1809	<	break;
1810	<	}
1811	<	}
1812	<	else if ((fh = f.hash) == MOVED) {
1813	<	if ((fk = f.key) instanceof TreeBin) {
1814	<	TreeBin t = (TreeBin)fk;
1815	<	boolean validated = false;
1816	<	t.acquire(0);
1817	<	try {
1818	<	if (tabAt(tab, i) == f) {
1819	<	validated = true;
1820	<	TreeNode p = t.getTreeNode(h, k, t.root);
1821	<	if (p != null)
1822	<	p.val = v;
1823	<	else {
1824	<	t.putTreeNode(h, k, v);
1825	<	++delta;
1826	<	}
1827	<	}
1828	<	} finally {
1829	<	t.release(0);
1830	<	}
1831	<	if (validated)
1832	<	break;
1833	<	}
1834	<	else
1835	<	tab = (Node[])fk;
1836	<	}
1837	<	else if ((fh & LOCKED) != 0) {
1838	<	counter.add(delta);
1839	<	delta = 0L;
1840	<	checkForResize();
1841	<	f.tryAwaitLock(tab, i);
1842	<	}
1843	<	else if (f.casHash(fh, fh | LOCKED)) {
1844	<	int count = 0;
1845	<	try {
1846	<	if (tabAt(tab, i) == f) {
1847	<	count = 1;
1848	<	for (Node e = f;; ++count) {
1849	<	Object ek, ev;
1850	<	if ((e.hash & HASH_BITS) == h &&
1851	<	(ev = e.val) != null &&
1852	<	((ek = e.key) == k || k.equals(ek))) {
1853	<	e.val = v;
1854	<	break;
1855	<	}
1856	<	Node last = e;
1857	<	if ((e = e.next) == null) {
1858	<	++delta;
1859	<	last.next = new Node(h, k, v, null);
1860	<	if (count >= TREE_THRESHOLD)
1861	<	replaceWithTreeBin(tab, i, k);
1862	<	break;
1863	<	}
1864	<	}
1865	<	}
1866	<	} finally {
1867	<	if (!f.casHash(fh | LOCKED, fh)) {
1868	<	f.hash = fh;
1869	<	synchronized (f) { f.notifyAll(); };
1870	<	}
1871	<	}
1872	<	if (count != 0) {
1873	<	if (count > 1) {
1874	<	counter.add(delta);
1875	<	delta = 0L;
1876	<	checkForResize();
1877	<	}
1878	<	break;
1879	<	}
1880	<	}
1881	<	}
1882	<	}
1883	<	} finally {
1884	<	if (delta != 0)
1885	<	counter.add(delta);
1886	<	}
1887	<	if (npe)
1888	<	throw new NullPointerException();
739	>	static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) {
740	>	U.putObjectRelease(tab, ((long)i << ASHIFT) + ABASE, v);
741		}
742
743	<	/* ---------------- Table Initialization and Resizing -------------- */
743	>	/* ---------------- Fields -------------- */
744
745		/**
746	<	* Returns a power of two table size for the given desired capacity.
747	<	* See Hackers Delight, sec 3.2
746	>	* The array of bins. Lazily initialized upon first insertion.
747	>	* Size is always a power of two. Accessed directly by iterators.
748		*/
749	<	private static final int tableSizeFor(int c) {
1898	<	int n = c - 1;
1899	<	n |= n >>> 1;
1900	<	n |= n >>> 2;
1901	<	n |= n >>> 4;
1902	<	n |= n >>> 8;
1903	<	n |= n >>> 16;
1904	<	return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
1905	<	}
749	>	transient volatile Node<K,V>[] table;
750
751		/**
752	<	* Initializes table, using the size recorded in sizeCtl.
752	>	* The next table to use; non-null only while resizing.
753		*/
754	<	private final Node[] initTable() {
1911	<	Node[] tab; int sc;
1912	<	while ((tab = table) == null) {
1913	<	if ((sc = sizeCtl) < 0)
1914	<	Thread.yield(); // lost initialization race; just spin
1915	<	else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1916	<	try {
1917	<	if ((tab = table) == null) {
1918	<	int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
1919	<	tab = table = new Node[n];
1920	<	sc = n - (n >>> 2);
1921	<	}
1922	<	} finally {
1923	<	sizeCtl = sc;
1924	<	}
1925	<	break;
1926	<	}
1927	<	}
1928	<	return tab;
1929	<	}
754	>	private transient volatile Node<K,V>[] nextTable;
755
756		/**
757	<	* If table is too small and not already resizing, creates next
758	<	* table and transfers bins.  Rechecks occupancy after a transfer
759	<	* to see if another resize is already needed because resizings
1935	<	* are lagging additions.
1936	<	*/
1937	<	private final void checkForResize() {
1938	<	Node[] tab; int n, sc;
1939	<	while ((tab = table) != null &&
1940	<	(n = tab.length) < MAXIMUM_CAPACITY &&
1941	<	(sc = sizeCtl) >= 0 && counter.sum() >= (long)sc &&
1942	<	UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1943	<	try {
1944	<	if (tab == table) {
1945	<	table = rebuild(tab);
1946	<	sc = (n << 1) - (n >>> 1);
1947	<	}
1948	<	} finally {
1949	<	sizeCtl = sc;
1950	<	}
1951	<	}
1952	<	}
1953	<
1954	<	/**
1955	<	* Tries to presize table to accommodate the given number of elements.
1956	<	*
1957	<	* @param size number of elements (doesn't need to be perfectly accurate)
757	>	* Base counter value, used mainly when there is no contention,
758	>	* but also as a fallback during table initialization
759	>	* races. Updated via CAS.
760		*/
761	<	private final void tryPresize(int size) {
1960	<	int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
1961	<	tableSizeFor(size + (size >>> 1) + 1);
1962	<	int sc;
1963	<	while ((sc = sizeCtl) >= 0) {
1964	<	Node[] tab = table; int n;
1965	<	if (tab == null || (n = tab.length) == 0) {
1966	<	n = (sc > c) ? sc : c;
1967	<	if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1968	<	try {
1969	<	if (table == tab) {
1970	<	table = new Node[n];
1971	<	sc = n - (n >>> 2);
1972	<	}
1973	<	} finally {
1974	<	sizeCtl = sc;
1975	<	}
1976	<	}
1977	<	}
1978	<	else if (c <= sc || n >= MAXIMUM_CAPACITY)
1979	<	break;
1980	<	else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1981	<	try {
1982	<	if (table == tab) {
1983	<	table = rebuild(tab);
1984	<	sc = (n << 1) - (n >>> 1);
1985	<	}
1986	<	} finally {
1987	<	sizeCtl = sc;
1988	<	}
1989	<	}
1990	<	}
1991	<	}
1992	<
1993	<	/*
1994	<	* Moves and/or copies the nodes in each bin to new table. See
1995	<	* above for explanation.
1996	<	*
1997	<	* @return the new table
1998	<	*/
1999	<	private static final Node[] rebuild(Node[] tab) {
2000	<	int n = tab.length;
2001	<	Node[] nextTab = new Node[n << 1];
2002	<	Node fwd = new Node(MOVED, nextTab, null, null);
2003	<	int[] buffer = null;       // holds bins to revisit; null until needed
2004	<	Node rev = null;           // reverse forwarder; null until needed
2005	<	int nbuffered = 0;         // the number of bins in buffer list
2006	<	int bufferIndex = 0;       // buffer index of current buffered bin
2007	<	int bin = n - 1;           // current non-buffered bin or -1 if none
2008	<
2009	<	for (int i = bin;;) {      // start upwards sweep
2010	<	int fh; Node f;
2011	<	if ((f = tabAt(tab, i)) == null) {
2012	<	if (bin >= 0) {    // Unbuffered; no lock needed (or available)
2013	<	if (!casTabAt(tab, i, f, fwd))
2014	<	continue;
2015	<	}
2016	<	else {             // transiently use a locked forwarding node
2017	<	Node g = new Node(MOVED|LOCKED, nextTab, null, null);
2018	<	if (!casTabAt(tab, i, f, g))
2019	<	continue;
2020	<	setTabAt(nextTab, i, null);
2021	<	setTabAt(nextTab, i + n, null);
2022	<	setTabAt(tab, i, fwd);
2023	<	if (!g.casHash(MOVED|LOCKED, MOVED)) {
2024	<	g.hash = MOVED;
2025	<	synchronized (g) { g.notifyAll(); }
2026	<	}
2027	<	}
2028	<	}
2029	<	else if ((fh = f.hash) == MOVED) {
2030	<	Object fk = f.key;
2031	<	if (fk instanceof TreeBin) {
2032	<	TreeBin t = (TreeBin)fk;
2033	<	boolean validated = false;
2034	<	t.acquire(0);
2035	<	try {
2036	<	if (tabAt(tab, i) == f) {
2037	<	validated = true;
2038	<	splitTreeBin(nextTab, i, t);
2039	<	setTabAt(tab, i, fwd);
2040	<	}
2041	<	} finally {
2042	<	t.release(0);
2043	<	}
2044	<	if (!validated)
2045	<	continue;
2046	<	}
2047	<	}
2048	<	else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) {
2049	<	boolean validated = false;
2050	<	try {              // split to lo and hi lists; copying as needed
2051	<	if (tabAt(tab, i) == f) {
2052	<	validated = true;
2053	<	splitBin(nextTab, i, f);
2054	<	setTabAt(tab, i, fwd);
2055	<	}
2056	<	} finally {
2057	<	if (!f.casHash(fh | LOCKED, fh)) {
2058	<	f.hash = fh;
2059	<	synchronized (f) { f.notifyAll(); };
2060	<	}
2061	<	}
2062	<	if (!validated)
2063	<	continue;
2064	<	}
2065	<	else {
2066	<	if (buffer == null) // initialize buffer for revisits
2067	<	buffer = new int[TRANSFER_BUFFER_SIZE];
2068	<	if (bin < 0 && bufferIndex > 0) {
2069	<	int j = buffer[--bufferIndex];
2070	<	buffer[bufferIndex] = i;
2071	<	i = j;         // swap with another bin
2072	<	continue;
2073	<	}
2074	<	if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) {
2075	<	f.tryAwaitLock(tab, i);
2076	<	continue;      // no other options -- block
2077	<	}
2078	<	if (rev == null)   // initialize reverse-forwarder
2079	<	rev = new Node(MOVED, tab, null, null);
2080	<	if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0)
2081	<	continue;      // recheck before adding to list
2082	<	buffer[nbuffered++] = i;
2083	<	setTabAt(nextTab, i, rev);     // install place-holders
2084	<	setTabAt(nextTab, i + n, rev);
2085	<	}
2086	<
2087	<	if (bin > 0)
2088	<	i = --bin;
2089	<	else if (buffer != null && nbuffered > 0) {
2090	<	bin = -1;
2091	<	i = buffer[bufferIndex = --nbuffered];
2092	<	}
2093	<	else
2094	<	return nextTab;
2095	<	}
2096	<	}
761	>	private transient volatile long baseCount;
762
763		/**
764	<	* Splits a normal bin with list headed by e into lo and hi parts;
765	<	* installs in given table.
764	>	* Table initialization and resizing control.  When negative, the
765	>	* table is being initialized or resized: -1 for initialization,
766	>	* else -(1 + the number of active resizing threads).  Otherwise,
767	>	* when table is null, holds the initial table size to use upon
768	>	* creation, or 0 for default. After initialization, holds the
769	>	* next element count value upon which to resize the table.
770		*/
771	<	private static void splitBin(Node[] nextTab, int i, Node e) {
2103	<	int bit = nextTab.length >>> 1; // bit to split on
2104	<	int runBit = e.hash & bit;
2105	<	Node lastRun = e, lo = null, hi = null;
2106	<	for (Node p = e.next; p != null; p = p.next) {
2107	<	int b = p.hash & bit;
2108	<	if (b != runBit) {
2109	<	runBit = b;
2110	<	lastRun = p;
2111	<	}
2112	<	}
2113	<	if (runBit == 0)
2114	<	lo = lastRun;
2115	<	else
2116	<	hi = lastRun;
2117	<	for (Node p = e; p != lastRun; p = p.next) {
2118	<	int ph = p.hash & HASH_BITS;
2119	<	Object pk = p.key, pv = p.val;
2120	<	if ((ph & bit) == 0)
2121	<	lo = new Node(ph, pk, pv, lo);
2122	<	else
2123	<	hi = new Node(ph, pk, pv, hi);
2124	<	}
2125	<	setTabAt(nextTab, i, lo);
2126	<	setTabAt(nextTab, i + bit, hi);
2127	<	}
771	>	private transient volatile int sizeCtl;
772
773		/**
774	<	* Splits a tree bin into lo and hi parts; installs in given table.
774	>	* The next table index (plus one) to split while resizing.
775		*/
776	<	private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) {
2133	<	int bit = nextTab.length >>> 1;
2134	<	TreeBin lt = new TreeBin();
2135	<	TreeBin ht = new TreeBin();
2136	<	int lc = 0, hc = 0;
2137	<	for (Node e = t.first; e != null; e = e.next) {
2138	<	int h = e.hash & HASH_BITS;
2139	<	Object k = e.key, v = e.val;
2140	<	if ((h & bit) == 0) {
2141	<	++lc;
2142	<	lt.putTreeNode(h, k, v);
2143	<	}
2144	<	else {
2145	<	++hc;
2146	<	ht.putTreeNode(h, k, v);
2147	<	}
2148	<	}
2149	<	Node ln, hn; // throw away trees if too small
2150	<	if (lc <= (TREE_THRESHOLD >>> 1)) {
2151	<	ln = null;
2152	<	for (Node p = lt.first; p != null; p = p.next)
2153	<	ln = new Node(p.hash, p.key, p.val, ln);
2154	<	}
2155	<	else
2156	<	ln = new Node(MOVED, lt, null, null);
2157	<	setTabAt(nextTab, i, ln);
2158	<	if (hc <= (TREE_THRESHOLD >>> 1)) {
2159	<	hn = null;
2160	<	for (Node p = ht.first; p != null; p = p.next)
2161	<	hn = new Node(p.hash, p.key, p.val, hn);
2162	<	}
2163	<	else
2164	<	hn = new Node(MOVED, ht, null, null);
2165	<	setTabAt(nextTab, i + bit, hn);
2166	<	}
776	>	private transient volatile int transferIndex;
777
778		/**
779	<	* Implementation for clear. Steps through each bin, removing all
2170	<	* nodes.
779	>	* Spinlock (locked via CAS) used when resizing and/or creating CounterCells.
780		*/
781	<	private final void internalClear() {
2173	<	long delta = 0L; // negative number of deletions
2174	<	int i = 0;
2175	<	Node[] tab = table;
2176	<	while (tab != null && i < tab.length) {
2177	<	int fh; Object fk;
2178	<	Node f = tabAt(tab, i);
2179	<	if (f == null)
2180	<	++i;
2181	<	else if ((fh = f.hash) == MOVED) {
2182	<	if ((fk = f.key) instanceof TreeBin) {
2183	<	TreeBin t = (TreeBin)fk;
2184	<	t.acquire(0);
2185	<	try {
2186	<	if (tabAt(tab, i) == f) {
2187	<	for (Node p = t.first; p != null; p = p.next) {
2188	<	if (p.val != null) { // (currently always true)
2189	<	p.val = null;
2190	<	--delta;
2191	<	}
2192	<	}
2193	<	t.first = null;
2194	<	t.root = null;
2195	<	++i;
2196	<	}
2197	<	} finally {
2198	<	t.release(0);
2199	<	}
2200	<	}
2201	<	else
2202	<	tab = (Node[])fk;
2203	<	}
2204	<	else if ((fh & LOCKED) != 0) {
2205	<	counter.add(delta); // opportunistically update count
2206	<	delta = 0L;
2207	<	f.tryAwaitLock(tab, i);
2208	<	}
2209	<	else if (f.casHash(fh, fh | LOCKED)) {
2210	<	try {
2211	<	if (tabAt(tab, i) == f) {
2212	<	for (Node e = f; e != null; e = e.next) {
2213	<	if (e.val != null) {  // (currently always true)
2214	<	e.val = null;
2215	<	--delta;
2216	<	}
2217	<	}
2218	<	setTabAt(tab, i, null);
2219	<	++i;
2220	<	}
2221	<	} finally {
2222	<	if (!f.casHash(fh | LOCKED, fh)) {
2223	<	f.hash = fh;
2224	<	synchronized (f) { f.notifyAll(); };
2225	<	}
2226	<	}
2227	<	}
2228	<	}
2229	<	if (delta != 0)
2230	<	counter.add(delta);
2231	<	}
2232	<
2233	<	/* ----------------Table Traversal -------------- */
781	>	private transient volatile int cellsBusy;
782
783		/**
784	<	* Encapsulates traversal for methods such as containsValue; also
785	<	* serves as a base class for other iterators and bulk tasks.
786	<	*
2239	<	* At each step, the iterator snapshots the key ("nextKey") and
2240	<	* value ("nextVal") of a valid node (i.e., one that, at point of
2241	<	* snapshot, has a non-null user value). Because val fields can
2242	<	* change (including to null, indicating deletion), field nextVal
2243	<	* might not be accurate at point of use, but still maintains the
2244	<	* weak consistency property of holding a value that was once
2245	<	* valid.
2246	<	*
2247	<	* Internal traversals directly access these fields, as in:
2248	<	* {@code while (it.advance() != null) { process(it.nextKey); }}
2249	<	*
2250	<	* Exported iterators must track whether the iterator has advanced
2251	<	* (in hasNext vs next) (by setting/checking/nulling field
2252	<	* nextVal), and then extract key, value, or key-value pairs as
2253	<	* return values of next().
2254	<	*
2255	<	* The iterator visits once each still-valid node that was
2256	<	* reachable upon iterator construction. It might miss some that
2257	<	* were added to a bin after the bin was visited, which is OK wrt
2258	<	* consistency guarantees. Maintaining this property in the face
2259	<	* of possible ongoing resizes requires a fair amount of
2260	<	* bookkeeping state that is difficult to optimize away amidst
2261	<	* volatile accesses.  Even so, traversal maintains reasonable
2262	<	* throughput.
2263	<	*
2264	<	* Normally, iteration proceeds bin-by-bin traversing lists.
2265	<	* However, if the table has been resized, then all future steps
2266	<	* must traverse both the bin at the current index as well as at
2267	<	* (index + baseSize); and so on for further resizings. To
2268	<	* paranoically cope with potential sharing by users of iterators
2269	<	* across threads, iteration terminates if a bounds checks fails
2270	<	* for a table read.
2271	<	*
2272	<	* This class extends ForkJoinTask to streamline parallel
2273	<	* iteration in bulk operations (see BulkTask). This adds only an
2274	<	* int of space overhead, which is close enough to negligible in
2275	<	* cases where it is not needed to not worry about it.  Because
2276	<	* ForkJoinTask is Serializable, but iterators need not be, we
2277	<	* need to add warning suppressions.
2278	<	*/
2279	<	@SuppressWarnings("serial") static class Traverser<K,V,R> extends ForkJoinTask<R> {
2280	<	final ConcurrentHashMap<K, V> map;
2281	<	Node next;           // the next entry to use
2282	<	Node last;           // the last entry used
2283	<	Object nextKey;      // cached key field of next
2284	<	Object nextVal;      // cached val field of next
2285	<	Node[] tab;          // current table; updated if resized
2286	<	int index;           // index of bin to use next
2287	<	int baseIndex;       // current index of initial table
2288	<	int baseLimit;       // index bound for initial table
2289	<	int baseSize;        // initial table size
2290	<
2291	<	/** Creates iterator for all entries in the table. */
2292	<	Traverser(ConcurrentHashMap<K, V> map) {
2293	<	this.map = map;
2294	<	}
2295	<
2296	<	/** Creates iterator for split() methods */
2297	<	Traverser(Traverser<K,V,?> it) {
2298	<	ConcurrentHashMap<K, V> m; Node[] t;
2299	<	if ((m = this.map = it.map) == null)
2300	<	t = null;
2301	<	else if ((t = it.tab) == null && // force parent tab initialization
2302	<	(t = it.tab = m.table) != null)
2303	<	it.baseLimit = it.baseSize = t.length;
2304	<	this.tab = t;
2305	<	this.baseSize = it.baseSize;
2306	<	it.baseLimit = this.index = this.baseIndex =
2307	<	((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1;
2308	<	}
2309	<
2310	<	/**
2311	<	* Advances next; returns nextVal or null if terminated.
2312	<	* See above for explanation.
2313	<	*/
2314	<	final Object advance() {
2315	<	Node e = last = next;
2316	<	Object ev = null;
2317	<	outer: do {
2318	<	if (e != null)                  // advance past used/skipped node
2319	<	e = e.next;
2320	<	while (e == null) {             // get to next non-null bin
2321	<	ConcurrentHashMap<K, V> m;
2322	<	Node[] t; int b, i, n; Object ek; // checks must use locals
2323	<	if ((t = tab) != null)
2324	<	n = t.length;
2325	<	else if ((m = map) != null && (t = tab = m.table) != null)
2326	<	n = baseLimit = baseSize = t.length;
2327	<	else
2328	<	break outer;
2329	<	if ((b = baseIndex) >= baseLimit ||
2330	<	(i = index) < 0 || i >= n)
2331	<	break outer;
2332	<	if ((e = tabAt(t, i)) != null && e.hash == MOVED) {
2333	<	if ((ek = e.key) instanceof TreeBin)
2334	<	e = ((TreeBin)ek).first;
2335	<	else {
2336	<	tab = (Node[])ek;
2337	<	continue;           // restarts due to null val
2338	<	}
2339	<	}                           // visit upper slots if present
2340	<	index = (i += baseSize) < n ? i : (baseIndex = b + 1);
2341	<	}
2342	<	nextKey = e.key;
2343	<	} while ((ev = e.val) == null);    // skip deleted or special nodes
2344	<	next = e;
2345	<	return nextVal = ev;
2346	<	}
2347	<
2348	<	public final void remove() {
2349	<	if (nextVal == null && last == null)
2350	<	advance();
2351	<	Node e = last;
2352	<	if (e == null)
2353	<	throw new IllegalStateException();
2354	<	last = null;
2355	<	map.remove(e.key);
2356	<	}
784	>	* Table of counter cells. When non-null, size is a power of 2.
785	>	*/
786	>	private transient volatile CounterCell[] counterCells;
787
788	<	public final boolean hasNext() {
789	<	return nextVal != null || advance() != null;
790	<	}
788	>	// views
789	>	private transient KeySetView<K,V> keySet;
790	>	private transient ValuesView<K,V> values;
791	>	private transient EntrySetView<K,V> entrySet;
792
2362	–	public final boolean hasMoreElements() { return hasNext(); }
2363	–	public final void setRawResult(Object x) { }
2364	–	public R getRawResult() { return null; }
2365	–	public boolean exec() { return true; }
2366	–	}
793
794		/* ---------------- Public operations -------------- */
795
#	Line 2371 | Line 797 | public class ConcurrentHashMap<K, V>
797		* Creates a new, empty map with the default initial table size (16).
798		*/
799		public ConcurrentHashMap() {
2374	–	this.counter = new LongAdder();
800		}
801
802		/**
#	Line 2385 | Line 810 | public class ConcurrentHashMap<K, V>
810		* elements is negative
811		*/
812		public ConcurrentHashMap(int initialCapacity) {
813	<	if (initialCapacity < 0)
2389	<	throw new IllegalArgumentException();
2390	<	int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
2391	<	MAXIMUM_CAPACITY :
2392	<	tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
2393	<	this.counter = new LongAdder();
2394	<	this.sizeCtl = cap;
813	>	this(initialCapacity, LOAD_FACTOR, 1);
814		}
815
816		/**
#	Line 2400 | Line 819 | public class ConcurrentHashMap<K, V>
819		* @param m the map
820		*/
821		public ConcurrentHashMap(Map<? extends K, ? extends V> m) {
2403	–	this.counter = new LongAdder();
822		this.sizeCtl = DEFAULT_CAPACITY;
823	<	internalPutAll(m);
823	>	putAll(m);
824		}
825
826		/**
#	Line 2426 | Line 844 | public class ConcurrentHashMap<K, V>
844
845		/**
846		* Creates a new, empty map with an initial table size based on
847	<	* the given number of elements ({@code initialCapacity}), table
848	<	* density ({@code loadFactor}), and number of concurrently
847	>	* the given number of elements ({@code initialCapacity}), initial
848	>	* table density ({@code loadFactor}), and number of concurrently
849		* updating threads ({@code concurrencyLevel}).
850		*
851		* @param initialCapacity the initial capacity. The implementation
#	Line 2443 | Line 861 | public class ConcurrentHashMap<K, V>
861		* nonpositive
862		*/
863		public ConcurrentHashMap(int initialCapacity,
864	<	float loadFactor, int concurrencyLevel) {
864	>	float loadFactor, int concurrencyLevel) {
865		if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)
866		throw new IllegalArgumentException();
867		if (initialCapacity < concurrencyLevel)   // Use at least as many bins
#	Line 2451 | Line 869 | public class ConcurrentHashMap<K, V>
869		long size = (long)(1.0 + (long)initialCapacity / loadFactor);
870		int cap = (size >= (long)MAXIMUM_CAPACITY) ?
871		MAXIMUM_CAPACITY : tableSizeFor((int)size);
2454	–	this.counter = new LongAdder();
872		this.sizeCtl = cap;
873		}
874
875	<	/**
2459	<	* {@inheritDoc}
2460	<	*/
2461	<	public boolean isEmpty() {
2462	<	return counter.sum() <= 0L; // ignore transient negative values
2463	<	}
875	>	// Original (since JDK1.2) Map methods
876
877		/**
878		* {@inheritDoc}
879		*/
880		public int size() {
881	<	long n = counter.sum();
881	>	long n = sumCount();
882		return ((n < 0L) ? 0 :
883		(n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
884		(int)n);
885		}
886
887		/**
888	<	* Returns the number of mappings. This method should be used
2477	<	* instead of {@link #size} because a ConcurrentHashMap may
2478	<	* contain more mappings than can be represented as an int. The
2479	<	* value returned is a snapshot; the actual count may differ if
2480	<	* there are ongoing concurrent insertions or removals.
2481	<	*
2482	<	* @return the number of mappings
888	>	* {@inheritDoc}
889		*/
890	<	public long mappingCount() {
891	<	long n = counter.sum();
2486	<	return (n < 0L) ? 0L : n; // ignore transient negative values
890	>	public boolean isEmpty() {
891	>	return sumCount() <= 0L; // ignore transient negative values
892		}
893
894		/**
#	Line 2497 | Line 902 | public class ConcurrentHashMap<K, V>
902		*
903		* @throws NullPointerException if the specified key is null
904		*/
905	<	@SuppressWarnings("unchecked") public V get(Object key) {
906	<	if (key == null)
907	<	throw new NullPointerException();
908	<	return (V)internalGet(key);
909	<	}
910	<
911	<	/**
912	<	* Returns the value to which the specified key is mapped,
913	<	* or the gieven defaultValue if this map contains no mapping for the key.
914	<	*
915	<	* @param key the key
916	<	* @param defaultValue the value to return if this map contains
917	<	* no mapping for the given key.
918	<	* @return the mapping for the key, if present; else the defaultValue
919	<	* @throws NullPointerException if the specified key is null
920	<	*/
921	<	@SuppressWarnings("unchecked") public V getValueOrDefault(Object key, V defaultValue) {
922	<	if (key == null)
2518	<	throw new NullPointerException();
2519	<	V v = (V) internalGet(key);
2520	<	return v == null ? defaultValue : v;
905	>	public V get(Object key) {
906	>	Node<K,V>[] tab; Node<K,V> e, p; int n, eh; K ek;
907	>	int h = spread(key.hashCode());
908	>	if ((tab = table) != null && (n = tab.length) > 0 &&
909	>	(e = tabAt(tab, (n - 1) & h)) != null) {
910	>	if ((eh = e.hash) == h) {
911	>	if ((ek = e.key) == key || (ek != null && key.equals(ek)))
912	>	return e.val;
913	>	}
914	>	else if (eh < 0)
915	>	return (p = e.find(h, key)) != null ? p.val : null;
916	>	while ((e = e.next) != null) {
917	>	if (e.hash == h &&
918	>	((ek = e.key) == key || (ek != null && key.equals(ek))))
919	>	return e.val;
920	>	}
921	>	}
922	>	return null;
923		}
924
925		/**
926		* Tests if the specified object is a key in this table.
927		*
928	<	* @param  key   possible key
928	>	* @param  key possible key
929		* @return {@code true} if and only if the specified object
930		*         is a key in this table, as determined by the
931		*         {@code equals} method; {@code false} otherwise
932		* @throws NullPointerException if the specified key is null
933		*/
934		public boolean containsKey(Object key) {
935	<	if (key == null)
2534	<	throw new NullPointerException();
2535	<	return internalGet(key) != null;
935	>	return get(key) != null;
936		}
937
938		/**
#	Line 2548 | Line 948 | public class ConcurrentHashMap<K, V>
948		public boolean containsValue(Object value) {
949		if (value == null)
950		throw new NullPointerException();
951	<	Object v;
952	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
953	<	while ((v = it.advance()) != null) {
954	<	if (v == value || value.equals(v))
955	<	return true;
951	>	Node<K,V>[] t;
952	>	if ((t = table) != null) {
953	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
954	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
955	>	V v;
956	>	if ((v = p.val) == value || (v != null && value.equals(v)))
957	>	return true;
958	>	}
959		}
960		return false;
961		}
962
963		/**
2561	–	* Legacy method testing if some key maps into the specified value
2562	–	* in this table.  This method is identical in functionality to
2563	–	* {@link #containsValue}, and exists solely to ensure
2564	–	* full compatibility with class {@link java.util.Hashtable},
2565	–	* which supported this method prior to introduction of the
2566	–	* Java Collections framework.
2567	–	*
2568	–	* @param  value a value to search for
2569	–	* @return {@code true} if and only if some key maps to the
2570	–	*         {@code value} argument in this table as
2571	–	*         determined by the {@code equals} method;
2572	–	*         {@code false} otherwise
2573	–	* @throws NullPointerException if the specified value is null
2574	–	*/
2575	–	public boolean contains(Object value) {
2576	–	return containsValue(value);
2577	–	}
2578	–
2579	–	/**
964		* Maps the specified key to the specified value in this table.
965		* Neither the key nor the value can be null.
966		*
967	<	* <p> The value can be retrieved by calling the {@code get} method
967	>	* <p>The value can be retrieved by calling the {@code get} method
968		* with a key that is equal to the original key.
969		*
970		* @param key key with which the specified value is to be associated
#	Line 2589 | Line 973 | public class ConcurrentHashMap<K, V>
973		*         {@code null} if there was no mapping for {@code key}
974		* @throws NullPointerException if the specified key or value is null
975		*/
976	<	@SuppressWarnings("unchecked") public V put(K key, V value) {
977	<	if (key == null || value == null)
2594	<	throw new NullPointerException();
2595	<	return (V)internalPut(key, value);
976	>	public V put(K key, V value) {
977	>	return putVal(key, value, false);
978		}
979
980	<	/**
981	<	* {@inheritDoc}
982	<	*
983	<	* @return the previous value associated with the specified key,
984	<	*         or {@code null} if there was no mapping for the key
985	<	* @throws NullPointerException if the specified key or value is null
986	<	*/
987	<	@SuppressWarnings("unchecked") public V putIfAbsent(K key, V value) {
988	<	if (key == null || value == null)
989	<	throw new NullPointerException();
990	<	return (V)internalPutIfAbsent(key, value);
980	>	/** Implementation for put and putIfAbsent */
981	>	final V putVal(K key, V value, boolean onlyIfAbsent) {
982	>	if (key == null || value == null) throw new NullPointerException();
983	>	int hash = spread(key.hashCode());
984	>	int binCount = 0;
985	>	for (Node<K,V>[] tab = table;;) {
986	>	Node<K,V> f; int n, i, fh; K fk; V fv;
987	>	if (tab == null || (n = tab.length) == 0)
988	>	tab = initTable();
989	>	else if ((f = tabAt(tab, i = (n - 1) & hash)) == null) {
990	>	if (casTabAt(tab, i, null, new Node<K,V>(hash, key, value)))
991	>	break;                   // no lock when adding to empty bin
992	>	}
993	>	else if ((fh = f.hash) == MOVED)
994	>	tab = helpTransfer(tab, f);
995	>	else if (onlyIfAbsent // check first node without acquiring lock
996	>	&& fh == hash
997	>	&& ((fk = f.key) == key || (fk != null && key.equals(fk)))
998	>	&& (fv = f.val) != null)
999	>	return fv;
1000	>	else {
1001	>	V oldVal = null;
1002	>	synchronized (f) {
1003	>	if (tabAt(tab, i) == f) {
1004	>	if (fh >= 0) {
1005	>	binCount = 1;
1006	>	for (Node<K,V> e = f;; ++binCount) {
1007	>	K ek;
1008	>	if (e.hash == hash &&
1009	>	((ek = e.key) == key ||
1010	>	(ek != null && key.equals(ek)))) {
1011	>	oldVal = e.val;
1012	>	if (!onlyIfAbsent)
1013	>	e.val = value;
1014	>	break;
1015	>	}
1016	>	Node<K,V> pred = e;
1017	>	if ((e = e.next) == null) {
1018	>	pred.next = new Node<K,V>(hash, key, value);
1019	>	break;
1020	>	}
1021	>	}
1022	>	}
1023	>	else if (f instanceof TreeBin) {
1024	>	Node<K,V> p;
1025	>	binCount = 2;
1026	>	if ((p = ((TreeBin<K,V>)f).putTreeVal(hash, key,
1027	>	value)) != null) {
1028	>	oldVal = p.val;
1029	>	if (!onlyIfAbsent)
1030	>	p.val = value;
1031	>	}
1032	>	}
1033	>	else if (f instanceof ReservationNode)
1034	>	throw new IllegalStateException("Recursive update");
1035	>	}
1036	>	}
1037	>	if (binCount != 0) {
1038	>	if (binCount >= TREEIFY_THRESHOLD)
1039	>	treeifyBin(tab, i);
1040	>	if (oldVal != null)
1041	>	return oldVal;
1042	>	break;
1043	>	}
1044	>	}
1045	>	}
1046	>	addCount(1L, binCount);
1047	>	return null;
1048		}
1049
1050		/**
#	Line 2616 | Line 1055 | public class ConcurrentHashMap<K, V>
1055		* @param m mappings to be stored in this map
1056		*/
1057		public void putAll(Map<? extends K, ? extends V> m) {
1058	<	internalPutAll(m);
1059	<	}
1060	<
2622	<	/**
2623	<	* If the specified key is not already associated with a value,
2624	<	* computes its value using the given mappingFunction and enters
2625	<	* it into the map unless null.  This is equivalent to
2626	<	* <pre> {@code
2627	<	* if (map.containsKey(key))
2628	<	*   return map.get(key);
2629	<	* value = mappingFunction.apply(key);
2630	<	* if (value != null)
2631	<	*   map.put(key, value);
2632	<	* return value;}</pre>
2633	<	*
2634	<	* except that the action is performed atomically.  If the
2635	<	* function returns {@code null} no mapping is recorded. If the
2636	<	* function itself throws an (unchecked) exception, the exception
2637	<	* is rethrown to its caller, and no mapping is recorded.  Some
2638	<	* attempted update operations on this map by other threads may be
2639	<	* blocked while computation is in progress, so the computation
2640	<	* should be short and simple, and must not attempt to update any
2641	<	* other mappings of this Map. The most appropriate usage is to
2642	<	* construct a new object serving as an initial mapped value, or
2643	<	* memoized result, as in:
2644	<	*
2645	<	*  <pre> {@code
2646	<	* map.computeIfAbsent(key, new Fun<K, V>() {
2647	<	*   public V map(K k) { return new Value(f(k)); }});}</pre>
2648	<	*
2649	<	* @param key key with which the specified value is to be associated
2650	<	* @param mappingFunction the function to compute a value
2651	<	* @return the current (existing or computed) value associated with
2652	<	*         the specified key, or null if the computed value is null.
2653	<	* @throws NullPointerException if the specified key or mappingFunction
2654	<	*         is null
2655	<	* @throws IllegalStateException if the computation detectably
2656	<	*         attempts a recursive update to this map that would
2657	<	*         otherwise never complete
2658	<	* @throws RuntimeException or Error if the mappingFunction does so,
2659	<	*         in which case the mapping is left unestablished
2660	<	*/
2661	<	@SuppressWarnings("unchecked") public V computeIfAbsent
2662	<	(K key, Fun<? super K, ? extends V> mappingFunction) {
2663	<	if (key == null || mappingFunction == null)
2664	<	throw new NullPointerException();
2665	<	return (V)internalComputeIfAbsent(key, mappingFunction);
2666	<	}
2667	<
2668	<	/**
2669	<	* If the given key is present, computes a new mapping value given a key and
2670	<	* its current mapped value. This is equivalent to
2671	<	*  <pre> {@code
2672	<	*   if (map.containsKey(key)) {
2673	<	*     value = remappingFunction.apply(key, map.get(key));
2674	<	*     if (value != null)
2675	<	*       map.put(key, value);
2676	<	*     else
2677	<	*       map.remove(key);
2678	<	*   }
2679	<	* }</pre>
2680	<	*
2681	<	* except that the action is performed atomically.  If the
2682	<	* function returns {@code null}, the mapping is removed.  If the
2683	<	* function itself throws an (unchecked) exception, the exception
2684	<	* is rethrown to its caller, and the current mapping is left
2685	<	* unchanged.  Some attempted update operations on this map by
2686	<	* other threads may be blocked while computation is in progress,
2687	<	* so the computation should be short and simple, and must not
2688	<	* attempt to update any other mappings of this Map. For example,
2689	<	* to either create or append new messages to a value mapping:
2690	<	*
2691	<	* @param key key with which the specified value is to be associated
2692	<	* @param remappingFunction the function to compute a value
2693	<	* @return the new value associated with the specified key, or null if none
2694	<	* @throws NullPointerException if the specified key or remappingFunction
2695	<	*         is null
2696	<	* @throws IllegalStateException if the computation detectably
2697	<	*         attempts a recursive update to this map that would
2698	<	*         otherwise never complete
2699	<	* @throws RuntimeException or Error if the remappingFunction does so,
2700	<	*         in which case the mapping is unchanged
2701	<	*/
2702	<	@SuppressWarnings("unchecked") public V computeIfPresent
2703	<	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2704	<	if (key == null || remappingFunction == null)
2705	<	throw new NullPointerException();
2706	<	return (V)internalCompute(key, true, remappingFunction);
2707	<	}
2708	<
2709	<	/**
2710	<	* Computes a new mapping value given a key and
2711	<	* its current mapped value (or {@code null} if there is no current
2712	<	* mapping). This is equivalent to
2713	<	*  <pre> {@code
2714	<	*   value = remappingFunction.apply(key, map.get(key));
2715	<	*   if (value != null)
2716	<	*     map.put(key, value);
2717	<	*   else
2718	<	*     map.remove(key);
2719	<	* }</pre>
2720	<	*
2721	<	* except that the action is performed atomically.  If the
2722	<	* function returns {@code null}, the mapping is removed.  If the
2723	<	* function itself throws an (unchecked) exception, the exception
2724	<	* is rethrown to its caller, and the current mapping is left
2725	<	* unchanged.  Some attempted update operations on this map by
2726	<	* other threads may be blocked while computation is in progress,
2727	<	* so the computation should be short and simple, and must not
2728	<	* attempt to update any other mappings of this Map. For example,
2729	<	* to either create or append new messages to a value mapping:
2730	<	*
2731	<	* <pre> {@code
2732	<	* Map<Key, String> map = ...;
2733	<	* final String msg = ...;
2734	<	* map.compute(key, new BiFun<Key, String, String>() {
2735	<	*   public String apply(Key k, String v) {
2736	<	*    return (v == null) ? msg : v + msg;});}}</pre>
2737	<	*
2738	<	* @param key key with which the specified value is to be associated
2739	<	* @param remappingFunction the function to compute a value
2740	<	* @return the new value associated with the specified key, or null if none
2741	<	* @throws NullPointerException if the specified key or remappingFunction
2742	<	*         is null
2743	<	* @throws IllegalStateException if the computation detectably
2744	<	*         attempts a recursive update to this map that would
2745	<	*         otherwise never complete
2746	<	* @throws RuntimeException or Error if the remappingFunction does so,
2747	<	*         in which case the mapping is unchanged
2748	<	*/
2749	<	@SuppressWarnings("unchecked") public V compute
2750	<	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2751	<	if (key == null || remappingFunction == null)
2752	<	throw new NullPointerException();
2753	<	return (V)internalCompute(key, false, remappingFunction);
2754	<	}
2755	<
2756	<	/**
2757	<	* If the specified key is not already associated
2758	<	* with a value, associate it with the given value.
2759	<	* Otherwise, replace the value with the results of
2760	<	* the given remapping function. This is equivalent to:
2761	<	*  <pre> {@code
2762	<	*   if (!map.containsKey(key))
2763	<	*     map.put(value);
2764	<	*   else {
2765	<	*     newValue = remappingFunction.apply(map.get(key), value);
2766	<	*     if (value != null)
2767	<	*       map.put(key, value);
2768	<	*     else
2769	<	*       map.remove(key);
2770	<	*   }
2771	<	* }</pre>
2772	<	* except that the action is performed atomically.  If the
2773	<	* function returns {@code null}, the mapping is removed.  If the
2774	<	* function itself throws an (unchecked) exception, the exception
2775	<	* is rethrown to its caller, and the current mapping is left
2776	<	* unchanged.  Some attempted update operations on this map by
2777	<	* other threads may be blocked while computation is in progress,
2778	<	* so the computation should be short and simple, and must not
2779	<	* attempt to update any other mappings of this Map.
2780	<	*/
2781	<	@SuppressWarnings("unchecked") public V merge
2782	<	(K key, V value, BiFun<? super V, ? super V, ? extends V> remappingFunction) {
2783	<	if (key == null || value == null || remappingFunction == null)
2784	<	throw new NullPointerException();
2785	<	return (V)internalMerge(key, value, remappingFunction);
1058	>	tryPresize(m.size());
1059	>	for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
1060	>	putVal(e.getKey(), e.getValue(), false);
1061		}
1062
1063		/**
#	Line 2794 | Line 1069 | public class ConcurrentHashMap<K, V>
1069		*         {@code null} if there was no mapping for {@code key}
1070		* @throws NullPointerException if the specified key is null
1071		*/
1072	<	@SuppressWarnings("unchecked") public V remove(Object key) {
1073	<	if (key == null)
2799	<	throw new NullPointerException();
2800	<	return (V)internalReplace(key, null, null);
2801	<	}
2802	<
2803	<	/**
2804	<	* {@inheritDoc}
2805	<	*
2806	<	* @throws NullPointerException if the specified key is null
2807	<	*/
2808	<	public boolean remove(Object key, Object value) {
2809	<	if (key == null)
2810	<	throw new NullPointerException();
2811	<	if (value == null)
2812	<	return false;
2813	<	return internalReplace(key, null, value) != null;
1072	>	public V remove(Object key) {
1073	>	return replaceNode(key, null, null);
1074		}
1075
1076		/**
1077	<	* {@inheritDoc}
1078	<	*
1079	<	* @throws NullPointerException if any of the arguments are null
2820	<	*/
2821	<	public boolean replace(K key, V oldValue, V newValue) {
2822	<	if (key == null || oldValue == null || newValue == null)
2823	<	throw new NullPointerException();
2824	<	return internalReplace(key, newValue, oldValue) != null;
2825	<	}
2826	<
2827	<	/**
2828	<	* {@inheritDoc}
2829	<	*
2830	<	* @return the previous value associated with the specified key,
2831	<	*         or {@code null} if there was no mapping for the key
2832	<	* @throws NullPointerException if the specified key or value is null
1077	>	* Implementation for the four public remove/replace methods:
1078	>	* Replaces node value with v, conditional upon match of cv if
1079	>	* non-null.  If resulting value is null, delete.
1080		*/
1081	<	@SuppressWarnings("unchecked") public V replace(K key, V value) {
1082	<	if (key == null || value == null)
1083	<	throw new NullPointerException();
1084	<	return (V)internalReplace(key, value, null);
1081	>	final V replaceNode(Object key, V value, Object cv) {
1082	>	int hash = spread(key.hashCode());
1083	>	for (Node<K,V>[] tab = table;;) {
1084	>	Node<K,V> f; int n, i, fh;
1085	>	if (tab == null || (n = tab.length) == 0 ||
1086	>	(f = tabAt(tab, i = (n - 1) & hash)) == null)
1087	>	break;
1088	>	else if ((fh = f.hash) == MOVED)
1089	>	tab = helpTransfer(tab, f);
1090	>	else {
1091	>	V oldVal = null;
1092	>	boolean validated = false;
1093	>	synchronized (f) {
1094	>	if (tabAt(tab, i) == f) {
1095	>	if (fh >= 0) {
1096	>	validated = true;
1097	>	for (Node<K,V> e = f, pred = null;;) {
1098	>	K ek;
1099	>	if (e.hash == hash &&
1100	>	((ek = e.key) == key ||
1101	>	(ek != null && key.equals(ek)))) {
1102	>	V ev = e.val;
1103	>	if (cv == null || cv == ev ||
1104	>	(ev != null && cv.equals(ev))) {
1105	>	oldVal = ev;
1106	>	if (value != null)
1107	>	e.val = value;
1108	>	else if (pred != null)
1109	>	pred.next = e.next;
1110	>	else
1111	>	setTabAt(tab, i, e.next);
1112	>	}
1113	>	break;
1114	>	}
1115	>	pred = e;
1116	>	if ((e = e.next) == null)
1117	>	break;
1118	>	}
1119	>	}
1120	>	else if (f instanceof TreeBin) {
1121	>	validated = true;
1122	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1123	>	TreeNode<K,V> r, p;
1124	>	if ((r = t.root) != null &&
1125	>	(p = r.findTreeNode(hash, key, null)) != null) {
1126	>	V pv = p.val;
1127	>	if (cv == null || cv == pv ||
1128	>	(pv != null && cv.equals(pv))) {
1129	>	oldVal = pv;
1130	>	if (value != null)
1131	>	p.val = value;
1132	>	else if (t.removeTreeNode(p))
1133	>	setTabAt(tab, i, untreeify(t.first));
1134	>	}
1135	>	}
1136	>	}
1137	>	else if (f instanceof ReservationNode)
1138	>	throw new IllegalStateException("Recursive update");
1139	>	}
1140	>	}
1141	>	if (validated) {
1142	>	if (oldVal != null) {
1143	>	if (value == null)
1144	>	addCount(-1L, -1);
1145	>	return oldVal;
1146	>	}
1147	>	break;
1148	>	}
1149	>	}
1150	>	}
1151	>	return null;
1152		}
1153
1154		/**
1155		* Removes all of the mappings from this map.
1156		*/
1157		public void clear() {
1158	<	internalClear();
1158	>	long delta = 0L; // negative number of deletions
1159	>	int i = 0;
1160	>	Node<K,V>[] tab = table;
1161	>	while (tab != null && i < tab.length) {
1162	>	int fh;
1163	>	Node<K,V> f = tabAt(tab, i);
1164	>	if (f == null)
1165	>	++i;
1166	>	else if ((fh = f.hash) == MOVED) {
1167	>	tab = helpTransfer(tab, f);
1168	>	i = 0; // restart
1169	>	}
1170	>	else {
1171	>	synchronized (f) {
1172	>	if (tabAt(tab, i) == f) {
1173	>	Node<K,V> p = (fh >= 0 ? f :
1174	>	(f instanceof TreeBin) ?
1175	>	((TreeBin<K,V>)f).first : null);
1176	>	while (p != null) {
1177	>	--delta;
1178	>	p = p.next;
1179	>	}
1180	>	setTabAt(tab, i++, null);
1181	>	}
1182	>	}
1183	>	}
1184	>	}
1185	>	if (delta != 0L)
1186	>	addCount(delta, -1);
1187		}
1188
1189		/**
1190		* Returns a {@link Set} view of the keys contained in this map.
1191		* The set is backed by the map, so changes to the map are
1192	<	* reflected in the set, and vice-versa.  The set supports element
1192	>	* reflected in the set, and vice-versa. The set supports element
1193		* removal, which removes the corresponding mapping from this map,
1194		* via the {@code Iterator.remove}, {@code Set.remove},
1195		* {@code removeAll}, {@code retainAll}, and {@code clear}
1196		* operations.  It does not support the {@code add} or
1197		* {@code addAll} operations.
1198		*
1199	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
1200	<	* that will never throw {@link ConcurrentModificationException},
1201	<	* and guarantees to traverse elements as they existed upon
1202	<	* construction of the iterator, and may (but is not guaranteed to)
1203	<	* reflect any modifications subsequent to construction.
1204	<	*/
1205	<	public Set<K> keySet() {
1206	<	KeySet<K,V> ks = keySet;
1207	<	return (ks != null) ? ks : (keySet = new KeySet<K,V>(this));
1199	>	* <p>The view's iterators and spliterators are
1200	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
1201	>	*
1202	>	* <p>The view's {@code spliterator} reports {@link Spliterator#CONCURRENT},
1203	>	* {@link Spliterator#DISTINCT}, and {@link Spliterator#NONNULL}.
1204	>	*
1205	>	* @return the set view
1206	>	*/
1207	>	public KeySetView<K,V> keySet() {
1208	>	KeySetView<K,V> ks;
1209	>	if ((ks = keySet) != null) return ks;
1210	>	return keySet = new KeySetView<K,V>(this, null);
1211		}
1212
1213		/**
#	Line 2875 | Line 1220 | public class ConcurrentHashMap<K, V>
1220		* {@code retainAll}, and {@code clear} operations.  It does not
1221		* support the {@code add} or {@code addAll} operations.
1222		*
1223	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
1224	<	* that will never throw {@link ConcurrentModificationException},
1225	<	* and guarantees to traverse elements as they existed upon
1226	<	* construction of the iterator, and may (but is not guaranteed to)
1227	<	* reflect any modifications subsequent to construction.
1223	>	* <p>The view's iterators and spliterators are
1224	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
1225	>	*
1226	>	* <p>The view's {@code spliterator} reports {@link Spliterator#CONCURRENT}
1227	>	* and {@link Spliterator#NONNULL}.
1228	>	*
1229	>	* @return the collection view
1230		*/
1231		public Collection<V> values() {
1232	<	Values<K,V> vs = values;
1233	<	return (vs != null) ? vs : (values = new Values<K,V>(this));
1232	>	ValuesView<K,V> vs;
1233	>	if ((vs = values) != null) return vs;
1234	>	return values = new ValuesView<K,V>(this);
1235		}
1236
1237		/**
#	Line 2893 | Line 1241 | public class ConcurrentHashMap<K, V>
1241		* removal, which removes the corresponding mapping from the map,
1242		* via the {@code Iterator.remove}, {@code Set.remove},
1243		* {@code removeAll}, {@code retainAll}, and {@code clear}
1244	<	* operations.  It does not support the {@code add} or
2897	<	* {@code addAll} operations.
1244	>	* operations.
1245		*
1246	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
1247	<	* that will never throw {@link ConcurrentModificationException},
2901	<	* and guarantees to traverse elements as they existed upon
2902	<	* construction of the iterator, and may (but is not guaranteed to)
2903	<	* reflect any modifications subsequent to construction.
2904	<	*/
2905	<	public Set<Map.Entry<K,V>> entrySet() {
2906	<	EntrySet<K,V> es = entrySet;
2907	<	return (es != null) ? es : (entrySet = new EntrySet<K,V>(this));
2908	<	}
2909	<
2910	<	/**
2911	<	* Returns an enumeration of the keys in this table.
2912	<	*
2913	<	* @return an enumeration of the keys in this table
2914	<	* @see #keySet()
2915	<	*/
2916	<	public Enumeration<K> keys() {
2917	<	return new KeyIterator<K,V>(this);
2918	<	}
2919	<
2920	<	/**
2921	<	* Returns an enumeration of the values in this table.
2922	<	*
2923	<	* @return an enumeration of the values in this table
2924	<	* @see #values()
2925	<	*/
2926	<	public Enumeration<V> elements() {
2927	<	return new ValueIterator<K,V>(this);
2928	<	}
2929	<
2930	<	/**
2931	<	* Returns a partitionable iterator of the keys in this map.
2932	<	*
2933	<	* @return a partitionable iterator of the keys in this map
2934	<	*/
2935	<	public Spliterator<K> keySpliterator() {
2936	<	return new KeyIterator<K,V>(this);
2937	<	}
2938	<
2939	<	/**
2940	<	* Returns a partitionable iterator of the values in this map.
1246	>	* <p>The view's iterators and spliterators are
1247	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
1248		*
1249	<	* @return a partitionable iterator of the values in this map
1250	<	*/
2944	<	public Spliterator<V> valueSpliterator() {
2945	<	return new ValueIterator<K,V>(this);
2946	<	}
2947	<
2948	<	/**
2949	<	* Returns a partitionable iterator of the entries in this map.
1249	>	* <p>The view's {@code spliterator} reports {@link Spliterator#CONCURRENT},
1250	>	* {@link Spliterator#DISTINCT}, and {@link Spliterator#NONNULL}.
1251		*
1252	<	* @return a partitionable iterator of the entries in this map
1252	>	* @return the set view
1253		*/
1254	<	public Spliterator<Map.Entry<K,V>> entrySpliterator() {
1255	<	return new EntryIterator<K,V>(this);
1254	>	public Set<Map.Entry<K,V>> entrySet() {
1255	>	EntrySetView<K,V> es;
1256	>	if ((es = entrySet) != null) return es;
1257	>	return entrySet = new EntrySetView<K,V>(this);
1258		}
1259
1260		/**
#	Line 2963 | Line 1266 | public class ConcurrentHashMap<K, V>
1266		*/
1267		public int hashCode() {
1268		int h = 0;
1269	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
1270	<	Object v;
1271	<	while ((v = it.advance()) != null) {
1272	<	h += it.nextKey.hashCode() ^ v.hashCode();
1269	>	Node<K,V>[] t;
1270	>	if ((t = table) != null) {
1271	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1272	>	for (Node<K,V> p; (p = it.advance()) != null; )
1273	>	h += p.key.hashCode() ^ p.val.hashCode();
1274		}
1275		return h;
1276		}
#	Line 2983 | Line 1287 | public class ConcurrentHashMap<K, V>
1287		* @return a string representation of this map
1288		*/
1289		public String toString() {
1290	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
1290	>	Node<K,V>[] t;
1291	>	int f = (t = table) == null ? 0 : t.length;
1292	>	Traverser<K,V> it = new Traverser<K,V>(t, f, 0, f);
1293		StringBuilder sb = new StringBuilder();
1294		sb.append('{');
1295	<	Object v;
1296	<	if ((v = it.advance()) != null) {
1295	>	Node<K,V> p;
1296	>	if ((p = it.advance()) != null) {
1297		for (;;) {
1298	<	Object k = it.nextKey;
1298	>	K k = p.key;
1299	>	V v = p.val;
1300		sb.append(k == this ? "(this Map)" : k);
1301		sb.append('=');
1302		sb.append(v == this ? "(this Map)" : v);
1303	<	if ((v = it.advance()) == null)
1303	>	if ((p = it.advance()) == null)
1304		break;
1305		sb.append(',').append(' ');
1306		}
#	Line 3016 | Line 1323 | public class ConcurrentHashMap<K, V>
1323		if (!(o instanceof Map))
1324		return false;
1325		Map<?,?> m = (Map<?,?>) o;
1326	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
1327	<	Object val;
1328	<	while ((val = it.advance()) != null) {
1329	<	Object v = m.get(it.nextKey);
1326	>	Node<K,V>[] t;
1327	>	int f = (t = table) == null ? 0 : t.length;
1328	>	Traverser<K,V> it = new Traverser<K,V>(t, f, 0, f);
1329	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1330	>	V val = p.val;
1331	>	Object v = m.get(p.key);
1332		if (v == null || (v != val && !v.equals(val)))
1333		return false;
1334		}
#	Line 3027 | Line 1336 | public class ConcurrentHashMap<K, V>
1336		Object mk, mv, v;
1337		if ((mk = e.getKey()) == null ||
1338		(mv = e.getValue()) == null ||
1339	<	(v = internalGet(mk)) == null ||
1339	>	(v = get(mk)) == null ||
1340		(mv != v && !mv.equals(v)))
1341		return false;
1342		}
#	Line 3035 | Line 1344 | public class ConcurrentHashMap<K, V>
1344		return true;
1345		}
1346
1347	<	/* ----------------Iterators -------------- */
1347	>	/**
1348	>	* Stripped-down version of helper class used in previous version,
1349	>	* declared for the sake of serialization compatibility.
1350	>	*/
1351	>	static class Segment<K,V> extends ReentrantLock implements Serializable {
1352	>	private static final long serialVersionUID = 2249069246763182397L;
1353	>	final float loadFactor;
1354	>	Segment(float lf) { this.loadFactor = lf; }
1355	>	}
1356
1357	<	@SuppressWarnings("serial") static final class KeyIterator<K,V> extends Traverser<K,V,Object>
1358	<	implements Spliterator<K>, Enumeration<K> {
1359	<	KeyIterator(ConcurrentHashMap<K, V> map) { super(map); }
1360	<	KeyIterator(Traverser<K,V,Object> it) {
1361	<	super(it);
1362	<	}
1363	<	public KeyIterator<K,V> split() {
1364	<	if (last != null || (next != null && nextVal == null))
1365	<	throw new IllegalStateException();
1366	<	return new KeyIterator<K,V>(this);
1367	<	}
1368	<	@SuppressWarnings("unchecked") public final K next() {
1369	<	if (nextVal == null && advance() == null)
1370	<	throw new NoSuchElementException();
1371	<	Object k = nextKey;
1372	<	nextVal = null;
1373	<	return (K) k;
1357	>	/**
1358	>	* Saves this map to a stream (that is, serializes it).
1359	>	*
1360	>	* @param s the stream
1361	>	* @throws java.io.IOException if an I/O error occurs
1362	>	* @serialData
1363	>	* the serialized fields, followed by the key (Object) and value
1364	>	* (Object) for each key-value mapping, followed by a null pair.
1365	>	* The key-value mappings are emitted in no particular order.
1366	>	*/
1367	>	private void writeObject(java.io.ObjectOutputStream s)
1368	>	throws java.io.IOException {
1369	>	// For serialization compatibility
1370	>	// Emulate segment calculation from previous version of this class
1371	>	int sshift = 0;
1372	>	int ssize = 1;
1373	>	while (ssize < DEFAULT_CONCURRENCY_LEVEL) {
1374	>	++sshift;
1375	>	ssize <<= 1;
1376	>	}
1377	>	int segmentShift = 32 - sshift;
1378	>	int segmentMask = ssize - 1;
1379	>	@SuppressWarnings("unchecked")
1380	>	Segment<K,V>[] segments = (Segment<K,V>[])
1381	>	new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
1382	>	for (int i = 0; i < segments.length; ++i)
1383	>	segments[i] = new Segment<K,V>(LOAD_FACTOR);
1384	>	java.io.ObjectOutputStream.PutField streamFields = s.putFields();
1385	>	streamFields.put("segments", segments);
1386	>	streamFields.put("segmentShift", segmentShift);
1387	>	streamFields.put("segmentMask", segmentMask);
1388	>	s.writeFields();
1389	>
1390	>	Node<K,V>[] t;
1391	>	if ((t = table) != null) {
1392	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1393	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1394	>	s.writeObject(p.key);
1395	>	s.writeObject(p.val);
1396	>	}
1397		}
1398	<
1399	<	public final K nextElement() { return next(); }
1398	>	s.writeObject(null);
1399	>	s.writeObject(null);
1400		}
1401
1402	<	@SuppressWarnings("serial") static final class ValueIterator<K,V> extends Traverser<K,V,Object>
1403	<	implements Spliterator<V>, Enumeration<V> {
1404	<	ValueIterator(ConcurrentHashMap<K, V> map) { super(map); }
1405	<	ValueIterator(Traverser<K,V,Object> it) {
1406	<	super(it);
1402	>	/**
1403	>	* Reconstitutes this map from a stream (that is, deserializes it).
1404	>	* @param s the stream
1405	>	* @throws ClassNotFoundException if the class of a serialized object
1406	>	*         could not be found
1407	>	* @throws java.io.IOException if an I/O error occurs
1408	>	*/
1409	>	private void readObject(java.io.ObjectInputStream s)
1410	>	throws java.io.IOException, ClassNotFoundException {
1411	>	/*
1412	>	* To improve performance in typical cases, we create nodes
1413	>	* while reading, then place in table once size is known.
1414	>	* However, we must also validate uniqueness and deal with
1415	>	* overpopulated bins while doing so, which requires
1416	>	* specialized versions of putVal mechanics.
1417	>	*/
1418	>	sizeCtl = -1; // force exclusion for table construction
1419	>	s.defaultReadObject();
1420	>	long size = 0L;
1421	>	Node<K,V> p = null;
1422	>	for (;;) {
1423	>	@SuppressWarnings("unchecked")
1424	>	K k = (K) s.readObject();
1425	>	@SuppressWarnings("unchecked")
1426	>	V v = (V) s.readObject();
1427	>	if (k != null && v != null) {
1428	>	p = new Node<K,V>(spread(k.hashCode()), k, v, p);
1429	>	++size;
1430	>	}
1431	>	else
1432	>	break;
1433		}
1434	<	public ValueIterator<K,V> split() {
1435	<	if (last != null || (next != null && nextVal == null))
1436	<	throw new IllegalStateException();
1437	<	return new ValueIterator<K,V>(this);
1434	>	if (size == 0L)
1435	>	sizeCtl = 0;
1436	>	else {
1437	>	long ts = (long)(1.0 + size / LOAD_FACTOR);
1438	>	int n = (ts >= (long)MAXIMUM_CAPACITY) ?
1439	>	MAXIMUM_CAPACITY : tableSizeFor((int)ts);
1440	>	@SuppressWarnings("unchecked")
1441	>	Node<K,V>[] tab = (Node<K,V>[])new Node<?,?>[n];
1442	>	int mask = n - 1;
1443	>	long added = 0L;
1444	>	while (p != null) {
1445	>	boolean insertAtFront;
1446	>	Node<K,V> next = p.next, first;
1447	>	int h = p.hash, j = h & mask;
1448	>	if ((first = tabAt(tab, j)) == null)
1449	>	insertAtFront = true;
1450	>	else {
1451	>	K k = p.key;
1452	>	if (first.hash < 0) {
1453	>	TreeBin<K,V> t = (TreeBin<K,V>)first;
1454	>	if (t.putTreeVal(h, k, p.val) == null)
1455	>	++added;
1456	>	insertAtFront = false;
1457	>	}
1458	>	else {
1459	>	int binCount = 0;
1460	>	insertAtFront = true;
1461	>	Node<K,V> q; K qk;
1462	>	for (q = first; q != null; q = q.next) {
1463	>	if (q.hash == h &&
1464	>	((qk = q.key) == k ||
1465	>	(qk != null && k.equals(qk)))) {
1466	>	insertAtFront = false;
1467	>	break;
1468	>	}
1469	>	++binCount;
1470	>	}
1471	>	if (insertAtFront && binCount >= TREEIFY_THRESHOLD) {
1472	>	insertAtFront = false;
1473	>	++added;
1474	>	p.next = first;
1475	>	TreeNode<K,V> hd = null, tl = null;
1476	>	for (q = p; q != null; q = q.next) {
1477	>	TreeNode<K,V> t = new TreeNode<K,V>
1478	>	(q.hash, q.key, q.val, null, null);
1479	>	if ((t.prev = tl) == null)
1480	>	hd = t;
1481	>	else
1482	>	tl.next = t;
1483	>	tl = t;
1484	>	}
1485	>	setTabAt(tab, j, new TreeBin<K,V>(hd));
1486	>	}
1487	>	}
1488	>	}
1489	>	if (insertAtFront) {
1490	>	++added;
1491	>	p.next = first;
1492	>	setTabAt(tab, j, p);
1493	>	}
1494	>	p = next;
1495	>	}
1496	>	table = tab;
1497	>	sizeCtl = n - (n >>> 2);
1498	>	baseCount = added;
1499		}
1500	+	}
1501
1502	<	@SuppressWarnings("unchecked") public final V next() {
3075	<	Object v;
3076	<	if ((v = nextVal) == null && (v = advance()) == null)
3077	<	throw new NoSuchElementException();
3078	<	nextVal = null;
3079	<	return (V) v;
3080	<	}
1502	>	// ConcurrentMap methods
1503
1504	<	public final V nextElement() { return next(); }
1504	>	/**
1505	>	* {@inheritDoc}
1506	>	*
1507	>	* @return the previous value associated with the specified key,
1508	>	*         or {@code null} if there was no mapping for the key
1509	>	* @throws NullPointerException if the specified key or value is null
1510	>	*/
1511	>	public V putIfAbsent(K key, V value) {
1512	>	return putVal(key, value, true);
1513		}
1514
1515	<	@SuppressWarnings("serial") static final class EntryIterator<K,V> extends Traverser<K,V,Object>
1516	<	implements Spliterator<Map.Entry<K,V>> {
1517	<	EntryIterator(ConcurrentHashMap<K, V> map) { super(map); }
1518	<	EntryIterator(Traverser<K,V,Object> it) {
1519	<	super(it);
1520	<	}
1521	<	public EntryIterator<K,V> split() {
1522	<	if (last != null || (next != null && nextVal == null))
1523	<	throw new IllegalStateException();
1524	<	return new EntryIterator<K,V>(this);
3095	<	}
1515	>	/**
1516	>	* {@inheritDoc}
1517	>	*
1518	>	* @throws NullPointerException if the specified key is null
1519	>	*/
1520	>	public boolean remove(Object key, Object value) {
1521	>	if (key == null)
1522	>	throw new NullPointerException();
1523	>	return value != null && replaceNode(key, null, value) != null;
1524	>	}
1525
1526	<	@SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
1527	<	Object v;
1528	<	if ((v = nextVal) == null && (v = advance()) == null)
1529	<	throw new NoSuchElementException();
1530	<	Object k = nextKey;
1531	<	nextVal = null;
1532	<	return new MapEntry<K,V>((K)k, (V)v, map);
1533	<	}
1526	>	/**
1527	>	* {@inheritDoc}
1528	>	*
1529	>	* @throws NullPointerException if any of the arguments are null
1530	>	*/
1531	>	public boolean replace(K key, V oldValue, V newValue) {
1532	>	if (key == null || oldValue == null || newValue == null)
1533	>	throw new NullPointerException();
1534	>	return replaceNode(key, newValue, oldValue) != null;
1535		}
1536
1537		/**
1538	<	* Exported Entry for iterators
1538	>	* {@inheritDoc}
1539	>	*
1540	>	* @return the previous value associated with the specified key,
1541	>	*         or {@code null} if there was no mapping for the key
1542	>	* @throws NullPointerException if the specified key or value is null
1543		*/
1544	<	static final class MapEntry<K,V> implements Map.Entry<K, V> {
1545	<	final K key; // non-null
1546	<	V val;       // non-null
1547	<	final ConcurrentHashMap<K, V> map;
1548	<	MapEntry(K key, V val, ConcurrentHashMap<K, V> map) {
3115	<	this.key = key;
3116	<	this.val = val;
3117	<	this.map = map;
3118	<	}
3119	<	public final K getKey()       { return key; }
3120	<	public final V getValue()     { return val; }
3121	<	public final int hashCode()   { return key.hashCode() ^ val.hashCode(); }
3122	<	public final String toString(){ return key + "=" + val; }
1544	>	public V replace(K key, V value) {
1545	>	if (key == null || value == null)
1546	>	throw new NullPointerException();
1547	>	return replaceNode(key, value, null);
1548	>	}
1549
1550	<	public final boolean equals(Object o) {
3125	<	Object k, v; Map.Entry<?,?> e;
3126	<	return ((o instanceof Map.Entry) &&
3127	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3128	<	(v = e.getValue()) != null &&
3129	<	(k == key || k.equals(key)) &&
3130	<	(v == val || v.equals(val)));
3131	<	}
1550	>	// Overrides of JDK8+ Map extension method defaults
1551
1552	<	/**
1553	<	* Sets our entry's value and writes through to the map. The
1554	<	* value to return is somewhat arbitrary here. Since we do not
1555	<	* necessarily track asynchronous changes, the most recent
1556	<	* "previous" value could be different from what we return (or
1557	<	* could even have been removed in which case the put will
1558	<	* re-establish). We do not and cannot guarantee more.
1559	<	*/
1560	<	public final V setValue(V value) {
1561	<	if (value == null) throw new NullPointerException();
1562	<	V v = val;
1563	<	val = value;
1564	<	map.put(key, value);
1565	<	return v;
1552	>	/**
1553	>	* Returns the value to which the specified key is mapped, or the
1554	>	* given default value if this map contains no mapping for the
1555	>	* key.
1556	>	*
1557	>	* @param key the key whose associated value is to be returned
1558	>	* @param defaultValue the value to return if this map contains
1559	>	* no mapping for the given key
1560	>	* @return the mapping for the key, if present; else the default value
1561	>	* @throws NullPointerException if the specified key is null
1562	>	*/
1563	>	public V getOrDefault(Object key, V defaultValue) {
1564	>	V v;
1565	>	return (v = get(key)) == null ? defaultValue : v;
1566	>	}
1567	>
1568	>	public void forEach(BiConsumer<? super K, ? super V> action) {
1569	>	if (action == null) throw new NullPointerException();
1570	>	Node<K,V>[] t;
1571	>	if ((t = table) != null) {
1572	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1573	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1574	>	action.accept(p.key, p.val);
1575	>	}
1576		}
1577		}
1578
1579	<	/* ----------------Views -------------- */
1579	>	public void replaceAll(BiFunction<? super K, ? super V, ? extends V> function) {
1580	>	if (function == null) throw new NullPointerException();
1581	>	Node<K,V>[] t;
1582	>	if ((t = table) != null) {
1583	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1584	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1585	>	V oldValue = p.val;
1586	>	for (K key = p.key;;) {
1587	>	V newValue = function.apply(key, oldValue);
1588	>	if (newValue == null)
1589	>	throw new NullPointerException();
1590	>	if (replaceNode(key, newValue, oldValue) != null ||
1591	>	(oldValue = get(key)) == null)
1592	>	break;
1593	>	}
1594	>	}
1595	>	}
1596	>	}
1597
1598		/**
1599	<	* Base class for views.
1599	>	* Helper method for EntrySetView.removeIf.
1600		*/
1601	<	static abstract class CHMView<K, V> {
1602	<	final ConcurrentHashMap<K, V> map;
1603	<	CHMView(ConcurrentHashMap<K, V> map)  { this.map = map; }
1604	<	public final int size()                 { return map.size(); }
1605	<	public final boolean isEmpty()          { return map.isEmpty(); }
1606	<	public final void clear()               { map.clear(); }
1607	<
1608	<	// implementations below rely on concrete classes supplying these
1609	<	abstract public Iterator<?> iterator();
1610	<	abstract public boolean contains(Object o);
1611	<	abstract public boolean remove(Object o);
1612	<
1613	<	private static final String oomeMsg = "Required array size too large";
1601	>	boolean removeEntryIf(Predicate<? super Entry<K,V>> function) {
1602	>	if (function == null) throw new NullPointerException();
1603	>	Node<K,V>[] t;
1604	>	boolean removed = false;
1605	>	if ((t = table) != null) {
1606	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1607	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1608	>	K k = p.key;
1609	>	V v = p.val;
1610	>	Map.Entry<K,V> e = new AbstractMap.SimpleImmutableEntry<>(k, v);
1611	>	if (function.test(e) && replaceNode(k, null, v) != null)
1612	>	removed = true;
1613	>	}
1614	>	}
1615	>	return removed;
1616	>	}
1617
1618	<	public final Object[] toArray() {
1619	<	long sz = map.mappingCount();
1620	<	if (sz > (long)(MAX_ARRAY_SIZE))
1621	<	throw new OutOfMemoryError(oomeMsg);
1622	<	int n = (int)sz;
1623	<	Object[] r = new Object[n];
1624	<	int i = 0;
1625	<	Iterator<?> it = iterator();
1626	<	while (it.hasNext()) {
1627	<	if (i == n) {
1628	<	if (n >= MAX_ARRAY_SIZE)
1629	<	throw new OutOfMemoryError(oomeMsg);
1630	<	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
1631	<	n = MAX_ARRAY_SIZE;
3183	<	else
3184	<	n += (n >>> 1) + 1;
3185	<	r = Arrays.copyOf(r, n);
3186	<	}
3187	<	r[i++] = it.next();
1618	>	/**
1619	>	* Helper method for ValuesView.removeIf.
1620	>	*/
1621	>	boolean removeValueIf(Predicate<? super V> function) {
1622	>	if (function == null) throw new NullPointerException();
1623	>	Node<K,V>[] t;
1624	>	boolean removed = false;
1625	>	if ((t = table) != null) {
1626	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
1627	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
1628	>	K k = p.key;
1629	>	V v = p.val;
1630	>	if (function.test(v) && replaceNode(k, null, v) != null)
1631	>	removed = true;
1632		}
3189	–	return (i == n) ? r : Arrays.copyOf(r, i);
1633		}
1634	+	return removed;
1635	+	}
1636
1637	<	@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
1638	<	long sz = map.mappingCount();
1639	<	if (sz > (long)(MAX_ARRAY_SIZE))
1640	<	throw new OutOfMemoryError(oomeMsg);
1641	<	int m = (int)sz;
1642	<	T[] r = (a.length >= m) ? a :
1643	<	(T[])java.lang.reflect.Array
1644	<	.newInstance(a.getClass().getComponentType(), m);
1645	<	int n = r.length;
1646	<	int i = 0;
1647	<	Iterator<?> it = iterator();
1648	<	while (it.hasNext()) {
1649	<	if (i == n) {
1650	<	if (n >= MAX_ARRAY_SIZE)
1651	<	throw new OutOfMemoryError(oomeMsg);
1652	<	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
1653	<	n = MAX_ARRAY_SIZE;
1654	<	else
1655	<	n += (n >>> 1) + 1;
1656	<	r = Arrays.copyOf(r, n);
1637	>	/**
1638	>	* If the specified key is not already associated with a value,
1639	>	* attempts to compute its value using the given mapping function
1640	>	* and enters it into this map unless {@code null}.  The entire
1641	>	* method invocation is performed atomically, so the function is
1642	>	* applied at most once per key.  Some attempted update operations
1643	>	* on this map by other threads may be blocked while computation
1644	>	* is in progress, so the computation should be short and simple,
1645	>	* and must not attempt to update any other mappings of this map.
1646	>	*
1647	>	* @param key key with which the specified value is to be associated
1648	>	* @param mappingFunction the function to compute a value
1649	>	* @return the current (existing or computed) value associated with
1650	>	*         the specified key, or null if the computed value is null
1651	>	* @throws NullPointerException if the specified key or mappingFunction
1652	>	*         is null
1653	>	* @throws IllegalStateException if the computation detectably
1654	>	*         attempts a recursive update to this map that would
1655	>	*         otherwise never complete
1656	>	* @throws RuntimeException or Error if the mappingFunction does so,
1657	>	*         in which case the mapping is left unestablished
1658	>	*/
1659	>	public V computeIfAbsent(K key, Function<? super K, ? extends V> mappingFunction) {
1660	>	if (key == null || mappingFunction == null)
1661	>	throw new NullPointerException();
1662	>	int h = spread(key.hashCode());
1663	>	V val = null;
1664	>	int binCount = 0;
1665	>	for (Node<K,V>[] tab = table;;) {
1666	>	Node<K,V> f; int n, i, fh; K fk; V fv;
1667	>	if (tab == null || (n = tab.length) == 0)
1668	>	tab = initTable();
1669	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null) {
1670	>	Node<K,V> r = new ReservationNode<K,V>();
1671	>	synchronized (r) {
1672	>	if (casTabAt(tab, i, null, r)) {
1673	>	binCount = 1;
1674	>	Node<K,V> node = null;
1675	>	try {
1676	>	if ((val = mappingFunction.apply(key)) != null)
1677	>	node = new Node<K,V>(h, key, val);
1678	>	} finally {
1679	>	setTabAt(tab, i, node);
1680	>	}
1681	>	}
1682		}
1683	<	r[i++] = (T)it.next();
1683	>	if (binCount != 0)
1684	>	break;
1685		}
1686	<	if (a == r && i < n) {
1687	<	r[i] = null; // null-terminate
1688	<	return r;
1686	>	else if ((fh = f.hash) == MOVED)
1687	>	tab = helpTransfer(tab, f);
1688	>	else if (fh == h    // check first node without acquiring lock
1689	>	&& ((fk = f.key) == key || (fk != null && key.equals(fk)))
1690	>	&& (fv = f.val) != null)
1691	>	return fv;
1692	>	else {
1693	>	boolean added = false;
1694	>	synchronized (f) {
1695	>	if (tabAt(tab, i) == f) {
1696	>	if (fh >= 0) {
1697	>	binCount = 1;
1698	>	for (Node<K,V> e = f;; ++binCount) {
1699	>	K ek;
1700	>	if (e.hash == h &&
1701	>	((ek = e.key) == key ||
1702	>	(ek != null && key.equals(ek)))) {
1703	>	val = e.val;
1704	>	break;
1705	>	}
1706	>	Node<K,V> pred = e;
1707	>	if ((e = e.next) == null) {
1708	>	if ((val = mappingFunction.apply(key)) != null) {
1709	>	if (pred.next != null)
1710	>	throw new IllegalStateException("Recursive update");
1711	>	added = true;
1712	>	pred.next = new Node<K,V>(h, key, val);
1713	>	}
1714	>	break;
1715	>	}
1716	>	}
1717	>	}
1718	>	else if (f instanceof TreeBin) {
1719	>	binCount = 2;
1720	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1721	>	TreeNode<K,V> r, p;
1722	>	if ((r = t.root) != null &&
1723	>	(p = r.findTreeNode(h, key, null)) != null)
1724	>	val = p.val;
1725	>	else if ((val = mappingFunction.apply(key)) != null) {
1726	>	added = true;
1727	>	t.putTreeVal(h, key, val);
1728	>	}
1729	>	}
1730	>	else if (f instanceof ReservationNode)
1731	>	throw new IllegalStateException("Recursive update");
1732	>	}
1733	>	}
1734	>	if (binCount != 0) {
1735	>	if (binCount >= TREEIFY_THRESHOLD)
1736	>	treeifyBin(tab, i);
1737	>	if (!added)
1738	>	return val;
1739	>	break;
1740	>	}
1741		}
3219	–	return (i == n) ? r : Arrays.copyOf(r, i);
3220	–	}
3221	–
3222	–	public final int hashCode() {
3223	–	int h = 0;
3224	–	for (Iterator<?> it = iterator(); it.hasNext();)
3225	–	h += it.next().hashCode();
3226	–	return h;
1742		}
1743	+	if (val != null)
1744	+	addCount(1L, binCount);
1745	+	return val;
1746	+	}
1747
1748	<	public final String toString() {
1749	<	StringBuilder sb = new StringBuilder();
1750	<	sb.append('[');
1751	<	Iterator<?> it = iterator();
1752	<	if (it.hasNext()) {
1753	<	for (;;) {
1754	<	Object e = it.next();
1755	<	sb.append(e == this ? "(this Collection)" : e);
1756	<	if (!it.hasNext())
1757	<	break;
1758	<	sb.append(',').append(' ');
1748	>	/**
1749	>	* If the value for the specified key is present, attempts to
1750	>	* compute a new mapping given the key and its current mapped
1751	>	* value.  The entire method invocation is performed atomically.
1752	>	* Some attempted update operations on this map by other threads
1753	>	* may be blocked while computation is in progress, so the
1754	>	* computation should be short and simple, and must not attempt to
1755	>	* update any other mappings of this map.
1756	>	*
1757	>	* @param key key with which a value may be associated
1758	>	* @param remappingFunction the function to compute a value
1759	>	* @return the new value associated with the specified key, or null if none
1760	>	* @throws NullPointerException if the specified key or remappingFunction
1761	>	*         is null
1762	>	* @throws IllegalStateException if the computation detectably
1763	>	*         attempts a recursive update to this map that would
1764	>	*         otherwise never complete
1765	>	* @throws RuntimeException or Error if the remappingFunction does so,
1766	>	*         in which case the mapping is unchanged
1767	>	*/
1768	>	public V computeIfPresent(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) {
1769	>	if (key == null || remappingFunction == null)
1770	>	throw new NullPointerException();
1771	>	int h = spread(key.hashCode());
1772	>	V val = null;
1773	>	int delta = 0;
1774	>	int binCount = 0;
1775	>	for (Node<K,V>[] tab = table;;) {
1776	>	Node<K,V> f; int n, i, fh;
1777	>	if (tab == null || (n = tab.length) == 0)
1778	>	tab = initTable();
1779	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null)
1780	>	break;
1781	>	else if ((fh = f.hash) == MOVED)
1782	>	tab = helpTransfer(tab, f);
1783	>	else {
1784	>	synchronized (f) {
1785	>	if (tabAt(tab, i) == f) {
1786	>	if (fh >= 0) {
1787	>	binCount = 1;
1788	>	for (Node<K,V> e = f, pred = null;; ++binCount) {
1789	>	K ek;
1790	>	if (e.hash == h &&
1791	>	((ek = e.key) == key ||
1792	>	(ek != null && key.equals(ek)))) {
1793	>	val = remappingFunction.apply(key, e.val);
1794	>	if (val != null)
1795	>	e.val = val;
1796	>	else {
1797	>	delta = -1;
1798	>	Node<K,V> en = e.next;
1799	>	if (pred != null)
1800	>	pred.next = en;
1801	>	else
1802	>	setTabAt(tab, i, en);
1803	>	}
1804	>	break;
1805	>	}
1806	>	pred = e;
1807	>	if ((e = e.next) == null)
1808	>	break;
1809	>	}
1810	>	}
1811	>	else if (f instanceof TreeBin) {
1812	>	binCount = 2;
1813	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1814	>	TreeNode<K,V> r, p;
1815	>	if ((r = t.root) != null &&
1816	>	(p = r.findTreeNode(h, key, null)) != null) {
1817	>	val = remappingFunction.apply(key, p.val);
1818	>	if (val != null)
1819	>	p.val = val;
1820	>	else {
1821	>	delta = -1;
1822	>	if (t.removeTreeNode(p))
1823	>	setTabAt(tab, i, untreeify(t.first));
1824	>	}
1825	>	}
1826	>	}
1827	>	else if (f instanceof ReservationNode)
1828	>	throw new IllegalStateException("Recursive update");
1829	>	}
1830		}
1831	+	if (binCount != 0)
1832	+	break;
1833		}
3242	–	return sb.append(']').toString();
1834		}
1835	+	if (delta != 0)
1836	+	addCount((long)delta, binCount);
1837	+	return val;
1838	+	}
1839
1840	<	public final boolean containsAll(Collection<?> c) {
1841	<	if (c != this) {
1842	<	for (Iterator<?> it = c.iterator(); it.hasNext();) {
1843	<	Object e = it.next();
1844	<	if (e == null || !contains(e))
1845	<	return false;
1840	>	/**
1841	>	* Attempts to compute a mapping for the specified key and its
1842	>	* current mapped value (or {@code null} if there is no current
1843	>	* mapping). The entire method invocation is performed atomically.
1844	>	* Some attempted update operations on this map by other threads
1845	>	* may be blocked while computation is in progress, so the
1846	>	* computation should be short and simple, and must not attempt to
1847	>	* update any other mappings of this Map.
1848	>	*
1849	>	* @param key key with which the specified value is to be associated
1850	>	* @param remappingFunction the function to compute a value
1851	>	* @return the new value associated with the specified key, or null if none
1852	>	* @throws NullPointerException if the specified key or remappingFunction
1853	>	*         is null
1854	>	* @throws IllegalStateException if the computation detectably
1855	>	*         attempts a recursive update to this map that would
1856	>	*         otherwise never complete
1857	>	* @throws RuntimeException or Error if the remappingFunction does so,
1858	>	*         in which case the mapping is unchanged
1859	>	*/
1860	>	public V compute(K key,
1861	>	BiFunction<? super K, ? super V, ? extends V> remappingFunction) {
1862	>	if (key == null || remappingFunction == null)
1863	>	throw new NullPointerException();
1864	>	int h = spread(key.hashCode());
1865	>	V val = null;
1866	>	int delta = 0;
1867	>	int binCount = 0;
1868	>	for (Node<K,V>[] tab = table;;) {
1869	>	Node<K,V> f; int n, i, fh;
1870	>	if (tab == null || (n = tab.length) == 0)
1871	>	tab = initTable();
1872	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null) {
1873	>	Node<K,V> r = new ReservationNode<K,V>();
1874	>	synchronized (r) {
1875	>	if (casTabAt(tab, i, null, r)) {
1876	>	binCount = 1;
1877	>	Node<K,V> node = null;
1878	>	try {
1879	>	if ((val = remappingFunction.apply(key, null)) != null) {
1880	>	delta = 1;
1881	>	node = new Node<K,V>(h, key, val);
1882	>	}
1883	>	} finally {
1884	>	setTabAt(tab, i, node);
1885	>	}
1886	>	}
1887		}
1888	+	if (binCount != 0)
1889	+	break;
1890		}
1891	<	return true;
1892	<	}
1893	<
1894	<	public final boolean removeAll(Collection<?> c) {
1895	<	boolean modified = false;
1896	<	for (Iterator<?> it = iterator(); it.hasNext();) {
1897	<	if (c.contains(it.next())) {
1898	<	it.remove();
1899	<	modified = true;
1891	>	else if ((fh = f.hash) == MOVED)
1892	>	tab = helpTransfer(tab, f);
1893	>	else {
1894	>	synchronized (f) {
1895	>	if (tabAt(tab, i) == f) {
1896	>	if (fh >= 0) {
1897	>	binCount = 1;
1898	>	for (Node<K,V> e = f, pred = null;; ++binCount) {
1899	>	K ek;
1900	>	if (e.hash == h &&
1901	>	((ek = e.key) == key ||
1902	>	(ek != null && key.equals(ek)))) {
1903	>	val = remappingFunction.apply(key, e.val);
1904	>	if (val != null)
1905	>	e.val = val;
1906	>	else {
1907	>	delta = -1;
1908	>	Node<K,V> en = e.next;
1909	>	if (pred != null)
1910	>	pred.next = en;
1911	>	else
1912	>	setTabAt(tab, i, en);
1913	>	}
1914	>	break;
1915	>	}
1916	>	pred = e;
1917	>	if ((e = e.next) == null) {
1918	>	val = remappingFunction.apply(key, null);
1919	>	if (val != null) {
1920	>	if (pred.next != null)
1921	>	throw new IllegalStateException("Recursive update");
1922	>	delta = 1;
1923	>	pred.next = new Node<K,V>(h, key, val);
1924	>	}
1925	>	break;
1926	>	}
1927	>	}
1928	>	}
1929	>	else if (f instanceof TreeBin) {
1930	>	binCount = 1;
1931	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
1932	>	TreeNode<K,V> r, p;
1933	>	if ((r = t.root) != null)
1934	>	p = r.findTreeNode(h, key, null);
1935	>	else
1936	>	p = null;
1937	>	V pv = (p == null) ? null : p.val;
1938	>	val = remappingFunction.apply(key, pv);
1939	>	if (val != null) {
1940	>	if (p != null)
1941	>	p.val = val;
1942	>	else {
1943	>	delta = 1;
1944	>	t.putTreeVal(h, key, val);
1945	>	}
1946	>	}
1947	>	else if (p != null) {
1948	>	delta = -1;
1949	>	if (t.removeTreeNode(p))
1950	>	setTabAt(tab, i, untreeify(t.first));
1951	>	}
1952	>	}
1953	>	else if (f instanceof ReservationNode)
1954	>	throw new IllegalStateException("Recursive update");
1955	>	}
1956	>	}
1957	>	if (binCount != 0) {
1958	>	if (binCount >= TREEIFY_THRESHOLD)
1959	>	treeifyBin(tab, i);
1960	>	break;
1961		}
1962		}
3264	–	return modified;
1963		}
1964	+	if (delta != 0)
1965	+	addCount((long)delta, binCount);
1966	+	return val;
1967	+	}
1968
1969	<	public final boolean retainAll(Collection<?> c) {
1970	<	boolean modified = false;
1971	<	for (Iterator<?> it = iterator(); it.hasNext();) {
1972	<	if (!c.contains(it.next())) {
1973	<	it.remove();
1974	<	modified = true;
1969	>	/**
1970	>	* If the specified key is not already associated with a
1971	>	* (non-null) value, associates it with the given value.
1972	>	* Otherwise, replaces the value with the results of the given
1973	>	* remapping function, or removes if {@code null}. The entire
1974	>	* method invocation is performed atomically.  Some attempted
1975	>	* update operations on this map by other threads may be blocked
1976	>	* while computation is in progress, so the computation should be
1977	>	* short and simple, and must not attempt to update any other
1978	>	* mappings of this Map.
1979	>	*
1980	>	* @param key key with which the specified value is to be associated
1981	>	* @param value the value to use if absent
1982	>	* @param remappingFunction the function to recompute a value if present
1983	>	* @return the new value associated with the specified key, or null if none
1984	>	* @throws NullPointerException if the specified key or the
1985	>	*         remappingFunction is null
1986	>	* @throws RuntimeException or Error if the remappingFunction does so,
1987	>	*         in which case the mapping is unchanged
1988	>	*/
1989	>	public V merge(K key, V value, BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
1990	>	if (key == null || value == null || remappingFunction == null)
1991	>	throw new NullPointerException();
1992	>	int h = spread(key.hashCode());
1993	>	V val = null;
1994	>	int delta = 0;
1995	>	int binCount = 0;
1996	>	for (Node<K,V>[] tab = table;;) {
1997	>	Node<K,V> f; int n, i, fh;
1998	>	if (tab == null || (n = tab.length) == 0)
1999	>	tab = initTable();
2000	>	else if ((f = tabAt(tab, i = (n - 1) & h)) == null) {
2001	>	if (casTabAt(tab, i, null, new Node<K,V>(h, key, value))) {
2002	>	delta = 1;
2003	>	val = value;
2004	>	break;
2005	>	}
2006	>	}
2007	>	else if ((fh = f.hash) == MOVED)
2008	>	tab = helpTransfer(tab, f);
2009	>	else {
2010	>	synchronized (f) {
2011	>	if (tabAt(tab, i) == f) {
2012	>	if (fh >= 0) {
2013	>	binCount = 1;
2014	>	for (Node<K,V> e = f, pred = null;; ++binCount) {
2015	>	K ek;
2016	>	if (e.hash == h &&
2017	>	((ek = e.key) == key ||
2018	>	(ek != null && key.equals(ek)))) {
2019	>	val = remappingFunction.apply(e.val, value);
2020	>	if (val != null)
2021	>	e.val = val;
2022	>	else {
2023	>	delta = -1;
2024	>	Node<K,V> en = e.next;
2025	>	if (pred != null)
2026	>	pred.next = en;
2027	>	else
2028	>	setTabAt(tab, i, en);
2029	>	}
2030	>	break;
2031	>	}
2032	>	pred = e;
2033	>	if ((e = e.next) == null) {
2034	>	delta = 1;
2035	>	val = value;
2036	>	pred.next = new Node<K,V>(h, key, val);
2037	>	break;
2038	>	}
2039	>	}
2040	>	}
2041	>	else if (f instanceof TreeBin) {
2042	>	binCount = 2;
2043	>	TreeBin<K,V> t = (TreeBin<K,V>)f;
2044	>	TreeNode<K,V> r = t.root;
2045	>	TreeNode<K,V> p = (r == null) ? null :
2046	>	r.findTreeNode(h, key, null);
2047	>	val = (p == null) ? value :
2048	>	remappingFunction.apply(p.val, value);
2049	>	if (val != null) {
2050	>	if (p != null)
2051	>	p.val = val;
2052	>	else {
2053	>	delta = 1;
2054	>	t.putTreeVal(h, key, val);
2055	>	}
2056	>	}
2057	>	else if (p != null) {
2058	>	delta = -1;
2059	>	if (t.removeTreeNode(p))
2060	>	setTabAt(tab, i, untreeify(t.first));
2061	>	}
2062	>	}
2063	>	else if (f instanceof ReservationNode)
2064	>	throw new IllegalStateException("Recursive update");
2065	>	}
2066	>	}
2067	>	if (binCount != 0) {
2068	>	if (binCount >= TREEIFY_THRESHOLD)
2069	>	treeifyBin(tab, i);
2070	>	break;
2071		}
2072		}
3275	–	return modified;
2073		}
2074	+	if (delta != 0)
2075	+	addCount((long)delta, binCount);
2076	+	return val;
2077	+	}
2078	+
2079	+	// Hashtable legacy methods
2080
2081	+	/**
2082	+	* Tests if some key maps into the specified value in this table.
2083	+	*
2084	+	* <p>Note that this method is identical in functionality to
2085	+	* {@link #containsValue(Object)}, and exists solely to ensure
2086	+	* full compatibility with class {@link java.util.Hashtable},
2087	+	* which supported this method prior to introduction of the
2088	+	* Java Collections Framework.
2089	+	*
2090	+	* @param  value a value to search for
2091	+	* @return {@code true} if and only if some key maps to the
2092	+	*         {@code value} argument in this table as
2093	+	*         determined by the {@code equals} method;
2094	+	*         {@code false} otherwise
2095	+	* @throws NullPointerException if the specified value is null
2096	+	*/
2097	+	public boolean contains(Object value) {
2098	+	return containsValue(value);
2099		}
2100
2101	<	static final class KeySet<K,V> extends CHMView<K,V> implements Set<K> {
2102	<	KeySet(ConcurrentHashMap<K, V> map)  {
2103	<	super(map);
2104	<	}
2105	<	public final boolean contains(Object o) { return map.containsKey(o); }
2106	<	public final boolean remove(Object o)   { return map.remove(o) != null; }
2107	<	public final Iterator<K> iterator() {
2108	<	return new KeyIterator<K,V>(map);
2109	<	}
2110	<	public final boolean add(K e) {
3290	<	throw new UnsupportedOperationException();
3291	<	}
3292	<	public final boolean addAll(Collection<? extends K> c) {
3293	<	throw new UnsupportedOperationException();
3294	<	}
3295	<	public boolean equals(Object o) {
3296	<	Set<?> c;
3297	<	return ((o instanceof Set) &&
3298	<	((c = (Set<?>)o) == this ||
3299	<	(containsAll(c) && c.containsAll(this))));
3300	<	}
2101	>	/**
2102	>	* Returns an enumeration of the keys in this table.
2103	>	*
2104	>	* @return an enumeration of the keys in this table
2105	>	* @see #keySet()
2106	>	*/
2107	>	public Enumeration<K> keys() {
2108	>	Node<K,V>[] t;
2109	>	int f = (t = table) == null ? 0 : t.length;
2110	>	return new KeyIterator<K,V>(t, f, 0, f, this);
2111		}
2112
2113	+	/**
2114	+	* Returns an enumeration of the values in this table.
2115	+	*
2116	+	* @return an enumeration of the values in this table
2117	+	* @see #values()
2118	+	*/
2119	+	public Enumeration<V> elements() {
2120	+	Node<K,V>[] t;
2121	+	int f = (t = table) == null ? 0 : t.length;
2122	+	return new ValueIterator<K,V>(t, f, 0, f, this);
2123	+	}
2124
2125	<	static final class Values<K,V> extends CHMView<K,V>
2126	<	implements Collection<V> {
2127	<	Values(ConcurrentHashMap<K, V> map)   { super(map); }
2128	<	public final boolean contains(Object o) { return map.containsValue(o); }
2129	<	public final boolean remove(Object o) {
2130	<	if (o != null) {
2131	<	Iterator<V> it = new ValueIterator<K,V>(map);
2132	<	while (it.hasNext()) {
2133	<	if (o.equals(it.next())) {
2134	<	it.remove();
2135	<	return true;
2125	>	// ConcurrentHashMap-only methods
2126	>
2127	>	/**
2128	>	* Returns the number of mappings. This method should be used
2129	>	* instead of {@link #size} because a ConcurrentHashMap may
2130	>	* contain more mappings than can be represented as an int. The
2131	>	* value returned is an estimate; the actual count may differ if
2132	>	* there are concurrent insertions or removals.
2133	>	*
2134	>	* @return the number of mappings
2135	>	* @since 1.8
2136	>	*/
2137	>	public long mappingCount() {
2138	>	long n = sumCount();
2139	>	return (n < 0L) ? 0L : n; // ignore transient negative values
2140	>	}
2141	>
2142	>	/**
2143	>	* Creates a new {@link Set} backed by a ConcurrentHashMap
2144	>	* from the given type to {@code Boolean.TRUE}.
2145	>	*
2146	>	* @param <K> the element type of the returned set
2147	>	* @return the new set
2148	>	* @since 1.8
2149	>	*/
2150	>	public static <K> KeySetView<K,Boolean> newKeySet() {
2151	>	return new KeySetView<K,Boolean>
2152	>	(new ConcurrentHashMap<K,Boolean>(), Boolean.TRUE);
2153	>	}
2154	>
2155	>	/**
2156	>	* Creates a new {@link Set} backed by a ConcurrentHashMap
2157	>	* from the given type to {@code Boolean.TRUE}.
2158	>	*
2159	>	* @param initialCapacity The implementation performs internal
2160	>	* sizing to accommodate this many elements.
2161	>	* @param <K> the element type of the returned set
2162	>	* @return the new set
2163	>	* @throws IllegalArgumentException if the initial capacity of
2164	>	* elements is negative
2165	>	* @since 1.8
2166	>	*/
2167	>	public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
2168	>	return new KeySetView<K,Boolean>
2169	>	(new ConcurrentHashMap<K,Boolean>(initialCapacity), Boolean.TRUE);
2170	>	}
2171	>
2172	>	/**
2173	>	* Returns a {@link Set} view of the keys in this map, using the
2174	>	* given common mapped value for any additions (i.e., {@link
2175	>	* Collection#add} and {@link Collection#addAll(Collection)}).
2176	>	* This is of course only appropriate if it is acceptable to use
2177	>	* the same value for all additions from this view.
2178	>	*
2179	>	* @param mappedValue the mapped value to use for any additions
2180	>	* @return the set view
2181	>	* @throws NullPointerException if the mappedValue is null
2182	>	*/
2183	>	public KeySetView<K,V> keySet(V mappedValue) {
2184	>	if (mappedValue == null)
2185	>	throw new NullPointerException();
2186	>	return new KeySetView<K,V>(this, mappedValue);
2187	>	}
2188	>
2189	>	/* ---------------- Special Nodes -------------- */
2190	>
2191	>	/**
2192	>	* A node inserted at head of bins during transfer operations.
2193	>	*/
2194	>	static final class ForwardingNode<K,V> extends Node<K,V> {
2195	>	final Node<K,V>[] nextTable;
2196	>	ForwardingNode(Node<K,V>[] tab) {
2197	>	super(MOVED, null, null);
2198	>	this.nextTable = tab;
2199	>	}
2200	>
2201	>	Node<K,V> find(int h, Object k) {
2202	>	// loop to avoid arbitrarily deep recursion on forwarding nodes
2203	>	outer: for (Node<K,V>[] tab = nextTable;;) {
2204	>	Node<K,V> e; int n;
2205	>	if (k == null || tab == null || (n = tab.length) == 0 ||
2206	>	(e = tabAt(tab, (n - 1) & h)) == null)
2207	>	return null;
2208	>	for (;;) {
2209	>	int eh; K ek;
2210	>	if ((eh = e.hash) == h &&
2211	>	((ek = e.key) == k || (ek != null && k.equals(ek))))
2212	>	return e;
2213	>	if (eh < 0) {
2214	>	if (e instanceof ForwardingNode) {
2215	>	tab = ((ForwardingNode<K,V>)e).nextTable;
2216	>	continue outer;
2217	>	}
2218	>	else
2219	>	return e.find(h, k);
2220		}
2221	+	if ((e = e.next) == null)
2222	+	return null;
2223		}
2224		}
3318	–	return false;
3319	–	}
3320	–	public final Iterator<V> iterator() {
3321	–	return new ValueIterator<K,V>(map);
2225		}
3323	–	public final boolean add(V e) {
3324	–	throw new UnsupportedOperationException();
3325	–	}
3326	–	public final boolean addAll(Collection<? extends V> c) {
3327	–	throw new UnsupportedOperationException();
3328	–	}
3329	–
2226		}
2227
2228	<	static final class EntrySet<K,V> extends CHMView<K,V>
2229	<	implements Set<Map.Entry<K,V>> {
2230	<	EntrySet(ConcurrentHashMap<K, V> map) { super(map); }
2231	<	public final boolean contains(Object o) {
2232	<	Object k, v, r; Map.Entry<?,?> e;
2233	<	return ((o instanceof Map.Entry) &&
3338	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3339	<	(r = map.get(k)) != null &&
3340	<	(v = e.getValue()) != null &&
3341	<	(v == r || v.equals(r)));
3342	<	}
3343	<	public final boolean remove(Object o) {
3344	<	Object k, v; Map.Entry<?,?> e;
3345	<	return ((o instanceof Map.Entry) &&
3346	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3347	<	(v = e.getValue()) != null &&
3348	<	map.remove(k, v));
3349	<	}
3350	<	public final Iterator<Map.Entry<K,V>> iterator() {
3351	<	return new EntryIterator<K,V>(map);
3352	<	}
3353	<	public final boolean add(Entry<K,V> e) {
3354	<	throw new UnsupportedOperationException();
3355	<	}
3356	<	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
3357	<	throw new UnsupportedOperationException();
2228	>	/**
2229	>	* A place-holder node used in computeIfAbsent and compute.
2230	>	*/
2231	>	static final class ReservationNode<K,V> extends Node<K,V> {
2232	>	ReservationNode() {
2233	>	super(RESERVED, null, null);
2234		}
2235	<	public boolean equals(Object o) {
2236	<	Set<?> c;
2237	<	return ((o instanceof Set) &&
3362	<	((c = (Set<?>)o) == this ||
3363	<	(containsAll(c) && c.containsAll(this))));
2235	>
2236	>	Node<K,V> find(int h, Object k) {
2237	>	return null;
2238		}
2239		}
2240
2241	<	/* ---------------- Serialization Support -------------- */
2241	>	/* ---------------- Table Initialization and Resizing -------------- */
2242
2243		/**
2244	<	* Stripped-down version of helper class used in previous version,
2245	<	* declared for the sake of serialization compatibility
2244	>	* Returns the stamp bits for resizing a table of size n.
2245	>	* Must be negative when shifted left by RESIZE_STAMP_SHIFT.
2246		*/
2247	<	static class Segment<K,V> implements Serializable {
2248	<	private static final long serialVersionUID = 2249069246763182397L;
3375	<	final float loadFactor;
3376	<	Segment(float lf) { this.loadFactor = lf; }
2247	>	static final int resizeStamp(int n) {
2248	>	return Integer.numberOfLeadingZeros(n) | (1 << (RESIZE_STAMP_BITS - 1));
2249		}
2250
2251		/**
2252	<	* Saves the state of the {@code ConcurrentHashMap} instance to a
3381	<	* stream (i.e., serializes it).
3382	<	* @param s the stream
3383	<	* @serialData
3384	<	* the key (Object) and value (Object)
3385	<	* for each key-value mapping, followed by a null pair.
3386	<	* The key-value mappings are emitted in no particular order.
2252	>	* Initializes table, using the size recorded in sizeCtl.
2253		*/
2254	<	@SuppressWarnings("unchecked") private void writeObject(java.io.ObjectOutputStream s)
2255	<	throws java.io.IOException {
2256	<	if (segments == null) { // for serialization compatibility
2257	<	segments = (Segment<K,V>[])
2258	<	new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
2259	<	for (int i = 0; i < segments.length; ++i)
2260	<	segments[i] = new Segment<K,V>(LOAD_FACTOR);
2261	<	}
2262	<	s.defaultWriteObject();
2263	<	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2264	<	Object v;
2265	<	while ((v = it.advance()) != null) {
2266	<	s.writeObject(it.nextKey);
2267	<	s.writeObject(v);
2254	>	private final Node<K,V>[] initTable() {
2255	>	Node<K,V>[] tab; int sc;
2256	>	while ((tab = table) == null || tab.length == 0) {
2257	>	if ((sc = sizeCtl) < 0)
2258	>	Thread.yield(); // lost initialization race; just spin
2259	>	else if (U.compareAndSetInt(this, SIZECTL, sc, -1)) {
2260	>	try {
2261	>	if ((tab = table) == null || tab.length == 0) {
2262	>	int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
2263	>	@SuppressWarnings("unchecked")
2264	>	Node<K,V>[] nt = (Node<K,V>[])new Node<?,?>[n];
2265	>	table = tab = nt;
2266	>	sc = n - (n >>> 2);
2267	>	}
2268	>	} finally {
2269	>	sizeCtl = sc;
2270	>	}
2271	>	break;
2272	>	}
2273		}
2274	<	s.writeObject(null);
3404	<	s.writeObject(null);
3405	<	segments = null; // throw away
2274	>	return tab;
2275		}
2276
2277		/**
2278	<	* Reconstitutes the instance from a stream (that is, deserializes it).
2279	<	* @param s the stream
2278	>	* Adds to count, and if table is too small and not already
2279	>	* resizing, initiates transfer. If already resizing, helps
2280	>	* perform transfer if work is available.  Rechecks occupancy
2281	>	* after a transfer to see if another resize is already needed
2282	>	* because resizings are lagging additions.
2283	>	*
2284	>	* @param x the count to add
2285	>	* @param check if <0, don't check resize, if <= 1 only check if uncontended
2286	>	*/
2287	>	private final void addCount(long x, int check) {
2288	>	CounterCell[] cs; long b, s;
2289	>	if ((cs = counterCells) != null ||
2290	>	!U.compareAndSetLong(this, BASECOUNT, b = baseCount, s = b + x)) {
2291	>	CounterCell c; long v; int m;
2292	>	boolean uncontended = true;
2293	>	if (cs == null || (m = cs.length - 1) < 0 ||
2294	>	(c = cs[ThreadLocalRandom.getProbe() & m]) == null ||
2295	>	!(uncontended =
2296	>	U.compareAndSetLong(c, CELLVALUE, v = c.value, v + x))) {
2297	>	fullAddCount(x, uncontended);
2298	>	return;
2299	>	}
2300	>	if (check <= 1)
2301	>	return;
2302	>	s = sumCount();
2303	>	}
2304	>	if (check >= 0) {
2305	>	Node<K,V>[] tab, nt; int n, sc;
2306	>	while (s >= (long)(sc = sizeCtl) && (tab = table) != null &&
2307	>	(n = tab.length) < MAXIMUM_CAPACITY) {
2308	>	int rs = resizeStamp(n) << RESIZE_STAMP_SHIFT;
2309	>	if (sc < 0) {
2310	>	if (sc == rs + MAX_RESIZERS || sc == rs + 1 ||
2311	>	(nt = nextTable) == null || transferIndex <= 0)
2312	>	break;
2313	>	if (U.compareAndSetInt(this, SIZECTL, sc, sc + 1))
2314	>	transfer(tab, nt);
2315	>	}
2316	>	else if (U.compareAndSetInt(this, SIZECTL, sc, rs + 2))
2317	>	transfer(tab, null);
2318	>	s = sumCount();
2319	>	}
2320	>	}
2321	>	}
2322	>
2323	>	/**
2324	>	* Helps transfer if a resize is in progress.
2325		*/
2326	<	@SuppressWarnings("unchecked") private void readObject(java.io.ObjectInputStream s)
2327	<	throws java.io.IOException, ClassNotFoundException {
2328	<	s.defaultReadObject();
2329	<	this.segments = null; // unneeded
2330	<	// initialize transient final field
2331	<	UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder());
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) << RESIZE_STAMP_SHIFT;
2331	>	while (nextTab == nextTable && table == tab &&
2332	>	(sc = sizeCtl) < 0) {
2333	>	if (sc == rs + MAX_RESIZERS || sc == rs + 1 ||
2334	>	transferIndex <= 0)
2335	>	break;
2336	>	if (U.compareAndSetInt(this, SIZECTL, sc, sc + 1)) {
2337	>	transfer(tab, nextTab);
2338	>	break;
2339	>	}
2340	>	}
2341	>	return nextTab;
2342	>	}
2343	>	return table;
2344	>	}
2345
2346	<	// Create all nodes, then place in table once size is known
2347	<	long size = 0L;
2348	<	Node p = null;
2349	<	for (;;) {
2350	<	K k = (K) s.readObject();
2351	<	V v = (V) s.readObject();
2352	<	if (k != null && v != null) {
2353	<	int h = spread(k.hashCode());
2354	<	p = new Node(h, k, v, p);
2355	<	++size;
2346	>	/**
2347	>	* Tries to presize table to accommodate the given number of elements.
2348	>	*
2349	>	* @param size number of elements (doesn't need to be perfectly accurate)
2350	>	*/
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.compareAndSetInt(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
2372	>	else if (c <= sc || n >= MAXIMUM_CAPACITY)
2373		break;
2374	+	else if (tab == table) {
2375	+	int rs = resizeStamp(n);
2376	+	if (U.compareAndSetInt(this, SIZECTL, sc,
2377	+	(rs << RESIZE_STAMP_SHIFT) + 2))
2378	+	transfer(tab, null);
2379	+	}
2380		}
2381	<	if (p != null) {
2382	<	boolean init = false;
2383	<	int n;
2384	<	if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
2385	<	n = MAXIMUM_CAPACITY;
2386	<	else {
2387	<	int sz = (int)size;
2388	<	n = tableSizeFor(sz + (sz >>> 1) + 1);
2381	>	}
2382	>
2383	>	/**
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.compareAndSetInt
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.compareAndSetInt(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	<	int sc = sizeCtl;
2442	<	boolean collide = false;
2443	<	if (n > sc &&
2444	<	UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
2445	<	try {
2446	<	if (table == null) {
2447	<	init = true;
2448	<	Node[] tab = new Node[n];
2449	<	int mask = n - 1;
2450	<	while (p != null) {
2451	<	int j = p.hash & mask;
2452	<	Node next = p.next;
2453	<	Node q = p.next = tabAt(tab, j);
2454	<	setTabAt(tab, j, p);
2455	<	if (!collide && q != null && q.hash == p.hash)
2456	<	collide = true;
2457	<	p = next;
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	<	table = tab;
2480	<	counter.add(size);
2481	<	sc = n - (n >>> 2);
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	>	else if (f instanceof ReservationNode)
2515	>	throw new IllegalStateException("Recursive update");
2516		}
3464	–	} finally {
3465	–	sizeCtl = sc;
2517		}
2518	<	if (collide) { // rescan and convert to TreeBins
2519	<	Node[] tab = table;
2520	<	for (int i = 0; i < tab.length; ++i) {
2521	<	int c = 0;
2522	<	for (Node e = tabAt(tab, i); e != null; e = e.next) {
2523	<	if (++c > TREE_THRESHOLD &&
2524	<	(e.key instanceof Comparable)) {
2525	<	replaceWithTreeBin(tab, i, e.key);
2526	<	break;
2518	>	}
2519	>	}
2520	>	}
2521	>
2522	>	/* ---------------- Counter support -------------- */
2523	>
2524	>	/**
2525	>	* A padded cell for distributing counts.  Adapted from LongAdder
2526	>	* and Striped64.  See their internal docs for explanation.
2527	>	*/
2528	>	@jdk.internal.vm.annotation.Contended static final class CounterCell {
2529	>	volatile long value;
2530	>	CounterCell(long x) { value = x; }
2531	>	}
2532	>
2533	>	final long sumCount() {
2534	>	CounterCell[] cs = counterCells;
2535	>	long sum = baseCount;
2536	>	if (cs != null) {
2537	>	for (CounterCell c : cs)
2538	>	if (c != null)
2539	>	sum += c.value;
2540	>	}
2541	>	return sum;
2542	>	}
2543	>
2544	>	// See LongAdder version for explanation
2545	>	private final void fullAddCount(long x, boolean wasUncontended) {
2546	>	int h;
2547	>	if ((h = ThreadLocalRandom.getProbe()) == 0) {
2548	>	ThreadLocalRandom.localInit();      // force initialization
2549	>	h = ThreadLocalRandom.getProbe();
2550	>	wasUncontended = true;
2551	>	}
2552	>	boolean collide = false;                // True if last slot nonempty
2553	>	for (;;) {
2554	>	CounterCell[] cs; CounterCell c; int n; long v;
2555	>	if ((cs = counterCells) != null && (n = cs.length) > 0) {
2556	>	if ((c = cs[(n - 1) & h]) == null) {
2557	>	if (cellsBusy == 0) {            // Try to attach new Cell
2558	>	CounterCell r = new CounterCell(x); // Optimistic create
2559	>	if (cellsBusy == 0 &&
2560	>	U.compareAndSetInt(this, CELLSBUSY, 0, 1)) {
2561	>	boolean created = false;
2562	>	try {               // Recheck under lock
2563	>	CounterCell[] rs; int m, j;
2564	>	if ((rs = counterCells) != null &&
2565	>	(m = rs.length) > 0 &&
2566	>	rs[j = (m - 1) & h] == null) {
2567	>	rs[j] = r;
2568	>	created = true;
2569	>	}
2570	>	} finally {
2571	>	cellsBusy = 0;
2572		}
2573	+	if (created)
2574	+	break;
2575	+	continue;           // Slot is now non-empty
2576		}
2577		}
2578	+	collide = false;
2579		}
2580	+	else if (!wasUncontended)       // CAS already known to fail
2581	+	wasUncontended = true;      // Continue after rehash
2582	+	else if (U.compareAndSetLong(c, CELLVALUE, v = c.value, v + x))
2583	+	break;
2584	+	else if (counterCells != cs || n >= NCPU)
2585	+	collide = false;            // At max size or stale
2586	+	else if (!collide)
2587	+	collide = true;
2588	+	else if (cellsBusy == 0 &&
2589	+	U.compareAndSetInt(this, CELLSBUSY, 0, 1)) {
2590	+	try {
2591	+	if (counterCells == cs) // Expand table unless stale
2592	+	counterCells = Arrays.copyOf(cs, n << 1);
2593	+	} finally {
2594	+	cellsBusy = 0;
2595	+	}
2596	+	collide = false;
2597	+	continue;                   // Retry with expanded table
2598	+	}
2599	+	h = ThreadLocalRandom.advanceProbe(h);
2600		}
2601	<	if (!init) { // Can only happen if unsafely published.
2602	<	while (p != null) {
2603	<	internalPut(p.key, p.val);
2604	<	p = p.next;
2601	>	else if (cellsBusy == 0 && counterCells == cs &&
2602	>	U.compareAndSetInt(this, CELLSBUSY, 0, 1)) {
2603	>	boolean init = false;
2604	>	try {                           // Initialize table
2605	>	if (counterCells == cs) {
2606	>	CounterCell[] rs = new CounterCell[2];
2607	>	rs[h & 1] = new CounterCell(x);
2608	>	counterCells = rs;
2609	>	init = true;
2610	>	}
2611	>	} finally {
2612	>	cellsBusy = 0;
2613		}
2614	+	if (init)
2615	+	break;
2616		}
2617	+	else if (U.compareAndSetLong(this, BASECOUNT, v = baseCount, v + x))
2618	+	break;                          // Fall back on using base
2619		}
2620		}
2621
2622	+	/* ---------------- Conversion from/to TreeBins -------------- */
2623
2624	<	// -------------------------------------------------------
2625	<
2626	<	// Sams
2627	<	/** Interface describing a void action of one argument */
2628	<	public interface Action<A> { void apply(A a); }
2629	<	/** Interface describing a void action of two arguments */
2630	<	public interface BiAction<A,B> { void apply(A a, B b); }
2631	<	/** Interface describing a function of one argument */
2632	<	public interface Fun<A,T> { T apply(A a); }
2633	<	/** Interface describing a function of two arguments */
2634	<	public interface BiFun<A,B,T> { T apply(A a, B b); }
2635	<	/** Interface describing a function of no arguments */
2636	<	public interface Generator<T> { T apply(); }
2637	<	/** Interface describing a function mapping its argument to a double */
2638	<	public interface ObjectToDouble<A> { double apply(A a); }
2639	<	/** Interface describing a function mapping its argument to a long */
2640	<	public interface ObjectToLong<A> { long apply(A a); }
2641	<	/** Interface describing a function mapping its argument to an int */
2642	<	public interface ObjectToInt<A> {int apply(A a); }
2643	<	/** Interface describing a function mapping two arguments to a double */
2644	<	public interface ObjectByObjectToDouble<A,B> { double apply(A a, B b); }
2645	<	/** Interface describing a function mapping two arguments to a long */
2646	<	public interface ObjectByObjectToLong<A,B> { long apply(A a, B b); }
2647	<	/** Interface describing a function mapping two arguments to an int */
2648	<	public interface ObjectByObjectToInt<A,B> {int apply(A a, B b); }
2649	<	/** Interface describing a function mapping a double to a double */
2650	<	public interface DoubleToDouble { double apply(double a); }
2651	<	/** Interface describing a function mapping a long to a long */
2652	<	public interface LongToLong { long apply(long a); }
3520	<	/** Interface describing a function mapping an int to an int */
3521	<	public interface IntToInt { int apply(int a); }
3522	<	/** Interface describing a function mapping two doubles to a double */
3523	<	public interface DoubleByDoubleToDouble { double apply(double a, double b); }
3524	<	/** Interface describing a function mapping two longs to a long */
3525	<	public interface LongByLongToLong { long apply(long a, long b); }
3526	<	/** Interface describing a function mapping two ints to an int */
3527	<	public interface IntByIntToInt { int apply(int a, int b); }
3528	<
3529	<
3530	<	// -------------------------------------------------------
2624	>	/**
2625	>	* Replaces all linked nodes in bin at given index unless table is
2626	>	* too small, in which case resizes instead.
2627	>	*/
2628	>	private final void treeifyBin(Node<K,V>[] tab, int index) {
2629	>	Node<K,V> b; int n;
2630	>	if (tab != null) {
2631	>	if ((n = tab.length) < MIN_TREEIFY_CAPACITY)
2632	>	tryPresize(n << 1);
2633	>	else if ((b = tabAt(tab, index)) != null && b.hash >= 0) {
2634	>	synchronized (b) {
2635	>	if (tabAt(tab, index) == b) {
2636	>	TreeNode<K,V> hd = null, tl = null;
2637	>	for (Node<K,V> e = b; e != null; e = e.next) {
2638	>	TreeNode<K,V> p =
2639	>	new TreeNode<K,V>(e.hash, e.key, e.val,
2640	>	null, null);
2641	>	if ((p.prev = tl) == null)
2642	>	hd = p;
2643	>	else
2644	>	tl.next = p;
2645	>	tl = p;
2646	>	}
2647	>	setTabAt(tab, index, new TreeBin<K,V>(hd));
2648	>	}
2649	>	}
2650	>	}
2651	>	}
2652	>	}
2653
2654		/**
2655	<	* Returns an extended {@link Parallel} view of this map using the
3534	<	* given executor for bulk parallel operations.
3535	<	*
3536	<	* @param executor the executor
3537	<	* @return a parallel view
2655	>	* Returns a list of non-TreeNodes replacing those in given list.
2656		*/
2657	<	public Parallel parallel(ForkJoinPool executor)  {
2658	<	return new Parallel(executor);
2657	>	static <K,V> Node<K,V> untreeify(Node<K,V> b) {
2658	>	Node<K,V> hd = null, tl = null;
2659	>	for (Node<K,V> q = b; q != null; q = q.next) {
2660	>	Node<K,V> p = new Node<K,V>(q.hash, q.key, q.val);
2661	>	if (tl == null)
2662	>	hd = p;
2663	>	else
2664	>	tl.next = p;
2665	>	tl = p;
2666	>	}
2667	>	return hd;
2668		}
2669
2670	+	/* ---------------- TreeNodes -------------- */
2671	+
2672		/**
2673	<	* An extended view of a ConcurrentHashMap supporting bulk
3545	<	* parallel operations. These operations are designed to be
3546	<	* safely, and often sensibly, applied even with maps that are
3547	<	* being concurrently updated by other threads; for example, when
3548	<	* computing a snapshot summary of the values in a shared
3549	<	* registry.  There are three kinds of operation, each with four
3550	<	* forms, accepting functions with Keys, Values, Entries, and
3551	<	* (Key, Value) arguments and/or return values. Because the
3552	<	* elements of a ConcurrentHashMap are not ordered in any
3553	<	* particular way, and may be processed in different orders in
3554	<	* different parallel executions, the correctness of supplied
3555	<	* functions should not depend on any ordering, or on any other
3556	<	* objects or values that may transiently change while computation
3557	<	* is in progress; and except for forEach actions, should ideally
3558	<	* be side-effect-free.
3559	<	*
3560	<	* <ul>
3561	<	* <li> forEach: Perform a given action on each element.
3562	<	* A variant form applies a given transformation on each element
3563	<	* before performing the action.</li>
3564	<	*
3565	<	* <li> search: Return the first available non-null result of
3566	<	* applying a given function on each element; skipping further
3567	<	* search when a result is found.</li>
3568	<	*
3569	<	* <li> reduce: Accumulate each element.  The supplied reduction
3570	<	* function cannot rely on ordering (more formally, it should be
3571	<	* both associative and commutative).  There are five variants:
3572	<	*
3573	<	* <ul>
3574	<	*
3575	<	* <li> Plain reductions. (There is not a form of this method for
3576	<	* (key, value) function arguments since there is no corresponding
3577	<	* return type.)</li>
3578	<	*
3579	<	* <li> Mapped reductions that accumulate the results of a given
3580	<	* function applied to each element.</li>
3581	<	*
3582	<	* <li> Reductions to scalar doubles, longs, and ints, using a
3583	<	* given basis value.</li>
3584	<	*
3585	<	* </li>
3586	<	* </ul>
3587	<	* </ul>
3588	<	*
3589	<	* <p>The concurrency properties of the bulk operations follow
3590	<	* from those of ConcurrentHashMap: Any non-null result returned
3591	<	* from {@code get(key)} and related access methods bears a
3592	<	* happens-before relation with the associated insertion or
3593	<	* update.  The result of any bulk operation reflects the
3594	<	* composition of these per-element relations (but is not
3595	<	* necessarily atomic with respect to the map as a whole unless it
3596	<	* is somehow known to be quiescent).  Conversely, because keys
3597	<	* and values in the map are never null, null serves as a reliable
3598	<	* atomic indicator of the current lack of any result.  To
3599	<	* maintain this property, null serves as an implicit basis for
3600	<	* all non-scalar reduction operations. For the double, long, and
3601	<	* int versions, the basis should be one that, when combined with
3602	<	* any other value, returns that other value (more formally, it
3603	<	* should be the identity element for the reduction). Most common
3604	<	* reductions have these properties; for example, computing a sum
3605	<	* with basis 0 or a minimum with basis MAX_VALUE.
3606	<	*
3607	<	* <p>Search and transformation functions provided as arguments
3608	<	* should similarly return null to indicate the lack of any result
3609	<	* (in which case it is not used). In the case of mapped
3610	<	* reductions, this also enables transformations to serve as
3611	<	* filters, returning null (or, in the case of primitive
3612	<	* specializations, the identity basis) if the element should not
3613	<	* be combined. You can create compound transformations and
3614	<	* filterings by composing them yourself under this "null means
3615	<	* there is nothing there now" rule before using them in search or
3616	<	* reduce operations.
3617	<	*
3618	<	* <p>Methods accepting and/or returning Entry arguments maintain
3619	<	* key-value associations. They may be useful for example when
3620	<	* finding the key for the greatest value. Note that "plain" Entry
3621	<	* arguments can be supplied using {@code new
3622	<	* AbstractMap.SimpleEntry(k,v)}.
3623	<	*
3624	<	* <p> Bulk operations may complete abruptly, throwing an
3625	<	* exception encountered in the application of a supplied
3626	<	* function. Bear in mind when handling such exceptions that other
3627	<	* concurrently executing functions could also have thrown
3628	<	* exceptions, or would have done so if the first exception had
3629	<	* not occurred.
3630	<	*
3631	<	* <p>Parallel speedups compared to sequential processing are
3632	<	* common but not guaranteed.  Operations involving brief
3633	<	* functions on small maps may execute more slowly than sequential
3634	<	* loops if the underlying work to parallelize the computation is
3635	<	* more expensive than the computation itself. Similarly,
3636	<	* parallelization may not lead to much actual parallelism if all
3637	<	* processors are busy performing unrelated tasks.
3638	<	*
3639	<	* <p> All arguments to all task methods must be non-null.
3640	<	*
3641	<	* <p><em>jsr166e note: During transition, this class
3642	<	* uses nested functional interfaces with different names but the
3643	<	* same forms as those expected for JDK8.<em>
2673	>	* Nodes for use in TreeBins.
2674		*/
2675	<	public class Parallel {
2676	<	final ForkJoinPool fjp;
2675	>	static final class TreeNode<K,V> extends Node<K,V> {
2676	>	TreeNode<K,V> parent;  // red-black tree links
2677	>	TreeNode<K,V> left;
2678	>	TreeNode<K,V> right;
2679	>	TreeNode<K,V> prev;    // needed to unlink next upon deletion
2680	>	boolean red;
2681
2682	<	/**
2683	<	* Returns an extended view of this map using the given
2684	<	* executor for bulk parallel operations.
2685	<	*
3652	<	* @param executor the executor
3653	<	*/
3654	<	public Parallel(ForkJoinPool executor)  {
3655	<	this.fjp = executor;
2682	>	TreeNode(int hash, K key, V val, Node<K,V> next,
2683	>	TreeNode<K,V> parent) {
2684	>	super(hash, key, val, next);
2685	>	this.parent = parent;
2686		}
2687
2688	<	/**
2689	<	* Performs the given action for each (key, value).
3660	<	*
3661	<	* @param action the action
3662	<	*/
3663	<	public void forEach(BiAction<K,V> action) {
3664	<	fjp.invoke(ForkJoinTasks.forEach
3665	<	(ConcurrentHashMap.this, action));
2688	>	Node<K,V> find(int h, Object k) {
2689	>	return findTreeNode(h, k, null);
2690		}
2691
2692		/**
2693	<	* Performs the given action for each non-null transformation
2694	<	* of each (key, value).
3671	<	*
3672	<	* @param transformer a function returning the transformation
3673	<	* for an element, or null of there is no transformation (in
3674	<	* which case the action is not applied).
3675	<	* @param action the action
2693	>	* Returns the TreeNode (or null if not found) for the given key
2694	>	* starting at given root.
2695		*/
2696	<	public <U> void forEach(BiFun<? super K, ? super V, ? extends U> transformer,
2697	<	Action<U> action) {
2698	<	fjp.invoke(ForkJoinTasks.forEach
2699	<	(ConcurrentHashMap.this, transformer, action));
2696	>	final TreeNode<K,V> findTreeNode(int h, Object k, Class<?> kc) {
2697	>	if (k != null) {
2698	>	TreeNode<K,V> p = this;
2699	>	do {
2700	>	int ph, dir; K pk; TreeNode<K,V> q;
2701	>	TreeNode<K,V> pl = p.left, pr = p.right;
2702	>	if ((ph = p.hash) > h)
2703	>	p = pl;
2704	>	else if (ph < h)
2705	>	p = pr;
2706	>	else if ((pk = p.key) == k || (pk != null && k.equals(pk)))
2707	>	return p;
2708	>	else if (pl == null)
2709	>	p = pr;
2710	>	else if (pr == null)
2711	>	p = pl;
2712	>	else if ((kc != null ||
2713	>	(kc = comparableClassFor(k)) != null) &&
2714	>	(dir = compareComparables(kc, k, pk)) != 0)
2715	>	p = (dir < 0) ? pl : pr;
2716	>	else if ((q = pr.findTreeNode(h, k, kc)) != null)
2717	>	return q;
2718	>	else
2719	>	p = pl;
2720	>	} while (p != null);
2721	>	}
2722	>	return null;
2723		}
2724	+	}
2725
2726	<	/**
3684	<	* Returns a non-null result from applying the given search
3685	<	* function on each (key, value), or null if none.  Upon
3686	<	* success, further element processing is suppressed and the
3687	<	* results of any other parallel invocations of the search
3688	<	* function are ignored.
3689	<	*
3690	<	* @param searchFunction a function returning a non-null
3691	<	* result on success, else null
3692	<	* @return a non-null result from applying the given search
3693	<	* function on each (key, value), or null if none
3694	<	*/
3695	<	public <U> U search(BiFun<? super K, ? super V, ? extends U> searchFunction) {
3696	<	return fjp.invoke(ForkJoinTasks.search
3697	<	(ConcurrentHashMap.this, searchFunction));
3698	<	}
2726	>	/* ---------------- TreeBins -------------- */
2727
2728	<	/**
2729	<	* Returns the result of accumulating the given transformation
2730	<	* of all (key, value) pairs using the given reducer to
2731	<	* combine values, or null if none.
2732	<	*
2733	<	* @param transformer a function returning the transformation
2734	<	* for an element, or null of there is no transformation (in
2735	<	* which case it is not combined).
2736	<	* @param reducer a commutative associative combining function
2737	<	* @return the result of accumulating the given transformation
2738	<	* of all (key, value) pairs
2739	<	*/
2740	<	public <U> U reduce(BiFun<? super K, ? super V, ? extends U> transformer,
2741	<	BiFun<? super U, ? super U, ? extends U> reducer) {
2742	<	return fjp.invoke(ForkJoinTasks.reduce
2743	<	(ConcurrentHashMap.this, transformer, reducer));
2728	>	/**
2729	>	* TreeNodes used at the heads of bins. TreeBins do not hold user
2730	>	* keys or values, but instead point to list of TreeNodes and
2731	>	* their root. They also maintain a parasitic read-write lock
2732	>	* forcing writers (who hold bin lock) to wait for readers (who do
2733	>	* not) to complete before tree restructuring operations.
2734	>	*/
2735	>	static final class TreeBin<K,V> extends Node<K,V> {
2736	>	TreeNode<K,V> root;
2737	>	volatile TreeNode<K,V> first;
2738	>	volatile Thread waiter;
2739	>	volatile int lockState;
2740	>	// values for lockState
2741	>	static final int WRITER = 1; // set while holding write lock
2742	>	static final int WAITER = 2; // set when waiting for write lock
2743	>	static final int READER = 4; // increment value for setting read lock
2744	>
2745	>	/**
2746	>	* Tie-breaking utility for ordering insertions when equal
2747	>	* hashCodes and non-comparable. We don't require a total
2748	>	* order, just a consistent insertion rule to maintain
2749	>	* equivalence across rebalancings. Tie-breaking further than
2750	>	* necessary simplifies testing a bit.
2751	>	*/
2752	>	static int tieBreakOrder(Object a, Object b) {
2753	>	int d;
2754	>	if (a == null || b == null ||
2755	>	(d = a.getClass().getName().
2756	>	compareTo(b.getClass().getName())) == 0)
2757	>	d = (System.identityHashCode(a) <= System.identityHashCode(b) ?
2758	>	-1 : 1);
2759	>	return d;
2760		}
2761
2762		/**
2763	<	* Returns the result of accumulating the given transformation
2764	<	* of all (key, value) pairs using the given reducer to
2765	<	* combine values, and the given basis as an identity value.
2766	<	*
2767	<	* @param transformer a function returning the transformation
2768	<	* for an element
2769	<	* @param basis the identity (initial default value) for the reduction
2770	<	* @param reducer a commutative associative combining function
2771	<	* @return the result of accumulating the given transformation
2772	<	* of all (key, value) pairs
2773	<	*/
2774	<	public double reduceToDouble(ObjectByObjectToDouble<? super K, ? super V> transformer,
2775	<	double basis,
2776	<	DoubleByDoubleToDouble reducer) {
2777	<	return fjp.invoke(ForkJoinTasks.reduceToDouble
2778	<	(ConcurrentHashMap.this, transformer, basis, reducer));
2763	>	* Creates bin with initial set of nodes headed by b.
2764	>	*/
2765	>	TreeBin(TreeNode<K,V> b) {
2766	>	super(TREEBIN, null, null);
2767	>	this.first = b;
2768	>	TreeNode<K,V> r = null;
2769	>	for (TreeNode<K,V> x = b, next; x != null; x = next) {
2770	>	next = (TreeNode<K,V>)x.next;
2771	>	x.left = x.right = null;
2772	>	if (r == null) {
2773	>	x.parent = null;
2774	>	x.red = false;
2775	>	r = x;
2776	>	}
2777	>	else {
2778	>	K k = x.key;
2779	>	int h = x.hash;
2780	>	Class<?> kc = null;
2781	>	for (TreeNode<K,V> p = r;;) {
2782	>	int dir, ph;
2783	>	K pk = p.key;
2784	>	if ((ph = p.hash) > h)
2785	>	dir = -1;
2786	>	else if (ph < h)
2787	>	dir = 1;
2788	>	else if ((kc == null &&
2789	>	(kc = comparableClassFor(k)) == null) ||
2790	>	(dir = compareComparables(kc, k, pk)) == 0)
2791	>	dir = tieBreakOrder(k, pk);
2792	>	TreeNode<K,V> xp = p;
2793	>	if ((p = (dir <= 0) ? p.left : p.right) == null) {
2794	>	x.parent = xp;
2795	>	if (dir <= 0)
2796	>	xp.left = x;
2797	>	else
2798	>	xp.right = x;
2799	>	r = balanceInsertion(r, x);
2800	>	break;
2801	>	}
2802	>	}
2803	>	}
2804	>	}
2805	>	this.root = r;
2806	>	assert checkInvariants(root);
2807		}
2808
2809		/**
2810	<	* Returns the result of accumulating the given transformation
3739	<	* of all (key, value) pairs using the given reducer to
3740	<	* combine values, and the given basis as an identity value.
3741	<	*
3742	<	* @param transformer a function returning the transformation
3743	<	* for an element
3744	<	* @param basis the identity (initial default value) for the reduction
3745	<	* @param reducer a commutative associative combining function
3746	<	* @return the result of accumulating the given transformation
3747	<	* of all (key, value) pairs
2810	>	* Acquires write lock for tree restructuring.
2811		*/
2812	<	public long reduceToLong(ObjectByObjectToLong<? super K, ? super V> transformer,
2813	<	long basis,
2814	<	LongByLongToLong reducer) {
3752	<	return fjp.invoke(ForkJoinTasks.reduceToLong
3753	<	(ConcurrentHashMap.this, transformer, basis, reducer));
2812	>	private final void lockRoot() {
2813	>	if (!U.compareAndSetInt(this, LOCKSTATE, 0, WRITER))
2814	>	contendedLock(); // offload to separate method
2815		}
2816
2817		/**
2818	<	* Returns the result of accumulating the given transformation
3758	<	* of all (key, value) pairs using the given reducer to
3759	<	* combine values, and the given basis as an identity value.
3760	<	*
3761	<	* @param transformer a function returning the transformation
3762	<	* for an element
3763	<	* @param basis the identity (initial default value) for the reduction
3764	<	* @param reducer a commutative associative combining function
3765	<	* @return the result of accumulating the given transformation
3766	<	* of all (key, value) pairs
2818	>	* Releases write lock for tree restructuring.
2819		*/
2820	<	public int reduceToInt(ObjectByObjectToInt<? super K, ? super V> transformer,
2821	<	int basis,
3770	<	IntByIntToInt reducer) {
3771	<	return fjp.invoke(ForkJoinTasks.reduceToInt
3772	<	(ConcurrentHashMap.this, transformer, basis, reducer));
2820	>	private final void unlockRoot() {
2821	>	lockState = 0;
2822		}
2823
2824		/**
2825	<	* Performs the given action for each key.
3777	<	*
3778	<	* @param action the action
2825	>	* Possibly blocks awaiting root lock.
2826		*/
2827	<	public void forEachKey(Action<K> action) {
2828	<	fjp.invoke(ForkJoinTasks.forEachKey
2829	<	(ConcurrentHashMap.this, action));
2827	>	private final void contendedLock() {
2828	>	boolean waiting = false;
2829	>	for (int s;;) {
2830	>	if (((s = lockState) & ~WAITER) == 0) {
2831	>	if (U.compareAndSetInt(this, LOCKSTATE, s, WRITER)) {
2832	>	if (waiting)
2833	>	waiter = null;
2834	>	return;
2835	>	}
2836	>	}
2837	>	else if ((s & WAITER) == 0) {
2838	>	if (U.compareAndSetInt(this, LOCKSTATE, s, s | WAITER)) {
2839	>	waiting = true;
2840	>	waiter = Thread.currentThread();
2841	>	}
2842	>	}
2843	>	else if (waiting)
2844	>	LockSupport.park(this);
2845	>	}
2846		}
2847
2848		/**
2849	<	* Performs the given action for each non-null transformation
2850	<	* of each key.
2851	<	*
3789	<	* @param transformer a function returning the transformation
3790	<	* for an element, or null of there is no transformation (in
3791	<	* which case the action is not applied).
3792	<	* @param action the action
2849	>	* Returns matching node or null if none. Tries to search
2850	>	* using tree comparisons from root, but continues linear
2851	>	* search when lock not available.
2852		*/
2853	<	public <U> void forEachKey(Fun<? super K, ? extends U> transformer,
2854	<	Action<U> action) {
2855	<	fjp.invoke(ForkJoinTasks.forEachKey
2856	<	(ConcurrentHashMap.this, transformer, action));
2853	>	final Node<K,V> find(int h, Object k) {
2854	>	if (k != null) {
2855	>	for (Node<K,V> e = first; e != null; ) {
2856	>	int s; K ek;
2857	>	if (((s = lockState) & (WAITER|WRITER)) != 0) {
2858	>	if (e.hash == h &&
2859	>	((ek = e.key) == k || (ek != null && k.equals(ek))))
2860	>	return e;
2861	>	e = e.next;
2862	>	}
2863	>	else if (U.compareAndSetInt(this, LOCKSTATE, s,
2864	>	s + READER)) {
2865	>	TreeNode<K,V> r, p;
2866	>	try {
2867	>	p = ((r = root) == null ? null :
2868	>	r.findTreeNode(h, k, null));
2869	>	} finally {
2870	>	Thread w;
2871	>	if (U.getAndAddInt(this, LOCKSTATE, -READER) ==
2872	>	(READER|WAITER) && (w = waiter) != null)
2873	>	LockSupport.unpark(w);
2874	>	}
2875	>	return p;
2876	>	}
2877	>	}
2878	>	}
2879	>	return null;
2880		}
2881
2882		/**
2883	<	* Returns a non-null result from applying the given search
2884	<	* function on each key, or null if none. Upon success,
3803	<	* further element processing is suppressed and the results of
3804	<	* any other parallel invocations of the search function are
3805	<	* ignored.
3806	<	*
3807	<	* @param searchFunction a function returning a non-null
3808	<	* result on success, else null
3809	<	* @return a non-null result from applying the given search
3810	<	* function on each key, or null if none
2883	>	* Finds or adds a node.
2884	>	* @return null if added
2885		*/
2886	<	public <U> U searchKeys(Fun<? super K, ? extends U> searchFunction) {
2887	<	return fjp.invoke(ForkJoinTasks.searchKeys
2888	<	(ConcurrentHashMap.this, searchFunction));
2886	>	final TreeNode<K,V> putTreeVal(int h, K k, V v) {
2887	>	Class<?> kc = null;
2888	>	boolean searched = false;
2889	>	for (TreeNode<K,V> p = root;;) {
2890	>	int dir, ph; K pk;
2891	>	if (p == null) {
2892	>	first = root = new TreeNode<K,V>(h, k, v, null, null);
2893	>	break;
2894	>	}
2895	>	else if ((ph = p.hash) > h)
2896	>	dir = -1;
2897	>	else if (ph < h)
2898	>	dir = 1;
2899	>	else if ((pk = p.key) == k || (pk != null && k.equals(pk)))
2900	>	return p;
2901	>	else if ((kc == null &&
2902	>	(kc = comparableClassFor(k)) == null) ||
2903	>	(dir = compareComparables(kc, k, pk)) == 0) {
2904	>	if (!searched) {
2905	>	TreeNode<K,V> q, ch;
2906	>	searched = true;
2907	>	if (((ch = p.left) != null &&
2908	>	(q = ch.findTreeNode(h, k, kc)) != null) ||
2909	>	((ch = p.right) != null &&
2910	>	(q = ch.findTreeNode(h, k, kc)) != null))
2911	>	return q;
2912	>	}
2913	>	dir = tieBreakOrder(k, pk);
2914	>	}
2915	>
2916	>	TreeNode<K,V> xp = p;
2917	>	if ((p = (dir <= 0) ? p.left : p.right) == null) {
2918	>	TreeNode<K,V> x, f = first;
2919	>	first = x = new TreeNode<K,V>(h, k, v, f, xp);
2920	>	if (f != null)
2921	>	f.prev = x;
2922	>	if (dir <= 0)
2923	>	xp.left = x;
2924	>	else
2925	>	xp.right = x;
2926	>	if (!xp.red)
2927	>	x.red = true;
2928	>	else {
2929	>	lockRoot();
2930	>	try {
2931	>	root = balanceInsertion(root, x);
2932	>	} finally {
2933	>	unlockRoot();
2934	>	}
2935	>	}
2936	>	break;
2937	>	}
2938	>	}
2939	>	assert checkInvariants(root);
2940	>	return null;
2941		}
2942
2943		/**
2944	<	* Returns the result of accumulating all keys using the given
2945	<	* reducer to combine values, or null if none.
2944	>	* Removes the given node, that must be present before this
2945	>	* call.  This is messier than typical red-black deletion code
2946	>	* because we cannot swap the contents of an interior node
2947	>	* with a leaf successor that is pinned by "next" pointers
2948	>	* that are accessible independently of lock. So instead we
2949	>	* swap the tree linkages.
2950		*
2951	<	* @param reducer a commutative associative combining function
3822	<	* @return the result of accumulating all keys using the given
3823	<	* reducer to combine values, or null if none
2951	>	* @return true if now too small, so should be untreeified
2952		*/
2953	<	public K reduceKeys(BiFun<? super K, ? super K, ? extends K> reducer) {
2954	<	return fjp.invoke(ForkJoinTasks.reduceKeys
2955	<	(ConcurrentHashMap.this, reducer));
2956	<	}
2953	>	final boolean removeTreeNode(TreeNode<K,V> p) {
2954	>	TreeNode<K,V> next = (TreeNode<K,V>)p.next;
2955	>	TreeNode<K,V> pred = p.prev;  // unlink traversal pointers
2956	>	TreeNode<K,V> r, rl;
2957	>	if (pred == null)
2958	>	first = next;
2959	>	else
2960	>	pred.next = next;
2961	>	if (next != null)
2962	>	next.prev = pred;
2963	>	if (first == null) {
2964	>	root = null;
2965	>	return true;
2966	>	}
2967	>	if ((r = root) == null || r.right == null || // too small
2968	>	(rl = r.left) == null || rl.left == null)
2969	>	return true;
2970	>	lockRoot();
2971	>	try {
2972	>	TreeNode<K,V> replacement;
2973	>	TreeNode<K,V> pl = p.left;
2974	>	TreeNode<K,V> pr = p.right;
2975	>	if (pl != null && pr != null) {
2976	>	TreeNode<K,V> s = pr, sl;
2977	>	while ((sl = s.left) != null) // find successor
2978	>	s = sl;
2979	>	boolean c = s.red; s.red = p.red; p.red = c; // swap colors
2980	>	TreeNode<K,V> sr = s.right;
2981	>	TreeNode<K,V> pp = p.parent;
2982	>	if (s == pr) { // p was s's direct parent
2983	>	p.parent = s;
2984	>	s.right = p;
2985	>	}
2986	>	else {
2987	>	TreeNode<K,V> sp = s.parent;
2988	>	if ((p.parent = sp) != null) {
2989	>	if (s == sp.left)
2990	>	sp.left = p;
2991	>	else
2992	>	sp.right = p;
2993	>	}
2994	>	if ((s.right = pr) != null)
2995	>	pr.parent = s;
2996	>	}
2997	>	p.left = null;
2998	>	if ((p.right = sr) != null)
2999	>	sr.parent = p;
3000	>	if ((s.left = pl) != null)
3001	>	pl.parent = s;
3002	>	if ((s.parent = pp) == null)
3003	>	r = s;
3004	>	else if (p == pp.left)
3005	>	pp.left = s;
3006	>	else
3007	>	pp.right = s;
3008	>	if (sr != null)
3009	>	replacement = sr;
3010	>	else
3011	>	replacement = p;
3012	>	}
3013	>	else if (pl != null)
3014	>	replacement = pl;
3015	>	else if (pr != null)
3016	>	replacement = pr;
3017	>	else
3018	>	replacement = p;
3019	>	if (replacement != p) {
3020	>	TreeNode<K,V> pp = replacement.parent = p.parent;
3021	>	if (pp == null)
3022	>	r = replacement;
3023	>	else if (p == pp.left)
3024	>	pp.left = replacement;
3025	>	else
3026	>	pp.right = replacement;
3027	>	p.left = p.right = p.parent = null;
3028	>	}
3029
3030	<	/**
3831	<	* Returns the result of accumulating the given transformation
3832	<	* of all keys using the given reducer to combine values, or
3833	<	* null if none.
3834	<	*
3835	<	* @param transformer a function returning the transformation
3836	<	* for an element, or null of there is no transformation (in
3837	<	* which case it is not combined).
3838	<	* @param reducer a commutative associative combining function
3839	<	* @return the result of accumulating the given transformation
3840	<	* of all keys
3841	<	*/
3842	<	public <U> U reduceKeys(Fun<? super K, ? extends U> transformer,
3843	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3844	<	return fjp.invoke(ForkJoinTasks.reduceKeys
3845	<	(ConcurrentHashMap.this, transformer, reducer));
3846	<	}
3030	>	root = (p.red) ? r : balanceDeletion(r, replacement);
3031
3032	<	/**
3033	<	* Returns the result of accumulating the given transformation
3034	<	* of all keys using the given reducer to combine values, and
3035	<	* the given basis as an identity value.
3036	<	*
3037	<	* @param transformer a function returning the transformation
3038	<	* for an element
3039	<	* @param basis the identity (initial default value) for the reduction
3040	<	* @param reducer a commutative associative combining function
3041	<	* @return  the result of accumulating the given transformation
3042	<	* of all keys
3043	<	*/
3044	<	public double reduceKeysToDouble(ObjectToDouble<? super K> transformer,
3045	<	double basis,
3046	<	DoubleByDoubleToDouble reducer) {
3863	<	return fjp.invoke(ForkJoinTasks.reduceKeysToDouble
3864	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3032	>	if (p == replacement) {  // detach pointers
3033	>	TreeNode<K,V> pp;
3034	>	if ((pp = p.parent) != null) {
3035	>	if (p == pp.left)
3036	>	pp.left = null;
3037	>	else if (p == pp.right)
3038	>	pp.right = null;
3039	>	p.parent = null;
3040	>	}
3041	>	}
3042	>	} finally {
3043	>	unlockRoot();
3044	>	}
3045	>	assert checkInvariants(root);
3046	>	return false;
3047		}
3048
3049	<	/**
3050	<	* Returns the result of accumulating the given transformation
3869	<	* of all keys using the given reducer to combine values, and
3870	<	* the given basis as an identity value.
3871	<	*
3872	<	* @param transformer a function returning the transformation
3873	<	* for an element
3874	<	* @param basis the identity (initial default value) for the reduction
3875	<	* @param reducer a commutative associative combining function
3876	<	* @return the result of accumulating the given transformation
3877	<	* of all keys
3878	<	*/
3879	<	public long reduceKeysToLong(ObjectToLong<? super K> transformer,
3880	<	long basis,
3881	<	LongByLongToLong reducer) {
3882	<	return fjp.invoke(ForkJoinTasks.reduceKeysToLong
3883	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3884	<	}
3049	>	/* ------------------------------------------------------------ */
3050	>	// Red-black tree methods, all adapted from CLR
3051
3052	<	/**
3053	<	* Returns the result of accumulating the given transformation
3054	<	* of all keys using the given reducer to combine values, and
3055	<	* the given basis as an identity value.
3056	<	*
3057	<	* @param transformer a function returning the transformation
3058	<	* for an element
3059	<	* @param basis the identity (initial default value) for the reduction
3060	<	* @param reducer a commutative associative combining function
3061	<	* @return the result of accumulating the given transformation
3062	<	* of all keys
3063	<	*/
3064	<	public int reduceKeysToInt(ObjectToInt<? super K> transformer,
3065	<	int basis,
3066	<	IntByIntToInt reducer) {
3067	<	return fjp.invoke(ForkJoinTasks.reduceKeysToInt
3902	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3052	>	static <K,V> TreeNode<K,V> rotateLeft(TreeNode<K,V> root,
3053	>	TreeNode<K,V> p) {
3054	>	TreeNode<K,V> r, pp, rl;
3055	>	if (p != null && (r = p.right) != null) {
3056	>	if ((rl = p.right = r.left) != null)
3057	>	rl.parent = p;
3058	>	if ((pp = r.parent = p.parent) == null)
3059	>	(root = r).red = false;
3060	>	else if (pp.left == p)
3061	>	pp.left = r;
3062	>	else
3063	>	pp.right = r;
3064	>	r.left = p;
3065	>	p.parent = r;
3066	>	}
3067	>	return root;
3068		}
3069
3070	<	/**
3071	<	* Performs the given action for each value.
3072	<	*
3073	<	* @param action the action
3074	<	*/
3075	<	public void forEachValue(Action<V> action) {
3076	<	fjp.invoke(ForkJoinTasks.forEachValue
3077	<	(ConcurrentHashMap.this, action));
3070	>	static <K,V> TreeNode<K,V> rotateRight(TreeNode<K,V> root,
3071	>	TreeNode<K,V> p) {
3072	>	TreeNode<K,V> l, pp, lr;
3073	>	if (p != null && (l = p.left) != null) {
3074	>	if ((lr = p.left = l.right) != null)
3075	>	lr.parent = p;
3076	>	if ((pp = l.parent = p.parent) == null)
3077	>	(root = l).red = false;
3078	>	else if (pp.right == p)
3079	>	pp.right = l;
3080	>	else
3081	>	pp.left = l;
3082	>	l.right = p;
3083	>	p.parent = l;
3084	>	}
3085	>	return root;
3086		}
3087
3088	<	/**
3089	<	* Performs the given action for each non-null transformation
3090	<	* of each value.
3091	<	*
3092	<	* @param transformer a function returning the transformation
3093	<	* for an element, or null of there is no transformation (in
3094	<	* which case the action is not applied).
3095	<	*/
3096	<	public <U> void forEachValue(Fun<? super V, ? extends U> transformer,
3097	<	Action<U> action) {
3098	<	fjp.invoke(ForkJoinTasks.forEachValue
3099	<	(ConcurrentHashMap.this, transformer, action));
3088	>	static <K,V> TreeNode<K,V> balanceInsertion(TreeNode<K,V> root,
3089	>	TreeNode<K,V> x) {
3090	>	x.red = true;
3091	>	for (TreeNode<K,V> xp, xpp, xppl, xppr;;) {
3092	>	if ((xp = x.parent) == null) {
3093	>	x.red = false;
3094	>	return x;
3095	>	}
3096	>	else if (!xp.red || (xpp = xp.parent) == null)
3097	>	return root;
3098	>	if (xp == (xppl = xpp.left)) {
3099	>	if ((xppr = xpp.right) != null && xppr.red) {
3100	>	xppr.red = false;
3101	>	xp.red = false;
3102	>	xpp.red = true;
3103	>	x = xpp;
3104	>	}
3105	>	else {
3106	>	if (x == xp.right) {
3107	>	root = rotateLeft(root, x = xp);
3108	>	xpp = (xp = x.parent) == null ? null : xp.parent;
3109	>	}
3110	>	if (xp != null) {
3111	>	xp.red = false;
3112	>	if (xpp != null) {
3113	>	xpp.red = true;
3114	>	root = rotateRight(root, xpp);
3115	>	}
3116	>	}
3117	>	}
3118	>	}
3119	>	else {
3120	>	if (xppl != null && xppl.red) {
3121	>	xppl.red = false;
3122	>	xp.red = false;
3123	>	xpp.red = true;
3124	>	x = xpp;
3125	>	}
3126	>	else {
3127	>	if (x == xp.left) {
3128	>	root = rotateRight(root, x = xp);
3129	>	xpp = (xp = x.parent) == null ? null : xp.parent;
3130	>	}
3131	>	if (xp != null) {
3132	>	xp.red = false;
3133	>	if (xpp != null) {
3134	>	xpp.red = true;
3135	>	root = rotateLeft(root, xpp);
3136	>	}
3137	>	}
3138	>	}
3139	>	}
3140	>	}
3141		}
3142
3143	<	/**
3144	<	* Returns a non-null result from applying the given search
3145	<	* function on each value, or null if none.  Upon success,
3146	<	* further element processing is suppressed and the results of
3147	<	* any other parallel invocations of the search function are
3148	<	* ignored.
3149	<	*
3150	<	* @param searchFunction a function returning a non-null
3151	<	* result on success, else null
3152	<	* @return a non-null result from applying the given search
3153	<	* function on each value, or null if none
3154	<	*
3155	<	*/
3156	<	public <U> U searchValues(Fun<? super V, ? extends U> searchFunction) {
3157	<	return fjp.invoke(ForkJoinTasks.searchValues
3158	<	(ConcurrentHashMap.this, searchFunction));
3143	>	static <K,V> TreeNode<K,V> balanceDeletion(TreeNode<K,V> root,
3144	>	TreeNode<K,V> x) {
3145	>	for (TreeNode<K,V> xp, xpl, xpr;;) {
3146	>	if (x == null || x == root)
3147	>	return root;
3148	>	else if ((xp = x.parent) == null) {
3149	>	x.red = false;
3150	>	return x;
3151	>	}
3152	>	else if (x.red) {
3153	>	x.red = false;
3154	>	return root;
3155	>	}
3156	>	else if ((xpl = xp.left) == x) {
3157	>	if ((xpr = xp.right) != null && xpr.red) {
3158	>	xpr.red = false;
3159	>	xp.red = true;
3160	>	root = rotateLeft(root, xp);
3161	>	xpr = (xp = x.parent) == null ? null : xp.right;
3162	>	}
3163	>	if (xpr == null)
3164	>	x = xp;
3165	>	else {
3166	>	TreeNode<K,V> sl = xpr.left, sr = xpr.right;
3167	>	if ((sr == null || !sr.red) &&
3168	>	(sl == null || !sl.red)) {
3169	>	xpr.red = true;
3170	>	x = xp;
3171	>	}
3172	>	else {
3173	>	if (sr == null || !sr.red) {
3174	>	if (sl != null)
3175	>	sl.red = false;
3176	>	xpr.red = true;
3177	>	root = rotateRight(root, xpr);
3178	>	xpr = (xp = x.parent) == null ?
3179	>	null : xp.right;
3180	>	}
3181	>	if (xpr != null) {
3182	>	xpr.red = (xp == null) ? false : xp.red;
3183	>	if ((sr = xpr.right) != null)
3184	>	sr.red = false;
3185	>	}
3186	>	if (xp != null) {
3187	>	xp.red = false;
3188	>	root = rotateLeft(root, xp);
3189	>	}
3190	>	x = root;
3191	>	}
3192	>	}
3193	>	}
3194	>	else { // symmetric
3195	>	if (xpl != null && xpl.red) {
3196	>	xpl.red = false;
3197	>	xp.red = true;
3198	>	root = rotateRight(root, xp);
3199	>	xpl = (xp = x.parent) == null ? null : xp.left;
3200	>	}
3201	>	if (xpl == null)
3202	>	x = xp;
3203	>	else {
3204	>	TreeNode<K,V> sl = xpl.left, sr = xpl.right;
3205	>	if ((sl == null || !sl.red) &&
3206	>	(sr == null || !sr.red)) {
3207	>	xpl.red = true;
3208	>	x = xp;
3209	>	}
3210	>	else {
3211	>	if (sl == null || !sl.red) {
3212	>	if (sr != null)
3213	>	sr.red = false;
3214	>	xpl.red = true;
3215	>	root = rotateLeft(root, xpl);
3216	>	xpl = (xp = x.parent) == null ?
3217	>	null : xp.left;
3218	>	}
3219	>	if (xpl != null) {
3220	>	xpl.red = (xp == null) ? false : xp.red;
3221	>	if ((sl = xpl.left) != null)
3222	>	sl.red = false;
3223	>	}
3224	>	if (xp != null) {
3225	>	xp.red = false;
3226	>	root = rotateRight(root, xp);
3227	>	}
3228	>	x = root;
3229	>	}
3230	>	}
3231	>	}
3232	>	}
3233		}
3234
3235		/**
3236	<	* Returns the result of accumulating all values using the
3949	<	* given reducer to combine values, or null if none.
3950	<	*
3951	<	* @param reducer a commutative associative combining function
3952	<	* @return  the result of accumulating all values
3236	>	* Checks invariants recursively for the tree of Nodes rooted at t.
3237		*/
3238	<	public V reduceValues(BiFun<? super V, ? super V, ? extends V> reducer) {
3239	<	return fjp.invoke(ForkJoinTasks.reduceValues
3240	<	(ConcurrentHashMap.this, reducer));
3238	>	static <K,V> boolean checkInvariants(TreeNode<K,V> t) {
3239	>	TreeNode<K,V> tp = t.parent, tl = t.left, tr = t.right,
3240	>	tb = t.prev, tn = (TreeNode<K,V>)t.next;
3241	>	if (tb != null && tb.next != t)
3242	>	return false;
3243	>	if (tn != null && tn.prev != t)
3244	>	return false;
3245	>	if (tp != null && t != tp.left && t != tp.right)
3246	>	return false;
3247	>	if (tl != null && (tl.parent != t || tl.hash > t.hash))
3248	>	return false;
3249	>	if (tr != null && (tr.parent != t || tr.hash < t.hash))
3250	>	return false;
3251	>	if (t.red && tl != null && tl.red && tr != null && tr.red)
3252	>	return false;
3253	>	if (tl != null && !checkInvariants(tl))
3254	>	return false;
3255	>	if (tr != null && !checkInvariants(tr))
3256	>	return false;
3257	>	return true;
3258		}
3259
3260	<	/**
3261	<	* Returns the result of accumulating the given transformation
3262	<	* of all values using the given reducer to combine values, or
3263	<	* null if none.
3264	<	*
3265	<	* @param transformer a function returning the transformation
3266	<	* for an element, or null of there is no transformation (in
3267	<	* which case it is not combined).
3268	<	* @param reducer a commutative associative combining function
3269	<	* @return the result of accumulating the given transformation
3270	<	* of all values
3271	<	*/
3272	<	public <U> U reduceValues(Fun<? super V, ? extends U> transformer,
3273	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3274	<	return fjp.invoke(ForkJoinTasks.reduceValues
3275	<	(ConcurrentHashMap.this, transformer, reducer));
3260	>	private static final Unsafe U = Unsafe.getUnsafe();
3261	>	private static final long LOCKSTATE
3262	>	= U.objectFieldOffset(TreeBin.class, "lockState");
3263	>	}
3264	>
3265	>	/* ----------------Table Traversal -------------- */
3266	>
3267	>	/**
3268	>	* Records the table, its length, and current traversal index for a
3269	>	* traverser that must process a region of a forwarded table before
3270	>	* proceeding with current table.
3271	>	*/
3272	>	static final class TableStack<K,V> {
3273	>	int length;
3274	>	int index;
3275	>	Node<K,V>[] tab;
3276	>	TableStack<K,V> next;
3277	>	}
3278	>
3279	>	/**
3280	>	* Encapsulates traversal for methods such as containsValue; also
3281	>	* serves as a base class for other iterators and spliterators.
3282	>	*
3283	>	* Method advance visits once each still-valid node that was
3284	>	* reachable upon iterator construction. It might miss some that
3285	>	* were added to a bin after the bin was visited, which is OK wrt
3286	>	* consistency guarantees. Maintaining this property in the face
3287	>	* of possible ongoing resizes requires a fair amount of
3288	>	* bookkeeping state that is difficult to optimize away amidst
3289	>	* volatile accesses.  Even so, traversal maintains reasonable
3290	>	* throughput.
3291	>	*
3292	>	* Normally, iteration proceeds bin-by-bin traversing lists.
3293	>	* However, if the table has been resized, then all future steps
3294	>	* must traverse both the bin at the current index as well as at
3295	>	* (index + baseSize); and so on for further resizings. To
3296	>	* paranoically cope with potential sharing by users of iterators
3297	>	* across threads, iteration terminates if a bounds checks fails
3298	>	* for a table read.
3299	>	*/
3300	>	static class Traverser<K,V> {
3301	>	Node<K,V>[] tab;        // current table; updated if resized
3302	>	Node<K,V> next;         // the next entry to use
3303	>	TableStack<K,V> stack, spare; // to save/restore on ForwardingNodes
3304	>	int index;              // index of bin to use next
3305	>	int baseIndex;          // current index of initial table
3306	>	int baseLimit;          // index bound for initial table
3307	>	final int baseSize;     // initial table size
3308	>
3309	>	Traverser(Node<K,V>[] tab, int size, int index, int limit) {
3310	>	this.tab = tab;
3311	>	this.baseSize = size;
3312	>	this.baseIndex = this.index = index;
3313	>	this.baseLimit = limit;
3314	>	this.next = null;
3315		}
3316
3317		/**
3318	<	* Returns the result of accumulating the given transformation
3319	<	* of all values using the given reducer to combine values,
3320	<	* and the given basis as an identity value.
3321	<	*
3322	<	* @param transformer a function returning the transformation
3323	<	* for an element
3324	<	* @param basis the identity (initial default value) for the reduction
3325	<	* @param reducer a commutative associative combining function
3326	<	* @return the result of accumulating the given transformation
3327	<	* of all values
3328	<	*/
3329	<	public double reduceValuesToDouble(ObjectToDouble<? super V> transformer,
3330	<	double basis,
3331	<	DoubleByDoubleToDouble reducer) {
3332	<	return fjp.invoke(ForkJoinTasks.reduceValuesToDouble
3333	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3318	>	* Advances if possible, returning next valid node, or null if none.
3319	>	*/
3320	>	final Node<K,V> advance() {
3321	>	Node<K,V> e;
3322	>	if ((e = next) != null)
3323	>	e = e.next;
3324	>	for (;;) {
3325	>	Node<K,V>[] t; int i, n;  // must use locals in checks
3326	>	if (e != null)
3327	>	return next = e;
3328	>	if (baseIndex >= baseLimit || (t = tab) == null ||
3329	>	(n = t.length) <= (i = index) || i < 0)
3330	>	return next = null;
3331	>	if ((e = tabAt(t, i)) != null && e.hash < 0) {
3332	>	if (e instanceof ForwardingNode) {
3333	>	tab = ((ForwardingNode<K,V>)e).nextTable;
3334	>	e = null;
3335	>	pushState(t, i, n);
3336	>	continue;
3337	>	}
3338	>	else if (e instanceof TreeBin)
3339	>	e = ((TreeBin<K,V>)e).first;
3340	>	else
3341	>	e = null;
3342	>	}
3343	>	if (stack != null)
3344	>	recoverState(n);
3345	>	else if ((index = i + baseSize) >= n)
3346	>	index = ++baseIndex; // visit upper slots if present
3347	>	}
3348		}
3349
3350		/**
3351	<	* Returns the result of accumulating the given transformation
3998	<	* of all values using the given reducer to combine values,
3999	<	* and the given basis as an identity value.
4000	<	*
4001	<	* @param transformer a function returning the transformation
4002	<	* for an element
4003	<	* @param basis the identity (initial default value) for the reduction
4004	<	* @param reducer a commutative associative combining function
4005	<	* @return the result of accumulating the given transformation
4006	<	* of all values
3351	>	* Saves traversal state upon encountering a forwarding node.
3352		*/
3353	<	public long reduceValuesToLong(ObjectToLong<? super V> transformer,
3354	<	long basis,
3355	<	LongByLongToLong reducer) {
3356	<	return fjp.invoke(ForkJoinTasks.reduceValuesToLong
3357	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3353	>	private void pushState(Node<K,V>[] t, int i, int n) {
3354	>	TableStack<K,V> s = spare;  // reuse if possible
3355	>	if (s != null)
3356	>	spare = s.next;
3357	>	else
3358	>	s = new TableStack<K,V>();
3359	>	s.tab = t;
3360	>	s.length = n;
3361	>	s.index = i;
3362	>	s.next = stack;
3363	>	stack = s;
3364		}
3365
3366		/**
3367	<	* Returns the result of accumulating the given transformation
4017	<	* of all values using the given reducer to combine values,
4018	<	* and the given basis as an identity value.
3367	>	* Possibly pops traversal state.
3368		*
3369	<	* @param transformer a function returning the transformation
4021	<	* for an element
4022	<	* @param basis the identity (initial default value) for the reduction
4023	<	* @param reducer a commutative associative combining function
4024	<	* @return the result of accumulating the given transformation
4025	<	* of all values
3369	>	* @param n length of current table
3370		*/
3371	<	public int reduceValuesToInt(ObjectToInt<? super V> transformer,
3372	<	int basis,
3373	<	IntByIntToInt reducer) {
3374	<	return fjp.invoke(ForkJoinTasks.reduceValuesToInt
3375	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3371	>	private void recoverState(int n) {
3372	>	TableStack<K,V> s; int len;
3373	>	while ((s = stack) != null && (index += (len = s.length)) >= n) {
3374	>	n = len;
3375	>	index = s.index;
3376	>	tab = s.tab;
3377	>	s.tab = null;
3378	>	TableStack<K,V> next = s.next;
3379	>	s.next = spare; // save for reuse
3380	>	stack = next;
3381	>	spare = s;
3382	>	}
3383	>	if (s == null && (index += baseSize) >= n)
3384	>	index = ++baseIndex;
3385		}
3386	+	}
3387
3388	<	/**
3389	<	* Performs the given action for each entry.
3390	<	*
3391	<	* @param action the action
3392	<	*/
3393	<	public void forEachEntry(Action<Map.Entry<K,V>> action) {
3394	<	fjp.invoke(ForkJoinTasks.forEachEntry
3395	<	(ConcurrentHashMap.this, action));
3388	>	/**
3389	>	* Base of key, value, and entry Iterators. Adds fields to
3390	>	* Traverser to support iterator.remove.
3391	>	*/
3392	>	static class BaseIterator<K,V> extends Traverser<K,V> {
3393	>	final ConcurrentHashMap<K,V> map;
3394	>	Node<K,V> lastReturned;
3395	>	BaseIterator(Node<K,V>[] tab, int size, int index, int limit,
3396	>	ConcurrentHashMap<K,V> map) {
3397	>	super(tab, size, index, limit);
3398	>	this.map = map;
3399	>	advance();
3400		}
3401
3402	<	/**
3403	<	* Performs the given action for each non-null transformation
3404	<	* of each entry.
3405	<	*
3406	<	* @param transformer a function returning the transformation
3407	<	* for an element, or null of there is no transformation (in
3408	<	* which case the action is not applied).
3409	<	* @param action the action
3410	<	*/
4053	<	public <U> void forEachEntry(Fun<Map.Entry<K,V>, ? extends U> transformer,
4054	<	Action<U> action) {
4055	<	fjp.invoke(ForkJoinTasks.forEachEntry
4056	<	(ConcurrentHashMap.this, transformer, action));
3402	>	public final boolean hasNext() { return next != null; }
3403	>	public final boolean hasMoreElements() { return next != null; }
3404	>
3405	>	public final void remove() {
3406	>	Node<K,V> p;
3407	>	if ((p = lastReturned) == null)
3408	>	throw new IllegalStateException();
3409	>	lastReturned = null;
3410	>	map.replaceNode(p.key, null, null);
3411		}
3412	+	}
3413
3414	<	/**
3415	<	* Returns a non-null result from applying the given search
3416	<	* function on each entry, or null if none.  Upon success,
3417	<	* further element processing is suppressed and the results of
3418	<	* any other parallel invocations of the search function are
4064	<	* ignored.
4065	<	*
4066	<	* @param searchFunction a function returning a non-null
4067	<	* result on success, else null
4068	<	* @return a non-null result from applying the given search
4069	<	* function on each entry, or null if none
4070	<	*/
4071	<	public <U> U searchEntries(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4072	<	return fjp.invoke(ForkJoinTasks.searchEntries
4073	<	(ConcurrentHashMap.this, searchFunction));
3414	>	static final class KeyIterator<K,V> extends BaseIterator<K,V>
3415	>	implements Iterator<K>, Enumeration<K> {
3416	>	KeyIterator(Node<K,V>[] tab, int size, int index, int limit,
3417	>	ConcurrentHashMap<K,V> map) {
3418	>	super(tab, size, index, limit, map);
3419		}
3420
3421	<	/**
3422	<	* Returns the result of accumulating all entries using the
3423	<	* given reducer to combine values, or null if none.
3424	<	*
3425	<	* @param reducer a commutative associative combining function
3426	<	* @return the result of accumulating all entries
3427	<	*/
3428	<	public Map.Entry<K,V> reduceEntries(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4084	<	return fjp.invoke(ForkJoinTasks.reduceEntries
4085	<	(ConcurrentHashMap.this, reducer));
3421	>	public final K next() {
3422	>	Node<K,V> p;
3423	>	if ((p = next) == null)
3424	>	throw new NoSuchElementException();
3425	>	K k = p.key;
3426	>	lastReturned = p;
3427	>	advance();
3428	>	return k;
3429		}
3430
3431	<	/**
3432	<	* Returns the result of accumulating the given transformation
3433	<	* of all entries using the given reducer to combine values,
3434	<	* or null if none.
3435	<	*
3436	<	* @param transformer a function returning the transformation
3437	<	* for an element, or null of there is no transformation (in
3438	<	* which case it is not combined).
4096	<	* @param reducer a commutative associative combining function
4097	<	* @return the result of accumulating the given transformation
4098	<	* of all entries
4099	<	*/
4100	<	public <U> U reduceEntries(Fun<Map.Entry<K,V>, ? extends U> transformer,
4101	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4102	<	return fjp.invoke(ForkJoinTasks.reduceEntries
4103	<	(ConcurrentHashMap.this, transformer, reducer));
3431	>	public final K nextElement() { return next(); }
3432	>	}
3433	>
3434	>	static final class ValueIterator<K,V> extends BaseIterator<K,V>
3435	>	implements Iterator<V>, Enumeration<V> {
3436	>	ValueIterator(Node<K,V>[] tab, int size, int index, int limit,
3437	>	ConcurrentHashMap<K,V> map) {
3438	>	super(tab, size, index, limit, map);
3439		}
3440
3441	<	/**
3442	<	* Returns the result of accumulating the given transformation
3443	<	* of all entries using the given reducer to combine values,
3444	<	* and the given basis as an identity value.
3445	<	*
3446	<	* @param transformer a function returning the transformation
3447	<	* for an element
3448	<	* @param basis the identity (initial default value) for the reduction
4114	<	* @param reducer a commutative associative combining function
4115	<	* @return the result of accumulating the given transformation
4116	<	* of all entries
4117	<	*/
4118	<	public double reduceEntriesToDouble(ObjectToDouble<Map.Entry<K,V>> transformer,
4119	<	double basis,
4120	<	DoubleByDoubleToDouble reducer) {
4121	<	return fjp.invoke(ForkJoinTasks.reduceEntriesToDouble
4122	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3441	>	public final V next() {
3442	>	Node<K,V> p;
3443	>	if ((p = next) == null)
3444	>	throw new NoSuchElementException();
3445	>	V v = p.val;
3446	>	lastReturned = p;
3447	>	advance();
3448	>	return v;
3449		}
3450
3451	<	/**
3452	<	* Returns the result of accumulating the given transformation
3453	<	* of all entries using the given reducer to combine values,
3454	<	* and the given basis as an identity value.
3455	<	*
3456	<	* @param transformer a function returning the transformation
3457	<	* for an element
3458	<	* @param basis the identity (initial default value) for the reduction
4133	<	* @param reducer a commutative associative combining function
4134	<	* @return  the result of accumulating the given transformation
4135	<	* of all entries
4136	<	*/
4137	<	public long reduceEntriesToLong(ObjectToLong<Map.Entry<K,V>> transformer,
4138	<	long basis,
4139	<	LongByLongToLong reducer) {
4140	<	return fjp.invoke(ForkJoinTasks.reduceEntriesToLong
4141	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3451	>	public final V nextElement() { return next(); }
3452	>	}
3453	>
3454	>	static final class EntryIterator<K,V> extends BaseIterator<K,V>
3455	>	implements Iterator<Map.Entry<K,V>> {
3456	>	EntryIterator(Node<K,V>[] tab, int size, int index, int limit,
3457	>	ConcurrentHashMap<K,V> map) {
3458	>	super(tab, size, index, limit, map);
3459		}
3460
3461	<	/**
3462	<	* Returns the result of accumulating the given transformation
3463	<	* of all entries using the given reducer to combine values,
3464	<	* and the given basis as an identity value.
3465	<	*
3466	<	* @param transformer a function returning the transformation
3467	<	* for an element
3468	<	* @param basis the identity (initial default value) for the reduction
3469	<	* @param reducer a commutative associative combining function
4153	<	* @return the result of accumulating the given transformation
4154	<	* of all entries
4155	<	*/
4156	<	public int reduceEntriesToInt(ObjectToInt<Map.Entry<K,V>> transformer,
4157	<	int basis,
4158	<	IntByIntToInt reducer) {
4159	<	return fjp.invoke(ForkJoinTasks.reduceEntriesToInt
4160	<	(ConcurrentHashMap.this, transformer, basis, reducer));
3461	>	public final Map.Entry<K,V> next() {
3462	>	Node<K,V> p;
3463	>	if ((p = next) == null)
3464	>	throw new NoSuchElementException();
3465	>	K k = p.key;
3466	>	V v = p.val;
3467	>	lastReturned = p;
3468	>	advance();
3469	>	return new MapEntry<K,V>(k, v, map);
3470		}
3471		}
3472
4164	–	// ---------------------------------------------------------------------
4165	–
3473		/**
3474	<	* Predefined tasks for performing bulk parallel operations on
4168	<	* ConcurrentHashMaps. These tasks follow the forms and rules used
4169	<	* in class {@link Parallel}. Each method has the same name, but
4170	<	* returns a task rather than invoking it. These methods may be
4171	<	* useful in custom applications such as submitting a task without
4172	<	* waiting for completion, or combining with other tasks.
3474	>	* Exported Entry for EntryIterator.
3475		*/
3476	<	public static class ForkJoinTasks {
3477	<	private ForkJoinTasks() {}
3476	>	static final class MapEntry<K,V> implements Map.Entry<K,V> {
3477	>	final K key; // non-null
3478	>	V val;       // non-null
3479	>	final ConcurrentHashMap<K,V> map;
3480	>	MapEntry(K key, V val, ConcurrentHashMap<K,V> map) {
3481	>	this.key = key;
3482	>	this.val = val;
3483	>	this.map = map;
3484	>	}
3485	>	public K getKey()        { return key; }
3486	>	public V getValue()      { return val; }
3487	>	public int hashCode()    { return key.hashCode() ^ val.hashCode(); }
3488	>	public String toString() {
3489	>	return Helpers.mapEntryToString(key, val);
3490	>	}
3491
3492	<	/**
3493	<	* Returns a task that when invoked, performs the given
3494	<	* action for each (key, value)
3495	<	*
3496	<	* @param map the map
3497	<	* @param action the action
3498	<	* @return the task
4184	<	*/
4185	<	public static <K,V> ForkJoinTask<Void> forEach
4186	<	(ConcurrentHashMap<K,V> map,
4187	<	BiAction<K,V> action) {
4188	<	if (action == null) throw new NullPointerException();
4189	<	return new ForEachMappingTask<K,V>(map, null, -1, action);
3492	>	public boolean equals(Object o) {
3493	>	Object k, v; Map.Entry<?,?> e;
3494	>	return ((o instanceof Map.Entry) &&
3495	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3496	>	(v = e.getValue()) != null &&
3497	>	(k == key || k.equals(key)) &&
3498	>	(v == val || v.equals(val)));
3499		}
3500
3501		/**
3502	<	* Returns a task that when invoked, performs the given
3503	<	* action for each non-null transformation of each (key, value)
3504	<	*
3505	<	* @param map the map
3506	<	* @param transformer a function returning the transformation
3507	<	* for an element, or null of there is no transformation (in
4199	<	* which case the action is not applied).
4200	<	* @param action the action
4201	<	* @return the task
3502	>	* Sets our entry's value and writes through to the map. The
3503	>	* value to return is somewhat arbitrary here. Since we do not
3504	>	* necessarily track asynchronous changes, the most recent
3505	>	* "previous" value could be different from what we return (or
3506	>	* could even have been removed, in which case the put will
3507	>	* re-establish). We do not and cannot guarantee more.
3508		*/
3509	<	public static <K,V,U> ForkJoinTask<Void> forEach
3510	<	(ConcurrentHashMap<K,V> map,
3511	<	BiFun<? super K, ? super V, ? extends U> transformer,
3512	<	Action<U> action) {
3513	<	if (transformer == null || action == null)
3514	<	throw new NullPointerException();
4209	<	return new ForEachTransformedMappingTask<K,V,U>
4210	<	(map, null, -1, transformer, action);
3509	>	public V setValue(V value) {
3510	>	if (value == null) throw new NullPointerException();
3511	>	V v = val;
3512	>	val = value;
3513	>	map.put(key, value);
3514	>	return v;
3515		}
3516	+	}
3517
3518	<	/**
3519	<	* Returns a task that when invoked, returns a non-null result
3520	<	* from applying the given search function on each (key,
3521	<	* value), or null if none. Upon success, further element
3522	<	* processing is suppressed and the results of any other
3523	<	* parallel invocations of the search function are ignored.
3524	<	*
3525	<	* @param map the map
3526	<	* @param searchFunction a function returning a non-null
3527	<	* result on success, else null
3528	<	* @return the task
3529	<	*/
3530	<	public static <K,V,U> ForkJoinTask<U> search
3531	<	(ConcurrentHashMap<K,V> map,
4227	<	BiFun<? super K, ? super V, ? extends U> searchFunction) {
4228	<	if (searchFunction == null) throw new NullPointerException();
4229	<	return new SearchMappingsTask<K,V,U>
4230	<	(map, null, -1, searchFunction,
4231	<	new AtomicReference<U>());
3518	>	static final class KeySpliterator<K,V> extends Traverser<K,V>
3519	>	implements Spliterator<K> {
3520	>	long est;               // size estimate
3521	>	KeySpliterator(Node<K,V>[] tab, int size, int index, int limit,
3522	>	long est) {
3523	>	super(tab, size, index, limit);
3524	>	this.est = est;
3525	>	}
3526	>
3527	>	public KeySpliterator<K,V> trySplit() {
3528	>	int i, f, h;
3529	>	return (h = ((i = baseIndex) + (f = baseLimit)) >>> 1) <= i ? null :
3530	>	new KeySpliterator<K,V>(tab, baseSize, baseLimit = h,
3531	>	f, est >>>= 1);
3532		}
3533
3534	<	/**
3535	<	* Returns a task that when invoked, returns the result of
3536	<	* accumulating the given transformation of all (key, value) pairs
3537	<	* using the given reducer to combine values, or null if none.
4238	<	*
4239	<	* @param map the map
4240	<	* @param transformer a function returning the transformation
4241	<	* for an element, or null of there is no transformation (in
4242	<	* which case it is not combined).
4243	<	* @param reducer a commutative associative combining function
4244	<	* @return the task
4245	<	*/
4246	<	public static <K,V,U> ForkJoinTask<U> reduce
4247	<	(ConcurrentHashMap<K,V> map,
4248	<	BiFun<? super K, ? super V, ? extends U> transformer,
4249	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4250	<	if (transformer == null || reducer == null)
4251	<	throw new NullPointerException();
4252	<	return new MapReduceMappingsTask<K,V,U>
4253	<	(map, null, -1, null, transformer, reducer);
3534	>	public void forEachRemaining(Consumer<? super K> action) {
3535	>	if (action == null) throw new NullPointerException();
3536	>	for (Node<K,V> p; (p = advance()) != null;)
3537	>	action.accept(p.key);
3538		}
3539
3540	<	/**
3541	<	* Returns a task that when invoked, returns the result of
3542	<	* accumulating the given transformation of all (key, value) pairs
3543	<	* using the given reducer to combine values, and the given
3544	<	* basis as an identity value.
3545	<	*
3546	<	* @param map the map
4263	<	* @param transformer a function returning the transformation
4264	<	* for an element
4265	<	* @param basis the identity (initial default value) for the reduction
4266	<	* @param reducer a commutative associative combining function
4267	<	* @return the task
4268	<	*/
4269	<	public static <K,V> ForkJoinTask<Double> reduceToDouble
4270	<	(ConcurrentHashMap<K,V> map,
4271	<	ObjectByObjectToDouble<? super K, ? super V> transformer,
4272	<	double basis,
4273	<	DoubleByDoubleToDouble reducer) {
4274	<	if (transformer == null || reducer == null)
4275	<	throw new NullPointerException();
4276	<	return new MapReduceMappingsToDoubleTask<K,V>
4277	<	(map, null, -1, null, transformer, basis, reducer);
3540	>	public boolean tryAdvance(Consumer<? super K> action) {
3541	>	if (action == null) throw new NullPointerException();
3542	>	Node<K,V> p;
3543	>	if ((p = advance()) == null)
3544	>	return false;
3545	>	action.accept(p.key);
3546	>	return true;
3547		}
3548
3549	<	/**
3550	<	* Returns a task that when invoked, returns the result of
3551	<	* accumulating the given transformation of all (key, value) pairs
3552	<	* using the given reducer to combine values, and the given
3553	<	* basis as an identity value.
4285	<	*
4286	<	* @param map the map
4287	<	* @param transformer a function returning the transformation
4288	<	* for an element
4289	<	* @param basis the identity (initial default value) for the reduction
4290	<	* @param reducer a commutative associative combining function
4291	<	* @return the task
4292	<	*/
4293	<	public static <K,V> ForkJoinTask<Long> reduceToLong
4294	<	(ConcurrentHashMap<K,V> map,
4295	<	ObjectByObjectToLong<? super K, ? super V> transformer,
4296	<	long basis,
4297	<	LongByLongToLong reducer) {
4298	<	if (transformer == null || reducer == null)
4299	<	throw new NullPointerException();
4300	<	return new MapReduceMappingsToLongTask<K,V>
4301	<	(map, null, -1, null, transformer, basis, reducer);
3549	>	public long estimateSize() { return est; }
3550	>
3551	>	public int characteristics() {
3552	>	return Spliterator.DISTINCT | Spliterator.CONCURRENT |
3553	>	Spliterator.NONNULL;
3554		}
3555	+	}
3556
3557	<	/**
3558	<	* Returns a task that when invoked, returns the result of
3559	<	* accumulating the given transformation of all (key, value) pairs
3560	<	* using the given reducer to combine values, and the given
3561	<	* basis as an identity value.
3562	<	*
3563	<	* @param transformer a function returning the transformation
4311	<	* for an element
4312	<	* @param basis the identity (initial default value) for the reduction
4313	<	* @param reducer a commutative associative combining function
4314	<	* @return the task
4315	<	*/
4316	<	public static <K,V> ForkJoinTask<Integer> reduceToInt
4317	<	(ConcurrentHashMap<K,V> map,
4318	<	ObjectByObjectToInt<? super K, ? super V> transformer,
4319	<	int basis,
4320	<	IntByIntToInt reducer) {
4321	<	if (transformer == null || reducer == null)
4322	<	throw new NullPointerException();
4323	<	return new MapReduceMappingsToIntTask<K,V>
4324	<	(map, null, -1, null, transformer, basis, reducer);
3557	>	static final class ValueSpliterator<K,V> extends Traverser<K,V>
3558	>	implements Spliterator<V> {
3559	>	long est;               // size estimate
3560	>	ValueSpliterator(Node<K,V>[] tab, int size, int index, int limit,
3561	>	long est) {
3562	>	super(tab, size, index, limit);
3563	>	this.est = est;
3564		}
3565
3566	<	/**
3567	<	* Returns a task that when invoked, performs the given action
3568	<	* for each key.
3569	<	*
3570	<	* @param map the map
3571	<	* @param action the action
3572	<	* @return the task
3573	<	*/
4335	<	public static <K,V> ForkJoinTask<Void> forEachKey
4336	<	(ConcurrentHashMap<K,V> map,
4337	<	Action<K> action) {
3566	>	public ValueSpliterator<K,V> trySplit() {
3567	>	int i, f, h;
3568	>	return (h = ((i = baseIndex) + (f = baseLimit)) >>> 1) <= i ? null :
3569	>	new ValueSpliterator<K,V>(tab, baseSize, baseLimit = h,
3570	>	f, est >>>= 1);
3571	>	}
3572	>
3573	>	public void forEachRemaining(Consumer<? super V> action) {
3574		if (action == null) throw new NullPointerException();
3575	<	return new ForEachKeyTask<K,V>(map, null, -1, action);
3575	>	for (Node<K,V> p; (p = advance()) != null;)
3576	>	action.accept(p.val);
3577		}
3578
3579	<	/**
3580	<	* Returns a task that when invoked, performs the given action
3581	<	* for each non-null transformation of each key.
3582	<	*
3583	<	* @param map the map
3584	<	* @param transformer a function returning the transformation
3585	<	* for an element, or null of there is no transformation (in
4349	<	* which case the action is not applied).
4350	<	* @param action the action
4351	<	* @return the task
4352	<	*/
4353	<	public static <K,V,U> ForkJoinTask<Void> forEachKey
4354	<	(ConcurrentHashMap<K,V> map,
4355	<	Fun<? super K, ? extends U> transformer,
4356	<	Action<U> action) {
4357	<	if (transformer == null || action == null)
4358	<	throw new NullPointerException();
4359	<	return new ForEachTransformedKeyTask<K,V,U>
4360	<	(map, null, -1, transformer, action);
3579	>	public boolean tryAdvance(Consumer<? super V> action) {
3580	>	if (action == null) throw new NullPointerException();
3581	>	Node<K,V> p;
3582	>	if ((p = advance()) == null)
3583	>	return false;
3584	>	action.accept(p.val);
3585	>	return true;
3586		}
3587
3588	<	/**
3589	<	* Returns a task that when invoked, returns a non-null result
3590	<	* from applying the given search function on each key, or
3591	<	* null if none.  Upon success, further element processing is
4367	<	* suppressed and the results of any other parallel
4368	<	* invocations of the search function are ignored.
4369	<	*
4370	<	* @param map the map
4371	<	* @param searchFunction a function returning a non-null
4372	<	* result on success, else null
4373	<	* @return the task
4374	<	*/
4375	<	public static <K,V,U> ForkJoinTask<U> searchKeys
4376	<	(ConcurrentHashMap<K,V> map,
4377	<	Fun<? super K, ? extends U> searchFunction) {
4378	<	if (searchFunction == null) throw new NullPointerException();
4379	<	return new SearchKeysTask<K,V,U>
4380	<	(map, null, -1, searchFunction,
4381	<	new AtomicReference<U>());
3588	>	public long estimateSize() { return est; }
3589	>
3590	>	public int characteristics() {
3591	>	return Spliterator.CONCURRENT | Spliterator.NONNULL;
3592		}
3593	+	}
3594
3595	<	/**
3596	<	* Returns a task that when invoked, returns the result of
3597	<	* accumulating all keys using the given reducer to combine
3598	<	* values, or null if none.
3599	<	*
3600	<	* @param map the map
3601	<	* @param reducer a commutative associative combining function
3602	<	* @return the task
3603	<	*/
4393	<	public static <K,V> ForkJoinTask<K> reduceKeys
4394	<	(ConcurrentHashMap<K,V> map,
4395	<	BiFun<? super K, ? super K, ? extends K> reducer) {
4396	<	if (reducer == null) throw new NullPointerException();
4397	<	return new ReduceKeysTask<K,V>
4398	<	(map, null, -1, null, reducer);
3595	>	static final class EntrySpliterator<K,V> extends Traverser<K,V>
3596	>	implements Spliterator<Map.Entry<K,V>> {
3597	>	final ConcurrentHashMap<K,V> map; // To export MapEntry
3598	>	long est;               // size estimate
3599	>	EntrySpliterator(Node<K,V>[] tab, int size, int index, int limit,
3600	>	long est, ConcurrentHashMap<K,V> map) {
3601	>	super(tab, size, index, limit);
3602	>	this.map = map;
3603	>	this.est = est;
3604		}
3605
3606	<	/**
3607	<	* Returns a task that when invoked, returns the result of
3608	<	* accumulating the given transformation of all keys using the given
3609	<	* reducer to combine values, or null if none.
3610	<	*
4406	<	* @param map the map
4407	<	* @param transformer a function returning the transformation
4408	<	* for an element, or null of there is no transformation (in
4409	<	* which case it is not combined).
4410	<	* @param reducer a commutative associative combining function
4411	<	* @return the task
4412	<	*/
4413	<	public static <K,V,U> ForkJoinTask<U> reduceKeys
4414	<	(ConcurrentHashMap<K,V> map,
4415	<	Fun<? super K, ? extends U> transformer,
4416	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4417	<	if (transformer == null || reducer == null)
4418	<	throw new NullPointerException();
4419	<	return new MapReduceKeysTask<K,V,U>
4420	<	(map, null, -1, null, transformer, reducer);
3606	>	public EntrySpliterator<K,V> trySplit() {
3607	>	int i, f, h;
3608	>	return (h = ((i = baseIndex) + (f = baseLimit)) >>> 1) <= i ? null :
3609	>	new EntrySpliterator<K,V>(tab, baseSize, baseLimit = h,
3610	>	f, est >>>= 1, map);
3611		}
3612
3613	<	/**
3614	<	* Returns a task that when invoked, returns the result of
3615	<	* accumulating the given transformation of all keys using the given
3616	<	* reducer to combine values, and the given basis as an
4427	<	* identity value.
4428	<	*
4429	<	* @param map the map
4430	<	* @param transformer a function returning the transformation
4431	<	* for an element
4432	<	* @param basis the identity (initial default value) for the reduction
4433	<	* @param reducer a commutative associative combining function
4434	<	* @return the task
4435	<	*/
4436	<	public static <K,V> ForkJoinTask<Double> reduceKeysToDouble
4437	<	(ConcurrentHashMap<K,V> map,
4438	<	ObjectToDouble<? super K> transformer,
4439	<	double basis,
4440	<	DoubleByDoubleToDouble reducer) {
4441	<	if (transformer == null || reducer == null)
4442	<	throw new NullPointerException();
4443	<	return new MapReduceKeysToDoubleTask<K,V>
4444	<	(map, null, -1, null, transformer, basis, reducer);
3613	>	public void forEachRemaining(Consumer<? super Map.Entry<K,V>> action) {
3614	>	if (action == null) throw new NullPointerException();
3615	>	for (Node<K,V> p; (p = advance()) != null; )
3616	>	action.accept(new MapEntry<K,V>(p.key, p.val, map));
3617		}
3618
3619	<	/**
3620	<	* Returns a task that when invoked, returns the result of
3621	<	* accumulating the given transformation of all keys using the given
3622	<	* reducer to combine values, and the given basis as an
3623	<	* identity value.
3624	<	*
3625	<	* @param map the map
4454	<	* @param transformer a function returning the transformation
4455	<	* for an element
4456	<	* @param basis the identity (initial default value) for the reduction
4457	<	* @param reducer a commutative associative combining function
4458	<	* @return the task
4459	<	*/
4460	<	public static <K,V> ForkJoinTask<Long> reduceKeysToLong
4461	<	(ConcurrentHashMap<K,V> map,
4462	<	ObjectToLong<? super K> transformer,
4463	<	long basis,
4464	<	LongByLongToLong reducer) {
4465	<	if (transformer == null || reducer == null)
4466	<	throw new NullPointerException();
4467	<	return new MapReduceKeysToLongTask<K,V>
4468	<	(map, null, -1, null, transformer, basis, reducer);
3619	>	public boolean tryAdvance(Consumer<? super Map.Entry<K,V>> action) {
3620	>	if (action == null) throw new NullPointerException();
3621	>	Node<K,V> p;
3622	>	if ((p = advance()) == null)
3623	>	return false;
3624	>	action.accept(new MapEntry<K,V>(p.key, p.val, map));
3625	>	return true;
3626		}
3627
3628	<	/**
3629	<	* Returns a task that when invoked, returns the result of
3630	<	* accumulating the given transformation of all keys using the given
3631	<	* reducer to combine values, and the given basis as an
3632	<	* identity value.
4476	<	*
4477	<	* @param map the map
4478	<	* @param transformer a function returning the transformation
4479	<	* for an element
4480	<	* @param basis the identity (initial default value) for the reduction
4481	<	* @param reducer a commutative associative combining function
4482	<	* @return the task
4483	<	*/
4484	<	public static <K,V> ForkJoinTask<Integer> reduceKeysToInt
4485	<	(ConcurrentHashMap<K,V> map,
4486	<	ObjectToInt<? super K> transformer,
4487	<	int basis,
4488	<	IntByIntToInt reducer) {
4489	<	if (transformer == null || reducer == null)
4490	<	throw new NullPointerException();
4491	<	return new MapReduceKeysToIntTask<K,V>
4492	<	(map, null, -1, null, transformer, basis, reducer);
3628	>	public long estimateSize() { return est; }
3629	>
3630	>	public int characteristics() {
3631	>	return Spliterator.DISTINCT | Spliterator.CONCURRENT |
3632	>	Spliterator.NONNULL;
3633		}
3634	+	}
3635	+
3636	+	// Parallel bulk operations
3637	+
3638	+	/**
3639	+	* Computes initial batch value for bulk tasks. The returned value
3640	+	* is approximately exp2 of the number of times (minus one) to
3641	+	* split task by two before executing leaf action. This value is
3642	+	* faster to compute and more convenient to use as a guide to
3643	+	* splitting than is the depth, since it is used while dividing by
3644	+	* two anyway.
3645	+	*/
3646	+	final int batchFor(long b) {
3647	+	long n;
3648	+	if (b == Long.MAX_VALUE || (n = sumCount()) <= 1L || n < b)
3649	+	return 0;
3650	+	int sp = ForkJoinPool.getCommonPoolParallelism() << 2; // slack of 4
3651	+	return (b <= 0L || (n /= b) >= sp) ? sp : (int)n;
3652	+	}
3653	+
3654	+	/**
3655	+	* Performs the given action for each (key, value).
3656	+	*
3657	+	* @param parallelismThreshold the (estimated) number of elements
3658	+	* needed for this operation to be executed in parallel
3659	+	* @param action the action
3660	+	* @since 1.8
3661	+	*/
3662	+	public void forEach(long parallelismThreshold,
3663	+	BiConsumer<? super K,? super V> action) {
3664	+	if (action == null) throw new NullPointerException();
3665	+	new ForEachMappingTask<K,V>
3666	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3667	+	action).invoke();
3668	+	}
3669	+
3670	+	/**
3671	+	* Performs the given action for each non-null transformation
3672	+	* of each (key, value).
3673	+	*
3674	+	* @param parallelismThreshold the (estimated) number of elements
3675	+	* needed for this operation to be executed in parallel
3676	+	* @param transformer a function returning the transformation
3677	+	* for an element, or null if there is no transformation (in
3678	+	* which case the action is not applied)
3679	+	* @param action the action
3680	+	* @param <U> the return type of the transformer
3681	+	* @since 1.8
3682	+	*/
3683	+	public <U> void forEach(long parallelismThreshold,
3684	+	BiFunction<? super K, ? super V, ? extends U> transformer,
3685	+	Consumer<? super U> action) {
3686	+	if (transformer == null || action == null)
3687	+	throw new NullPointerException();
3688	+	new ForEachTransformedMappingTask<K,V,U>
3689	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3690	+	transformer, action).invoke();
3691	+	}
3692	+
3693	+	/**
3694	+	* Returns a non-null result from applying the given search
3695	+	* function on each (key, value), or null if none.  Upon
3696	+	* success, further element processing is suppressed and the
3697	+	* results of any other parallel invocations of the search
3698	+	* function are ignored.
3699	+	*
3700	+	* @param parallelismThreshold the (estimated) number of elements
3701	+	* needed for this operation to be executed in parallel
3702	+	* @param searchFunction a function returning a non-null
3703	+	* result on success, else null
3704	+	* @param <U> the return type of the search function
3705	+	* @return a non-null result from applying the given search
3706	+	* function on each (key, value), or null if none
3707	+	* @since 1.8
3708	+	*/
3709	+	public <U> U search(long parallelismThreshold,
3710	+	BiFunction<? super K, ? super V, ? extends U> searchFunction) {
3711	+	if (searchFunction == null) throw new NullPointerException();
3712	+	return new SearchMappingsTask<K,V,U>
3713	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3714	+	searchFunction, new AtomicReference<U>()).invoke();
3715	+	}
3716	+
3717	+	/**
3718	+	* Returns the result of accumulating the given transformation
3719	+	* of all (key, value) pairs using the given reducer to
3720	+	* combine values, or null if none.
3721	+	*
3722	+	* @param parallelismThreshold the (estimated) number of elements
3723	+	* needed for this operation to be executed in parallel
3724	+	* @param transformer a function returning the transformation
3725	+	* for an element, or null if there is no transformation (in
3726	+	* which case it is not combined)
3727	+	* @param reducer a commutative associative combining function
3728	+	* @param <U> the return type of the transformer
3729	+	* @return the result of accumulating the given transformation
3730	+	* of all (key, value) pairs
3731	+	* @since 1.8
3732	+	*/
3733	+	public <U> U reduce(long parallelismThreshold,
3734	+	BiFunction<? super K, ? super V, ? extends U> transformer,
3735	+	BiFunction<? super U, ? super U, ? extends U> reducer) {
3736	+	if (transformer == null || reducer == null)
3737	+	throw new NullPointerException();
3738	+	return new MapReduceMappingsTask<K,V,U>
3739	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3740	+	null, transformer, reducer).invoke();
3741	+	}
3742	+
3743	+	/**
3744	+	* Returns the result of accumulating the given transformation
3745	+	* of all (key, value) pairs using the given reducer to
3746	+	* combine values, and the given basis as an identity value.
3747	+	*
3748	+	* @param parallelismThreshold the (estimated) number of elements
3749	+	* needed for this operation to be executed in parallel
3750	+	* @param transformer a function returning the transformation
3751	+	* for an element
3752	+	* @param basis the identity (initial default value) for the reduction
3753	+	* @param reducer a commutative associative combining function
3754	+	* @return the result of accumulating the given transformation
3755	+	* of all (key, value) pairs
3756	+	* @since 1.8
3757	+	*/
3758	+	public double reduceToDouble(long parallelismThreshold,
3759	+	ToDoubleBiFunction<? super K, ? super V> transformer,
3760	+	double basis,
3761	+	DoubleBinaryOperator reducer) {
3762	+	if (transformer == null || reducer == null)
3763	+	throw new NullPointerException();
3764	+	return new MapReduceMappingsToDoubleTask<K,V>
3765	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3766	+	null, transformer, basis, reducer).invoke();
3767	+	}
3768	+
3769	+	/**
3770	+	* Returns the result of accumulating the given transformation
3771	+	* of all (key, value) pairs using the given reducer to
3772	+	* combine values, and the given basis as an identity value.
3773	+	*
3774	+	* @param parallelismThreshold the (estimated) number of elements
3775	+	* needed for this operation to be executed in parallel
3776	+	* @param transformer a function returning the transformation
3777	+	* for an element
3778	+	* @param basis the identity (initial default value) for the reduction
3779	+	* @param reducer a commutative associative combining function
3780	+	* @return the result of accumulating the given transformation
3781	+	* of all (key, value) pairs
3782	+	* @since 1.8
3783	+	*/
3784	+	public long reduceToLong(long parallelismThreshold,
3785	+	ToLongBiFunction<? super K, ? super V> transformer,
3786	+	long basis,
3787	+	LongBinaryOperator reducer) {
3788	+	if (transformer == null || reducer == null)
3789	+	throw new NullPointerException();
3790	+	return new MapReduceMappingsToLongTask<K,V>
3791	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3792	+	null, transformer, basis, reducer).invoke();
3793	+	}
3794	+
3795	+	/**
3796	+	* Returns the result of accumulating the given transformation
3797	+	* of all (key, value) pairs using the given reducer to
3798	+	* combine values, and the given basis as an identity value.
3799	+	*
3800	+	* @param parallelismThreshold the (estimated) number of elements
3801	+	* needed for this operation to be executed in parallel
3802	+	* @param transformer a function returning the transformation
3803	+	* for an element
3804	+	* @param basis the identity (initial default value) for the reduction
3805	+	* @param reducer a commutative associative combining function
3806	+	* @return the result of accumulating the given transformation
3807	+	* of all (key, value) pairs
3808	+	* @since 1.8
3809	+	*/
3810	+	public int reduceToInt(long parallelismThreshold,
3811	+	ToIntBiFunction<? super K, ? super V> transformer,
3812	+	int basis,
3813	+	IntBinaryOperator reducer) {
3814	+	if (transformer == null || reducer == null)
3815	+	throw new NullPointerException();
3816	+	return new MapReduceMappingsToIntTask<K,V>
3817	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3818	+	null, transformer, basis, reducer).invoke();
3819	+	}
3820	+
3821	+	/**
3822	+	* Performs the given action for each key.
3823	+	*
3824	+	* @param parallelismThreshold the (estimated) number of elements
3825	+	* needed for this operation to be executed in parallel
3826	+	* @param action the action
3827	+	* @since 1.8
3828	+	*/
3829	+	public void forEachKey(long parallelismThreshold,
3830	+	Consumer<? super K> action) {
3831	+	if (action == null) throw new NullPointerException();
3832	+	new ForEachKeyTask<K,V>
3833	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3834	+	action).invoke();
3835	+	}
3836	+
3837	+	/**
3838	+	* Performs the given action for each non-null transformation
3839	+	* of each key.
3840	+	*
3841	+	* @param parallelismThreshold the (estimated) number of elements
3842	+	* needed for this operation to be executed in parallel
3843	+	* @param transformer a function returning the transformation
3844	+	* for an element, or null if there is no transformation (in
3845	+	* which case the action is not applied)
3846	+	* @param action the action
3847	+	* @param <U> the return type of the transformer
3848	+	* @since 1.8
3849	+	*/
3850	+	public <U> void forEachKey(long parallelismThreshold,
3851	+	Function<? super K, ? extends U> transformer,
3852	+	Consumer<? super U> action) {
3853	+	if (transformer == null || action == null)
3854	+	throw new NullPointerException();
3855	+	new ForEachTransformedKeyTask<K,V,U>
3856	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3857	+	transformer, action).invoke();
3858	+	}
3859	+
3860	+	/**
3861	+	* Returns a non-null result from applying the given search
3862	+	* function on each key, or null if none. Upon success,
3863	+	* further element processing is suppressed and the results of
3864	+	* any other parallel invocations of the search function are
3865	+	* ignored.
3866	+	*
3867	+	* @param parallelismThreshold the (estimated) number of elements
3868	+	* needed for this operation to be executed in parallel
3869	+	* @param searchFunction a function returning a non-null
3870	+	* result on success, else null
3871	+	* @param <U> the return type of the search function
3872	+	* @return a non-null result from applying the given search
3873	+	* function on each key, or null if none
3874	+	* @since 1.8
3875	+	*/
3876	+	public <U> U searchKeys(long parallelismThreshold,
3877	+	Function<? super K, ? extends U> searchFunction) {
3878	+	if (searchFunction == null) throw new NullPointerException();
3879	+	return new SearchKeysTask<K,V,U>
3880	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3881	+	searchFunction, new AtomicReference<U>()).invoke();
3882	+	}
3883	+
3884	+	/**
3885	+	* Returns the result of accumulating all keys using the given
3886	+	* reducer to combine values, or null if none.
3887	+	*
3888	+	* @param parallelismThreshold the (estimated) number of elements
3889	+	* needed for this operation to be executed in parallel
3890	+	* @param reducer a commutative associative combining function
3891	+	* @return the result of accumulating all keys using the given
3892	+	* reducer to combine values, or null if none
3893	+	* @since 1.8
3894	+	*/
3895	+	public K reduceKeys(long parallelismThreshold,
3896	+	BiFunction<? super K, ? super K, ? extends K> reducer) {
3897	+	if (reducer == null) throw new NullPointerException();
3898	+	return new ReduceKeysTask<K,V>
3899	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3900	+	null, reducer).invoke();
3901	+	}
3902	+
3903	+	/**
3904	+	* Returns the result of accumulating the given transformation
3905	+	* of all keys using the given reducer to combine values, or
3906	+	* null if none.
3907	+	*
3908	+	* @param parallelismThreshold the (estimated) number of elements
3909	+	* needed for this operation to be executed in parallel
3910	+	* @param transformer a function returning the transformation
3911	+	* for an element, or null if there is no transformation (in
3912	+	* which case it is not combined)
3913	+	* @param reducer a commutative associative combining function
3914	+	* @param <U> the return type of the transformer
3915	+	* @return the result of accumulating the given transformation
3916	+	* of all keys
3917	+	* @since 1.8
3918	+	*/
3919	+	public <U> U reduceKeys(long parallelismThreshold,
3920	+	Function<? super K, ? extends U> transformer,
3921	+	BiFunction<? super U, ? super U, ? extends U> reducer) {
3922	+	if (transformer == null || reducer == null)
3923	+	throw new NullPointerException();
3924	+	return new MapReduceKeysTask<K,V,U>
3925	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3926	+	null, transformer, reducer).invoke();
3927	+	}
3928	+
3929	+	/**
3930	+	* Returns the result of accumulating the given transformation
3931	+	* of all keys using the given reducer to combine values, and
3932	+	* the given basis as an identity value.
3933	+	*
3934	+	* @param parallelismThreshold the (estimated) number of elements
3935	+	* needed for this operation to be executed in parallel
3936	+	* @param transformer a function returning the transformation
3937	+	* for an element
3938	+	* @param basis the identity (initial default value) for the reduction
3939	+	* @param reducer a commutative associative combining function
3940	+	* @return the result of accumulating the given transformation
3941	+	* of all keys
3942	+	* @since 1.8
3943	+	*/
3944	+	public double reduceKeysToDouble(long parallelismThreshold,
3945	+	ToDoubleFunction<? super K> transformer,
3946	+	double basis,
3947	+	DoubleBinaryOperator reducer) {
3948	+	if (transformer == null || reducer == null)
3949	+	throw new NullPointerException();
3950	+	return new MapReduceKeysToDoubleTask<K,V>
3951	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3952	+	null, transformer, basis, reducer).invoke();
3953	+	}
3954	+
3955	+	/**
3956	+	* Returns the result of accumulating the given transformation
3957	+	* of all keys using the given reducer to combine values, and
3958	+	* the given basis as an identity value.
3959	+	*
3960	+	* @param parallelismThreshold the (estimated) number of elements
3961	+	* needed for this operation to be executed in parallel
3962	+	* @param transformer a function returning the transformation
3963	+	* for an element
3964	+	* @param basis the identity (initial default value) for the reduction
3965	+	* @param reducer a commutative associative combining function
3966	+	* @return the result of accumulating the given transformation
3967	+	* of all keys
3968	+	* @since 1.8
3969	+	*/
3970	+	public long reduceKeysToLong(long parallelismThreshold,
3971	+	ToLongFunction<? super K> transformer,
3972	+	long basis,
3973	+	LongBinaryOperator reducer) {
3974	+	if (transformer == null || reducer == null)
3975	+	throw new NullPointerException();
3976	+	return new MapReduceKeysToLongTask<K,V>
3977	+	(null, batchFor(parallelismThreshold), 0, 0, table,
3978	+	null, transformer, basis, reducer).invoke();
3979	+	}
3980	+
3981	+	/**
3982	+	* Returns the result of accumulating the given transformation
3983	+	* of all keys using the given reducer to combine values, and
3984	+	* the given basis as an identity value.
3985	+	*
3986	+	* @param parallelismThreshold the (estimated) number of elements
3987	+	* needed for this operation to be executed in parallel
3988	+	* @param transformer a function returning the transformation
3989	+	* for an element
3990	+	* @param basis the identity (initial default value) for the reduction
3991	+	* @param reducer a commutative associative combining function
3992	+	* @return the result of accumulating the given transformation
3993	+	* of all keys
3994	+	* @since 1.8
3995	+	*/
3996	+	public int reduceKeysToInt(long parallelismThreshold,
3997	+	ToIntFunction<? super K> transformer,
3998	+	int basis,
3999	+	IntBinaryOperator reducer) {
4000	+	if (transformer == null || reducer == null)
4001	+	throw new NullPointerException();
4002	+	return new MapReduceKeysToIntTask<K,V>
4003	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4004	+	null, transformer, basis, reducer).invoke();
4005	+	}
4006	+
4007	+	/**
4008	+	* Performs the given action for each value.
4009	+	*
4010	+	* @param parallelismThreshold the (estimated) number of elements
4011	+	* needed for this operation to be executed in parallel
4012	+	* @param action the action
4013	+	* @since 1.8
4014	+	*/
4015	+	public void forEachValue(long parallelismThreshold,
4016	+	Consumer<? super V> action) {
4017	+	if (action == null)
4018	+	throw new NullPointerException();
4019	+	new ForEachValueTask<K,V>
4020	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4021	+	action).invoke();
4022	+	}
4023	+
4024	+	/**
4025	+	* Performs the given action for each non-null transformation
4026	+	* of each value.
4027	+	*
4028	+	* @param parallelismThreshold the (estimated) number of elements
4029	+	* needed for this operation to be executed in parallel
4030	+	* @param transformer a function returning the transformation
4031	+	* for an element, or null if there is no transformation (in
4032	+	* which case the action is not applied)
4033	+	* @param action the action
4034	+	* @param <U> the return type of the transformer
4035	+	* @since 1.8
4036	+	*/
4037	+	public <U> void forEachValue(long parallelismThreshold,
4038	+	Function<? super V, ? extends U> transformer,
4039	+	Consumer<? super U> action) {
4040	+	if (transformer == null || action == null)
4041	+	throw new NullPointerException();
4042	+	new ForEachTransformedValueTask<K,V,U>
4043	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4044	+	transformer, action).invoke();
4045	+	}
4046	+
4047	+	/**
4048	+	* Returns a non-null result from applying the given search
4049	+	* function on each value, or null if none.  Upon success,
4050	+	* further element processing is suppressed and the results of
4051	+	* any other parallel invocations of the search function are
4052	+	* ignored.
4053	+	*
4054	+	* @param parallelismThreshold the (estimated) number of elements
4055	+	* needed for this operation to be executed in parallel
4056	+	* @param searchFunction a function returning a non-null
4057	+	* result on success, else null
4058	+	* @param <U> the return type of the search function
4059	+	* @return a non-null result from applying the given search
4060	+	* function on each value, or null if none
4061	+	* @since 1.8
4062	+	*/
4063	+	public <U> U searchValues(long parallelismThreshold,
4064	+	Function<? super V, ? extends U> searchFunction) {
4065	+	if (searchFunction == null) throw new NullPointerException();
4066	+	return new SearchValuesTask<K,V,U>
4067	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4068	+	searchFunction, new AtomicReference<U>()).invoke();
4069	+	}
4070	+
4071	+	/**
4072	+	* Returns the result of accumulating all values using the
4073	+	* given reducer to combine values, or null if none.
4074	+	*
4075	+	* @param parallelismThreshold the (estimated) number of elements
4076	+	* needed for this operation to be executed in parallel
4077	+	* @param reducer a commutative associative combining function
4078	+	* @return the result of accumulating all values
4079	+	* @since 1.8
4080	+	*/
4081	+	public V reduceValues(long parallelismThreshold,
4082	+	BiFunction<? super V, ? super V, ? extends V> reducer) {
4083	+	if (reducer == null) throw new NullPointerException();
4084	+	return new ReduceValuesTask<K,V>
4085	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4086	+	null, reducer).invoke();
4087	+	}
4088	+
4089	+	/**
4090	+	* Returns the result of accumulating the given transformation
4091	+	* of all values using the given reducer to combine values, or
4092	+	* null if none.
4093	+	*
4094	+	* @param parallelismThreshold the (estimated) number of elements
4095	+	* needed for this operation to be executed in parallel
4096	+	* @param transformer a function returning the transformation
4097	+	* for an element, or null if there is no transformation (in
4098	+	* which case it is not combined)
4099	+	* @param reducer a commutative associative combining function
4100	+	* @param <U> the return type of the transformer
4101	+	* @return the result of accumulating the given transformation
4102	+	* of all values
4103	+	* @since 1.8
4104	+	*/
4105	+	public <U> U reduceValues(long parallelismThreshold,
4106	+	Function<? super V, ? extends U> transformer,
4107	+	BiFunction<? super U, ? super U, ? extends U> reducer) {
4108	+	if (transformer == null || reducer == null)
4109	+	throw new NullPointerException();
4110	+	return new MapReduceValuesTask<K,V,U>
4111	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4112	+	null, transformer, reducer).invoke();
4113	+	}
4114	+
4115	+	/**
4116	+	* Returns the result of accumulating the given transformation
4117	+	* of all values using the given reducer to combine values,
4118	+	* and the given basis as an identity value.
4119	+	*
4120	+	* @param parallelismThreshold the (estimated) number of elements
4121	+	* needed for this operation to be executed in parallel
4122	+	* @param transformer a function returning the transformation
4123	+	* for an element
4124	+	* @param basis the identity (initial default value) for the reduction
4125	+	* @param reducer a commutative associative combining function
4126	+	* @return the result of accumulating the given transformation
4127	+	* of all values
4128	+	* @since 1.8
4129	+	*/
4130	+	public double reduceValuesToDouble(long parallelismThreshold,
4131	+	ToDoubleFunction<? super V> transformer,
4132	+	double basis,
4133	+	DoubleBinaryOperator reducer) {
4134	+	if (transformer == null || reducer == null)
4135	+	throw new NullPointerException();
4136	+	return new MapReduceValuesToDoubleTask<K,V>
4137	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4138	+	null, transformer, basis, reducer).invoke();
4139	+	}
4140	+
4141	+	/**
4142	+	* Returns the result of accumulating the given transformation
4143	+	* of all values using the given reducer to combine values,
4144	+	* and the given basis as an identity value.
4145	+	*
4146	+	* @param parallelismThreshold the (estimated) number of elements
4147	+	* needed for this operation to be executed in parallel
4148	+	* @param transformer a function returning the transformation
4149	+	* for an element
4150	+	* @param basis the identity (initial default value) for the reduction
4151	+	* @param reducer a commutative associative combining function
4152	+	* @return the result of accumulating the given transformation
4153	+	* of all values
4154	+	* @since 1.8
4155	+	*/
4156	+	public long reduceValuesToLong(long parallelismThreshold,
4157	+	ToLongFunction<? super V> transformer,
4158	+	long basis,
4159	+	LongBinaryOperator reducer) {
4160	+	if (transformer == null || reducer == null)
4161	+	throw new NullPointerException();
4162	+	return new MapReduceValuesToLongTask<K,V>
4163	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4164	+	null, transformer, basis, reducer).invoke();
4165	+	}
4166	+
4167	+	/**
4168	+	* Returns the result of accumulating the given transformation
4169	+	* of all values using the given reducer to combine values,
4170	+	* and the given basis as an identity value.
4171	+	*
4172	+	* @param parallelismThreshold the (estimated) number of elements
4173	+	* needed for this operation to be executed in parallel
4174	+	* @param transformer a function returning the transformation
4175	+	* for an element
4176	+	* @param basis the identity (initial default value) for the reduction
4177	+	* @param reducer a commutative associative combining function
4178	+	* @return the result of accumulating the given transformation
4179	+	* of all values
4180	+	* @since 1.8
4181	+	*/
4182	+	public int reduceValuesToInt(long parallelismThreshold,
4183	+	ToIntFunction<? super V> transformer,
4184	+	int basis,
4185	+	IntBinaryOperator reducer) {
4186	+	if (transformer == null || reducer == null)
4187	+	throw new NullPointerException();
4188	+	return new MapReduceValuesToIntTask<K,V>
4189	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4190	+	null, transformer, basis, reducer).invoke();
4191	+	}
4192	+
4193	+	/**
4194	+	* Performs the given action for each entry.
4195	+	*
4196	+	* @param parallelismThreshold the (estimated) number of elements
4197	+	* needed for this operation to be executed in parallel
4198	+	* @param action the action
4199	+	* @since 1.8
4200	+	*/
4201	+	public void forEachEntry(long parallelismThreshold,
4202	+	Consumer<? super Map.Entry<K,V>> action) {
4203	+	if (action == null) throw new NullPointerException();
4204	+	new ForEachEntryTask<K,V>(null, batchFor(parallelismThreshold), 0, 0, table,
4205	+	action).invoke();
4206	+	}
4207	+
4208	+	/**
4209	+	* Performs the given action for each non-null transformation
4210	+	* of each entry.
4211	+	*
4212	+	* @param parallelismThreshold the (estimated) number of elements
4213	+	* needed for this operation to be executed in parallel
4214	+	* @param transformer a function returning the transformation
4215	+	* for an element, or null if there is no transformation (in
4216	+	* which case the action is not applied)
4217	+	* @param action the action
4218	+	* @param <U> the return type of the transformer
4219	+	* @since 1.8
4220	+	*/
4221	+	public <U> void forEachEntry(long parallelismThreshold,
4222	+	Function<Map.Entry<K,V>, ? extends U> transformer,
4223	+	Consumer<? super U> action) {
4224	+	if (transformer == null || action == null)
4225	+	throw new NullPointerException();
4226	+	new ForEachTransformedEntryTask<K,V,U>
4227	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4228	+	transformer, action).invoke();
4229	+	}
4230	+
4231	+	/**
4232	+	* Returns a non-null result from applying the given search
4233	+	* function on each entry, or null if none.  Upon success,
4234	+	* further element processing is suppressed and the results of
4235	+	* any other parallel invocations of the search function are
4236	+	* ignored.
4237	+	*
4238	+	* @param parallelismThreshold the (estimated) number of elements
4239	+	* needed for this operation to be executed in parallel
4240	+	* @param searchFunction a function returning a non-null
4241	+	* result on success, else null
4242	+	* @param <U> the return type of the search function
4243	+	* @return a non-null result from applying the given search
4244	+	* function on each entry, or null if none
4245	+	* @since 1.8
4246	+	*/
4247	+	public <U> U searchEntries(long parallelismThreshold,
4248	+	Function<Map.Entry<K,V>, ? extends U> searchFunction) {
4249	+	if (searchFunction == null) throw new NullPointerException();
4250	+	return new SearchEntriesTask<K,V,U>
4251	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4252	+	searchFunction, new AtomicReference<U>()).invoke();
4253	+	}
4254	+
4255	+	/**
4256	+	* Returns the result of accumulating all entries using the
4257	+	* given reducer to combine values, or null if none.
4258	+	*
4259	+	* @param parallelismThreshold the (estimated) number of elements
4260	+	* needed for this operation to be executed in parallel
4261	+	* @param reducer a commutative associative combining function
4262	+	* @return the result of accumulating all entries
4263	+	* @since 1.8
4264	+	*/
4265	+	public Map.Entry<K,V> reduceEntries(long parallelismThreshold,
4266	+	BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4267	+	if (reducer == null) throw new NullPointerException();
4268	+	return new ReduceEntriesTask<K,V>
4269	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4270	+	null, reducer).invoke();
4271	+	}
4272	+
4273	+	/**
4274	+	* Returns the result of accumulating the given transformation
4275	+	* of all entries using the given reducer to combine values,
4276	+	* or null if none.
4277	+	*
4278	+	* @param parallelismThreshold the (estimated) number of elements
4279	+	* needed for this operation to be executed in parallel
4280	+	* @param transformer a function returning the transformation
4281	+	* for an element, or null if there is no transformation (in
4282	+	* which case it is not combined)
4283	+	* @param reducer a commutative associative combining function
4284	+	* @param <U> the return type of the transformer
4285	+	* @return the result of accumulating the given transformation
4286	+	* of all entries
4287	+	* @since 1.8
4288	+	*/
4289	+	public <U> U reduceEntries(long parallelismThreshold,
4290	+	Function<Map.Entry<K,V>, ? extends U> transformer,
4291	+	BiFunction<? super U, ? super U, ? extends U> reducer) {
4292	+	if (transformer == null || reducer == null)
4293	+	throw new NullPointerException();
4294	+	return new MapReduceEntriesTask<K,V,U>
4295	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4296	+	null, transformer, reducer).invoke();
4297	+	}
4298	+
4299	+	/**
4300	+	* Returns the result of accumulating the given transformation
4301	+	* of all entries using the given reducer to combine values,
4302	+	* and the given basis as an identity value.
4303	+	*
4304	+	* @param parallelismThreshold the (estimated) number of elements
4305	+	* needed for this operation to be executed in parallel
4306	+	* @param transformer a function returning the transformation
4307	+	* for an element
4308	+	* @param basis the identity (initial default value) for the reduction
4309	+	* @param reducer a commutative associative combining function
4310	+	* @return the result of accumulating the given transformation
4311	+	* of all entries
4312	+	* @since 1.8
4313	+	*/
4314	+	public double reduceEntriesToDouble(long parallelismThreshold,
4315	+	ToDoubleFunction<Map.Entry<K,V>> transformer,
4316	+	double basis,
4317	+	DoubleBinaryOperator reducer) {
4318	+	if (transformer == null || reducer == null)
4319	+	throw new NullPointerException();
4320	+	return new MapReduceEntriesToDoubleTask<K,V>
4321	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4322	+	null, transformer, basis, reducer).invoke();
4323	+	}
4324	+
4325	+	/**
4326	+	* Returns the result of accumulating the given transformation
4327	+	* of all entries using the given reducer to combine values,
4328	+	* and the given basis as an identity value.
4329	+	*
4330	+	* @param parallelismThreshold the (estimated) number of elements
4331	+	* needed for this operation to be executed in parallel
4332	+	* @param transformer a function returning the transformation
4333	+	* for an element
4334	+	* @param basis the identity (initial default value) for the reduction
4335	+	* @param reducer a commutative associative combining function
4336	+	* @return the result of accumulating the given transformation
4337	+	* of all entries
4338	+	* @since 1.8
4339	+	*/
4340	+	public long reduceEntriesToLong(long parallelismThreshold,
4341	+	ToLongFunction<Map.Entry<K,V>> transformer,
4342	+	long basis,
4343	+	LongBinaryOperator reducer) {
4344	+	if (transformer == null || reducer == null)
4345	+	throw new NullPointerException();
4346	+	return new MapReduceEntriesToLongTask<K,V>
4347	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4348	+	null, transformer, basis, reducer).invoke();
4349	+	}
4350	+
4351	+	/**
4352	+	* Returns the result of accumulating the given transformation
4353	+	* of all entries using the given reducer to combine values,
4354	+	* and the given basis as an identity value.
4355	+	*
4356	+	* @param parallelismThreshold the (estimated) number of elements
4357	+	* needed for this operation to be executed in parallel
4358	+	* @param transformer a function returning the transformation
4359	+	* for an element
4360	+	* @param basis the identity (initial default value) for the reduction
4361	+	* @param reducer a commutative associative combining function
4362	+	* @return the result of accumulating the given transformation
4363	+	* of all entries
4364	+	* @since 1.8
4365	+	*/
4366	+	public int reduceEntriesToInt(long parallelismThreshold,
4367	+	ToIntFunction<Map.Entry<K,V>> transformer,
4368	+	int basis,
4369	+	IntBinaryOperator reducer) {
4370	+	if (transformer == null || reducer == null)
4371	+	throw new NullPointerException();
4372	+	return new MapReduceEntriesToIntTask<K,V>
4373	+	(null, batchFor(parallelismThreshold), 0, 0, table,
4374	+	null, transformer, basis, reducer).invoke();
4375	+	}
4376	+
4377	+
4378	+	/* ----------------Views -------------- */
4379	+
4380	+	/**
4381	+	* Base class for views.
4382	+	*/
4383	+	abstract static class CollectionView<K,V,E>
4384	+	implements Collection<E>, java.io.Serializable {
4385	+	private static final long serialVersionUID = 7249069246763182397L;
4386	+	final ConcurrentHashMap<K,V> map;
4387	+	CollectionView(ConcurrentHashMap<K,V> map)  { this.map = map; }
4388
4389		/**
4390	<	* Returns a task that when invoked, performs the given action
4497	<	* for each value.
4390	>	* Returns the map backing this view.
4391		*
4392	<	* @param map the map
4500	<	* @param action the action
4392	>	* @return the map backing this view
4393		*/
4394	<	public static <K,V> ForkJoinTask<Void> forEachValue
4503	<	(ConcurrentHashMap<K,V> map,
4504	<	Action<V> action) {
4505	<	if (action == null) throw new NullPointerException();
4506	<	return new ForEachValueTask<K,V>(map, null, -1, action);
4507	<	}
4394	>	public ConcurrentHashMap<K,V> getMap() { return map; }
4395
4396		/**
4397	<	* Returns a task that when invoked, performs the given action
4398	<	* for each non-null transformation of each value.
4512	<	*
4513	<	* @param map the map
4514	<	* @param transformer a function returning the transformation
4515	<	* for an element, or null of there is no transformation (in
4516	<	* which case the action is not applied).
4517	<	* @param action the action
4397	>	* Removes all of the elements from this view, by removing all
4398	>	* the mappings from the map backing this view.
4399		*/
4400	<	public static <K,V,U> ForkJoinTask<Void> forEachValue
4401	<	(ConcurrentHashMap<K,V> map,
4402	<	Fun<? super V, ? extends U> transformer,
4522	<	Action<U> action) {
4523	<	if (transformer == null || action == null)
4524	<	throw new NullPointerException();
4525	<	return new ForEachTransformedValueTask<K,V,U>
4526	<	(map, null, -1, transformer, action);
4527	<	}
4400	>	public final void clear()      { map.clear(); }
4401	>	public final int size()        { return map.size(); }
4402	>	public final boolean isEmpty() { return map.isEmpty(); }
4403
4404	+	// implementations below rely on concrete classes supplying these
4405	+	// abstract methods
4406		/**
4407	<	* Returns a task that when invoked, returns a non-null result
4531	<	* from applying the given search function on each value, or
4532	<	* null if none.  Upon success, further element processing is
4533	<	* suppressed and the results of any other parallel
4534	<	* invocations of the search function are ignored.
4407	>	* Returns an iterator over the elements in this collection.
4408		*
4409	<	* @param map the map
4410	<	* @param searchFunction a function returning a non-null
4538	<	* result on success, else null
4539	<	* @return the task
4409	>	* <p>The returned iterator is
4410	>	* <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
4411		*
4412	+	* @return an iterator over the elements in this collection
4413		*/
4414	<	public static <K,V,U> ForkJoinTask<U> searchValues
4415	<	(ConcurrentHashMap<K,V> map,
4416	<	Fun<? super V, ? extends U> searchFunction) {
4417	<	if (searchFunction == null) throw new NullPointerException();
4418	<	return new SearchValuesTask<K,V,U>
4419	<	(map, null, -1, searchFunction,
4420	<	new AtomicReference<U>());
4414	>	public abstract Iterator<E> iterator();
4415	>	public abstract boolean contains(Object o);
4416	>	public abstract boolean remove(Object o);
4417	>
4418	>	private static final String OOME_MSG = "Required array size too large";
4419	>
4420	>	public final Object[] toArray() {
4421	>	long sz = map.mappingCount();
4422	>	if (sz > MAX_ARRAY_SIZE)
4423	>	throw new OutOfMemoryError(OOME_MSG);
4424	>	int n = (int)sz;
4425	>	Object[] r = new Object[n];
4426	>	int i = 0;
4427	>	for (E e : this) {
4428	>	if (i == n) {
4429	>	if (n >= MAX_ARRAY_SIZE)
4430	>	throw new OutOfMemoryError(OOME_MSG);
4431	>	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4432	>	n = MAX_ARRAY_SIZE;
4433	>	else
4434	>	n += (n >>> 1) + 1;
4435	>	r = Arrays.copyOf(r, n);
4436	>	}
4437	>	r[i++] = e;
4438	>	}
4439	>	return (i == n) ? r : Arrays.copyOf(r, i);
4440		}
4441
4442	<	/**
4443	<	* Returns a task that when invoked, returns the result of
4444	<	* accumulating all values using the given reducer to combine
4445	<	* values, or null if none.
4446	<	*
4447	<	* @param map the map
4448	<	* @param reducer a commutative associative combining function
4449	<	* @return the task
4450	<	*/
4451	<	public static <K,V> ForkJoinTask<V> reduceValues
4452	<	(ConcurrentHashMap<K,V> map,
4453	<	BiFun<? super V, ? super V, ? extends V> reducer) {
4454	<	if (reducer == null) throw new NullPointerException();
4455	<	return new ReduceValuesTask<K,V>
4456	<	(map, null, -1, null, reducer);
4442	>	@SuppressWarnings("unchecked")
4443	>	public final <T> T[] toArray(T[] a) {
4444	>	long sz = map.mappingCount();
4445	>	if (sz > MAX_ARRAY_SIZE)
4446	>	throw new OutOfMemoryError(OOME_MSG);
4447	>	int m = (int)sz;
4448	>	T[] r = (a.length >= m) ? a :
4449	>	(T[])java.lang.reflect.Array
4450	>	.newInstance(a.getClass().getComponentType(), m);
4451	>	int n = r.length;
4452	>	int i = 0;
4453	>	for (E e : this) {
4454	>	if (i == n) {
4455	>	if (n >= MAX_ARRAY_SIZE)
4456	>	throw new OutOfMemoryError(OOME_MSG);
4457	>	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4458	>	n = MAX_ARRAY_SIZE;
4459	>	else
4460	>	n += (n >>> 1) + 1;
4461	>	r = Arrays.copyOf(r, n);
4462	>	}
4463	>	r[i++] = (T)e;
4464	>	}
4465	>	if (a == r && i < n) {
4466	>	r[i] = null; // null-terminate
4467	>	return r;
4468	>	}
4469	>	return (i == n) ? r : Arrays.copyOf(r, i);
4470		}
4471
4472		/**
4473	<	* Returns a task that when invoked, returns the result of
4474	<	* accumulating the given transformation of all values using the
4475	<	* given reducer to combine values, or null if none.
4473	>	* Returns a string representation of this collection.
4474	>	* The string representation consists of the string representations
4475	>	* of the collection's elements in the order they are returned by
4476	>	* its iterator, enclosed in square brackets ({@code "[]"}).
4477	>	* Adjacent elements are separated by the characters {@code ", "}
4478	>	* (comma and space).  Elements are converted to strings as by
4479	>	* {@link String#valueOf(Object)}.
4480		*
4481	<	* @param map the map
4574	<	* @param transformer a function returning the transformation
4575	<	* for an element, or null of there is no transformation (in
4576	<	* which case it is not combined).
4577	<	* @param reducer a commutative associative combining function
4578	<	* @return the task
4481	>	* @return a string representation of this collection
4482		*/
4483	<	public static <K,V,U> ForkJoinTask<U> reduceValues
4484	<	(ConcurrentHashMap<K,V> map,
4485	<	Fun<? super V, ? extends U> transformer,
4486	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4487	<	if (transformer == null || reducer == null)
4488	<	throw new NullPointerException();
4489	<	return new MapReduceValuesTask<K,V,U>
4490	<	(map, null, -1, null, transformer, reducer);
4483	>	public final String toString() {
4484	>	StringBuilder sb = new StringBuilder();
4485	>	sb.append('[');
4486	>	Iterator<E> it = iterator();
4487	>	if (it.hasNext()) {
4488	>	for (;;) {
4489	>	Object e = it.next();
4490	>	sb.append(e == this ? "(this Collection)" : e);
4491	>	if (!it.hasNext())
4492	>	break;
4493	>	sb.append(',').append(' ');
4494	>	}
4495	>	}
4496	>	return sb.append(']').toString();
4497		}
4498
4499	<	/**
4500	<	* Returns a task that when invoked, returns the result of
4501	<	* accumulating the given transformation of all values using the
4502	<	* given reducer to combine values, and the given basis as an
4503	<	* identity value.
4504	<	*
4505	<	* @param map the map
4506	<	* @param transformer a function returning the transformation
4598	<	* for an element
4599	<	* @param basis the identity (initial default value) for the reduction
4600	<	* @param reducer a commutative associative combining function
4601	<	* @return the task
4602	<	*/
4603	<	public static <K,V> ForkJoinTask<Double> reduceValuesToDouble
4604	<	(ConcurrentHashMap<K,V> map,
4605	<	ObjectToDouble<? super V> transformer,
4606	<	double basis,
4607	<	DoubleByDoubleToDouble reducer) {
4608	<	if (transformer == null || reducer == null)
4609	<	throw new NullPointerException();
4610	<	return new MapReduceValuesToDoubleTask<K,V>
4611	<	(map, null, -1, null, transformer, basis, reducer);
4499	>	public final boolean containsAll(Collection<?> c) {
4500	>	if (c != this) {
4501	>	for (Object e : c) {
4502	>	if (e == null || !contains(e))
4503	>	return false;
4504	>	}
4505	>	}
4506	>	return true;
4507		}
4508
4509	<	/**
4510	<	* Returns a task that when invoked, returns the result of
4511	<	* accumulating the given transformation of all values using the
4512	<	* given reducer to combine values, and the given basis as an
4513	<	* identity value.
4514	<	*
4515	<	* @param map the map
4516	<	* @param transformer a function returning the transformation
4517	<	* for an element
4518	<	* @param basis the identity (initial default value) for the reduction
4519	<	* @param reducer a commutative associative combining function
4520	<	* @return the task
4521	<	*/
4522	<	public static <K,V> ForkJoinTask<Long> reduceValuesToLong
4523	<	(ConcurrentHashMap<K,V> map,
4524	<	ObjectToLong<? super V> transformer,
4525	<	long basis,
4526	<	LongByLongToLong reducer) {
4527	<	if (transformer == null || reducer == null)
4528	<	throw new NullPointerException();
4634	<	return new MapReduceValuesToLongTask<K,V>
4635	<	(map, null, -1, null, transformer, basis, reducer);
4509	>	public boolean removeAll(Collection<?> c) {
4510	>	if (c == null) throw new NullPointerException();
4511	>	boolean modified = false;
4512	>	// Use (c instanceof Set) as a hint that lookup in c is as
4513	>	// efficient as this view
4514	>	Node<K,V>[] t;
4515	>	if ((t = map.table) == null) {
4516	>	return false;
4517	>	} else if (c instanceof Set<?> && c.size() > t.length) {
4518	>	for (Iterator<?> it = iterator(); it.hasNext(); ) {
4519	>	if (c.contains(it.next())) {
4520	>	it.remove();
4521	>	modified = true;
4522	>	}
4523	>	}
4524	>	} else {
4525	>	for (Object e : c)
4526	>	modified |= remove(e);
4527	>	}
4528	>	return modified;
4529		}
4530
4531	<	/**
4532	<	* Returns a task that when invoked, returns the result of
4533	<	* accumulating the given transformation of all values using the
4534	<	* given reducer to combine values, and the given basis as an
4535	<	* identity value.
4536	<	*
4537	<	* @param map the map
4538	<	* @param transformer a function returning the transformation
4539	<	* for an element
4540	<	* @param basis the identity (initial default value) for the reduction
4648	<	* @param reducer a commutative associative combining function
4649	<	* @return the task
4650	<	*/
4651	<	public static <K,V> ForkJoinTask<Integer> reduceValuesToInt
4652	<	(ConcurrentHashMap<K,V> map,
4653	<	ObjectToInt<? super V> transformer,
4654	<	int basis,
4655	<	IntByIntToInt reducer) {
4656	<	if (transformer == null || reducer == null)
4657	<	throw new NullPointerException();
4658	<	return new MapReduceValuesToIntTask<K,V>
4659	<	(map, null, -1, null, transformer, basis, reducer);
4531	>	public final boolean retainAll(Collection<?> c) {
4532	>	if (c == null) throw new NullPointerException();
4533	>	boolean modified = false;
4534	>	for (Iterator<E> it = iterator(); it.hasNext();) {
4535	>	if (!c.contains(it.next())) {
4536	>	it.remove();
4537	>	modified = true;
4538	>	}
4539	>	}
4540	>	return modified;
4541		}
4542
4543	<	/**
4544	<	* Returns a task that when invoked, perform the given action
4545	<	* for each entry.
4546	<	*
4547	<	* @param map the map
4548	<	* @param action the action
4549	<	*/
4550	<	public static <K,V> ForkJoinTask<Void> forEachEntry
4551	<	(ConcurrentHashMap<K,V> map,
4552	<	Action<Map.Entry<K,V>> action) {
4553	<	if (action == null) throw new NullPointerException();
4554	<	return new ForEachEntryTask<K,V>(map, null, -1, action);
4543	>	}
4544	>
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.
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 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
4561	>	super(map);
4562	>	this.value = value;
4563		}
4564
4565		/**
4566	<	* Returns a task that when invoked, perform the given action
4567	<	* for each non-null transformation of each entry.
4566	>	* Returns the default mapped value for additions,
4567	>	* or {@code null} if additions are not supported.
4568		*
4569	<	* @param map the map
4570	<	* @param transformer a function returning the transformation
4682	<	* for an element, or null of there is no transformation (in
4683	<	* which case the action is not applied).
4684	<	* @param action the action
4569	>	* @return the default mapped value for additions, or {@code null}
4570	>	* if not supported
4571		*/
4572	<	public static <K,V,U> ForkJoinTask<Void> forEachEntry
4687	<	(ConcurrentHashMap<K,V> map,
4688	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
4689	<	Action<U> action) {
4690	<	if (transformer == null || action == null)
4691	<	throw new NullPointerException();
4692	<	return new ForEachTransformedEntryTask<K,V,U>
4693	<	(map, null, -1, transformer, action);
4694	<	}
4572	>	public V getMappedValue() { return value; }
4573
4574		/**
4575	<	* Returns a task that when invoked, returns a non-null result
4576	<	* from applying the given search function on each entry, or
4699	<	* null if none.  Upon success, further element processing is
4700	<	* suppressed and the results of any other parallel
4701	<	* invocations of the search function are ignored.
4702	<	*
4703	<	* @param map the map
4704	<	* @param searchFunction a function returning a non-null
4705	<	* result on success, else null
4706	<	* @return the task
4707	<	*
4575	>	* {@inheritDoc}
4576	>	* @throws NullPointerException if the specified key is null
4577		*/
4578	<	public static <K,V,U> ForkJoinTask<U> searchEntries
4710	<	(ConcurrentHashMap<K,V> map,
4711	<	Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4712	<	if (searchFunction == null) throw new NullPointerException();
4713	<	return new SearchEntriesTask<K,V,U>
4714	<	(map, null, -1, searchFunction,
4715	<	new AtomicReference<U>());
4716	<	}
4578	>	public boolean contains(Object o) { return map.containsKey(o); }
4579
4580		/**
4581	<	* Returns a task that when invoked, returns the result of
4582	<	* accumulating all entries using the given reducer to combine
4583	<	* values, or null if none.
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	<	* @param map the map
4586	<	* @param reducer a commutative associative combining function
4587	<	* @return the task
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 static <K,V> ForkJoinTask<Map.Entry<K,V>> reduceEntries
4728	<	(ConcurrentHashMap<K,V> map,
4729	<	BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4730	<	if (reducer == null) throw new NullPointerException();
4731	<	return new ReduceEntriesTask<K,V>
4732	<	(map, null, -1, null, reducer);
4733	<	}
4589	>	public boolean remove(Object o) { return map.remove(o) != null; }
4590
4591		/**
4592	<	* Returns a task that when invoked, returns the result of
4737	<	* accumulating the given transformation of all entries using the
4738	<	* given reducer to combine values, or null if none.
4739	<	*
4740	<	* @param map the map
4741	<	* @param transformer a function returning the transformation
4742	<	* for an element, or null of there is no transformation (in
4743	<	* which case it is not combined).
4744	<	* @param reducer a commutative associative combining function
4745	<	* @return the task
4592	>	* @return an iterator over the keys of the backing map
4593		*/
4594	<	public static <K,V,U> ForkJoinTask<U> reduceEntries
4595	<	(ConcurrentHashMap<K,V> map,
4596	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
4597	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4598	<	if (transformer == null || reducer == null)
4752	<	throw new NullPointerException();
4753	<	return new MapReduceEntriesTask<K,V,U>
4754	<	(map, null, -1, null, transformer, reducer);
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	<	* Returns a task that when invoked, returns the result of
4603	<	* accumulating the given transformation of all entries using the
4760	<	* given reducer to combine values, and the given basis as an
4761	<	* identity value.
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 map the map
4606	<	* @param transformer a function returning the transformation
4607	<	* for an element
4608	<	* @param basis the identity (initial default value) for the reduction
4609	<	* @param reducer a commutative associative combining function
4768	<	* @return the task
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		*/
4611	<	public static <K,V> ForkJoinTask<Double> reduceEntriesToDouble
4612	<	(ConcurrentHashMap<K,V> map,
4613	<	ObjectToDouble<Map.Entry<K,V>> transformer,
4614	<	double basis,
4615	<	DoubleByDoubleToDouble reducer) {
4775	<	if (transformer == null || reducer == null)
4776	<	throw new NullPointerException();
4777	<	return new MapReduceEntriesToDoubleTask<K,V>
4778	<	(map, null, -1, null, transformer, basis, reducer);
4611	>	public boolean add(K e) {
4612	>	V v;
4613	>	if ((v = value) == null)
4614	>	throw new UnsupportedOperationException();
4615	>	return map.putVal(e, v, true) == null;
4616		}
4617
4618		/**
4619	<	* Returns a task that when invoked, returns the result of
4620	<	* accumulating the given transformation of all entries using the
4784	<	* given reducer to combine values, and the given basis as an
4785	<	* identity value.
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 map the map
4623	<	* @param transformer a function returning the transformation
4624	<	* for an element
4625	<	* @param basis the identity (initial default value) for the reduction
4626	<	* @param reducer a commutative associative combining function
4627	<	* @return the task
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 static <K,V> ForkJoinTask<Long> reduceEntriesToLong
4630	<	(ConcurrentHashMap<K,V> map,
4631	<	ObjectToLong<Map.Entry<K,V>> transformer,
4632	<	long basis,
4633	<	LongByLongToLong reducer) {
4634	<	if (transformer == null || reducer == null)
4635	<	throw new NullPointerException();
4636	<	return new MapReduceEntriesToLongTask<K,V>
4637	<	(map, null, -1, null, transformer, basis, reducer);
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 (map.putVal(e, v, true) == null)
4636	>	added = true;
4637	>	}
4638	>	return added;
4639		}
4640
4641	<	/**
4642	<	* Returns a task that when invoked, returns the result of
4643	<	* accumulating the given transformation of all entries using the
4644	<	* given reducer to combine values, and the given basis as an
4645	<	* identity value.
4810	<	*
4811	<	* @param map the map
4812	<	* @param transformer a function returning the transformation
4813	<	* for an element
4814	<	* @param basis the identity (initial default value) for the reduction
4815	<	* @param reducer a commutative associative combining function
4816	<	* @return the task
4817	<	*/
4818	<	public static <K,V> ForkJoinTask<Integer> reduceEntriesToInt
4819	<	(ConcurrentHashMap<K,V> map,
4820	<	ObjectToInt<Map.Entry<K,V>> transformer,
4821	<	int basis,
4822	<	IntByIntToInt reducer) {
4823	<	if (transformer == null || reducer == null)
4824	<	throw new NullPointerException();
4825	<	return new MapReduceEntriesToIntTask<K,V>
4826	<	(map, null, -1, null, transformer, basis, reducer);
4641	>	public int hashCode() {
4642	>	int h = 0;
4643	>	for (K e : this)
4644	>	h += e.hashCode();
4645	>	return h;
4646		}
4828	–	}
4647
4648	<	// -------------------------------------------------------
4648	>	public boolean equals(Object o) {
4649	>	Set<?> c;
4650	>	return ((o instanceof Set) &&
4651	>	((c = (Set<?>)o) == this ||
4652	>	(containsAll(c) && c.containsAll(this))));
4653	>	}
4654
4655	<	/**
4656	<	* Base for FJ tasks for bulk operations. This adds a variant of
4657	<	* CountedCompleters and some split and merge bookkeeping to
4658	<	* iterator functionality. The forEach and reduce methods are
4659	<	* similar to those illustrated in CountedCompleter documentation,
4660	<	* except that bottom-up reduction completions perform them within
4661	<	* their compute methods. The search methods are like forEach
4839	<	* except they continually poll for success and exit early.  Also,
4840	<	* exceptions are handled in a simpler manner, by just trying to
4841	<	* complete root task exceptionally.
4842	<	*/
4843	<	@SuppressWarnings("serial") static abstract class BulkTask<K,V,R> extends Traverser<K,V,R> {
4844	<	final BulkTask<K,V,?> parent;  // completion target
4845	<	int batch;                     // split control; -1 for unknown
4846	<	int pending;                   // completion control
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	<	BulkTask(ConcurrentHashMap<K,V> map, BulkTask<K,V,?> parent,
4664	<	int batch) {
4665	<	super(map);
4666	<	this.parent = parent;
4667	<	this.batch = batch;
4668	<	if (parent != null && map != null) { // split parent
4669	<	Node[] t;
4855	<	if ((t = parent.tab) == null &&
4856	<	(t = parent.tab = map.table) != null)
4857	<	parent.baseLimit = parent.baseSize = t.length;
4858	<	this.tab = t;
4859	<	this.baseSize = parent.baseSize;
4860	<	int hi = this.baseLimit = parent.baseLimit;
4861	<	parent.baseLimit = this.index = this.baseIndex =
4862	<	(hi + parent.baseIndex + 1) >>> 1;
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		}
4672	+	}
4673
4674	<	// FJ methods
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	>	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	<	/**
4688	<	* Propagates completion. Note that all reduce actions
4689	<	* bypass this method to combine while completing.
4690	<	*/
4691	<	final void tryComplete() {
4692	<	BulkTask<K,V,?> a = this, s = a;
4874	<	for (int c;;) {
4875	<	if ((c = a.pending) == 0) {
4876	<	if ((a = (s = a).parent) == null) {
4877	<	s.quietlyComplete();
4878	<	break;
4687	>	public final boolean remove(Object o) {
4688	>	if (o != null) {
4689	>	for (Iterator<V> it = iterator(); it.hasNext();) {
4690	>	if (o.equals(it.next())) {
4691	>	it.remove();
4692	>	return true;
4693		}
4694		}
4881	–	else if (U.compareAndSwapInt(a, PENDING, c, c - 1))
4882	–	break;
4695		}
4696	+	return false;
4697		}
4698
4699	<	/**
4700	<	* Forces root task to complete.
4701	<	* @param ex if null, complete normally, else exceptionally
4702	<	* @return false to simplify use
4703	<	*/
4704	<	final boolean tryCompleteComputation(Throwable ex) {
4705	<	for (BulkTask<K,V,?> a = this;;) {
4706	<	BulkTask<K,V,?> p = a.parent;
4707	<	if (p == null) {
4708	<	if (ex != null)
4709	<	a.completeExceptionally(ex);
4710	<	else
4711	<	a.quietlyComplete();
4712	<	return false;
4699	>	public final Iterator<V> iterator() {
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	>	}
4709	>	public final boolean addAll(Collection<? extends V> c) {
4710	>	throw new UnsupportedOperationException();
4711	>	}
4712	>
4713	>	@Override public boolean removeAll(Collection<?> c) {
4714	>	if (c == null) throw new NullPointerException();
4715	>	boolean modified = false;
4716	>	for (Iterator<V> it = iterator(); it.hasNext();) {
4717	>	if (c.contains(it.next())) {
4718	>	it.remove();
4719	>	modified = true;
4720		}
4901	–	a = p;
4721		}
4722	+	return modified;
4723		}
4724
4725	<	/**
4726	<	* Version of tryCompleteComputation for function screening checks
4907	<	*/
4908	<	final boolean abortOnNullFunction() {
4909	<	return tryCompleteComputation(new Error("Unexpected null function"));
4725	>	public boolean removeIf(Predicate<? super V> filter) {
4726	>	return map.removeValueIf(filter);
4727		}
4728
4729	<	// utilities
4729	>	public Spliterator<V> spliterator() {
4730	>	Node<K,V>[] t;
4731	>	ConcurrentHashMap<K,V> m = map;
4732	>	long n = m.sumCount();
4733	>	int f = (t = m.table) == null ? 0 : t.length;
4734	>	return new ValueSpliterator<K,V>(t, f, 0, f, n < 0L ? 0L : n);
4735	>	}
4736
4737	<	/** CompareAndSet pending count */
4738	<	final boolean casPending(int cmp, int val) {
4739	<	return U.compareAndSwapInt(this, PENDING, cmp, val);
4737	>	public void forEach(Consumer<? super V> action) {
4738	>	if (action == null) throw new NullPointerException();
4739	>	Node<K,V>[] t;
4740	>	if ((t = map.table) != null) {
4741	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4742	>	for (Node<K,V> p; (p = it.advance()) != null; )
4743	>	action.accept(p.val);
4744	>	}
4745	>	}
4746	>	}
4747	>
4748	>	/**
4749	>	* A view of a ConcurrentHashMap as a {@link Set} of (key, value)
4750	>	* entries.  This class cannot be directly instantiated. See
4751	>	* {@link #entrySet()}.
4752	>	*/
4753	>	static final class EntrySetView<K,V> extends CollectionView<K,V,Map.Entry<K,V>>
4754	>	implements Set<Map.Entry<K,V>>, java.io.Serializable {
4755	>	private static final long serialVersionUID = 2249069246763182397L;
4756	>	EntrySetView(ConcurrentHashMap<K,V> map) { super(map); }
4757	>
4758	>	public boolean contains(Object o) {
4759	>	Object k, v, r; Map.Entry<?,?> e;
4760	>	return ((o instanceof Map.Entry) &&
4761	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4762	>	(r = map.get(k)) != null &&
4763	>	(v = e.getValue()) != null &&
4764	>	(v == r || v.equals(r)));
4765	>	}
4766	>
4767	>	public boolean remove(Object o) {
4768	>	Object k, v; Map.Entry<?,?> e;
4769	>	return ((o instanceof Map.Entry) &&
4770	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4771	>	(v = e.getValue()) != null &&
4772	>	map.remove(k, v));
4773		}
4774
4775		/**
4776	<	* Returns approx exp2 of the number of times (minus one) to
4921	<	* split task by two before executing leaf action. This value
4922	<	* is faster to compute and more convenient to use as a guide
4923	<	* to splitting than is the depth, since it is used while
4924	<	* dividing by two anyway.
4776	>	* @return an iterator over the entries of the backing map
4777		*/
4778	<	final int batch() {
4779	<	ConcurrentHashMap<K, V> m; int b; Node[] t;
4780	<	if ((b = batch) < 0 && (m = map) != null) { // force initialization
4781	<	if ((t = tab) == null && (t = tab = m.table) != null)
4782	<	baseLimit = baseSize = t.length;
4783	<	if (t != null) {
4784	<	long n = m.counter.sum();
4785	<	int sp = getPool().getParallelism() << 3; // slack of 8
4786	<	b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
4778	>	public Iterator<Map.Entry<K,V>> iterator() {
4779	>	ConcurrentHashMap<K,V> m = map;
4780	>	Node<K,V>[] t;
4781	>	int f = (t = m.table) == null ? 0 : t.length;
4782	>	return new EntryIterator<K,V>(t, f, 0, f, m);
4783	>	}
4784	>
4785	>	public boolean add(Entry<K,V> e) {
4786	>	return map.putVal(e.getKey(), e.getValue(), false) == null;
4787	>	}
4788	>
4789	>	public boolean addAll(Collection<? extends Entry<K,V>> c) {
4790	>	boolean added = false;
4791	>	for (Entry<K,V> e : c) {
4792	>	if (add(e))
4793	>	added = true;
4794	>	}
4795	>	return added;
4796	>	}
4797	>
4798	>	public boolean removeIf(Predicate<? super Entry<K,V>> filter) {
4799	>	return map.removeEntryIf(filter);
4800	>	}
4801	>
4802	>	public final int hashCode() {
4803	>	int h = 0;
4804	>	Node<K,V>[] t;
4805	>	if ((t = map.table) != null) {
4806	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4807	>	for (Node<K,V> p; (p = it.advance()) != null; ) {
4808	>	h += p.hashCode();
4809		}
4810		}
4811	<	return b;
4811	>	return h;
4812	>	}
4813	>
4814	>	public final boolean equals(Object o) {
4815	>	Set<?> c;
4816	>	return ((o instanceof Set) &&
4817	>	((c = (Set<?>)o) == this ||
4818	>	(containsAll(c) && c.containsAll(this))));
4819	>	}
4820	>
4821	>	public Spliterator<Map.Entry<K,V>> spliterator() {
4822	>	Node<K,V>[] t;
4823	>	ConcurrentHashMap<K,V> m = map;
4824	>	long n = m.sumCount();
4825	>	int f = (t = m.table) == null ? 0 : t.length;
4826	>	return new EntrySpliterator<K,V>(t, f, 0, f, n < 0L ? 0L : n, m);
4827	>	}
4828	>
4829	>	public void forEach(Consumer<? super Map.Entry<K,V>> action) {
4830	>	if (action == null) throw new NullPointerException();
4831	>	Node<K,V>[] t;
4832	>	if ((t = map.table) != null) {
4833	>	Traverser<K,V> it = new Traverser<K,V>(t, t.length, 0, t.length);
4834	>	for (Node<K,V> p; (p = it.advance()) != null; )
4835	>	action.accept(new MapEntry<K,V>(p.key, p.val, map));
4836	>	}
4837	>	}
4838	>
4839	>	}
4840	>
4841	>	// -------------------------------------------------------
4842	>
4843	>	/**
4844	>	* Base class for bulk tasks. Repeats some fields and code from
4845	>	* class Traverser, because we need to subclass CountedCompleter.
4846	>	*/
4847	>	@SuppressWarnings("serial")
4848	>	abstract static class BulkTask<K,V,R> extends CountedCompleter<R> {
4849	>	Node<K,V>[] tab;        // same as Traverser
4850	>	Node<K,V> next;
4851	>	TableStack<K,V> stack, spare;
4852	>	int index;
4853	>	int baseIndex;
4854	>	int baseLimit;
4855	>	final int baseSize;
4856	>	int batch;              // split control
4857	>
4858	>	BulkTask(BulkTask<K,V,?> par, int b, int i, int f, Node<K,V>[] t) {
4859	>	super(par);
4860	>	this.batch = b;
4861	>	this.index = this.baseIndex = i;
4862	>	if ((this.tab = t) == null)
4863	>	this.baseSize = this.baseLimit = 0;
4864	>	else if (par == null)
4865	>	this.baseSize = this.baseLimit = t.length;
4866	>	else {
4867	>	this.baseLimit = f;
4868	>	this.baseSize = par.baseSize;
4869	>	}
4870		}
4871
4872		/**
4873	<	* Returns exportable snapshot entry.
4873	>	* Same as Traverser version.
4874		*/
4875	<	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
4876	<	return new AbstractMap.SimpleEntry<K,V>(k, v);
4875	>	final Node<K,V> advance() {
4876	>	Node<K,V> e;
4877	>	if ((e = next) != null)
4878	>	e = e.next;
4879	>	for (;;) {
4880	>	Node<K,V>[] t; int i, n;
4881	>	if (e != null)
4882	>	return next = e;
4883	>	if (baseIndex >= baseLimit || (t = tab) == null ||
4884	>	(n = t.length) <= (i = index) || i < 0)
4885	>	return next = null;
4886	>	if ((e = tabAt(t, i)) != null && e.hash < 0) {
4887	>	if (e instanceof ForwardingNode) {
4888	>	tab = ((ForwardingNode<K,V>)e).nextTable;
4889	>	e = null;
4890	>	pushState(t, i, n);
4891	>	continue;
4892	>	}
4893	>	else if (e instanceof TreeBin)
4894	>	e = ((TreeBin<K,V>)e).first;
4895	>	else
4896	>	e = null;
4897	>	}
4898	>	if (stack != null)
4899	>	recoverState(n);
4900	>	else if ((index = i + baseSize) >= n)
4901	>	index = ++baseIndex;
4902	>	}
4903		}
4904
4905	<	// Unsafe mechanics
4906	<	private static final sun.misc.Unsafe U;
4907	<	private static final long PENDING;
4908	<	static {
4909	<	try {
4910	<	U = sun.misc.Unsafe.getUnsafe();
4911	<	PENDING = U.objectFieldOffset
4912	<	(BulkTask.class.getDeclaredField("pending"));
4913	<	} catch (Exception e) {
4914	<	throw new Error(e);
4905	>	private void pushState(Node<K,V>[] t, int i, int n) {
4906	>	TableStack<K,V> s = spare;
4907	>	if (s != null)
4908	>	spare = s.next;
4909	>	else
4910	>	s = new TableStack<K,V>();
4911	>	s.tab = t;
4912	>	s.length = n;
4913	>	s.index = i;
4914	>	s.next = stack;
4915	>	stack = s;
4916	>	}
4917	>
4918	>	private void recoverState(int n) {
4919	>	TableStack<K,V> s; int len;
4920	>	while ((s = stack) != null && (index += (len = s.length)) >= n) {
4921	>	n = len;
4922	>	index = s.index;
4923	>	tab = s.tab;
4924	>	s.tab = null;
4925	>	TableStack<K,V> next = s.next;
4926	>	s.next = spare; // save for reuse
4927	>	stack = next;
4928	>	spare = s;
4929		}
4930	+	if (s == null && (index += baseSize) >= n)
4931	+	index = ++baseIndex;
4932		}
4933		}
4934
4935		/*
4936		* Task classes. Coded in a regular but ugly format/style to
4937		* simplify checks that each variant differs in the right way from
4938	<	* others.
4938	>	* others. The null screenings exist because compilers cannot tell
4939	>	* that we've already null-checked task arguments, so we force
4940	>	* simplest hoisted bypass to help avoid convoluted traps.
4941		*/
4942	<
4943	<	@SuppressWarnings("serial") static final class ForEachKeyTask<K,V>
4942	>	@SuppressWarnings("serial")
4943	>	static final class ForEachKeyTask<K,V>
4944		extends BulkTask<K,V,Void> {
4945	<	final Action<K> action;
4945	>	final Consumer<? super K> action;
4946		ForEachKeyTask
4947	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
4948	<	Action<K> action) {
4949	<	super(m, p, b);
4947	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
4948	>	Consumer<? super K> action) {
4949	>	super(p, b, i, f, t);
4950		this.action = action;
4951		}
4952	<	@SuppressWarnings("unchecked") public final boolean exec() {
4953	<	final Action<K> action = this.action;
4954	<	if (action == null)
4955	<	return abortOnNullFunction();
4956	<	try {
4957	<	int b = batch(), c;
4958	<	while (b > 1 && baseIndex != baseLimit) {
4959	<	do {} while (!casPending(c = pending, c+1));
4960	<	new ForEachKeyTask<K,V>(map, this, b >>>= 1, action).fork();
4961	<	}
4962	<	while (advance() != null)
4963	<	action.apply((K)nextKey);
4964	<	tryComplete();
4989	<	} catch (Throwable ex) {
4990	<	return tryCompleteComputation(ex);
4952	>	public final void compute() {
4953	>	final Consumer<? super K> action;
4954	>	if ((action = this.action) != null) {
4955	>	for (int i = baseIndex, f, h; batch > 0 &&
4956	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
4957	>	addToPendingCount(1);
4958	>	new ForEachKeyTask<K,V>
4959	>	(this, batch >>>= 1, baseLimit = h, f, tab,
4960	>	action).fork();
4961	>	}
4962	>	for (Node<K,V> p; (p = advance()) != null;)
4963	>	action.accept(p.key);
4964	>	propagateCompletion();
4965		}
4992	–	return false;
4966		}
4967		}
4968
4969	<	@SuppressWarnings("serial") static final class ForEachValueTask<K,V>
4969	>	@SuppressWarnings("serial")
4970	>	static final class ForEachValueTask<K,V>
4971		extends BulkTask<K,V,Void> {
4972	<	final Action<V> action;
4972	>	final Consumer<? super V> action;
4973		ForEachValueTask
4974	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
4975	<	Action<V> action) {
4976	<	super(m, p, b);
4974	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
4975	>	Consumer<? super V> action) {
4976	>	super(p, b, i, f, t);
4977		this.action = action;
4978		}
4979	<	@SuppressWarnings("unchecked") public final boolean exec() {
4980	<	final Action<V> action = this.action;
4981	<	if (action == null)
4982	<	return abortOnNullFunction();
4983	<	try {
4984	<	int b = batch(), c;
4985	<	while (b > 1 && baseIndex != baseLimit) {
4986	<	do {} while (!casPending(c = pending, c+1));
4987	<	new ForEachValueTask<K,V>(map, this, b >>>= 1, action).fork();
4988	<	}
4989	<	Object v;
4990	<	while ((v = advance()) != null)
4991	<	action.apply((V)v);
5018	<	tryComplete();
5019	<	} catch (Throwable ex) {
5020	<	return tryCompleteComputation(ex);
4979	>	public final void compute() {
4980	>	final Consumer<? super V> action;
4981	>	if ((action = this.action) != null) {
4982	>	for (int i = baseIndex, f, h; batch > 0 &&
4983	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
4984	>	addToPendingCount(1);
4985	>	new ForEachValueTask<K,V>
4986	>	(this, batch >>>= 1, baseLimit = h, f, tab,
4987	>	action).fork();
4988	>	}
4989	>	for (Node<K,V> p; (p = advance()) != null;)
4990	>	action.accept(p.val);
4991	>	propagateCompletion();
4992		}
5022	–	return false;
4993		}
4994		}
4995
4996	<	@SuppressWarnings("serial") static final class ForEachEntryTask<K,V>
4996	>	@SuppressWarnings("serial")
4997	>	static final class ForEachEntryTask<K,V>
4998		extends BulkTask<K,V,Void> {
4999	<	final Action<Entry<K,V>> action;
4999	>	final Consumer<? super Entry<K,V>> action;
5000		ForEachEntryTask
5001	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5002	<	Action<Entry<K,V>> action) {
5003	<	super(m, p, b);
5001	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5002	>	Consumer<? super Entry<K,V>> action) {
5003	>	super(p, b, i, f, t);
5004		this.action = action;
5005		}
5006	<	@SuppressWarnings("unchecked") public final boolean exec() {
5007	<	final Action<Entry<K,V>> action = this.action;
5008	<	if (action == null)
5009	<	return abortOnNullFunction();
5010	<	try {
5011	<	int b = batch(), c;
5012	<	while (b > 1 && baseIndex != baseLimit) {
5013	<	do {} while (!casPending(c = pending, c+1));
5014	<	new ForEachEntryTask<K,V>(map, this, b >>>= 1, action).fork();
5015	<	}
5016	<	Object v;
5017	<	while ((v = advance()) != null)
5018	<	action.apply(entryFor((K)nextKey, (V)v));
5048	<	tryComplete();
5049	<	} catch (Throwable ex) {
5050	<	return tryCompleteComputation(ex);
5006	>	public final void compute() {
5007	>	final Consumer<? super Entry<K,V>> action;
5008	>	if ((action = this.action) != null) {
5009	>	for (int i = baseIndex, f, h; batch > 0 &&
5010	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5011	>	addToPendingCount(1);
5012	>	new ForEachEntryTask<K,V>
5013	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5014	>	action).fork();
5015	>	}
5016	>	for (Node<K,V> p; (p = advance()) != null; )
5017	>	action.accept(p);
5018	>	propagateCompletion();
5019		}
5052	–	return false;
5020		}
5021		}
5022
5023	<	@SuppressWarnings("serial") static final class ForEachMappingTask<K,V>
5023	>	@SuppressWarnings("serial")
5024	>	static final class ForEachMappingTask<K,V>
5025		extends BulkTask<K,V,Void> {
5026	<	final BiAction<K,V> action;
5026	>	final BiConsumer<? super K, ? super V> action;
5027		ForEachMappingTask
5028	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5029	<	BiAction<K,V> action) {
5030	<	super(m, p, b);
5028	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5029	>	BiConsumer<? super K,? super V> action) {
5030	>	super(p, b, i, f, t);
5031		this.action = action;
5032		}
5033	<	@SuppressWarnings("unchecked") public final boolean exec() {
5034	<	final BiAction<K,V> action = this.action;
5035	<	if (action == null)
5036	<	return abortOnNullFunction();
5037	<	try {
5038	<	int b = batch(), c;
5039	<	while (b > 1 && baseIndex != baseLimit) {
5040	<	do {} while (!casPending(c = pending, c+1));
5041	<	new ForEachMappingTask<K,V>(map, this, b >>>= 1,
5042	<	action).fork();
5043	<	}
5044	<	Object v;
5045	<	while ((v = advance()) != null)
5078	<	action.apply((K)nextKey, (V)v);
5079	<	tryComplete();
5080	<	} catch (Throwable ex) {
5081	<	return tryCompleteComputation(ex);
5033	>	public final void compute() {
5034	>	final BiConsumer<? super K, ? super V> action;
5035	>	if ((action = this.action) != null) {
5036	>	for (int i = baseIndex, f, h; batch > 0 &&
5037	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5038	>	addToPendingCount(1);
5039	>	new ForEachMappingTask<K,V>
5040	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5041	>	action).fork();
5042	>	}
5043	>	for (Node<K,V> p; (p = advance()) != null; )
5044	>	action.accept(p.key, p.val);
5045	>	propagateCompletion();
5046		}
5083	–	return false;
5047		}
5048		}
5049
5050	<	@SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U>
5050	>	@SuppressWarnings("serial")
5051	>	static final class ForEachTransformedKeyTask<K,V,U>
5052		extends BulkTask<K,V,Void> {
5053	<	final Fun<? super K, ? extends U> transformer;
5054	<	final Action<U> action;
5053	>	final Function<? super K, ? extends U> transformer;
5054	>	final Consumer<? super U> action;
5055		ForEachTransformedKeyTask
5056	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5057	<	Fun<? super K, ? extends U> transformer,
5058	<	Action<U> action) {
5059	<	super(m, p, b);
5060	<	this.transformer = transformer;
5061	<	this.action = action;
5062	<
5063	<	}
5064	<	@SuppressWarnings("unchecked") public final boolean exec() {
5065	<	final Fun<? super K, ? extends U> transformer =
5066	<	this.transformer;
5067	<	final Action<U> action = this.action;
5068	<	if (transformer == null || action == null)
5105	<	return abortOnNullFunction();
5106	<	try {
5107	<	int b = batch(), c;
5108	<	while (b > 1 && baseIndex != baseLimit) {
5109	<	do {} while (!casPending(c = pending, c+1));
5056	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5057	>	Function<? super K, ? extends U> transformer, Consumer<? super U> action) {
5058	>	super(p, b, i, f, t);
5059	>	this.transformer = transformer; this.action = action;
5060	>	}
5061	>	public final void compute() {
5062	>	final Function<? super K, ? extends U> transformer;
5063	>	final Consumer<? super U> action;
5064	>	if ((transformer = this.transformer) != null &&
5065	>	(action = this.action) != null) {
5066	>	for (int i = baseIndex, f, h; batch > 0 &&
5067	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5068	>	addToPendingCount(1);
5069		new ForEachTransformedKeyTask<K,V,U>
5070	<	(map, this, b >>>= 1, transformer, action).fork();
5070	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5071	>	transformer, action).fork();
5072		}
5073	<	U u;
5074	<	while (advance() != null) {
5075	<	if ((u = transformer.apply((K)nextKey)) != null)
5076	<	action.apply(u);
5077	<	}
5078	<	tryComplete();
5119	<	} catch (Throwable ex) {
5120	<	return tryCompleteComputation(ex);
5073	>	for (Node<K,V> p; (p = advance()) != null; ) {
5074	>	U u;
5075	>	if ((u = transformer.apply(p.key)) != null)
5076	>	action.accept(u);
5077	>	}
5078	>	propagateCompletion();
5079		}
5122	–	return false;
5080		}
5081		}
5082
5083	<	@SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U>
5083	>	@SuppressWarnings("serial")
5084	>	static final class ForEachTransformedValueTask<K,V,U>
5085		extends BulkTask<K,V,Void> {
5086	<	final Fun<? super V, ? extends U> transformer;
5087	<	final Action<U> action;
5086	>	final Function<? super V, ? extends U> transformer;
5087	>	final Consumer<? super U> action;
5088		ForEachTransformedValueTask
5089	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5090	<	Fun<? super V, ? extends U> transformer,
5091	<	Action<U> action) {
5092	<	super(m, p, b);
5093	<	this.transformer = transformer;
5094	<	this.action = action;
5095	<
5096	<	}
5097	<	@SuppressWarnings("unchecked") public final boolean exec() {
5098	<	final Fun<? super V, ? extends U> transformer =
5099	<	this.transformer;
5100	<	final Action<U> action = this.action;
5101	<	if (transformer == null || action == null)
5144	<	return abortOnNullFunction();
5145	<	try {
5146	<	int b = batch(), c;
5147	<	while (b > 1 && baseIndex != baseLimit) {
5148	<	do {} while (!casPending(c = pending, c+1));
5089	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5090	>	Function<? super V, ? extends U> transformer, Consumer<? super U> action) {
5091	>	super(p, b, i, f, t);
5092	>	this.transformer = transformer; this.action = action;
5093	>	}
5094	>	public final void compute() {
5095	>	final Function<? super V, ? extends U> transformer;
5096	>	final Consumer<? super U> action;
5097	>	if ((transformer = this.transformer) != null &&
5098	>	(action = this.action) != null) {
5099	>	for (int i = baseIndex, f, h; batch > 0 &&
5100	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5101	>	addToPendingCount(1);
5102		new ForEachTransformedValueTask<K,V,U>
5103	<	(map, this, b >>>= 1, transformer, action).fork();
5103	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5104	>	transformer, action).fork();
5105	>	}
5106	>	for (Node<K,V> p; (p = advance()) != null; ) {
5107	>	U u;
5108	>	if ((u = transformer.apply(p.val)) != null)
5109	>	action.accept(u);
5110		}
5111	<	Object v; U u;
5153	<	while ((v = advance()) != null) {
5154	<	if ((u = transformer.apply((V)v)) != null)
5155	<	action.apply(u);
5156	<	}
5157	<	tryComplete();
5158	<	} catch (Throwable ex) {
5159	<	return tryCompleteComputation(ex);
5111	>	propagateCompletion();
5112		}
5161	–	return false;
5113		}
5114		}
5115
5116	<	@SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U>
5116	>	@SuppressWarnings("serial")
5117	>	static final class ForEachTransformedEntryTask<K,V,U>
5118		extends BulkTask<K,V,Void> {
5119	<	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5120	<	final Action<U> action;
5119	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5120	>	final Consumer<? super U> action;
5121		ForEachTransformedEntryTask
5122	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5123	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5124	<	Action<U> action) {
5125	<	super(m, p, b);
5126	<	this.transformer = transformer;
5127	<	this.action = action;
5128	<
5129	<	}
5130	<	@SuppressWarnings("unchecked") public final boolean exec() {
5131	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5132	<	this.transformer;
5133	<	final Action<U> action = this.action;
5134	<	if (transformer == null || action == null)
5183	<	return abortOnNullFunction();
5184	<	try {
5185	<	int b = batch(), c;
5186	<	while (b > 1 && baseIndex != baseLimit) {
5187	<	do {} while (!casPending(c = pending, c+1));
5122	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5123	>	Function<Map.Entry<K,V>, ? extends U> transformer, Consumer<? super U> action) {
5124	>	super(p, b, i, f, t);
5125	>	this.transformer = transformer; this.action = action;
5126	>	}
5127	>	public final void compute() {
5128	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5129	>	final Consumer<? super U> action;
5130	>	if ((transformer = this.transformer) != null &&
5131	>	(action = this.action) != null) {
5132	>	for (int i = baseIndex, f, h; batch > 0 &&
5133	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5134	>	addToPendingCount(1);
5135		new ForEachTransformedEntryTask<K,V,U>
5136	<	(map, this, b >>>= 1, transformer, action).fork();
5136	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5137	>	transformer, action).fork();
5138	>	}
5139	>	for (Node<K,V> p; (p = advance()) != null; ) {
5140	>	U u;
5141	>	if ((u = transformer.apply(p)) != null)
5142	>	action.accept(u);
5143		}
5144	<	Object v; U u;
5192	<	while ((v = advance()) != null) {
5193	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5194	<	action.apply(u);
5195	<	}
5196	<	tryComplete();
5197	<	} catch (Throwable ex) {
5198	<	return tryCompleteComputation(ex);
5144	>	propagateCompletion();
5145		}
5200	–	return false;
5146		}
5147		}
5148
5149	<	@SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U>
5149	>	@SuppressWarnings("serial")
5150	>	static final class ForEachTransformedMappingTask<K,V,U>
5151		extends BulkTask<K,V,Void> {
5152	<	final BiFun<? super K, ? super V, ? extends U> transformer;
5153	<	final Action<U> action;
5152	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5153	>	final Consumer<? super U> action;
5154		ForEachTransformedMappingTask
5155	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5156	<	BiFun<? super K, ? super V, ? extends U> transformer,
5157	<	Action<U> action) {
5158	<	super(m, p, b);
5159	<	this.transformer = transformer;
5160	<	this.action = action;
5161	<
5162	<	}
5163	<	@SuppressWarnings("unchecked") public final boolean exec() {
5164	<	final BiFun<? super K, ? super V, ? extends U> transformer =
5165	<	this.transformer;
5166	<	final Action<U> action = this.action;
5167	<	if (transformer == null || action == null)
5168	<	return abortOnNullFunction();
5223	<	try {
5224	<	int b = batch(), c;
5225	<	while (b > 1 && baseIndex != baseLimit) {
5226	<	do {} while (!casPending(c = pending, c+1));
5155	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5156	>	BiFunction<? super K, ? super V, ? extends U> transformer,
5157	>	Consumer<? super U> action) {
5158	>	super(p, b, i, f, t);
5159	>	this.transformer = transformer; this.action = action;
5160	>	}
5161	>	public final void compute() {
5162	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5163	>	final Consumer<? super U> action;
5164	>	if ((transformer = this.transformer) != null &&
5165	>	(action = this.action) != null) {
5166	>	for (int i = baseIndex, f, h; batch > 0 &&
5167	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5168	>	addToPendingCount(1);
5169		new ForEachTransformedMappingTask<K,V,U>
5170	<	(map, this, b >>>= 1, transformer, action).fork();
5170	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5171	>	transformer, action).fork();
5172		}
5173	<	Object v; U u;
5174	<	while ((v = advance()) != null) {
5175	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5176	<	action.apply(u);
5177	<	}
5178	<	tryComplete();
5236	<	} catch (Throwable ex) {
5237	<	return tryCompleteComputation(ex);
5173	>	for (Node<K,V> p; (p = advance()) != null; ) {
5174	>	U u;
5175	>	if ((u = transformer.apply(p.key, p.val)) != null)
5176	>	action.accept(u);
5177	>	}
5178	>	propagateCompletion();
5179		}
5239	–	return false;
5180		}
5181		}
5182
5183	<	@SuppressWarnings("serial") static final class SearchKeysTask<K,V,U>
5183	>	@SuppressWarnings("serial")
5184	>	static final class SearchKeysTask<K,V,U>
5185		extends BulkTask<K,V,U> {
5186	<	final Fun<? super K, ? extends U> searchFunction;
5186	>	final Function<? super K, ? extends U> searchFunction;
5187		final AtomicReference<U> result;
5188		SearchKeysTask
5189	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5190	<	Fun<? super K, ? extends U> searchFunction,
5189	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5190	>	Function<? super K, ? extends U> searchFunction,
5191		AtomicReference<U> result) {
5192	<	super(m, p, b);
5192	>	super(p, b, i, f, t);
5193		this.searchFunction = searchFunction; this.result = result;
5194		}
5195	<	@SuppressWarnings("unchecked") public final boolean exec() {
5196	<	AtomicReference<U> result = this.result;
5197	<	final Fun<? super K, ? extends U> searchFunction =
5198	<	this.searchFunction;
5199	<	if (searchFunction == null || result == null)
5200	<	return abortOnNullFunction();
5201	<	try {
5202	<	int b = batch(), c;
5203	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5204	<	do {} while (!casPending(c = pending, c+1));
5205	<	new SearchKeysTask<K,V,U>(map, this, b >>>= 1,
5206	<	searchFunction, result).fork();
5207	<	}
5208	<	U u;
5209	<	while (result.get() == null && advance() != null) {
5210	<	if ((u = searchFunction.apply((K)nextKey)) != null) {
5195	>	public final U getRawResult() { return result.get(); }
5196	>	public final void compute() {
5197	>	final Function<? super K, ? extends U> searchFunction;
5198	>	final AtomicReference<U> result;
5199	>	if ((searchFunction = this.searchFunction) != null &&
5200	>	(result = this.result) != null) {
5201	>	for (int i = baseIndex, f, h; batch > 0 &&
5202	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5203	>	if (result.get() != null)
5204	>	return;
5205	>	addToPendingCount(1);
5206	>	new SearchKeysTask<K,V,U>
5207	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5208	>	searchFunction, result).fork();
5209	>	}
5210	>	while (result.get() == null) {
5211	>	U u;
5212	>	Node<K,V> p;
5213	>	if ((p = advance()) == null) {
5214	>	propagateCompletion();
5215	>	break;
5216	>	}
5217	>	if ((u = searchFunction.apply(p.key)) != null) {
5218		if (result.compareAndSet(null, u))
5219	<	tryCompleteComputation(null);
5219	>	quietlyCompleteRoot();
5220		break;
5221		}
5222		}
5275	–	tryComplete();
5276	–	} catch (Throwable ex) {
5277	–	return tryCompleteComputation(ex);
5223		}
5279	–	return false;
5224		}
5281	–	public final U getRawResult() { return result.get(); }
5225		}
5226
5227	<	@SuppressWarnings("serial") static final class SearchValuesTask<K,V,U>
5227	>	@SuppressWarnings("serial")
5228	>	static final class SearchValuesTask<K,V,U>
5229		extends BulkTask<K,V,U> {
5230	<	final Fun<? super V, ? extends U> searchFunction;
5230	>	final Function<? super V, ? extends U> searchFunction;
5231		final AtomicReference<U> result;
5232		SearchValuesTask
5233	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5234	<	Fun<? super V, ? extends U> searchFunction,
5233	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5234	>	Function<? super V, ? extends U> searchFunction,
5235		AtomicReference<U> result) {
5236	<	super(m, p, b);
5236	>	super(p, b, i, f, t);
5237		this.searchFunction = searchFunction; this.result = result;
5238		}
5239	<	@SuppressWarnings("unchecked") public final boolean exec() {
5240	<	AtomicReference<U> result = this.result;
5241	<	final Fun<? super V, ? extends U> searchFunction =
5242	<	this.searchFunction;
5243	<	if (searchFunction == null || result == null)
5244	<	return abortOnNullFunction();
5245	<	try {
5246	<	int b = batch(), c;
5247	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5248	<	do {} while (!casPending(c = pending, c+1));
5249	<	new SearchValuesTask<K,V,U>(map, this, b >>>= 1,
5250	<	searchFunction, result).fork();
5251	<	}
5252	<	Object v; U u;
5253	<	while (result.get() == null && (v = advance()) != null) {
5254	<	if ((u = searchFunction.apply((V)v)) != null) {
5239	>	public final U getRawResult() { return result.get(); }
5240	>	public final void compute() {
5241	>	final Function<? super V, ? extends U> searchFunction;
5242	>	final AtomicReference<U> result;
5243	>	if ((searchFunction = this.searchFunction) != null &&
5244	>	(result = this.result) != null) {
5245	>	for (int i = baseIndex, f, h; batch > 0 &&
5246	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5247	>	if (result.get() != null)
5248	>	return;
5249	>	addToPendingCount(1);
5250	>	new SearchValuesTask<K,V,U>
5251	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5252	>	searchFunction, result).fork();
5253	>	}
5254	>	while (result.get() == null) {
5255	>	U u;
5256	>	Node<K,V> p;
5257	>	if ((p = advance()) == null) {
5258	>	propagateCompletion();
5259	>	break;
5260	>	}
5261	>	if ((u = searchFunction.apply(p.val)) != null) {
5262		if (result.compareAndSet(null, u))
5263	<	tryCompleteComputation(null);
5263	>	quietlyCompleteRoot();
5264		break;
5265		}
5266		}
5316	–	tryComplete();
5317	–	} catch (Throwable ex) {
5318	–	return tryCompleteComputation(ex);
5267		}
5320	–	return false;
5268		}
5322	–	public final U getRawResult() { return result.get(); }
5269		}
5270
5271	<	@SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U>
5271	>	@SuppressWarnings("serial")
5272	>	static final class SearchEntriesTask<K,V,U>
5273		extends BulkTask<K,V,U> {
5274	<	final Fun<Entry<K,V>, ? extends U> searchFunction;
5274	>	final Function<Entry<K,V>, ? extends U> searchFunction;
5275		final AtomicReference<U> result;
5276		SearchEntriesTask
5277	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5278	<	Fun<Entry<K,V>, ? extends U> searchFunction,
5277	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5278	>	Function<Entry<K,V>, ? extends U> searchFunction,
5279		AtomicReference<U> result) {
5280	<	super(m, p, b);
5280	>	super(p, b, i, f, t);
5281		this.searchFunction = searchFunction; this.result = result;
5282		}
5283	<	@SuppressWarnings("unchecked") public final boolean exec() {
5284	<	AtomicReference<U> result = this.result;
5285	<	final Fun<Entry<K,V>, ? extends U> searchFunction =
5286	<	this.searchFunction;
5287	<	if (searchFunction == null || result == null)
5288	<	return abortOnNullFunction();
5289	<	try {
5290	<	int b = batch(), c;
5291	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5292	<	do {} while (!casPending(c = pending, c+1));
5293	<	new SearchEntriesTask<K,V,U>(map, this, b >>>= 1,
5294	<	searchFunction, result).fork();
5295	<	}
5296	<	Object v; U u;
5297	<	while (result.get() == null && (v = advance()) != null) {
5298	<	if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) {
5299	<	if (result.compareAndSet(null, u))
5300	<	tryCompleteComputation(null);
5283	>	public final U getRawResult() { return result.get(); }
5284	>	public final void compute() {
5285	>	final Function<Entry<K,V>, ? extends U> searchFunction;
5286	>	final AtomicReference<U> result;
5287	>	if ((searchFunction = this.searchFunction) != null &&
5288	>	(result = this.result) != null) {
5289	>	for (int i = baseIndex, f, h; batch > 0 &&
5290	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5291	>	if (result.get() != null)
5292	>	return;
5293	>	addToPendingCount(1);
5294	>	new SearchEntriesTask<K,V,U>
5295	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5296	>	searchFunction, result).fork();
5297	>	}
5298	>	while (result.get() == null) {
5299	>	U u;
5300	>	Node<K,V> p;
5301	>	if ((p = advance()) == null) {
5302	>	propagateCompletion();
5303		break;
5304		}
5305	+	if ((u = searchFunction.apply(p)) != null) {
5306	+	if (result.compareAndSet(null, u))
5307	+	quietlyCompleteRoot();
5308	+	return;
5309	+	}
5310		}
5357	–	tryComplete();
5358	–	} catch (Throwable ex) {
5359	–	return tryCompleteComputation(ex);
5311		}
5361	–	return false;
5312		}
5363	–	public final U getRawResult() { return result.get(); }
5313		}
5314
5315	<	@SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U>
5315	>	@SuppressWarnings("serial")
5316	>	static final class SearchMappingsTask<K,V,U>
5317		extends BulkTask<K,V,U> {
5318	<	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5318	>	final BiFunction<? super K, ? super V, ? extends U> searchFunction;
5319		final AtomicReference<U> result;
5320		SearchMappingsTask
5321	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5322	<	BiFun<? super K, ? super V, ? extends U> searchFunction,
5321	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5322	>	BiFunction<? super K, ? super V, ? extends U> searchFunction,
5323		AtomicReference<U> result) {
5324	<	super(m, p, b);
5324	>	super(p, b, i, f, t);
5325		this.searchFunction = searchFunction; this.result = result;
5326		}
5327	<	@SuppressWarnings("unchecked") public final boolean exec() {
5328	<	AtomicReference<U> result = this.result;
5329	<	final BiFun<? super K, ? super V, ? extends U> searchFunction =
5330	<	this.searchFunction;
5331	<	if (searchFunction == null || result == null)
5332	<	return abortOnNullFunction();
5333	<	try {
5334	<	int b = batch(), c;
5335	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5336	<	do {} while (!casPending(c = pending, c+1));
5337	<	new SearchMappingsTask<K,V,U>(map, this, b >>>= 1,
5338	<	searchFunction, result).fork();
5339	<	}
5340	<	Object v; U u;
5341	<	while (result.get() == null && (v = advance()) != null) {
5342	<	if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) {
5327	>	public final U getRawResult() { return result.get(); }
5328	>	public final void compute() {
5329	>	final BiFunction<? super K, ? super V, ? extends U> searchFunction;
5330	>	final AtomicReference<U> result;
5331	>	if ((searchFunction = this.searchFunction) != null &&
5332	>	(result = this.result) != null) {
5333	>	for (int i = baseIndex, f, h; batch > 0 &&
5334	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5335	>	if (result.get() != null)
5336	>	return;
5337	>	addToPendingCount(1);
5338	>	new SearchMappingsTask<K,V,U>
5339	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5340	>	searchFunction, result).fork();
5341	>	}
5342	>	while (result.get() == null) {
5343	>	U u;
5344	>	Node<K,V> p;
5345	>	if ((p = advance()) == null) {
5346	>	propagateCompletion();
5347	>	break;
5348	>	}
5349	>	if ((u = searchFunction.apply(p.key, p.val)) != null) {
5350		if (result.compareAndSet(null, u))
5351	<	tryCompleteComputation(null);
5351	>	quietlyCompleteRoot();
5352		break;
5353		}
5354		}
5398	–	tryComplete();
5399	–	} catch (Throwable ex) {
5400	–	return tryCompleteComputation(ex);
5355		}
5402	–	return false;
5356		}
5404	–	public final U getRawResult() { return result.get(); }
5357		}
5358
5359	<	@SuppressWarnings("serial") static final class ReduceKeysTask<K,V>
5359	>	@SuppressWarnings("serial")
5360	>	static final class ReduceKeysTask<K,V>
5361		extends BulkTask<K,V,K> {
5362	<	final BiFun<? super K, ? super K, ? extends K> reducer;
5362	>	final BiFunction<? super K, ? super K, ? extends K> reducer;
5363		K result;
5364		ReduceKeysTask<K,V> rights, nextRight;
5365		ReduceKeysTask
5366	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5366	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5367		ReduceKeysTask<K,V> nextRight,
5368	<	BiFun<? super K, ? super K, ? extends K> reducer) {
5369	<	super(m, p, b); this.nextRight = nextRight;
5368	>	BiFunction<? super K, ? super K, ? extends K> reducer) {
5369	>	super(p, b, i, f, t); this.nextRight = nextRight;
5370		this.reducer = reducer;
5371		}
5372	<	@SuppressWarnings("unchecked") public final boolean exec() {
5373	<	final BiFun<? super K, ? super K, ? extends K> reducer =
5374	<	this.reducer;
5375	<	if (reducer == null)
5376	<	return abortOnNullFunction();
5377	<	try {
5378	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5426	<	do {} while (!casPending(c = pending, c+1));
5372	>	public final K getRawResult() { return result; }
5373	>	public final void compute() {
5374	>	final BiFunction<? super K, ? super K, ? extends K> reducer;
5375	>	if ((reducer = this.reducer) != null) {
5376	>	for (int i = baseIndex, f, h; batch > 0 &&
5377	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5378	>	addToPendingCount(1);
5379		(rights = new ReduceKeysTask<K,V>
5380	<	(map, this, b >>>= 1, rights, reducer)).fork();
5380	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5381	>	rights, reducer)).fork();
5382		}
5383		K r = null;
5384	<	while (advance() != null) {
5385	<	K u = (K)nextKey;
5386	<	r = (r == null) ? u : reducer.apply(r, u);
5384	>	for (Node<K,V> p; (p = advance()) != null; ) {
5385	>	K u = p.key;
5386	>	r = (r == null) ? u : u == null ? r : reducer.apply(r, u);
5387		}
5388		result = r;
5389	<	for (ReduceKeysTask<K,V> t = this, s;;) {
5390	<	int c; BulkTask<K,V,?> par; K tr, sr;
5391	<	if ((c = t.pending) == 0) {
5392	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5393	<	if ((sr = s.result) != null)
5394	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5395	<	}
5396	<	if ((par = t.parent) == null ||
5397	<	!(par instanceof ReduceKeysTask)) {
5398	<	t.quietlyComplete();
5399	<	break;
5400	<	}
5448	<	t = (ReduceKeysTask<K,V>)par;
5389	>	CountedCompleter<?> c;
5390	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5391	>	@SuppressWarnings("unchecked")
5392	>	ReduceKeysTask<K,V>
5393	>	t = (ReduceKeysTask<K,V>)c,
5394	>	s = t.rights;
5395	>	while (s != null) {
5396	>	K tr, sr;
5397	>	if ((sr = s.result) != null)
5398	>	t.result = (((tr = t.result) == null) ? sr :
5399	>	reducer.apply(tr, sr));
5400	>	s = t.rights = s.nextRight;
5401		}
5450	–	else if (t.casPending(c, c - 1))
5451	–	break;
5402		}
5453	–	} catch (Throwable ex) {
5454	–	return tryCompleteComputation(ex);
5403		}
5456	–	return false;
5404		}
5458	–	public final K getRawResult() { return result; }
5405		}
5406
5407	<	@SuppressWarnings("serial") static final class ReduceValuesTask<K,V>
5407	>	@SuppressWarnings("serial")
5408	>	static final class ReduceValuesTask<K,V>
5409		extends BulkTask<K,V,V> {
5410	<	final BiFun<? super V, ? super V, ? extends V> reducer;
5410	>	final BiFunction<? super V, ? super V, ? extends V> reducer;
5411		V result;
5412		ReduceValuesTask<K,V> rights, nextRight;
5413		ReduceValuesTask
5414	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5414	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5415		ReduceValuesTask<K,V> nextRight,
5416	<	BiFun<? super V, ? super V, ? extends V> reducer) {
5417	<	super(m, p, b); this.nextRight = nextRight;
5416	>	BiFunction<? super V, ? super V, ? extends V> reducer) {
5417	>	super(p, b, i, f, t); this.nextRight = nextRight;
5418		this.reducer = reducer;
5419		}
5420	<	@SuppressWarnings("unchecked") public final boolean exec() {
5421	<	final BiFun<? super V, ? super V, ? extends V> reducer =
5422	<	this.reducer;
5423	<	if (reducer == null)
5424	<	return abortOnNullFunction();
5425	<	try {
5426	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5480	<	do {} while (!casPending(c = pending, c+1));
5420	>	public final V getRawResult() { return result; }
5421	>	public final void compute() {
5422	>	final BiFunction<? super V, ? super V, ? extends V> reducer;
5423	>	if ((reducer = this.reducer) != null) {
5424	>	for (int i = baseIndex, f, h; batch > 0 &&
5425	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5426	>	addToPendingCount(1);
5427		(rights = new ReduceValuesTask<K,V>
5428	<	(map, this, b >>>= 1, rights, reducer)).fork();
5428	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5429	>	rights, reducer)).fork();
5430		}
5431		V r = null;
5432	<	Object v;
5433	<	while ((v = advance()) != null) {
5434	<	V u = (V)v;
5488	<	r = (r == null) ? u : reducer.apply(r, u);
5432	>	for (Node<K,V> p; (p = advance()) != null; ) {
5433	>	V v = p.val;
5434	>	r = (r == null) ? v : reducer.apply(r, v);
5435		}
5436		result = r;
5437	<	for (ReduceValuesTask<K,V> t = this, s;;) {
5438	<	int c; BulkTask<K,V,?> par; V tr, sr;
5439	<	if ((c = t.pending) == 0) {
5440	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5441	<	if ((sr = s.result) != null)
5442	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5443	<	}
5444	<	if ((par = t.parent) == null ||
5445	<	!(par instanceof ReduceValuesTask)) {
5446	<	t.quietlyComplete();
5447	<	break;
5448	<	}
5503	<	t = (ReduceValuesTask<K,V>)par;
5437	>	CountedCompleter<?> c;
5438	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5439	>	@SuppressWarnings("unchecked")
5440	>	ReduceValuesTask<K,V>
5441	>	t = (ReduceValuesTask<K,V>)c,
5442	>	s = t.rights;
5443	>	while (s != null) {
5444	>	V tr, sr;
5445	>	if ((sr = s.result) != null)
5446	>	t.result = (((tr = t.result) == null) ? sr :
5447	>	reducer.apply(tr, sr));
5448	>	s = t.rights = s.nextRight;
5449		}
5505	–	else if (t.casPending(c, c - 1))
5506	–	break;
5450		}
5508	–	} catch (Throwable ex) {
5509	–	return tryCompleteComputation(ex);
5451		}
5511	–	return false;
5452		}
5513	–	public final V getRawResult() { return result; }
5453		}
5454
5455	<	@SuppressWarnings("serial") static final class ReduceEntriesTask<K,V>
5455	>	@SuppressWarnings("serial")
5456	>	static final class ReduceEntriesTask<K,V>
5457		extends BulkTask<K,V,Map.Entry<K,V>> {
5458	<	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5458	>	final BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5459		Map.Entry<K,V> result;
5460		ReduceEntriesTask<K,V> rights, nextRight;
5461		ReduceEntriesTask
5462	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5462	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5463		ReduceEntriesTask<K,V> nextRight,
5464	<	BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5465	<	super(m, p, b); this.nextRight = nextRight;
5464	>	BiFunction<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5465	>	super(p, b, i, f, t); this.nextRight = nextRight;
5466		this.reducer = reducer;
5467		}
5468	<	@SuppressWarnings("unchecked") public final boolean exec() {
5469	<	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer =
5470	<	this.reducer;
5471	<	if (reducer == null)
5472	<	return abortOnNullFunction();
5473	<	try {
5474	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5535	<	do {} while (!casPending(c = pending, c+1));
5468	>	public final Map.Entry<K,V> getRawResult() { return result; }
5469	>	public final void compute() {
5470	>	final BiFunction<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5471	>	if ((reducer = this.reducer) != null) {
5472	>	for (int i = baseIndex, f, h; batch > 0 &&
5473	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5474	>	addToPendingCount(1);
5475		(rights = new ReduceEntriesTask<K,V>
5476	<	(map, this, b >>>= 1, rights, reducer)).fork();
5476	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5477	>	rights, reducer)).fork();
5478		}
5479		Map.Entry<K,V> r = null;
5480	<	Object v;
5481	<	while ((v = advance()) != null) {
5542	<	Map.Entry<K,V> u = entryFor((K)nextKey, (V)v);
5543	<	r = (r == null) ? u : reducer.apply(r, u);
5544	<	}
5480	>	for (Node<K,V> p; (p = advance()) != null; )
5481	>	r = (r == null) ? p : reducer.apply(r, p);
5482		result = r;
5483	<	for (ReduceEntriesTask<K,V> t = this, s;;) {
5484	<	int c; BulkTask<K,V,?> par; Map.Entry<K,V> tr, sr;
5485	<	if ((c = t.pending) == 0) {
5486	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5487	<	if ((sr = s.result) != null)
5488	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5489	<	}
5490	<	if ((par = t.parent) == null ||
5491	<	!(par instanceof ReduceEntriesTask)) {
5492	<	t.quietlyComplete();
5493	<	break;
5494	<	}
5558	<	t = (ReduceEntriesTask<K,V>)par;
5483	>	CountedCompleter<?> c;
5484	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5485	>	@SuppressWarnings("unchecked")
5486	>	ReduceEntriesTask<K,V>
5487	>	t = (ReduceEntriesTask<K,V>)c,
5488	>	s = t.rights;
5489	>	while (s != null) {
5490	>	Map.Entry<K,V> tr, sr;
5491	>	if ((sr = s.result) != null)
5492	>	t.result = (((tr = t.result) == null) ? sr :
5493	>	reducer.apply(tr, sr));
5494	>	s = t.rights = s.nextRight;
5495		}
5560	–	else if (t.casPending(c, c - 1))
5561	–	break;
5496		}
5563	–	} catch (Throwable ex) {
5564	–	return tryCompleteComputation(ex);
5497		}
5566	–	return false;
5498		}
5568	–	public final Map.Entry<K,V> getRawResult() { return result; }
5499		}
5500
5501	<	@SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U>
5501	>	@SuppressWarnings("serial")
5502	>	static final class MapReduceKeysTask<K,V,U>
5503		extends BulkTask<K,V,U> {
5504	<	final Fun<? super K, ? extends U> transformer;
5505	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5504	>	final Function<? super K, ? extends U> transformer;
5505	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5506		U result;
5507		MapReduceKeysTask<K,V,U> rights, nextRight;
5508		MapReduceKeysTask
5509	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5509	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5510		MapReduceKeysTask<K,V,U> nextRight,
5511	<	Fun<? super K, ? extends U> transformer,
5512	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5513	<	super(m, p, b); this.nextRight = nextRight;
5511	>	Function<? super K, ? extends U> transformer,
5512	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5513	>	super(p, b, i, f, t); this.nextRight = nextRight;
5514		this.transformer = transformer;
5515		this.reducer = reducer;
5516		}
5517	<	@SuppressWarnings("unchecked") public final boolean exec() {
5518	<	final Fun<? super K, ? extends U> transformer =
5519	<	this.transformer;
5520	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5521	<	this.reducer;
5522	<	if (transformer == null || reducer == null)
5523	<	return abortOnNullFunction();
5524	<	try {
5525	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5595	<	do {} while (!casPending(c = pending, c+1));
5517	>	public final U getRawResult() { return result; }
5518	>	public final void compute() {
5519	>	final Function<? super K, ? extends U> transformer;
5520	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5521	>	if ((transformer = this.transformer) != null &&
5522	>	(reducer = this.reducer) != null) {
5523	>	for (int i = baseIndex, f, h; batch > 0 &&
5524	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5525	>	addToPendingCount(1);
5526		(rights = new MapReduceKeysTask<K,V,U>
5527	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5527	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5528	>	rights, transformer, reducer)).fork();
5529		}
5530	<	U r = null, u;
5531	<	while (advance() != null) {
5532	<	if ((u = transformer.apply((K)nextKey)) != null)
5530	>	U r = null;
5531	>	for (Node<K,V> p; (p = advance()) != null; ) {
5532	>	U u;
5533	>	if ((u = transformer.apply(p.key)) != null)
5534		r = (r == null) ? u : reducer.apply(r, u);
5535		}
5536		result = r;
5537	<	for (MapReduceKeysTask<K,V,U> t = this, s;;) {
5538	<	int c; BulkTask<K,V,?> par; U tr, sr;
5539	<	if ((c = t.pending) == 0) {
5540	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5541	<	if ((sr = s.result) != null)
5542	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5543	<	}
5544	<	if ((par = t.parent) == null ||
5545	<	!(par instanceof MapReduceKeysTask)) {
5546	<	t.quietlyComplete();
5547	<	break;
5548	<	}
5617	<	t = (MapReduceKeysTask<K,V,U>)par;
5537	>	CountedCompleter<?> c;
5538	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5539	>	@SuppressWarnings("unchecked")
5540	>	MapReduceKeysTask<K,V,U>
5541	>	t = (MapReduceKeysTask<K,V,U>)c,
5542	>	s = t.rights;
5543	>	while (s != null) {
5544	>	U tr, sr;
5545	>	if ((sr = s.result) != null)
5546	>	t.result = (((tr = t.result) == null) ? sr :
5547	>	reducer.apply(tr, sr));
5548	>	s = t.rights = s.nextRight;
5549		}
5619	–	else if (t.casPending(c, c - 1))
5620	–	break;
5550		}
5622	–	} catch (Throwable ex) {
5623	–	return tryCompleteComputation(ex);
5551		}
5625	–	return false;
5552		}
5627	–	public final U getRawResult() { return result; }
5553		}
5554
5555	<	@SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U>
5555	>	@SuppressWarnings("serial")
5556	>	static final class MapReduceValuesTask<K,V,U>
5557		extends BulkTask<K,V,U> {
5558	<	final Fun<? super V, ? extends U> transformer;
5559	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5558	>	final Function<? super V, ? extends U> transformer;
5559	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5560		U result;
5561		MapReduceValuesTask<K,V,U> rights, nextRight;
5562		MapReduceValuesTask
5563	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5563	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5564		MapReduceValuesTask<K,V,U> nextRight,
5565	<	Fun<? super V, ? extends U> transformer,
5566	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5567	<	super(m, p, b); this.nextRight = nextRight;
5565	>	Function<? super V, ? extends U> transformer,
5566	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5567	>	super(p, b, i, f, t); this.nextRight = nextRight;
5568		this.transformer = transformer;
5569		this.reducer = reducer;
5570		}
5571	<	@SuppressWarnings("unchecked") public final boolean exec() {
5572	<	final Fun<? super V, ? extends U> transformer =
5573	<	this.transformer;
5574	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5575	<	this.reducer;
5576	<	if (transformer == null || reducer == null)
5577	<	return abortOnNullFunction();
5578	<	try {
5579	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5654	<	do {} while (!casPending(c = pending, c+1));
5571	>	public final U getRawResult() { return result; }
5572	>	public final void compute() {
5573	>	final Function<? super V, ? extends U> transformer;
5574	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5575	>	if ((transformer = this.transformer) != null &&
5576	>	(reducer = this.reducer) != null) {
5577	>	for (int i = baseIndex, f, h; batch > 0 &&
5578	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5579	>	addToPendingCount(1);
5580		(rights = new MapReduceValuesTask<K,V,U>
5581	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5581	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5582	>	rights, transformer, reducer)).fork();
5583		}
5584	<	U r = null, u;
5585	<	Object v;
5586	<	while ((v = advance()) != null) {
5587	<	if ((u = transformer.apply((V)v)) != null)
5584	>	U r = null;
5585	>	for (Node<K,V> p; (p = advance()) != null; ) {
5586	>	U u;
5587	>	if ((u = transformer.apply(p.val)) != null)
5588		r = (r == null) ? u : reducer.apply(r, u);
5589		}
5590		result = r;
5591	<	for (MapReduceValuesTask<K,V,U> t = this, s;;) {
5592	<	int c; BulkTask<K,V,?> par; U tr, sr;
5593	<	if ((c = t.pending) == 0) {
5594	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5595	<	if ((sr = s.result) != null)
5596	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5597	<	}
5598	<	if ((par = t.parent) == null ||
5599	<	!(par instanceof MapReduceValuesTask)) {
5600	<	t.quietlyComplete();
5601	<	break;
5602	<	}
5677	<	t = (MapReduceValuesTask<K,V,U>)par;
5591	>	CountedCompleter<?> c;
5592	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5593	>	@SuppressWarnings("unchecked")
5594	>	MapReduceValuesTask<K,V,U>
5595	>	t = (MapReduceValuesTask<K,V,U>)c,
5596	>	s = t.rights;
5597	>	while (s != null) {
5598	>	U tr, sr;
5599	>	if ((sr = s.result) != null)
5600	>	t.result = (((tr = t.result) == null) ? sr :
5601	>	reducer.apply(tr, sr));
5602	>	s = t.rights = s.nextRight;
5603		}
5679	–	else if (t.casPending(c, c - 1))
5680	–	break;
5604		}
5682	–	} catch (Throwable ex) {
5683	–	return tryCompleteComputation(ex);
5605		}
5685	–	return false;
5606		}
5687	–	public final U getRawResult() { return result; }
5607		}
5608
5609	<	@SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U>
5609	>	@SuppressWarnings("serial")
5610	>	static final class MapReduceEntriesTask<K,V,U>
5611		extends BulkTask<K,V,U> {
5612	<	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5613	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5612	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5613	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5614		U result;
5615		MapReduceEntriesTask<K,V,U> rights, nextRight;
5616		MapReduceEntriesTask
5617	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5617	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5618		MapReduceEntriesTask<K,V,U> nextRight,
5619	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5620	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5621	<	super(m, p, b); this.nextRight = nextRight;
5619	>	Function<Map.Entry<K,V>, ? extends U> transformer,
5620	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5621	>	super(p, b, i, f, t); this.nextRight = nextRight;
5622		this.transformer = transformer;
5623		this.reducer = reducer;
5624		}
5625	<	@SuppressWarnings("unchecked") public final boolean exec() {
5626	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5627	<	this.transformer;
5628	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5629	<	this.reducer;
5630	<	if (transformer == null || reducer == null)
5631	<	return abortOnNullFunction();
5632	<	try {
5633	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5714	<	do {} while (!casPending(c = pending, c+1));
5625	>	public final U getRawResult() { return result; }
5626	>	public final void compute() {
5627	>	final Function<Map.Entry<K,V>, ? extends U> transformer;
5628	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5629	>	if ((transformer = this.transformer) != null &&
5630	>	(reducer = this.reducer) != null) {
5631	>	for (int i = baseIndex, f, h; batch > 0 &&
5632	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5633	>	addToPendingCount(1);
5634		(rights = new MapReduceEntriesTask<K,V,U>
5635	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5635	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5636	>	rights, transformer, reducer)).fork();
5637		}
5638	<	U r = null, u;
5639	<	Object v;
5640	<	while ((v = advance()) != null) {
5641	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5638	>	U r = null;
5639	>	for (Node<K,V> p; (p = advance()) != null; ) {
5640	>	U u;
5641	>	if ((u = transformer.apply(p)) != null)
5642		r = (r == null) ? u : reducer.apply(r, u);
5643		}
5644		result = r;
5645	<	for (MapReduceEntriesTask<K,V,U> t = this, s;;) {
5646	<	int c; BulkTask<K,V,?> par; U tr, sr;
5647	<	if ((c = t.pending) == 0) {
5648	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5649	<	if ((sr = s.result) != null)
5650	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5651	<	}
5652	<	if ((par = t.parent) == null ||
5653	<	!(par instanceof MapReduceEntriesTask)) {
5654	<	t.quietlyComplete();
5655	<	break;
5656	<	}
5737	<	t = (MapReduceEntriesTask<K,V,U>)par;
5645	>	CountedCompleter<?> c;
5646	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5647	>	@SuppressWarnings("unchecked")
5648	>	MapReduceEntriesTask<K,V,U>
5649	>	t = (MapReduceEntriesTask<K,V,U>)c,
5650	>	s = t.rights;
5651	>	while (s != null) {
5652	>	U tr, sr;
5653	>	if ((sr = s.result) != null)
5654	>	t.result = (((tr = t.result) == null) ? sr :
5655	>	reducer.apply(tr, sr));
5656	>	s = t.rights = s.nextRight;
5657		}
5739	–	else if (t.casPending(c, c - 1))
5740	–	break;
5658		}
5742	–	} catch (Throwable ex) {
5743	–	return tryCompleteComputation(ex);
5659		}
5745	–	return false;
5660		}
5747	–	public final U getRawResult() { return result; }
5661		}
5662
5663	<	@SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U>
5663	>	@SuppressWarnings("serial")
5664	>	static final class MapReduceMappingsTask<K,V,U>
5665		extends BulkTask<K,V,U> {
5666	<	final BiFun<? super K, ? super V, ? extends U> transformer;
5667	<	final BiFun<? super U, ? super U, ? extends U> reducer;
5666	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5667	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5668		U result;
5669		MapReduceMappingsTask<K,V,U> rights, nextRight;
5670		MapReduceMappingsTask
5671	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5671	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5672		MapReduceMappingsTask<K,V,U> nextRight,
5673	<	BiFun<? super K, ? super V, ? extends U> transformer,
5674	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5675	<	super(m, p, b); this.nextRight = nextRight;
5673	>	BiFunction<? super K, ? super V, ? extends U> transformer,
5674	>	BiFunction<? super U, ? super U, ? extends U> reducer) {
5675	>	super(p, b, i, f, t); this.nextRight = nextRight;
5676		this.transformer = transformer;
5677		this.reducer = reducer;
5678		}
5679	<	@SuppressWarnings("unchecked") public final boolean exec() {
5680	<	final BiFun<? super K, ? super V, ? extends U> transformer =
5681	<	this.transformer;
5682	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5683	<	this.reducer;
5684	<	if (transformer == null || reducer == null)
5685	<	return abortOnNullFunction();
5686	<	try {
5687	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5774	<	do {} while (!casPending(c = pending, c+1));
5679	>	public final U getRawResult() { return result; }
5680	>	public final void compute() {
5681	>	final BiFunction<? super K, ? super V, ? extends U> transformer;
5682	>	final BiFunction<? super U, ? super U, ? extends U> reducer;
5683	>	if ((transformer = this.transformer) != null &&
5684	>	(reducer = this.reducer) != null) {
5685	>	for (int i = baseIndex, f, h; batch > 0 &&
5686	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5687	>	addToPendingCount(1);
5688		(rights = new MapReduceMappingsTask<K,V,U>
5689	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5689	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5690	>	rights, transformer, reducer)).fork();
5691		}
5692	<	U r = null, u;
5693	<	Object v;
5694	<	while ((v = advance()) != null) {
5695	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5692	>	U r = null;
5693	>	for (Node<K,V> p; (p = advance()) != null; ) {
5694	>	U u;
5695	>	if ((u = transformer.apply(p.key, p.val)) != null)
5696		r = (r == null) ? u : reducer.apply(r, u);
5697		}
5698		result = r;
5699	<	for (MapReduceMappingsTask<K,V,U> t = this, s;;) {
5700	<	int c; BulkTask<K,V,?> par; U tr, sr;
5701	<	if ((c = t.pending) == 0) {
5702	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5703	<	if ((sr = s.result) != null)
5704	<	t.result = (tr = t.result) == null? sr : reducer.apply(tr, sr);
5705	<	}
5706	<	if ((par = t.parent) == null ||
5707	<	!(par instanceof MapReduceMappingsTask)) {
5708	<	t.quietlyComplete();
5709	<	break;
5710	<	}
5797	<	t = (MapReduceMappingsTask<K,V,U>)par;
5699	>	CountedCompleter<?> c;
5700	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5701	>	@SuppressWarnings("unchecked")
5702	>	MapReduceMappingsTask<K,V,U>
5703	>	t = (MapReduceMappingsTask<K,V,U>)c,
5704	>	s = t.rights;
5705	>	while (s != null) {
5706	>	U tr, sr;
5707	>	if ((sr = s.result) != null)
5708	>	t.result = (((tr = t.result) == null) ? sr :
5709	>	reducer.apply(tr, sr));
5710	>	s = t.rights = s.nextRight;
5711		}
5799	–	else if (t.casPending(c, c - 1))
5800	–	break;
5712		}
5802	–	} catch (Throwable ex) {
5803	–	return tryCompleteComputation(ex);
5713		}
5805	–	return false;
5714		}
5807	–	public final U getRawResult() { return result; }
5715		}
5716
5717	<	@SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V>
5717	>	@SuppressWarnings("serial")
5718	>	static final class MapReduceKeysToDoubleTask<K,V>
5719		extends BulkTask<K,V,Double> {
5720	<	final ObjectToDouble<? super K> transformer;
5721	<	final DoubleByDoubleToDouble reducer;
5720	>	final ToDoubleFunction<? super K> transformer;
5721	>	final DoubleBinaryOperator reducer;
5722		final double basis;
5723		double result;
5724		MapReduceKeysToDoubleTask<K,V> rights, nextRight;
5725		MapReduceKeysToDoubleTask
5726	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5726	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5727		MapReduceKeysToDoubleTask<K,V> nextRight,
5728	<	ObjectToDouble<? super K> transformer,
5728	>	ToDoubleFunction<? super K> transformer,
5729		double basis,
5730	<	DoubleByDoubleToDouble reducer) {
5731	<	super(m, p, b); this.nextRight = nextRight;
5730	>	DoubleBinaryOperator reducer) {
5731	>	super(p, b, i, f, t); this.nextRight = nextRight;
5732		this.transformer = transformer;
5733		this.basis = basis; this.reducer = reducer;
5734		}
5735	<	@SuppressWarnings("unchecked") public final boolean exec() {
5736	<	final ObjectToDouble<? super K> transformer =
5737	<	this.transformer;
5738	<	final DoubleByDoubleToDouble reducer = this.reducer;
5739	<	if (transformer == null || reducer == null)
5740	<	return abortOnNullFunction();
5741	<	try {
5742	<	final double id = this.basis;
5743	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5744	<	do {} while (!casPending(c = pending, c+1));
5735	>	public final Double getRawResult() { return result; }
5736	>	public final void compute() {
5737	>	final ToDoubleFunction<? super K> transformer;
5738	>	final DoubleBinaryOperator reducer;
5739	>	if ((transformer = this.transformer) != null &&
5740	>	(reducer = this.reducer) != null) {
5741	>	double r = this.basis;
5742	>	for (int i = baseIndex, f, h; batch > 0 &&
5743	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5744	>	addToPendingCount(1);
5745		(rights = new MapReduceKeysToDoubleTask<K,V>
5746	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5746	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5747	>	rights, transformer, r, reducer)).fork();
5748		}
5749	<	double r = id;
5750	<	while (advance() != null)
5842	<	r = reducer.apply(r, transformer.apply((K)nextKey));
5749	>	for (Node<K,V> p; (p = advance()) != null; )
5750	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p.key));
5751		result = r;
5752	<	for (MapReduceKeysToDoubleTask<K,V> t = this, s;;) {
5753	<	int c; BulkTask<K,V,?> par;
5754	<	if ((c = t.pending) == 0) {
5755	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5756	<	t.result = reducer.apply(t.result, s.result);
5757	<	}
5758	<	if ((par = t.parent) == null ||
5759	<	!(par instanceof MapReduceKeysToDoubleTask)) {
5760	<	t.quietlyComplete();
5853	<	break;
5854	<	}
5855	<	t = (MapReduceKeysToDoubleTask<K,V>)par;
5752	>	CountedCompleter<?> c;
5753	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5754	>	@SuppressWarnings("unchecked")
5755	>	MapReduceKeysToDoubleTask<K,V>
5756	>	t = (MapReduceKeysToDoubleTask<K,V>)c,
5757	>	s = t.rights;
5758	>	while (s != null) {
5759	>	t.result = reducer.applyAsDouble(t.result, s.result);
5760	>	s = t.rights = s.nextRight;
5761		}
5857	–	else if (t.casPending(c, c - 1))
5858	–	break;
5762		}
5860	–	} catch (Throwable ex) {
5861	–	return tryCompleteComputation(ex);
5763		}
5863	–	return false;
5764		}
5865	–	public final Double getRawResult() { return result; }
5765		}
5766
5767	<	@SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V>
5767	>	@SuppressWarnings("serial")
5768	>	static final class MapReduceValuesToDoubleTask<K,V>
5769		extends BulkTask<K,V,Double> {
5770	<	final ObjectToDouble<? super V> transformer;
5771	<	final DoubleByDoubleToDouble reducer;
5770	>	final ToDoubleFunction<? super V> transformer;
5771	>	final DoubleBinaryOperator reducer;
5772		final double basis;
5773		double result;
5774		MapReduceValuesToDoubleTask<K,V> rights, nextRight;
5775		MapReduceValuesToDoubleTask
5776	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5776	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5777		MapReduceValuesToDoubleTask<K,V> nextRight,
5778	<	ObjectToDouble<? super V> transformer,
5778	>	ToDoubleFunction<? super V> transformer,
5779		double basis,
5780	<	DoubleByDoubleToDouble reducer) {
5781	<	super(m, p, b); this.nextRight = nextRight;
5780	>	DoubleBinaryOperator reducer) {
5781	>	super(p, b, i, f, t); this.nextRight = nextRight;
5782		this.transformer = transformer;
5783		this.basis = basis; this.reducer = reducer;
5784		}
5785	<	@SuppressWarnings("unchecked") public final boolean exec() {
5786	<	final ObjectToDouble<? super V> transformer =
5787	<	this.transformer;
5788	<	final DoubleByDoubleToDouble reducer = this.reducer;
5789	<	if (transformer == null || reducer == null)
5790	<	return abortOnNullFunction();
5791	<	try {
5792	<	final double id = this.basis;
5793	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5794	<	do {} while (!casPending(c = pending, c+1));
5785	>	public final Double getRawResult() { return result; }
5786	>	public final void compute() {
5787	>	final ToDoubleFunction<? super V> transformer;
5788	>	final DoubleBinaryOperator reducer;
5789	>	if ((transformer = this.transformer) != null &&
5790	>	(reducer = this.reducer) != null) {
5791	>	double r = this.basis;
5792	>	for (int i = baseIndex, f, h; batch > 0 &&
5793	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5794	>	addToPendingCount(1);
5795		(rights = new MapReduceValuesToDoubleTask<K,V>
5796	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5796	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5797	>	rights, transformer, r, reducer)).fork();
5798		}
5799	<	double r = id;
5800	<	Object v;
5900	<	while ((v = advance()) != null)
5901	<	r = reducer.apply(r, transformer.apply((V)v));
5799	>	for (Node<K,V> p; (p = advance()) != null; )
5800	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p.val));
5801		result = r;
5802	<	for (MapReduceValuesToDoubleTask<K,V> t = this, s;;) {
5803	<	int c; BulkTask<K,V,?> par;
5804	<	if ((c = t.pending) == 0) {
5805	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5806	<	t.result = reducer.apply(t.result, s.result);
5807	<	}
5808	<	if ((par = t.parent) == null ||
5809	<	!(par instanceof MapReduceValuesToDoubleTask)) {
5810	<	t.quietlyComplete();
5912	<	break;
5913	<	}
5914	<	t = (MapReduceValuesToDoubleTask<K,V>)par;
5802	>	CountedCompleter<?> c;
5803	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5804	>	@SuppressWarnings("unchecked")
5805	>	MapReduceValuesToDoubleTask<K,V>
5806	>	t = (MapReduceValuesToDoubleTask<K,V>)c,
5807	>	s = t.rights;
5808	>	while (s != null) {
5809	>	t.result = reducer.applyAsDouble(t.result, s.result);
5810	>	s = t.rights = s.nextRight;
5811		}
5916	–	else if (t.casPending(c, c - 1))
5917	–	break;
5812		}
5919	–	} catch (Throwable ex) {
5920	–	return tryCompleteComputation(ex);
5813		}
5922	–	return false;
5814		}
5924	–	public final Double getRawResult() { return result; }
5815		}
5816
5817	<	@SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V>
5817	>	@SuppressWarnings("serial")
5818	>	static final class MapReduceEntriesToDoubleTask<K,V>
5819		extends BulkTask<K,V,Double> {
5820	<	final ObjectToDouble<Map.Entry<K,V>> transformer;
5821	<	final DoubleByDoubleToDouble reducer;
5820	>	final ToDoubleFunction<Map.Entry<K,V>> transformer;
5821	>	final DoubleBinaryOperator reducer;
5822		final double basis;
5823		double result;
5824		MapReduceEntriesToDoubleTask<K,V> rights, nextRight;
5825		MapReduceEntriesToDoubleTask
5826	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5826	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5827		MapReduceEntriesToDoubleTask<K,V> nextRight,
5828	<	ObjectToDouble<Map.Entry<K,V>> transformer,
5828	>	ToDoubleFunction<Map.Entry<K,V>> transformer,
5829		double basis,
5830	<	DoubleByDoubleToDouble reducer) {
5831	<	super(m, p, b); this.nextRight = nextRight;
5830	>	DoubleBinaryOperator reducer) {
5831	>	super(p, b, i, f, t); this.nextRight = nextRight;
5832		this.transformer = transformer;
5833		this.basis = basis; this.reducer = reducer;
5834		}
5835	<	@SuppressWarnings("unchecked") public final boolean exec() {
5836	<	final ObjectToDouble<Map.Entry<K,V>> transformer =
5837	<	this.transformer;
5838	<	final DoubleByDoubleToDouble reducer = this.reducer;
5839	<	if (transformer == null || reducer == null)
5840	<	return abortOnNullFunction();
5841	<	try {
5842	<	final double id = this.basis;
5843	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5844	<	do {} while (!casPending(c = pending, c+1));
5835	>	public final Double getRawResult() { return result; }
5836	>	public final void compute() {
5837	>	final ToDoubleFunction<Map.Entry<K,V>> transformer;
5838	>	final DoubleBinaryOperator reducer;
5839	>	if ((transformer = this.transformer) != null &&
5840	>	(reducer = this.reducer) != null) {
5841	>	double r = this.basis;
5842	>	for (int i = baseIndex, f, h; batch > 0 &&
5843	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5844	>	addToPendingCount(1);
5845		(rights = new MapReduceEntriesToDoubleTask<K,V>
5846	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5846	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5847	>	rights, transformer, r, reducer)).fork();
5848		}
5849	<	double r = id;
5850	<	Object v;
5959	<	while ((v = advance()) != null)
5960	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
5849	>	for (Node<K,V> p; (p = advance()) != null; )
5850	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p));
5851		result = r;
5852	<	for (MapReduceEntriesToDoubleTask<K,V> t = this, s;;) {
5853	<	int c; BulkTask<K,V,?> par;
5854	<	if ((c = t.pending) == 0) {
5855	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5856	<	t.result = reducer.apply(t.result, s.result);
5857	<	}
5858	<	if ((par = t.parent) == null ||
5859	<	!(par instanceof MapReduceEntriesToDoubleTask)) {
5860	<	t.quietlyComplete();
5971	<	break;
5972	<	}
5973	<	t = (MapReduceEntriesToDoubleTask<K,V>)par;
5852	>	CountedCompleter<?> c;
5853	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5854	>	@SuppressWarnings("unchecked")
5855	>	MapReduceEntriesToDoubleTask<K,V>
5856	>	t = (MapReduceEntriesToDoubleTask<K,V>)c,
5857	>	s = t.rights;
5858	>	while (s != null) {
5859	>	t.result = reducer.applyAsDouble(t.result, s.result);
5860	>	s = t.rights = s.nextRight;
5861		}
5975	–	else if (t.casPending(c, c - 1))
5976	–	break;
5862		}
5978	–	} catch (Throwable ex) {
5979	–	return tryCompleteComputation(ex);
5863		}
5981	–	return false;
5864		}
5983	–	public final Double getRawResult() { return result; }
5865		}
5866
5867	<	@SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V>
5867	>	@SuppressWarnings("serial")
5868	>	static final class MapReduceMappingsToDoubleTask<K,V>
5869		extends BulkTask<K,V,Double> {
5870	<	final ObjectByObjectToDouble<? super K, ? super V> transformer;
5871	<	final DoubleByDoubleToDouble reducer;
5870	>	final ToDoubleBiFunction<? super K, ? super V> transformer;
5871	>	final DoubleBinaryOperator reducer;
5872		final double basis;
5873		double result;
5874		MapReduceMappingsToDoubleTask<K,V> rights, nextRight;
5875		MapReduceMappingsToDoubleTask
5876	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5876	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5877		MapReduceMappingsToDoubleTask<K,V> nextRight,
5878	<	ObjectByObjectToDouble<? super K, ? super V> transformer,
5878	>	ToDoubleBiFunction<? super K, ? super V> transformer,
5879		double basis,
5880	<	DoubleByDoubleToDouble reducer) {
5881	<	super(m, p, b); this.nextRight = nextRight;
5880	>	DoubleBinaryOperator reducer) {
5881	>	super(p, b, i, f, t); this.nextRight = nextRight;
5882		this.transformer = transformer;
5883		this.basis = basis; this.reducer = reducer;
5884		}
5885	<	@SuppressWarnings("unchecked") public final boolean exec() {
5886	<	final ObjectByObjectToDouble<? super K, ? super V> transformer =
5887	<	this.transformer;
5888	<	final DoubleByDoubleToDouble reducer = this.reducer;
5889	<	if (transformer == null || reducer == null)
5890	<	return abortOnNullFunction();
5891	<	try {
5892	<	final double id = this.basis;
5893	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5894	<	do {} while (!casPending(c = pending, c+1));
5885	>	public final Double getRawResult() { return result; }
5886	>	public final void compute() {
5887	>	final ToDoubleBiFunction<? super K, ? super V> transformer;
5888	>	final DoubleBinaryOperator reducer;
5889	>	if ((transformer = this.transformer) != null &&
5890	>	(reducer = this.reducer) != null) {
5891	>	double r = this.basis;
5892	>	for (int i = baseIndex, f, h; batch > 0 &&
5893	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5894	>	addToPendingCount(1);
5895		(rights = new MapReduceMappingsToDoubleTask<K,V>
5896	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5896	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5897	>	rights, transformer, r, reducer)).fork();
5898		}
5899	<	double r = id;
5900	<	Object v;
6018	<	while ((v = advance()) != null)
6019	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
5899	>	for (Node<K,V> p; (p = advance()) != null; )
5900	>	r = reducer.applyAsDouble(r, transformer.applyAsDouble(p.key, p.val));
5901		result = r;
5902	<	for (MapReduceMappingsToDoubleTask<K,V> t = this, s;;) {
5903	<	int c; BulkTask<K,V,?> par;
5904	<	if ((c = t.pending) == 0) {
5905	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5906	<	t.result = reducer.apply(t.result, s.result);
5907	<	}
5908	<	if ((par = t.parent) == null ||
5909	<	!(par instanceof MapReduceMappingsToDoubleTask)) {
5910	<	t.quietlyComplete();
6030	<	break;
6031	<	}
6032	<	t = (MapReduceMappingsToDoubleTask<K,V>)par;
5902	>	CountedCompleter<?> c;
5903	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5904	>	@SuppressWarnings("unchecked")
5905	>	MapReduceMappingsToDoubleTask<K,V>
5906	>	t = (MapReduceMappingsToDoubleTask<K,V>)c,
5907	>	s = t.rights;
5908	>	while (s != null) {
5909	>	t.result = reducer.applyAsDouble(t.result, s.result);
5910	>	s = t.rights = s.nextRight;
5911		}
6034	–	else if (t.casPending(c, c - 1))
6035	–	break;
5912		}
6037	–	} catch (Throwable ex) {
6038	–	return tryCompleteComputation(ex);
5913		}
6040	–	return false;
5914		}
6042	–	public final Double getRawResult() { return result; }
5915		}
5916
5917	<	@SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V>
5917	>	@SuppressWarnings("serial")
5918	>	static final class MapReduceKeysToLongTask<K,V>
5919		extends BulkTask<K,V,Long> {
5920	<	final ObjectToLong<? super K> transformer;
5921	<	final LongByLongToLong reducer;
5920	>	final ToLongFunction<? super K> transformer;
5921	>	final LongBinaryOperator reducer;
5922		final long basis;
5923		long result;
5924		MapReduceKeysToLongTask<K,V> rights, nextRight;
5925		MapReduceKeysToLongTask
5926	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5926	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5927		MapReduceKeysToLongTask<K,V> nextRight,
5928	<	ObjectToLong<? super K> transformer,
5928	>	ToLongFunction<? super K> transformer,
5929		long basis,
5930	<	LongByLongToLong reducer) {
5931	<	super(m, p, b); this.nextRight = nextRight;
5930	>	LongBinaryOperator reducer) {
5931	>	super(p, b, i, f, t); this.nextRight = nextRight;
5932		this.transformer = transformer;
5933		this.basis = basis; this.reducer = reducer;
5934		}
5935	<	@SuppressWarnings("unchecked") public final boolean exec() {
5936	<	final ObjectToLong<? super K> transformer =
5937	<	this.transformer;
5938	<	final LongByLongToLong reducer = this.reducer;
5939	<	if (transformer == null || reducer == null)
5940	<	return abortOnNullFunction();
5941	<	try {
5942	<	final long id = this.basis;
5943	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5944	<	do {} while (!casPending(c = pending, c+1));
5935	>	public final Long getRawResult() { return result; }
5936	>	public final void compute() {
5937	>	final ToLongFunction<? super K> transformer;
5938	>	final LongBinaryOperator reducer;
5939	>	if ((transformer = this.transformer) != null &&
5940	>	(reducer = this.reducer) != null) {
5941	>	long r = this.basis;
5942	>	for (int i = baseIndex, f, h; batch > 0 &&
5943	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5944	>	addToPendingCount(1);
5945		(rights = new MapReduceKeysToLongTask<K,V>
5946	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5946	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5947	>	rights, transformer, r, reducer)).fork();
5948		}
5949	<	long r = id;
5950	<	while (advance() != null)
6077	<	r = reducer.apply(r, transformer.apply((K)nextKey));
5949	>	for (Node<K,V> p; (p = advance()) != null; )
5950	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p.key));
5951		result = r;
5952	<	for (MapReduceKeysToLongTask<K,V> t = this, s;;) {
5953	<	int c; BulkTask<K,V,?> par;
5954	<	if ((c = t.pending) == 0) {
5955	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5956	<	t.result = reducer.apply(t.result, s.result);
5957	<	}
5958	<	if ((par = t.parent) == null ||
5959	<	!(par instanceof MapReduceKeysToLongTask)) {
5960	<	t.quietlyComplete();
6088	<	break;
6089	<	}
6090	<	t = (MapReduceKeysToLongTask<K,V>)par;
5952	>	CountedCompleter<?> c;
5953	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5954	>	@SuppressWarnings("unchecked")
5955	>	MapReduceKeysToLongTask<K,V>
5956	>	t = (MapReduceKeysToLongTask<K,V>)c,
5957	>	s = t.rights;
5958	>	while (s != null) {
5959	>	t.result = reducer.applyAsLong(t.result, s.result);
5960	>	s = t.rights = s.nextRight;
5961		}
6092	–	else if (t.casPending(c, c - 1))
6093	–	break;
5962		}
6095	–	} catch (Throwable ex) {
6096	–	return tryCompleteComputation(ex);
5963		}
6098	–	return false;
5964		}
6100	–	public final Long getRawResult() { return result; }
5965		}
5966
5967	<	@SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V>
5967	>	@SuppressWarnings("serial")
5968	>	static final class MapReduceValuesToLongTask<K,V>
5969		extends BulkTask<K,V,Long> {
5970	<	final ObjectToLong<? super V> transformer;
5971	<	final LongByLongToLong reducer;
5970	>	final ToLongFunction<? super V> transformer;
5971	>	final LongBinaryOperator reducer;
5972		final long basis;
5973		long result;
5974		MapReduceValuesToLongTask<K,V> rights, nextRight;
5975		MapReduceValuesToLongTask
5976	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
5976	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
5977		MapReduceValuesToLongTask<K,V> nextRight,
5978	<	ObjectToLong<? super V> transformer,
5978	>	ToLongFunction<? super V> transformer,
5979		long basis,
5980	<	LongByLongToLong reducer) {
5981	<	super(m, p, b); this.nextRight = nextRight;
5980	>	LongBinaryOperator reducer) {
5981	>	super(p, b, i, f, t); this.nextRight = nextRight;
5982		this.transformer = transformer;
5983		this.basis = basis; this.reducer = reducer;
5984		}
5985	<	@SuppressWarnings("unchecked") public final boolean exec() {
5986	<	final ObjectToLong<? super V> transformer =
5987	<	this.transformer;
5988	<	final LongByLongToLong reducer = this.reducer;
5989	<	if (transformer == null || reducer == null)
5990	<	return abortOnNullFunction();
5991	<	try {
5992	<	final long id = this.basis;
5993	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5994	<	do {} while (!casPending(c = pending, c+1));
5985	>	public final Long getRawResult() { return result; }
5986	>	public final void compute() {
5987	>	final ToLongFunction<? super V> transformer;
5988	>	final LongBinaryOperator reducer;
5989	>	if ((transformer = this.transformer) != null &&
5990	>	(reducer = this.reducer) != null) {
5991	>	long r = this.basis;
5992	>	for (int i = baseIndex, f, h; batch > 0 &&
5993	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
5994	>	addToPendingCount(1);
5995		(rights = new MapReduceValuesToLongTask<K,V>
5996	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
5996	>	(this, batch >>>= 1, baseLimit = h, f, tab,
5997	>	rights, transformer, r, reducer)).fork();
5998		}
5999	<	long r = id;
6000	<	Object v;
6135	<	while ((v = advance()) != null)
6136	<	r = reducer.apply(r, transformer.apply((V)v));
5999	>	for (Node<K,V> p; (p = advance()) != null; )
6000	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p.val));
6001		result = r;
6002	<	for (MapReduceValuesToLongTask<K,V> t = this, s;;) {
6003	<	int c; BulkTask<K,V,?> par;
6004	<	if ((c = t.pending) == 0) {
6005	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6006	<	t.result = reducer.apply(t.result, s.result);
6007	<	}
6008	<	if ((par = t.parent) == null ||
6009	<	!(par instanceof MapReduceValuesToLongTask)) {
6010	<	t.quietlyComplete();
6147	<	break;
6148	<	}
6149	<	t = (MapReduceValuesToLongTask<K,V>)par;
6002	>	CountedCompleter<?> c;
6003	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6004	>	@SuppressWarnings("unchecked")
6005	>	MapReduceValuesToLongTask<K,V>
6006	>	t = (MapReduceValuesToLongTask<K,V>)c,
6007	>	s = t.rights;
6008	>	while (s != null) {
6009	>	t.result = reducer.applyAsLong(t.result, s.result);
6010	>	s = t.rights = s.nextRight;
6011		}
6151	–	else if (t.casPending(c, c - 1))
6152	–	break;
6012		}
6154	–	} catch (Throwable ex) {
6155	–	return tryCompleteComputation(ex);
6013		}
6157	–	return false;
6014		}
6159	–	public final Long getRawResult() { return result; }
6015		}
6016
6017	<	@SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V>
6017	>	@SuppressWarnings("serial")
6018	>	static final class MapReduceEntriesToLongTask<K,V>
6019		extends BulkTask<K,V,Long> {
6020	<	final ObjectToLong<Map.Entry<K,V>> transformer;
6021	<	final LongByLongToLong reducer;
6020	>	final ToLongFunction<Map.Entry<K,V>> transformer;
6021	>	final LongBinaryOperator reducer;
6022		final long basis;
6023		long result;
6024		MapReduceEntriesToLongTask<K,V> rights, nextRight;
6025		MapReduceEntriesToLongTask
6026	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6026	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6027		MapReduceEntriesToLongTask<K,V> nextRight,
6028	<	ObjectToLong<Map.Entry<K,V>> transformer,
6028	>	ToLongFunction<Map.Entry<K,V>> transformer,
6029		long basis,
6030	<	LongByLongToLong reducer) {
6031	<	super(m, p, b); this.nextRight = nextRight;
6030	>	LongBinaryOperator reducer) {
6031	>	super(p, b, i, f, t); this.nextRight = nextRight;
6032		this.transformer = transformer;
6033		this.basis = basis; this.reducer = reducer;
6034		}
6035	<	@SuppressWarnings("unchecked") public final boolean exec() {
6036	<	final ObjectToLong<Map.Entry<K,V>> transformer =
6037	<	this.transformer;
6038	<	final LongByLongToLong reducer = this.reducer;
6039	<	if (transformer == null || reducer == null)
6040	<	return abortOnNullFunction();
6041	<	try {
6042	<	final long id = this.basis;
6043	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6044	<	do {} while (!casPending(c = pending, c+1));
6035	>	public final Long getRawResult() { return result; }
6036	>	public final void compute() {
6037	>	final ToLongFunction<Map.Entry<K,V>> transformer;
6038	>	final LongBinaryOperator reducer;
6039	>	if ((transformer = this.transformer) != null &&
6040	>	(reducer = this.reducer) != null) {
6041	>	long r = this.basis;
6042	>	for (int i = baseIndex, f, h; batch > 0 &&
6043	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6044	>	addToPendingCount(1);
6045		(rights = new MapReduceEntriesToLongTask<K,V>
6046	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6046	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6047	>	rights, transformer, r, reducer)).fork();
6048		}
6049	<	long r = id;
6050	<	Object v;
6194	<	while ((v = advance()) != null)
6195	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6049	>	for (Node<K,V> p; (p = advance()) != null; )
6050	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p));
6051		result = r;
6052	<	for (MapReduceEntriesToLongTask<K,V> t = this, s;;) {
6053	<	int c; BulkTask<K,V,?> par;
6054	<	if ((c = t.pending) == 0) {
6055	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6056	<	t.result = reducer.apply(t.result, s.result);
6057	<	}
6058	<	if ((par = t.parent) == null ||
6059	<	!(par instanceof MapReduceEntriesToLongTask)) {
6060	<	t.quietlyComplete();
6206	<	break;
6207	<	}
6208	<	t = (MapReduceEntriesToLongTask<K,V>)par;
6052	>	CountedCompleter<?> c;
6053	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6054	>	@SuppressWarnings("unchecked")
6055	>	MapReduceEntriesToLongTask<K,V>
6056	>	t = (MapReduceEntriesToLongTask<K,V>)c,
6057	>	s = t.rights;
6058	>	while (s != null) {
6059	>	t.result = reducer.applyAsLong(t.result, s.result);
6060	>	s = t.rights = s.nextRight;
6061		}
6210	–	else if (t.casPending(c, c - 1))
6211	–	break;
6062		}
6213	–	} catch (Throwable ex) {
6214	–	return tryCompleteComputation(ex);
6063		}
6216	–	return false;
6064		}
6218	–	public final Long getRawResult() { return result; }
6065		}
6066
6067	<	@SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V>
6067	>	@SuppressWarnings("serial")
6068	>	static final class MapReduceMappingsToLongTask<K,V>
6069		extends BulkTask<K,V,Long> {
6070	<	final ObjectByObjectToLong<? super K, ? super V> transformer;
6071	<	final LongByLongToLong reducer;
6070	>	final ToLongBiFunction<? super K, ? super V> transformer;
6071	>	final LongBinaryOperator reducer;
6072		final long basis;
6073		long result;
6074		MapReduceMappingsToLongTask<K,V> rights, nextRight;
6075		MapReduceMappingsToLongTask
6076	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6076	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6077		MapReduceMappingsToLongTask<K,V> nextRight,
6078	<	ObjectByObjectToLong<? super K, ? super V> transformer,
6078	>	ToLongBiFunction<? super K, ? super V> transformer,
6079		long basis,
6080	<	LongByLongToLong reducer) {
6081	<	super(m, p, b); this.nextRight = nextRight;
6080	>	LongBinaryOperator reducer) {
6081	>	super(p, b, i, f, t); this.nextRight = nextRight;
6082		this.transformer = transformer;
6083		this.basis = basis; this.reducer = reducer;
6084		}
6085	<	@SuppressWarnings("unchecked") public final boolean exec() {
6086	<	final ObjectByObjectToLong<? super K, ? super V> transformer =
6087	<	this.transformer;
6088	<	final LongByLongToLong reducer = this.reducer;
6089	<	if (transformer == null || reducer == null)
6090	<	return abortOnNullFunction();
6091	<	try {
6092	<	final long id = this.basis;
6093	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6094	<	do {} while (!casPending(c = pending, c+1));
6085	>	public final Long getRawResult() { return result; }
6086	>	public final void compute() {
6087	>	final ToLongBiFunction<? super K, ? super V> transformer;
6088	>	final LongBinaryOperator reducer;
6089	>	if ((transformer = this.transformer) != null &&
6090	>	(reducer = this.reducer) != null) {
6091	>	long r = this.basis;
6092	>	for (int i = baseIndex, f, h; batch > 0 &&
6093	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6094	>	addToPendingCount(1);
6095		(rights = new MapReduceMappingsToLongTask<K,V>
6096	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6096	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6097	>	rights, transformer, r, reducer)).fork();
6098		}
6099	<	long r = id;
6100	<	Object v;
6253	<	while ((v = advance()) != null)
6254	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6099	>	for (Node<K,V> p; (p = advance()) != null; )
6100	>	r = reducer.applyAsLong(r, transformer.applyAsLong(p.key, p.val));
6101		result = r;
6102	<	for (MapReduceMappingsToLongTask<K,V> t = this, s;;) {
6103	<	int c; BulkTask<K,V,?> par;
6104	<	if ((c = t.pending) == 0) {
6105	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6106	<	t.result = reducer.apply(t.result, s.result);
6107	<	}
6108	<	if ((par = t.parent) == null ||
6109	<	!(par instanceof MapReduceMappingsToLongTask)) {
6110	<	t.quietlyComplete();
6265	<	break;
6266	<	}
6267	<	t = (MapReduceMappingsToLongTask<K,V>)par;
6102	>	CountedCompleter<?> c;
6103	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6104	>	@SuppressWarnings("unchecked")
6105	>	MapReduceMappingsToLongTask<K,V>
6106	>	t = (MapReduceMappingsToLongTask<K,V>)c,
6107	>	s = t.rights;
6108	>	while (s != null) {
6109	>	t.result = reducer.applyAsLong(t.result, s.result);
6110	>	s = t.rights = s.nextRight;
6111		}
6269	–	else if (t.casPending(c, c - 1))
6270	–	break;
6112		}
6272	–	} catch (Throwable ex) {
6273	–	return tryCompleteComputation(ex);
6113		}
6275	–	return false;
6114		}
6277	–	public final Long getRawResult() { return result; }
6115		}
6116
6117	<	@SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V>
6117	>	@SuppressWarnings("serial")
6118	>	static final class MapReduceKeysToIntTask<K,V>
6119		extends BulkTask<K,V,Integer> {
6120	<	final ObjectToInt<? super K> transformer;
6121	<	final IntByIntToInt reducer;
6120	>	final ToIntFunction<? super K> transformer;
6121	>	final IntBinaryOperator reducer;
6122		final int basis;
6123		int result;
6124		MapReduceKeysToIntTask<K,V> rights, nextRight;
6125		MapReduceKeysToIntTask
6126	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6126	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6127		MapReduceKeysToIntTask<K,V> nextRight,
6128	<	ObjectToInt<? super K> transformer,
6128	>	ToIntFunction<? super K> transformer,
6129		int basis,
6130	<	IntByIntToInt reducer) {
6131	<	super(m, p, b); this.nextRight = nextRight;
6130	>	IntBinaryOperator reducer) {
6131	>	super(p, b, i, f, t); this.nextRight = nextRight;
6132		this.transformer = transformer;
6133		this.basis = basis; this.reducer = reducer;
6134		}
6135	<	@SuppressWarnings("unchecked") public final boolean exec() {
6136	<	final ObjectToInt<? super K> transformer =
6137	<	this.transformer;
6138	<	final IntByIntToInt reducer = this.reducer;
6139	<	if (transformer == null || reducer == null)
6140	<	return abortOnNullFunction();
6141	<	try {
6142	<	final int id = this.basis;
6143	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6144	<	do {} while (!casPending(c = pending, c+1));
6135	>	public final Integer getRawResult() { return result; }
6136	>	public final void compute() {
6137	>	final ToIntFunction<? super K> transformer;
6138	>	final IntBinaryOperator reducer;
6139	>	if ((transformer = this.transformer) != null &&
6140	>	(reducer = this.reducer) != null) {
6141	>	int r = this.basis;
6142	>	for (int i = baseIndex, f, h; batch > 0 &&
6143	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6144	>	addToPendingCount(1);
6145		(rights = new MapReduceKeysToIntTask<K,V>
6146	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6146	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6147	>	rights, transformer, r, reducer)).fork();
6148		}
6149	<	int r = id;
6150	<	while (advance() != null)
6312	<	r = reducer.apply(r, transformer.apply((K)nextKey));
6149	>	for (Node<K,V> p; (p = advance()) != null; )
6150	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p.key));
6151		result = r;
6152	<	for (MapReduceKeysToIntTask<K,V> t = this, s;;) {
6153	<	int c; BulkTask<K,V,?> par;
6154	<	if ((c = t.pending) == 0) {
6155	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6156	<	t.result = reducer.apply(t.result, s.result);
6157	<	}
6158	<	if ((par = t.parent) == null ||
6159	<	!(par instanceof MapReduceKeysToIntTask)) {
6160	<	t.quietlyComplete();
6323	<	break;
6324	<	}
6325	<	t = (MapReduceKeysToIntTask<K,V>)par;
6152	>	CountedCompleter<?> c;
6153	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6154	>	@SuppressWarnings("unchecked")
6155	>	MapReduceKeysToIntTask<K,V>
6156	>	t = (MapReduceKeysToIntTask<K,V>)c,
6157	>	s = t.rights;
6158	>	while (s != null) {
6159	>	t.result = reducer.applyAsInt(t.result, s.result);
6160	>	s = t.rights = s.nextRight;
6161		}
6327	–	else if (t.casPending(c, c - 1))
6328	–	break;
6162		}
6330	–	} catch (Throwable ex) {
6331	–	return tryCompleteComputation(ex);
6163		}
6333	–	return false;
6164		}
6335	–	public final Integer getRawResult() { return result; }
6165		}
6166
6167	<	@SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V>
6167	>	@SuppressWarnings("serial")
6168	>	static final class MapReduceValuesToIntTask<K,V>
6169		extends BulkTask<K,V,Integer> {
6170	<	final ObjectToInt<? super V> transformer;
6171	<	final IntByIntToInt reducer;
6170	>	final ToIntFunction<? super V> transformer;
6171	>	final IntBinaryOperator reducer;
6172		final int basis;
6173		int result;
6174		MapReduceValuesToIntTask<K,V> rights, nextRight;
6175		MapReduceValuesToIntTask
6176	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6176	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6177		MapReduceValuesToIntTask<K,V> nextRight,
6178	<	ObjectToInt<? super V> transformer,
6178	>	ToIntFunction<? super V> transformer,
6179		int basis,
6180	<	IntByIntToInt reducer) {
6181	<	super(m, p, b); this.nextRight = nextRight;
6180	>	IntBinaryOperator reducer) {
6181	>	super(p, b, i, f, t); this.nextRight = nextRight;
6182		this.transformer = transformer;
6183		this.basis = basis; this.reducer = reducer;
6184		}
6185	<	@SuppressWarnings("unchecked") public final boolean exec() {
6186	<	final ObjectToInt<? super V> transformer =
6187	<	this.transformer;
6188	<	final IntByIntToInt reducer = this.reducer;
6189	<	if (transformer == null || reducer == null)
6190	<	return abortOnNullFunction();
6191	<	try {
6192	<	final int id = this.basis;
6193	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6194	<	do {} while (!casPending(c = pending, c+1));
6185	>	public final Integer getRawResult() { return result; }
6186	>	public final void compute() {
6187	>	final ToIntFunction<? super V> transformer;
6188	>	final IntBinaryOperator reducer;
6189	>	if ((transformer = this.transformer) != null &&
6190	>	(reducer = this.reducer) != null) {
6191	>	int r = this.basis;
6192	>	for (int i = baseIndex, f, h; batch > 0 &&
6193	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6194	>	addToPendingCount(1);
6195		(rights = new MapReduceValuesToIntTask<K,V>
6196	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6196	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6197	>	rights, transformer, r, reducer)).fork();
6198		}
6199	<	int r = id;
6200	<	Object v;
6370	<	while ((v = advance()) != null)
6371	<	r = reducer.apply(r, transformer.apply((V)v));
6199	>	for (Node<K,V> p; (p = advance()) != null; )
6200	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p.val));
6201		result = r;
6202	<	for (MapReduceValuesToIntTask<K,V> t = this, s;;) {
6203	<	int c; BulkTask<K,V,?> par;
6204	<	if ((c = t.pending) == 0) {
6205	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6206	<	t.result = reducer.apply(t.result, s.result);
6207	<	}
6208	<	if ((par = t.parent) == null ||
6209	<	!(par instanceof MapReduceValuesToIntTask)) {
6210	<	t.quietlyComplete();
6382	<	break;
6383	<	}
6384	<	t = (MapReduceValuesToIntTask<K,V>)par;
6202	>	CountedCompleter<?> c;
6203	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6204	>	@SuppressWarnings("unchecked")
6205	>	MapReduceValuesToIntTask<K,V>
6206	>	t = (MapReduceValuesToIntTask<K,V>)c,
6207	>	s = t.rights;
6208	>	while (s != null) {
6209	>	t.result = reducer.applyAsInt(t.result, s.result);
6210	>	s = t.rights = s.nextRight;
6211		}
6386	–	else if (t.casPending(c, c - 1))
6387	–	break;
6212		}
6389	–	} catch (Throwable ex) {
6390	–	return tryCompleteComputation(ex);
6213		}
6392	–	return false;
6214		}
6394	–	public final Integer getRawResult() { return result; }
6215		}
6216
6217	<	@SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V>
6217	>	@SuppressWarnings("serial")
6218	>	static final class MapReduceEntriesToIntTask<K,V>
6219		extends BulkTask<K,V,Integer> {
6220	<	final ObjectToInt<Map.Entry<K,V>> transformer;
6221	<	final IntByIntToInt reducer;
6220	>	final ToIntFunction<Map.Entry<K,V>> transformer;
6221	>	final IntBinaryOperator reducer;
6222		final int basis;
6223		int result;
6224		MapReduceEntriesToIntTask<K,V> rights, nextRight;
6225		MapReduceEntriesToIntTask
6226	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6226	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6227		MapReduceEntriesToIntTask<K,V> nextRight,
6228	<	ObjectToInt<Map.Entry<K,V>> transformer,
6228	>	ToIntFunction<Map.Entry<K,V>> transformer,
6229		int basis,
6230	<	IntByIntToInt reducer) {
6231	<	super(m, p, b); this.nextRight = nextRight;
6230	>	IntBinaryOperator reducer) {
6231	>	super(p, b, i, f, t); this.nextRight = nextRight;
6232		this.transformer = transformer;
6233		this.basis = basis; this.reducer = reducer;
6234		}
6235	<	@SuppressWarnings("unchecked") public final boolean exec() {
6236	<	final ObjectToInt<Map.Entry<K,V>> transformer =
6237	<	this.transformer;
6238	<	final IntByIntToInt reducer = this.reducer;
6239	<	if (transformer == null || reducer == null)
6240	<	return abortOnNullFunction();
6241	<	try {
6242	<	final int id = this.basis;
6243	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6244	<	do {} while (!casPending(c = pending, c+1));
6235	>	public final Integer getRawResult() { return result; }
6236	>	public final void compute() {
6237	>	final ToIntFunction<Map.Entry<K,V>> transformer;
6238	>	final IntBinaryOperator reducer;
6239	>	if ((transformer = this.transformer) != null &&
6240	>	(reducer = this.reducer) != null) {
6241	>	int r = this.basis;
6242	>	for (int i = baseIndex, f, h; batch > 0 &&
6243	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6244	>	addToPendingCount(1);
6245		(rights = new MapReduceEntriesToIntTask<K,V>
6246	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6246	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6247	>	rights, transformer, r, reducer)).fork();
6248		}
6249	<	int r = id;
6250	<	Object v;
6429	<	while ((v = advance()) != null)
6430	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6249	>	for (Node<K,V> p; (p = advance()) != null; )
6250	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p));
6251		result = r;
6252	<	for (MapReduceEntriesToIntTask<K,V> t = this, s;;) {
6253	<	int c; BulkTask<K,V,?> par;
6254	<	if ((c = t.pending) == 0) {
6255	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6256	<	t.result = reducer.apply(t.result, s.result);
6257	<	}
6258	<	if ((par = t.parent) == null ||
6259	<	!(par instanceof MapReduceEntriesToIntTask)) {
6260	<	t.quietlyComplete();
6441	<	break;
6442	<	}
6443	<	t = (MapReduceEntriesToIntTask<K,V>)par;
6252	>	CountedCompleter<?> c;
6253	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6254	>	@SuppressWarnings("unchecked")
6255	>	MapReduceEntriesToIntTask<K,V>
6256	>	t = (MapReduceEntriesToIntTask<K,V>)c,
6257	>	s = t.rights;
6258	>	while (s != null) {
6259	>	t.result = reducer.applyAsInt(t.result, s.result);
6260	>	s = t.rights = s.nextRight;
6261		}
6445	–	else if (t.casPending(c, c - 1))
6446	–	break;
6262		}
6448	–	} catch (Throwable ex) {
6449	–	return tryCompleteComputation(ex);
6263		}
6451	–	return false;
6264		}
6453	–	public final Integer getRawResult() { return result; }
6265		}
6266
6267	<	@SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V>
6267	>	@SuppressWarnings("serial")
6268	>	static final class MapReduceMappingsToIntTask<K,V>
6269		extends BulkTask<K,V,Integer> {
6270	<	final ObjectByObjectToInt<? super K, ? super V> transformer;
6271	<	final IntByIntToInt reducer;
6270	>	final ToIntBiFunction<? super K, ? super V> transformer;
6271	>	final IntBinaryOperator reducer;
6272		final int basis;
6273		int result;
6274		MapReduceMappingsToIntTask<K,V> rights, nextRight;
6275		MapReduceMappingsToIntTask
6276	<	(ConcurrentHashMap<K,V> m, BulkTask<K,V,?> p, int b,
6277	<	MapReduceMappingsToIntTask<K,V> rights,
6278	<	ObjectByObjectToInt<? super K, ? super V> transformer,
6276	>	(BulkTask<K,V,?> p, int b, int i, int f, Node<K,V>[] t,
6277	>	MapReduceMappingsToIntTask<K,V> nextRight,
6278	>	ToIntBiFunction<? super K, ? super V> transformer,
6279		int basis,
6280	<	IntByIntToInt reducer) {
6281	<	super(m, p, b); this.nextRight = nextRight;
6280	>	IntBinaryOperator reducer) {
6281	>	super(p, b, i, f, t); this.nextRight = nextRight;
6282		this.transformer = transformer;
6283		this.basis = basis; this.reducer = reducer;
6284		}
6285	<	@SuppressWarnings("unchecked") public final boolean exec() {
6286	<	final ObjectByObjectToInt<? super K, ? super V> transformer =
6287	<	this.transformer;
6288	<	final IntByIntToInt reducer = this.reducer;
6289	<	if (transformer == null || reducer == null)
6290	<	return abortOnNullFunction();
6291	<	try {
6292	<	final int id = this.basis;
6293	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6294	<	do {} while (!casPending(c = pending, c+1));
6285	>	public final Integer getRawResult() { return result; }
6286	>	public final void compute() {
6287	>	final ToIntBiFunction<? super K, ? super V> transformer;
6288	>	final IntBinaryOperator reducer;
6289	>	if ((transformer = this.transformer) != null &&
6290	>	(reducer = this.reducer) != null) {
6291	>	int r = this.basis;
6292	>	for (int i = baseIndex, f, h; batch > 0 &&
6293	>	(h = ((f = baseLimit) + i) >>> 1) > i;) {
6294	>	addToPendingCount(1);
6295		(rights = new MapReduceMappingsToIntTask<K,V>
6296	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6296	>	(this, batch >>>= 1, baseLimit = h, f, tab,
6297	>	rights, transformer, r, reducer)).fork();
6298		}
6299	<	int r = id;
6300	<	Object v;
6488	<	while ((v = advance()) != null)
6489	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6299	>	for (Node<K,V> p; (p = advance()) != null; )
6300	>	r = reducer.applyAsInt(r, transformer.applyAsInt(p.key, p.val));
6301		result = r;
6302	<	for (MapReduceMappingsToIntTask<K,V> t = this, s;;) {
6303	<	int c; BulkTask<K,V,?> par;
6304	<	if ((c = t.pending) == 0) {
6305	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6306	<	t.result = reducer.apply(t.result, s.result);
6307	<	}
6308	<	if ((par = t.parent) == null ||
6309	<	!(par instanceof MapReduceMappingsToIntTask)) {
6310	<	t.quietlyComplete();
6500	<	break;
6501	<	}
6502	<	t = (MapReduceMappingsToIntTask<K,V>)par;
6302	>	CountedCompleter<?> c;
6303	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6304	>	@SuppressWarnings("unchecked")
6305	>	MapReduceMappingsToIntTask<K,V>
6306	>	t = (MapReduceMappingsToIntTask<K,V>)c,
6307	>	s = t.rights;
6308	>	while (s != null) {
6309	>	t.result = reducer.applyAsInt(t.result, s.result);
6310	>	s = t.rights = s.nextRight;
6311		}
6504	–	else if (t.casPending(c, c - 1))
6505	–	break;
6312		}
6507	–	} catch (Throwable ex) {
6508	–	return tryCompleteComputation(ex);
6313		}
6510	–	return false;
6314		}
6512	–	public final Integer getRawResult() { return result; }
6315		}
6316
6515	–
6317		// Unsafe mechanics
6318	<	private static final sun.misc.Unsafe UNSAFE;
6319	<	private static final long counterOffset;
6320	<	private static final long sizeCtlOffset;
6321	<	private static final long ABASE;
6318	>	private static final Unsafe U = Unsafe.getUnsafe();
6319	>	private static final long SIZECTL;
6320	>	private static final long TRANSFERINDEX;
6321	>	private static final long BASECOUNT;
6322	>	private static final long CELLSBUSY;
6323	>	private static final long CELLVALUE;
6324	>	private static final int ABASE;
6325		private static final int ASHIFT;
6326
6327		static {
6328	<	int ss;
6329	<	try {
6330	<	UNSAFE = sun.misc.Unsafe.getUnsafe();
6331	<	Class<?> k = ConcurrentHashMap.class;
6332	<	counterOffset = UNSAFE.objectFieldOffset
6333	<	(k.getDeclaredField("counter"));
6334	<	sizeCtlOffset = UNSAFE.objectFieldOffset
6335	<	(k.getDeclaredField("sizeCtl"));
6336	<	Class<?> sc = Node[].class;
6337	<	ABASE = UNSAFE.arrayBaseOffset(sc);
6338	<	ss = UNSAFE.arrayIndexScale(sc);
6339	<	} catch (Exception e) {
6340	<	throw new Error(e);
6341	<	}
6342	<	if ((ss & (ss-1)) != 0)
6343	<	throw new Error("data type scale not a power of two");
6344	<	ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
6328	>	SIZECTL = U.objectFieldOffset
6329	>	(ConcurrentHashMap.class, "sizeCtl");
6330	>	TRANSFERINDEX = U.objectFieldOffset
6331	>	(ConcurrentHashMap.class, "transferIndex");
6332	>	BASECOUNT = U.objectFieldOffset
6333	>	(ConcurrentHashMap.class, "baseCount");
6334	>	CELLSBUSY = U.objectFieldOffset
6335	>	(ConcurrentHashMap.class, "cellsBusy");
6336	>
6337	>	CELLVALUE = U.objectFieldOffset
6338	>	(CounterCell.class, "value");
6339	>
6340	>	ABASE = U.arrayBaseOffset(Node[].class);
6341	>	int scale = U.arrayIndexScale(Node[].class);
6342	>	if ((scale & (scale - 1)) != 0)
6343	>	throw new ExceptionInInitializerError("array index scale not a power of two");
6344	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(scale);
6345	>
6346	>	// Reduce the risk of rare disastrous classloading in first call to
6347	>	// LockSupport.park: https://bugs.openjdk.java.net/browse/JDK-8074773
6348	>	Class<?> ensureLoaded = LockSupport.class;
6349	>
6350	>	// Eager class load observed to help JIT during startup
6351	>	ensureLoaded = ReservationNode.class;
6352		}
6353		}

Diff Legend

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