ViewVC Help

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

root/jsr166/jsr166/src/jsr166e/ConcurrentHashMapV8.java

Comparing jsr166/src/jsr166e/ConcurrentHashMapV8.java (file contents):
Revision 1.3 by jsr166, Tue Aug 30 07:18:46 2011 UTC vs.
Revision 1.84 by dl, Sat Dec 15 20:21:25 2012 UTC

#	Line 5 | Line 5
5		*/
6
7		package jsr166e;
8	<	import jsr166e.LongAdder;
8	>
9	>	import java.util.Comparator;
10	>	import java.util.Arrays;
11		import java.util.Map;
12		import java.util.Set;
13		import java.util.Collection;
#	Line 19 | Line 21 | import java.util.Enumeration;
21		import java.util.ConcurrentModificationException;
22		import java.util.NoSuchElementException;
23		import java.util.concurrent.ConcurrentMap;
24	+	import java.util.concurrent.locks.AbstractQueuedSynchronizer;
25	+	import java.util.concurrent.atomic.AtomicInteger;
26	+	import java.util.concurrent.atomic.AtomicReference;
27		import java.io.Serializable;
28
29		/**
#	Line 33 | Line 38 | import java.io.Serializable;
38		* interoperable with {@code Hashtable} in programs that rely on its
39		* thread safety but not on its synchronization details.
40		*
41	<	* <p> Retrieval operations (including {@code get}) generally do not
41	>	* <p>Retrieval operations (including {@code get}) generally do not
42		* block, so may overlap with update operations (including {@code put}
43		* and {@code remove}). Retrievals reflect the results of the most
44		* recently <em>completed</em> update operations holding upon their
45	<	* onset.  For aggregate operations such as {@code putAll} and {@code
46	<	* clear}, concurrent retrievals may reflect insertion or removal of
47	<	* only some entries.  Similarly, Iterators and Enumerations return
48	<	* elements reflecting the state of the hash table at some point at or
49	<	* since the creation of the iterator/enumeration.  They do
50	<	* <em>not</em> throw {@link ConcurrentModificationException}.
51	<	* However, iterators are designed to be used by only one thread at a
52	<	* time.  Bear in mind that the results of aggregate status methods
53	<	* including {@code size}, {@code isEmpty}, and {@code containsValue}
54	<	* are typically useful only when a map is not undergoing concurrent
55	<	* updates in other threads.  Otherwise the results of these methods
56	<	* reflect transient states that may be adequate for monitoring
57	<	* purposes, but not for program control.
58	<	*
59	<	* <p> Resizing this or any other kind of hash table is a relatively
60	<	* slow operation, so, when possible, it is a good idea to provide
61	<	* estimates of expected table sizes in constructors. Also, for
62	<	* compatability with previous versions of this class, constructors
63	<	* may optionally specify an expected {@code concurrencyLevel} as an
64	<	* additional hint for internal sizing.
45	>	* onset. (More formally, an update operation for a given key bears a
46	>	* <em>happens-before</em> relation with any (non-null) retrieval for
47	>	* that key reporting the updated value.)  For aggregate operations
48	>	* such as {@code putAll} and {@code clear}, concurrent retrievals may
49	>	* reflect insertion or removal of only some entries.  Similarly,
50	>	* Iterators and Enumerations return elements reflecting the state of
51	>	* the hash table at some point at or since the creation of the
52	>	* iterator/enumeration.  They do <em>not</em> throw {@link
53	>	* ConcurrentModificationException}.  However, iterators are designed
54	>	* to be used by only one thread at a time.  Bear in mind that the
55	>	* results of aggregate status methods including {@code size}, {@code
56	>	* isEmpty}, and {@code containsValue} are typically useful only when
57	>	* a map is not undergoing concurrent updates in other threads.
58	>	* Otherwise the results of these methods reflect transient states
59	>	* that may be adequate for monitoring or estimation purposes, but not
60	>	* for program control.
61	>	*
62	>	* <p>The table is dynamically expanded when there are too many
63	>	* collisions (i.e., keys that have distinct hash codes but fall into
64	>	* the same slot modulo the table size), with the expected average
65	>	* effect of maintaining roughly two bins per mapping (corresponding
66	>	* to a 0.75 load factor threshold for resizing). There may be much
67	>	* variance around this average as mappings are added and removed, but
68	>	* overall, this maintains a commonly accepted time/space tradeoff for
69	>	* hash tables.  However, resizing this or any other kind of hash
70	>	* table may be a relatively slow operation. When possible, it is a
71	>	* good idea to provide a size estimate as an optional {@code
72	>	* initialCapacity} constructor argument. An additional optional
73	>	* {@code loadFactor} constructor argument provides a further means of
74	>	* customizing initial table capacity by specifying the table density
75	>	* to be used in calculating the amount of space to allocate for the
76	>	* given number of elements.  Also, for compatibility with previous
77	>	* versions of this class, constructors may optionally specify an
78	>	* expected {@code concurrencyLevel} as an additional hint for
79	>	* internal sizing.  Note that using many keys with exactly the same
80	>	* {@code hashCode()} is a sure way to slow down performance of any
81	>	* hash table.
82	>	*
83	>	* <p>A {@link Set} projection of a ConcurrentHashMapV8 may be created
84	>	* (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
85	>	* (using {@link #keySet(Object)} when only keys are of interest, and the
86	>	* mapped values are (perhaps transiently) not used or all take the
87	>	* same mapping value.
88	>	*
89	>	* <p>A ConcurrentHashMapV8 can be used as scalable frequency map (a
90	>	* form of histogram or multiset) by using {@link LongAdder} values
91	>	* and initializing via {@link #computeIfAbsent}. For example, to add
92	>	* a count to a {@code ConcurrentHashMapV8<String,LongAdder> freqs}, you
93	>	* can use {@code freqs.computeIfAbsent(k -> new
94	>	* LongAdder()).increment();}
95		*
96		* <p>This class and its views and iterators implement all of the
97		* <em>optional</em> methods of the {@link Map} and {@link Iterator}
98		* interfaces.
99		*
100	<	* <p> Like {@link Hashtable} but unlike {@link HashMap}, this class
100	>	* <p>Like {@link Hashtable} but unlike {@link HashMap}, this class
101		* does <em>not</em> allow {@code null} to be used as a key or value.
102		*
103	+	* <p>ConcurrentHashMapV8s support sequential and parallel operations
104	+	* bulk operations. (Parallel forms use the {@link
105	+	* ForkJoinPool#commonPool()}). Tasks that may be used in other
106	+	* contexts are available in class {@link ForkJoinTasks}. These
107	+	* operations are designed to be safely, and often sensibly, applied
108	+	* even with maps that are being concurrently updated by other
109	+	* threads; for example, when computing a snapshot summary of the
110	+	* values in a shared registry.  There are three kinds of operation,
111	+	* each with four forms, accepting functions with Keys, Values,
112	+	* Entries, and (Key, Value) arguments and/or return values. Because
113	+	* the elements of a ConcurrentHashMapV8 are not ordered in any
114	+	* particular way, and may be processed in different orders in
115	+	* different parallel executions, the correctness of supplied
116	+	* functions should not depend on any ordering, or on any other
117	+	* objects or values that may transiently change while computation is
118	+	* in progress; and except for forEach actions, should ideally be
119	+	* side-effect-free.
120	+	*
121	+	* <ul>
122	+	* <li> forEach: Perform a given action on each element.
123	+	* A variant form applies a given transformation on each element
124	+	* before performing the action.</li>
125	+	*
126	+	* <li> search: Return the first available non-null result of
127	+	* applying a given function on each element; skipping further
128	+	* search when a result is found.</li>
129	+	*
130	+	* <li> reduce: Accumulate each element.  The supplied reduction
131	+	* function cannot rely on ordering (more formally, it should be
132	+	* both associative and commutative).  There are five variants:
133	+	*
134	+	* <ul>
135	+	*
136	+	* <li> Plain reductions. (There is not a form of this method for
137	+	* (key, value) function arguments since there is no corresponding
138	+	* return type.)</li>
139	+	*
140	+	* <li> Mapped reductions that accumulate the results of a given
141	+	* function applied to each element.</li>
142	+	*
143	+	* <li> Reductions to scalar doubles, longs, and ints, using a
144	+	* given basis value.</li>
145	+	*
146	+	* </li>
147	+	* </ul>
148	+	* </ul>
149	+	*
150	+	* <p>The concurrency properties of bulk operations follow
151	+	* from those of ConcurrentHashMapV8: Any non-null result returned
152	+	* from {@code get(key)} and related access methods bears a
153	+	* happens-before relation with the associated insertion or
154	+	* update.  The result of any bulk operation reflects the
155	+	* composition of these per-element relations (but is not
156	+	* necessarily atomic with respect to the map as a whole unless it
157	+	* is somehow known to be quiescent).  Conversely, because keys
158	+	* and values in the map are never null, null serves as a reliable
159	+	* atomic indicator of the current lack of any result.  To
160	+	* maintain this property, null serves as an implicit basis for
161	+	* all non-scalar reduction operations. For the double, long, and
162	+	* int versions, the basis should be one that, when combined with
163	+	* any other value, returns that other value (more formally, it
164	+	* should be the identity element for the reduction). Most common
165	+	* reductions have these properties; for example, computing a sum
166	+	* with basis 0 or a minimum with basis MAX_VALUE.
167	+	*
168	+	* <p>Search and transformation functions provided as arguments
169	+	* should similarly return null to indicate the lack of any result
170	+	* (in which case it is not used). In the case of mapped
171	+	* reductions, this also enables transformations to serve as
172	+	* filters, returning null (or, in the case of primitive
173	+	* specializations, the identity basis) if the element should not
174	+	* be combined. You can create compound transformations and
175	+	* filterings by composing them yourself under this "null means
176	+	* there is nothing there now" rule before using them in search or
177	+	* reduce operations.
178	+	*
179	+	* <p>Methods accepting and/or returning Entry arguments maintain
180	+	* key-value associations. They may be useful for example when
181	+	* finding the key for the greatest value. Note that "plain" Entry
182	+	* arguments can be supplied using {@code new
183	+	* AbstractMap.SimpleEntry(k,v)}.
184	+	*
185	+	* <p>Bulk operations may complete abruptly, throwing an
186	+	* exception encountered in the application of a supplied
187	+	* function. Bear in mind when handling such exceptions that other
188	+	* concurrently executing functions could also have thrown
189	+	* exceptions, or would have done so if the first exception had
190	+	* not occurred.
191	+	*
192	+	* <p>Speedups for parallel compared to sequential forms are common
193	+	* but not guaranteed.  Parallel operations involving brief functions
194	+	* on small maps may execute more slowly than sequential forms if the
195	+	* underlying work to parallelize the computation is more expensive
196	+	* than the computation itself.  Similarly, parallelization may not
197	+	* lead to much actual parallelism if all processors are busy
198	+	* performing unrelated tasks.
199	+	*
200	+	* <p>All arguments to all task methods must be non-null.
201	+	*
202	+	* <p><em>jsr166e note: During transition, this class
203	+	* uses nested functional interfaces with different names but the
204	+	* same forms as those expected for JDK8.</em>
205	+	*
206		* <p>This class is a member of the
207		* <a href="{@docRoot}/../technotes/guides/collections/index.html">
208		* Java Collections Framework</a>.
209		*
72	–	* <p><em>jsr166e note: This class is a candidate replacement for
73	–	* java.util.concurrent.ConcurrentHashMap.<em>
74	–	*
210		* @since 1.5
211		* @author Doug Lea
212		* @param <K> the type of keys maintained by this map
213		* @param <V> the type of mapped values
214		*/
215		public class ConcurrentHashMapV8<K, V>
216	<	implements ConcurrentMap<K, V>, Serializable {
216	>	implements ConcurrentMap<K, V>, Serializable {
217		private static final long serialVersionUID = 7249069246763182397L;
218
219		/**
220	<	* A function computing a mapping from the given key to a value,
221	<	*  or <code>null</code> if there is no mapping. This is a
222	<	* place-holder for an upcoming JDK8 interface.
223	<	*/
224	<	public static interface MappingFunction<K, V> {
225	<	/**
226	<	* Returns a value for the given key, or null if there is no
227	<	* mapping. If this function throws an (unchecked) exception,
228	<	* the exception is rethrown to its caller, and no mapping is
229	<	* recorded.  Because this function is invoked within
230	<	* atomicity control, the computation should be short and
231	<	* simple. The most common usage is to construct a new object
232	<	* serving as an initial mapped value.
220	>	* A partitionable iterator. A Spliterator can be traversed
221	>	* directly, but can also be partitioned (before traversal) by
222	>	* creating another Spliterator that covers a non-overlapping
223	>	* portion of the elements, and so may be amenable to parallel
224	>	* execution.
225	>	*
226	>	* <p>This interface exports a subset of expected JDK8
227	>	* functionality.
228	>	*
229	>	* <p>Sample usage: Here is one (of the several) ways to compute
230	>	* the sum of the values held in a map using the ForkJoin
231	>	* framework. As illustrated here, Spliterators are well suited to
232	>	* designs in which a task repeatedly splits off half its work
233	>	* into forked subtasks until small enough to process directly,
234	>	* and then joins these subtasks. Variants of this style can also
235	>	* be used in completion-based designs.
236	>	*
237	>	* <pre>
238	>	* {@code ConcurrentHashMapV8<String, Long> m = ...
239	>	* // split as if have 8 * parallelism, for load balance
240	>	* int n = m.size();
241	>	* int p = aForkJoinPool.getParallelism() * 8;
242	>	* int split = (n < p)? n : p;
243	>	* long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
244	>	* // ...
245	>	* static class SumValues extends RecursiveTask<Long> {
246	>	*   final Spliterator<Long> s;
247	>	*   final int split;             // split while > 1
248	>	*   final SumValues nextJoin;    // records forked subtasks to join
249	>	*   SumValues(Spliterator<Long> s, int depth, SumValues nextJoin) {
250	>	*     this.s = s; this.depth = depth; this.nextJoin = nextJoin;
251	>	*   }
252	>	*   public Long compute() {
253	>	*     long sum = 0;
254	>	*     SumValues subtasks = null; // fork subtasks
255	>	*     for (int s = split >>> 1; s > 0; s >>>= 1)
256	>	*       (subtasks = new SumValues(s.split(), s, subtasks)).fork();
257	>	*     while (s.hasNext())        // directly process remaining elements
258	>	*       sum += s.next();
259	>	*     for (SumValues t = subtasks; t != null; t = t.nextJoin)
260	>	*       sum += t.join();         // collect subtask results
261	>	*     return sum;
262	>	*   }
263	>	* }
264	>	* }</pre>
265	>	*/
266	>	public static interface Spliterator<T> extends Iterator<T> {
267	>	/**
268	>	* Returns a Spliterator covering approximately half of the
269	>	* elements, guaranteed not to overlap with those subsequently
270	>	* returned by this Spliterator.  After invoking this method,
271	>	* the current Spliterator will <em>not</em> produce any of
272	>	* the elements of the returned Spliterator, but the two
273	>	* Spliterators together will produce all of the elements that
274	>	* would have been produced by this Spliterator had this
275	>	* method not been called. The exact number of elements
276	>	* produced by the returned Spliterator is not guaranteed, and
277	>	* may be zero (i.e., with {@code hasNext()} reporting {@code
278	>	* false}) if this Spliterator cannot be further split.
279		*
280	<	* @param key the (non-null) key
281	<	* @return a value, or null if none
280	>	* @return a Spliterator covering approximately half of the
281	>	* elements
282	>	* @throws IllegalStateException if this Spliterator has
283	>	* already commenced traversing elements
284		*/
285	<	V map(K key);
285	>	Spliterator<T> split();
286		}
287
288		/*
#	Line 108 | Line 291 | public class ConcurrentHashMapV8<K, V>
291		* The primary design goal of this hash table is to maintain
292		* concurrent readability (typically method get(), but also
293		* iterators and related methods) while minimizing update
294	<	* contention.
295	<	*
296	<	* Each key-value mapping is held in a Node.  Because Node fields
297	<	* can contain special values, they are defined using plain Object
298	<	* types. Similarly in turn, all internal methods that use them
299	<	* work off Object types. All public generic-typed methods relay
300	<	* in/out of these internal methods, supplying casts as needed.
294	>	* contention. Secondary goals are to keep space consumption about
295	>	* the same or better than java.util.HashMap, and to support high
296	>	* initial insertion rates on an empty table by many threads.
297	>	*
298	>	* Each key-value mapping is held in a Node.  Because Node key
299	>	* fields can contain special values, they are defined using plain
300	>	* Object types (not type "K"). This leads to a lot of explicit
301	>	* casting (and many explicit warning suppressions to tell
302	>	* compilers not to complain about it). It also allows some of the
303	>	* public methods to be factored into a smaller number of internal
304	>	* methods (although sadly not so for the five variants of
305	>	* put-related operations). The validation-based approach
306	>	* explained below leads to a lot of code sprawl because
307	>	* retry-control precludes factoring into smaller methods.
308		*
309		* The table is lazily initialized to a power-of-two size upon the
310	<	* first insertion.  Each bin in the table contains a (typically
311	<	* short) list of Nodes.  Table accesses require volatile/atomic
312	<	* reads, writes, and CASes.  Because there is no other way to
313	<	* arrange this without adding further indirections, we use
314	<	* intrinsics (sun.misc.Unsafe) operations.  The lists of nodes
315	<	* within bins are always accurately traversable under volatile
316	<	* reads, so long as lookups check hash code and non-nullness of
317	<	* key and value before checking key equality. (All valid hash
318	<	* codes are nonnegative. Negative values are reserved for special
319	<	* forwarding nodes; see below.)
320	<	*
321	<	* A bin may be locked during update (insert, delete, and replace)
322	<	* operations.  We do not want to waste the space required to
323	<	* associate a distinct lock object with each bin, so instead use
324	<	* the first node of a bin list itself as a lock, using builtin
325	<	* "synchronized" locks. These save space and we can live with
326	<	* only plain block-structured lock/unlock operations. Using the
327	<	* first node of a list as a lock does not by itself suffice
328	<	* though: When a node is locked, any update must first validate
329	<	* that it is still the first node, and retry if not. (Because new
330	<	* nodes are always appended to lists, once a node is first in a
331	<	* bin, it remains first until deleted or the bin becomes
332	<	* invalidated.)  However, update operations can and usually do
333	<	* still traverse the bin until the point of update, which helps
334	<	* reduce cache misses on retries.  This is a converse of sorts to
335	<	* the lazy locking technique described by Herlihy & Shavit. If
336	<	* there is no existing node during a put operation, then one can
337	<	* be CAS'ed in (without need for lock except in computeIfAbsent);
338	<	* the CAS serves as validation. This is on average the most
339	<	* common case for put operations. The expected number of locks
340	<	* covering different elements (i.e., bins with 2 or more nodes)
341	<	* is approximately 10% at steady state under default settings.
342	<	* Lock contention probability for two threads accessing arbitrary
343	<	* distinct elements is thus less than 1% even for small tables.
344	<	*
345	<	* The table is resized when occupancy exceeds a threshold.  Only
346	<	* a single thread performs the resize (using field "resizing", to
347	<	* arrange exclusion), but the table otherwise remains usable for
348	<	* both reads and updates. Resizing proceeds by transferring bins,
349	<	* one by one, from the table to the next table.  Upon transfer,
350	<	* the old table bin contains only a special forwarding node (with
351	<	* negative hash code ("MOVED")) that contains the next table as
352	<	* its key. On encountering a forwarding node, access and update
353	<	* operations restart, using the new table. To ensure concurrent
354	<	* readability of traversals, transfers must proceed from the last
355	<	* bin (table.length - 1) up towards the first.  Any traversal
356	<	* starting from the first bin can then arrange to move to the new
357	<	* table for the rest of the traversal without revisiting nodes.
358	<	* This constrains bin transfers to a particular order, and so can
359	<	* block indefinitely waiting for the next lock, and other threads
360	<	* cannot help with the transfer. However, expected stalls are
361	<	* infrequent enough to not warrant the additional overhead and
362	<	* complexity of access and iteration schemes that could admit
363	<	* out-of-order or concurrent bin transfers.
364	<	*
365	<	* A similar traversal scheme (not yet implemented) can apply to
366	<	* partial traversals during partitioned aggregate operations.
367	<	* Also, read-only operations give up if ever forwarded to a null
368	<	* table, which provides support for shutdown-style clearing,
369	<	* which is also not currently implemented.
370	<	*
371	<	* The element count is maintained using a LongAdder, which avoids
372	<	* contention on updates but can encounter cache thrashing if read
373	<	* too frequently during concurrent updates. To avoid reading so
374	<	* often, resizing is normally attempted only upon adding to a bin
375	<	* already holding two or more nodes. Under the default threshold
376	<	* (0.75), and uniform hash distributions, the probability of this
377	<	* occurring at threshold is around 13%, meaning that only about 1
378	<	* in 8 puts check threshold (and after resizing, many fewer do
379	<	* so). But this approximation has high variance for small table
380	<	* sizes, so we check on any collision for sizes <= 64.  Further,
381	<	* to increase the probablity that a resize occurs soon enough, we
382	<	* offset the threshold (see THRESHOLD_OFFSET) by the expected
383	<	* number of puts between checks. This is currently set to 8, in
384	<	* accord with the default load factor. In practice, this is
385	<	* rarely overridden, and in any case is close enough to other
386	<	* plausible values not to waste dynamic probablity computation
387	<	* for more precision.
310	>	* first insertion.  Each bin in the table normally contains a
311	>	* list of Nodes (most often, the list has only zero or one Node).
312	>	* Table accesses require volatile/atomic reads, writes, and
313	>	* CASes.  Because there is no other way to arrange this without
314	>	* adding further indirections, we use intrinsics
315	>	* (sun.misc.Unsafe) operations.  The lists of nodes within bins
316	>	* are always accurately traversable under volatile reads, so long
317	>	* as lookups check hash code and non-nullness of value before
318	>	* checking key equality.
319	>	*
320	>	* We use the top (sign) bit of Node hash fields for control
321	>	* purposes -- it is available anyway because of addressing
322	>	* constraints.  Nodes with negative hash fields are forwarding
323	>	* nodes to either TreeBins or resized tables.  The lower 31 bits
324	>	* of each normal Node's hash field contain a transformation of
325	>	* the key's hash code.
326	>	*
327	>	* Insertion (via put or its variants) of the first node in an
328	>	* empty bin is performed by just CASing it to the bin.  This is
329	>	* by far the most common case for put operations under most
330	>	* key/hash distributions.  Other update operations (insert,
331	>	* delete, and replace) require locks.  We do not want to waste
332	>	* the space required to associate a distinct lock object with
333	>	* each bin, so instead use the first node of a bin list itself as
334	>	* a lock. Locking support for these locks relies on builtin
335	>	* "synchronized" monitors.
336	>	*
337	>	* Using the first node of a list as a lock does not by itself
338	>	* suffice though: When a node is locked, any update must first
339	>	* validate that it is still the first node after locking it, and
340	>	* retry if not. Because new nodes are always appended to lists,
341	>	* once a node is first in a bin, it remains first until deleted
342	>	* or the bin becomes invalidated (upon resizing).  However,
343	>	* operations that only conditionally update may inspect nodes
344	>	* until the point of update. This is a converse of sorts to the
345	>	* lazy locking technique described by Herlihy & Shavit.
346	>	*
347	>	* The main disadvantage of per-bin locks is that other update
348	>	* operations on other nodes in a bin list protected by the same
349	>	* lock can stall, for example when user equals() or mapping
350	>	* functions take a long time.  However, statistically, under
351	>	* random hash codes, this is not a common problem.  Ideally, the
352	>	* frequency of nodes in bins follows a Poisson distribution
353	>	* (http://en.wikipedia.org/wiki/Poisson_distribution) with a
354	>	* parameter of about 0.5 on average, given the resizing threshold
355	>	* of 0.75, although with a large variance because of resizing
356	>	* granularity. Ignoring variance, the expected occurrences of
357	>	* list size k are (exp(-0.5) * pow(0.5, k) / factorial(k)). The
358	>	* first values are:
359	>	*
360	>	* 0:    0.60653066
361	>	* 1:    0.30326533
362	>	* 2:    0.07581633
363	>	* 3:    0.01263606
364	>	* 4:    0.00157952
365	>	* 5:    0.00015795
366	>	* 6:    0.00001316
367	>	* 7:    0.00000094
368	>	* 8:    0.00000006
369	>	* more: less than 1 in ten million
370	>	*
371	>	* Lock contention probability for two threads accessing distinct
372	>	* elements is roughly 1 / (8 * #elements) under random hashes.
373	>	*
374	>	* Actual hash code distributions encountered in practice
375	>	* sometimes deviate significantly from uniform randomness.  This
376	>	* includes the case when N > (1<<30), so some keys MUST collide.
377	>	* Similarly for dumb or hostile usages in which multiple keys are
378	>	* designed to have identical hash codes. Also, although we guard
379	>	* against the worst effects of this (see method spread), sets of
380	>	* hashes may differ only in bits that do not impact their bin
381	>	* index for a given power-of-two mask.  So we use a secondary
382	>	* strategy that applies when the number of nodes in a bin exceeds
383	>	* a threshold, and at least one of the keys implements
384	>	* Comparable.  These TreeBins use a balanced tree to hold nodes
385	>	* (a specialized form of red-black trees), bounding search time
386	>	* to O(log N).  Each search step in a TreeBin is around twice as
387	>	* slow as in a regular list, but given that N cannot exceed
388	>	* (1<<64) (before running out of addresses) this bounds search
389	>	* steps, lock hold times, etc, to reasonable constants (roughly
390	>	* 100 nodes inspected per operation worst case) so long as keys
391	>	* are Comparable (which is very common -- String, Long, etc).
392	>	* TreeBin nodes (TreeNodes) also maintain the same "next"
393	>	* traversal pointers as regular nodes, so can be traversed in
394	>	* iterators in the same way.
395	>	*
396	>	* The table is resized when occupancy exceeds a percentage
397	>	* threshold (nominally, 0.75, but see below).  Any thread
398	>	* noticing an overfull bin may assist in resizing after the
399	>	* initiating thread allocates and sets up the replacement
400	>	* array. However, rather than stalling, these other threads may
401	>	* proceed with insertions etc.  The use of TreeBins shields us
402	>	* from the worst case effects of overfilling while resizes are in
403	>	* progress.  Resizing proceeds by transferring bins, one by one,
404	>	* from the table to the next table. To enable concurrency, the
405	>	* next table must be (incrementally) prefilled with place-holders
406	>	* serving as reverse forwarders to the old table.  Because we are
407	>	* using power-of-two expansion, the elements from each bin must
408	>	* either stay at same index, or move with a power of two
409	>	* offset. We eliminate unnecessary node creation by catching
410	>	* cases where old nodes can be reused because their next fields
411	>	* won't change.  On average, only about one-sixth of them need
412	>	* cloning when a table doubles. The nodes they replace will be
413	>	* garbage collectable as soon as they are no longer referenced by
414	>	* any reader thread that may be in the midst of concurrently
415	>	* traversing table.  Upon transfer, the old table bin contains
416	>	* only a special forwarding node (with hash field "MOVED") that
417	>	* contains the next table as its key. On encountering a
418	>	* forwarding node, access and update operations restart, using
419	>	* the new table.
420	>	*
421	>	* Each bin transfer requires its bin lock, which can stall
422	>	* waiting for locks while resizing. However, because other
423	>	* threads can join in and help resize rather than contend for
424	>	* locks, average aggregate waits become shorter as resizing
425	>	* progresses.  The transfer operation must also ensure that all
426	>	* accessible bins in both the old and new table are usable by any
427	>	* traversal.  This is arranged by proceeding from the last bin
428	>	* (table.length - 1) up towards the first.  Upon seeing a
429	>	* forwarding node, traversals (see class Traverser) arrange to
430	>	* move to the new table without revisiting nodes.  However, to
431	>	* ensure that no intervening nodes are skipped, bin splitting can
432	>	* only begin after the associated reverse-forwarders are in
433	>	* place.
434	>	*
435	>	* The traversal scheme also applies to partial traversals of
436	>	* ranges of bins (via an alternate Traverser constructor)
437	>	* to support partitioned aggregate operations.  Also, read-only
438	>	* operations give up if ever forwarded to a null table, which
439	>	* provides support for shutdown-style clearing, which is also not
440	>	* currently implemented.
441	>	*
442	>	* Lazy table initialization minimizes footprint until first use,
443	>	* and also avoids resizings when the first operation is from a
444	>	* putAll, constructor with map argument, or deserialization.
445	>	* These cases attempt to override the initial capacity settings,
446	>	* but harmlessly fail to take effect in cases of races.
447	>	*
448	>	* The element count is maintained using a specialization of
449	>	* LongAdder. We need to incorporate a specialization rather than
450	>	* just use a LongAdder in order to access implicit
451	>	* contention-sensing that leads to creation of multiple
452	>	* CounterCells.  The counter mechanics avoid contention on
453	>	* updates but can encounter cache thrashing if read too
454	>	* frequently during concurrent access. To avoid reading so often,
455	>	* resizing under contention is attempted only upon adding to a
456	>	* bin already holding two or more nodes. Under uniform hash
457	>	* distributions, the probability of this occurring at threshold
458	>	* is around 13%, meaning that only about 1 in 8 puts check
459	>	* threshold (and after resizing, many fewer do so). The bulk
460	>	* putAll operation further reduces contention by only committing
461	>	* count updates upon these size checks.
462	>	*
463	>	* Maintaining API and serialization compatibility with previous
464	>	* versions of this class introduces several oddities. Mainly: We
465	>	* leave untouched but unused constructor arguments refering to
466	>	* concurrencyLevel. We accept a loadFactor constructor argument,
467	>	* but apply it only to initial table capacity (which is the only
468	>	* time that we can guarantee to honor it.) We also declare an
469	>	* unused "Segment" class that is instantiated in minimal form
470	>	* only when serializing.
471		*/
472
473		/* ---------------- Constants -------------- */
474
475		/**
476	<	* The smallest allowed table capacity.  Must be a power of 2, at
477	<	* least 2.
476	>	* The largest possible table capacity.  This value must be
477	>	* exactly 1<<30 to stay within Java array allocation and indexing
478	>	* bounds for power of two table sizes, and is further required
479	>	* because the top two bits of 32bit hash fields are used for
480	>	* control purposes.
481		*/
482	<	static final int MINIMUM_CAPACITY = 2;
482	>	private static final int MAXIMUM_CAPACITY = 1 << 30;
483
484		/**
485	<	* The largest allowed table capacity.  Must be a power of 2, at
486	<	* most 1<<30.
485	>	* The default initial table capacity.  Must be a power of 2
486	>	* (i.e., at least 1) and at most MAXIMUM_CAPACITY.
487		*/
488	<	static final int MAXIMUM_CAPACITY = 1 << 30;
488	>	private static final int DEFAULT_CAPACITY = 16;
489
490		/**
491	<	* The default initial table capacity.  Must be a power of 2, at
492	<	* least MINIMUM_CAPACITY and at most MAXIMUM_CAPACITY
491	>	* The largest possible (non-power of two) array size.
492	>	* Needed by toArray and related methods.
493		*/
494	<	static final int DEFAULT_CAPACITY = 16;
494	>	static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
495
496		/**
497	<	* The default load factor for this table, used when not otherwise
498	<	* specified in a constructor.
497	>	* The default concurrency level for this table. Unused but
498	>	* defined for compatibility with previous versions of this class.
499		*/
500	<	static final float DEFAULT_LOAD_FACTOR = 0.75f;
500	>	private static final int DEFAULT_CONCURRENCY_LEVEL = 16;
501
502		/**
503	<	* The default concurrency level for this table. Unused, but
504	<	* defined for compatibility with previous versions of this class.
503	>	* The load factor for this table. Overrides of this value in
504	>	* constructors affect only the initial table capacity.  The
505	>	* actual floating point value isn't normally used -- it is
506	>	* simpler to use expressions such as {@code n - (n >>> 2)} for
507	>	* the associated resizing threshold.
508	>	*/
509	>	private static final float LOAD_FACTOR = 0.75f;
510	>
511	>	/**
512	>	* The bin count threshold for using a tree rather than list for a
513	>	* bin.  The value reflects the approximate break-even point for
514	>	* using tree-based operations.
515	>	*/
516	>	private static final int TREE_THRESHOLD = 8;
517	>
518	>	/**
519	>	* Minimum number of rebinnings per transfer step. Ranges are
520	>	* subdivided to allow multiple resizer threads.  This value
521	>	* serves as a lower bound to avoid resizers encountering
522	>	* excessive memory contention.  The value should be at least
523	>	* DEFAULT_CAPACITY.
524	>	*/
525	>	private static final int MIN_TRANSFER_STRIDE = 16;
526	>
527	>	/*
528	>	* Encodings for Node hash fields. See above for explanation.
529		*/
530	<	static final int DEFAULT_CONCURRENCY_LEVEL = 16;
530	>	static final int MOVED     = 0x80000000; // hash field for forwarding nodes
531	>	static final int HASH_BITS = 0x7fffffff; // usable bits of normal node hash
532	>
533	>	/** Number of CPUS, to place bounds on some sizings */
534	>	static final int NCPU = Runtime.getRuntime().availableProcessors();
535	>
536	>	/* ---------------- Counters -------------- */
537	>
538	>	// Adapted from LongAdder and Striped64.
539	>	// See their internal docs for explanation.
540	>
541	>	// A padded cell for distributing counts
542	>	static final class CounterCell {
543	>	volatile long p0, p1, p2, p3, p4, p5, p6;
544	>	volatile long value;
545	>	volatile long q0, q1, q2, q3, q4, q5, q6;
546	>	CounterCell(long x) { value = x; }
547	>	}
548
549		/**
550	<	* The count value to offset thesholds to compensate for checking
551	<	* for resizing only when inserting into bins with two or more
552	<	* elements. See above for explanation.
550	>	* Holder for the thread-local hash code determining which
551	>	* CounterCell to use. The code is initialized via the
552	>	* counterHashCodeGenerator, but may be moved upon collisions.
553		*/
554	<	static final int THRESHOLD_OFFSET = 8;
554	>	static final class CounterHashCode {
555	>	int code;
556	>	}
557
558		/**
559	<	* Special node hash value indicating to use table in node.key
241	<	* Must be negative.
559	>	* Generates initial value for per-thread CounterHashCodes
560		*/
561	<	static final int MOVED = -1;
561	>	static final AtomicInteger counterHashCodeGenerator = new AtomicInteger();
562	>
563	>	/**
564	>	* Increment for counterHashCodeGenerator. See class ThreadLocal
565	>	* for explanation.
566	>	*/
567	>	static final int SEED_INCREMENT = 0x61c88647;
568	>
569	>	/**
570	>	* Per-thread counter hash codes. Shared across all instances
571	>	*/
572	>	static final ThreadLocal<CounterHashCode> threadCounterHashCode =
573	>	new ThreadLocal<CounterHashCode>();
574
575		/* ---------------- Fields -------------- */
576
577		/**
578		* The array of bins. Lazily initialized upon first insertion.
579	<	* Size is always a power of two. Accessed directly by inner
250	<	* classes.
579	>	* Size is always a power of two. Accessed directly by iterators.
580		*/
581	<	transient volatile Node[] table;
581	>	transient volatile Node<V>[] table;
582
583	<	/** The counter maintaining number of elements. */
584	<	private transient final LongAdder counter;
585	<	/** Nonzero when table is being initialized or resized. Updated via CAS. */
586	<	private transient volatile int resizing;
258	<	/** The target load factor for the table. */
259	<	private transient float loadFactor;
260	<	/** The next element count value upon which to resize the table. */
261	<	private transient int threshold;
262	<	/** The initial capacity of the table. */
263	<	private transient int initCap;
583	>	/**
584	>	* The next table to use; non-null only while resizing.
585	>	*/
586	>	private transient volatile Node<V>[] nextTable;
587
588	<	// views
589	<	transient Set<K> keySet;
590	<	transient Set<Map.Entry<K,V>> entrySet;
591	<	transient Collection<V> values;
592	<
593	<	/** For serialization compatability. Null unless serialized; see below */
271	<	Segment<K,V>[] segments;
588	>	/**
589	>	* Base counter value, used mainly when there is no contention,
590	>	* but also as a fallback during table initialization
591	>	* races. Updated via CAS.
592	>	*/
593	>	private transient volatile long baseCount;
594
595		/**
596	<	* Applies a supplemental hash function to a given hashCode, which
597	<	* defends against poor quality hash functions.  The result must
598	<	* be non-negative, and for reasonable performance must have good
599	<	* avalanche properties; i.e., that each bit of the argument
600	<	* affects each bit (except sign bit) of the result.
596	>	* Table initialization and resizing control.  When negative, the
597	>	* table is being initialized or resized: -1 for initialization,
598	>	* else -(1 + the number of active resizing threads).  Otherwise,
599	>	* when table is null, holds the initial table size to use upon
600	>	* creation, or 0 for default. After initialization, holds the
601	>	* next element count value upon which to resize the table.
602		*/
603	<	private static final int spread(int h) {
604	<	// Apply base step of MurmurHash; see http://code.google.com/p/smhasher/
605	<	h ^= h >>> 16;
606	<	h *= 0x85ebca6b;
607	<	h ^= h >>> 13;
608	<	h *= 0xc2b2ae35;
609	<	return (h >>> 16) ^ (h & 0x7fffffff); // mask out sign bit
603	>	private transient volatile int sizeCtl;
604	>
605	>	/**
606	>	* The next table index (plus one) to split while resizing.
607	>	*/
608	>	private transient volatile int transferIndex;
609	>
610	>	/**
611	>	* The least available table index to split while resizing.
612	>	*/
613	>	private transient volatile int transferOrigin;
614	>
615	>	/**
616	>	* Spinlock (locked via CAS) used when resizing and/or creating Cells.
617	>	*/
618	>	private transient volatile int counterBusy;
619	>
620	>	/**
621	>	* Table of counter cells. When non-null, size is a power of 2.
622	>	*/
623	>	private transient volatile CounterCell[] counterCells;
624	>
625	>	// views
626	>	private transient KeySetView<K,V> keySet;
627	>	private transient ValuesView<K,V> values;
628	>	private transient EntrySetView<K,V> entrySet;
629	>
630	>	/** For serialization compatibility. Null unless serialized; see below */
631	>	private Segment<K,V>[] segments;
632	>
633	>	/* ---------------- Table element access -------------- */
634	>
635	>	/*
636	>	* Volatile access methods are used for table elements as well as
637	>	* elements of in-progress next table while resizing.  Uses are
638	>	* null checked by callers, and implicitly bounds-checked, relying
639	>	* on the invariants that tab arrays have non-zero size, and all
640	>	* indices are masked with (tab.length - 1) which is never
641	>	* negative and always less than length. Note that, to be correct
642	>	* wrt arbitrary concurrency errors by users, bounds checks must
643	>	* operate on local variables, which accounts for some odd-looking
644	>	* inline assignments below.
645	>	*/
646	>
647	>	@SuppressWarnings("unchecked") static final <V> Node<V> tabAt
648	>	(Node<V>[] tab, int i) { // used by Traverser
649	>	return (Node<V>)U.getObjectVolatile(tab, ((long)i << ASHIFT) + ABASE);
650	>	}
651	>
652	>	private static final <V> boolean casTabAt
653	>	(Node<V>[] tab, int i, Node<V> c, Node<V> v) {
654	>	return U.compareAndSwapObject(tab, ((long)i << ASHIFT) + ABASE, c, v);
655		}
656
657	+	private static final <V> void setTabAt
658	+	(Node<V>[] tab, int i, Node<V> v) {
659	+	U.putObjectVolatile(tab, ((long)i << ASHIFT) + ABASE, v);
660	+	}
661	+
662	+	/* ---------------- Nodes -------------- */
663	+
664		/**
665		* Key-value entry. Note that this is never exported out as a
666	<	* user-visible Map.Entry.
666	>	* user-visible Map.Entry (see MapEntry below). Nodes with a hash
667	>	* field of MOVED are special, and do not contain user keys or
668	>	* values.  Otherwise, keys are never null, and null val fields
669	>	* indicate that a node is in the process of being deleted or
670	>	* created. For purposes of read-only access, a key may be read
671	>	* before a val, but can only be used after checking val to be
672	>	* non-null.
673		*/
674	<	static final class Node {
674	>	static class Node<V> {
675		final int hash;
676		final Object key;
677	<	volatile Object val;
678	<	volatile Node next;
677	>	volatile V val;
678	>	volatile Node<V> next;
679
680	<	Node(int hash, Object key, Object val, Node next) {
680	>	Node(int hash, Object key, V val, Node<V> next) {
681		this.hash = hash;
682		this.key = key;
683		this.val = val;
#	Line 304 | Line 685 | public class ConcurrentHashMapV8<K, V>
685		}
686		}
687
688	<	/*
308	<	* Volatile access nethods are used for table elements as well as
309	<	* elements of in-progress next table while resizing.  Uses in
310	<	* access and update methods are null checked by callers, and
311	<	* implicitly bounds-checked, relying on the invariants that tab
312	<	* arrays have non-zero size, and all indices are masked with
313	<	* (tab.length - 1) which is never negative and always less than
314	<	* length. The "relaxed" non-volatile forms are used only during
315	<	* table initialization. The only other usage is in
316	<	* HashIterator.advance, which performs explicit checks.
317	<	*/
688	>	/* ---------------- TreeBins -------------- */
689
690	<	static final Node tabAt(Node[] tab, int i) { // used in HashIterator
691	<	return (Node)UNSAFE.getObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE);
690	>	/**
691	>	* Nodes for use in TreeBins
692	>	*/
693	>	static final class TreeNode<V> extends Node<V> {
694	>	TreeNode<V> parent;  // red-black tree links
695	>	TreeNode<V> left;
696	>	TreeNode<V> right;
697	>	TreeNode<V> prev;    // needed to unlink next upon deletion
698	>	boolean red;
699	>
700	>	TreeNode(int hash, Object key, V val, Node<V> next, TreeNode<V> parent) {
701	>	super(hash, key, val, next);
702	>	this.parent = parent;
703	>	}
704		}
705
706	<	private static final boolean casTabAt(Node[] tab, int i, Node c, Node v) {
707	<	return UNSAFE.compareAndSwapObject(tab, ((long)i<<ASHIFT)+ABASE, c, v);
708	<	}
706	>	/**
707	>	* A specialized form of red-black tree for use in bins
708	>	* whose size exceeds a threshold.
709	>	*
710	>	* TreeBins use a special form of comparison for search and
711	>	* related operations (which is the main reason we cannot use
712	>	* existing collections such as TreeMaps). TreeBins contain
713	>	* Comparable elements, but may contain others, as well as
714	>	* elements that are Comparable but not necessarily Comparable<T>
715	>	* for the same T, so we cannot invoke compareTo among them. To
716	>	* handle this, the tree is ordered primarily by hash value, then
717	>	* by getClass().getName() order, and then by Comparator order
718	>	* among elements of the same class.  On lookup at a node, if
719	>	* elements are not comparable or compare as 0, both left and
720	>	* right children may need to be searched in the case of tied hash
721	>	* values. (This corresponds to the full list search that would be
722	>	* necessary if all elements were non-Comparable and had tied
723	>	* hashes.)  The red-black balancing code is updated from
724	>	* pre-jdk-collections
725	>	* (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
726	>	* based in turn on Cormen, Leiserson, and Rivest "Introduction to
727	>	* Algorithms" (CLR).
728	>	*
729	>	* TreeBins also maintain a separate locking discipline than
730	>	* regular bins. Because they are forwarded via special MOVED
731	>	* nodes at bin heads (which can never change once established),
732	>	* we cannot use those nodes as locks. Instead, TreeBin
733	>	* extends AbstractQueuedSynchronizer to support a simple form of
734	>	* read-write lock. For update operations and table validation,
735	>	* the exclusive form of lock behaves in the same way as bin-head
736	>	* locks. However, lookups use shared read-lock mechanics to allow
737	>	* multiple readers in the absence of writers.  Additionally,
738	>	* these lookups do not ever block: While the lock is not
739	>	* available, they proceed along the slow traversal path (via
740	>	* next-pointers) until the lock becomes available or the list is
741	>	* exhausted, whichever comes first. (These cases are not fast,
742	>	* but maximize aggregate expected throughput.)  The AQS mechanics
743	>	* for doing this are straightforward.  The lock state is held as
744	>	* AQS getState().  Read counts are negative; the write count (1)
745	>	* is positive.  There are no signalling preferences among readers
746	>	* and writers. Since we don't need to export full Lock API, we
747	>	* just override the minimal AQS methods and use them directly.
748	>	*/
749	>	static final class TreeBin<V> extends AbstractQueuedSynchronizer {
750	>	private static final long serialVersionUID = 2249069246763182397L;
751	>	transient TreeNode<V> root;  // root of tree
752	>	transient TreeNode<V> first; // head of next-pointer list
753
754	<	private static final void setTabAt(Node[] tab, int i, Node v) {
755	<	UNSAFE.putObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE, v);
756	<	}
754	>	/* AQS overrides */
755	>	public final boolean isHeldExclusively() { return getState() > 0; }
756	>	public final boolean tryAcquire(int ignore) {
757	>	if (compareAndSetState(0, 1)) {
758	>	setExclusiveOwnerThread(Thread.currentThread());
759	>	return true;
760	>	}
761	>	return false;
762	>	}
763	>	public final boolean tryRelease(int ignore) {
764	>	setExclusiveOwnerThread(null);
765	>	setState(0);
766	>	return true;
767	>	}
768	>	public final int tryAcquireShared(int ignore) {
769	>	for (int c;;) {
770	>	if ((c = getState()) > 0)
771	>	return -1;
772	>	if (compareAndSetState(c, c -1))
773	>	return 1;
774	>	}
775	>	}
776	>	public final boolean tryReleaseShared(int ignore) {
777	>	int c;
778	>	do {} while (!compareAndSetState(c = getState(), c + 1));
779	>	return c == -1;
780	>	}
781	>
782	>	/** From CLR */
783	>	private void rotateLeft(TreeNode<V> p) {
784	>	if (p != null) {
785	>	TreeNode<V> r = p.right, pp, rl;
786	>	if ((rl = p.right = r.left) != null)
787	>	rl.parent = p;
788	>	if ((pp = r.parent = p.parent) == null)
789	>	root = r;
790	>	else if (pp.left == p)
791	>	pp.left = r;
792	>	else
793	>	pp.right = r;
794	>	r.left = p;
795	>	p.parent = r;
796	>	}
797	>	}
798
799	<	private static final Node relaxedTabAt(Node[] tab, int i) {
800	<	return (Node)UNSAFE.getObject(tab, ((long)i<<ASHIFT)+ABASE);
801	<	}
799	>	/** From CLR */
800	>	private void rotateRight(TreeNode<V> p) {
801	>	if (p != null) {
802	>	TreeNode<V> l = p.left, pp, lr;
803	>	if ((lr = p.left = l.right) != null)
804	>	lr.parent = p;
805	>	if ((pp = l.parent = p.parent) == null)
806	>	root = l;
807	>	else if (pp.right == p)
808	>	pp.right = l;
809	>	else
810	>	pp.left = l;
811	>	l.right = p;
812	>	p.parent = l;
813	>	}
814	>	}
815
816	<	private static final void relaxedSetTabAt(Node[] tab, int i, Node v) {
817	<	UNSAFE.putObject(tab, ((long)i<<ASHIFT)+ABASE, v);
818	<	}
816	>	/**
817	>	* Returns the TreeNode (or null if not found) for the given key
818	>	* starting at given root.
819	>	*/
820	>	@SuppressWarnings("unchecked") final TreeNode<V> getTreeNode
821	>	(int h, Object k, TreeNode<V> p) {
822	>	Class<?> c = k.getClass();
823	>	while (p != null) {
824	>	int dir, ph;  Object pk; Class<?> pc;
825	>	if ((ph = p.hash) == h) {
826	>	if ((pk = p.key) == k || k.equals(pk))
827	>	return p;
828	>	if (c != (pc = pk.getClass()) ||
829	>	!(k instanceof Comparable) ||
830	>	(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
831	>	if ((dir = (c == pc) ? 0 :
832	>	c.getName().compareTo(pc.getName())) == 0) {
833	>	TreeNode<V> r = null, pl, pr; // check both sides
834	>	if ((pr = p.right) != null && h >= pr.hash &&
835	>	(r = getTreeNode(h, k, pr)) != null)
836	>	return r;
837	>	else if ((pl = p.left) != null && h <= pl.hash)
838	>	dir = -1;
839	>	else // nothing there
840	>	return null;
841	>	}
842	>	}
843	>	}
844	>	else
845	>	dir = (h < ph) ? -1 : 1;
846	>	p = (dir > 0) ? p.right : p.left;
847	>	}
848	>	return null;
849	>	}
850
851	<	/* ---------------- Access and update operations -------------- */
851	>	/**
852	>	* Wrapper for getTreeNode used by CHM.get. Tries to obtain
853	>	* read-lock to call getTreeNode, but during failure to get
854	>	* lock, searches along next links.
855	>	*/
856	>	final V getValue(int h, Object k) {
857	>	Node<V> r = null;
858	>	int c = getState(); // Must read lock state first
859	>	for (Node<V> e = first; e != null; e = e.next) {
860	>	if (c <= 0 && compareAndSetState(c, c - 1)) {
861	>	try {
862	>	r = getTreeNode(h, k, root);
863	>	} finally {
864	>	releaseShared(0);
865	>	}
866	>	break;
867	>	}
868	>	else if (e.hash == h && k.equals(e.key)) {
869	>	r = e;
870	>	break;
871	>	}
872	>	else
873	>	c = getState();
874	>	}
875	>	return r == null ? null : r.val;
876	>	}
877
878	<	/** Implementation for get and containsKey **/
879	<	private final Object internalGet(Object k) {
880	<	int h = spread(k.hashCode());
881	<	Node[] tab = table;
882	<	retry: while (tab != null) {
883	<	Node e = tabAt(tab, (tab.length - 1) & h);
884	<	while (e != null) {
885	<	int eh = e.hash;
886	<	if (eh == h) {
887	<	Object ek = e.key, ev = e.val;
888	<	if (ev != null && ek != null && (k == ek || k.equals(ek)))
889	<	return ev;
878	>	/**
879	>	* Finds or adds a node.
880	>	* @return null if added
881	>	*/
882	>	@SuppressWarnings("unchecked") final TreeNode<V> putTreeNode
883	>	(int h, Object k, V v) {
884	>	Class<?> c = k.getClass();
885	>	TreeNode<V> pp = root, p = null;
886	>	int dir = 0;
887	>	while (pp != null) { // find existing node or leaf to insert at
888	>	int ph;  Object pk; Class<?> pc;
889	>	p = pp;
890	>	if ((ph = p.hash) == h) {
891	>	if ((pk = p.key) == k || k.equals(pk))
892	>	return p;
893	>	if (c != (pc = pk.getClass()) ||
894	>	!(k instanceof Comparable) ||
895	>	(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
896	>	TreeNode<V> s = null, r = null, pr;
897	>	if ((dir = (c == pc) ? 0 :
898	>	c.getName().compareTo(pc.getName())) == 0) {
899	>	if ((pr = p.right) != null && h >= pr.hash &&
900	>	(r = getTreeNode(h, k, pr)) != null)
901	>	return r;
902	>	else // continue left
903	>	dir = -1;
904	>	}
905	>	else if ((pr = p.right) != null && h >= pr.hash)
906	>	s = pr;
907	>	if (s != null && (r = getTreeNode(h, k, s)) != null)
908	>	return r;
909	>	}
910		}
911	<	else if (eh < 0) { // bin was moved during resize
912	<	tab = (Node[])e.key;
913	<	continue retry;
911	>	else
912	>	dir = (h < ph) ? -1 : 1;
913	>	pp = (dir > 0) ? p.right : p.left;
914	>	}
915	>
916	>	TreeNode<V> f = first;
917	>	TreeNode<V> x = first = new TreeNode<V>(h, k, v, f, p);
918	>	if (p == null)
919	>	root = x;
920	>	else { // attach and rebalance; adapted from CLR
921	>	TreeNode<V> xp, xpp;
922	>	if (f != null)
923	>	f.prev = x;
924	>	if (dir <= 0)
925	>	p.left = x;
926	>	else
927	>	p.right = x;
928	>	x.red = true;
929	>	while (x != null && (xp = x.parent) != null && xp.red &&
930	>	(xpp = xp.parent) != null) {
931	>	TreeNode<V> xppl = xpp.left;
932	>	if (xp == xppl) {
933	>	TreeNode<V> y = xpp.right;
934	>	if (y != null && y.red) {
935	>	y.red = false;
936	>	xp.red = false;
937	>	xpp.red = true;
938	>	x = xpp;
939	>	}
940	>	else {
941	>	if (x == xp.right) {
942	>	rotateLeft(x = xp);
943	>	xpp = (xp = x.parent) == null ? null : xp.parent;
944	>	}
945	>	if (xp != null) {
946	>	xp.red = false;
947	>	if (xpp != null) {
948	>	xpp.red = true;
949	>	rotateRight(xpp);
950	>	}
951	>	}
952	>	}
953	>	}
954	>	else {
955	>	TreeNode<V> y = xppl;
956	>	if (y != null && y.red) {
957	>	y.red = false;
958	>	xp.red = false;
959	>	xpp.red = true;
960	>	x = xpp;
961	>	}
962	>	else {
963	>	if (x == xp.left) {
964	>	rotateRight(x = xp);
965	>	xpp = (xp = x.parent) == null ? null : xp.parent;
966	>	}
967	>	if (xp != null) {
968	>	xp.red = false;
969	>	if (xpp != null) {
970	>	xpp.red = true;
971	>	rotateLeft(xpp);
972	>	}
973	>	}
974	>	}
975	>	}
976		}
977	<	e = e.next;
977	>	TreeNode<V> r = root;
978	>	if (r != null && r.red)
979	>	r.red = false;
980		}
981	<	break;
981	>	return null;
982		}
362	–	return null;
363	–	}
983
984	<	/** Implementation for put and putIfAbsent **/
985	<	private final Object internalPut(Object k, Object v, boolean replace) {
986	<	int h = spread(k.hashCode());
987	<	Object oldVal = null;  // the previous value or null if none
988	<	Node[] tab = table;
989	<	for (;;) {
990	<	Node e; int i;
991	<	if (tab == null)
992	<	tab = grow(0);
993	<	else if ((e = tabAt(tab, i = (tab.length - 1) & h)) == null) {
994	<	if (casTabAt(tab, i, null, new Node(h, k, v, null)))
995	<	break;
984	>	/**
985	>	* Removes the given node, that must be present before this
986	>	* call.  This is messier than typical red-black deletion code
987	>	* because we cannot swap the contents of an interior node
988	>	* with a leaf successor that is pinned by "next" pointers
989	>	* that are accessible independently of lock. So instead we
990	>	* swap the tree linkages.
991	>	*/
992	>	final void deleteTreeNode(TreeNode<V> p) {
993	>	TreeNode<V> next = (TreeNode<V>)p.next; // unlink traversal pointers
994	>	TreeNode<V> pred = p.prev;
995	>	if (pred == null)
996	>	first = next;
997	>	else
998	>	pred.next = next;
999	>	if (next != null)
1000	>	next.prev = pred;
1001	>	TreeNode<V> replacement;
1002	>	TreeNode<V> pl = p.left;
1003	>	TreeNode<V> pr = p.right;
1004	>	if (pl != null && pr != null) {
1005	>	TreeNode<V> s = pr, sl;
1006	>	while ((sl = s.left) != null) // find successor
1007	>	s = sl;
1008	>	boolean c = s.red; s.red = p.red; p.red = c; // swap colors
1009	>	TreeNode<V> sr = s.right;
1010	>	TreeNode<V> pp = p.parent;
1011	>	if (s == pr) { // p was s's direct parent
1012	>	p.parent = s;
1013	>	s.right = p;
1014	>	}
1015	>	else {
1016	>	TreeNode<V> sp = s.parent;
1017	>	if ((p.parent = sp) != null) {
1018	>	if (s == sp.left)
1019	>	sp.left = p;
1020	>	else
1021	>	sp.right = p;
1022	>	}
1023	>	if ((s.right = pr) != null)
1024	>	pr.parent = s;
1025	>	}
1026	>	p.left = null;
1027	>	if ((p.right = sr) != null)
1028	>	sr.parent = p;
1029	>	if ((s.left = pl) != null)
1030	>	pl.parent = s;
1031	>	if ((s.parent = pp) == null)
1032	>	root = s;
1033	>	else if (p == pp.left)
1034	>	pp.left = s;
1035	>	else
1036	>	pp.right = s;
1037	>	replacement = sr;
1038	>	}
1039	>	else
1040	>	replacement = (pl != null) ? pl : pr;
1041	>	TreeNode<V> pp = p.parent;
1042	>	if (replacement == null) {
1043	>	if (pp == null) {
1044	>	root = null;
1045	>	return;
1046	>	}
1047	>	replacement = p;
1048		}
378	–	else if (e.hash < 0)
379	–	tab = (Node[])e.key;
1049		else {
1050	<	boolean validated = false;
1051	<	boolean checkSize = false;
1052	<	synchronized(e) {
1053	<	Node first = e;
1054	<	for (;;) {
1055	<	Object ek, ev;
1056	<	if ((ev = e.val) == null)
1057	<	break;
1058	<	if (e.hash == h && (ek = e.key) != null &&
1059	<	(k == ek || k.equals(ek))) {
1060	<	if (tabAt(tab, i) == first) {
1061	<	validated = true;
1062	<	oldVal = ev;
1063	<	if (replace)
1064	<	e.val = v;
1050	>	replacement.parent = pp;
1051	>	if (pp == null)
1052	>	root = replacement;
1053	>	else if (p == pp.left)
1054	>	pp.left = replacement;
1055	>	else
1056	>	pp.right = replacement;
1057	>	p.left = p.right = p.parent = null;
1058	>	}
1059	>	if (!p.red) { // rebalance, from CLR
1060	>	TreeNode<V> x = replacement;
1061	>	while (x != null) {
1062	>	TreeNode<V> xp, xpl;
1063	>	if (x.red || (xp = x.parent) == null) {
1064	>	x.red = false;
1065	>	break;
1066	>	}
1067	>	if (x == (xpl = xp.left)) {
1068	>	TreeNode<V> sib = xp.right;
1069	>	if (sib != null && sib.red) {
1070	>	sib.red = false;
1071	>	xp.red = true;
1072	>	rotateLeft(xp);
1073	>	sib = (xp = x.parent) == null ? null : xp.right;
1074	>	}
1075	>	if (sib == null)
1076	>	x = xp;
1077	>	else {
1078	>	TreeNode<V> sl = sib.left, sr = sib.right;
1079	>	if ((sr == null || !sr.red) &&
1080	>	(sl == null || !sl.red)) {
1081	>	sib.red = true;
1082	>	x = xp;
1083	>	}
1084	>	else {
1085	>	if (sr == null || !sr.red) {
1086	>	if (sl != null)
1087	>	sl.red = false;
1088	>	sib.red = true;
1089	>	rotateRight(sib);
1090	>	sib = (xp = x.parent) == null ?
1091	>	null : xp.right;
1092	>	}
1093	>	if (sib != null) {
1094	>	sib.red = (xp == null) ? false : xp.red;
1095	>	if ((sr = sib.right) != null)
1096	>	sr.red = false;
1097	>	}
1098	>	if (xp != null) {
1099	>	xp.red = false;
1100	>	rotateLeft(xp);
1101	>	}
1102	>	x = root;
1103		}
397	–	break;
1104		}
1105	<	Node last = e;
1106	<	if ((e = e.next) == null) {
1107	<	if (tabAt(tab, i) == first) {
1108	<	validated = true;
1109	<	last.next = new Node(h, k, v, null);
1110	<	if (last != first || tab.length <= 64)
1111	<	checkSize = true;
1105	>	}
1106	>	else { // symmetric
1107	>	TreeNode<V> sib = xpl;
1108	>	if (sib != null && sib.red) {
1109	>	sib.red = false;
1110	>	xp.red = true;
1111	>	rotateRight(xp);
1112	>	sib = (xp = x.parent) == null ? null : xp.left;
1113	>	}
1114	>	if (sib == null)
1115	>	x = xp;
1116	>	else {
1117	>	TreeNode<V> sl = sib.left, sr = sib.right;
1118	>	if ((sl == null || !sl.red) &&
1119	>	(sr == null || !sr.red)) {
1120	>	sib.red = true;
1121	>	x = xp;
1122	>	}
1123	>	else {
1124	>	if (sl == null || !sl.red) {
1125	>	if (sr != null)
1126	>	sr.red = false;
1127	>	sib.red = true;
1128	>	rotateLeft(sib);
1129	>	sib = (xp = x.parent) == null ?
1130	>	null : xp.left;
1131	>	}
1132	>	if (sib != null) {
1133	>	sib.red = (xp == null) ? false : xp.red;
1134	>	if ((sl = sib.left) != null)
1135	>	sl.red = false;
1136	>	}
1137	>	if (xp != null) {
1138	>	xp.red = false;
1139	>	rotateRight(xp);
1140	>	}
1141	>	x = root;
1142		}
407	–	break;
1143		}
1144		}
1145		}
1146	<	if (validated) {
1147	<	if (checkSize && tab.length < MAXIMUM_CAPACITY &&
1148	<	resizing == 0 && counter.sum() >= threshold)
1149	<	grow(0);
1150	<	break;
1146	>	}
1147	>	if (p == replacement && (pp = p.parent) != null) {
1148	>	if (p == pp.left) // detach pointers
1149	>	pp.left = null;
1150	>	else if (p == pp.right)
1151	>	pp.right = null;
1152	>	p.parent = null;
1153	>	}
1154	>	}
1155	>	}
1156	>
1157	>	/* ---------------- Collision reduction methods -------------- */
1158	>
1159	>	/**
1160	>	* Spreads higher bits to lower, and also forces top bit to 0.
1161	>	* Because the table uses power-of-two masking, sets of hashes
1162	>	* that vary only in bits above the current mask will always
1163	>	* collide. (Among known examples are sets of Float keys holding
1164	>	* consecutive whole numbers in small tables.)  To counter this,
1165	>	* we apply a transform that spreads the impact of higher bits
1166	>	* downward. There is a tradeoff between speed, utility, and
1167	>	* quality of bit-spreading. Because many common sets of hashes
1168	>	* are already reasonably distributed across bits (so don't benefit
1169	>	* from spreading), and because we use trees to handle large sets
1170	>	* of collisions in bins, we don't need excessively high quality.
1171	>	*/
1172	>	private static final int spread(int h) {
1173	>	h ^= (h >>> 18) ^ (h >>> 12);
1174	>	return (h ^ (h >>> 10)) & HASH_BITS;
1175	>	}
1176	>
1177	>	/**
1178	>	* Replaces a list bin with a tree bin if key is comparable.  Call
1179	>	* only when locked.
1180	>	*/
1181	>	private final void replaceWithTreeBin(Node<V>[] tab, int index, Object key) {
1182	>	if (key instanceof Comparable) {
1183	>	TreeBin<V> t = new TreeBin<V>();
1184	>	for (Node<V> e = tabAt(tab, index); e != null; e = e.next)
1185	>	t.putTreeNode(e.hash, e.key, e.val);
1186	>	setTabAt(tab, index, new Node<V>(MOVED, t, null, null));
1187	>	}
1188	>	}
1189	>
1190	>	/* ---------------- Internal access and update methods -------------- */
1191	>
1192	>	/** Implementation for get and containsKey */
1193	>	@SuppressWarnings("unchecked") private final V internalGet(Object k) {
1194	>	int h = spread(k.hashCode());
1195	>	retry: for (Node<V>[] tab = table; tab != null;) {
1196	>	Node<V> e; Object ek; V ev; int eh; // locals to read fields once
1197	>	for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) {
1198	>	if ((eh = e.hash) < 0) {
1199	>	if ((ek = e.key) instanceof TreeBin)  // search TreeBin
1200	>	return ((TreeBin<V>)ek).getValue(h, k);
1201	>	else {                      // restart with new table
1202	>	tab = (Node<V>[])ek;
1203	>	continue retry;
1204	>	}
1205		}
1206	+	else if (eh == h && (ev = e.val) != null &&
1207	+	((ek = e.key) == k || k.equals(ek)))
1208	+	return ev;
1209		}
1210	+	break;
1211		}
1212	<	if (oldVal == null)
420	<	counter.increment();
421	<	return oldVal;
1212	>	return null;
1213		}
1214
1215		/**
1216	<	* Covers the four public remove/replace methods: Replaces node
1217	<	* value with v, conditional upon match of cv if non-null.  If
1218	<	* resulting value is null, delete.
1216	>	* Implementation for the four public remove/replace methods:
1217	>	* Replaces node value with v, conditional upon match of cv if
1218	>	* non-null.  If resulting value is null, delete.
1219		*/
1220	<	private final Object internalReplace(Object k, Object v, Object cv) {
1220	>	@SuppressWarnings("unchecked") private final V internalReplace
1221	>	(Object k, V v, Object cv) {
1222		int h = spread(k.hashCode());
1223	<	Object oldVal = null;
1224	<	Node e; int i;
1225	<	Node[] tab = table;
1226	<	while (tab != null &&
1227	<	(e = tabAt(tab, i = (tab.length - 1) & h)) != null) {
1228	<	if (e.hash < 0)
1229	<	tab = (Node[])e.key;
1223	>	V oldVal = null;
1224	>	for (Node<V>[] tab = table;;) {
1225	>	Node<V> f; int i, fh; Object fk;
1226	>	if (tab == null ||
1227	>	(f = tabAt(tab, i = (tab.length - 1) & h)) == null)
1228	>	break;
1229	>	else if ((fh = f.hash) < 0) {
1230	>	if ((fk = f.key) instanceof TreeBin) {
1231	>	TreeBin<V> t = (TreeBin<V>)fk;
1232	>	boolean validated = false;
1233	>	boolean deleted = false;
1234	>	t.acquire(0);
1235	>	try {
1236	>	if (tabAt(tab, i) == f) {
1237	>	validated = true;
1238	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1239	>	if (p != null) {
1240	>	V pv = p.val;
1241	>	if (cv == null || cv == pv || cv.equals(pv)) {
1242	>	oldVal = pv;
1243	>	if ((p.val = v) == null) {
1244	>	deleted = true;
1245	>	t.deleteTreeNode(p);
1246	>	}
1247	>	}
1248	>	}
1249	>	}
1250	>	} finally {
1251	>	t.release(0);
1252	>	}
1253	>	if (validated) {
1254	>	if (deleted)
1255	>	addCount(-1L, -1);
1256	>	break;
1257	>	}
1258	>	}
1259	>	else
1260	>	tab = (Node<V>[])fk;
1261	>	}
1262	>	else if (fh != h && f.next == null) // precheck
1263	>	break;                          // rules out possible existence
1264		else {
1265		boolean validated = false;
1266		boolean deleted = false;
1267	<	synchronized(e) {
1268	<	Node pred = null;
1269	<	Node first = e;
1270	<	for (;;) {
1271	<	Object ek, ev;
1272	<	if ((ev = e.val) == null)
1273	<	break;
1274	<	if (e.hash == h && (ek = e.key) != null &&
449	<	(k == ek || k.equals(ek))) {
450	<	if (tabAt(tab, i) == first) {
451	<	validated = true;
1267	>	synchronized (f) {
1268	>	if (tabAt(tab, i) == f) {
1269	>	validated = true;
1270	>	for (Node<V> e = f, pred = null;;) {
1271	>	Object ek; V ev;
1272	>	if (e.hash == h &&
1273	>	((ev = e.val) != null) &&
1274	>	((ek = e.key) == k || k.equals(ek))) {
1275		if (cv == null || cv == ev || cv.equals(ev)) {
1276		oldVal = ev;
1277		if ((e.val = v) == null) {
1278		deleted = true;
1279	<	Node en = e.next;
1279	>	Node<V> en = e.next;
1280		if (pred != null)
1281		pred.next = en;
1282		else
1283		setTabAt(tab, i, en);
1284		}
1285		}
1286	+	break;
1287		}
1288	<	break;
1289	<	}
1290	<	pred = e;
467	<	if ((e = e.next) == null) {
468	<	if (tabAt(tab, i) == first)
469	<	validated = true;
470	<	break;
1288	>	pred = e;
1289	>	if ((e = e.next) == null)
1290	>	break;
1291		}
1292		}
1293		}
1294		if (validated) {
1295		if (deleted)
1296	<	counter.decrement();
1296	>	addCount(-1L, -1);
1297		break;
1298		}
1299		}
#	Line 481 | Line 1301 | public class ConcurrentHashMapV8<K, V>
1301		return oldVal;
1302		}
1303
1304	<	/** Implementation for computeIfAbsent and compute */
1305	<	@SuppressWarnings("unchecked")
1306	<	private final V internalCompute(K k,
1307	<	MappingFunction<? super K, ? extends V> f,
1308	<	boolean replace) {
1304	>	/*
1305	>	* Internal versions of insertion methods
1306	>	* All have the same basic structure as the first (internalPut):
1307	>	*  1. If table uninitialized, create
1308	>	*  2. If bin empty, try to CAS new node
1309	>	*  3. If bin stale, use new table
1310	>	*  4. if bin converted to TreeBin, validate and relay to TreeBin methods
1311	>	*  5. Lock and validate; if valid, scan and add or update
1312	>	*
1313	>	* The putAll method differs mainly in attempting to pre-allocate
1314	>	* enough table space, and also more lazily performs count updates
1315	>	* and checks.
1316	>	*
1317	>	* Most of the function-accepting methods can't be factored nicely
1318	>	* because they require different functional forms, so instead
1319	>	* sprawl out similar mechanics.
1320	>	*/
1321	>
1322	>	/** Implementation for put and putIfAbsent */
1323	>	@SuppressWarnings("unchecked") private final V internalPut
1324	>	(K k, V v, boolean onlyIfAbsent) {
1325	>	if (k == null || v == null) throw new NullPointerException();
1326	>	int h = spread(k.hashCode());
1327	>	int len = 0;
1328	>	for (Node<V>[] tab = table;;) {
1329	>	int i, fh; Node<V> f; Object fk; V fv;
1330	>	if (tab == null)
1331	>	tab = initTable();
1332	>	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1333	>	if (casTabAt(tab, i, null, new Node<V>(h, k, v, null)))
1334	>	break;                   // no lock when adding to empty bin
1335	>	}
1336	>	else if ((fh = f.hash) < 0) {
1337	>	if ((fk = f.key) instanceof TreeBin) {
1338	>	TreeBin<V> t = (TreeBin<V>)fk;
1339	>	V oldVal = null;
1340	>	t.acquire(0);
1341	>	try {
1342	>	if (tabAt(tab, i) == f) {
1343	>	len = 2;
1344	>	TreeNode<V> p = t.putTreeNode(h, k, v);
1345	>	if (p != null) {
1346	>	oldVal = p.val;
1347	>	if (!onlyIfAbsent)
1348	>	p.val = v;
1349	>	}
1350	>	}
1351	>	} finally {
1352	>	t.release(0);
1353	>	}
1354	>	if (len != 0) {
1355	>	if (oldVal != null)
1356	>	return oldVal;
1357	>	break;
1358	>	}
1359	>	}
1360	>	else
1361	>	tab = (Node<V>[])fk;
1362	>	}
1363	>	else if (onlyIfAbsent && fh == h && (fv = f.val) != null &&
1364	>	((fk = f.key) == k || k.equals(fk))) // peek while nearby
1365	>	return fv;
1366	>	else {
1367	>	V oldVal = null;
1368	>	synchronized (f) {
1369	>	if (tabAt(tab, i) == f) {
1370	>	len = 1;
1371	>	for (Node<V> e = f;; ++len) {
1372	>	Object ek; V ev;
1373	>	if (e.hash == h &&
1374	>	(ev = e.val) != null &&
1375	>	((ek = e.key) == k || k.equals(ek))) {
1376	>	oldVal = ev;
1377	>	if (!onlyIfAbsent)
1378	>	e.val = v;
1379	>	break;
1380	>	}
1381	>	Node<V> last = e;
1382	>	if ((e = e.next) == null) {
1383	>	last.next = new Node<V>(h, k, v, null);
1384	>	if (len >= TREE_THRESHOLD)
1385	>	replaceWithTreeBin(tab, i, k);
1386	>	break;
1387	>	}
1388	>	}
1389	>	}
1390	>	}
1391	>	if (len != 0) {
1392	>	if (oldVal != null)
1393	>	return oldVal;
1394	>	break;
1395	>	}
1396	>	}
1397	>	}
1398	>	addCount(1L, len);
1399	>	return null;
1400	>	}
1401	>
1402	>	/** Implementation for computeIfAbsent */
1403	>	@SuppressWarnings("unchecked") private final V internalComputeIfAbsent
1404	>	(K k, Fun<? super K, ? extends V> mf) {
1405	>	if (k == null || mf == null)
1406	>	throw new NullPointerException();
1407		int h = spread(k.hashCode());
1408		V val = null;
1409	<	boolean added = false;
1410	<	boolean validated = false;
1411	<	Node[] tab = table;
494	<	do {
495	<	Node e; int i;
1409	>	int len = 0;
1410	>	for (Node<V>[] tab = table;;) {
1411	>	Node<V> f; int i; Object fk;
1412		if (tab == null)
1413	<	tab = grow(0);
1414	<	else if ((e = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1415	<	Node node = new Node(h, k, null, null);
1416	<	synchronized(node) {
1413	>	tab = initTable();
1414	>	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1415	>	Node<V> node = new Node<V>(h, k, null, null);
1416	>	synchronized (node) {
1417		if (casTabAt(tab, i, null, node)) {
1418	<	validated = true;
1418	>	len = 1;
1419		try {
1420	<	val = f.map(k);
505	<	if (val != null) {
1420	>	if ((val = mf.apply(k)) != null)
1421		node.val = val;
507	–	added = true;
508	–	}
1422		} finally {
1423	<	if (!added)
1423	>	if (val == null)
1424		setTabAt(tab, i, null);
1425		}
1426		}
1427		}
1428	+	if (len != 0)
1429	+	break;
1430		}
1431	<	else if (e.hash < 0)
1432	<	tab = (Node[])e.key;
1433	<	else {
1434	<	boolean checkSize = false;
1435	<	synchronized(e) {
1436	<	Node first = e;
1437	<	for (;;) {
1438	<	Object ek, ev;
1439	<	if ((ev = e.val) == null)
1440	<	break;
1441	<	if (e.hash == h && (ek = e.key) != null &&
1442	<	(k == ek || k.equals(ek))) {
1443	<	if (tabAt(tab, i) == first) {
1444	<	validated = true;
1445	<	if (replace && (ev = f.map(k)) != null)
531	<	e.val = ev;
532	<	val = (V)ev;
1431	>	else if (f.hash < 0) {
1432	>	if ((fk = f.key) instanceof TreeBin) {
1433	>	TreeBin<V> t = (TreeBin<V>)fk;
1434	>	boolean added = false;
1435	>	t.acquire(0);
1436	>	try {
1437	>	if (tabAt(tab, i) == f) {
1438	>	len = 1;
1439	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1440	>	if (p != null)
1441	>	val = p.val;
1442	>	else if ((val = mf.apply(k)) != null) {
1443	>	added = true;
1444	>	len = 2;
1445	>	t.putTreeNode(h, k, val);
1446		}
534	–	break;
1447		}
1448	<	Node last = e;
1449	<	if ((e = e.next) == null) {
1450	<	if (tabAt(tab, i) == first) {
1451	<	validated = true;
1452	<	if ((val = f.map(k)) != null) {
1453	<	last.next = new Node(h, k, val, null);
1448	>	} finally {
1449	>	t.release(0);
1450	>	}
1451	>	if (len != 0) {
1452	>	if (!added)
1453	>	return val;
1454	>	break;
1455	>	}
1456	>	}
1457	>	else
1458	>	tab = (Node<V>[])fk;
1459	>	}
1460	>	else {
1461	>	for (Node<V> e = f; e != null; e = e.next) { // prescan
1462	>	Object ek; V ev;
1463	>	if (e.hash == h && (ev = e.val) != null &&
1464	>	((ek = e.key) == k || k.equals(ek)))
1465	>	return ev;
1466	>	}
1467	>	boolean added = false;
1468	>	synchronized (f) {
1469	>	if (tabAt(tab, i) == f) {
1470	>	len = 1;
1471	>	for (Node<V> e = f;; ++len) {
1472	>	Object ek; V ev;
1473	>	if (e.hash == h &&
1474	>	(ev = e.val) != null &&
1475	>	((ek = e.key) == k || k.equals(ek))) {
1476	>	val = ev;
1477	>	break;
1478	>	}
1479	>	Node<V> last = e;
1480	>	if ((e = e.next) == null) {
1481	>	if ((val = mf.apply(k)) != null) {
1482		added = true;
1483	<	if (last != first || tab.length <= 64)
1484	<	checkSize = true;
1483	>	last.next = new Node<V>(h, k, val, null);
1484	>	if (len >= TREE_THRESHOLD)
1485	>	replaceWithTreeBin(tab, i, k);
1486		}
1487	+	break;
1488		}
547	–	break;
1489		}
1490		}
1491		}
1492	<	if (checkSize && tab.length < MAXIMUM_CAPACITY &&
1493	<	resizing == 0 && counter.sum() >= threshold)
1494	<	grow(0);
1495	<	}
1496	<	} while (!validated);
1497	<	if (added)
1498	<	counter.increment();
1492	>	if (len != 0) {
1493	>	if (!added)
1494	>	return val;
1495	>	break;
1496	>	}
1497	>	}
1498	>	}
1499	>	if (val != null)
1500	>	addCount(1L, len);
1501		return val;
1502		}
1503
1504	<	/*
1505	<	* Reclassifies nodes in each bin to new table.  Because we are
1506	<	* using power-of-two expansion, the elements from each bin must
1507	<	* either stay at same index, or move with a power of two
1508	<	* offset. We eliminate unnecessary node creation by catching
1509	<	* cases where old nodes can be reused because their next fields
1510	<	* won't change.  Statistically, at the default threshold, only
1511	<	* about one-sixth of them need cloning when a table doubles. The
1512	<	* nodes they replace will be garbage collectable as soon as they
1513	<	* are no longer referenced by any reader thread that may be in
1514	<	* the midst of concurrently traversing table.
1515	<	*
1516	<	* Transfers are done from the bottom up to preserve iterator
1517	<	* traversability. On each step, the old bin is locked,
1518	<	* moved/copied, and then replaced with a forwarding node.
1519	<	*/
1520	<	private static final void transfer(Node[] tab, Node[] nextTab) {
1521	<	int n = tab.length;
1522	<	int mask = nextTab.length - 1;
1523	<	Node fwd = new Node(MOVED, nextTab, null, null);
1524	<	for (int i = n - 1; i >= 0; --i) {
1525	<	for (Node e;;) {
1526	<	if ((e = tabAt(tab, i)) == null) {
1527	<	if (casTabAt(tab, i, e, fwd))
1528	<	break;
586	<	}
587	<	else {
588	<	boolean validated = false;
589	<	synchronized(e) {
590	<	int idx = e.hash & mask;
591	<	Node lastRun = e;
592	<	for (Node p = e.next; p != null; p = p.next) {
593	<	int j = p.hash & mask;
594	<	if (j != idx) {
595	<	idx = j;
596	<	lastRun = p;
1504	>	/** Implementation for compute */
1505	>	@SuppressWarnings("unchecked") private final V internalCompute
1506	>	(K k, boolean onlyIfPresent,
1507	>	BiFun<? super K, ? super V, ? extends V> mf) {
1508	>	if (k == null || mf == null)
1509	>	throw new NullPointerException();
1510	>	int h = spread(k.hashCode());
1511	>	V val = null;
1512	>	int delta = 0;
1513	>	int len = 0;
1514	>	for (Node<V>[] tab = table;;) {
1515	>	Node<V> f; int i, fh; Object fk;
1516	>	if (tab == null)
1517	>	tab = initTable();
1518	>	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1519	>	if (onlyIfPresent)
1520	>	break;
1521	>	Node<V> node = new Node<V>(h, k, null, null);
1522	>	synchronized (node) {
1523	>	if (casTabAt(tab, i, null, node)) {
1524	>	try {
1525	>	len = 1;
1526	>	if ((val = mf.apply(k, null)) != null) {
1527	>	node.val = val;
1528	>	delta = 1;
1529		}
1530	+	} finally {
1531	+	if (delta == 0)
1532	+	setTabAt(tab, i, null);
1533		}
1534	<	if (tabAt(tab, i) == e) {
1535	<	validated = true;
1536	<	relaxedSetTabAt(nextTab, idx, lastRun);
1537	<	for (Node p = e; p != lastRun; p = p.next) {
1538	<	int h = p.hash;
1539	<	int j = h & mask;
1540	<	Node r = relaxedTabAt(nextTab, j);
1541	<	relaxedSetTabAt(nextTab, j,
1542	<	new Node(h, p.key, p.val, r));
1534	>	}
1535	>	}
1536	>	if (len != 0)
1537	>	break;
1538	>	}
1539	>	else if ((fh = f.hash) < 0) {
1540	>	if ((fk = f.key) instanceof TreeBin) {
1541	>	TreeBin<V> t = (TreeBin<V>)fk;
1542	>	t.acquire(0);
1543	>	try {
1544	>	if (tabAt(tab, i) == f) {
1545	>	len = 1;
1546	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1547	>	if (p == null && onlyIfPresent)
1548	>	break;
1549	>	V pv = (p == null) ? null : p.val;
1550	>	if ((val = mf.apply(k, pv)) != null) {
1551	>	if (p != null)
1552	>	p.val = val;
1553	>	else {
1554	>	len = 2;
1555	>	delta = 1;
1556	>	t.putTreeNode(h, k, val);
1557	>	}
1558	>	}
1559	>	else if (p != null) {
1560	>	delta = -1;
1561	>	t.deleteTreeNode(p);
1562		}
609	–	setTabAt(tab, i, fwd);
1563		}
1564	+	} finally {
1565	+	t.release(0);
1566		}
1567	<	if (validated)
1567	>	if (len != 0)
1568		break;
1569		}
1570	+	else
1571	+	tab = (Node<V>[])fk;
1572	+	}
1573	+	else {
1574	+	synchronized (f) {
1575	+	if (tabAt(tab, i) == f) {
1576	+	len = 1;
1577	+	for (Node<V> e = f, pred = null;; ++len) {
1578	+	Object ek; V ev;
1579	+	if (e.hash == h &&
1580	+	(ev = e.val) != null &&
1581	+	((ek = e.key) == k || k.equals(ek))) {
1582	+	val = mf.apply(k, ev);
1583	+	if (val != null)
1584	+	e.val = val;
1585	+	else {
1586	+	delta = -1;
1587	+	Node<V> en = e.next;
1588	+	if (pred != null)
1589	+	pred.next = en;
1590	+	else
1591	+	setTabAt(tab, i, en);
1592	+	}
1593	+	break;
1594	+	}
1595	+	pred = e;
1596	+	if ((e = e.next) == null) {
1597	+	if (!onlyIfPresent &&
1598	+	(val = mf.apply(k, null)) != null) {
1599	+	pred.next = new Node<V>(h, k, val, null);
1600	+	delta = 1;
1601	+	if (len >= TREE_THRESHOLD)
1602	+	replaceWithTreeBin(tab, i, k);
1603	+	}
1604	+	break;
1605	+	}
1606	+	}
1607	+	}
1608	+	}
1609	+	if (len != 0)
1610	+	break;
1611		}
1612		}
1613	+	if (delta != 0)
1614	+	addCount((long)delta, len);
1615	+	return val;
1616		}
1617
1618	<	/**
1619	<	* If not already resizing, initializes or creates next table and
1620	<	* transfers bins. Rechecks occupancy after a transfer to see if
1621	<	* another resize is already needed because resizings are lagging
1622	<	* additions.
1623	<	*
1624	<	* @param sizeHint overridden capacity target (nonzero only from putAll)
1625	<	* @return current table
1626	<	*/
1627	<	private final Node[] grow(int sizeHint) {
1628	<	if (resizing == 0 &&
1629	<	UNSAFE.compareAndSwapInt(this, resizingOffset, 0, 1)) {
1630	<	try {
1631	<	for (;;) {
1632	<	int cap, n;
1633	<	Node[] tab = table;
1634	<	if (tab == null) {
1635	<	int c = initCap;
1636	<	if (c < sizeHint)
1637	<	c = sizeHint;
1638	<	if (c == DEFAULT_CAPACITY)
1639	<	cap = c;
1640	<	else if (c >= MAXIMUM_CAPACITY)
1641	<	cap = MAXIMUM_CAPACITY;
1642	<	else {
1643	<	cap = MINIMUM_CAPACITY;
1644	<	while (cap < c)
1645	<	cap <<= 1;
1618	>	/** Implementation for merge */
1619	>	@SuppressWarnings("unchecked") private final V internalMerge
1620	>	(K k, V v, BiFun<? super V, ? super V, ? extends V> mf) {
1621	>	if (k == null || v == null || mf == null)
1622	>	throw new NullPointerException();
1623	>	int h = spread(k.hashCode());
1624	>	V val = null;
1625	>	int delta = 0;
1626	>	int len = 0;
1627	>	for (Node<V>[] tab = table;;) {
1628	>	int i; Node<V> f; Object fk; V fv;
1629	>	if (tab == null)
1630	>	tab = initTable();
1631	>	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1632	>	if (casTabAt(tab, i, null, new Node<V>(h, k, v, null))) {
1633	>	delta = 1;
1634	>	val = v;
1635	>	break;
1636	>	}
1637	>	}
1638	>	else if (f.hash < 0) {
1639	>	if ((fk = f.key) instanceof TreeBin) {
1640	>	TreeBin<V> t = (TreeBin<V>)fk;
1641	>	t.acquire(0);
1642	>	try {
1643	>	if (tabAt(tab, i) == f) {
1644	>	len = 1;
1645	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1646	>	val = (p == null) ? v : mf.apply(p.val, v);
1647	>	if (val != null) {
1648	>	if (p != null)
1649	>	p.val = val;
1650	>	else {
1651	>	len = 2;
1652	>	delta = 1;
1653	>	t.putTreeNode(h, k, val);
1654	>	}
1655	>	}
1656	>	else if (p != null) {
1657	>	delta = -1;
1658	>	t.deleteTreeNode(p);
1659	>	}
1660		}
1661	+	} finally {
1662	+	t.release(0);
1663		}
1664	<	else if ((n = tab.length) < MAXIMUM_CAPACITY &&
650	<	(sizeHint <= 0 || n < sizeHint))
651	<	cap = n << 1;
652	<	else
653	<	break;
654	<	threshold = (int)(cap * loadFactor) - THRESHOLD_OFFSET;
655	<	Node[] nextTab = new Node[cap];
656	<	if (tab != null)
657	<	transfer(tab, nextTab);
658	<	table = nextTab;
659	<	if (tab == null || cap >= MAXIMUM_CAPACITY ||
660	<	(sizeHint > 0 && cap >= sizeHint) ||
661	<	counter.sum() < threshold)
1664	>	if (len != 0)
1665		break;
1666		}
1667	<	} finally {
1668	<	resizing = 0;
1667	>	else
1668	>	tab = (Node<V>[])fk;
1669	>	}
1670	>	else {
1671	>	synchronized (f) {
1672	>	if (tabAt(tab, i) == f) {
1673	>	len = 1;
1674	>	for (Node<V> e = f, pred = null;; ++len) {
1675	>	Object ek; V ev;
1676	>	if (e.hash == h &&
1677	>	(ev = e.val) != null &&
1678	>	((ek = e.key) == k || k.equals(ek))) {
1679	>	val = mf.apply(ev, v);
1680	>	if (val != null)
1681	>	e.val = val;
1682	>	else {
1683	>	delta = -1;
1684	>	Node<V> en = e.next;
1685	>	if (pred != null)
1686	>	pred.next = en;
1687	>	else
1688	>	setTabAt(tab, i, en);
1689	>	}
1690	>	break;
1691	>	}
1692	>	pred = e;
1693	>	if ((e = e.next) == null) {
1694	>	val = v;
1695	>	pred.next = new Node<V>(h, k, val, null);
1696	>	delta = 1;
1697	>	if (len >= TREE_THRESHOLD)
1698	>	replaceWithTreeBin(tab, i, k);
1699	>	break;
1700	>	}
1701	>	}
1702	>	}
1703	>	}
1704	>	if (len != 0)
1705	>	break;
1706		}
1707		}
1708	<	else if (table == null)
1709	<	Thread.yield(); // lost initialization race; just spin
1710	<	return table;
1708	>	if (delta != 0)
1709	>	addCount((long)delta, len);
1710	>	return val;
1711		}
1712
1713	<	/**
1714	<	* Implementation for putAll and constructor with Map
1715	<	* argument. Tries to first override initial capacity or grow
1716	<	* based on map size to pre-allocate table space.
1717	<	*/
1718	<	private final void internalPutAll(Map<? extends K, ? extends V> m) {
1719	<	int s = m.size();
1720	<	grow((s >= (MAXIMUM_CAPACITY >>> 1))? s : s + (s >>> 1));
1721	<	for (Map.Entry<? extends K, ? extends V> e : m.entrySet()) {
1722	<	Object k = e.getKey();
1723	<	Object v = e.getValue();
1724	<	if (k == null || v == null)
1725	<	throw new NullPointerException();
1726	<	internalPut(k, v, true);
1713	>	/** Implementation for putAll */
1714	>	@SuppressWarnings("unchecked") private final void internalPutAll
1715	>	(Map<? extends K, ? extends V> m) {
1716	>	tryPresize(m.size());
1717	>	long delta = 0L;     // number of uncommitted additions
1718	>	boolean npe = false; // to throw exception on exit for nulls
1719	>	try {                // to clean up counts on other exceptions
1720	>	for (Map.Entry<?, ? extends V> entry : m.entrySet()) {
1721	>	Object k; V v;
1722	>	if (entry == null || (k = entry.getKey()) == null ||
1723	>	(v = entry.getValue()) == null) {
1724	>	npe = true;
1725	>	break;
1726	>	}
1727	>	int h = spread(k.hashCode());
1728	>	for (Node<V>[] tab = table;;) {
1729	>	int i; Node<V> f; int fh; Object fk;
1730	>	if (tab == null)
1731	>	tab = initTable();
1732	>	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){
1733	>	if (casTabAt(tab, i, null, new Node<V>(h, k, v, null))) {
1734	>	++delta;
1735	>	break;
1736	>	}
1737	>	}
1738	>	else if ((fh = f.hash) < 0) {
1739	>	if ((fk = f.key) instanceof TreeBin) {
1740	>	TreeBin<V> t = (TreeBin<V>)fk;
1741	>	boolean validated = false;
1742	>	t.acquire(0);
1743	>	try {
1744	>	if (tabAt(tab, i) == f) {
1745	>	validated = true;
1746	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1747	>	if (p != null)
1748	>	p.val = v;
1749	>	else {
1750	>	t.putTreeNode(h, k, v);
1751	>	++delta;
1752	>	}
1753	>	}
1754	>	} finally {
1755	>	t.release(0);
1756	>	}
1757	>	if (validated)
1758	>	break;
1759	>	}
1760	>	else
1761	>	tab = (Node<V>[])fk;
1762	>	}
1763	>	else {
1764	>	int len = 0;
1765	>	synchronized (f) {
1766	>	if (tabAt(tab, i) == f) {
1767	>	len = 1;
1768	>	for (Node<V> e = f;; ++len) {
1769	>	Object ek; V ev;
1770	>	if (e.hash == h &&
1771	>	(ev = e.val) != null &&
1772	>	((ek = e.key) == k || k.equals(ek))) {
1773	>	e.val = v;
1774	>	break;
1775	>	}
1776	>	Node<V> last = e;
1777	>	if ((e = e.next) == null) {
1778	>	++delta;
1779	>	last.next = new Node<V>(h, k, v, null);
1780	>	if (len >= TREE_THRESHOLD)
1781	>	replaceWithTreeBin(tab, i, k);
1782	>	break;
1783	>	}
1784	>	}
1785	>	}
1786	>	}
1787	>	if (len != 0) {
1788	>	if (len > 1)
1789	>	addCount(delta, len);
1790	>	break;
1791	>	}
1792	>	}
1793	>	}
1794	>	}
1795	>	} finally {
1796	>	if (delta != 0L)
1797	>	addCount(delta, 2);
1798		}
1799	+	if (npe)
1800	+	throw new NullPointerException();
1801		}
1802
1803		/**
1804	<	* Implementation for clear. Steps through each bin, removing all nodes.
1804	>	* Implementation for clear. Steps through each bin, removing all
1805	>	* nodes.
1806		*/
1807	<	private final void internalClear() {
1808	<	long deletions = 0L;
1807	>	@SuppressWarnings("unchecked") private final void internalClear() {
1808	>	long delta = 0L; // negative number of deletions
1809		int i = 0;
1810	<	Node[] tab = table;
1810	>	Node<V>[] tab = table;
1811		while (tab != null && i < tab.length) {
1812	<	Node e = tabAt(tab, i);
1813	<	if (e == null)
1812	>	Node<V> f = tabAt(tab, i);
1813	>	if (f == null)
1814		++i;
1815	<	else if (e.hash < 0)
1816	<	tab = (Node[])e.key;
1815	>	else if (f.hash < 0) {
1816	>	Object fk;
1817	>	if ((fk = f.key) instanceof TreeBin) {
1818	>	TreeBin<V> t = (TreeBin<V>)fk;
1819	>	t.acquire(0);
1820	>	try {
1821	>	if (tabAt(tab, i) == f) {
1822	>	for (Node<V> p = t.first; p != null; p = p.next) {
1823	>	if (p.val != null) { // (currently always true)
1824	>	p.val = null;
1825	>	--delta;
1826	>	}
1827	>	}
1828	>	t.first = null;
1829	>	t.root = null;
1830	>	++i;
1831	>	}
1832	>	} finally {
1833	>	t.release(0);
1834	>	}
1835	>	}
1836	>	else
1837	>	tab = (Node<V>[])fk;
1838	>	}
1839		else {
1840	<	boolean validated = false;
1841	<	synchronized(e) {
1842	<	if (tabAt(tab, i) == e) {
1843	<	validated = true;
708	<	do {
709	<	if (e.val != null) {
1840	>	synchronized (f) {
1841	>	if (tabAt(tab, i) == f) {
1842	>	for (Node<V> e = f; e != null; e = e.next) {
1843	>	if (e.val != null) {  // (currently always true)
1844		e.val = null;
1845	<	++deletions;
1845	>	--delta;
1846		}
1847	<	} while ((e = e.next) != null);
1847	>	}
1848		setTabAt(tab, i, null);
1849	+	++i;
1850		}
1851		}
1852	<	if (validated) {
1853	<	++i;
1854	<	if (deletions > THRESHOLD_OFFSET) { // bound lag in counts
1855	<	counter.add(-deletions);
1856	<	deletions = 0L;
1852	>	}
1853	>	}
1854	>	if (delta != 0L)
1855	>	addCount(delta, -1);
1856	>	}
1857	>
1858	>	/* ---------------- Table Initialization and Resizing -------------- */
1859	>
1860	>	/**
1861	>	* Returns a power of two table size for the given desired capacity.
1862	>	* See Hackers Delight, sec 3.2
1863	>	*/
1864	>	private static final int tableSizeFor(int c) {
1865	>	int n = c - 1;
1866	>	n |= n >>> 1;
1867	>	n |= n >>> 2;
1868	>	n |= n >>> 4;
1869	>	n |= n >>> 8;
1870	>	n |= n >>> 16;
1871	>	return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
1872	>	}
1873	>
1874	>	/**
1875	>	* Initializes table, using the size recorded in sizeCtl.
1876	>	*/
1877	>	@SuppressWarnings("unchecked") private final Node<V>[] initTable() {
1878	>	Node<V>[] tab; int sc;
1879	>	while ((tab = table) == null) {
1880	>	if ((sc = sizeCtl) < 0)
1881	>	Thread.yield(); // lost initialization race; just spin
1882	>	else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
1883	>	try {
1884	>	if ((tab = table) == null) {
1885	>	int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
1886	>	@SuppressWarnings("rawtypes") Node[] tb = new Node[n];
1887	>	table = tab = (Node<V>[])tb;
1888	>	sc = n - (n >>> 2);
1889		}
1890	+	} finally {
1891	+	sizeCtl = sc;
1892		}
1893	+	break;
1894	+	}
1895	+	}
1896	+	return tab;
1897	+	}
1898	+
1899	+	/**
1900	+	* Adds to count, and if table is too small and not already
1901	+	* resizing, initiates transfer. If already resizing, helps
1902	+	* perform transfer if work is available.  Rechecks occupancy
1903	+	* after a transfer to see if another resize is already needed
1904	+	* because resizings are lagging additions.
1905	+	*
1906	+	* @param x the count to add
1907	+	* @param check if <0, don't check resize, if <= 1 only check if uncontended
1908	+	*/
1909	+	private final void addCount(long x, int check) {
1910	+	CounterCell[] as; long b, s;
1911	+	if ((as = counterCells) != null ||
1912	+	!U.compareAndSwapLong(this, BASECOUNT, b = baseCount, s = b + x)) {
1913	+	CounterHashCode hc; CounterCell a; long v; int m;
1914	+	boolean uncontended = true;
1915	+	if ((hc = threadCounterHashCode.get()) == null ||
1916	+	as == null || (m = as.length - 1) < 0 ||
1917	+	(a = as[m & hc.code]) == null ||
1918	+	!(uncontended =
1919	+	U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))) {
1920	+	fullAddCount(x, hc, uncontended);
1921	+	return;
1922	+	}
1923	+	if (check <= 1)
1924	+	return;
1925	+	s = sumCount();
1926	+	}
1927	+	if (check >= 0) {
1928	+	Node<V>[] tab, nt; int sc;
1929	+	while (s >= (long)(sc = sizeCtl) && (tab = table) != null &&
1930	+	tab.length < MAXIMUM_CAPACITY) {
1931	+	if (sc < 0) {
1932	+	if (sc == -1 || transferIndex <= transferOrigin ||
1933	+	(nt = nextTable) == null)
1934	+	break;
1935	+	if (U.compareAndSwapInt(this, SIZECTL, sc, sc - 1))
1936	+	transfer(tab, nt);
1937	+	}
1938	+	else if (U.compareAndSwapInt(this, SIZECTL, sc, -2))
1939	+	transfer(tab, null);
1940	+	s = sumCount();
1941		}
1942		}
726	–	if (deletions != 0L)
727	–	counter.add(-deletions);
1943		}
1944
1945		/**
1946	<	* Base class for key, value, and entry iterators, plus internal
1947	<	* implementations of public traversal-based methods, to avoid
1948	<	* duplicating traversal code.
1946	>	* Tries to presize table to accommodate the given number of elements.
1947	>	*
1948	>	* @param size number of elements (doesn't need to be perfectly accurate)
1949		*/
1950	<	class HashIterator {
1951	<	private Node next;          // the next entry to return
1952	<	private Node[] tab;         // current table; updated if resized
1953	<	private Node lastReturned;  // the last entry returned, for remove
1954	<	private Object nextVal;     // cached value of next
1955	<	private int index;          // index of bin to use next
1956	<	private int baseIndex;      // current index of initial table
1957	<	private final int baseSize; // initial table size
1950	>	@SuppressWarnings("unchecked") private final void tryPresize(int size) {
1951	>	int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
1952	>	tableSizeFor(size + (size >>> 1) + 1);
1953	>	int sc;
1954	>	while ((sc = sizeCtl) >= 0) {
1955	>	Node<V>[] tab = table; int n;
1956	>	if (tab == null || (n = tab.length) == 0) {
1957	>	n = (sc > c) ? sc : c;
1958	>	if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
1959	>	try {
1960	>	if (table == tab) {
1961	>	@SuppressWarnings("rawtypes") Node[] tb = new Node[n];
1962	>	table = (Node<V>[])tb;
1963	>	sc = n - (n >>> 2);
1964	>	}
1965	>	} finally {
1966	>	sizeCtl = sc;
1967	>	}
1968	>	}
1969	>	}
1970	>	else if (c <= sc || n >= MAXIMUM_CAPACITY)
1971	>	break;
1972	>	else if (tab == table &&
1973	>	U.compareAndSwapInt(this, SIZECTL, sc, -2))
1974	>	transfer(tab, null);
1975	>	}
1976	>	}
1977
1978	<	HashIterator() {
1979	<	Node[] t = tab = table;
1980	<	if (t == null)
1981	<	baseSize = 0;
1982	<	else {
1983	<	baseSize = t.length;
1984	<	advance(null);
1978	>	/*
1979	>	* Moves and/or copies the nodes in each bin to new table. See
1980	>	* above for explanation.
1981	>	*/
1982	>	@SuppressWarnings("unchecked") private final void transfer
1983	>	(Node<V>[] tab, Node<V>[] nextTab) {
1984	>	int n = tab.length, stride;
1985	>	if ((stride = (NCPU > 1) ? (n >>> 3) / NCPU : n) < MIN_TRANSFER_STRIDE)
1986	>	stride = MIN_TRANSFER_STRIDE; // subdivide range
1987	>	if (nextTab == null) {            // initiating
1988	>	try {
1989	>	@SuppressWarnings("rawtypes") Node[] tb = new Node[n << 1];
1990	>	nextTab = (Node<V>[])tb;
1991	>	} catch (Throwable ex) {      // try to cope with OOME
1992	>	sizeCtl = Integer.MAX_VALUE;
1993	>	return;
1994	>	}
1995	>	nextTable = nextTab;
1996	>	transferOrigin = n;
1997	>	transferIndex = n;
1998	>	Node<V> rev = new Node<V>(MOVED, tab, null, null);
1999	>	for (int k = n; k > 0;) {    // progressively reveal ready slots
2000	>	int nextk = (k > stride) ? k - stride : 0;
2001	>	for (int m = nextk; m < k; ++m)
2002	>	nextTab[m] = rev;
2003	>	for (int m = n + nextk; m < n + k; ++m)
2004	>	nextTab[m] = rev;
2005	>	U.putOrderedInt(this, TRANSFERORIGIN, k = nextk);
2006		}
2007		}
2008	+	int nextn = nextTab.length;
2009	+	Node<V> fwd = new Node<V>(MOVED, nextTab, null, null);
2010	+	boolean advance = true;
2011	+	for (int i = 0, bound = 0;;) {
2012	+	int nextIndex, nextBound; Node<V> f; Object fk;
2013	+	while (advance) {
2014	+	if (--i >= bound)
2015	+	advance = false;
2016	+	else if ((nextIndex = transferIndex) <= transferOrigin) {
2017	+	i = -1;
2018	+	advance = false;
2019	+	}
2020	+	else if (U.compareAndSwapInt
2021	+	(this, TRANSFERINDEX, nextIndex,
2022	+	nextBound = (nextIndex > stride ?
2023	+	nextIndex - stride : 0))) {
2024	+	bound = nextBound;
2025	+	i = nextIndex - 1;
2026	+	advance = false;
2027	+	}
2028	+	}
2029	+	if (i < 0 || i >= n || i + n >= nextn) {
2030	+	for (int sc;;) {
2031	+	if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, ++sc)) {
2032	+	if (sc == -1) {
2033	+	nextTable = null;
2034	+	table = nextTab;
2035	+	sizeCtl = (n << 1) - (n >>> 1);
2036	+	}
2037	+	return;
2038	+	}
2039	+	}
2040	+	}
2041	+	else if ((f = tabAt(tab, i)) == null) {
2042	+	if (casTabAt(tab, i, null, fwd)) {
2043	+	setTabAt(nextTab, i, null);
2044	+	setTabAt(nextTab, i + n, null);
2045	+	advance = true;
2046	+	}
2047	+	}
2048	+	else if (f.hash >= 0) {
2049	+	synchronized (f) {
2050	+	if (tabAt(tab, i) == f) {
2051	+	int runBit = f.hash & n;
2052	+	Node<V> lastRun = f, lo = null, hi = null;
2053	+	for (Node<V> p = f.next; p != null; p = p.next) {
2054	+	int b = p.hash & n;
2055	+	if (b != runBit) {
2056	+	runBit = b;
2057	+	lastRun = p;
2058	+	}
2059	+	}
2060	+	if (runBit == 0)
2061	+	lo = lastRun;
2062	+	else
2063	+	hi = lastRun;
2064	+	for (Node<V> p = f; p != lastRun; p = p.next) {
2065	+	int ph = p.hash;
2066	+	Object pk = p.key; V pv = p.val;
2067	+	if ((ph & n) == 0)
2068	+	lo = new Node<V>(ph, pk, pv, lo);
2069	+	else
2070	+	hi = new Node<V>(ph, pk, pv, hi);
2071	+	}
2072	+	setTabAt(nextTab, i, lo);
2073	+	setTabAt(nextTab, i + n, hi);
2074	+	setTabAt(tab, i, fwd);
2075	+	advance = true;
2076	+	}
2077	+	}
2078	+	}
2079	+	else if ((fk = f.key) instanceof TreeBin) {
2080	+	TreeBin<V> t = (TreeBin<V>)fk;
2081	+	t.acquire(0);
2082	+	try {
2083	+	if (tabAt(tab, i) == f) {
2084	+	TreeBin<V> lt = new TreeBin<V>();
2085	+	TreeBin<V> ht = new TreeBin<V>();
2086	+	int lc = 0, hc = 0;
2087	+	for (Node<V> e = t.first; e != null; e = e.next) {
2088	+	int h = e.hash;
2089	+	Object k = e.key; V v = e.val;
2090	+	if ((h & n) == 0) {
2091	+	++lc;
2092	+	lt.putTreeNode(h, k, v);
2093	+	}
2094	+	else {
2095	+	++hc;
2096	+	ht.putTreeNode(h, k, v);
2097	+	}
2098	+	}
2099	+	Node<V> ln, hn; // throw away trees if too small
2100	+	if (lc < TREE_THRESHOLD) {
2101	+	ln = null;
2102	+	for (Node<V> p = lt.first; p != null; p = p.next)
2103	+	ln = new Node<V>(p.hash, p.key, p.val, ln);
2104	+	}
2105	+	else
2106	+	ln = new Node<V>(MOVED, lt, null, null);
2107	+	setTabAt(nextTab, i, ln);
2108	+	if (hc < TREE_THRESHOLD) {
2109	+	hn = null;
2110	+	for (Node<V> p = ht.first; p != null; p = p.next)
2111	+	hn = new Node<V>(p.hash, p.key, p.val, hn);
2112	+	}
2113	+	else
2114	+	hn = new Node<V>(MOVED, ht, null, null);
2115	+	setTabAt(nextTab, i + n, hn);
2116	+	setTabAt(tab, i, fwd);
2117	+	advance = true;
2118	+	}
2119	+	} finally {
2120	+	t.release(0);
2121	+	}
2122	+	}
2123	+	else
2124	+	advance = true; // already processed
2125	+	}
2126	+	}
2127
2128	<	public final boolean hasNext()         { return next != null; }
755	<	public final boolean hasMoreElements() { return next != null; }
2128	>	/* ---------------- Counter support -------------- */
2129
2130	<	/**
2131	<	* Advances next.  Normally, iteration proceeds bin-by-bin
2132	<	* traversing lists.  However, if the table has been resized,
2133	<	* then all future steps must traverse both the bin at the
2134	<	* current index as well as at (index + baseSize); and so on
2135	<	* for further resizings. To paranoically cope with potential
2136	<	* (improper) sharing of iterators across threads, table reads
2137	<	* are bounds-checked.
2138	<	*/
2139	<	final void advance(Node e) {
2140	<	for (;;) {
2141	<	Node[] t; int i; // for bounds checks
2142	<	if (e != null) {
2143	<	Object ek = e.key, ev = e.val;
2144	<	if (ev != null && ek != null) {
2145	<	nextVal = ev;
2146	<	next = e;
2147	<	break;
2130	>	final long sumCount() {
2131	>	CounterCell[] as = counterCells; CounterCell a;
2132	>	long sum = baseCount;
2133	>	if (as != null) {
2134	>	for (int i = 0; i < as.length; ++i) {
2135	>	if ((a = as[i]) != null)
2136	>	sum += a.value;
2137	>	}
2138	>	}
2139	>	return sum;
2140	>	}
2141	>
2142	>	// See LongAdder version for explanation
2143	>	private final void fullAddCount(long x, CounterHashCode hc,
2144	>	boolean wasUncontended) {
2145	>	int h;
2146	>	if (hc == null) {
2147	>	hc = new CounterHashCode();
2148	>	int s = counterHashCodeGenerator.addAndGet(SEED_INCREMENT);
2149	>	h = hc.code = (s == 0) ? 1 : s; // Avoid zero
2150	>	threadCounterHashCode.set(hc);
2151	>	}
2152	>	else
2153	>	h = hc.code;
2154	>	boolean collide = false;                // True if last slot nonempty
2155	>	for (;;) {
2156	>	CounterCell[] as; CounterCell a; int n; long v;
2157	>	if ((as = counterCells) != null && (n = as.length) > 0) {
2158	>	if ((a = as[(n - 1) & h]) == null) {
2159	>	if (counterBusy == 0) {            // Try to attach new Cell
2160	>	CounterCell r = new CounterCell(x); // Optimistic create
2161	>	if (counterBusy == 0 &&
2162	>	U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
2163	>	boolean created = false;
2164	>	try {               // Recheck under lock
2165	>	CounterCell[] rs; int m, j;
2166	>	if ((rs = counterCells) != null &&
2167	>	(m = rs.length) > 0 &&
2168	>	rs[j = (m - 1) & h] == null) {
2169	>	rs[j] = r;
2170	>	created = true;
2171	>	}
2172	>	} finally {
2173	>	counterBusy = 0;
2174	>	}
2175	>	if (created)
2176	>	break;
2177	>	continue;           // Slot is now non-empty
2178	>	}
2179		}
2180	<	e = e.next;
2180	>	collide = false;
2181		}
2182	<	else if (baseIndex < baseSize && (t = tab) != null &&
2183	<	t.length > (i = index) && i >= 0) {
2184	<	if ((e = tabAt(t, i)) != null && e.hash < 0) {
2185	<	tab = (Node[])e.key;
2186	<	e = null;
2182	>	else if (!wasUncontended)       // CAS already known to fail
2183	>	wasUncontended = true;      // Continue after rehash
2184	>	else if (U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))
2185	>	break;
2186	>	else if (counterCells != as || n >= NCPU)
2187	>	collide = false;            // At max size or stale
2188	>	else if (!collide)
2189	>	collide = true;
2190	>	else if (counterBusy == 0 &&
2191	>	U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
2192	>	try {
2193	>	if (counterCells == as) {// Expand table unless stale
2194	>	CounterCell[] rs = new CounterCell[n << 1];
2195	>	for (int i = 0; i < n; ++i)
2196	>	rs[i] = as[i];
2197	>	counterCells = rs;
2198	>	}
2199	>	} finally {
2200	>	counterBusy = 0;
2201		}
2202	<	else if (i + baseSize < t.length)
2203	<	index += baseSize;    // visit forwarded upper slots
786	<	else
787	<	index = ++baseIndex;
2202	>	collide = false;
2203	>	continue;                   // Retry with expanded table
2204		}
2205	<	else {
2206	<	next = null;
2207	<	break;
2205	>	h ^= h << 13;                   // Rehash
2206	>	h ^= h >>> 17;
2207	>	h ^= h << 5;
2208	>	}
2209	>	else if (counterBusy == 0 && counterCells == as &&
2210	>	U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
2211	>	boolean init = false;
2212	>	try {                           // Initialize table
2213	>	if (counterCells == as) {
2214	>	CounterCell[] rs = new CounterCell[2];
2215	>	rs[h & 1] = new CounterCell(x);
2216	>	counterCells = rs;
2217	>	init = true;
2218	>	}
2219	>	} finally {
2220	>	counterBusy = 0;
2221		}
2222	+	if (init)
2223	+	break;
2224		}
2225	+	else if (U.compareAndSwapLong(this, BASECOUNT, v = baseCount, v + x))
2226	+	break;                          // Fall back on using base
2227		}
2228	+	hc.code = h;                            // Record index for next time
2229	+	}
2230
2231	<	final Object nextKey() {
797	<	Node e = next;
798	<	if (e == null)
799	<	throw new NoSuchElementException();
800	<	Object k = e.key;
801	<	advance((lastReturned = e).next);
802	<	return k;
803	<	}
2231	>	/* ----------------Table Traversal -------------- */
2232
2233	<	final Object nextValue() {
2234	<	Node e = next;
2235	<	if (e == null)
2236	<	throw new NoSuchElementException();
2237	<	Object v = nextVal;
2238	<	advance((lastReturned = e).next);
2239	<	return v;
2233	>	/**
2234	>	* Encapsulates traversal for methods such as containsValue; also
2235	>	* serves as a base class for other iterators and bulk tasks.
2236	>	*
2237	>	* At each step, the iterator snapshots the key ("nextKey") and
2238	>	* value ("nextVal") of a valid node (i.e., one that, at point of
2239	>	* snapshot, has a non-null user value). Because val fields can
2240	>	* change (including to null, indicating deletion), field nextVal
2241	>	* might not be accurate at point of use, but still maintains the
2242	>	* weak consistency property of holding a value that was once
2243	>	* valid. To support iterator.remove, the nextKey field is not
2244	>	* updated (nulled out) when the iterator cannot advance.
2245	>	*
2246	>	* Internal traversals directly access these fields, as in:
2247	>	* {@code while (it.advance() != null) { process(it.nextKey); }}
2248	>	*
2249	>	* Exported iterators must track whether the iterator has advanced
2250	>	* (in hasNext vs next) (by setting/checking/nulling field
2251	>	* nextVal), and then extract key, value, or key-value pairs as
2252	>	* return values of next().
2253	>	*
2254	>	* The iterator visits once each still-valid node that was
2255	>	* reachable upon iterator construction. It might miss some that
2256	>	* were added to a bin after the bin was visited, which is OK wrt
2257	>	* consistency guarantees. Maintaining this property in the face
2258	>	* of possible ongoing resizes requires a fair amount of
2259	>	* bookkeeping state that is difficult to optimize away amidst
2260	>	* volatile accesses.  Even so, traversal maintains reasonable
2261	>	* throughput.
2262	>	*
2263	>	* Normally, iteration proceeds bin-by-bin traversing lists.
2264	>	* However, if the table has been resized, then all future steps
2265	>	* must traverse both the bin at the current index as well as at
2266	>	* (index + baseSize); and so on for further resizings. To
2267	>	* paranoically cope with potential sharing by users of iterators
2268	>	* across threads, iteration terminates if a bounds checks fails
2269	>	* for a table read.
2270	>	*
2271	>	* This class extends CountedCompleter to streamline parallel
2272	>	* iteration in bulk operations. This adds only a few fields of
2273	>	* space overhead, which is small enough in cases where it is not
2274	>	* needed to not worry about it.  Because CountedCompleter is
2275	>	* Serializable, but iterators need not be, we need to add warning
2276	>	* suppressions.
2277	>	*/
2278	>	@SuppressWarnings("serial") static class Traverser<K,V,R>
2279	>	extends CountedCompleter<R> {
2280	>	final ConcurrentHashMapV8<K, V> map;
2281	>	Node<V> next;        // the next entry to use
2282	>	Object nextKey;      // cached key field of next
2283	>	V nextVal;           // cached val field of next
2284	>	Node<V>[] tab;       // current table; updated if resized
2285	>	int index;           // index of bin to use next
2286	>	int baseIndex;       // current index of initial table
2287	>	int baseLimit;       // index bound for initial table
2288	>	int baseSize;        // initial table size
2289	>	int batch;           // split control
2290	>
2291	>	/** Creates iterator for all entries in the table. */
2292	>	Traverser(ConcurrentHashMapV8<K, V> map) {
2293	>	this.map = map;
2294	>	}
2295	>
2296	>	/** Creates iterator for split() methods and task constructors */
2297	>	Traverser(ConcurrentHashMapV8<K,V> map, Traverser<K,V,?> it, int batch) {
2298	>	super(it);
2299	>	this.batch = batch;
2300	>	if ((this.map = map) != null && it != null) { // split parent
2301	>	Node<V>[] t;
2302	>	if ((t = it.tab) == null &&
2303	>	(t = it.tab = map.table) != null)
2304	>	it.baseLimit = it.baseSize = t.length;
2305	>	this.tab = t;
2306	>	this.baseSize = it.baseSize;
2307	>	int hi = this.baseLimit = it.baseLimit;
2308	>	it.baseLimit = this.index = this.baseIndex =
2309	>	(hi + it.baseIndex + 1) >>> 1;
2310	>	}
2311		}
2312
2313	<	final WriteThroughEntry nextEntry() {
2314	<	Node e = next;
2315	<	if (e == null)
2316	<	throw new NoSuchElementException();
2317	<	WriteThroughEntry entry =
2318	<	new WriteThroughEntry(e.key, nextVal);
2319	<	advance((lastReturned = e).next);
2320	<	return entry;
2313	>	/**
2314	>	* Advances next; returns nextVal or null if terminated.
2315	>	* See above for explanation.
2316	>	*/
2317	>	@SuppressWarnings("unchecked") final V advance() {
2318	>	Node<V> e = next;
2319	>	V ev = null;
2320	>	outer: do {
2321	>	if (e != null)                  // advance past used/skipped node
2322	>	e = e.next;
2323	>	while (e == null) {             // get to next non-null bin
2324	>	ConcurrentHashMapV8<K, V> m;
2325	>	Node<V>[] t; int b, i, n; Object ek; //  must use locals
2326	>	if ((t = tab) != null)
2327	>	n = t.length;
2328	>	else if ((m = map) != null && (t = tab = m.table) != null)
2329	>	n = baseLimit = baseSize = t.length;
2330	>	else
2331	>	break outer;
2332	>	if ((b = baseIndex) >= baseLimit ||
2333	>	(i = index) < 0 || i >= n)
2334	>	break outer;
2335	>	if ((e = tabAt(t, i)) != null && e.hash < 0) {
2336	>	if ((ek = e.key) instanceof TreeBin)
2337	>	e = ((TreeBin<V>)ek).first;
2338	>	else {
2339	>	tab = (Node<V>[])ek;
2340	>	continue;           // restarts due to null val
2341	>	}
2342	>	}                           // visit upper slots if present
2343	>	index = (i += baseSize) < n ? i : (baseIndex = b + 1);
2344	>	}
2345	>	nextKey = e.key;
2346	>	} while ((ev = e.val) == null);    // skip deleted or special nodes
2347	>	next = e;
2348	>	return nextVal = ev;
2349		}
2350
2351		public final void remove() {
2352	<	if (lastReturned == null)
2352	>	Object k = nextKey;
2353	>	if (k == null && (advance() == null || (k = nextKey) == null))
2354		throw new IllegalStateException();
2355	<	ConcurrentHashMapV8.this.remove(lastReturned.key);
828	<	lastReturned = null;
2355	>	map.internalReplace(k, null, null);
2356		}
2357
2358	<	/** Helper for serialization */
2359	<	final void writeEntries(java.io.ObjectOutputStream s)
833	<	throws java.io.IOException {
834	<	Node e;
835	<	while ((e = next) != null) {
836	<	s.writeObject(e.key);
837	<	s.writeObject(nextVal);
838	<	advance(e.next);
839	<	}
2358	>	public final boolean hasNext() {
2359	>	return nextVal != null || advance() != null;
2360		}
2361
2362	<	/** Helper for containsValue */
843	<	final boolean containsVal(Object value) {
844	<	if (value != null) {
845	<	Node e;
846	<	while ((e = next) != null) {
847	<	Object v = nextVal;
848	<	if (value == v || value.equals(v))
849	<	return true;
850	<	advance(e.next);
851	<	}
852	<	}
853	<	return false;
854	<	}
2362	>	public final boolean hasMoreElements() { return hasNext(); }
2363
2364	<	/** Helper for Map.hashCode */
857	<	final int mapHashCode() {
858	<	int h = 0;
859	<	Node e;
860	<	while ((e = next) != null) {
861	<	h += e.key.hashCode() ^ nextVal.hashCode();
862	<	advance(e.next);
863	<	}
864	<	return h;
865	<	}
2364	>	public void compute() { } // default no-op CountedCompleter body
2365
2366	<	/** Helper for Map.toString */
2367	<	final String mapToString() {
2368	<	Node e = next;
2369	<	if (e == null)
2370	<	return "{}";
2371	<	StringBuilder sb = new StringBuilder();
2372	<	sb.append('{');
2373	<	for (;;) {
2374	<	sb.append(e.key   == this ? "(this Map)" : e.key);
2375	<	sb.append('=');
2376	<	sb.append(nextVal == this ? "(this Map)" : nextVal);
2377	<	advance(e.next);
2378	<	if ((e = next) != null)
2379	<	sb.append(',').append(' ');
2380	<	else
2381	<	return sb.append('}').toString();
2366	>	/**
2367	>	* Returns a batch value > 0 if this task should (and must) be
2368	>	* split, if so, adding to pending count, and in any case
2369	>	* updating batch value. The initial batch value is approx
2370	>	* exp2 of the number of times (minus one) to split task by
2371	>	* two before executing leaf action. This value is faster to
2372	>	* compute and more convenient to use as a guide to splitting
2373	>	* than is the depth, since it is used while dividing by two
2374	>	* anyway.
2375	>	*/
2376	>	final int preSplit() {
2377	>	ConcurrentHashMapV8<K, V> m; int b; Node<V>[] t;  ForkJoinPool pool;
2378	>	if ((b = batch) < 0 && (m = map) != null) { // force initialization
2379	>	if ((t = tab) == null && (t = tab = m.table) != null)
2380	>	baseLimit = baseSize = t.length;
2381	>	if (t != null) {
2382	>	long n = m.sumCount();
2383	>	int par = ((pool = getPool()) == null) ?
2384	>	ForkJoinPool.getCommonPoolParallelism() :
2385	>	pool.getParallelism();
2386	>	int sp = par << 3; // slack of 8
2387	>	b = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
2388	>	}
2389		}
2390	+	b = (b <= 1 || baseIndex == baseLimit) ? 0 : (b >>> 1);
2391	+	if ((batch = b) > 0)
2392	+	addToPendingCount(1);
2393	+	return b;
2394		}
2395	+
2396		}
2397
2398		/* ---------------- Public operations -------------- */
2399
2400		/**
2401	<	* Creates a new, empty map with the specified initial
891	<	* capacity, load factor and concurrency level.
892	<	*
893	<	* @param initialCapacity the initial capacity. The implementation
894	<	* performs internal sizing to accommodate this many elements.
895	<	* @param loadFactor  the load factor threshold, used to control resizing.
896	<	* Resizing may be performed when the average number of elements per
897	<	* bin exceeds this threshold.
898	<	* @param concurrencyLevel the estimated number of concurrently
899	<	* updating threads. The implementation may use this value as
900	<	* a sizing hint.
901	<	* @throws IllegalArgumentException if the initial capacity is
902	<	* negative or the load factor or concurrencyLevel are
903	<	* nonpositive.
2401	>	* Creates a new, empty map with the default initial table size (16).
2402		*/
2403	<	public ConcurrentHashMapV8(int initialCapacity,
906	<	float loadFactor, int concurrencyLevel) {
907	<	if (!(loadFactor > 0) || initialCapacity < 0 || concurrencyLevel <= 0)
908	<	throw new IllegalArgumentException();
909	<	this.initCap = initialCapacity;
910	<	this.loadFactor = loadFactor;
911	<	this.counter = new LongAdder();
2403	>	public ConcurrentHashMapV8() {
2404		}
2405
2406		/**
2407	<	* Creates a new, empty map with the specified initial capacity
2408	<	* and load factor and with the default concurrencyLevel (16).
2407	>	* Creates a new, empty map with an initial table size
2408	>	* accommodating the specified number of elements without the need
2409	>	* to dynamically resize.
2410		*
2411		* @param initialCapacity The implementation performs internal
2412		* sizing to accommodate this many elements.
2413	<	* @param loadFactor  the load factor threshold, used to control resizing.
2414	<	* Resizing may be performed when the average number of elements per
2415	<	* bin exceeds this threshold.
2413	>	* @throws IllegalArgumentException if the initial capacity of
2414	>	* elements is negative
2415	>	*/
2416	>	public ConcurrentHashMapV8(int initialCapacity) {
2417	>	if (initialCapacity < 0)
2418	>	throw new IllegalArgumentException();
2419	>	int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
2420	>	MAXIMUM_CAPACITY :
2421	>	tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
2422	>	this.sizeCtl = cap;
2423	>	}
2424	>
2425	>	/**
2426	>	* Creates a new map with the same mappings as the given map.
2427	>	*
2428	>	* @param m the map
2429	>	*/
2430	>	public ConcurrentHashMapV8(Map<? extends K, ? extends V> m) {
2431	>	this.sizeCtl = DEFAULT_CAPACITY;
2432	>	internalPutAll(m);
2433	>	}
2434	>
2435	>	/**
2436	>	* Creates a new, empty map with an initial table size based on
2437	>	* the given number of elements ({@code initialCapacity}) and
2438	>	* initial table density ({@code loadFactor}).
2439	>	*
2440	>	* @param initialCapacity the initial capacity. The implementation
2441	>	* performs internal sizing to accommodate this many elements,
2442	>	* given the specified load factor.
2443	>	* @param loadFactor the load factor (table density) for
2444	>	* establishing the initial table size
2445		* @throws IllegalArgumentException if the initial capacity of
2446		* elements is negative or the load factor is nonpositive
2447		*
2448		* @since 1.6
2449		*/
2450		public ConcurrentHashMapV8(int initialCapacity, float loadFactor) {
2451	<	this(initialCapacity, loadFactor, DEFAULT_CONCURRENCY_LEVEL);
2451	>	this(initialCapacity, loadFactor, 1);
2452		}
2453
2454		/**
2455	<	* Creates a new, empty map with the specified initial capacity,
2456	<	* and with default load factor (0.75) and concurrencyLevel (16).
2455	>	* Creates a new, empty map with an initial table size based on
2456	>	* the given number of elements ({@code initialCapacity}), table
2457	>	* density ({@code loadFactor}), and number of concurrently
2458	>	* updating threads ({@code concurrencyLevel}).
2459		*
2460		* @param initialCapacity the initial capacity. The implementation
2461	<	* performs internal sizing to accommodate this many elements.
2462	<	* @throws IllegalArgumentException if the initial capacity of
2463	<	* elements is negative.
2461	>	* performs internal sizing to accommodate this many elements,
2462	>	* given the specified load factor.
2463	>	* @param loadFactor the load factor (table density) for
2464	>	* establishing the initial table size
2465	>	* @param concurrencyLevel the estimated number of concurrently
2466	>	* updating threads. The implementation may use this value as
2467	>	* a sizing hint.
2468	>	* @throws IllegalArgumentException if the initial capacity is
2469	>	* negative or the load factor or concurrencyLevel are
2470	>	* nonpositive
2471		*/
2472	<	public ConcurrentHashMapV8(int initialCapacity) {
2473	<	this(initialCapacity, DEFAULT_LOAD_FACTOR, DEFAULT_CONCURRENCY_LEVEL);
2472	>	public ConcurrentHashMapV8(int initialCapacity,
2473	>	float loadFactor, int concurrencyLevel) {
2474	>	if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)
2475	>	throw new IllegalArgumentException();
2476	>	if (initialCapacity < concurrencyLevel)   // Use at least as many bins
2477	>	initialCapacity = concurrencyLevel;   // as estimated threads
2478	>	long size = (long)(1.0 + (long)initialCapacity / loadFactor);
2479	>	int cap = (size >= (long)MAXIMUM_CAPACITY) ?
2480	>	MAXIMUM_CAPACITY : tableSizeFor((int)size);
2481	>	this.sizeCtl = cap;
2482		}
2483
2484		/**
2485	<	* Creates a new, empty map with a default initial capacity (16),
2486	<	* load factor (0.75) and concurrencyLevel (16).
2485	>	* Creates a new {@link Set} backed by a ConcurrentHashMapV8
2486	>	* from the given type to {@code Boolean.TRUE}.
2487	>	*
2488	>	* @return the new set
2489		*/
2490	<	public ConcurrentHashMapV8() {
2491	<	this(DEFAULT_CAPACITY, DEFAULT_LOAD_FACTOR, DEFAULT_CONCURRENCY_LEVEL);
2490	>	public static <K> KeySetView<K,Boolean> newKeySet() {
2491	>	return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(),
2492	>	Boolean.TRUE);
2493		}
2494
2495		/**
2496	<	* Creates a new map with the same mappings as the given map.
2497	<	* The map is created with a capacity of 1.5 times the number
956	<	* of mappings in the given map or 16 (whichever is greater),
957	<	* and a default load factor (0.75) and concurrencyLevel (16).
2496	>	* Creates a new {@link Set} backed by a ConcurrentHashMapV8
2497	>	* from the given type to {@code Boolean.TRUE}.
2498		*
2499	<	* @param m the map
2499	>	* @param initialCapacity The implementation performs internal
2500	>	* sizing to accommodate this many elements.
2501	>	* @throws IllegalArgumentException if the initial capacity of
2502	>	* elements is negative
2503	>	* @return the new set
2504		*/
2505	<	public ConcurrentHashMapV8(Map<? extends K, ? extends V> m) {
2506	<	this(DEFAULT_CAPACITY, DEFAULT_LOAD_FACTOR, DEFAULT_CONCURRENCY_LEVEL);
2507	<	if (m == null)
964	<	throw new NullPointerException();
965	<	internalPutAll(m);
2505	>	public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
2506	>	return new KeySetView<K,Boolean>
2507	>	(new ConcurrentHashMapV8<K,Boolean>(initialCapacity), Boolean.TRUE);
2508		}
2509
2510		/**
2511	<	* Returns {@code true} if this map contains no key-value mappings.
970	<	*
971	<	* @return {@code true} if this map contains no key-value mappings
2511	>	* {@inheritDoc}
2512		*/
2513		public boolean isEmpty() {
2514	<	return counter.sum() <= 0L; // ignore transient negative values
2514	>	return sumCount() <= 0L; // ignore transient negative values
2515		}
2516
2517		/**
2518	<	* Returns the number of key-value mappings in this map.  If the
979	<	* map contains more than {@code Integer.MAX_VALUE} elements, returns
980	<	* {@code Integer.MAX_VALUE}.
981	<	*
982	<	* @return the number of key-value mappings in this map
2518	>	* {@inheritDoc}
2519		*/
2520		public int size() {
2521	<	long n = counter.sum();
2522	<	return n <= 0L? 0 : n >= Integer.MAX_VALUE ? Integer.MAX_VALUE : (int)n;
2521	>	long n = sumCount();
2522	>	return ((n < 0L) ? 0 :
2523	>	(n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
2524	>	(int)n);
2525	>	}
2526	>
2527	>	/**
2528	>	* Returns the number of mappings. This method should be used
2529	>	* instead of {@link #size} because a ConcurrentHashMapV8 may
2530	>	* contain more mappings than can be represented as an int. The
2531	>	* value returned is an estimate; the actual count may differ if
2532	>	* there are concurrent insertions or removals.
2533	>	*
2534	>	* @return the number of mappings
2535	>	*/
2536	>	public long mappingCount() {
2537	>	long n = sumCount();
2538	>	return (n < 0L) ? 0L : n; // ignore transient negative values
2539		}
2540
2541		/**
#	Line 997 | Line 2549 | public class ConcurrentHashMapV8<K, V>
2549		*
2550		* @throws NullPointerException if the specified key is null
2551		*/
1000	–	@SuppressWarnings("unchecked")
2552		public V get(Object key) {
2553	<	if (key == null)
2554	<	throw new NullPointerException();
2555	<	return (V)internalGet(key);
2553	>	return internalGet(key);
2554	>	}
2555	>
2556	>	/**
2557	>	* Returns the value to which the specified key is mapped,
2558	>	* or the given defaultValue if this map contains no mapping for the key.
2559	>	*
2560	>	* @param key the key
2561	>	* @param defaultValue the value to return if this map contains
2562	>	* no mapping for the given key
2563	>	* @return the mapping for the key, if present; else the defaultValue
2564	>	* @throws NullPointerException if the specified key is null
2565	>	*/
2566	>	public V getValueOrDefault(Object key, V defaultValue) {
2567	>	V v;
2568	>	return (v = internalGet(key)) == null ? defaultValue : v;
2569		}
2570
2571		/**
#	Line 1010 | Line 2574 | public class ConcurrentHashMapV8<K, V>
2574		* @param  key   possible key
2575		* @return {@code true} if and only if the specified object
2576		*         is a key in this table, as determined by the
2577	<	*         {@code equals} method; {@code false} otherwise.
2577	>	*         {@code equals} method; {@code false} otherwise
2578		* @throws NullPointerException if the specified key is null
2579		*/
2580		public boolean containsKey(Object key) {
1017	–	if (key == null)
1018	–	throw new NullPointerException();
2581		return internalGet(key) != null;
2582		}
2583
2584		/**
2585		* Returns {@code true} if this map maps one or more keys to the
2586	<	* specified value. Note: This method requires a full internal
2587	<	* traversal of the hash table, and so is much slower than
1026	<	* method {@code containsKey}.
2586	>	* specified value. Note: This method may require a full traversal
2587	>	* of the map, and is much slower than method {@code containsKey}.
2588		*
2589		* @param value value whose presence in this map is to be tested
2590		* @return {@code true} if this map maps one or more keys to the
#	Line 1033 | Line 2594 | public class ConcurrentHashMapV8<K, V>
2594		public boolean containsValue(Object value) {
2595		if (value == null)
2596		throw new NullPointerException();
2597	<	return new HashIterator().containsVal(value);
2597	>	V v;
2598	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2599	>	while ((v = it.advance()) != null) {
2600	>	if (v == value || value.equals(v))
2601	>	return true;
2602	>	}
2603	>	return false;
2604		}
2605
2606		/**
#	Line 1051 | Line 2618 | public class ConcurrentHashMapV8<K, V>
2618		*         {@code false} otherwise
2619		* @throws NullPointerException if the specified value is null
2620		*/
2621	<	public boolean contains(Object value) {
2621	>	@Deprecated public boolean contains(Object value) {
2622		return containsValue(value);
2623		}
2624
#	Line 1059 | Line 2626 | public class ConcurrentHashMapV8<K, V>
2626		* Maps the specified key to the specified value in this table.
2627		* Neither the key nor the value can be null.
2628		*
2629	<	* <p> The value can be retrieved by calling the {@code get} method
2629	>	* <p>The value can be retrieved by calling the {@code get} method
2630		* with a key that is equal to the original key.
2631		*
2632		* @param key key with which the specified value is to be associated
#	Line 1068 | Line 2635 | public class ConcurrentHashMapV8<K, V>
2635		*         {@code null} if there was no mapping for {@code key}
2636		* @throws NullPointerException if the specified key or value is null
2637		*/
1071	–	@SuppressWarnings("unchecked")
2638		public V put(K key, V value) {
2639	<	if (key == null || value == null)
1074	<	throw new NullPointerException();
1075	<	return (V)internalPut(key, value, true);
2639	>	return internalPut(key, value, false);
2640		}
2641
2642		/**
#	Line 1082 | Line 2646 | public class ConcurrentHashMapV8<K, V>
2646		*         or {@code null} if there was no mapping for the key
2647		* @throws NullPointerException if the specified key or value is null
2648		*/
1085	–	@SuppressWarnings("unchecked")
2649		public V putIfAbsent(K key, V value) {
2650	<	if (key == null || value == null)
1088	<	throw new NullPointerException();
1089	<	return (V)internalPut(key, value, false);
2650	>	return internalPut(key, value, true);
2651		}
2652
2653		/**
#	Line 1097 | Line 2658 | public class ConcurrentHashMapV8<K, V>
2658		* @param m mappings to be stored in this map
2659		*/
2660		public void putAll(Map<? extends K, ? extends V> m) {
1100	–	if (m == null)
1101	–	throw new NullPointerException();
2661		internalPutAll(m);
2662		}
2663
2664		/**
2665		* If the specified key is not already associated with a value,
2666	<	* computes its value using the given mappingFunction, and if
2667	<	* non-null, enters it into the map.  This is equivalent to
2668	<	*
2669	<	* <pre>
2670	<	*   if (map.containsKey(key))
2671	<	*       return map.get(key);
2672	<	*   value = mappingFunction.map(key);
2673	<	*   if (value != null)
2674	<	*      map.put(key, value);
2675	<	*   return value;
2676	<	* </pre>
2677	<	*
2678	<	* except that the action is performed atomically.  Some attempted
2679	<	* operations on this map by other threads may be blocked while
2680	<	* computation is in progress, so the computation should be short
2681	<	* and simple, and must not attempt to update any other mappings
2682	<	* of this Map. The most common usage is to construct a new object
2683	<	* serving as an initial mapped value, or memoized result.
2666	>	* computes its value using the given mappingFunction and enters
2667	>	* it into the map unless null.  This is equivalent to
2668	>	* <pre> {@code
2669	>	* if (map.containsKey(key))
2670	>	*   return map.get(key);
2671	>	* value = mappingFunction.apply(key);
2672	>	* if (value != null)
2673	>	*   map.put(key, value);
2674	>	* return value;}</pre>
2675	>	*
2676	>	* except that the action is performed atomically.  If the
2677	>	* function returns {@code null} no mapping is recorded. If the
2678	>	* function itself throws an (unchecked) exception, the exception
2679	>	* is rethrown to its caller, and no mapping is recorded.  Some
2680	>	* attempted update operations on this map by other threads may be
2681	>	* blocked while computation is in progress, so the computation
2682	>	* should be short and simple, and must not attempt to update any
2683	>	* other mappings of this Map. The most appropriate usage is to
2684	>	* construct a new object serving as an initial mapped value, or
2685	>	* memoized result, as in:
2686	>	*
2687	>	*  <pre> {@code
2688	>	* map.computeIfAbsent(key, new Fun<K, V>() {
2689	>	*   public V map(K k) { return new Value(f(k)); }});}</pre>
2690		*
2691		* @param key key with which the specified value is to be associated
2692		* @param mappingFunction the function to compute a value
2693		* @return the current (existing or computed) value associated with
2694	<	*         the specified key, or {@code null} if the computation
1130	<	*         returned {@code null}.
2694	>	*         the specified key, or null if the computed value is null
2695		* @throws NullPointerException if the specified key or mappingFunction
2696	<	*         is null,
2696	>	*         is null
2697	>	* @throws IllegalStateException if the computation detectably
2698	>	*         attempts a recursive update to this map that would
2699	>	*         otherwise never complete
2700		* @throws RuntimeException or Error if the mappingFunction does so,
2701	<	*         in which case the mapping is left unestablished.
2701	>	*         in which case the mapping is left unestablished
2702		*/
2703	<	public V computeIfAbsent(K key, MappingFunction<? super K, ? extends V> mappingFunction) {
2704	<	if (key == null || mappingFunction == null)
2705	<	throw new NullPointerException();
1139	<	return internalCompute(key, mappingFunction, false);
2703	>	public V computeIfAbsent
2704	>	(K key, Fun<? super K, ? extends V> mappingFunction) {
2705	>	return internalComputeIfAbsent(key, mappingFunction);
2706		}
2707
2708		/**
2709	<	* Computes the value associated with he given key using the given
2710	<	* mappingFunction, and if non-null, enters it into the map.  This
2711	<	* is equivalent to
2709	>	* If the given key is present, computes a new mapping value given a key and
2710	>	* its current mapped value. This is equivalent to
2711	>	*  <pre> {@code
2712	>	*   if (map.containsKey(key)) {
2713	>	*     value = remappingFunction.apply(key, map.get(key));
2714	>	*     if (value != null)
2715	>	*       map.put(key, value);
2716	>	*     else
2717	>	*       map.remove(key);
2718	>	*   }
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>
2732	<	*   value = mappingFunction.map(key);
2731	>	* @param key key with which the specified value is to be associated
2732	>	* @param remappingFunction the function to compute a value
2733	>	* @return the new value associated with the specified key, or null if none
2734	>	* @throws NullPointerException if the specified key or remappingFunction
2735	>	*         is null
2736	>	* @throws IllegalStateException if the computation detectably
2737	>	*         attempts a recursive update to this map that would
2738	>	*         otherwise never complete
2739	>	* @throws RuntimeException or Error if the remappingFunction does so,
2740	>	*         in which case the mapping is unchanged
2741	>	*/
2742	>	public V computeIfPresent
2743	>	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2744	>	return internalCompute(key, true, remappingFunction);
2745	>	}
2746	>
2747	>	/**
2748	>	* Computes a new mapping value given a key and
2749	>	* its current mapped value (or {@code null} if there is no current
2750	>	* mapping). This is equivalent to
2751	>	*  <pre> {@code
2752	>	*   value = remappingFunction.apply(key, map.get(key));
2753		*   if (value != null)
2754	<	*      map.put(key, value);
2754	>	*     map.put(key, value);
2755		*   else
2756	<	*      return map.get(key);
2757	<	* </pre>
2756	>	*     map.remove(key);
2757	>	* }</pre>
2758		*
2759	<	* except that the action is performed atomically.  Some attempted
2760	<	* operations on this map by other threads may be blocked while
2761	<	* computation is in progress, so the computation should be short
2762	<	* and simple, and must not attempt to update any other mappings
2763	<	* of this Map.
2759	>	* except that the action is performed atomically.  If the
2760	>	* function returns {@code null}, the mapping is removed.  If the
2761	>	* function itself throws an (unchecked) exception, the exception
2762	>	* is rethrown to its caller, and the current mapping is left
2763	>	* unchanged.  Some attempted update operations on this map by
2764	>	* other threads may be blocked while computation is in progress,
2765	>	* so the computation should be short and simple, and must not
2766	>	* attempt to update any other mappings of this Map. For example,
2767	>	* to either create or append new messages to a value mapping:
2768	>	*
2769	>	* <pre> {@code
2770	>	* Map<Key, String> map = ...;
2771	>	* final String msg = ...;
2772	>	* map.compute(key, new BiFun<Key, String, String>() {
2773	>	*   public String apply(Key k, String v) {
2774	>	*    return (v == null) ? msg : v + msg;});}}</pre>
2775		*
2776		* @param key key with which the specified value is to be associated
2777	<	* @param mappingFunction the function to compute a value
2778	<	* @return the current value associated with
2779	<	*         the specified key, or {@code null} if the computation
2780	<	*         returned {@code null} and the value was not otherwise present.
2781	<	* @throws NullPointerException if the specified key or mappingFunction
2782	<	*         is null,
2783	<	* @throws RuntimeException or Error if the mappingFunction does so,
2784	<	*         in which case the mapping is unchanged.
2785	<	*/
2786	<	public V compute(K key, MappingFunction<? super K, ? extends V> mappingFunction) {
2787	<	if (key == null || mappingFunction == null)
2788	<	throw new NullPointerException();
2789	<	return internalCompute(key, mappingFunction, true);
2777	>	* @param remappingFunction the function to compute a value
2778	>	* @return the new value associated with the specified key, or null if none
2779	>	* @throws NullPointerException if the specified key or remappingFunction
2780	>	*         is null
2781	>	* @throws IllegalStateException if the computation detectably
2782	>	*         attempts a recursive update to this map that would
2783	>	*         otherwise never complete
2784	>	* @throws RuntimeException or Error if the remappingFunction does so,
2785	>	*         in which case the mapping is unchanged
2786	>	*/
2787	>	public V compute
2788	>	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2789	>	return internalCompute(key, false, remappingFunction);
2790	>	}
2791	>
2792	>	/**
2793	>	* If the specified key is not already associated
2794	>	* with a value, associate it with the given value.
2795	>	* Otherwise, replace the value with the results of
2796	>	* the given remapping function. This is equivalent to:
2797	>	*  <pre> {@code
2798	>	*   if (!map.containsKey(key))
2799	>	*     map.put(value);
2800	>	*   else {
2801	>	*     newValue = remappingFunction.apply(map.get(key), value);
2802	>	*     if (value != null)
2803	>	*       map.put(key, value);
2804	>	*     else
2805	>	*       map.remove(key);
2806	>	*   }
2807	>	* }</pre>
2808	>	* except that the action is performed atomically.  If the
2809	>	* function returns {@code null}, the mapping is removed.  If the
2810	>	* function itself throws an (unchecked) exception, the exception
2811	>	* is rethrown to its caller, and the current mapping is left
2812	>	* unchanged.  Some attempted update operations on this map by
2813	>	* other threads may be blocked while computation is in progress,
2814	>	* so the computation should be short and simple, and must not
2815	>	* attempt to update any other mappings of this Map.
2816	>	*/
2817	>	public V merge
2818	>	(K key, V value,
2819	>	BiFun<? super V, ? super V, ? extends V> remappingFunction) {
2820	>	return internalMerge(key, value, remappingFunction);
2821		}
2822
2823		/**
#	Line 1183 | Line 2829 | public class ConcurrentHashMapV8<K, V>
2829		*         {@code null} if there was no mapping for {@code key}
2830		* @throws NullPointerException if the specified key is null
2831		*/
1186	–	@SuppressWarnings("unchecked")
2832		public V remove(Object key) {
2833	<	if (key == null)
1189	<	throw new NullPointerException();
1190	<	return (V)internalReplace(key, null, null);
2833	>	return internalReplace(key, null, null);
2834		}
2835
2836		/**
#	Line 1196 | Line 2839 | public class ConcurrentHashMapV8<K, V>
2839		* @throws NullPointerException if the specified key is null
2840		*/
2841		public boolean remove(Object key, Object value) {
2842	<	if (key == null)
1200	<	throw new NullPointerException();
1201	<	if (value == null)
1202	<	return false;
1203	<	return internalReplace(key, null, value) != null;
2842	>	return value != null && internalReplace(key, null, value) != null;
2843		}
2844
2845		/**
#	Line 1221 | Line 2860 | public class ConcurrentHashMapV8<K, V>
2860		*         or {@code null} if there was no mapping for the key
2861		* @throws NullPointerException if the specified key or value is null
2862		*/
1224	–	@SuppressWarnings("unchecked")
2863		public V replace(K key, V value) {
2864		if (key == null || value == null)
2865		throw new NullPointerException();
2866	<	return (V)internalReplace(key, value, null);
2866	>	return internalReplace(key, value, null);
2867		}
2868
2869		/**
#	Line 1238 | Line 2876 | public class ConcurrentHashMapV8<K, V>
2876		/**
2877		* Returns a {@link Set} view of the keys contained in this map.
2878		* The set is backed by the map, so changes to the map are
2879	<	* reflected in the set, and vice-versa.  The set supports element
1242	<	* removal, which removes the corresponding mapping from this map,
1243	<	* via the {@code Iterator.remove}, {@code Set.remove},
1244	<	* {@code removeAll}, {@code retainAll}, and {@code clear}
1245	<	* operations.  It does not support the {@code add} or
1246	<	* {@code addAll} operations.
2879	>	* reflected in the set, and vice-versa.
2880		*
2881	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
1249	<	* that will never throw {@link ConcurrentModificationException},
1250	<	* and guarantees to traverse elements as they existed upon
1251	<	* construction of the iterator, and may (but is not guaranteed to)
1252	<	* reflect any modifications subsequent to construction.
2881	>	* @return the set view
2882		*/
2883	<	public Set<K> keySet() {
2884	<	Set<K> ks = keySet;
2885	<	return (ks != null) ? ks : (keySet = new KeySet());
2883	>	public KeySetView<K,V> keySet() {
2884	>	KeySetView<K,V> ks = keySet;
2885	>	return (ks != null) ? ks : (keySet = new KeySetView<K,V>(this, null));
2886	>	}
2887	>
2888	>	/**
2889	>	* Returns a {@link Set} view of the keys in this map, using the
2890	>	* given common mapped value for any additions (i.e., {@link
2891	>	* Collection#add} and {@link Collection#addAll}). This is of
2892	>	* course only appropriate if it is acceptable to use the same
2893	>	* value for all additions from this view.
2894	>	*
2895	>	* @param mappedValue the mapped value to use for any
2896	>	* additions.
2897	>	* @return the set view
2898	>	* @throws NullPointerException if the mappedValue is null
2899	>	*/
2900	>	public KeySetView<K,V> keySet(V mappedValue) {
2901	>	if (mappedValue == null)
2902	>	throw new NullPointerException();
2903	>	return new KeySetView<K,V>(this, mappedValue);
2904		}
2905
2906		/**
2907		* Returns a {@link Collection} view of the values contained in this map.
2908		* The collection is backed by the map, so changes to the map are
2909	<	* reflected in the collection, and vice-versa.  The collection
1263	<	* supports element removal, which removes the corresponding
1264	<	* mapping from this map, via the {@code Iterator.remove},
1265	<	* {@code Collection.remove}, {@code removeAll},
1266	<	* {@code retainAll}, and {@code clear} operations.  It does not
1267	<	* support the {@code add} or {@code addAll} operations.
1268	<	*
1269	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
1270	<	* that will never throw {@link ConcurrentModificationException},
1271	<	* and guarantees to traverse elements as they existed upon
1272	<	* construction of the iterator, and may (but is not guaranteed to)
1273	<	* reflect any modifications subsequent to construction.
2909	>	* reflected in the collection, and vice-versa.
2910		*/
2911	<	public Collection<V> values() {
2912	<	Collection<V> vs = values;
2913	<	return (vs != null) ? vs : (values = new Values());
2911	>	public ValuesView<K,V> values() {
2912	>	ValuesView<K,V> vs = values;
2913	>	return (vs != null) ? vs : (values = new ValuesView<K,V>(this));
2914		}
2915
2916		/**
#	Line 1294 | Line 2930 | public class ConcurrentHashMapV8<K, V>
2930		* reflect any modifications subsequent to construction.
2931		*/
2932		public Set<Map.Entry<K,V>> entrySet() {
2933	<	Set<Map.Entry<K,V>> es = entrySet;
2934	<	return (es != null) ? es : (entrySet = new EntrySet());
2933	>	EntrySetView<K,V> es = entrySet;
2934	>	return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this));
2935		}
2936
2937		/**
#	Line 1305 | Line 2941 | public class ConcurrentHashMapV8<K, V>
2941		* @see #keySet()
2942		*/
2943		public Enumeration<K> keys() {
2944	<	return new KeyIterator();
2944	>	return new KeyIterator<K,V>(this);
2945		}
2946
2947		/**
#	Line 1315 | Line 2951 | public class ConcurrentHashMapV8<K, V>
2951		* @see #values()
2952		*/
2953		public Enumeration<V> elements() {
2954	<	return new ValueIterator();
2954	>	return new ValueIterator<K,V>(this);
2955	>	}
2956	>
2957	>	/**
2958	>	* Returns a partitionable iterator of the keys in this map.
2959	>	*
2960	>	* @return a partitionable iterator of the keys in this map
2961	>	*/
2962	>	public Spliterator<K> keySpliterator() {
2963	>	return new KeyIterator<K,V>(this);
2964	>	}
2965	>
2966	>	/**
2967	>	* Returns a partitionable iterator of the values in this map.
2968	>	*
2969	>	* @return a partitionable iterator of the values in this map
2970	>	*/
2971	>	public Spliterator<V> valueSpliterator() {
2972	>	return new ValueIterator<K,V>(this);
2973	>	}
2974	>
2975	>	/**
2976	>	* Returns a partitionable iterator of the entries in this map.
2977	>	*
2978	>	* @return a partitionable iterator of the entries in this map
2979	>	*/
2980	>	public Spliterator<Map.Entry<K,V>> entrySpliterator() {
2981	>	return new EntryIterator<K,V>(this);
2982		}
2983
2984		/**
#	Line 1326 | Line 2989 | public class ConcurrentHashMapV8<K, V>
2989		* @return the hash code value for this map
2990		*/
2991		public int hashCode() {
2992	<	return new HashIterator().mapHashCode();
2992	>	int h = 0;
2993	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2994	>	V v;
2995	>	while ((v = it.advance()) != null) {
2996	>	h += it.nextKey.hashCode() ^ v.hashCode();
2997	>	}
2998	>	return h;
2999		}
3000
3001		/**
#	Line 1341 | Line 3010 | public class ConcurrentHashMapV8<K, V>
3010		* @return a string representation of this map
3011		*/
3012		public String toString() {
3013	<	return new HashIterator().mapToString();
3013	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3014	>	StringBuilder sb = new StringBuilder();
3015	>	sb.append('{');
3016	>	V v;
3017	>	if ((v = it.advance()) != null) {
3018	>	for (;;) {
3019	>	Object k = it.nextKey;
3020	>	sb.append(k == this ? "(this Map)" : k);
3021	>	sb.append('=');
3022	>	sb.append(v == this ? "(this Map)" : v);
3023	>	if ((v = it.advance()) == null)
3024	>	break;
3025	>	sb.append(',').append(' ');
3026	>	}
3027	>	}
3028	>	return sb.append('}').toString();
3029		}
3030
3031		/**
#	Line 1355 | Line 3039 | public class ConcurrentHashMapV8<K, V>
3039		* @return {@code true} if the specified object is equal to this map
3040		*/
3041		public boolean equals(Object o) {
3042	<	if (o == this)
3043	<	return true;
3044	<	if (!(o instanceof Map))
3045	<	return false;
3046	<	Map<?,?> m = (Map<?,?>) o;
3047	<	try {
3048	<	for (Map.Entry<K,V> e : this.entrySet())
3049	<	if (! e.getValue().equals(m.get(e.getKey())))
3042	>	if (o != this) {
3043	>	if (!(o instanceof Map))
3044	>	return false;
3045	>	Map<?,?> m = (Map<?,?>) o;
3046	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3047	>	V val;
3048	>	while ((val = it.advance()) != null) {
3049	>	Object v = m.get(it.nextKey);
3050	>	if (v == null || (v != val && !v.equals(val)))
3051		return false;
3052	+	}
3053		for (Map.Entry<?,?> e : m.entrySet()) {
3054	<	Object k = e.getKey();
3055	<	Object v = e.getValue();
3056	<	if (k == null || v == null || !v.equals(get(k)))
3054	>	Object mk, mv, v;
3055	>	if ((mk = e.getKey()) == null ||
3056	>	(mv = e.getValue()) == null ||
3057	>	(v = internalGet(mk)) == null ||
3058	>	(mv != v && !mv.equals(v)))
3059		return false;
3060		}
1373	–	return true;
1374	–	} catch (ClassCastException unused) {
1375	–	return false;
1376	–	} catch (NullPointerException unused) {
1377	–	return false;
3061		}
3062	+	return true;
3063		}
3064
3065	<	/**
1382	<	* Custom Entry class used by EntryIterator.next(), that relays
1383	<	* setValue changes to the underlying map.
1384	<	*/
1385	<	final class WriteThroughEntry extends AbstractMap.SimpleEntry<K,V> {
1386	<	@SuppressWarnings("unchecked")
1387	<	WriteThroughEntry(Object k, Object v) {
1388	<	super((K)k, (V)v);
1389	<	}
3065	>	/* ----------------Iterators -------------- */
3066
3067	<	/**
3068	<	* Sets our entry's value and writes through to the map. The
3069	<	* value to return is somewhat arbitrary here. Since a
3070	<	* WriteThroughEntry does not necessarily track asynchronous
3071	<	* changes, the most recent "previous" value could be
3072	<	* different from what we return (or could even have been
3073	<	* removed in which case the put will re-establish). We do not
3074	<	* and cannot guarantee more.
3075	<	*/
3076	<	public V setValue(V value) {
3077	<	if (value == null) throw new NullPointerException();
3078	<	V v = super.setValue(value);
3079	<	ConcurrentHashMapV8.this.put(getKey(), value);
3080	<	return v;
3067	>	@SuppressWarnings("serial") static final class KeyIterator<K,V>
3068	>	extends Traverser<K,V,Object>
3069	>	implements Spliterator<K>, Enumeration<K> {
3070	>	KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3071	>	KeyIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
3072	>	super(map, it, -1);
3073	>	}
3074	>	public KeyIterator<K,V> split() {
3075	>	if (nextKey != null)
3076	>	throw new IllegalStateException();
3077	>	return new KeyIterator<K,V>(map, this);
3078	>	}
3079	>	@SuppressWarnings("unchecked") public final K next() {
3080	>	if (nextVal == null && advance() == null)
3081	>	throw new NoSuchElementException();
3082	>	Object k = nextKey;
3083	>	nextVal = null;
3084	>	return (K) k;
3085		}
1406	–	}
1407	–
1408	–	final class KeyIterator extends HashIterator
1409	–	implements Iterator<K>, Enumeration<K> {
1410	–	@SuppressWarnings("unchecked")
1411	–	public final K next()        { return (K)super.nextKey(); }
1412	–	@SuppressWarnings("unchecked")
1413	–	public final K nextElement() { return (K)super.nextKey(); }
1414	–	}
1415	–
1416	–	final class ValueIterator extends HashIterator
1417	–	implements Iterator<V>, Enumeration<V> {
1418	–	@SuppressWarnings("unchecked")
1419	–	public final V next()        { return (V)super.nextValue(); }
1420	–	@SuppressWarnings("unchecked")
1421	–	public final V nextElement() { return (V)super.nextValue(); }
1422	–	}
3086
3087	<	final class EntryIterator extends HashIterator
1425	<	implements Iterator<Entry<K,V>> {
1426	<	public final Map.Entry<K,V> next() { return super.nextEntry(); }
3087	>	public final K nextElement() { return next(); }
3088		}
3089
3090	<	final class KeySet extends AbstractSet<K> {
3091	<	public int size() {
3092	<	return ConcurrentHashMapV8.this.size();
3090	>	@SuppressWarnings("serial") static final class ValueIterator<K,V>
3091	>	extends Traverser<K,V,Object>
3092	>	implements Spliterator<V>, Enumeration<V> {
3093	>	ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3094	>	ValueIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
3095	>	super(map, it, -1);
3096		}
3097	<	public boolean isEmpty() {
3098	<	return ConcurrentHashMapV8.this.isEmpty();
3099	<	}
3100	<	public void clear() {
1437	<	ConcurrentHashMapV8.this.clear();
1438	<	}
1439	<	public Iterator<K> iterator() {
1440	<	return new KeyIterator();
1441	<	}
1442	<	public boolean contains(Object o) {
1443	<	return ConcurrentHashMapV8.this.containsKey(o);
3097	>	public ValueIterator<K,V> split() {
3098	>	if (nextKey != null)
3099	>	throw new IllegalStateException();
3100	>	return new ValueIterator<K,V>(map, this);
3101		}
3102	<	public boolean remove(Object o) {
3103	<	return ConcurrentHashMapV8.this.remove(o) != null;
3102	>
3103	>	public final V next() {
3104	>	V v;
3105	>	if ((v = nextVal) == null && (v = advance()) == null)
3106	>	throw new NoSuchElementException();
3107	>	nextVal = null;
3108	>	return v;
3109		}
3110	+
3111	+	public final V nextElement() { return next(); }
3112		}
3113
3114	<	final class Values extends AbstractCollection<V> {
3115	<	public int size() {
3116	<	return ConcurrentHashMapV8.this.size();
3117	<	}
3118	<	public boolean isEmpty() {
3119	<	return ConcurrentHashMapV8.this.isEmpty();
3114	>	@SuppressWarnings("serial") static final class EntryIterator<K,V>
3115	>	extends Traverser<K,V,Object>
3116	>	implements Spliterator<Map.Entry<K,V>> {
3117	>	EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3118	>	EntryIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
3119	>	super(map, it, -1);
3120		}
3121	<	public void clear() {
3122	<	ConcurrentHashMapV8.this.clear();
3123	<	}
3124	<	public Iterator<V> iterator() {
1461	<	return new ValueIterator();
3121	>	public EntryIterator<K,V> split() {
3122	>	if (nextKey != null)
3123	>	throw new IllegalStateException();
3124	>	return new EntryIterator<K,V>(map, this);
3125		}
3126	<	public boolean contains(Object o) {
3127	<	return ConcurrentHashMapV8.this.containsValue(o);
3126	>
3127	>	@SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
3128	>	V v;
3129	>	if ((v = nextVal) == null && (v = advance()) == null)
3130	>	throw new NoSuchElementException();
3131	>	Object k = nextKey;
3132	>	nextVal = null;
3133	>	return new MapEntry<K,V>((K)k, v, map);
3134		}
3135		}
3136
3137	<	final class EntrySet extends AbstractSet<Map.Entry<K,V>> {
3138	<	public int size() {
3139	<	return ConcurrentHashMapV8.this.size();
3140	<	}
3141	<	public boolean isEmpty() {
3142	<	return ConcurrentHashMapV8.this.isEmpty();
3143	<	}
3144	<	public void clear() {
3145	<	ConcurrentHashMapV8.this.clear();
3146	<	}
3147	<	public Iterator<Map.Entry<K,V>> iterator() {
1479	<	return new EntryIterator();
3137	>	/**
3138	>	* Exported Entry for iterators
3139	>	*/
3140	>	static final class MapEntry<K,V> implements Map.Entry<K, V> {
3141	>	final K key; // non-null
3142	>	V val;       // non-null
3143	>	final ConcurrentHashMapV8<K, V> map;
3144	>	MapEntry(K key, V val, ConcurrentHashMapV8<K, V> map) {
3145	>	this.key = key;
3146	>	this.val = val;
3147	>	this.map = map;
3148		}
3149	<	public boolean contains(Object o) {
3150	<	if (!(o instanceof Map.Entry))
3151	<	return false;
3152	<	Map.Entry<?,?> e = (Map.Entry<?,?>)o;
3153	<	V v = ConcurrentHashMapV8.this.get(e.getKey());
3154	<	return v != null && v.equals(e.getValue());
3149	>	public final K getKey()       { return key; }
3150	>	public final V getValue()     { return val; }
3151	>	public final int hashCode()   { return key.hashCode() ^ val.hashCode(); }
3152	>	public final String toString(){ return key + "=" + val; }
3153	>
3154	>	public final boolean equals(Object o) {
3155	>	Object k, v; Map.Entry<?,?> e;
3156	>	return ((o instanceof Map.Entry) &&
3157	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3158	>	(v = e.getValue()) != null &&
3159	>	(k == key || k.equals(key)) &&
3160	>	(v == val || v.equals(val)));
3161		}
3162	<	public boolean remove(Object o) {
3163	<	if (!(o instanceof Map.Entry))
3164	<	return false;
3165	<	Map.Entry<?,?> e = (Map.Entry<?,?>)o;
3166	<	return ConcurrentHashMapV8.this.remove(e.getKey(), e.getValue());
3162	>
3163	>	/**
3164	>	* Sets our entry's value and writes through to the map. The
3165	>	* value to return is somewhat arbitrary here. Since we do not
3166	>	* necessarily track asynchronous changes, the most recent
3167	>	* "previous" value could be different from what we return (or
3168	>	* could even have been removed in which case the put will
3169	>	* re-establish). We do not and cannot guarantee more.
3170	>	*/
3171	>	public final V setValue(V value) {
3172	>	if (value == null) throw new NullPointerException();
3173	>	V v = val;
3174	>	val = value;
3175	>	map.put(key, value);
3176	>	return v;
3177		}
3178		}
3179
3180	+	/**
3181	+	* Returns exportable snapshot entry for the given key and value
3182	+	* when write-through can't or shouldn't be used.
3183	+	*/
3184	+	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
3185	+	return new AbstractMap.SimpleEntry<K,V>(k, v);
3186	+	}
3187	+
3188		/* ---------------- Serialization Support -------------- */
3189
3190		/**
3191	<	* Helper class used in previous version, declared for the sake of
3192	<	* serialization compatibility
3191	>	* Stripped-down version of helper class used in previous version,
3192	>	* declared for the sake of serialization compatibility
3193		*/
3194	<	static class Segment<K,V> extends java.util.concurrent.locks.ReentrantLock
1503	<	implements Serializable {
3194	>	static class Segment<K,V> implements Serializable {
3195		private static final long serialVersionUID = 2249069246763182397L;
3196		final float loadFactor;
3197		Segment(float lf) { this.loadFactor = lf; }
#	Line 1515 | Line 3206 | public class ConcurrentHashMapV8<K, V>
3206		* for each key-value mapping, followed by a null pair.
3207		* The key-value mappings are emitted in no particular order.
3208		*/
3209	<	@SuppressWarnings("unchecked")
3210	<	private void writeObject(java.io.ObjectOutputStream s)
3211	<	throws java.io.IOException {
3209	>	@SuppressWarnings("unchecked") private void writeObject
3210	>	(java.io.ObjectOutputStream s)
3211	>	throws java.io.IOException {
3212		if (segments == null) { // for serialization compatibility
3213		segments = (Segment<K,V>[])
3214		new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
3215		for (int i = 0; i < segments.length; ++i)
3216	<	segments[i] = new Segment<K,V>(loadFactor);
3216	>	segments[i] = new Segment<K,V>(LOAD_FACTOR);
3217		}
3218		s.defaultWriteObject();
3219	<	new HashIterator().writeEntries(s);
3219	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3220	>	V v;
3221	>	while ((v = it.advance()) != null) {
3222	>	s.writeObject(it.nextKey);
3223	>	s.writeObject(v);
3224	>	}
3225		s.writeObject(null);
3226		s.writeObject(null);
3227		segments = null; // throw away
3228		}
3229
3230		/**
3231	<	* Reconstitutes the  instance from a
1536	<	* stream (i.e., deserializes it).
3231	>	* Reconstitutes the instance from a stream (that is, deserializes it).
3232		* @param s the stream
3233		*/
3234	<	@SuppressWarnings("unchecked")
3235	<	private void readObject(java.io.ObjectInputStream s)
3236	<	throws java.io.IOException, ClassNotFoundException {
3234	>	@SuppressWarnings("unchecked") private void readObject
3235	>	(java.io.ObjectInputStream s)
3236	>	throws java.io.IOException, ClassNotFoundException {
3237		s.defaultReadObject();
1543	–	// find load factor in a segment, if one exists
1544	–	if (segments != null && segments.length != 0)
1545	–	this.loadFactor = segments[0].loadFactor;
1546	–	else
1547	–	this.loadFactor = DEFAULT_LOAD_FACTOR;
1548	–	this.initCap = DEFAULT_CAPACITY;
1549	–	LongAdder ct = new LongAdder(); // force final field write
1550	–	UNSAFE.putObjectVolatile(this, counterOffset, ct);
3238		this.segments = null; // unneeded
3239
3240	<	// Read the keys and values, and put the mappings in the table
3240	>	// Create all nodes, then place in table once size is known
3241	>	long size = 0L;
3242	>	Node<V> p = null;
3243		for (;;) {
3244	<	K key = (K) s.readObject();
3245	<	V value = (V) s.readObject();
3246	<	if (key == null)
3244	>	K k = (K) s.readObject();
3245	>	V v = (V) s.readObject();
3246	>	if (k != null && v != null) {
3247	>	int h = spread(k.hashCode());
3248	>	p = new Node<V>(h, k, v, p);
3249	>	++size;
3250	>	}
3251	>	else
3252		break;
3253	<	put(key, value);
3253	>	}
3254	>	if (p != null) {
3255	>	boolean init = false;
3256	>	int n;
3257	>	if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
3258	>	n = MAXIMUM_CAPACITY;
3259	>	else {
3260	>	int sz = (int)size;
3261	>	n = tableSizeFor(sz + (sz >>> 1) + 1);
3262	>	}
3263	>	int sc = sizeCtl;
3264	>	boolean collide = false;
3265	>	if (n > sc &&
3266	>	U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
3267	>	try {
3268	>	if (table == null) {
3269	>	init = true;
3270	>	@SuppressWarnings("rawtypes") Node[] rt = new Node[n];
3271	>	Node<V>[] tab = (Node<V>[])rt;
3272	>	int mask = n - 1;
3273	>	while (p != null) {
3274	>	int j = p.hash & mask;
3275	>	Node<V> next = p.next;
3276	>	Node<V> q = p.next = tabAt(tab, j);
3277	>	setTabAt(tab, j, p);
3278	>	if (!collide && q != null && q.hash == p.hash)
3279	>	collide = true;
3280	>	p = next;
3281	>	}
3282	>	table = tab;
3283	>	addCount(size, -1);
3284	>	sc = n - (n >>> 2);
3285	>	}
3286	>	} finally {
3287	>	sizeCtl = sc;
3288	>	}
3289	>	if (collide) { // rescan and convert to TreeBins
3290	>	Node<V>[] tab = table;
3291	>	for (int i = 0; i < tab.length; ++i) {
3292	>	int c = 0;
3293	>	for (Node<V> e = tabAt(tab, i); e != null; e = e.next) {
3294	>	if (++c > TREE_THRESHOLD &&
3295	>	(e.key instanceof Comparable)) {
3296	>	replaceWithTreeBin(tab, i, e.key);
3297	>	break;
3298	>	}
3299	>	}
3300	>	}
3301	>	}
3302	>	}
3303	>	if (!init) { // Can only happen if unsafely published.
3304	>	while (p != null) {
3305	>	internalPut((K)p.key, p.val, false);
3306	>	p = p.next;
3307	>	}
3308	>	}
3309	>	}
3310	>	}
3311	>
3312	>	// -------------------------------------------------------
3313	>
3314	>	// Sams
3315	>	/** Interface describing a void action of one argument */
3316	>	public interface Action<A> { void apply(A a); }
3317	>	/** Interface describing a void action of two arguments */
3318	>	public interface BiAction<A,B> { void apply(A a, B b); }
3319	>	/** Interface describing a function of one argument */
3320	>	public interface Fun<A,T> { T apply(A a); }
3321	>	/** Interface describing a function of two arguments */
3322	>	public interface BiFun<A,B,T> { T apply(A a, B b); }
3323	>	/** Interface describing a function of no arguments */
3324	>	public interface Generator<T> { T apply(); }
3325	>	/** Interface describing a function mapping its argument to a double */
3326	>	public interface ObjectToDouble<A> { double apply(A a); }
3327	>	/** Interface describing a function mapping its argument to a long */
3328	>	public interface ObjectToLong<A> { long apply(A a); }
3329	>	/** Interface describing a function mapping its argument to an int */
3330	>	public interface ObjectToInt<A> {int apply(A a); }
3331	>	/** Interface describing a function mapping two arguments to a double */
3332	>	public interface ObjectByObjectToDouble<A,B> { double apply(A a, B b); }
3333	>	/** Interface describing a function mapping two arguments to a long */
3334	>	public interface ObjectByObjectToLong<A,B> { long apply(A a, B b); }
3335	>	/** Interface describing a function mapping two arguments to an int */
3336	>	public interface ObjectByObjectToInt<A,B> {int apply(A a, B b); }
3337	>	/** Interface describing a function mapping a double to a double */
3338	>	public interface DoubleToDouble { double apply(double a); }
3339	>	/** Interface describing a function mapping a long to a long */
3340	>	public interface LongToLong { long apply(long a); }
3341	>	/** Interface describing a function mapping an int to an int */
3342	>	public interface IntToInt { int apply(int a); }
3343	>	/** Interface describing a function mapping two doubles to a double */
3344	>	public interface DoubleByDoubleToDouble { double apply(double a, double b); }
3345	>	/** Interface describing a function mapping two longs to a long */
3346	>	public interface LongByLongToLong { long apply(long a, long b); }
3347	>	/** Interface describing a function mapping two ints to an int */
3348	>	public interface IntByIntToInt { int apply(int a, int b); }
3349	>
3350	>
3351	>	// -------------------------------------------------------
3352	>
3353	>	// Sequential bulk operations
3354	>
3355	>	/**
3356	>	* Performs the given action for each (key, value).
3357	>	*
3358	>	* @param action the action
3359	>	*/
3360	>	@SuppressWarnings("unchecked") public void forEachSequentially
3361	>	(BiAction<K,V> action) {
3362	>	if (action == null) throw new NullPointerException();
3363	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3364	>	V v;
3365	>	while ((v = it.advance()) != null)
3366	>	action.apply((K)it.nextKey, v);
3367	>	}
3368	>
3369	>	/**
3370	>	* Performs the given action for each non-null transformation
3371	>	* of each (key, value).
3372	>	*
3373	>	* @param transformer a function returning the transformation
3374	>	* for an element, or null of there is no transformation (in
3375	>	* which case the action is not applied).
3376	>	* @param action the action
3377	>	*/
3378	>	@SuppressWarnings("unchecked") public <U> void forEachSequentially
3379	>	(BiFun<? super K, ? super V, ? extends U> transformer,
3380	>	Action<U> action) {
3381	>	if (transformer == null || action == null)
3382	>	throw new NullPointerException();
3383	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3384	>	V v; U u;
3385	>	while ((v = it.advance()) != null) {
3386	>	if ((u = transformer.apply((K)it.nextKey, v)) != null)
3387	>	action.apply(u);
3388	>	}
3389	>	}
3390	>
3391	>	/**
3392	>	* Returns a non-null result from applying the given search
3393	>	* function on each (key, value), or null if none.
3394	>	*
3395	>	* @param searchFunction a function returning a non-null
3396	>	* result on success, else null
3397	>	* @return a non-null result from applying the given search
3398	>	* function on each (key, value), or null if none
3399	>	*/
3400	>	@SuppressWarnings("unchecked") public <U> U searchSequentially
3401	>	(BiFun<? super K, ? super V, ? extends U> searchFunction) {
3402	>	if (searchFunction == null) throw new NullPointerException();
3403	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3404	>	V v; U u;
3405	>	while ((v = it.advance()) != null) {
3406	>	if ((u = searchFunction.apply((K)it.nextKey, v)) != null)
3407	>	return u;
3408	>	}
3409	>	return null;
3410	>	}
3411	>
3412	>	/**
3413	>	* Returns the result of accumulating the given transformation
3414	>	* of all (key, value) pairs using the given reducer to
3415	>	* combine values, or null if none.
3416	>	*
3417	>	* @param transformer a function returning the transformation
3418	>	* for an element, or null of there is no transformation (in
3419	>	* which case it is not combined).
3420	>	* @param reducer a commutative associative combining function
3421	>	* @return the result of accumulating the given transformation
3422	>	* of all (key, value) pairs
3423	>	*/
3424	>	@SuppressWarnings("unchecked") public <U> U reduceSequentially
3425	>	(BiFun<? super K, ? super V, ? extends U> transformer,
3426	>	BiFun<? super U, ? super U, ? extends U> reducer) {
3427	>	if (transformer == null || reducer == null)
3428	>	throw new NullPointerException();
3429	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3430	>	U r = null, u; V v;
3431	>	while ((v = it.advance()) != null) {
3432	>	if ((u = transformer.apply((K)it.nextKey, v)) != null)
3433	>	r = (r == null) ? u : reducer.apply(r, u);
3434	>	}
3435	>	return r;
3436	>	}
3437	>
3438	>	/**
3439	>	* Returns the result of accumulating the given transformation
3440	>	* of all (key, value) pairs using the given reducer to
3441	>	* combine values, and the given basis as an identity value.
3442	>	*
3443	>	* @param transformer a function returning the transformation
3444	>	* for an element
3445	>	* @param basis the identity (initial default value) for the reduction
3446	>	* @param reducer a commutative associative combining function
3447	>	* @return the result of accumulating the given transformation
3448	>	* of all (key, value) pairs
3449	>	*/
3450	>	@SuppressWarnings("unchecked") public double reduceToDoubleSequentially
3451	>	(ObjectByObjectToDouble<? super K, ? super V> transformer,
3452	>	double basis,
3453	>	DoubleByDoubleToDouble reducer) {
3454	>	if (transformer == null || reducer == null)
3455	>	throw new NullPointerException();
3456	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3457	>	double r = basis; V v;
3458	>	while ((v = it.advance()) != null)
3459	>	r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
3460	>	return r;
3461	>	}
3462	>
3463	>	/**
3464	>	* Returns the result of accumulating the given transformation
3465	>	* of all (key, value) pairs using the given reducer to
3466	>	* combine values, and the given basis as an identity value.
3467	>	*
3468	>	* @param transformer a function returning the transformation
3469	>	* for an element
3470	>	* @param basis the identity (initial default value) for the reduction
3471	>	* @param reducer a commutative associative combining function
3472	>	* @return the result of accumulating the given transformation
3473	>	* of all (key, value) pairs
3474	>	*/
3475	>	@SuppressWarnings("unchecked") public long reduceToLongSequentially
3476	>	(ObjectByObjectToLong<? super K, ? super V> transformer,
3477	>	long basis,
3478	>	LongByLongToLong reducer) {
3479	>	if (transformer == null || reducer == null)
3480	>	throw new NullPointerException();
3481	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3482	>	long r = basis; V v;
3483	>	while ((v = it.advance()) != null)
3484	>	r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
3485	>	return r;
3486	>	}
3487	>
3488	>	/**
3489	>	* Returns the result of accumulating the given transformation
3490	>	* of all (key, value) pairs using the given reducer to
3491	>	* combine values, and the given basis as an identity value.
3492	>	*
3493	>	* @param transformer a function returning the transformation
3494	>	* for an element
3495	>	* @param basis the identity (initial default value) for the reduction
3496	>	* @param reducer a commutative associative combining function
3497	>	* @return the result of accumulating the given transformation
3498	>	* of all (key, value) pairs
3499	>	*/
3500	>	@SuppressWarnings("unchecked") public int reduceToIntSequentially
3501	>	(ObjectByObjectToInt<? super K, ? super V> transformer,
3502	>	int basis,
3503	>	IntByIntToInt reducer) {
3504	>	if (transformer == null || reducer == null)
3505	>	throw new NullPointerException();
3506	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3507	>	int r = basis; V v;
3508	>	while ((v = it.advance()) != null)
3509	>	r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
3510	>	return r;
3511	>	}
3512	>
3513	>	/**
3514	>	* Performs the given action for each key.
3515	>	*
3516	>	* @param action the action
3517	>	*/
3518	>	@SuppressWarnings("unchecked") public void forEachKeySequentially
3519	>	(Action<K> action) {
3520	>	if (action == null) throw new NullPointerException();
3521	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3522	>	while (it.advance() != null)
3523	>	action.apply((K)it.nextKey);
3524	>	}
3525	>
3526	>	/**
3527	>	* Performs the given action for each non-null transformation
3528	>	* of each key.
3529	>	*
3530	>	* @param transformer a function returning the transformation
3531	>	* for an element, or null of there is no transformation (in
3532	>	* which case the action is not applied).
3533	>	* @param action the action
3534	>	*/
3535	>	@SuppressWarnings("unchecked") public <U> void forEachKeySequentially
3536	>	(Fun<? super K, ? extends U> transformer,
3537	>	Action<U> action) {
3538	>	if (transformer == null || action == null)
3539	>	throw new NullPointerException();
3540	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3541	>	U u;
3542	>	while (it.advance() != null) {
3543	>	if ((u = transformer.apply((K)it.nextKey)) != null)
3544	>	action.apply(u);
3545	>	}
3546	>	ForkJoinTasks.forEachKey
3547	>	(this, transformer, action).invoke();
3548	>	}
3549	>
3550	>	/**
3551	>	* Returns a non-null result from applying the given search
3552	>	* function on each key, or null if none.
3553	>	*
3554	>	* @param searchFunction a function returning a non-null
3555	>	* result on success, else null
3556	>	* @return a non-null result from applying the given search
3557	>	* function on each key, or null if none
3558	>	*/
3559	>	@SuppressWarnings("unchecked") public <U> U searchKeysSequentially
3560	>	(Fun<? super K, ? extends U> searchFunction) {
3561	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3562	>	U u;
3563	>	while (it.advance() != null) {
3564	>	if ((u = searchFunction.apply((K)it.nextKey)) != null)
3565	>	return u;
3566	>	}
3567	>	return null;
3568	>	}
3569	>
3570	>	/**
3571	>	* Returns the result of accumulating all keys using the given
3572	>	* reducer to combine values, or null if none.
3573	>	*
3574	>	* @param reducer a commutative associative combining function
3575	>	* @return the result of accumulating all keys using the given
3576	>	* reducer to combine values, or null if none
3577	>	*/
3578	>	@SuppressWarnings("unchecked") public K reduceKeysSequentially
3579	>	(BiFun<? super K, ? super K, ? extends K> reducer) {
3580	>	if (reducer == null) throw new NullPointerException();
3581	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3582	>	K r = null;
3583	>	while (it.advance() != null) {
3584	>	K u = (K)it.nextKey;
3585	>	r = (r == null) ? u : reducer.apply(r, u);
3586	>	}
3587	>	return r;
3588	>	}
3589	>
3590	>	/**
3591	>	* Returns the result of accumulating the given transformation
3592	>	* of all keys using the given reducer to combine values, or
3593	>	* null if none.
3594	>	*
3595	>	* @param transformer a function returning the transformation
3596	>	* for an element, or null of there is no transformation (in
3597	>	* which case it is not combined).
3598	>	* @param reducer a commutative associative combining function
3599	>	* @return the result of accumulating the given transformation
3600	>	* of all keys
3601	>	*/
3602	>	@SuppressWarnings("unchecked") public <U> U reduceKeysSequentially
3603	>	(Fun<? super K, ? extends U> transformer,
3604	>	BiFun<? super U, ? super U, ? extends U> reducer) {
3605	>	if (transformer == null || reducer == null)
3606	>	throw new NullPointerException();
3607	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3608	>	U r = null, u;
3609	>	while (it.advance() != null) {
3610	>	if ((u = transformer.apply((K)it.nextKey)) != null)
3611	>	r = (r == null) ? u : reducer.apply(r, u);
3612	>	}
3613	>	return r;
3614	>	}
3615	>
3616	>	/**
3617	>	* Returns the result of accumulating the given transformation
3618	>	* of all keys using the given reducer to combine values, and
3619	>	* the given basis as an identity value.
3620	>	*
3621	>	* @param transformer a function returning the transformation
3622	>	* for an element
3623	>	* @param basis the identity (initial default value) for the reduction
3624	>	* @param reducer a commutative associative combining function
3625	>	* @return  the result of accumulating the given transformation
3626	>	* of all keys
3627	>	*/
3628	>	@SuppressWarnings("unchecked") public double reduceKeysToDoubleSequentially
3629	>	(ObjectToDouble<? super K> transformer,
3630	>	double basis,
3631	>	DoubleByDoubleToDouble reducer) {
3632	>	if (transformer == null || reducer == null)
3633	>	throw new NullPointerException();
3634	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3635	>	double r = basis;
3636	>	while (it.advance() != null)
3637	>	r = reducer.apply(r, transformer.apply((K)it.nextKey));
3638	>	return r;
3639	>	}
3640	>
3641	>	/**
3642	>	* Returns the result of accumulating the given transformation
3643	>	* of all keys using the given reducer to combine values, and
3644	>	* the given basis as an identity value.
3645	>	*
3646	>	* @param transformer a function returning the transformation
3647	>	* for an element
3648	>	* @param basis the identity (initial default value) for the reduction
3649	>	* @param reducer a commutative associative combining function
3650	>	* @return the result of accumulating the given transformation
3651	>	* of all keys
3652	>	*/
3653	>	@SuppressWarnings("unchecked") public long reduceKeysToLongSequentially
3654	>	(ObjectToLong<? super K> transformer,
3655	>	long basis,
3656	>	LongByLongToLong reducer) {
3657	>	if (transformer == null || reducer == null)
3658	>	throw new NullPointerException();
3659	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3660	>	long r = basis;
3661	>	while (it.advance() != null)
3662	>	r = reducer.apply(r, transformer.apply((K)it.nextKey));
3663	>	return r;
3664	>	}
3665	>
3666	>	/**
3667	>	* Returns the result of accumulating the given transformation
3668	>	* of all keys using the given reducer to combine values, and
3669	>	* the given basis as an identity value.
3670	>	*
3671	>	* @param transformer a function returning the transformation
3672	>	* for an element
3673	>	* @param basis the identity (initial default value) for the reduction
3674	>	* @param reducer a commutative associative combining function
3675	>	* @return the result of accumulating the given transformation
3676	>	* of all keys
3677	>	*/
3678	>	@SuppressWarnings("unchecked") public int reduceKeysToIntSequentially
3679	>	(ObjectToInt<? super K> transformer,
3680	>	int basis,
3681	>	IntByIntToInt reducer) {
3682	>	if (transformer == null || reducer == null)
3683	>	throw new NullPointerException();
3684	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3685	>	int r = basis;
3686	>	while (it.advance() != null)
3687	>	r = reducer.apply(r, transformer.apply((K)it.nextKey));
3688	>	return r;
3689	>	}
3690	>
3691	>	/**
3692	>	* Performs the given action for each value.
3693	>	*
3694	>	* @param action the action
3695	>	*/
3696	>	public void forEachValueSequentially(Action<V> action) {
3697	>	if (action == null) throw new NullPointerException();
3698	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3699	>	V v;
3700	>	while ((v = it.advance()) != null)
3701	>	action.apply(v);
3702	>	}
3703	>
3704	>	/**
3705	>	* Performs the given action for each non-null transformation
3706	>	* of each value.
3707	>	*
3708	>	* @param transformer a function returning the transformation
3709	>	* for an element, or null of there is no transformation (in
3710	>	* which case the action is not applied).
3711	>	*/
3712	>	public <U> void forEachValueSequentially
3713	>	(Fun<? super V, ? extends U> transformer,
3714	>	Action<U> action) {
3715	>	if (transformer == null || action == null)
3716	>	throw new NullPointerException();
3717	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3718	>	V v; U u;
3719	>	while ((v = it.advance()) != null) {
3720	>	if ((u = transformer.apply(v)) != null)
3721	>	action.apply(u);
3722	>	}
3723	>	}
3724	>
3725	>	/**
3726	>	* Returns a non-null result from applying the given search
3727	>	* function on each value, or null if none.
3728	>	*
3729	>	* @param searchFunction a function returning a non-null
3730	>	* result on success, else null
3731	>	* @return a non-null result from applying the given search
3732	>	* function on each value, or null if none
3733	>	*
3734	>	*/
3735	>	public <U> U searchValuesSequentially
3736	>	(Fun<? super V, ? extends U> searchFunction) {
3737	>	if (searchFunction == null) throw new NullPointerException();
3738	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3739	>	V v; U u;
3740	>	while ((v = it.advance()) != null) {
3741	>	if ((u = searchFunction.apply(v)) != null)
3742	>	return u;
3743	>	}
3744	>	return null;
3745	>	}
3746	>
3747	>	/**
3748	>	* Returns the result of accumulating all values using the
3749	>	* given reducer to combine values, or null if none.
3750	>	*
3751	>	* @param reducer a commutative associative combining function
3752	>	* @return  the result of accumulating all values
3753	>	*/
3754	>	public V reduceValuesSequentially
3755	>	(BiFun<? super V, ? super V, ? extends V> reducer) {
3756	>	if (reducer == null) throw new NullPointerException();
3757	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3758	>	V r = null; V v;
3759	>	while ((v = it.advance()) != null)
3760	>	r = (r == null) ? v : reducer.apply(r, v);
3761	>	return r;
3762	>	}
3763	>
3764	>	/**
3765	>	* Returns the result of accumulating the given transformation
3766	>	* of all values using the given reducer to combine values, or
3767	>	* null if none.
3768	>	*
3769	>	* @param transformer a function returning the transformation
3770	>	* for an element, or null of there is no transformation (in
3771	>	* which case it is not combined).
3772	>	* @param reducer a commutative associative combining function
3773	>	* @return the result of accumulating the given transformation
3774	>	* of all values
3775	>	*/
3776	>	public <U> U reduceValuesSequentially
3777	>	(Fun<? super V, ? extends U> transformer,
3778	>	BiFun<? super U, ? super U, ? extends U> reducer) {
3779	>	if (transformer == null || reducer == null)
3780	>	throw new NullPointerException();
3781	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3782	>	U r = null, u; V v;
3783	>	while ((v = it.advance()) != null) {
3784	>	if ((u = transformer.apply(v)) != null)
3785	>	r = (r == null) ? u : reducer.apply(r, u);
3786	>	}
3787	>	return r;
3788	>	}
3789	>
3790	>	/**
3791	>	* Returns the result of accumulating the given transformation
3792	>	* of all values using the given reducer to combine values,
3793	>	* and the given basis as an identity value.
3794	>	*
3795	>	* @param transformer a function returning the transformation
3796	>	* for an element
3797	>	* @param basis the identity (initial default value) for the reduction
3798	>	* @param reducer a commutative associative combining function
3799	>	* @return the result of accumulating the given transformation
3800	>	* of all values
3801	>	*/
3802	>	public double reduceValuesToDoubleSequentially
3803	>	(ObjectToDouble<? super V> transformer,
3804	>	double basis,
3805	>	DoubleByDoubleToDouble reducer) {
3806	>	if (transformer == null || reducer == null)
3807	>	throw new NullPointerException();
3808	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3809	>	double r = basis; V v;
3810	>	while ((v = it.advance()) != null)
3811	>	r = reducer.apply(r, transformer.apply(v));
3812	>	return r;
3813	>	}
3814	>
3815	>	/**
3816	>	* Returns the result of accumulating the given transformation
3817	>	* of all values using the given reducer to combine values,
3818	>	* and the given basis as an identity value.
3819	>	*
3820	>	* @param transformer a function returning the transformation
3821	>	* for an element
3822	>	* @param basis the identity (initial default value) for the reduction
3823	>	* @param reducer a commutative associative combining function
3824	>	* @return the result of accumulating the given transformation
3825	>	* of all values
3826	>	*/
3827	>	public long reduceValuesToLongSequentially
3828	>	(ObjectToLong<? super V> transformer,
3829	>	long basis,
3830	>	LongByLongToLong reducer) {
3831	>	if (transformer == null || reducer == null)
3832	>	throw new NullPointerException();
3833	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3834	>	long r = basis; V v;
3835	>	while ((v = it.advance()) != null)
3836	>	r = reducer.apply(r, transformer.apply(v));
3837	>	return r;
3838	>	}
3839	>
3840	>	/**
3841	>	* Returns the result of accumulating the given transformation
3842	>	* of all values using the given reducer to combine values,
3843	>	* and the given basis as an identity value.
3844	>	*
3845	>	* @param transformer a function returning the transformation
3846	>	* for an element
3847	>	* @param basis the identity (initial default value) for the reduction
3848	>	* @param reducer a commutative associative combining function
3849	>	* @return the result of accumulating the given transformation
3850	>	* of all values
3851	>	*/
3852	>	public int reduceValuesToIntSequentially
3853	>	(ObjectToInt<? super V> transformer,
3854	>	int basis,
3855	>	IntByIntToInt reducer) {
3856	>	if (transformer == null || reducer == null)
3857	>	throw new NullPointerException();
3858	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3859	>	int r = basis; V v;
3860	>	while ((v = it.advance()) != null)
3861	>	r = reducer.apply(r, transformer.apply(v));
3862	>	return r;
3863	>	}
3864	>
3865	>	/**
3866	>	* Performs the given action for each entry.
3867	>	*
3868	>	* @param action the action
3869	>	*/
3870	>	@SuppressWarnings("unchecked") public void forEachEntrySequentially
3871	>	(Action<Map.Entry<K,V>> action) {
3872	>	if (action == null) throw new NullPointerException();
3873	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3874	>	V v;
3875	>	while ((v = it.advance()) != null)
3876	>	action.apply(entryFor((K)it.nextKey, v));
3877	>	}
3878	>
3879	>	/**
3880	>	* Performs the given action for each non-null transformation
3881	>	* of each entry.
3882	>	*
3883	>	* @param transformer a function returning the transformation
3884	>	* for an element, or null of there is no transformation (in
3885	>	* which case the action is not applied).
3886	>	* @param action the action
3887	>	*/
3888	>	@SuppressWarnings("unchecked") public <U> void forEachEntrySequentially
3889	>	(Fun<Map.Entry<K,V>, ? extends U> transformer,
3890	>	Action<U> action) {
3891	>	if (transformer == null || action == null)
3892	>	throw new NullPointerException();
3893	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3894	>	V v; U u;
3895	>	while ((v = it.advance()) != null) {
3896	>	if ((u = transformer.apply(entryFor((K)it.nextKey, v))) != null)
3897	>	action.apply(u);
3898	>	}
3899	>	}
3900	>
3901	>	/**
3902	>	* Returns a non-null result from applying the given search
3903	>	* function on each entry, or null if none.
3904	>	*
3905	>	* @param searchFunction a function returning a non-null
3906	>	* result on success, else null
3907	>	* @return a non-null result from applying the given search
3908	>	* function on each entry, or null if none
3909	>	*/
3910	>	@SuppressWarnings("unchecked") public <U> U searchEntriesSequentially
3911	>	(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
3912	>	if (searchFunction == null) throw new NullPointerException();
3913	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3914	>	V v; U u;
3915	>	while ((v = it.advance()) != null) {
3916	>	if ((u = searchFunction.apply(entryFor((K)it.nextKey, v))) != null)
3917	>	return u;
3918	>	}
3919	>	return null;
3920	>	}
3921	>
3922	>	/**
3923	>	* Returns the result of accumulating all entries using the
3924	>	* given reducer to combine values, or null if none.
3925	>	*
3926	>	* @param reducer a commutative associative combining function
3927	>	* @return the result of accumulating all entries
3928	>	*/
3929	>	@SuppressWarnings("unchecked") public Map.Entry<K,V> reduceEntriesSequentially
3930	>	(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
3931	>	if (reducer == null) throw new NullPointerException();
3932	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3933	>	Map.Entry<K,V> r = null; V v;
3934	>	while ((v = it.advance()) != null) {
3935	>	Map.Entry<K,V> u = entryFor((K)it.nextKey, v);
3936	>	r = (r == null) ? u : reducer.apply(r, u);
3937	>	}
3938	>	return r;
3939	>	}
3940	>
3941	>	/**
3942	>	* Returns the result of accumulating the given transformation
3943	>	* of all entries using the given reducer to combine values,
3944	>	* or null if none.
3945	>	*
3946	>	* @param transformer a function returning the transformation
3947	>	* for an element, or null of there is no transformation (in
3948	>	* which case it is not combined).
3949	>	* @param reducer a commutative associative combining function
3950	>	* @return the result of accumulating the given transformation
3951	>	* of all entries
3952	>	*/
3953	>	@SuppressWarnings("unchecked") public <U> U reduceEntriesSequentially
3954	>	(Fun<Map.Entry<K,V>, ? extends U> transformer,
3955	>	BiFun<? super U, ? super U, ? extends U> reducer) {
3956	>	if (transformer == null || reducer == null)
3957	>	throw new NullPointerException();
3958	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3959	>	U r = null, u; V v;
3960	>	while ((v = it.advance()) != null) {
3961	>	if ((u = transformer.apply(entryFor((K)it.nextKey, v))) != null)
3962	>	r = (r == null) ? u : reducer.apply(r, u);
3963	>	}
3964	>	return r;
3965	>	}
3966	>
3967	>	/**
3968	>	* Returns the result of accumulating the given transformation
3969	>	* of all entries using the given reducer to combine values,
3970	>	* and the given basis as an identity value.
3971	>	*
3972	>	* @param transformer a function returning the transformation
3973	>	* for an element
3974	>	* @param basis the identity (initial default value) for the reduction
3975	>	* @param reducer a commutative associative combining function
3976	>	* @return the result of accumulating the given transformation
3977	>	* of all entries
3978	>	*/
3979	>	@SuppressWarnings("unchecked") public double reduceEntriesToDoubleSequentially
3980	>	(ObjectToDouble<Map.Entry<K,V>> transformer,
3981	>	double basis,
3982	>	DoubleByDoubleToDouble reducer) {
3983	>	if (transformer == null || reducer == null)
3984	>	throw new NullPointerException();
3985	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3986	>	double r = basis; V v;
3987	>	while ((v = it.advance()) != null)
3988	>	r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v)));
3989	>	return r;
3990	>	}
3991	>
3992	>	/**
3993	>	* Returns the result of accumulating the given transformation
3994	>	* of all entries using the given reducer to combine values,
3995	>	* and the given basis as an identity value.
3996	>	*
3997	>	* @param transformer a function returning the transformation
3998	>	* for an element
3999	>	* @param basis the identity (initial default value) for the reduction
4000	>	* @param reducer a commutative associative combining function
4001	>	* @return  the result of accumulating the given transformation
4002	>	* of all entries
4003	>	*/
4004	>	@SuppressWarnings("unchecked") public long reduceEntriesToLongSequentially
4005	>	(ObjectToLong<Map.Entry<K,V>> transformer,
4006	>	long basis,
4007	>	LongByLongToLong reducer) {
4008	>	if (transformer == null || reducer == null)
4009	>	throw new NullPointerException();
4010	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
4011	>	long r = basis; V v;
4012	>	while ((v = it.advance()) != null)
4013	>	r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v)));
4014	>	return r;
4015	>	}
4016	>
4017	>	/**
4018	>	* Returns the result of accumulating the given transformation
4019	>	* of all entries using the given reducer to combine values,
4020	>	* and the given basis as an identity value.
4021	>	*
4022	>	* @param transformer a function returning the transformation
4023	>	* for an element
4024	>	* @param basis the identity (initial default value) for the reduction
4025	>	* @param reducer a commutative associative combining function
4026	>	* @return the result of accumulating the given transformation
4027	>	* of all entries
4028	>	*/
4029	>	@SuppressWarnings("unchecked") public int reduceEntriesToIntSequentially
4030	>	(ObjectToInt<Map.Entry<K,V>> transformer,
4031	>	int basis,
4032	>	IntByIntToInt reducer) {
4033	>	if (transformer == null || reducer == null)
4034	>	throw new NullPointerException();
4035	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
4036	>	int r = basis; V v;
4037	>	while ((v = it.advance()) != null)
4038	>	r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v)));
4039	>	return r;
4040	>	}
4041	>
4042	>	// Parallel bulk operations
4043	>
4044	>	/**
4045	>	* Performs the given action for each (key, value).
4046	>	*
4047	>	* @param action the action
4048	>	*/
4049	>	public void forEachInParallel(BiAction<K,V> action) {
4050	>	ForkJoinTasks.forEach
4051	>	(this, action).invoke();
4052	>	}
4053	>
4054	>	/**
4055	>	* Performs the given action for each non-null transformation
4056	>	* of each (key, value).
4057	>	*
4058	>	* @param transformer a function returning the transformation
4059	>	* for an element, or null of there is no transformation (in
4060	>	* which case the action is not applied).
4061	>	* @param action the action
4062	>	*/
4063	>	public <U> void forEachInParallel
4064	>	(BiFun<? super K, ? super V, ? extends U> transformer,
4065	>	Action<U> action) {
4066	>	ForkJoinTasks.forEach
4067	>	(this, transformer, action).invoke();
4068	>	}
4069	>
4070	>	/**
4071	>	* Returns a non-null result from applying the given search
4072	>	* function on each (key, value), or null if none.  Upon
4073	>	* success, further element processing is suppressed and the
4074	>	* results of any other parallel invocations of the search
4075	>	* function are ignored.
4076	>	*
4077	>	* @param searchFunction a function returning a non-null
4078	>	* result on success, else null
4079	>	* @return a non-null result from applying the given search
4080	>	* function on each (key, value), or null if none
4081	>	*/
4082	>	public <U> U searchInParallel
4083	>	(BiFun<? super K, ? super V, ? extends U> searchFunction) {
4084	>	return ForkJoinTasks.search
4085	>	(this, searchFunction).invoke();
4086	>	}
4087	>
4088	>	/**
4089	>	* Returns the result of accumulating the given transformation
4090	>	* of all (key, value) pairs using the given reducer to
4091	>	* combine values, or null if none.
4092	>	*
4093	>	* @param transformer a function returning the transformation
4094	>	* for an element, or null of there is no transformation (in
4095	>	* 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 (key, value) pairs
4099	>	*/
4100	>	public <U> U reduceInParallel
4101	>	(BiFun<? super K, ? super V, ? extends U> transformer,
4102	>	BiFun<? super U, ? super U, ? extends U> reducer) {
4103	>	return ForkJoinTasks.reduce
4104	>	(this, transformer, reducer).invoke();
4105	>	}
4106	>
4107	>	/**
4108	>	* Returns the result of accumulating the given transformation
4109	>	* of all (key, value) pairs using the given reducer to
4110	>	* combine values, and the given basis as an identity value.
4111	>	*
4112	>	* @param transformer a function returning the transformation
4113	>	* for an element
4114	>	* @param basis the identity (initial default value) for the reduction
4115	>	* @param reducer a commutative associative combining function
4116	>	* @return the result of accumulating the given transformation
4117	>	* of all (key, value) pairs
4118	>	*/
4119	>	public double reduceToDoubleInParallel
4120	>	(ObjectByObjectToDouble<? super K, ? super V> transformer,
4121	>	double basis,
4122	>	DoubleByDoubleToDouble reducer) {
4123	>	return ForkJoinTasks.reduceToDouble
4124	>	(this, transformer, basis, reducer).invoke();
4125	>	}
4126	>
4127	>	/**
4128	>	* Returns the result of accumulating the given transformation
4129	>	* of all (key, value) pairs using the given reducer to
4130	>	* combine values, and the given basis as an identity value.
4131	>	*
4132	>	* @param transformer a function returning the transformation
4133	>	* for an element
4134	>	* @param basis the identity (initial default value) for the reduction
4135	>	* @param reducer a commutative associative combining function
4136	>	* @return the result of accumulating the given transformation
4137	>	* of all (key, value) pairs
4138	>	*/
4139	>	public long reduceToLongInParallel
4140	>	(ObjectByObjectToLong<? super K, ? super V> transformer,
4141	>	long basis,
4142	>	LongByLongToLong reducer) {
4143	>	return ForkJoinTasks.reduceToLong
4144	>	(this, transformer, basis, reducer).invoke();
4145	>	}
4146	>
4147	>	/**
4148	>	* Returns the result of accumulating the given transformation
4149	>	* of all (key, value) pairs using the given reducer to
4150	>	* combine values, and the given basis as an identity value.
4151	>	*
4152	>	* @param transformer a function returning the transformation
4153	>	* for an element
4154	>	* @param basis the identity (initial default value) for the reduction
4155	>	* @param reducer a commutative associative combining function
4156	>	* @return the result of accumulating the given transformation
4157	>	* of all (key, value) pairs
4158	>	*/
4159	>	public int reduceToIntInParallel
4160	>	(ObjectByObjectToInt<? super K, ? super V> transformer,
4161	>	int basis,
4162	>	IntByIntToInt reducer) {
4163	>	return ForkJoinTasks.reduceToInt
4164	>	(this, transformer, basis, reducer).invoke();
4165	>	}
4166	>
4167	>	/**
4168	>	* Performs the given action for each key.
4169	>	*
4170	>	* @param action the action
4171	>	*/
4172	>	public void forEachKeyInParallel(Action<K> action) {
4173	>	ForkJoinTasks.forEachKey
4174	>	(this, action).invoke();
4175	>	}
4176	>
4177	>	/**
4178	>	* Performs the given action for each non-null transformation
4179	>	* of each key.
4180	>	*
4181	>	* @param transformer a function returning the transformation
4182	>	* for an element, or null of there is no transformation (in
4183	>	* which case the action is not applied).
4184	>	* @param action the action
4185	>	*/
4186	>	public <U> void forEachKeyInParallel
4187	>	(Fun<? super K, ? extends U> transformer,
4188	>	Action<U> action) {
4189	>	ForkJoinTasks.forEachKey
4190	>	(this, transformer, action).invoke();
4191	>	}
4192	>
4193	>	/**
4194	>	* Returns a non-null result from applying the given search
4195	>	* function on each key, or null if none. Upon success,
4196	>	* further element processing is suppressed and the results of
4197	>	* any other parallel invocations of the search function are
4198	>	* ignored.
4199	>	*
4200	>	* @param searchFunction a function returning a non-null
4201	>	* result on success, else null
4202	>	* @return a non-null result from applying the given search
4203	>	* function on each key, or null if none
4204	>	*/
4205	>	public <U> U searchKeysInParallel
4206	>	(Fun<? super K, ? extends U> searchFunction) {
4207	>	return ForkJoinTasks.searchKeys
4208	>	(this, searchFunction).invoke();
4209	>	}
4210	>
4211	>	/**
4212	>	* Returns the result of accumulating all keys using the given
4213	>	* reducer to combine values, or null if none.
4214	>	*
4215	>	* @param reducer a commutative associative combining function
4216	>	* @return the result of accumulating all keys using the given
4217	>	* reducer to combine values, or null if none
4218	>	*/
4219	>	public K reduceKeysInParallel
4220	>	(BiFun<? super K, ? super K, ? extends K> reducer) {
4221	>	return ForkJoinTasks.reduceKeys
4222	>	(this, reducer).invoke();
4223	>	}
4224	>
4225	>	/**
4226	>	* Returns the result of accumulating the given transformation
4227	>	* of all keys using the given reducer to combine values, or
4228	>	* null if none.
4229	>	*
4230	>	* @param transformer a function returning the transformation
4231	>	* for an element, or null of there is no transformation (in
4232	>	* which case it is not combined).
4233	>	* @param reducer a commutative associative combining function
4234	>	* @return the result of accumulating the given transformation
4235	>	* of all keys
4236	>	*/
4237	>	public <U> U reduceKeysInParallel
4238	>	(Fun<? super K, ? extends U> transformer,
4239	>	BiFun<? super U, ? super U, ? extends U> reducer) {
4240	>	return ForkJoinTasks.reduceKeys
4241	>	(this, transformer, reducer).invoke();
4242	>	}
4243	>
4244	>	/**
4245	>	* Returns the result of accumulating the given transformation
4246	>	* of all keys using the given reducer to combine values, and
4247	>	* the given basis as an identity value.
4248	>	*
4249	>	* @param transformer a function returning the transformation
4250	>	* for an element
4251	>	* @param basis the identity (initial default value) for the reduction
4252	>	* @param reducer a commutative associative combining function
4253	>	* @return  the result of accumulating the given transformation
4254	>	* of all keys
4255	>	*/
4256	>	public double reduceKeysToDoubleInParallel
4257	>	(ObjectToDouble<? super K> transformer,
4258	>	double basis,
4259	>	DoubleByDoubleToDouble reducer) {
4260	>	return ForkJoinTasks.reduceKeysToDouble
4261	>	(this, transformer, basis, reducer).invoke();
4262	>	}
4263	>
4264	>	/**
4265	>	* Returns the result of accumulating the given transformation
4266	>	* of all keys using the given reducer to combine values, and
4267	>	* the given basis as an identity value.
4268	>	*
4269	>	* @param transformer a function returning the transformation
4270	>	* for an element
4271	>	* @param basis the identity (initial default value) for the reduction
4272	>	* @param reducer a commutative associative combining function
4273	>	* @return the result of accumulating the given transformation
4274	>	* of all keys
4275	>	*/
4276	>	public long reduceKeysToLongInParallel
4277	>	(ObjectToLong<? super K> transformer,
4278	>	long basis,
4279	>	LongByLongToLong reducer) {
4280	>	return ForkJoinTasks.reduceKeysToLong
4281	>	(this, transformer, basis, reducer).invoke();
4282	>	}
4283	>
4284	>	/**
4285	>	* Returns the result of accumulating the given transformation
4286	>	* of all keys using the given reducer to combine values, and
4287	>	* the given basis as an identity value.
4288	>	*
4289	>	* @param transformer a function returning the transformation
4290	>	* for an element
4291	>	* @param basis the identity (initial default value) for the reduction
4292	>	* @param reducer a commutative associative combining function
4293	>	* @return the result of accumulating the given transformation
4294	>	* of all keys
4295	>	*/
4296	>	public int reduceKeysToIntInParallel
4297	>	(ObjectToInt<? super K> transformer,
4298	>	int basis,
4299	>	IntByIntToInt reducer) {
4300	>	return ForkJoinTasks.reduceKeysToInt
4301	>	(this, transformer, basis, reducer).invoke();
4302	>	}
4303	>
4304	>	/**
4305	>	* Performs the given action for each value.
4306	>	*
4307	>	* @param action the action
4308	>	*/
4309	>	public void forEachValueInParallel(Action<V> action) {
4310	>	ForkJoinTasks.forEachValue
4311	>	(this, action).invoke();
4312	>	}
4313	>
4314	>	/**
4315	>	* Performs the given action for each non-null transformation
4316	>	* of each value.
4317	>	*
4318	>	* @param transformer a function returning the transformation
4319	>	* for an element, or null of there is no transformation (in
4320	>	* which case the action is not applied).
4321	>	*/
4322	>	public <U> void forEachValueInParallel
4323	>	(Fun<? super V, ? extends U> transformer,
4324	>	Action<U> action) {
4325	>	ForkJoinTasks.forEachValue
4326	>	(this, transformer, action).invoke();
4327	>	}
4328	>
4329	>	/**
4330	>	* Returns a non-null result from applying the given search
4331	>	* function on each value, or null if none.  Upon success,
4332	>	* further element processing is suppressed and the results of
4333	>	* any other parallel invocations of the search function are
4334	>	* ignored.
4335	>	*
4336	>	* @param searchFunction a function returning a non-null
4337	>	* result on success, else null
4338	>	* @return a non-null result from applying the given search
4339	>	* function on each value, or null if none
4340	>	*
4341	>	*/
4342	>	public <U> U searchValuesInParallel
4343	>	(Fun<? super V, ? extends U> searchFunction) {
4344	>	return ForkJoinTasks.searchValues
4345	>	(this, searchFunction).invoke();
4346	>	}
4347	>
4348	>	/**
4349	>	* Returns the result of accumulating all values using the
4350	>	* given reducer to combine values, or null if none.
4351	>	*
4352	>	* @param reducer a commutative associative combining function
4353	>	* @return  the result of accumulating all values
4354	>	*/
4355	>	public V reduceValuesInParallel
4356	>	(BiFun<? super V, ? super V, ? extends V> reducer) {
4357	>	return ForkJoinTasks.reduceValues
4358	>	(this, reducer).invoke();
4359	>	}
4360	>
4361	>	/**
4362	>	* Returns the result of accumulating the given transformation
4363	>	* of all values using the given reducer to combine values, or
4364	>	* null if none.
4365	>	*
4366	>	* @param transformer a function returning the transformation
4367	>	* for an element, or null of there is no transformation (in
4368	>	* which case it is not combined).
4369	>	* @param reducer a commutative associative combining function
4370	>	* @return the result of accumulating the given transformation
4371	>	* of all values
4372	>	*/
4373	>	public <U> U reduceValuesInParallel
4374	>	(Fun<? super V, ? extends U> transformer,
4375	>	BiFun<? super U, ? super U, ? extends U> reducer) {
4376	>	return ForkJoinTasks.reduceValues
4377	>	(this, transformer, reducer).invoke();
4378	>	}
4379	>
4380	>	/**
4381	>	* Returns the result of accumulating the given transformation
4382	>	* of all values using the given reducer to combine values,
4383	>	* and the given basis as an identity value.
4384	>	*
4385	>	* @param transformer a function returning the transformation
4386	>	* for an element
4387	>	* @param basis the identity (initial default value) for the reduction
4388	>	* @param reducer a commutative associative combining function
4389	>	* @return the result of accumulating the given transformation
4390	>	* of all values
4391	>	*/
4392	>	public double reduceValuesToDoubleInParallel
4393	>	(ObjectToDouble<? super V> transformer,
4394	>	double basis,
4395	>	DoubleByDoubleToDouble reducer) {
4396	>	return ForkJoinTasks.reduceValuesToDouble
4397	>	(this, transformer, basis, reducer).invoke();
4398	>	}
4399	>
4400	>	/**
4401	>	* Returns the result of accumulating the given transformation
4402	>	* of all values using the given reducer to combine values,
4403	>	* and the given basis as an identity value.
4404	>	*
4405	>	* @param transformer a function returning the transformation
4406	>	* for an element
4407	>	* @param basis the identity (initial default value) for the reduction
4408	>	* @param reducer a commutative associative combining function
4409	>	* @return the result of accumulating the given transformation
4410	>	* of all values
4411	>	*/
4412	>	public long reduceValuesToLongInParallel
4413	>	(ObjectToLong<? super V> transformer,
4414	>	long basis,
4415	>	LongByLongToLong reducer) {
4416	>	return ForkJoinTasks.reduceValuesToLong
4417	>	(this, transformer, basis, reducer).invoke();
4418	>	}
4419	>
4420	>	/**
4421	>	* Returns the result of accumulating the given transformation
4422	>	* of all values using the given reducer to combine values,
4423	>	* and the given basis as an identity value.
4424	>	*
4425	>	* @param transformer a function returning the transformation
4426	>	* for an element
4427	>	* @param basis the identity (initial default value) for the reduction
4428	>	* @param reducer a commutative associative combining function
4429	>	* @return the result of accumulating the given transformation
4430	>	* of all values
4431	>	*/
4432	>	public int reduceValuesToIntInParallel
4433	>	(ObjectToInt<? super V> transformer,
4434	>	int basis,
4435	>	IntByIntToInt reducer) {
4436	>	return ForkJoinTasks.reduceValuesToInt
4437	>	(this, transformer, basis, reducer).invoke();
4438	>	}
4439	>
4440	>	/**
4441	>	* Performs the given action for each entry.
4442	>	*
4443	>	* @param action the action
4444	>	*/
4445	>	public void forEachEntryInParallel(Action<Map.Entry<K,V>> action) {
4446	>	ForkJoinTasks.forEachEntry
4447	>	(this, action).invoke();
4448	>	}
4449	>
4450	>	/**
4451	>	* Performs the given action for each non-null transformation
4452	>	* of each entry.
4453	>	*
4454	>	* @param transformer a function returning the transformation
4455	>	* for an element, or null of there is no transformation (in
4456	>	* which case the action is not applied).
4457	>	* @param action the action
4458	>	*/
4459	>	public <U> void forEachEntryInParallel
4460	>	(Fun<Map.Entry<K,V>, ? extends U> transformer,
4461	>	Action<U> action) {
4462	>	ForkJoinTasks.forEachEntry
4463	>	(this, transformer, action).invoke();
4464	>	}
4465	>
4466	>	/**
4467	>	* Returns a non-null result from applying the given search
4468	>	* function on each entry, or null if none.  Upon success,
4469	>	* further element processing is suppressed and the results of
4470	>	* any other parallel invocations of the search function are
4471	>	* ignored.
4472	>	*
4473	>	* @param searchFunction a function returning a non-null
4474	>	* result on success, else null
4475	>	* @return a non-null result from applying the given search
4476	>	* function on each entry, or null if none
4477	>	*/
4478	>	public <U> U searchEntriesInParallel
4479	>	(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4480	>	return ForkJoinTasks.searchEntries
4481	>	(this, searchFunction).invoke();
4482	>	}
4483	>
4484	>	/**
4485	>	* Returns the result of accumulating all entries using the
4486	>	* given reducer to combine values, or null if none.
4487	>	*
4488	>	* @param reducer a commutative associative combining function
4489	>	* @return the result of accumulating all entries
4490	>	*/
4491	>	public Map.Entry<K,V> reduceEntriesInParallel
4492	>	(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4493	>	return ForkJoinTasks.reduceEntries
4494	>	(this, reducer).invoke();
4495	>	}
4496	>
4497	>	/**
4498	>	* Returns the result of accumulating the given transformation
4499	>	* of all entries using the given reducer to combine values,
4500	>	* or null if none.
4501	>	*
4502	>	* @param transformer a function returning the transformation
4503	>	* for an element, or null of there is no transformation (in
4504	>	* which case it is not combined).
4505	>	* @param reducer a commutative associative combining function
4506	>	* @return the result of accumulating the given transformation
4507	>	* of all entries
4508	>	*/
4509	>	public <U> U reduceEntriesInParallel
4510	>	(Fun<Map.Entry<K,V>, ? extends U> transformer,
4511	>	BiFun<? super U, ? super U, ? extends U> reducer) {
4512	>	return ForkJoinTasks.reduceEntries
4513	>	(this, transformer, reducer).invoke();
4514	>	}
4515	>
4516	>	/**
4517	>	* Returns the result of accumulating the given transformation
4518	>	* of all entries using the given reducer to combine values,
4519	>	* and the given basis as an identity value.
4520	>	*
4521	>	* @param transformer a function returning the transformation
4522	>	* for an element
4523	>	* @param basis the identity (initial default value) for the reduction
4524	>	* @param reducer a commutative associative combining function
4525	>	* @return the result of accumulating the given transformation
4526	>	* of all entries
4527	>	*/
4528	>	public double reduceEntriesToDoubleInParallel
4529	>	(ObjectToDouble<Map.Entry<K,V>> transformer,
4530	>	double basis,
4531	>	DoubleByDoubleToDouble reducer) {
4532	>	return ForkJoinTasks.reduceEntriesToDouble
4533	>	(this, transformer, basis, reducer).invoke();
4534	>	}
4535	>
4536	>	/**
4537	>	* Returns the result of accumulating the given transformation
4538	>	* of all entries using the given reducer to combine values,
4539	>	* and the given basis as an identity value.
4540	>	*
4541	>	* @param transformer a function returning the transformation
4542	>	* for an element
4543	>	* @param basis the identity (initial default value) for the reduction
4544	>	* @param reducer a commutative associative combining function
4545	>	* @return  the result of accumulating the given transformation
4546	>	* of all entries
4547	>	*/
4548	>	public long reduceEntriesToLongInParallel
4549	>	(ObjectToLong<Map.Entry<K,V>> transformer,
4550	>	long basis,
4551	>	LongByLongToLong reducer) {
4552	>	return ForkJoinTasks.reduceEntriesToLong
4553	>	(this, transformer, basis, reducer).invoke();
4554	>	}
4555	>
4556	>	/**
4557	>	* Returns the result of accumulating the given transformation
4558	>	* of all entries using the given reducer to combine values,
4559	>	* and the given basis as an identity value.
4560	>	*
4561	>	* @param transformer a function returning the transformation
4562	>	* for an element
4563	>	* @param basis the identity (initial default value) for the reduction
4564	>	* @param reducer a commutative associative combining function
4565	>	* @return the result of accumulating the given transformation
4566	>	* of all entries
4567	>	*/
4568	>	public int reduceEntriesToIntInParallel
4569	>	(ObjectToInt<Map.Entry<K,V>> transformer,
4570	>	int basis,
4571	>	IntByIntToInt reducer) {
4572	>	return ForkJoinTasks.reduceEntriesToInt
4573	>	(this, transformer, basis, reducer).invoke();
4574	>	}
4575	>
4576	>
4577	>	/* ----------------Views -------------- */
4578	>
4579	>	/**
4580	>	* Base class for views.
4581	>	*/
4582	>	static abstract class CHMView<K, V> {
4583	>	final ConcurrentHashMapV8<K, V> map;
4584	>	CHMView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
4585	>
4586	>	/**
4587	>	* Returns the map backing this view.
4588	>	*
4589	>	* @return the map backing this view
4590	>	*/
4591	>	public ConcurrentHashMapV8<K,V> getMap() { return map; }
4592	>
4593	>	public final int size()                 { return map.size(); }
4594	>	public final boolean isEmpty()          { return map.isEmpty(); }
4595	>	public final void clear()               { map.clear(); }
4596	>
4597	>	// implementations below rely on concrete classes supplying these
4598	>	abstract public Iterator<?> iterator();
4599	>	abstract public boolean contains(Object o);
4600	>	abstract public boolean remove(Object o);
4601	>
4602	>	private static final String oomeMsg = "Required array size too large";
4603	>
4604	>	public final Object[] toArray() {
4605	>	long sz = map.mappingCount();
4606	>	if (sz > (long)(MAX_ARRAY_SIZE))
4607	>	throw new OutOfMemoryError(oomeMsg);
4608	>	int n = (int)sz;
4609	>	Object[] r = new Object[n];
4610	>	int i = 0;
4611	>	Iterator<?> it = iterator();
4612	>	while (it.hasNext()) {
4613	>	if (i == n) {
4614	>	if (n >= MAX_ARRAY_SIZE)
4615	>	throw new OutOfMemoryError(oomeMsg);
4616	>	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4617	>	n = MAX_ARRAY_SIZE;
4618	>	else
4619	>	n += (n >>> 1) + 1;
4620	>	r = Arrays.copyOf(r, n);
4621	>	}
4622	>	r[i++] = it.next();
4623	>	}
4624	>	return (i == n) ? r : Arrays.copyOf(r, i);
4625	>	}
4626	>
4627	>	@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
4628	>	long sz = map.mappingCount();
4629	>	if (sz > (long)(MAX_ARRAY_SIZE))
4630	>	throw new OutOfMemoryError(oomeMsg);
4631	>	int m = (int)sz;
4632	>	T[] r = (a.length >= m) ? a :
4633	>	(T[])java.lang.reflect.Array
4634	>	.newInstance(a.getClass().getComponentType(), m);
4635	>	int n = r.length;
4636	>	int i = 0;
4637	>	Iterator<?> it = iterator();
4638	>	while (it.hasNext()) {
4639	>	if (i == n) {
4640	>	if (n >= MAX_ARRAY_SIZE)
4641	>	throw new OutOfMemoryError(oomeMsg);
4642	>	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4643	>	n = MAX_ARRAY_SIZE;
4644	>	else
4645	>	n += (n >>> 1) + 1;
4646	>	r = Arrays.copyOf(r, n);
4647	>	}
4648	>	r[i++] = (T)it.next();
4649	>	}
4650	>	if (a == r && i < n) {
4651	>	r[i] = null; // null-terminate
4652	>	return r;
4653	>	}
4654	>	return (i == n) ? r : Arrays.copyOf(r, i);
4655	>	}
4656	>
4657	>	public final int hashCode() {
4658	>	int h = 0;
4659	>	for (Iterator<?> it = iterator(); it.hasNext();)
4660	>	h += it.next().hashCode();
4661	>	return h;
4662	>	}
4663	>
4664	>	public final String toString() {
4665	>	StringBuilder sb = new StringBuilder();
4666	>	sb.append('[');
4667	>	Iterator<?> it = iterator();
4668	>	if (it.hasNext()) {
4669	>	for (;;) {
4670	>	Object e = it.next();
4671	>	sb.append(e == this ? "(this Collection)" : e);
4672	>	if (!it.hasNext())
4673	>	break;
4674	>	sb.append(',').append(' ');
4675	>	}
4676	>	}
4677	>	return sb.append(']').toString();
4678	>	}
4679	>
4680	>	public final boolean containsAll(Collection<?> c) {
4681	>	if (c != this) {
4682	>	for (Iterator<?> it = c.iterator(); it.hasNext();) {
4683	>	Object e = it.next();
4684	>	if (e == null || !contains(e))
4685	>	return false;
4686	>	}
4687	>	}
4688	>	return true;
4689	>	}
4690	>
4691	>	public final boolean removeAll(Collection<?> c) {
4692	>	boolean modified = false;
4693	>	for (Iterator<?> it = iterator(); it.hasNext();) {
4694	>	if (c.contains(it.next())) {
4695	>	it.remove();
4696	>	modified = true;
4697	>	}
4698	>	}
4699	>	return modified;
4700	>	}
4701	>
4702	>	public final boolean retainAll(Collection<?> c) {
4703	>	boolean modified = false;
4704	>	for (Iterator<?> it = iterator(); it.hasNext();) {
4705	>	if (!c.contains(it.next())) {
4706	>	it.remove();
4707	>	modified = true;
4708	>	}
4709	>	}
4710	>	return modified;
4711	>	}
4712	>
4713	>	}
4714	>
4715	>	/**
4716	>	* A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in
4717	>	* which additions may optionally be enabled by mapping to a
4718	>	* common value.  This class cannot be directly instantiated. See
4719	>	* {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()},
4720	>	* {@link #newKeySet(int)}.
4721	>	*/
4722	>	public static class KeySetView<K,V> extends CHMView<K,V>
4723	>	implements Set<K>, java.io.Serializable {
4724	>	private static final long serialVersionUID = 7249069246763182397L;
4725	>	private final V value;
4726	>	KeySetView(ConcurrentHashMapV8<K, V> map, V value) {  // non-public
4727	>	super(map);
4728	>	this.value = value;
4729	>	}
4730	>
4731	>	/**
4732	>	* Returns the default mapped value for additions,
4733	>	* or {@code null} if additions are not supported.
4734	>	*
4735	>	* @return the default mapped value for additions, or {@code null}
4736	>	* if not supported.
4737	>	*/
4738	>	public V getMappedValue() { return value; }
4739	>
4740	>	// implement Set API
4741	>
4742	>	public boolean contains(Object o) { return map.containsKey(o); }
4743	>	public boolean remove(Object o)   { return map.remove(o) != null; }
4744	>
4745	>	/**
4746	>	* Returns a "weakly consistent" iterator that will never
4747	>	* throw {@link ConcurrentModificationException}, and
4748	>	* guarantees to traverse elements as they existed upon
4749	>	* construction of the iterator, and may (but is not
4750	>	* guaranteed to) reflect any modifications subsequent to
4751	>	* construction.
4752	>	*
4753	>	* @return an iterator over the keys of this map
4754	>	*/
4755	>	public Iterator<K> iterator()     { return new KeyIterator<K,V>(map); }
4756	>	public boolean add(K e) {
4757	>	V v;
4758	>	if ((v = value) == null)
4759	>	throw new UnsupportedOperationException();
4760	>	if (e == null)
4761	>	throw new NullPointerException();
4762	>	return map.internalPut(e, v, true) == null;
4763	>	}
4764	>	public boolean addAll(Collection<? extends K> c) {
4765	>	boolean added = false;
4766	>	V v;
4767	>	if ((v = value) == null)
4768	>	throw new UnsupportedOperationException();
4769	>	for (K e : c) {
4770	>	if (e == null)
4771	>	throw new NullPointerException();
4772	>	if (map.internalPut(e, v, true) == null)
4773	>	added = true;
4774	>	}
4775	>	return added;
4776	>	}
4777	>	public boolean equals(Object o) {
4778	>	Set<?> c;
4779	>	return ((o instanceof Set) &&
4780	>	((c = (Set<?>)o) == this ||
4781	>	(containsAll(c) && c.containsAll(this))));
4782	>	}
4783	>	}
4784	>
4785	>	/**
4786	>	* A view of a ConcurrentHashMapV8 as a {@link Collection} of
4787	>	* values, in which additions are disabled. This class cannot be
4788	>	* directly instantiated. See {@link #values},
4789	>	*
4790	>	* <p>The view's {@code iterator} is a "weakly consistent" iterator
4791	>	* that will never throw {@link ConcurrentModificationException},
4792	>	* and guarantees to traverse elements as they existed upon
4793	>	* construction of the iterator, and may (but is not guaranteed to)
4794	>	* reflect any modifications subsequent to construction.
4795	>	*/
4796	>	public static final class ValuesView<K,V> extends CHMView<K,V>
4797	>	implements Collection<V> {
4798	>	ValuesView(ConcurrentHashMapV8<K, V> map)   { super(map); }
4799	>	public final boolean contains(Object o) { return map.containsValue(o); }
4800	>	public final boolean remove(Object o) {
4801	>	if (o != null) {
4802	>	Iterator<V> it = new ValueIterator<K,V>(map);
4803	>	while (it.hasNext()) {
4804	>	if (o.equals(it.next())) {
4805	>	it.remove();
4806	>	return true;
4807	>	}
4808	>	}
4809	>	}
4810	>	return false;
4811	>	}
4812	>
4813	>	/**
4814	>	* Returns a "weakly consistent" iterator that will never
4815	>	* throw {@link ConcurrentModificationException}, and
4816	>	* guarantees to traverse elements as they existed upon
4817	>	* construction of the iterator, and may (but is not
4818	>	* guaranteed to) reflect any modifications subsequent to
4819	>	* construction.
4820	>	*
4821	>	* @return an iterator over the values of this map
4822	>	*/
4823	>	public final Iterator<V> iterator() {
4824	>	return new ValueIterator<K,V>(map);
4825	>	}
4826	>	public final boolean add(V e) {
4827	>	throw new UnsupportedOperationException();
4828	>	}
4829	>	public final boolean addAll(Collection<? extends V> c) {
4830	>	throw new UnsupportedOperationException();
4831	>	}
4832	>
4833	>	}
4834	>
4835	>	/**
4836	>	* A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value)
4837	>	* entries.  This class cannot be directly instantiated. See
4838	>	* {@link #entrySet}.
4839	>	*/
4840	>	public static final class EntrySetView<K,V> extends CHMView<K,V>
4841	>	implements Set<Map.Entry<K,V>> {
4842	>	EntrySetView(ConcurrentHashMapV8<K, V> map) { super(map); }
4843	>	public final boolean contains(Object o) {
4844	>	Object k, v, r; Map.Entry<?,?> e;
4845	>	return ((o instanceof Map.Entry) &&
4846	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4847	>	(r = map.get(k)) != null &&
4848	>	(v = e.getValue()) != null &&
4849	>	(v == r || v.equals(r)));
4850	>	}
4851	>	public final boolean remove(Object o) {
4852	>	Object k, v; Map.Entry<?,?> e;
4853	>	return ((o instanceof Map.Entry) &&
4854	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4855	>	(v = e.getValue()) != null &&
4856	>	map.remove(k, v));
4857	>	}
4858	>
4859	>	/**
4860	>	* Returns a "weakly consistent" iterator that will never
4861	>	* throw {@link ConcurrentModificationException}, and
4862	>	* guarantees to traverse elements as they existed upon
4863	>	* construction of the iterator, and may (but is not
4864	>	* guaranteed to) reflect any modifications subsequent to
4865	>	* construction.
4866	>	*
4867	>	* @return an iterator over the entries of this map
4868	>	*/
4869	>	public final Iterator<Map.Entry<K,V>> iterator() {
4870	>	return new EntryIterator<K,V>(map);
4871	>	}
4872	>
4873	>	public final boolean add(Entry<K,V> e) {
4874	>	K key = e.getKey();
4875	>	V value = e.getValue();
4876	>	if (key == null || value == null)
4877	>	throw new NullPointerException();
4878	>	return map.internalPut(key, value, false) == null;
4879	>	}
4880	>	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
4881	>	boolean added = false;
4882	>	for (Entry<K,V> e : c) {
4883	>	if (add(e))
4884	>	added = true;
4885	>	}
4886	>	return added;
4887	>	}
4888	>	public boolean equals(Object o) {
4889	>	Set<?> c;
4890	>	return ((o instanceof Set) &&
4891	>	((c = (Set<?>)o) == this ||
4892	>	(containsAll(c) && c.containsAll(this))));
4893	>	}
4894	>	}
4895	>
4896	>	// ---------------------------------------------------------------------
4897	>
4898	>	/**
4899	>	* Predefined tasks for performing bulk parallel operations on
4900	>	* ConcurrentHashMapV8s. These tasks follow the forms and rules used
4901	>	* for bulk operations. Each method has the same name, but returns
4902	>	* a task rather than invoking it. These methods may be useful in
4903	>	* custom applications such as submitting a task without waiting
4904	>	* for completion, using a custom pool, or combining with other
4905	>	* tasks.
4906	>	*/
4907	>	public static class ForkJoinTasks {
4908	>	private ForkJoinTasks() {}
4909	>
4910	>	/**
4911	>	* Returns a task that when invoked, performs the given
4912	>	* action for each (key, value)
4913	>	*
4914	>	* @param map the map
4915	>	* @param action the action
4916	>	* @return the task
4917	>	*/
4918	>	public static <K,V> ForkJoinTask<Void> forEach
4919	>	(ConcurrentHashMapV8<K,V> map,
4920	>	BiAction<K,V> action) {
4921	>	if (action == null) throw new NullPointerException();
4922	>	return new ForEachMappingTask<K,V>(map, null, -1, action);
4923	>	}
4924	>
4925	>	/**
4926	>	* Returns a task that when invoked, performs the given
4927	>	* action for each non-null transformation of each (key, value)
4928	>	*
4929	>	* @param map the map
4930	>	* @param transformer a function returning the transformation
4931	>	* for an element, or null if there is no transformation (in
4932	>	* which case the action is not applied)
4933	>	* @param action the action
4934	>	* @return the task
4935	>	*/
4936	>	public static <K,V,U> ForkJoinTask<Void> forEach
4937	>	(ConcurrentHashMapV8<K,V> map,
4938	>	BiFun<? super K, ? super V, ? extends U> transformer,
4939	>	Action<U> action) {
4940	>	if (transformer == null || action == null)
4941	>	throw new NullPointerException();
4942	>	return new ForEachTransformedMappingTask<K,V,U>
4943	>	(map, null, -1, transformer, action);
4944	>	}
4945	>
4946	>	/**
4947	>	* Returns a task that when invoked, returns a non-null result
4948	>	* from applying the given search function on each (key,
4949	>	* value), or null if none. Upon success, further element
4950	>	* processing is suppressed and the results of any other
4951	>	* parallel invocations of the search function are ignored.
4952	>	*
4953	>	* @param map the map
4954	>	* @param searchFunction a function returning a non-null
4955	>	* result on success, else null
4956	>	* @return the task
4957	>	*/
4958	>	public static <K,V,U> ForkJoinTask<U> search
4959	>	(ConcurrentHashMapV8<K,V> map,
4960	>	BiFun<? super K, ? super V, ? extends U> searchFunction) {
4961	>	if (searchFunction == null) throw new NullPointerException();
4962	>	return new SearchMappingsTask<K,V,U>
4963	>	(map, null, -1, searchFunction,
4964	>	new AtomicReference<U>());
4965	>	}
4966	>
4967	>	/**
4968	>	* Returns a task that when invoked, returns the result of
4969	>	* accumulating the given transformation of all (key, value) pairs
4970	>	* using the given reducer to combine values, or null if none.
4971	>	*
4972	>	* @param map the map
4973	>	* @param transformer a function returning the transformation
4974	>	* for an element, or null if there is no transformation (in
4975	>	* which case it is not combined).
4976	>	* @param reducer a commutative associative combining function
4977	>	* @return the task
4978	>	*/
4979	>	public static <K,V,U> ForkJoinTask<U> reduce
4980	>	(ConcurrentHashMapV8<K,V> map,
4981	>	BiFun<? super K, ? super V, ? extends U> transformer,
4982	>	BiFun<? super U, ? super U, ? extends U> reducer) {
4983	>	if (transformer == null || reducer == null)
4984	>	throw new NullPointerException();
4985	>	return new MapReduceMappingsTask<K,V,U>
4986	>	(map, null, -1, null, transformer, reducer);
4987	>	}
4988	>
4989	>	/**
4990	>	* Returns a task that when invoked, returns the result of
4991	>	* accumulating the given transformation of all (key, value) pairs
4992	>	* using the given reducer to combine values, and the given
4993	>	* basis as an identity value.
4994	>	*
4995	>	* @param map the map
4996	>	* @param transformer a function returning the transformation
4997	>	* for an element
4998	>	* @param basis the identity (initial default value) for the reduction
4999	>	* @param reducer a commutative associative combining function
5000	>	* @return the task
5001	>	*/
5002	>	public static <K,V> ForkJoinTask<Double> reduceToDouble
5003	>	(ConcurrentHashMapV8<K,V> map,
5004	>	ObjectByObjectToDouble<? super K, ? super V> transformer,
5005	>	double basis,
5006	>	DoubleByDoubleToDouble reducer) {
5007	>	if (transformer == null || reducer == null)
5008	>	throw new NullPointerException();
5009	>	return new MapReduceMappingsToDoubleTask<K,V>
5010	>	(map, null, -1, null, transformer, basis, reducer);
5011	>	}
5012	>
5013	>	/**
5014	>	* Returns a task that when invoked, returns the result of
5015	>	* accumulating the given transformation of all (key, value) pairs
5016	>	* using the given reducer to combine values, and the given
5017	>	* basis as an identity value.
5018	>	*
5019	>	* @param map the map
5020	>	* @param transformer a function returning the transformation
5021	>	* for an element
5022	>	* @param basis the identity (initial default value) for the reduction
5023	>	* @param reducer a commutative associative combining function
5024	>	* @return the task
5025	>	*/
5026	>	public static <K,V> ForkJoinTask<Long> reduceToLong
5027	>	(ConcurrentHashMapV8<K,V> map,
5028	>	ObjectByObjectToLong<? super K, ? super V> transformer,
5029	>	long basis,
5030	>	LongByLongToLong reducer) {
5031	>	if (transformer == null || reducer == null)
5032	>	throw new NullPointerException();
5033	>	return new MapReduceMappingsToLongTask<K,V>
5034	>	(map, null, -1, null, transformer, basis, reducer);
5035	>	}
5036	>
5037	>	/**
5038	>	* Returns a task that when invoked, returns the result of
5039	>	* accumulating the given transformation of all (key, value) pairs
5040	>	* using the given reducer to combine values, and the given
5041	>	* basis as an identity value.
5042	>	*
5043	>	* @param transformer a function returning the transformation
5044	>	* for an element
5045	>	* @param basis the identity (initial default value) for the reduction
5046	>	* @param reducer a commutative associative combining function
5047	>	* @return the task
5048	>	*/
5049	>	public static <K,V> ForkJoinTask<Integer> reduceToInt
5050	>	(ConcurrentHashMapV8<K,V> map,
5051	>	ObjectByObjectToInt<? super K, ? super V> transformer,
5052	>	int basis,
5053	>	IntByIntToInt reducer) {
5054	>	if (transformer == null || reducer == null)
5055	>	throw new NullPointerException();
5056	>	return new MapReduceMappingsToIntTask<K,V>
5057	>	(map, null, -1, null, transformer, basis, reducer);
5058	>	}
5059	>
5060	>	/**
5061	>	* Returns a task that when invoked, performs the given action
5062	>	* for each key.
5063	>	*
5064	>	* @param map the map
5065	>	* @param action the action
5066	>	* @return the task
5067	>	*/
5068	>	public static <K,V> ForkJoinTask<Void> forEachKey
5069	>	(ConcurrentHashMapV8<K,V> map,
5070	>	Action<K> action) {
5071	>	if (action == null) throw new NullPointerException();
5072	>	return new ForEachKeyTask<K,V>(map, null, -1, action);
5073	>	}
5074	>
5075	>	/**
5076	>	* Returns a task that when invoked, performs the given action
5077	>	* for each non-null transformation of each key.
5078	>	*
5079	>	* @param map the map
5080	>	* @param transformer a function returning the transformation
5081	>	* for an element, or null if there is no transformation (in
5082	>	* which case the action is not applied)
5083	>	* @param action the action
5084	>	* @return the task
5085	>	*/
5086	>	public static <K,V,U> ForkJoinTask<Void> forEachKey
5087	>	(ConcurrentHashMapV8<K,V> map,
5088	>	Fun<? super K, ? extends U> transformer,
5089	>	Action<U> action) {
5090	>	if (transformer == null || action == null)
5091	>	throw new NullPointerException();
5092	>	return new ForEachTransformedKeyTask<K,V,U>
5093	>	(map, null, -1, transformer, action);
5094	>	}
5095	>
5096	>	/**
5097	>	* Returns a task that when invoked, returns a non-null result
5098	>	* from applying the given search function on each key, or
5099	>	* null if none.  Upon success, further element processing is
5100	>	* suppressed and the results of any other parallel
5101	>	* invocations of the search function are ignored.
5102	>	*
5103	>	* @param map the map
5104	>	* @param searchFunction a function returning a non-null
5105	>	* result on success, else null
5106	>	* @return the task
5107	>	*/
5108	>	public static <K,V,U> ForkJoinTask<U> searchKeys
5109	>	(ConcurrentHashMapV8<K,V> map,
5110	>	Fun<? super K, ? extends U> searchFunction) {
5111	>	if (searchFunction == null) throw new NullPointerException();
5112	>	return new SearchKeysTask<K,V,U>
5113	>	(map, null, -1, searchFunction,
5114	>	new AtomicReference<U>());
5115	>	}
5116	>
5117	>	/**
5118	>	* Returns a task that when invoked, returns the result of
5119	>	* accumulating all keys using the given reducer to combine
5120	>	* values, or null if none.
5121	>	*
5122	>	* @param map the map
5123	>	* @param reducer a commutative associative combining function
5124	>	* @return the task
5125	>	*/
5126	>	public static <K,V> ForkJoinTask<K> reduceKeys
5127	>	(ConcurrentHashMapV8<K,V> map,
5128	>	BiFun<? super K, ? super K, ? extends K> reducer) {
5129	>	if (reducer == null) throw new NullPointerException();
5130	>	return new ReduceKeysTask<K,V>
5131	>	(map, null, -1, null, reducer);
5132	>	}
5133	>
5134	>	/**
5135	>	* Returns a task that when invoked, returns the result of
5136	>	* accumulating the given transformation of all keys using the given
5137	>	* reducer to combine values, or null if none.
5138	>	*
5139	>	* @param map the map
5140	>	* @param transformer a function returning the transformation
5141	>	* for an element, or null if there is no transformation (in
5142	>	* which case it is not combined).
5143	>	* @param reducer a commutative associative combining function
5144	>	* @return the task
5145	>	*/
5146	>	public static <K,V,U> ForkJoinTask<U> reduceKeys
5147	>	(ConcurrentHashMapV8<K,V> map,
5148	>	Fun<? super K, ? extends U> transformer,
5149	>	BiFun<? super U, ? super U, ? extends U> reducer) {
5150	>	if (transformer == null || reducer == null)
5151	>	throw new NullPointerException();
5152	>	return new MapReduceKeysTask<K,V,U>
5153	>	(map, null, -1, null, transformer, reducer);
5154	>	}
5155	>
5156	>	/**
5157	>	* Returns a task that when invoked, returns the result of
5158	>	* accumulating the given transformation of all keys using the given
5159	>	* reducer to combine values, and the given basis as an
5160	>	* identity value.
5161	>	*
5162	>	* @param map the map
5163	>	* @param transformer a function returning the transformation
5164	>	* for an element
5165	>	* @param basis the identity (initial default value) for the reduction
5166	>	* @param reducer a commutative associative combining function
5167	>	* @return the task
5168	>	*/
5169	>	public static <K,V> ForkJoinTask<Double> reduceKeysToDouble
5170	>	(ConcurrentHashMapV8<K,V> map,
5171	>	ObjectToDouble<? super K> transformer,
5172	>	double basis,
5173	>	DoubleByDoubleToDouble reducer) {
5174	>	if (transformer == null || reducer == null)
5175	>	throw new NullPointerException();
5176	>	return new MapReduceKeysToDoubleTask<K,V>
5177	>	(map, null, -1, null, transformer, basis, reducer);
5178	>	}
5179	>
5180	>	/**
5181	>	* Returns a task that when invoked, returns the result of
5182	>	* accumulating the given transformation of all keys using the given
5183	>	* reducer to combine values, and the given basis as an
5184	>	* identity value.
5185	>	*
5186	>	* @param map the map
5187	>	* @param transformer a function returning the transformation
5188	>	* for an element
5189	>	* @param basis the identity (initial default value) for the reduction
5190	>	* @param reducer a commutative associative combining function
5191	>	* @return the task
5192	>	*/
5193	>	public static <K,V> ForkJoinTask<Long> reduceKeysToLong
5194	>	(ConcurrentHashMapV8<K,V> map,
5195	>	ObjectToLong<? super K> transformer,
5196	>	long basis,
5197	>	LongByLongToLong reducer) {
5198	>	if (transformer == null || reducer == null)
5199	>	throw new NullPointerException();
5200	>	return new MapReduceKeysToLongTask<K,V>
5201	>	(map, null, -1, null, transformer, basis, reducer);
5202	>	}
5203	>
5204	>	/**
5205	>	* Returns a task that when invoked, returns the result of
5206	>	* accumulating the given transformation of all keys using the given
5207	>	* reducer to combine values, and the given basis as an
5208	>	* identity value.
5209	>	*
5210	>	* @param map the map
5211	>	* @param transformer a function returning the transformation
5212	>	* for an element
5213	>	* @param basis the identity (initial default value) for the reduction
5214	>	* @param reducer a commutative associative combining function
5215	>	* @return the task
5216	>	*/
5217	>	public static <K,V> ForkJoinTask<Integer> reduceKeysToInt
5218	>	(ConcurrentHashMapV8<K,V> map,
5219	>	ObjectToInt<? super K> transformer,
5220	>	int basis,
5221	>	IntByIntToInt reducer) {
5222	>	if (transformer == null || reducer == null)
5223	>	throw new NullPointerException();
5224	>	return new MapReduceKeysToIntTask<K,V>
5225	>	(map, null, -1, null, transformer, basis, reducer);
5226	>	}
5227	>
5228	>	/**
5229	>	* Returns a task that when invoked, performs the given action
5230	>	* for each value.
5231	>	*
5232	>	* @param map the map
5233	>	* @param action the action
5234	>	*/
5235	>	public static <K,V> ForkJoinTask<Void> forEachValue
5236	>	(ConcurrentHashMapV8<K,V> map,
5237	>	Action<V> action) {
5238	>	if (action == null) throw new NullPointerException();
5239	>	return new ForEachValueTask<K,V>(map, null, -1, action);
5240	>	}
5241	>
5242	>	/**
5243	>	* Returns a task that when invoked, performs the given action
5244	>	* for each non-null transformation of each value.
5245	>	*
5246	>	* @param map the map
5247	>	* @param transformer a function returning the transformation
5248	>	* for an element, or null if there is no transformation (in
5249	>	* which case the action is not applied)
5250	>	* @param action the action
5251	>	*/
5252	>	public static <K,V,U> ForkJoinTask<Void> forEachValue
5253	>	(ConcurrentHashMapV8<K,V> map,
5254	>	Fun<? super V, ? extends U> transformer,
5255	>	Action<U> action) {
5256	>	if (transformer == null || action == null)
5257	>	throw new NullPointerException();
5258	>	return new ForEachTransformedValueTask<K,V,U>
5259	>	(map, null, -1, transformer, action);
5260	>	}
5261	>
5262	>	/**
5263	>	* Returns a task that when invoked, returns a non-null result
5264	>	* from applying the given search function on each value, or
5265	>	* null if none.  Upon success, further element processing is
5266	>	* suppressed and the results of any other parallel
5267	>	* invocations of the search function are ignored.
5268	>	*
5269	>	* @param map the map
5270	>	* @param searchFunction a function returning a non-null
5271	>	* result on success, else null
5272	>	* @return the task
5273	>	*/
5274	>	public static <K,V,U> ForkJoinTask<U> searchValues
5275	>	(ConcurrentHashMapV8<K,V> map,
5276	>	Fun<? super V, ? extends U> searchFunction) {
5277	>	if (searchFunction == null) throw new NullPointerException();
5278	>	return new SearchValuesTask<K,V,U>
5279	>	(map, null, -1, searchFunction,
5280	>	new AtomicReference<U>());
5281	>	}
5282	>
5283	>	/**
5284	>	* Returns a task that when invoked, returns the result of
5285	>	* accumulating all values using the given reducer to combine
5286	>	* values, or null if none.
5287	>	*
5288	>	* @param map the map
5289	>	* @param reducer a commutative associative combining function
5290	>	* @return the task
5291	>	*/
5292	>	public static <K,V> ForkJoinTask<V> reduceValues
5293	>	(ConcurrentHashMapV8<K,V> map,
5294	>	BiFun<? super V, ? super V, ? extends V> reducer) {
5295	>	if (reducer == null) throw new NullPointerException();
5296	>	return new ReduceValuesTask<K,V>
5297	>	(map, null, -1, null, reducer);
5298	>	}
5299	>
5300	>	/**
5301	>	* Returns a task that when invoked, returns the result of
5302	>	* accumulating the given transformation of all values using the
5303	>	* given reducer to combine values, or null if none.
5304	>	*
5305	>	* @param map the map
5306	>	* @param transformer a function returning the transformation
5307	>	* for an element, or null if there is no transformation (in
5308	>	* which case it is not combined).
5309	>	* @param reducer a commutative associative combining function
5310	>	* @return the task
5311	>	*/
5312	>	public static <K,V,U> ForkJoinTask<U> reduceValues
5313	>	(ConcurrentHashMapV8<K,V> map,
5314	>	Fun<? super V, ? extends U> transformer,
5315	>	BiFun<? super U, ? super U, ? extends U> reducer) {
5316	>	if (transformer == null || reducer == null)
5317	>	throw new NullPointerException();
5318	>	return new MapReduceValuesTask<K,V,U>
5319	>	(map, null, -1, null, transformer, reducer);
5320	>	}
5321	>
5322	>	/**
5323	>	* Returns a task that when invoked, returns the result of
5324	>	* accumulating the given transformation of all values using the
5325	>	* given reducer to combine values, and the given basis as an
5326	>	* identity value.
5327	>	*
5328	>	* @param map the map
5329	>	* @param transformer a function returning the transformation
5330	>	* for an element
5331	>	* @param basis the identity (initial default value) for the reduction
5332	>	* @param reducer a commutative associative combining function
5333	>	* @return the task
5334	>	*/
5335	>	public static <K,V> ForkJoinTask<Double> reduceValuesToDouble
5336	>	(ConcurrentHashMapV8<K,V> map,
5337	>	ObjectToDouble<? super V> transformer,
5338	>	double basis,
5339	>	DoubleByDoubleToDouble reducer) {
5340	>	if (transformer == null || reducer == null)
5341	>	throw new NullPointerException();
5342	>	return new MapReduceValuesToDoubleTask<K,V>
5343	>	(map, null, -1, null, transformer, basis, reducer);
5344	>	}
5345	>
5346	>	/**
5347	>	* Returns a task that when invoked, returns the result of
5348	>	* accumulating the given transformation of all values using the
5349	>	* given reducer to combine values, and the given basis as an
5350	>	* identity value.
5351	>	*
5352	>	* @param map the map
5353	>	* @param transformer a function returning the transformation
5354	>	* for an element
5355	>	* @param basis the identity (initial default value) for the reduction
5356	>	* @param reducer a commutative associative combining function
5357	>	* @return the task
5358	>	*/
5359	>	public static <K,V> ForkJoinTask<Long> reduceValuesToLong
5360	>	(ConcurrentHashMapV8<K,V> map,
5361	>	ObjectToLong<? super V> transformer,
5362	>	long basis,
5363	>	LongByLongToLong reducer) {
5364	>	if (transformer == null || reducer == null)
5365	>	throw new NullPointerException();
5366	>	return new MapReduceValuesToLongTask<K,V>
5367	>	(map, null, -1, null, transformer, basis, reducer);
5368	>	}
5369	>
5370	>	/**
5371	>	* Returns a task that when invoked, returns the result of
5372	>	* accumulating the given transformation of all values using the
5373	>	* given reducer to combine values, and the given basis as an
5374	>	* identity value.
5375	>	*
5376	>	* @param map the map
5377	>	* @param transformer a function returning the transformation
5378	>	* for an element
5379	>	* @param basis the identity (initial default value) for the reduction
5380	>	* @param reducer a commutative associative combining function
5381	>	* @return the task
5382	>	*/
5383	>	public static <K,V> ForkJoinTask<Integer> reduceValuesToInt
5384	>	(ConcurrentHashMapV8<K,V> map,
5385	>	ObjectToInt<? super V> transformer,
5386	>	int basis,
5387	>	IntByIntToInt reducer) {
5388	>	if (transformer == null || reducer == null)
5389	>	throw new NullPointerException();
5390	>	return new MapReduceValuesToIntTask<K,V>
5391	>	(map, null, -1, null, transformer, basis, reducer);
5392	>	}
5393	>
5394	>	/**
5395	>	* Returns a task that when invoked, perform the given action
5396	>	* for each entry.
5397	>	*
5398	>	* @param map the map
5399	>	* @param action the action
5400	>	*/
5401	>	public static <K,V> ForkJoinTask<Void> forEachEntry
5402	>	(ConcurrentHashMapV8<K,V> map,
5403	>	Action<Map.Entry<K,V>> action) {
5404	>	if (action == null) throw new NullPointerException();
5405	>	return new ForEachEntryTask<K,V>(map, null, -1, action);
5406	>	}
5407	>
5408	>	/**
5409	>	* Returns a task that when invoked, perform the given action
5410	>	* for each non-null transformation of each entry.
5411	>	*
5412	>	* @param map the map
5413	>	* @param transformer a function returning the transformation
5414	>	* for an element, or null if there is no transformation (in
5415	>	* which case the action is not applied)
5416	>	* @param action the action
5417	>	*/
5418	>	public static <K,V,U> ForkJoinTask<Void> forEachEntry
5419	>	(ConcurrentHashMapV8<K,V> map,
5420	>	Fun<Map.Entry<K,V>, ? extends U> transformer,
5421	>	Action<U> action) {
5422	>	if (transformer == null || action == null)
5423	>	throw new NullPointerException();
5424	>	return new ForEachTransformedEntryTask<K,V,U>
5425	>	(map, null, -1, transformer, action);
5426	>	}
5427	>
5428	>	/**
5429	>	* Returns a task that when invoked, returns a non-null result
5430	>	* from applying the given search function on each entry, or
5431	>	* null if none.  Upon success, further element processing is
5432	>	* suppressed and the results of any other parallel
5433	>	* invocations of the search function are ignored.
5434	>	*
5435	>	* @param map the map
5436	>	* @param searchFunction a function returning a non-null
5437	>	* result on success, else null
5438	>	* @return the task
5439	>	*/
5440	>	public static <K,V,U> ForkJoinTask<U> searchEntries
5441	>	(ConcurrentHashMapV8<K,V> map,
5442	>	Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
5443	>	if (searchFunction == null) throw new NullPointerException();
5444	>	return new SearchEntriesTask<K,V,U>
5445	>	(map, null, -1, searchFunction,
5446	>	new AtomicReference<U>());
5447	>	}
5448	>
5449	>	/**
5450	>	* Returns a task that when invoked, returns the result of
5451	>	* accumulating all entries using the given reducer to combine
5452	>	* values, or null if none.
5453	>	*
5454	>	* @param map the map
5455	>	* @param reducer a commutative associative combining function
5456	>	* @return the task
5457	>	*/
5458	>	public static <K,V> ForkJoinTask<Map.Entry<K,V>> reduceEntries
5459	>	(ConcurrentHashMapV8<K,V> map,
5460	>	BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5461	>	if (reducer == null) throw new NullPointerException();
5462	>	return new ReduceEntriesTask<K,V>
5463	>	(map, null, -1, null, reducer);
5464	>	}
5465	>
5466	>	/**
5467	>	* Returns a task that when invoked, returns the result of
5468	>	* accumulating the given transformation of all entries using the
5469	>	* given reducer to combine values, or null if none.
5470	>	*
5471	>	* @param map the map
5472	>	* @param transformer a function returning the transformation
5473	>	* for an element, or null if there is no transformation (in
5474	>	* which case it is not combined).
5475	>	* @param reducer a commutative associative combining function
5476	>	* @return the task
5477	>	*/
5478	>	public static <K,V,U> ForkJoinTask<U> reduceEntries
5479	>	(ConcurrentHashMapV8<K,V> map,
5480	>	Fun<Map.Entry<K,V>, ? extends U> transformer,
5481	>	BiFun<? super U, ? super U, ? extends U> reducer) {
5482	>	if (transformer == null || reducer == null)
5483	>	throw new NullPointerException();
5484	>	return new MapReduceEntriesTask<K,V,U>
5485	>	(map, null, -1, null, transformer, reducer);
5486	>	}
5487	>
5488	>	/**
5489	>	* Returns a task that when invoked, returns the result of
5490	>	* accumulating the given transformation of all entries using the
5491	>	* given reducer to combine values, and the given basis as an
5492	>	* identity value.
5493	>	*
5494	>	* @param map the map
5495	>	* @param transformer a function returning the transformation
5496	>	* for an element
5497	>	* @param basis the identity (initial default value) for the reduction
5498	>	* @param reducer a commutative associative combining function
5499	>	* @return the task
5500	>	*/
5501	>	public static <K,V> ForkJoinTask<Double> reduceEntriesToDouble
5502	>	(ConcurrentHashMapV8<K,V> map,
5503	>	ObjectToDouble<Map.Entry<K,V>> transformer,
5504	>	double basis,
5505	>	DoubleByDoubleToDouble reducer) {
5506	>	if (transformer == null || reducer == null)
5507	>	throw new NullPointerException();
5508	>	return new MapReduceEntriesToDoubleTask<K,V>
5509	>	(map, null, -1, null, transformer, basis, reducer);
5510	>	}
5511	>
5512	>	/**
5513	>	* Returns a task that when invoked, returns the result of
5514	>	* accumulating the given transformation of all entries using the
5515	>	* given reducer to combine values, and the given basis as an
5516	>	* identity value.
5517	>	*
5518	>	* @param map the map
5519	>	* @param transformer a function returning the transformation
5520	>	* for an element
5521	>	* @param basis the identity (initial default value) for the reduction
5522	>	* @param reducer a commutative associative combining function
5523	>	* @return the task
5524	>	*/
5525	>	public static <K,V> ForkJoinTask<Long> reduceEntriesToLong
5526	>	(ConcurrentHashMapV8<K,V> map,
5527	>	ObjectToLong<Map.Entry<K,V>> transformer,
5528	>	long basis,
5529	>	LongByLongToLong reducer) {
5530	>	if (transformer == null || reducer == null)
5531	>	throw new NullPointerException();
5532	>	return new MapReduceEntriesToLongTask<K,V>
5533	>	(map, null, -1, null, transformer, basis, reducer);
5534	>	}
5535	>
5536	>	/**
5537	>	* Returns a task that when invoked, returns the result of
5538	>	* accumulating the given transformation of all entries using the
5539	>	* given reducer to combine values, and the given basis as an
5540	>	* identity value.
5541	>	*
5542	>	* @param map the map
5543	>	* @param transformer a function returning the transformation
5544	>	* for an element
5545	>	* @param basis the identity (initial default value) for the reduction
5546	>	* @param reducer a commutative associative combining function
5547	>	* @return the task
5548	>	*/
5549	>	public static <K,V> ForkJoinTask<Integer> reduceEntriesToInt
5550	>	(ConcurrentHashMapV8<K,V> map,
5551	>	ObjectToInt<Map.Entry<K,V>> transformer,
5552	>	int basis,
5553	>	IntByIntToInt reducer) {
5554	>	if (transformer == null || reducer == null)
5555	>	throw new NullPointerException();
5556	>	return new MapReduceEntriesToIntTask<K,V>
5557	>	(map, null, -1, null, transformer, basis, reducer);
5558	>	}
5559	>	}
5560	>
5561	>	// -------------------------------------------------------
5562	>
5563	>	/*
5564	>	* Task classes. Coded in a regular but ugly format/style to
5565	>	* simplify checks that each variant differs in the right way from
5566	>	* others. The null screenings exist because compilers cannot tell
5567	>	* that we've already null-checked task arguments, so we force
5568	>	* simplest hoisted bypass to help avoid convoluted traps.
5569	>	*/
5570	>
5571	>	@SuppressWarnings("serial") static final class ForEachKeyTask<K,V>
5572	>	extends Traverser<K,V,Void> {
5573	>	final Action<K> action;
5574	>	ForEachKeyTask
5575	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5576	>	Action<K> action) {
5577	>	super(m, p, b);
5578	>	this.action = action;
5579	>	}
5580	>	@SuppressWarnings("unchecked") public final void compute() {
5581	>	final Action<K> action;
5582	>	if ((action = this.action) != null) {
5583	>	for (int b; (b = preSplit()) > 0;)
5584	>	new ForEachKeyTask<K,V>(map, this, b, action).fork();
5585	>	while (advance() != null)
5586	>	action.apply((K)nextKey);
5587	>	propagateCompletion();
5588	>	}
5589	>	}
5590	>	}
5591	>
5592	>	@SuppressWarnings("serial") static final class ForEachValueTask<K,V>
5593	>	extends Traverser<K,V,Void> {
5594	>	final Action<V> action;
5595	>	ForEachValueTask
5596	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5597	>	Action<V> action) {
5598	>	super(m, p, b);
5599	>	this.action = action;
5600	>	}
5601	>	@SuppressWarnings("unchecked") public final void compute() {
5602	>	final Action<V> action;
5603	>	if ((action = this.action) != null) {
5604	>	for (int b; (b = preSplit()) > 0;)
5605	>	new ForEachValueTask<K,V>(map, this, b, action).fork();
5606	>	V v;
5607	>	while ((v = advance()) != null)
5608	>	action.apply(v);
5609	>	propagateCompletion();
5610	>	}
5611	>	}
5612	>	}
5613	>
5614	>	@SuppressWarnings("serial") static final class ForEachEntryTask<K,V>
5615	>	extends Traverser<K,V,Void> {
5616	>	final Action<Entry<K,V>> action;
5617	>	ForEachEntryTask
5618	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5619	>	Action<Entry<K,V>> action) {
5620	>	super(m, p, b);
5621	>	this.action = action;
5622	>	}
5623	>	@SuppressWarnings("unchecked") public final void compute() {
5624	>	final Action<Entry<K,V>> action;
5625	>	if ((action = this.action) != null) {
5626	>	for (int b; (b = preSplit()) > 0;)
5627	>	new ForEachEntryTask<K,V>(map, this, b, action).fork();
5628	>	V v;
5629	>	while ((v = advance()) != null)
5630	>	action.apply(entryFor((K)nextKey, v));
5631	>	propagateCompletion();
5632	>	}
5633	>	}
5634	>	}
5635	>
5636	>	@SuppressWarnings("serial") static final class ForEachMappingTask<K,V>
5637	>	extends Traverser<K,V,Void> {
5638	>	final BiAction<K,V> action;
5639	>	ForEachMappingTask
5640	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5641	>	BiAction<K,V> action) {
5642	>	super(m, p, b);
5643	>	this.action = action;
5644	>	}
5645	>	@SuppressWarnings("unchecked") public final void compute() {
5646	>	final BiAction<K,V> action;
5647	>	if ((action = this.action) != null) {
5648	>	for (int b; (b = preSplit()) > 0;)
5649	>	new ForEachMappingTask<K,V>(map, this, b, action).fork();
5650	>	V v;
5651	>	while ((v = advance()) != null)
5652	>	action.apply((K)nextKey, v);
5653	>	propagateCompletion();
5654	>	}
5655	>	}
5656	>	}
5657	>
5658	>	@SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U>
5659	>	extends Traverser<K,V,Void> {
5660	>	final Fun<? super K, ? extends U> transformer;
5661	>	final Action<U> action;
5662	>	ForEachTransformedKeyTask
5663	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5664	>	Fun<? super K, ? extends U> transformer, Action<U> action) {
5665	>	super(m, p, b);
5666	>	this.transformer = transformer; this.action = action;
5667	>	}
5668	>	@SuppressWarnings("unchecked") public final void compute() {
5669	>	final Fun<? super K, ? extends U> transformer;
5670	>	final Action<U> action;
5671	>	if ((transformer = this.transformer) != null &&
5672	>	(action = this.action) != null) {
5673	>	for (int b; (b = preSplit()) > 0;)
5674	>	new ForEachTransformedKeyTask<K,V,U>
5675	>	(map, this, b, transformer, action).fork();
5676	>	U u;
5677	>	while (advance() != null) {
5678	>	if ((u = transformer.apply((K)nextKey)) != null)
5679	>	action.apply(u);
5680	>	}
5681	>	propagateCompletion();
5682	>	}
5683	>	}
5684	>	}
5685	>
5686	>	@SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U>
5687	>	extends Traverser<K,V,Void> {
5688	>	final Fun<? super V, ? extends U> transformer;
5689	>	final Action<U> action;
5690	>	ForEachTransformedValueTask
5691	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5692	>	Fun<? super V, ? extends U> transformer, Action<U> action) {
5693	>	super(m, p, b);
5694	>	this.transformer = transformer; this.action = action;
5695	>	}
5696	>	@SuppressWarnings("unchecked") public final void compute() {
5697	>	final Fun<? super V, ? extends U> transformer;
5698	>	final Action<U> action;
5699	>	if ((transformer = this.transformer) != null &&
5700	>	(action = this.action) != null) {
5701	>	for (int b; (b = preSplit()) > 0;)
5702	>	new ForEachTransformedValueTask<K,V,U>
5703	>	(map, this, b, transformer, action).fork();
5704	>	V v; U u;
5705	>	while ((v = advance()) != null) {
5706	>	if ((u = transformer.apply(v)) != null)
5707	>	action.apply(u);
5708	>	}
5709	>	propagateCompletion();
5710	>	}
5711	>	}
5712	>	}
5713	>
5714	>	@SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U>
5715	>	extends Traverser<K,V,Void> {
5716	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5717	>	final Action<U> action;
5718	>	ForEachTransformedEntryTask
5719	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5720	>	Fun<Map.Entry<K,V>, ? extends U> transformer, Action<U> action) {
5721	>	super(m, p, b);
5722	>	this.transformer = transformer; this.action = action;
5723	>	}
5724	>	@SuppressWarnings("unchecked") public final void compute() {
5725	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5726	>	final Action<U> action;
5727	>	if ((transformer = this.transformer) != null &&
5728	>	(action = this.action) != null) {
5729	>	for (int b; (b = preSplit()) > 0;)
5730	>	new ForEachTransformedEntryTask<K,V,U>
5731	>	(map, this, b, transformer, action).fork();
5732	>	V v; U u;
5733	>	while ((v = advance()) != null) {
5734	>	if ((u = transformer.apply(entryFor((K)nextKey,
5735	>	v))) != null)
5736	>	action.apply(u);
5737	>	}
5738	>	propagateCompletion();
5739	>	}
5740	>	}
5741	>	}
5742	>
5743	>	@SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U>
5744	>	extends Traverser<K,V,Void> {
5745	>	final BiFun<? super K, ? super V, ? extends U> transformer;
5746	>	final Action<U> action;
5747	>	ForEachTransformedMappingTask
5748	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5749	>	BiFun<? super K, ? super V, ? extends U> transformer,
5750	>	Action<U> action) {
5751	>	super(m, p, b);
5752	>	this.transformer = transformer; this.action = action;
5753	>	}
5754	>	@SuppressWarnings("unchecked") public final void compute() {
5755	>	final BiFun<? super K, ? super V, ? extends U> transformer;
5756	>	final Action<U> action;
5757	>	if ((transformer = this.transformer) != null &&
5758	>	(action = this.action) != null) {
5759	>	for (int b; (b = preSplit()) > 0;)
5760	>	new ForEachTransformedMappingTask<K,V,U>
5761	>	(map, this, b, transformer, action).fork();
5762	>	V v; U u;
5763	>	while ((v = advance()) != null) {
5764	>	if ((u = transformer.apply((K)nextKey, v)) != null)
5765	>	action.apply(u);
5766	>	}
5767	>	propagateCompletion();
5768	>	}
5769	>	}
5770	>	}
5771	>
5772	>	@SuppressWarnings("serial") static final class SearchKeysTask<K,V,U>
5773	>	extends Traverser<K,V,U> {
5774	>	final Fun<? super K, ? extends U> searchFunction;
5775	>	final AtomicReference<U> result;
5776	>	SearchKeysTask
5777	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5778	>	Fun<? super K, ? extends U> searchFunction,
5779	>	AtomicReference<U> result) {
5780	>	super(m, p, b);
5781	>	this.searchFunction = searchFunction; this.result = result;
5782	>	}
5783	>	public final U getRawResult() { return result.get(); }
5784	>	@SuppressWarnings("unchecked") public final void compute() {
5785	>	final Fun<? super K, ? extends U> searchFunction;
5786	>	final AtomicReference<U> result;
5787	>	if ((searchFunction = this.searchFunction) != null &&
5788	>	(result = this.result) != null) {
5789	>	for (int b;;) {
5790	>	if (result.get() != null)
5791	>	return;
5792	>	if ((b = preSplit()) <= 0)
5793	>	break;
5794	>	new SearchKeysTask<K,V,U>
5795	>	(map, this, b, searchFunction, result).fork();
5796	>	}
5797	>	while (result.get() == null) {
5798	>	U u;
5799	>	if (advance() == null) {
5800	>	propagateCompletion();
5801	>	break;
5802	>	}
5803	>	if ((u = searchFunction.apply((K)nextKey)) != null) {
5804	>	if (result.compareAndSet(null, u))
5805	>	quietlyCompleteRoot();
5806	>	break;
5807	>	}
5808	>	}
5809	>	}
5810	>	}
5811	>	}
5812	>
5813	>	@SuppressWarnings("serial") static final class SearchValuesTask<K,V,U>
5814	>	extends Traverser<K,V,U> {
5815	>	final Fun<? super V, ? extends U> searchFunction;
5816	>	final AtomicReference<U> result;
5817	>	SearchValuesTask
5818	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5819	>	Fun<? super V, ? extends U> searchFunction,
5820	>	AtomicReference<U> result) {
5821	>	super(m, p, b);
5822	>	this.searchFunction = searchFunction; this.result = result;
5823	>	}
5824	>	public final U getRawResult() { return result.get(); }
5825	>	@SuppressWarnings("unchecked") public final void compute() {
5826	>	final Fun<? super V, ? extends U> searchFunction;
5827	>	final AtomicReference<U> result;
5828	>	if ((searchFunction = this.searchFunction) != null &&
5829	>	(result = this.result) != null) {
5830	>	for (int b;;) {
5831	>	if (result.get() != null)
5832	>	return;
5833	>	if ((b = preSplit()) <= 0)
5834	>	break;
5835	>	new SearchValuesTask<K,V,U>
5836	>	(map, this, b, searchFunction, result).fork();
5837	>	}
5838	>	while (result.get() == null) {
5839	>	V v; U u;
5840	>	if ((v = advance()) == null) {
5841	>	propagateCompletion();
5842	>	break;
5843	>	}
5844	>	if ((u = searchFunction.apply(v)) != null) {
5845	>	if (result.compareAndSet(null, u))
5846	>	quietlyCompleteRoot();
5847	>	break;
5848	>	}
5849	>	}
5850	>	}
5851	>	}
5852	>	}
5853	>
5854	>	@SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U>
5855	>	extends Traverser<K,V,U> {
5856	>	final Fun<Entry<K,V>, ? extends U> searchFunction;
5857	>	final AtomicReference<U> result;
5858	>	SearchEntriesTask
5859	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5860	>	Fun<Entry<K,V>, ? extends U> searchFunction,
5861	>	AtomicReference<U> result) {
5862	>	super(m, p, b);
5863	>	this.searchFunction = searchFunction; this.result = result;
5864	>	}
5865	>	public final U getRawResult() { return result.get(); }
5866	>	@SuppressWarnings("unchecked") public final void compute() {
5867	>	final Fun<Entry<K,V>, ? extends U> searchFunction;
5868	>	final AtomicReference<U> result;
5869	>	if ((searchFunction = this.searchFunction) != null &&
5870	>	(result = this.result) != null) {
5871	>	for (int b;;) {
5872	>	if (result.get() != null)
5873	>	return;
5874	>	if ((b = preSplit()) <= 0)
5875	>	break;
5876	>	new SearchEntriesTask<K,V,U>
5877	>	(map, this, b, searchFunction, result).fork();
5878	>	}
5879	>	while (result.get() == null) {
5880	>	V v; U u;
5881	>	if ((v = advance()) == null) {
5882	>	propagateCompletion();
5883	>	break;
5884	>	}
5885	>	if ((u = searchFunction.apply(entryFor((K)nextKey,
5886	>	v))) != null) {
5887	>	if (result.compareAndSet(null, u))
5888	>	quietlyCompleteRoot();
5889	>	return;
5890	>	}
5891	>	}
5892	>	}
5893	>	}
5894	>	}
5895	>
5896	>	@SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U>
5897	>	extends Traverser<K,V,U> {
5898	>	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5899	>	final AtomicReference<U> result;
5900	>	SearchMappingsTask
5901	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5902	>	BiFun<? super K, ? super V, ? extends U> searchFunction,
5903	>	AtomicReference<U> result) {
5904	>	super(m, p, b);
5905	>	this.searchFunction = searchFunction; this.result = result;
5906	>	}
5907	>	public final U getRawResult() { return result.get(); }
5908	>	@SuppressWarnings("unchecked") public final void compute() {
5909	>	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5910	>	final AtomicReference<U> result;
5911	>	if ((searchFunction = this.searchFunction) != null &&
5912	>	(result = this.result) != null) {
5913	>	for (int b;;) {
5914	>	if (result.get() != null)
5915	>	return;
5916	>	if ((b = preSplit()) <= 0)
5917	>	break;
5918	>	new SearchMappingsTask<K,V,U>
5919	>	(map, this, b, searchFunction, result).fork();
5920	>	}
5921	>	while (result.get() == null) {
5922	>	V v; U u;
5923	>	if ((v = advance()) == null) {
5924	>	propagateCompletion();
5925	>	break;
5926	>	}
5927	>	if ((u = searchFunction.apply((K)nextKey, v)) != null) {
5928	>	if (result.compareAndSet(null, u))
5929	>	quietlyCompleteRoot();
5930	>	break;
5931	>	}
5932	>	}
5933	>	}
5934	>	}
5935	>	}
5936	>
5937	>	@SuppressWarnings("serial") static final class ReduceKeysTask<K,V>
5938	>	extends Traverser<K,V,K> {
5939	>	final BiFun<? super K, ? super K, ? extends K> reducer;
5940	>	K result;
5941	>	ReduceKeysTask<K,V> rights, nextRight;
5942	>	ReduceKeysTask
5943	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5944	>	ReduceKeysTask<K,V> nextRight,
5945	>	BiFun<? super K, ? super K, ? extends K> reducer) {
5946	>	super(m, p, b); this.nextRight = nextRight;
5947	>	this.reducer = reducer;
5948	>	}
5949	>	public final K getRawResult() { return result; }
5950	>	@SuppressWarnings("unchecked") public final void compute() {
5951	>	final BiFun<? super K, ? super K, ? extends K> reducer;
5952	>	if ((reducer = this.reducer) != null) {
5953	>	for (int b; (b = preSplit()) > 0;)
5954	>	(rights = new ReduceKeysTask<K,V>
5955	>	(map, this, b, rights, reducer)).fork();
5956	>	K r = null;
5957	>	while (advance() != null) {
5958	>	K u = (K)nextKey;
5959	>	r = (r == null) ? u : reducer.apply(r, u);
5960	>	}
5961	>	result = r;
5962	>	CountedCompleter<?> c;
5963	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5964	>	ReduceKeysTask<K,V>
5965	>	t = (ReduceKeysTask<K,V>)c,
5966	>	s = t.rights;
5967	>	while (s != null) {
5968	>	K tr, sr;
5969	>	if ((sr = s.result) != null)
5970	>	t.result = (((tr = t.result) == null) ? sr :
5971	>	reducer.apply(tr, sr));
5972	>	s = t.rights = s.nextRight;
5973	>	}
5974	>	}
5975	>	}
5976	>	}
5977	>	}
5978	>
5979	>	@SuppressWarnings("serial") static final class ReduceValuesTask<K,V>
5980	>	extends Traverser<K,V,V> {
5981	>	final BiFun<? super V, ? super V, ? extends V> reducer;
5982	>	V result;
5983	>	ReduceValuesTask<K,V> rights, nextRight;
5984	>	ReduceValuesTask
5985	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5986	>	ReduceValuesTask<K,V> nextRight,
5987	>	BiFun<? super V, ? super V, ? extends V> reducer) {
5988	>	super(m, p, b); this.nextRight = nextRight;
5989	>	this.reducer = reducer;
5990	>	}
5991	>	public final V getRawResult() { return result; }
5992	>	@SuppressWarnings("unchecked") public final void compute() {
5993	>	final BiFun<? super V, ? super V, ? extends V> reducer;
5994	>	if ((reducer = this.reducer) != null) {
5995	>	for (int b; (b = preSplit()) > 0;)
5996	>	(rights = new ReduceValuesTask<K,V>
5997	>	(map, this, b, rights, reducer)).fork();
5998	>	V r = null;
5999	>	V v;
6000	>	while ((v = advance()) != null) {
6001	>	V u = v;
6002	>	r = (r == null) ? u : reducer.apply(r, u);
6003	>	}
6004	>	result = r;
6005	>	CountedCompleter<?> c;
6006	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6007	>	ReduceValuesTask<K,V>
6008	>	t = (ReduceValuesTask<K,V>)c,
6009	>	s = t.rights;
6010	>	while (s != null) {
6011	>	V tr, sr;
6012	>	if ((sr = s.result) != null)
6013	>	t.result = (((tr = t.result) == null) ? sr :
6014	>	reducer.apply(tr, sr));
6015	>	s = t.rights = s.nextRight;
6016	>	}
6017	>	}
6018	>	}
6019	>	}
6020	>	}
6021	>
6022	>	@SuppressWarnings("serial") static final class ReduceEntriesTask<K,V>
6023	>	extends Traverser<K,V,Map.Entry<K,V>> {
6024	>	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
6025	>	Map.Entry<K,V> result;
6026	>	ReduceEntriesTask<K,V> rights, nextRight;
6027	>	ReduceEntriesTask
6028	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6029	>	ReduceEntriesTask<K,V> nextRight,
6030	>	BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
6031	>	super(m, p, b); this.nextRight = nextRight;
6032	>	this.reducer = reducer;
6033	>	}
6034	>	public final Map.Entry<K,V> getRawResult() { return result; }
6035	>	@SuppressWarnings("unchecked") public final void compute() {
6036	>	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
6037	>	if ((reducer = this.reducer) != null) {
6038	>	for (int b; (b = preSplit()) > 0;)
6039	>	(rights = new ReduceEntriesTask<K,V>
6040	>	(map, this, b, rights, reducer)).fork();
6041	>	Map.Entry<K,V> r = null;
6042	>	V v;
6043	>	while ((v = advance()) != null) {
6044	>	Map.Entry<K,V> u = entryFor((K)nextKey, v);
6045	>	r = (r == null) ? u : reducer.apply(r, u);
6046	>	}
6047	>	result = r;
6048	>	CountedCompleter<?> c;
6049	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6050	>	ReduceEntriesTask<K,V>
6051	>	t = (ReduceEntriesTask<K,V>)c,
6052	>	s = t.rights;
6053	>	while (s != null) {
6054	>	Map.Entry<K,V> tr, sr;
6055	>	if ((sr = s.result) != null)
6056	>	t.result = (((tr = t.result) == null) ? sr :
6057	>	reducer.apply(tr, sr));
6058	>	s = t.rights = s.nextRight;
6059	>	}
6060	>	}
6061	>	}
6062	>	}
6063	>	}
6064	>
6065	>	@SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U>
6066	>	extends Traverser<K,V,U> {
6067	>	final Fun<? super K, ? extends U> transformer;
6068	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6069	>	U result;
6070	>	MapReduceKeysTask<K,V,U> rights, nextRight;
6071	>	MapReduceKeysTask
6072	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6073	>	MapReduceKeysTask<K,V,U> nextRight,
6074	>	Fun<? super K, ? extends U> transformer,
6075	>	BiFun<? super U, ? super U, ? extends U> reducer) {
6076	>	super(m, p, b); this.nextRight = nextRight;
6077	>	this.transformer = transformer;
6078	>	this.reducer = reducer;
6079	>	}
6080	>	public final U getRawResult() { return result; }
6081	>	@SuppressWarnings("unchecked") public final void compute() {
6082	>	final Fun<? super K, ? extends U> transformer;
6083	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6084	>	if ((transformer = this.transformer) != null &&
6085	>	(reducer = this.reducer) != null) {
6086	>	for (int b; (b = preSplit()) > 0;)
6087	>	(rights = new MapReduceKeysTask<K,V,U>
6088	>	(map, this, b, rights, transformer, reducer)).fork();
6089	>	U r = null, u;
6090	>	while (advance() != null) {
6091	>	if ((u = transformer.apply((K)nextKey)) != null)
6092	>	r = (r == null) ? u : reducer.apply(r, u);
6093	>	}
6094	>	result = r;
6095	>	CountedCompleter<?> c;
6096	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6097	>	MapReduceKeysTask<K,V,U>
6098	>	t = (MapReduceKeysTask<K,V,U>)c,
6099	>	s = t.rights;
6100	>	while (s != null) {
6101	>	U tr, sr;
6102	>	if ((sr = s.result) != null)
6103	>	t.result = (((tr = t.result) == null) ? sr :
6104	>	reducer.apply(tr, sr));
6105	>	s = t.rights = s.nextRight;
6106	>	}
6107	>	}
6108	>	}
6109	>	}
6110	>	}
6111	>
6112	>	@SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U>
6113	>	extends Traverser<K,V,U> {
6114	>	final Fun<? super V, ? extends U> transformer;
6115	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6116	>	U result;
6117	>	MapReduceValuesTask<K,V,U> rights, nextRight;
6118	>	MapReduceValuesTask
6119	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6120	>	MapReduceValuesTask<K,V,U> nextRight,
6121	>	Fun<? super V, ? extends U> transformer,
6122	>	BiFun<? super U, ? super U, ? extends U> reducer) {
6123	>	super(m, p, b); this.nextRight = nextRight;
6124	>	this.transformer = transformer;
6125	>	this.reducer = reducer;
6126	>	}
6127	>	public final U getRawResult() { return result; }
6128	>	@SuppressWarnings("unchecked") public final void compute() {
6129	>	final Fun<? super V, ? extends U> transformer;
6130	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6131	>	if ((transformer = this.transformer) != null &&
6132	>	(reducer = this.reducer) != null) {
6133	>	for (int b; (b = preSplit()) > 0;)
6134	>	(rights = new MapReduceValuesTask<K,V,U>
6135	>	(map, this, b, rights, transformer, reducer)).fork();
6136	>	U r = null, u;
6137	>	V v;
6138	>	while ((v = advance()) != null) {
6139	>	if ((u = transformer.apply(v)) != null)
6140	>	r = (r == null) ? u : reducer.apply(r, u);
6141	>	}
6142	>	result = r;
6143	>	CountedCompleter<?> c;
6144	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6145	>	MapReduceValuesTask<K,V,U>
6146	>	t = (MapReduceValuesTask<K,V,U>)c,
6147	>	s = t.rights;
6148	>	while (s != null) {
6149	>	U tr, sr;
6150	>	if ((sr = s.result) != null)
6151	>	t.result = (((tr = t.result) == null) ? sr :
6152	>	reducer.apply(tr, sr));
6153	>	s = t.rights = s.nextRight;
6154	>	}
6155	>	}
6156	>	}
6157	>	}
6158	>	}
6159	>
6160	>	@SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U>
6161	>	extends Traverser<K,V,U> {
6162	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
6163	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6164	>	U result;
6165	>	MapReduceEntriesTask<K,V,U> rights, nextRight;
6166	>	MapReduceEntriesTask
6167	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6168	>	MapReduceEntriesTask<K,V,U> nextRight,
6169	>	Fun<Map.Entry<K,V>, ? extends U> transformer,
6170	>	BiFun<? super U, ? super U, ? extends U> reducer) {
6171	>	super(m, p, b); this.nextRight = nextRight;
6172	>	this.transformer = transformer;
6173	>	this.reducer = reducer;
6174	>	}
6175	>	public final U getRawResult() { return result; }
6176	>	@SuppressWarnings("unchecked") public final void compute() {
6177	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
6178	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6179	>	if ((transformer = this.transformer) != null &&
6180	>	(reducer = this.reducer) != null) {
6181	>	for (int b; (b = preSplit()) > 0;)
6182	>	(rights = new MapReduceEntriesTask<K,V,U>
6183	>	(map, this, b, rights, transformer, reducer)).fork();
6184	>	U r = null, u;
6185	>	V v;
6186	>	while ((v = advance()) != null) {
6187	>	if ((u = transformer.apply(entryFor((K)nextKey,
6188	>	v))) != null)
6189	>	r = (r == null) ? u : reducer.apply(r, u);
6190	>	}
6191	>	result = r;
6192	>	CountedCompleter<?> c;
6193	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6194	>	MapReduceEntriesTask<K,V,U>
6195	>	t = (MapReduceEntriesTask<K,V,U>)c,
6196	>	s = t.rights;
6197	>	while (s != null) {
6198	>	U tr, sr;
6199	>	if ((sr = s.result) != null)
6200	>	t.result = (((tr = t.result) == null) ? sr :
6201	>	reducer.apply(tr, sr));
6202	>	s = t.rights = s.nextRight;
6203	>	}
6204	>	}
6205	>	}
6206	>	}
6207	>	}
6208	>
6209	>	@SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U>
6210	>	extends Traverser<K,V,U> {
6211	>	final BiFun<? super K, ? super V, ? extends U> transformer;
6212	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6213	>	U result;
6214	>	MapReduceMappingsTask<K,V,U> rights, nextRight;
6215	>	MapReduceMappingsTask
6216	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6217	>	MapReduceMappingsTask<K,V,U> nextRight,
6218	>	BiFun<? super K, ? super V, ? extends U> transformer,
6219	>	BiFun<? super U, ? super U, ? extends U> reducer) {
6220	>	super(m, p, b); this.nextRight = nextRight;
6221	>	this.transformer = transformer;
6222	>	this.reducer = reducer;
6223	>	}
6224	>	public final U getRawResult() { return result; }
6225	>	@SuppressWarnings("unchecked") public final void compute() {
6226	>	final BiFun<? super K, ? super V, ? extends U> transformer;
6227	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6228	>	if ((transformer = this.transformer) != null &&
6229	>	(reducer = this.reducer) != null) {
6230	>	for (int b; (b = preSplit()) > 0;)
6231	>	(rights = new MapReduceMappingsTask<K,V,U>
6232	>	(map, this, b, rights, transformer, reducer)).fork();
6233	>	U r = null, u;
6234	>	V v;
6235	>	while ((v = advance()) != null) {
6236	>	if ((u = transformer.apply((K)nextKey, v)) != null)
6237	>	r = (r == null) ? u : reducer.apply(r, u);
6238	>	}
6239	>	result = r;
6240	>	CountedCompleter<?> c;
6241	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6242	>	MapReduceMappingsTask<K,V,U>
6243	>	t = (MapReduceMappingsTask<K,V,U>)c,
6244	>	s = t.rights;
6245	>	while (s != null) {
6246	>	U tr, sr;
6247	>	if ((sr = s.result) != null)
6248	>	t.result = (((tr = t.result) == null) ? sr :
6249	>	reducer.apply(tr, sr));
6250	>	s = t.rights = s.nextRight;
6251	>	}
6252	>	}
6253	>	}
6254	>	}
6255	>	}
6256	>
6257	>	@SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V>
6258	>	extends Traverser<K,V,Double> {
6259	>	final ObjectToDouble<? super K> transformer;
6260	>	final DoubleByDoubleToDouble reducer;
6261	>	final double basis;
6262	>	double result;
6263	>	MapReduceKeysToDoubleTask<K,V> rights, nextRight;
6264	>	MapReduceKeysToDoubleTask
6265	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6266	>	MapReduceKeysToDoubleTask<K,V> nextRight,
6267	>	ObjectToDouble<? super K> transformer,
6268	>	double basis,
6269	>	DoubleByDoubleToDouble reducer) {
6270	>	super(m, p, b); this.nextRight = nextRight;
6271	>	this.transformer = transformer;
6272	>	this.basis = basis; this.reducer = reducer;
6273	>	}
6274	>	public final Double getRawResult() { return result; }
6275	>	@SuppressWarnings("unchecked") public final void compute() {
6276	>	final ObjectToDouble<? super K> transformer;
6277	>	final DoubleByDoubleToDouble reducer;
6278	>	if ((transformer = this.transformer) != null &&
6279	>	(reducer = this.reducer) != null) {
6280	>	double r = this.basis;
6281	>	for (int b; (b = preSplit()) > 0;)
6282	>	(rights = new MapReduceKeysToDoubleTask<K,V>
6283	>	(map, this, b, rights, transformer, r, reducer)).fork();
6284	>	while (advance() != null)
6285	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6286	>	result = r;
6287	>	CountedCompleter<?> c;
6288	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6289	>	MapReduceKeysToDoubleTask<K,V>
6290	>	t = (MapReduceKeysToDoubleTask<K,V>)c,
6291	>	s = t.rights;
6292	>	while (s != null) {
6293	>	t.result = reducer.apply(t.result, s.result);
6294	>	s = t.rights = s.nextRight;
6295	>	}
6296	>	}
6297	>	}
6298	>	}
6299	>	}
6300	>
6301	>	@SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V>
6302	>	extends Traverser<K,V,Double> {
6303	>	final ObjectToDouble<? super V> transformer;
6304	>	final DoubleByDoubleToDouble reducer;
6305	>	final double basis;
6306	>	double result;
6307	>	MapReduceValuesToDoubleTask<K,V> rights, nextRight;
6308	>	MapReduceValuesToDoubleTask
6309	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6310	>	MapReduceValuesToDoubleTask<K,V> nextRight,
6311	>	ObjectToDouble<? super V> transformer,
6312	>	double basis,
6313	>	DoubleByDoubleToDouble reducer) {
6314	>	super(m, p, b); this.nextRight = nextRight;
6315	>	this.transformer = transformer;
6316	>	this.basis = basis; this.reducer = reducer;
6317	>	}
6318	>	public final Double getRawResult() { return result; }
6319	>	@SuppressWarnings("unchecked") public final void compute() {
6320	>	final ObjectToDouble<? super V> transformer;
6321	>	final DoubleByDoubleToDouble reducer;
6322	>	if ((transformer = this.transformer) != null &&
6323	>	(reducer = this.reducer) != null) {
6324	>	double r = this.basis;
6325	>	for (int b; (b = preSplit()) > 0;)
6326	>	(rights = new MapReduceValuesToDoubleTask<K,V>
6327	>	(map, this, b, rights, transformer, r, reducer)).fork();
6328	>	V v;
6329	>	while ((v = advance()) != null)
6330	>	r = reducer.apply(r, transformer.apply(v));
6331	>	result = r;
6332	>	CountedCompleter<?> c;
6333	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6334	>	MapReduceValuesToDoubleTask<K,V>
6335	>	t = (MapReduceValuesToDoubleTask<K,V>)c,
6336	>	s = t.rights;
6337	>	while (s != null) {
6338	>	t.result = reducer.apply(t.result, s.result);
6339	>	s = t.rights = s.nextRight;
6340	>	}
6341	>	}
6342	>	}
6343	>	}
6344	>	}
6345	>
6346	>	@SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V>
6347	>	extends Traverser<K,V,Double> {
6348	>	final ObjectToDouble<Map.Entry<K,V>> transformer;
6349	>	final DoubleByDoubleToDouble reducer;
6350	>	final double basis;
6351	>	double result;
6352	>	MapReduceEntriesToDoubleTask<K,V> rights, nextRight;
6353	>	MapReduceEntriesToDoubleTask
6354	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6355	>	MapReduceEntriesToDoubleTask<K,V> nextRight,
6356	>	ObjectToDouble<Map.Entry<K,V>> transformer,
6357	>	double basis,
6358	>	DoubleByDoubleToDouble reducer) {
6359	>	super(m, p, b); this.nextRight = nextRight;
6360	>	this.transformer = transformer;
6361	>	this.basis = basis; this.reducer = reducer;
6362	>	}
6363	>	public final Double getRawResult() { return result; }
6364	>	@SuppressWarnings("unchecked") public final void compute() {
6365	>	final ObjectToDouble<Map.Entry<K,V>> transformer;
6366	>	final DoubleByDoubleToDouble reducer;
6367	>	if ((transformer = this.transformer) != null &&
6368	>	(reducer = this.reducer) != null) {
6369	>	double r = this.basis;
6370	>	for (int b; (b = preSplit()) > 0;)
6371	>	(rights = new MapReduceEntriesToDoubleTask<K,V>
6372	>	(map, this, b, rights, transformer, r, reducer)).fork();
6373	>	V v;
6374	>	while ((v = advance()) != null)
6375	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
6376	>	v)));
6377	>	result = r;
6378	>	CountedCompleter<?> c;
6379	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6380	>	MapReduceEntriesToDoubleTask<K,V>
6381	>	t = (MapReduceEntriesToDoubleTask<K,V>)c,
6382	>	s = t.rights;
6383	>	while (s != null) {
6384	>	t.result = reducer.apply(t.result, s.result);
6385	>	s = t.rights = s.nextRight;
6386	>	}
6387	>	}
6388	>	}
6389	>	}
6390	>	}
6391	>
6392	>	@SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V>
6393	>	extends Traverser<K,V,Double> {
6394	>	final ObjectByObjectToDouble<? super K, ? super V> transformer;
6395	>	final DoubleByDoubleToDouble reducer;
6396	>	final double basis;
6397	>	double result;
6398	>	MapReduceMappingsToDoubleTask<K,V> rights, nextRight;
6399	>	MapReduceMappingsToDoubleTask
6400	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6401	>	MapReduceMappingsToDoubleTask<K,V> nextRight,
6402	>	ObjectByObjectToDouble<? super K, ? super V> transformer,
6403	>	double basis,
6404	>	DoubleByDoubleToDouble reducer) {
6405	>	super(m, p, b); this.nextRight = nextRight;
6406	>	this.transformer = transformer;
6407	>	this.basis = basis; this.reducer = reducer;
6408	>	}
6409	>	public final Double getRawResult() { return result; }
6410	>	@SuppressWarnings("unchecked") public final void compute() {
6411	>	final ObjectByObjectToDouble<? super K, ? super V> transformer;
6412	>	final DoubleByDoubleToDouble reducer;
6413	>	if ((transformer = this.transformer) != null &&
6414	>	(reducer = this.reducer) != null) {
6415	>	double r = this.basis;
6416	>	for (int b; (b = preSplit()) > 0;)
6417	>	(rights = new MapReduceMappingsToDoubleTask<K,V>
6418	>	(map, this, b, rights, transformer, r, reducer)).fork();
6419	>	V v;
6420	>	while ((v = advance()) != null)
6421	>	r = reducer.apply(r, transformer.apply((K)nextKey, v));
6422	>	result = r;
6423	>	CountedCompleter<?> c;
6424	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6425	>	MapReduceMappingsToDoubleTask<K,V>
6426	>	t = (MapReduceMappingsToDoubleTask<K,V>)c,
6427	>	s = t.rights;
6428	>	while (s != null) {
6429	>	t.result = reducer.apply(t.result, s.result);
6430	>	s = t.rights = s.nextRight;
6431	>	}
6432	>	}
6433	>	}
6434	>	}
6435	>	}
6436	>
6437	>	@SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V>
6438	>	extends Traverser<K,V,Long> {
6439	>	final ObjectToLong<? super K> transformer;
6440	>	final LongByLongToLong reducer;
6441	>	final long basis;
6442	>	long result;
6443	>	MapReduceKeysToLongTask<K,V> rights, nextRight;
6444	>	MapReduceKeysToLongTask
6445	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6446	>	MapReduceKeysToLongTask<K,V> nextRight,
6447	>	ObjectToLong<? super K> transformer,
6448	>	long basis,
6449	>	LongByLongToLong reducer) {
6450	>	super(m, p, b); this.nextRight = nextRight;
6451	>	this.transformer = transformer;
6452	>	this.basis = basis; this.reducer = reducer;
6453	>	}
6454	>	public final Long getRawResult() { return result; }
6455	>	@SuppressWarnings("unchecked") public final void compute() {
6456	>	final ObjectToLong<? super K> transformer;
6457	>	final LongByLongToLong reducer;
6458	>	if ((transformer = this.transformer) != null &&
6459	>	(reducer = this.reducer) != null) {
6460	>	long r = this.basis;
6461	>	for (int b; (b = preSplit()) > 0;)
6462	>	(rights = new MapReduceKeysToLongTask<K,V>
6463	>	(map, this, b, rights, transformer, r, reducer)).fork();
6464	>	while (advance() != null)
6465	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6466	>	result = r;
6467	>	CountedCompleter<?> c;
6468	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6469	>	MapReduceKeysToLongTask<K,V>
6470	>	t = (MapReduceKeysToLongTask<K,V>)c,
6471	>	s = t.rights;
6472	>	while (s != null) {
6473	>	t.result = reducer.apply(t.result, s.result);
6474	>	s = t.rights = s.nextRight;
6475	>	}
6476	>	}
6477	>	}
6478	>	}
6479	>	}
6480	>
6481	>	@SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V>
6482	>	extends Traverser<K,V,Long> {
6483	>	final ObjectToLong<? super V> transformer;
6484	>	final LongByLongToLong reducer;
6485	>	final long basis;
6486	>	long result;
6487	>	MapReduceValuesToLongTask<K,V> rights, nextRight;
6488	>	MapReduceValuesToLongTask
6489	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6490	>	MapReduceValuesToLongTask<K,V> nextRight,
6491	>	ObjectToLong<? super V> transformer,
6492	>	long basis,
6493	>	LongByLongToLong reducer) {
6494	>	super(m, p, b); this.nextRight = nextRight;
6495	>	this.transformer = transformer;
6496	>	this.basis = basis; this.reducer = reducer;
6497	>	}
6498	>	public final Long getRawResult() { return result; }
6499	>	@SuppressWarnings("unchecked") public final void compute() {
6500	>	final ObjectToLong<? super V> transformer;
6501	>	final LongByLongToLong reducer;
6502	>	if ((transformer = this.transformer) != null &&
6503	>	(reducer = this.reducer) != null) {
6504	>	long r = this.basis;
6505	>	for (int b; (b = preSplit()) > 0;)
6506	>	(rights = new MapReduceValuesToLongTask<K,V>
6507	>	(map, this, b, rights, transformer, r, reducer)).fork();
6508	>	V v;
6509	>	while ((v = advance()) != null)
6510	>	r = reducer.apply(r, transformer.apply(v));
6511	>	result = r;
6512	>	CountedCompleter<?> c;
6513	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6514	>	MapReduceValuesToLongTask<K,V>
6515	>	t = (MapReduceValuesToLongTask<K,V>)c,
6516	>	s = t.rights;
6517	>	while (s != null) {
6518	>	t.result = reducer.apply(t.result, s.result);
6519	>	s = t.rights = s.nextRight;
6520	>	}
6521	>	}
6522	>	}
6523	>	}
6524	>	}
6525	>
6526	>	@SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V>
6527	>	extends Traverser<K,V,Long> {
6528	>	final ObjectToLong<Map.Entry<K,V>> transformer;
6529	>	final LongByLongToLong reducer;
6530	>	final long basis;
6531	>	long result;
6532	>	MapReduceEntriesToLongTask<K,V> rights, nextRight;
6533	>	MapReduceEntriesToLongTask
6534	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6535	>	MapReduceEntriesToLongTask<K,V> nextRight,
6536	>	ObjectToLong<Map.Entry<K,V>> transformer,
6537	>	long basis,
6538	>	LongByLongToLong reducer) {
6539	>	super(m, p, b); this.nextRight = nextRight;
6540	>	this.transformer = transformer;
6541	>	this.basis = basis; this.reducer = reducer;
6542	>	}
6543	>	public final Long getRawResult() { return result; }
6544	>	@SuppressWarnings("unchecked") public final void compute() {
6545	>	final ObjectToLong<Map.Entry<K,V>> transformer;
6546	>	final LongByLongToLong reducer;
6547	>	if ((transformer = this.transformer) != null &&
6548	>	(reducer = this.reducer) != null) {
6549	>	long r = this.basis;
6550	>	for (int b; (b = preSplit()) > 0;)
6551	>	(rights = new MapReduceEntriesToLongTask<K,V>
6552	>	(map, this, b, rights, transformer, r, reducer)).fork();
6553	>	V v;
6554	>	while ((v = advance()) != null)
6555	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
6556	>	v)));
6557	>	result = r;
6558	>	CountedCompleter<?> c;
6559	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6560	>	MapReduceEntriesToLongTask<K,V>
6561	>	t = (MapReduceEntriesToLongTask<K,V>)c,
6562	>	s = t.rights;
6563	>	while (s != null) {
6564	>	t.result = reducer.apply(t.result, s.result);
6565	>	s = t.rights = s.nextRight;
6566	>	}
6567	>	}
6568	>	}
6569	>	}
6570	>	}
6571	>
6572	>	@SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V>
6573	>	extends Traverser<K,V,Long> {
6574	>	final ObjectByObjectToLong<? super K, ? super V> transformer;
6575	>	final LongByLongToLong reducer;
6576	>	final long basis;
6577	>	long result;
6578	>	MapReduceMappingsToLongTask<K,V> rights, nextRight;
6579	>	MapReduceMappingsToLongTask
6580	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6581	>	MapReduceMappingsToLongTask<K,V> nextRight,
6582	>	ObjectByObjectToLong<? super K, ? super V> transformer,
6583	>	long basis,
6584	>	LongByLongToLong reducer) {
6585	>	super(m, p, b); this.nextRight = nextRight;
6586	>	this.transformer = transformer;
6587	>	this.basis = basis; this.reducer = reducer;
6588	>	}
6589	>	public final Long getRawResult() { return result; }
6590	>	@SuppressWarnings("unchecked") public final void compute() {
6591	>	final ObjectByObjectToLong<? super K, ? super V> transformer;
6592	>	final LongByLongToLong reducer;
6593	>	if ((transformer = this.transformer) != null &&
6594	>	(reducer = this.reducer) != null) {
6595	>	long r = this.basis;
6596	>	for (int b; (b = preSplit()) > 0;)
6597	>	(rights = new MapReduceMappingsToLongTask<K,V>
6598	>	(map, this, b, rights, transformer, r, reducer)).fork();
6599	>	V v;
6600	>	while ((v = advance()) != null)
6601	>	r = reducer.apply(r, transformer.apply((K)nextKey, v));
6602	>	result = r;
6603	>	CountedCompleter<?> c;
6604	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6605	>	MapReduceMappingsToLongTask<K,V>
6606	>	t = (MapReduceMappingsToLongTask<K,V>)c,
6607	>	s = t.rights;
6608	>	while (s != null) {
6609	>	t.result = reducer.apply(t.result, s.result);
6610	>	s = t.rights = s.nextRight;
6611	>	}
6612	>	}
6613	>	}
6614	>	}
6615	>	}
6616	>
6617	>	@SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V>
6618	>	extends Traverser<K,V,Integer> {
6619	>	final ObjectToInt<? super K> transformer;
6620	>	final IntByIntToInt reducer;
6621	>	final int basis;
6622	>	int result;
6623	>	MapReduceKeysToIntTask<K,V> rights, nextRight;
6624	>	MapReduceKeysToIntTask
6625	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6626	>	MapReduceKeysToIntTask<K,V> nextRight,
6627	>	ObjectToInt<? super K> transformer,
6628	>	int basis,
6629	>	IntByIntToInt reducer) {
6630	>	super(m, p, b); this.nextRight = nextRight;
6631	>	this.transformer = transformer;
6632	>	this.basis = basis; this.reducer = reducer;
6633	>	}
6634	>	public final Integer getRawResult() { return result; }
6635	>	@SuppressWarnings("unchecked") public final void compute() {
6636	>	final ObjectToInt<? super K> transformer;
6637	>	final IntByIntToInt reducer;
6638	>	if ((transformer = this.transformer) != null &&
6639	>	(reducer = this.reducer) != null) {
6640	>	int r = this.basis;
6641	>	for (int b; (b = preSplit()) > 0;)
6642	>	(rights = new MapReduceKeysToIntTask<K,V>
6643	>	(map, this, b, rights, transformer, r, reducer)).fork();
6644	>	while (advance() != null)
6645	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6646	>	result = r;
6647	>	CountedCompleter<?> c;
6648	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6649	>	MapReduceKeysToIntTask<K,V>
6650	>	t = (MapReduceKeysToIntTask<K,V>)c,
6651	>	s = t.rights;
6652	>	while (s != null) {
6653	>	t.result = reducer.apply(t.result, s.result);
6654	>	s = t.rights = s.nextRight;
6655	>	}
6656	>	}
6657	>	}
6658	>	}
6659	>	}
6660	>
6661	>	@SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V>
6662	>	extends Traverser<K,V,Integer> {
6663	>	final ObjectToInt<? super V> transformer;
6664	>	final IntByIntToInt reducer;
6665	>	final int basis;
6666	>	int result;
6667	>	MapReduceValuesToIntTask<K,V> rights, nextRight;
6668	>	MapReduceValuesToIntTask
6669	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6670	>	MapReduceValuesToIntTask<K,V> nextRight,
6671	>	ObjectToInt<? super V> transformer,
6672	>	int basis,
6673	>	IntByIntToInt reducer) {
6674	>	super(m, p, b); this.nextRight = nextRight;
6675	>	this.transformer = transformer;
6676	>	this.basis = basis; this.reducer = reducer;
6677	>	}
6678	>	public final Integer getRawResult() { return result; }
6679	>	@SuppressWarnings("unchecked") public final void compute() {
6680	>	final ObjectToInt<? super V> transformer;
6681	>	final IntByIntToInt reducer;
6682	>	if ((transformer = this.transformer) != null &&
6683	>	(reducer = this.reducer) != null) {
6684	>	int r = this.basis;
6685	>	for (int b; (b = preSplit()) > 0;)
6686	>	(rights = new MapReduceValuesToIntTask<K,V>
6687	>	(map, this, b, rights, transformer, r, reducer)).fork();
6688	>	V v;
6689	>	while ((v = advance()) != null)
6690	>	r = reducer.apply(r, transformer.apply(v));
6691	>	result = r;
6692	>	CountedCompleter<?> c;
6693	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6694	>	MapReduceValuesToIntTask<K,V>
6695	>	t = (MapReduceValuesToIntTask<K,V>)c,
6696	>	s = t.rights;
6697	>	while (s != null) {
6698	>	t.result = reducer.apply(t.result, s.result);
6699	>	s = t.rights = s.nextRight;
6700	>	}
6701	>	}
6702	>	}
6703	>	}
6704	>	}
6705	>
6706	>	@SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V>
6707	>	extends Traverser<K,V,Integer> {
6708	>	final ObjectToInt<Map.Entry<K,V>> transformer;
6709	>	final IntByIntToInt reducer;
6710	>	final int basis;
6711	>	int result;
6712	>	MapReduceEntriesToIntTask<K,V> rights, nextRight;
6713	>	MapReduceEntriesToIntTask
6714	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6715	>	MapReduceEntriesToIntTask<K,V> nextRight,
6716	>	ObjectToInt<Map.Entry<K,V>> transformer,
6717	>	int basis,
6718	>	IntByIntToInt reducer) {
6719	>	super(m, p, b); this.nextRight = nextRight;
6720	>	this.transformer = transformer;
6721	>	this.basis = basis; this.reducer = reducer;
6722	>	}
6723	>	public final Integer getRawResult() { return result; }
6724	>	@SuppressWarnings("unchecked") public final void compute() {
6725	>	final ObjectToInt<Map.Entry<K,V>> transformer;
6726	>	final IntByIntToInt reducer;
6727	>	if ((transformer = this.transformer) != null &&
6728	>	(reducer = this.reducer) != null) {
6729	>	int r = this.basis;
6730	>	for (int b; (b = preSplit()) > 0;)
6731	>	(rights = new MapReduceEntriesToIntTask<K,V>
6732	>	(map, this, b, rights, transformer, r, reducer)).fork();
6733	>	V v;
6734	>	while ((v = advance()) != null)
6735	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
6736	>	v)));
6737	>	result = r;
6738	>	CountedCompleter<?> c;
6739	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6740	>	MapReduceEntriesToIntTask<K,V>
6741	>	t = (MapReduceEntriesToIntTask<K,V>)c,
6742	>	s = t.rights;
6743	>	while (s != null) {
6744	>	t.result = reducer.apply(t.result, s.result);
6745	>	s = t.rights = s.nextRight;
6746	>	}
6747	>	}
6748	>	}
6749	>	}
6750	>	}
6751	>
6752	>	@SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V>
6753	>	extends Traverser<K,V,Integer> {
6754	>	final ObjectByObjectToInt<? super K, ? super V> transformer;
6755	>	final IntByIntToInt reducer;
6756	>	final int basis;
6757	>	int result;
6758	>	MapReduceMappingsToIntTask<K,V> rights, nextRight;
6759	>	MapReduceMappingsToIntTask
6760	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6761	>	MapReduceMappingsToIntTask<K,V> nextRight,
6762	>	ObjectByObjectToInt<? super K, ? super V> transformer,
6763	>	int basis,
6764	>	IntByIntToInt reducer) {
6765	>	super(m, p, b); this.nextRight = nextRight;
6766	>	this.transformer = transformer;
6767	>	this.basis = basis; this.reducer = reducer;
6768	>	}
6769	>	public final Integer getRawResult() { return result; }
6770	>	@SuppressWarnings("unchecked") public final void compute() {
6771	>	final ObjectByObjectToInt<? super K, ? super V> transformer;
6772	>	final IntByIntToInt reducer;
6773	>	if ((transformer = this.transformer) != null &&
6774	>	(reducer = this.reducer) != null) {
6775	>	int r = this.basis;
6776	>	for (int b; (b = preSplit()) > 0;)
6777	>	(rights = new MapReduceMappingsToIntTask<K,V>
6778	>	(map, this, b, rights, transformer, r, reducer)).fork();
6779	>	V v;
6780	>	while ((v = advance()) != null)
6781	>	r = reducer.apply(r, transformer.apply((K)nextKey, v));
6782	>	result = r;
6783	>	CountedCompleter<?> c;
6784	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6785	>	MapReduceMappingsToIntTask<K,V>
6786	>	t = (MapReduceMappingsToIntTask<K,V>)c,
6787	>	s = t.rights;
6788	>	while (s != null) {
6789	>	t.result = reducer.apply(t.result, s.result);
6790	>	s = t.rights = s.nextRight;
6791	>	}
6792	>	}
6793	>	}
6794		}
6795		}
6796
6797		// Unsafe mechanics
6798	<	private static final sun.misc.Unsafe UNSAFE;
6799	<	private static final long counterOffset;
6800	<	private static final long resizingOffset;
6798	>	private static final sun.misc.Unsafe U;
6799	>	private static final long SIZECTL;
6800	>	private static final long TRANSFERINDEX;
6801	>	private static final long TRANSFERORIGIN;
6802	>	private static final long BASECOUNT;
6803	>	private static final long COUNTERBUSY;
6804	>	private static final long CELLVALUE;
6805		private static final long ABASE;
6806		private static final int ASHIFT;
6807
6808		static {
6809		int ss;
6810		try {
6811	<	UNSAFE = getUnsafe();
6811	>	U = getUnsafe();
6812		Class<?> k = ConcurrentHashMapV8.class;
6813	<	counterOffset = UNSAFE.objectFieldOffset
6814	<	(k.getDeclaredField("counter"));
6815	<	resizingOffset = UNSAFE.objectFieldOffset
6816	<	(k.getDeclaredField("resizing"));
6813	>	SIZECTL = U.objectFieldOffset
6814	>	(k.getDeclaredField("sizeCtl"));
6815	>	TRANSFERINDEX = U.objectFieldOffset
6816	>	(k.getDeclaredField("transferIndex"));
6817	>	TRANSFERORIGIN = U.objectFieldOffset
6818	>	(k.getDeclaredField("transferOrigin"));
6819	>	BASECOUNT = U.objectFieldOffset
6820	>	(k.getDeclaredField("baseCount"));
6821	>	COUNTERBUSY = U.objectFieldOffset
6822	>	(k.getDeclaredField("counterBusy"));
6823	>	Class<?> ck = CounterCell.class;
6824	>	CELLVALUE = U.objectFieldOffset
6825	>	(ck.getDeclaredField("value"));
6826		Class<?> sc = Node[].class;
6827	<	ABASE = UNSAFE.arrayBaseOffset(sc);
6828	<	ss = UNSAFE.arrayIndexScale(sc);
6827	>	ABASE = U.arrayBaseOffset(sc);
6828	>	ss = U.arrayIndexScale(sc);
6829	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
6830		} catch (Exception e) {
6831		throw new Error(e);
6832		}
6833		if ((ss & (ss-1)) != 0)
6834		throw new Error("data type scale not a power of two");
1587	–	ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
6835		}
6836
6837		/**
#	Line 1614 | Line 6861 | public class ConcurrentHashMapV8<K, V>
6861		}
6862		}
6863		}
1617	–
6864		}

Diff Legend

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