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.56 by jsr166, Mon Aug 13 18:49:36 2012 UTC vs.
Revision 1.101 by jsr166, Tue Jun 18 17:57:21 2013 UTC

#	Line 5 | Line 5
5		*/
6
7		package jsr166e;
8	–	import jsr166e.LongAdder;
9	–	import jsr166e.ForkJoinPool;
10	–	import jsr166e.ForkJoinTask;
8
9		import java.util.Comparator;
10		import java.util.Arrays;
#	Line 24 | Line 21 | import java.util.Enumeration;
21		import java.util.ConcurrentModificationException;
22		import java.util.NoSuchElementException;
23		import java.util.concurrent.ConcurrentMap;
27	–	import java.util.concurrent.ThreadLocalRandom;
28	–	import java.util.concurrent.locks.LockSupport;
24		import java.util.concurrent.locks.AbstractQueuedSynchronizer;
25	+	import java.util.concurrent.atomic.AtomicInteger;
26		import java.util.concurrent.atomic.AtomicReference;
31	–
27		import java.io.Serializable;
28
29		/**
#	Line 43 | 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	<	* or estimation purposes, but not for program control.
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
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
#	Line 82 | Line 80 | import java.io.Serializable;
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		*
96	–	* <p><em>jsr166e note: This class is a candidate replacement for
97	–	* java.util.concurrent.ConcurrentHashMap.  During transition, this
98	–	* class declares and uses nested functional interfaces with different
99	–	* names but the same forms as those expected for JDK8.<em>
100	–	*
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 {
215	>	public class ConcurrentHashMapV8<K,V>
216	>	implements ConcurrentMap<K,V>, Serializable {
217		private static final long serialVersionUID = 7249069246763182397L;
218
219		/**
#	Line 114 | Line 223 | public class ConcurrentHashMapV8<K, V>
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
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
#	Line 186 | Line 295 | public class ConcurrentHashMapV8<K, V>
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 fields
299	<	* can contain special values, they are defined using plain Object
300	<	* types. Similarly in turn, all internal methods that use them
301	<	* work off Object types. And similarly, so do the internal
302	<	* methods of auxiliary iterator and view classes.  All public
303	<	* generic typed methods relay in/out of these internal methods,
304	<	* supplying null-checks and casts as needed. This also allows
305	<	* many of the public methods to be factored into a smaller number
306	<	* of internal methods (although sadly not so for the five
198	<	* variants of put-related operations). The validation-based
199	<	* approach explained below leads to a lot of code sprawl because
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
#	Line 210 | Line 317 | public class ConcurrentHashMapV8<K, V>
317		* as lookups check hash code and non-nullness of value before
318		* checking key equality.
319		*
320	<	* We use the top two bits of Node hash fields for control
321	<	* purposes -- they are available anyway because of addressing
322	<	* constraints.  As explained further below, these top bits are
323	<	* used as follows:
324	<	*  00 - Normal
325	<	*  01 - Locked
219	<	*  11 - Locked and may have a thread waiting for lock
220	<	*  10 - Node is a forwarding node
221	<	*
222	<	* The lower 30 bits of each Node's hash field contain a
223	<	* transformation of the key's hash code, except for forwarding
224	<	* nodes, for which the lower bits are zero (and so always have
225	<	* hash field == MOVED).
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
#	Line 231 | Line 331 | public class ConcurrentHashMapV8<K, V>
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. Blocking support for these locks relies on the builtin
335	<	* "synchronized" monitors.  However, we also need a tryLock
236	<	* construction, so we overlay these by using bits of the Node
237	<	* hash field for lock control (see above), and so normally use
238	<	* builtin monitors only for blocking and signalling using
239	<	* wait/notifyAll constructions. See Node.tryAwaitLock.
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
#	Line 298 | Line 394 | public class ConcurrentHashMapV8<K, V>
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).  Only a single
398	<	* thread performs the resize (using field "sizeCtl", to arrange
399	<	* exclusion), but the table otherwise remains usable for reads
400	<	* and updates. Resizing proceeds by transferring bins, one by
401	<	* one, from the table to the next table.  Because we are using
402	<	* power-of-two expansion, the elements from each bin must either
403	<	* stay at same index, or move with a power of two offset. We
404	<	* eliminate unnecessary node creation by catching cases where old
405	<	* nodes can be reused because their next fields won't change.  On
406	<	* average, only about one-sixth of them need cloning when a table
407	<	* doubles. The nodes they replace will be garbage collectable as
408	<	* soon as they are no longer referenced by any reader thread that
409	<	* may be in the midst of concurrently traversing table.  Upon
410	<	* transfer, the old table bin contains only a special forwarding
411	<	* node (with hash field "MOVED") that contains the next table as
412	<	* its key. On encountering a forwarding node, access and update
413	<	* operations restart, using the new table.
414	<	*
415	<	* Each bin transfer requires its bin lock. However, unlike other
416	<	* cases, a transfer can skip a bin if it fails to acquire its
417	<	* lock, and revisit it later (unless it is a TreeBin). Method
418	<	* rebuild maintains a buffer of TRANSFER_BUFFER_SIZE bins that
419	<	* have been skipped because of failure to acquire a lock, and
420	<	* blocks only if none are available (i.e., only very rarely).
421	<	* The transfer operation must also ensure that all accessible
422	<	* bins in both the old and new table are usable by any traversal.
423	<	* When there are no lock acquisition failures, this is arranged
424	<	* simply by proceeding from the last bin (table.length - 1) up
425	<	* towards the first.  Upon seeing a forwarding node, traversals
426	<	* (see class Iter) arrange to move to the new table
427	<	* without revisiting nodes.  However, when any node is skipped
428	<	* during a transfer, all earlier table bins may have become
429	<	* visible, so are initialized with a reverse-forwarding node back
430	<	* to the old table until the new ones are established. (This
431	<	* sometimes requires transiently locking a forwarding node, which
432	<	* is possible under the above encoding.) These more expensive
433	<	* mechanics trigger only when necessary.
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)
#	Line 349 | Line 445 | public class ConcurrentHashMapV8<K, V>
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 LongAdder, which avoids
449	<	* contention on updates but can encounter cache thrashing if read
450	<	* too frequently during concurrent access. To avoid reading so
451	<	* often, resizing is attempted either when a bin lock is
452	<	* contended, or upon adding to a bin already holding two or more
453	<	* nodes (checked before adding in the xIfAbsent methods, after
454	<	* adding in others). Under uniform hash distributions, the
455	<	* probability of this occurring at threshold is around 13%,
456	<	* meaning that only about 1 in 8 puts check threshold (and after
457	<	* resizing, many fewer do so). But this approximation has high
458	<	* variance for small table sizes, so we check on any collision
459	<	* for sizes <= 64. The bulk putAll operation further reduces
460	<	* contention by only committing count updates upon these size
461	<	* checks.
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
#	Line 413 | Line 509 | public class ConcurrentHashMapV8<K, V>
509		private static final float LOAD_FACTOR = 0.75f;
510
511		/**
416	–	* The buffer size for skipped bins during transfers. The
417	–	* value is arbitrary but should be large enough to avoid
418	–	* most locking stalls during resizes.
419	–	*/
420	–	private static final int TRANSFER_BUFFER_SIZE = 32;
421	–
422	–	/**
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 special uses of Node hash fields. See above for
431	<	* explanation.
528	>	* Encodings for Node hash fields. See above for explanation.
529		*/
530		static final int MOVED     = 0x80000000; // hash field for forwarding nodes
531	<	static final int LOCKED    = 0x40000000; // set/tested only as a bit
532	<	static final int WAITING   = 0xc0000000; // both bits set/tested together
533	<	static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash
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	>	* 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 class CounterHashCode {
555	>	int code;
556	>	}
557	>
558	>	/**
559	>	* Generates initial value for per-thread CounterHashCodes
560	>	*/
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
#	Line 441 | Line 578 | public class ConcurrentHashMapV8<K, V>
578		* The array of bins. Lazily initialized upon first insertion.
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		/**
584	<	* The counter maintaining number of elements.
584	>	* The next table to use; non-null only while resizing.
585		*/
586	<	private transient final LongAdder counter;
586	>	private transient volatile Node<V>[] nextTable;
587	>
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		* Table initialization and resizing control.  When negative, the
597	<	* table is being initialized or resized. Otherwise, when table is
598	<	* null, holds the initial table size to use upon creation, or 0
599	<	* for default. After initialization, holds the next element count
600	<	* value upon which to resize the table.
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 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 KeySet<K,V> keySet;
627	<	private transient Values<K,V> values;
628	<	private transient EntrySet<K,V> entrySet;
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;
#	Line 479 | Line 644 | public class ConcurrentHashMapV8<K, V>
644		* inline assignments below.
645		*/
646
647	<	static final Node tabAt(Node[] tab, int i) { // used by Iter
648	<	return (Node)UNSAFE.getObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE);
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 boolean casTabAt(Node[] tab, int i, Node c, Node v) {
653	<	return UNSAFE.compareAndSwapObject(tab, ((long)i<<ASHIFT)+ABASE, c, v);
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 void setTabAt(Node[] tab, int i, Node v) {
658	<	UNSAFE.putObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE, v);
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 -------------- */
#	Line 503 | Line 671 | public class ConcurrentHashMapV8<K, V>
671		* before a val, but can only be used after checking val to be
672		* non-null.
673		*/
674	<	static class Node {
675	<	volatile int hash;
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;
684		this.next = next;
685		}
518	–
519	–	/** CompareAndSet the hash field */
520	–	final boolean casHash(int cmp, int val) {
521	–	return UNSAFE.compareAndSwapInt(this, hashOffset, cmp, val);
522	–	}
523	–
524	–	/** The number of spins before blocking for a lock */
525	–	static final int MAX_SPINS =
526	–	Runtime.getRuntime().availableProcessors() > 1 ? 64 : 1;
527	–
528	–	/**
529	–	* Spins a while if LOCKED bit set and this node is the first
530	–	* of its bin, and then sets WAITING bits on hash field and
531	–	* blocks (once) if they are still set.  It is OK for this
532	–	* method to return even if lock is not available upon exit,
533	–	* which enables these simple single-wait mechanics.
534	–	*
535	–	* The corresponding signalling operation is performed within
536	–	* callers: Upon detecting that WAITING has been set when
537	–	* unlocking lock (via a failed CAS from non-waiting LOCKED
538	–	* state), unlockers acquire the sync lock and perform a
539	–	* notifyAll.
540	–	*/
541	–	final void tryAwaitLock(Node[] tab, int i) {
542	–	if (tab != null && i >= 0 && i < tab.length) { // bounds check
543	–	int r = ThreadLocalRandom.current().nextInt(); // randomize spins
544	–	int spins = MAX_SPINS, h;
545	–	while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) {
546	–	if (spins >= 0) {
547	–	r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
548	–	if (r >= 0 && --spins == 0)
549	–	Thread.yield();  // yield before block
550	–	}
551	–	else if (casHash(h, h | WAITING)) {
552	–	synchronized (this) {
553	–	if (tabAt(tab, i) == this &&
554	–	(hash & WAITING) == WAITING) {
555	–	try {
556	–	wait();
557	–	} catch (InterruptedException ie) {
558	–	Thread.currentThread().interrupt();
559	–	}
560	–	}
561	–	else
562	–	notifyAll(); // possibly won race vs signaller
563	–	}
564	–	break;
565	–	}
566	–	}
567	–	}
568	–	}
569	–
570	–	// Unsafe mechanics for casHash
571	–	private static final sun.misc.Unsafe UNSAFE;
572	–	private static final long hashOffset;
573	–
574	–	static {
575	–	try {
576	–	UNSAFE = getUnsafe();
577	–	Class<?> k = Node.class;
578	–	hashOffset = UNSAFE.objectFieldOffset
579	–	(k.getDeclaredField("hash"));
580	–	} catch (Exception e) {
581	–	throw new Error(e);
582	–	}
583	–	}
686		}
687
688		/* ---------------- TreeBins -------------- */
#	Line 588 | Line 690 | public class ConcurrentHashMapV8<K, V>
690		/**
691		* Nodes for use in TreeBins
692		*/
693	<	static final class TreeNode extends Node {
694	<	TreeNode parent;  // red-black tree links
695	<	TreeNode left;
696	<	TreeNode right;
697	<	TreeNode prev;    // needed to unlink next upon deletion
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, Object val, Node next, TreeNode parent) {
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		}
#	Line 644 | Line 746 | public class ConcurrentHashMapV8<K, V>
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 extends AbstractQueuedSynchronizer {
749	>	static final class TreeBin<V> extends AbstractQueuedSynchronizer {
750		private static final long serialVersionUID = 2249069246763182397L;
751	<	transient TreeNode root;  // root of tree
752	<	transient TreeNode first; // head of next-pointer list
751	>	transient TreeNode<V> root;  // root of tree
752	>	transient TreeNode<V> first; // head of next-pointer list
753
754		/* AQS overrides */
755		public final boolean isHeldExclusively() { return getState() > 0; }
#	Line 678 | Line 780 | public class ConcurrentHashMapV8<K, V>
780		}
781
782		/** From CLR */
783	<	private void rotateLeft(TreeNode p) {
783	>	private void rotateLeft(TreeNode<V> p) {
784		if (p != null) {
785	<	TreeNode r = p.right, pp, rl;
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)
#	Line 695 | Line 797 | public class ConcurrentHashMapV8<K, V>
797		}
798
799		/** From CLR */
800	<	private void rotateRight(TreeNode p) {
800	>	private void rotateRight(TreeNode<V> p) {
801		if (p != null) {
802	<	TreeNode l = p.left, pp, lr;
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)
#	Line 715 | Line 817 | public class ConcurrentHashMapV8<K, V>
817		* Returns the TreeNode (or null if not found) for the given key
818		* starting at given root.
819		*/
820	<	@SuppressWarnings("unchecked") // suppress Comparable cast warning
821	<	final TreeNode getTreeNode(int h, Object k, TreeNode p) {
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;
#	Line 726 | Line 828 | public class ConcurrentHashMapV8<K, V>
828		if (c != (pc = pk.getClass()) ||
829		!(k instanceof Comparable) ||
830		(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
831	<	dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
832	<	TreeNode r = null, s = null, pl, pr;
833	<	if (dir >= 0) {
834	<	if ((pl = p.left) != null && h <= pl.hash)
835	<	s = pl;
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		}
735	–	else if ((pr = p.right) != null && h >= pr.hash)
736	–	s = pr;
737	–	if (s != null && (r = getTreeNode(h, k, s)) != null)
738	–	return r;
842		}
843		}
844		else
#	Line 750 | Line 853 | public class ConcurrentHashMapV8<K, V>
853		* read-lock to call getTreeNode, but during failure to get
854		* lock, searches along next links.
855		*/
856	<	final Object getValue(int h, Object k) {
857	<	Node r = null;
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 e = first; e != null; e = e.next) {
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);
#	Line 762 | Line 865 | public class ConcurrentHashMapV8<K, V>
865		}
866		break;
867		}
868	<	else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) {
868	>	else if (e.hash == h && k.equals(e.key)) {
869		r = e;
870		break;
871		}
#	Line 776 | Line 879 | public class ConcurrentHashMapV8<K, V>
879		* Finds or adds a node.
880		* @return null if added
881		*/
882	<	@SuppressWarnings("unchecked") // suppress Comparable cast warning
883	<	final TreeNode putTreeNode(int h, Object k, Object v) {
882	>	@SuppressWarnings("unchecked") final TreeNode<V> putTreeNode
883	>	(int h, Object k, V v) {
884		Class<?> c = k.getClass();
885	<	TreeNode pp = root, p = null;
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;
#	Line 790 | Line 893 | public class ConcurrentHashMapV8<K, V>
893		if (c != (pc = pk.getClass()) ||
894		!(k instanceof Comparable) ||
895		(dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
896	<	dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
897	<	TreeNode r = null, s = null, pl, pr;
898	<	if (dir >= 0) {
899	<	if ((pl = p.left) != null && h <= pl.hash)
900	<	s = pl;
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;
#	Line 807 | Line 913 | public class ConcurrentHashMapV8<K, V>
913		pp = (dir > 0) ? p.right : p.left;
914		}
915
916	<	TreeNode f = first;
917	<	TreeNode x = first = new TreeNode(h, k, v, f, p);
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 xp, xpp;
921	>	TreeNode<V> xp, xpp;
922		if (f != null)
923		f.prev = x;
924		if (dir <= 0)
#	Line 822 | Line 928 | public class ConcurrentHashMapV8<K, V>
928		x.red = true;
929		while (x != null && (xp = x.parent) != null && xp.red &&
930		(xpp = xp.parent) != null) {
931	<	TreeNode xppl = xpp.left;
931	>	TreeNode<V> xppl = xpp.left;
932		if (xp == xppl) {
933	<	TreeNode y = xpp.right;
933	>	TreeNode<V> y = xpp.right;
934		if (y != null && y.red) {
935		y.red = false;
936		xp.red = false;
#	Line 846 | Line 952 | public class ConcurrentHashMapV8<K, V>
952		}
953		}
954		else {
955	<	TreeNode y = xppl;
955	>	TreeNode<V> y = xppl;
956		if (y != null && y.red) {
957		y.red = false;
958		xp.red = false;
#	Line 868 | Line 974 | public class ConcurrentHashMapV8<K, V>
974		}
975		}
976		}
977	<	TreeNode r = root;
977	>	TreeNode<V> r = root;
978		if (r != null && r.red)
979		r.red = false;
980		}
#	Line 883 | Line 989 | public class ConcurrentHashMapV8<K, V>
989		* that are accessible independently of lock. So instead we
990		* swap the tree linkages.
991		*/
992	<	final void deleteTreeNode(TreeNode p) {
993	<	TreeNode next = (TreeNode)p.next; // unlink traversal pointers
994	<	TreeNode pred = p.prev;
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 replacement;
1002	<	TreeNode pl = p.left;
1003	<	TreeNode pr = p.right;
1001	>	TreeNode<V> replacement;
1002	>	TreeNode<V> pl = p.left;
1003	>	TreeNode<V> pr = p.right;
1004		if (pl != null && pr != null) {
1005	<	TreeNode s = pr, sl;
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 sr = s.right;
1010	<	TreeNode pp = p.parent;
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 sp = s.parent;
1016	>	TreeNode<V> sp = s.parent;
1017		if ((p.parent = sp) != null) {
1018		if (s == sp.left)
1019		sp.left = p;
#	Line 932 | Line 1038 | public class ConcurrentHashMapV8<K, V>
1038		}
1039		else
1040		replacement = (pl != null) ? pl : pr;
1041	<	TreeNode pp = p.parent;
1041	>	TreeNode<V> pp = p.parent;
1042		if (replacement == null) {
1043		if (pp == null) {
1044		root = null;
#	Line 951 | Line 1057 | public class ConcurrentHashMapV8<K, V>
1057		p.left = p.right = p.parent = null;
1058		}
1059		if (!p.red) { // rebalance, from CLR
1060	<	TreeNode x = replacement;
1060	>	TreeNode<V> x = replacement;
1061		while (x != null) {
1062	<	TreeNode xp, xpl;
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 sib = xp.right;
1068	>	TreeNode<V> sib = xp.right;
1069		if (sib != null && sib.red) {
1070		sib.red = false;
1071		xp.red = true;
#	Line 969 | Line 1075 | public class ConcurrentHashMapV8<K, V>
1075		if (sib == null)
1076		x = xp;
1077		else {
1078	<	TreeNode sl = sib.left, sr = sib.right;
1078	>	TreeNode<V> sl = sib.left, sr = sib.right;
1079		if ((sr == null || !sr.red) &&
1080		(sl == null || !sl.red)) {
1081		sib.red = true;
#	Line 981 | Line 1087 | public class ConcurrentHashMapV8<K, V>
1087		sl.red = false;
1088		sib.red = true;
1089		rotateRight(sib);
1090	<	sib = (xp = x.parent) == null ? null : xp.right;
1090	>	sib = (xp = x.parent) == null ?
1091	>	null : xp.right;
1092		}
1093		if (sib != null) {
1094		sib.red = (xp == null) ? false : xp.red;
#	Line 997 | Line 1104 | public class ConcurrentHashMapV8<K, V>
1104		}
1105		}
1106		else { // symmetric
1107	<	TreeNode sib = xpl;
1107	>	TreeNode<V> sib = xpl;
1108		if (sib != null && sib.red) {
1109		sib.red = false;
1110		xp.red = true;
#	Line 1007 | Line 1114 | public class ConcurrentHashMapV8<K, V>
1114		if (sib == null)
1115		x = xp;
1116		else {
1117	<	TreeNode sl = sib.left, sr = sib.right;
1117	>	TreeNode<V> sl = sib.left, sr = sib.right;
1118		if ((sl == null || !sl.red) &&
1119		(sr == null || !sr.red)) {
1120		sib.red = true;
#	Line 1019 | Line 1126 | public class ConcurrentHashMapV8<K, V>
1126		sr.red = false;
1127		sib.red = true;
1128		rotateLeft(sib);
1129	<	sib = (xp = x.parent) == null ? null : xp.left;
1129	>	sib = (xp = x.parent) == null ?
1130	>	null : xp.left;
1131		}
1132		if (sib != null) {
1133		sib.red = (xp == null) ? false : xp.red;
#	Line 1049 | Line 1157 | public class ConcurrentHashMapV8<K, V>
1157		/* ---------------- Collision reduction methods -------------- */
1158
1159		/**
1160	<	* Spreads higher bits to lower, and also forces top 2 bits to 0.
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
#	Line 1067 | Line 1175 | public class ConcurrentHashMapV8<K, V>
1175		}
1176
1177		/**
1178	<	* Replaces a list bin with a tree bin. Call only when locked.
1179	<	* Fails to replace if the given key is non-comparable or table
1180	<	* is, or needs, resizing.
1181	<	*/
1182	<	private final void replaceWithTreeBin(Node[] tab, int index, Object key) {
1183	<	if ((key instanceof Comparable) &&
1184	<	(tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) {
1185	<	TreeBin t = new TreeBin();
1186	<	for (Node e = tabAt(tab, index); e != null; e = e.next)
1079	<	t.putTreeNode(e.hash & HASH_BITS, e.key, e.val);
1080	<	setTabAt(tab, index, new Node(MOVED, t, null, null));
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	<	private final Object internalGet(Object k) {
1193	>	@SuppressWarnings("unchecked") private final V internalGet(Object k) {
1194		int h = spread(k.hashCode());
1195	<	retry: for (Node[] tab = table; tab != null;) {
1196	<	Node e, p; Object ek, ev; int eh;      // locals to read fields once
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) == MOVED) {
1198	>	if ((eh = e.hash) < 0) {
1199		if ((ek = e.key) instanceof TreeBin)  // search TreeBin
1200	<	return ((TreeBin)ek).getValue(h, k);
1201	<	else {                        // restart with new table
1202	<	tab = (Node[])ek;
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 & HASH_BITS) == h && (ev = e.val) != null &&
1206	>	else if (eh == h && (ev = e.val) != null &&
1207		((ek = e.key) == k || k.equals(ek)))
1208		return ev;
1209		}
#	Line 1111 | Line 1217 | public class ConcurrentHashMapV8<K, V>
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	<	for (Node[] tab = table;;) {
1225	<	Node f; int i, fh; Object fk;
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) == MOVED) {
1229	>	else if ((fh = f.hash) < 0) {
1230		if ((fk = f.key) instanceof TreeBin) {
1231	<	TreeBin t = (TreeBin)fk;
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 p = t.getTreeNode(h, k, t.root);
1238	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1239		if (p != null) {
1240	<	Object pv = p.val;
1240	>	V pv = p.val;
1241		if (cv == null || cv == pv || cv.equals(pv)) {
1242		oldVal = pv;
1243		if ((p.val = v) == null) {
#	Line 1145 | Line 1252 | public class ConcurrentHashMapV8<K, V>
1252		}
1253		if (validated) {
1254		if (deleted)
1255	<	counter.add(-1L);
1255	>	addCount(-1L, -1);
1256		break;
1257		}
1258		}
1259		else
1260	<	tab = (Node[])fk;
1260	>	tab = (Node<V>[])fk;
1261		}
1262	<	else if ((fh & HASH_BITS) != h && f.next == null) // precheck
1262	>	else if (fh != h && f.next == null) // precheck
1263		break;                          // rules out possible existence
1264	<	else if ((fh & LOCKED) != 0) {
1158	<	checkForResize();               // try resizing if can't get lock
1159	<	f.tryAwaitLock(tab, i);
1160	<	}
1161	<	else if (f.casHash(fh, fh | LOCKED)) {
1264	>	else {
1265		boolean validated = false;
1266		boolean deleted = false;
1267	<	try {
1267	>	synchronized (f) {
1268		if (tabAt(tab, i) == f) {
1269		validated = true;
1270	<	for (Node e = f, pred = null;;) {
1271	<	Object ek, ev;
1272	<	if ((e.hash & HASH_BITS) == h &&
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
#	Line 1187 | Line 1290 | public class ConcurrentHashMapV8<K, V>
1290		break;
1291		}
1292		}
1190	–	} finally {
1191	–	if (!f.casHash(fh | LOCKED, fh)) {
1192	–	f.hash = fh;
1193	–	synchronized (f) { f.notifyAll(); };
1194	–	}
1293		}
1294		if (validated) {
1295		if (deleted)
1296	<	counter.add(-1L);
1296	>	addCount(-1L, -1);
1297		break;
1298		}
1299		}
#	Line 1204 | Line 1302 | public class ConcurrentHashMapV8<K, V>
1302		}
1303
1304		/*
1305	<	* Internal versions of the five insertion methods, each a
1306	<	* little more complicated than the last. All have
1209	<	* the same basic structure as the first (internalPut):
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 others interweave other checks and/or alternative actions:
1314	<	*  * Plain put checks for and performs resize after insertion.
1315	<	*  * putIfAbsent prescans for mapping without lock (and fails to add
1316	<	*    if present), which also makes pre-emptive resize checks worthwhile.
1317	<	*  * computeIfAbsent extends form used in putIfAbsent with additional
1318	<	*    mechanics to deal with, calls, potential exceptions and null
1319	<	*    returns from function call.
1223	<	*  * compute uses the same function-call mechanics, but without
1224	<	*    the prescans
1225	<	*  * putAll attempts to pre-allocate enough table space
1226	<	*    and more lazily performs count updates and checks.
1227	<	*
1228	<	* Someday when details settle down a bit more, it might be worth
1229	<	* some factoring to reduce sprawl.
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 */
1323	<	private final Object internalPut(Object k, Object v) {
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 count = 0;
1328	<	for (Node[] tab = table;;) {
1329	<	int i; Node f; int fh; Object fk;
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(h, k, v, 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) == MOVED) {
1336	>	else if ((fh = f.hash) < 0) {
1337		if ((fk = f.key) instanceof TreeBin) {
1338	<	TreeBin t = (TreeBin)fk;
1339	<	Object oldVal = null;
1338	>	TreeBin<V> t = (TreeBin<V>)fk;
1339	>	V oldVal = null;
1340		t.acquire(0);
1341		try {
1342		if (tabAt(tab, i) == f) {
1343	<	count = 2;
1344	<	TreeNode p = t.putTreeNode(h, k, v);
1343	>	len = 2;
1344	>	TreeNode<V> p = t.putTreeNode(h, k, v);
1345		if (p != null) {
1346		oldVal = p.val;
1347	<	p.val = v;
1347	>	if (!onlyIfAbsent)
1348	>	p.val = v;
1349		}
1350		}
1351		} finally {
1352		t.release(0);
1353		}
1354	<	if (count != 0) {
1354	>	if (len != 0) {
1355		if (oldVal != null)
1356		return oldVal;
1357		break;
1358		}
1359		}
1360		else
1361	<	tab = (Node[])fk;
1361	>	tab = (Node<V>[])fk;
1362		}
1363	<	else if ((fh & LOCKED) != 0) {
1364	<	checkForResize();
1365	<	f.tryAwaitLock(tab, i);
1366	<	}
1367	<	else if (f.casHash(fh, fh | LOCKED)) {
1368	<	Object oldVal = null;
1276	<	try {                        // needed in case equals() throws
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	<	count = 1;
1371	<	for (Node e = f;; ++count) {
1372	<	Object ek, ev;
1373	<	if ((e.hash & HASH_BITS) == h &&
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	<	e.val = v;
1377	>	if (!onlyIfAbsent)
1378	>	e.val = v;
1379		break;
1380		}
1381	<	Node last = e;
1381	>	Node<V> last = e;
1382		if ((e = e.next) == null) {
1383	<	last.next = new Node(h, k, v, null);
1384	<	if (count >= TREE_THRESHOLD)
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		}
1297	–	} finally {                  // unlock and signal if needed
1298	–	if (!f.casHash(fh | LOCKED, fh)) {
1299	–	f.hash = fh;
1300	–	synchronized (f) { f.notifyAll(); };
1301	–	}
1390		}
1391	<	if (count != 0) {
1391	>	if (len != 0) {
1392		if (oldVal != null)
1393		return oldVal;
1306	–	if (tab.length <= 64)
1307	–	count = 2;
1394		break;
1395		}
1396		}
1397		}
1398	<	counter.add(1L);
1313	<	if (count > 1)
1314	<	checkForResize();
1315	<	return null;
1316	<	}
1317	<
1318	<	/** Implementation for putIfAbsent */
1319	<	private final Object internalPutIfAbsent(Object k, Object v) {
1320	<	int h = spread(k.hashCode());
1321	<	int count = 0;
1322	<	for (Node[] tab = table;;) {
1323	<	int i; Node f; int fh; Object fk, fv;
1324	<	if (tab == null)
1325	<	tab = initTable();
1326	<	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1327	<	if (casTabAt(tab, i, null, new Node(h, k, v, null)))
1328	<	break;
1329	<	}
1330	<	else if ((fh = f.hash) == MOVED) {
1331	<	if ((fk = f.key) instanceof TreeBin) {
1332	<	TreeBin t = (TreeBin)fk;
1333	<	Object oldVal = null;
1334	<	t.acquire(0);
1335	<	try {
1336	<	if (tabAt(tab, i) == f) {
1337	<	count = 2;
1338	<	TreeNode p = t.putTreeNode(h, k, v);
1339	<	if (p != null)
1340	<	oldVal = p.val;
1341	<	}
1342	<	} finally {
1343	<	t.release(0);
1344	<	}
1345	<	if (count != 0) {
1346	<	if (oldVal != null)
1347	<	return oldVal;
1348	<	break;
1349	<	}
1350	<	}
1351	<	else
1352	<	tab = (Node[])fk;
1353	<	}
1354	<	else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1355	<	((fk = f.key) == k || k.equals(fk)))
1356	<	return fv;
1357	<	else {
1358	<	Node g = f.next;
1359	<	if (g != null) { // at least 2 nodes -- search and maybe resize
1360	<	for (Node e = g;;) {
1361	<	Object ek, ev;
1362	<	if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1363	<	((ek = e.key) == k || k.equals(ek)))
1364	<	return ev;
1365	<	if ((e = e.next) == null) {
1366	<	checkForResize();
1367	<	break;
1368	<	}
1369	<	}
1370	<	}
1371	<	if (((fh = f.hash) & LOCKED) != 0) {
1372	<	checkForResize();
1373	<	f.tryAwaitLock(tab, i);
1374	<	}
1375	<	else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1376	<	Object oldVal = null;
1377	<	try {
1378	<	if (tabAt(tab, i) == f) {
1379	<	count = 1;
1380	<	for (Node e = f;; ++count) {
1381	<	Object ek, ev;
1382	<	if ((e.hash & HASH_BITS) == h &&
1383	<	(ev = e.val) != null &&
1384	<	((ek = e.key) == k || k.equals(ek))) {
1385	<	oldVal = ev;
1386	<	break;
1387	<	}
1388	<	Node last = e;
1389	<	if ((e = e.next) == null) {
1390	<	last.next = new Node(h, k, v, null);
1391	<	if (count >= TREE_THRESHOLD)
1392	<	replaceWithTreeBin(tab, i, k);
1393	<	break;
1394	<	}
1395	<	}
1396	<	}
1397	<	} finally {
1398	<	if (!f.casHash(fh | LOCKED, fh)) {
1399	<	f.hash = fh;
1400	<	synchronized (f) { f.notifyAll(); };
1401	<	}
1402	<	}
1403	<	if (count != 0) {
1404	<	if (oldVal != null)
1405	<	return oldVal;
1406	<	if (tab.length <= 64)
1407	<	count = 2;
1408	<	break;
1409	<	}
1410	<	}
1411	<	}
1412	<	}
1413	<	counter.add(1L);
1414	<	if (count > 1)
1415	<	checkForResize();
1398	>	addCount(1L, len);
1399		return null;
1400		}
1401
1402		/** Implementation for computeIfAbsent */
1403	<	private final Object internalComputeIfAbsent(K k,
1404	<	Fun<? super K, ?> mf) {
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	<	Object val = null;
1409	<	int count = 0;
1410	<	for (Node[] tab = table;;) {
1411	<	Node f; int i, fh; Object fk, fv;
1408	>	V val = null;
1409	>	int len = 0;
1410	>	for (Node<V>[] tab = table;;) {
1411	>	Node<V> f; int i; Object fk;
1412		if (tab == null)
1413		tab = initTable();
1414		else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1415	<	Node node = new Node(fh = h | LOCKED, k, null, null);
1416	<	if (casTabAt(tab, i, null, node)) {
1417	<	count = 1;
1418	<	try {
1419	<	if ((val = mf.apply(k)) != null)
1420	<	node.val = val;
1421	<	} finally {
1422	<	if (val == null)
1423	<	setTabAt(tab, i, null);
1424	<	if (!node.casHash(fh, h)) {
1440	<	node.hash = h;
1441	<	synchronized (node) { node.notifyAll(); };
1415	>	Node<V> node = new Node<V>(h, k, null, null);
1416	>	synchronized (node) {
1417	>	if (casTabAt(tab, i, null, node)) {
1418	>	len = 1;
1419	>	try {
1420	>	if ((val = mf.apply(k)) != null)
1421	>	node.val = val;
1422	>	} finally {
1423	>	if (val == null)
1424	>	setTabAt(tab, i, null);
1425		}
1426		}
1427		}
1428	<	if (count != 0)
1428	>	if (len != 0)
1429		break;
1430		}
1431	<	else if ((fh = f.hash) == MOVED) {
1431	>	else if (f.hash < 0) {
1432		if ((fk = f.key) instanceof TreeBin) {
1433	<	TreeBin t = (TreeBin)fk;
1433	>	TreeBin<V> t = (TreeBin<V>)fk;
1434		boolean added = false;
1435		t.acquire(0);
1436		try {
1437		if (tabAt(tab, i) == f) {
1438	<	count = 1;
1439	<	TreeNode p = t.getTreeNode(h, k, t.root);
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	<	count = 2;
1444	>	len = 2;
1445		t.putTreeNode(h, k, val);
1446		}
1447		}
1448		} finally {
1449		t.release(0);
1450		}
1451	<	if (count != 0) {
1451	>	if (len != 0) {
1452		if (!added)
1453		return val;
1454		break;
1455		}
1456		}
1457		else
1458	<	tab = (Node[])fk;
1458	>	tab = (Node<V>[])fk;
1459		}
1477	–	else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
1478	–	((fk = f.key) == k || k.equals(fk)))
1479	–	return fv;
1460		else {
1461	<	Node g = f.next;
1462	<	if (g != null) {
1463	<	for (Node e = g;;) {
1464	<	Object ek, ev;
1465	<	if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
1486	<	((ek = e.key) == k || k.equals(ek)))
1487	<	return ev;
1488	<	if ((e = e.next) == null) {
1489	<	checkForResize();
1490	<	break;
1491	<	}
1492	<	}
1493	<	}
1494	<	if (((fh = f.hash) & LOCKED) != 0) {
1495	<	checkForResize();
1496	<	f.tryAwaitLock(tab, i);
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	<	else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
1468	<	boolean added = false;
1469	<	try {
1470	<	if (tabAt(tab, i) == f) {
1471	<	count = 1;
1472	<	for (Node e = f;; ++count) {
1473	<	Object ek, ev;
1474	<	if ((e.hash & HASH_BITS) == h &&
1475	<	(ev = e.val) != null &&
1476	<	((ek = e.key) == k || k.equals(ek))) {
1477	<	val = ev;
1478	<	break;
1479	<	}
1480	<	Node last = e;
1481	<	if ((e = e.next) == null) {
1482	<	if ((val = mf.apply(k)) != null) {
1483	<	added = true;
1484	<	last.next = new Node(h, k, val, null);
1485	<	if (count >= TREE_THRESHOLD)
1517	<	replaceWithTreeBin(tab, i, k);
1518	<	}
1519	<	break;
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	>	last.next = new Node<V>(h, k, val, null);
1484	>	if (len >= TREE_THRESHOLD)
1485	>	replaceWithTreeBin(tab, i, k);
1486		}
1487	+	break;
1488		}
1489		}
1523	–	} finally {
1524	–	if (!f.casHash(fh | LOCKED, fh)) {
1525	–	f.hash = fh;
1526	–	synchronized (f) { f.notifyAll(); };
1527	–	}
1528	–	}
1529	–	if (count != 0) {
1530	–	if (!added)
1531	–	return val;
1532	–	if (tab.length <= 64)
1533	–	count = 2;
1534	–	break;
1490		}
1491		}
1492	+	if (len != 0) {
1493	+	if (!added)
1494	+	return val;
1495	+	break;
1496	+	}
1497		}
1498		}
1499	<	if (val != null) {
1500	<	counter.add(1L);
1541	<	if (count > 1)
1542	<	checkForResize();
1543	<	}
1499	>	if (val != null)
1500	>	addCount(1L, len);
1501		return val;
1502		}
1503
1504		/** Implementation for compute */
1505	<	@SuppressWarnings("unchecked")
1506	<	private final Object internalCompute(K k, boolean onlyIfPresent,
1507	<	BiFun<? super K, ? super V, ? extends V> mf) {
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	<	Object val = null;
1511	>	V val = null;
1512		int delta = 0;
1513	<	int count = 0;
1514	<	for (Node[] tab = table;;) {
1515	<	Node f; int i, fh; Object fk;
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 node = new Node(fh = h | LOCKED, k, null, null);
1522	<	if (casTabAt(tab, i, null, node)) {
1523	<	try {
1524	<	count = 1;
1525	<	if ((val = mf.apply(k, null)) != null) {
1526	<	node.val = val;
1527	<	delta = 1;
1528	<	}
1529	<	} finally {
1530	<	if (delta == 0)
1531	<	setTabAt(tab, i, null);
1532	<	if (!node.casHash(fh, h)) {
1574	<	node.hash = h;
1575	<	synchronized (node) { node.notifyAll(); };
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		}
1535		}
1536	<	if (count != 0)
1536	>	if (len != 0)
1537		break;
1538		}
1539	<	else if ((fh = f.hash) == MOVED) {
1539	>	else if ((fh = f.hash) < 0) {
1540		if ((fk = f.key) instanceof TreeBin) {
1541	<	TreeBin t = (TreeBin)fk;
1541	>	TreeBin<V> t = (TreeBin<V>)fk;
1542		t.acquire(0);
1543		try {
1544		if (tabAt(tab, i) == f) {
1545	<	count = 1;
1546	<	TreeNode p = t.getTreeNode(h, k, t.root);
1547	<	Object pv = (p == null) ? null : p.val;
1548	<	if ((val = mf.apply(k, (V)pv)) != null) {
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	<	count = 2;
1554	>	len = 2;
1555		delta = 1;
1556		t.putTreeNode(h, k, val);
1557		}
#	Line 1605 | Line 1564 | public class ConcurrentHashMapV8<K, V>
1564		} finally {
1565		t.release(0);
1566		}
1567	<	if (count != 0)
1567	>	if (len != 0)
1568		break;
1569		}
1570		else
1571	<	tab = (Node[])fk;
1571	>	tab = (Node<V>[])fk;
1572		}
1573	<	else if ((fh & LOCKED) != 0) {
1574	<	checkForResize();
1616	<	f.tryAwaitLock(tab, i);
1617	<	}
1618	<	else if (f.casHash(fh, fh | LOCKED)) {
1619	<	try {
1573	>	else {
1574	>	synchronized (f) {
1575		if (tabAt(tab, i) == f) {
1576	<	count = 1;
1577	<	for (Node e = f, pred = null;; ++count) {
1578	<	Object ek, ev;
1579	<	if ((e.hash & HASH_BITS) == h &&
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, (V)ev);
1582	>	val = mf.apply(k, ev);
1583		if (val != null)
1584		e.val = val;
1585		else {
1586		delta = -1;
1587	<	Node en = e.next;
1587	>	Node<V> en = e.next;
1588		if (pred != null)
1589		pred.next = en;
1590		else
#	Line 1639 | Line 1594 | public class ConcurrentHashMapV8<K, V>
1594		}
1595		pred = e;
1596		if ((e = e.next) == null) {
1597	<	if (!onlyIfPresent && (val = mf.apply(k, null)) != null) {
1598	<	pred.next = new Node(h, k, val, 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 (count >= TREE_THRESHOLD)
1601	>	if (len >= TREE_THRESHOLD)
1602		replaceWithTreeBin(tab, i, k);
1603		}
1604		break;
1605		}
1606		}
1607		}
1652	–	} finally {
1653	–	if (!f.casHash(fh | LOCKED, fh)) {
1654	–	f.hash = fh;
1655	–	synchronized (f) { f.notifyAll(); };
1656	–	}
1608		}
1609	<	if (count != 0) {
1659	<	if (tab.length <= 64)
1660	<	count = 2;
1609	>	if (len != 0)
1610		break;
1662	–	}
1611		}
1612		}
1613	<	if (delta != 0) {
1614	<	counter.add((long)delta);
1667	<	if (count > 1)
1668	<	checkForResize();
1669	<	}
1613	>	if (delta != 0)
1614	>	addCount((long)delta, len);
1615		return val;
1616		}
1617
1618	<	private final Object internalMerge(K k, V v,
1619	<	BiFun<? super V, ? super V, ? extends V> mf) {
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	<	Object val = null;
1624	>	V val = null;
1625		int delta = 0;
1626	<	int count = 0;
1627	<	for (Node[] tab = table;;) {
1628	<	int i; Node f; int fh; Object fk, fv;
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(h, k, v, 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 ((fh = f.hash) == MOVED) {
1638	>	else if (f.hash < 0) {
1639		if ((fk = f.key) instanceof TreeBin) {
1640	<	TreeBin t = (TreeBin)fk;
1640	>	TreeBin<V> t = (TreeBin<V>)fk;
1641		t.acquire(0);
1642		try {
1643		if (tabAt(tab, i) == f) {
1644	<	count = 1;
1645	<	TreeNode p = t.getTreeNode(h, k, t.root);
1646	<	val = (p == null) ? v : mf.apply((V)p.val, v);
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	<	count = 2;
1651	>	len = 2;
1652		delta = 1;
1653		t.putTreeNode(h, k, val);
1654		}
#	Line 1713 | Line 1661 | public class ConcurrentHashMapV8<K, V>
1661		} finally {
1662		t.release(0);
1663		}
1664	<	if (count != 0)
1664	>	if (len != 0)
1665		break;
1666		}
1667		else
1668	<	tab = (Node[])fk;
1721	<	}
1722	<	else if ((fh & LOCKED) != 0) {
1723	<	checkForResize();
1724	<	f.tryAwaitLock(tab, i);
1668	>	tab = (Node<V>[])fk;
1669		}
1670	<	else if (f.casHash(fh, fh | LOCKED)) {
1671	<	try {
1670	>	else {
1671	>	synchronized (f) {
1672		if (tabAt(tab, i) == f) {
1673	<	count = 1;
1674	<	for (Node e = f, pred = null;; ++count) {
1675	<	Object ek, ev;
1676	<	if ((e.hash & HASH_BITS) == h &&
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(v, (V)ev);
1679	>	val = mf.apply(ev, v);
1680		if (val != null)
1681		e.val = val;
1682		else {
1683		delta = -1;
1684	<	Node en = e.next;
1684	>	Node<V> en = e.next;
1685		if (pred != null)
1686		pred.next = en;
1687		else
#	Line 1748 | Line 1692 | public class ConcurrentHashMapV8<K, V>
1692		pred = e;
1693		if ((e = e.next) == null) {
1694		val = v;
1695	<	pred.next = new Node(h, k, val, null);
1695	>	pred.next = new Node<V>(h, k, val, null);
1696		delta = 1;
1697	<	if (count >= TREE_THRESHOLD)
1697	>	if (len >= TREE_THRESHOLD)
1698		replaceWithTreeBin(tab, i, k);
1699		break;
1700		}
1701		}
1702		}
1759	–	} finally {
1760	–	if (!f.casHash(fh | LOCKED, fh)) {
1761	–	f.hash = fh;
1762	–	synchronized (f) { f.notifyAll(); };
1763	–	}
1703		}
1704	<	if (count != 0) {
1766	<	if (tab.length <= 64)
1767	<	count = 2;
1704	>	if (len != 0)
1705		break;
1769	–	}
1706		}
1707		}
1708	<	if (delta != 0) {
1709	<	counter.add((long)delta);
1774	<	if (count > 1)
1775	<	checkForResize();
1776	<	}
1708	>	if (delta != 0)
1709	>	addCount((long)delta, len);
1710		return val;
1711		}
1712
1713		/** Implementation for putAll */
1714	<	private final void internalPutAll(Map<?, ?> m) {
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<?, ?> entry : m.entrySet()) {
1721	<	Object k, v;
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[] tab = table;;) {
1729	<	int i; Node f; int fh; Object fk;
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(h, k, v, 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) == MOVED) {
1738	>	else if ((fh = f.hash) < 0) {
1739		if ((fk = f.key) instanceof TreeBin) {
1740	<	TreeBin t = (TreeBin)fk;
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 p = t.getTreeNode(h, k, t.root);
1746	>	TreeNode<V> p = t.getTreeNode(h, k, t.root);
1747		if (p != null)
1748		p.val = v;
1749		else {
#	Line 1824 | Line 1758 | public class ConcurrentHashMapV8<K, V>
1758		break;
1759		}
1760		else
1761	<	tab = (Node[])fk;
1761	>	tab = (Node<V>[])fk;
1762		}
1763	<	else if ((fh & LOCKED) != 0) {
1764	<	counter.add(delta);
1765	<	delta = 0L;
1832	<	checkForResize();
1833	<	f.tryAwaitLock(tab, i);
1834	<	}
1835	<	else if (f.casHash(fh, fh | LOCKED)) {
1836	<	int count = 0;
1837	<	try {
1763	>	else {
1764	>	int len = 0;
1765	>	synchronized (f) {
1766		if (tabAt(tab, i) == f) {
1767	<	count = 1;
1768	<	for (Node e = f;; ++count) {
1769	<	Object ek, ev;
1770	<	if ((e.hash & HASH_BITS) == h &&
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 last = e;
1776	>	Node<V> last = e;
1777		if ((e = e.next) == null) {
1778		++delta;
1779	<	last.next = new Node(h, k, v, null);
1780	<	if (count >= TREE_THRESHOLD)
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		}
1858	–	} finally {
1859	–	if (!f.casHash(fh | LOCKED, fh)) {
1860	–	f.hash = fh;
1861	–	synchronized (f) { f.notifyAll(); };
1862	–	}
1786		}
1787	<	if (count != 0) {
1788	<	if (count > 1) {
1789	<	counter.add(delta);
1787	>	if (len != 0) {
1788	>	if (len > 1) {
1789	>	addCount(delta, len);
1790		delta = 0L;
1868	–	checkForResize();
1791		}
1792		break;
1793		}
#	Line 1873 | Line 1795 | public class ConcurrentHashMapV8<K, V>
1795		}
1796		}
1797		} finally {
1798	<	if (delta != 0)
1799	<	counter.add(delta);
1798	>	if (delta != 0L)
1799	>	addCount(delta, 2);
1800		}
1801		if (npe)
1802		throw new NullPointerException();
1803		}
1804
1805	+	/**
1806	+	* Implementation for clear. Steps through each bin, removing all
1807	+	* nodes.
1808	+	*/
1809	+	@SuppressWarnings("unchecked") private final void internalClear() {
1810	+	long delta = 0L; // negative number of deletions
1811	+	int i = 0;
1812	+	Node<V>[] tab = table;
1813	+	while (tab != null && i < tab.length) {
1814	+	Node<V> f = tabAt(tab, i);
1815	+	if (f == null)
1816	+	++i;
1817	+	else if (f.hash < 0) {
1818	+	Object fk;
1819	+	if ((fk = f.key) instanceof TreeBin) {
1820	+	TreeBin<V> t = (TreeBin<V>)fk;
1821	+	t.acquire(0);
1822	+	try {
1823	+	if (tabAt(tab, i) == f) {
1824	+	for (Node<V> p = t.first; p != null; p = p.next) {
1825	+	if (p.val != null) { // (currently always true)
1826	+	p.val = null;
1827	+	--delta;
1828	+	}
1829	+	}
1830	+	t.first = null;
1831	+	t.root = null;
1832	+	++i;
1833	+	}
1834	+	} finally {
1835	+	t.release(0);
1836	+	}
1837	+	}
1838	+	else
1839	+	tab = (Node<V>[])fk;
1840	+	}
1841	+	else {
1842	+	synchronized (f) {
1843	+	if (tabAt(tab, i) == f) {
1844	+	for (Node<V> e = f; e != null; e = e.next) {
1845	+	if (e.val != null) {  // (currently always true)
1846	+	e.val = null;
1847	+	--delta;
1848	+	}
1849	+	}
1850	+	setTabAt(tab, i, null);
1851	+	++i;
1852	+	}
1853	+	}
1854	+	}
1855	+	}
1856	+	if (delta != 0L)
1857	+	addCount(delta, -1);
1858	+	}
1859	+
1860		/* ---------------- Table Initialization and Resizing -------------- */
1861
1862		/**
#	Line 1899 | Line 1876 | public class ConcurrentHashMapV8<K, V>
1876		/**
1877		* Initializes table, using the size recorded in sizeCtl.
1878		*/
1879	<	private final Node[] initTable() {
1880	<	Node[] tab; int sc;
1879	>	@SuppressWarnings("unchecked") private final Node<V>[] initTable() {
1880	>	Node<V>[] tab; int sc;
1881		while ((tab = table) == null) {
1882		if ((sc = sizeCtl) < 0)
1883		Thread.yield(); // lost initialization race; just spin
1884	<	else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1884	>	else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
1885		try {
1886		if ((tab = table) == null) {
1887		int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
1888	<	tab = table = new Node[n];
1888	>	@SuppressWarnings("rawtypes") Node[] tb = new Node[n];
1889	>	table = tab = (Node<V>[])tb;
1890		sc = n - (n >>> 2);
1891		}
1892		} finally {
#	Line 1921 | Line 1899 | public class ConcurrentHashMapV8<K, V>
1899		}
1900
1901		/**
1902	<	* If table is too small and not already resizing, creates next
1903	<	* table and transfers bins.  Rechecks occupancy after a transfer
1904	<	* to see if another resize is already needed because resizings
1905	<	* are lagging additions.
1906	<	*/
1907	<	private final void checkForResize() {
1908	<	Node[] tab; int n, sc;
1909	<	while ((tab = table) != null &&
1910	<	(n = tab.length) < MAXIMUM_CAPACITY &&
1911	<	(sc = sizeCtl) >= 0 && counter.sum() >= (long)sc &&
1912	<	UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1913	<	try {
1914	<	if (tab == table) {
1915	<	table = rebuild(tab);
1916	<	sc = (n << 1) - (n >>> 1);
1902	>	* Adds to count, and if table is too small and not already
1903	>	* resizing, initiates transfer. If already resizing, helps
1904	>	* perform transfer if work is available.  Rechecks occupancy
1905	>	* after a transfer to see if another resize is already needed
1906	>	* because resizings are lagging additions.
1907	>	*
1908	>	* @param x the count to add
1909	>	* @param check if <0, don't check resize, if <= 1 only check if uncontended
1910	>	*/
1911	>	private final void addCount(long x, int check) {
1912	>	CounterCell[] as; long b, s;
1913	>	if ((as = counterCells) != null ||
1914	>	!U.compareAndSwapLong(this, BASECOUNT, b = baseCount, s = b + x)) {
1915	>	CounterHashCode hc; CounterCell a; long v; int m;
1916	>	boolean uncontended = true;
1917	>	if ((hc = threadCounterHashCode.get()) == null ||
1918	>	as == null || (m = as.length - 1) < 0 ||
1919	>	(a = as[m & hc.code]) == null ||
1920	>	!(uncontended =
1921	>	U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))) {
1922	>	fullAddCount(x, hc, uncontended);
1923	>	return;
1924	>	}
1925	>	if (check <= 1)
1926	>	return;
1927	>	s = sumCount();
1928	>	}
1929	>	if (check >= 0) {
1930	>	Node<V>[] tab, nt; int sc;
1931	>	while (s >= (long)(sc = sizeCtl) && (tab = table) != null &&
1932	>	tab.length < MAXIMUM_CAPACITY) {
1933	>	if (sc < 0) {
1934	>	if (sc == -1 || transferIndex <= transferOrigin ||
1935	>	(nt = nextTable) == null)
1936	>	break;
1937	>	if (U.compareAndSwapInt(this, SIZECTL, sc, sc - 1))
1938	>	transfer(tab, nt);
1939		}
1940	<	} finally {
1941	<	sizeCtl = sc;
1940	>	else if (U.compareAndSwapInt(this, SIZECTL, sc, -2))
1941	>	transfer(tab, null);
1942	>	s = sumCount();
1943		}
1944		}
1945		}
#	Line 1948 | Line 1949 | public class ConcurrentHashMapV8<K, V>
1949		*
1950		* @param size number of elements (doesn't need to be perfectly accurate)
1951		*/
1952	<	private final void tryPresize(int size) {
1952	>	@SuppressWarnings("unchecked") private final void tryPresize(int size) {
1953		int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
1954		tableSizeFor(size + (size >>> 1) + 1);
1955		int sc;
1956		while ((sc = sizeCtl) >= 0) {
1957	<	Node[] tab = table; int n;
1957	>	Node<V>[] tab = table; int n;
1958		if (tab == null || (n = tab.length) == 0) {
1959		n = (sc > c) ? sc : c;
1960	<	if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1960	>	if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
1961		try {
1962		if (table == tab) {
1963	<	table = new Node[n];
1963	>	@SuppressWarnings("rawtypes") Node[] tb = new Node[n];
1964	>	table = (Node<V>[])tb;
1965		sc = n - (n >>> 2);
1966		}
1967		} finally {
#	Line 1969 | Line 1971 | public class ConcurrentHashMapV8<K, V>
1971		}
1972		else if (c <= sc || n >= MAXIMUM_CAPACITY)
1973		break;
1974	<	else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
1975	<	try {
1976	<	if (table == tab) {
1975	<	table = rebuild(tab);
1976	<	sc = (n << 1) - (n >>> 1);
1977	<	}
1978	<	} finally {
1979	<	sizeCtl = sc;
1980	<	}
1981	<	}
1974	>	else if (tab == table &&
1975	>	U.compareAndSwapInt(this, SIZECTL, sc, -2))
1976	>	transfer(tab, null);
1977		}
1978		}
1979
1980	<	/*
1980	>	/**
1981		* Moves and/or copies the nodes in each bin to new table. See
1982		* above for explanation.
1988	–	*
1989	–	* @return the new table
1983		*/
1984	<	private static final Node[] rebuild(Node[] tab) {
1985	<	int n = tab.length;
1986	<	Node[] nextTab = new Node[n << 1];
1987	<	Node fwd = new Node(MOVED, nextTab, null, null);
1988	<	int[] buffer = null;       // holds bins to revisit; null until needed
1989	<	Node rev = null;           // reverse forwarder; null until needed
1990	<	int nbuffered = 0;         // the number of bins in buffer list
1991	<	int bufferIndex = 0;       // buffer index of current buffered bin
1992	<	int bin = n - 1;           // current non-buffered bin or -1 if none
1993	<
1994	<	for (int i = bin;;) {      // start upwards sweep
1995	<	int fh; Node f;
1996	<	if ((f = tabAt(tab, i)) == null) {
1997	<	if (bin >= 0) {    // no lock needed (or available)
1998	<	if (!casTabAt(tab, i, f, fwd))
1999	<	continue;
2000	<	}
2001	<	else {             // transiently use a locked forwarding node
2002	<	Node g = new Node(MOVED|LOCKED, nextTab, null, null);
2003	<	if (!casTabAt(tab, i, f, g))
2004	<	continue;
1984	>	@SuppressWarnings("unchecked") private final void transfer
1985	>	(Node<V>[] tab, Node<V>[] nextTab) {
1986	>	int n = tab.length, stride;
1987	>	if ((stride = (NCPU > 1) ? (n >>> 3) / NCPU : n) < MIN_TRANSFER_STRIDE)
1988	>	stride = MIN_TRANSFER_STRIDE; // subdivide range
1989	>	if (nextTab == null) {            // initiating
1990	>	try {
1991	>	@SuppressWarnings("rawtypes") Node[] tb = new Node[n << 1];
1992	>	nextTab = (Node<V>[])tb;
1993	>	} catch (Throwable ex) {      // try to cope with OOME
1994	>	sizeCtl = Integer.MAX_VALUE;
1995	>	return;
1996	>	}
1997	>	nextTable = nextTab;
1998	>	transferOrigin = n;
1999	>	transferIndex = n;
2000	>	Node<V> rev = new Node<V>(MOVED, tab, null, null);
2001	>	for (int k = n; k > 0;) {    // progressively reveal ready slots
2002	>	int nextk = (k > stride) ? k - stride : 0;
2003	>	for (int m = nextk; m < k; ++m)
2004	>	nextTab[m] = rev;
2005	>	for (int m = n + nextk; m < n + k; ++m)
2006	>	nextTab[m] = rev;
2007	>	U.putOrderedInt(this, TRANSFERORIGIN, k = nextk);
2008	>	}
2009	>	}
2010	>	int nextn = nextTab.length;
2011	>	Node<V> fwd = new Node<V>(MOVED, nextTab, null, null);
2012	>	boolean advance = true;
2013	>	for (int i = 0, bound = 0;;) {
2014	>	int nextIndex, nextBound; Node<V> f; Object fk;
2015	>	while (advance) {
2016	>	if (--i >= bound)
2017	>	advance = false;
2018	>	else if ((nextIndex = transferIndex) <= transferOrigin) {
2019	>	i = -1;
2020	>	advance = false;
2021	>	}
2022	>	else if (U.compareAndSwapInt
2023	>	(this, TRANSFERINDEX, nextIndex,
2024	>	nextBound = (nextIndex > stride ?
2025	>	nextIndex - stride : 0))) {
2026	>	bound = nextBound;
2027	>	i = nextIndex - 1;
2028	>	advance = false;
2029	>	}
2030	>	}
2031	>	if (i < 0 || i >= n || i + n >= nextn) {
2032	>	for (int sc;;) {
2033	>	if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, ++sc)) {
2034	>	if (sc == -1) {
2035	>	nextTable = null;
2036	>	table = nextTab;
2037	>	sizeCtl = (n << 1) - (n >>> 1);
2038	>	}
2039	>	return;
2040	>	}
2041	>	}
2042	>	}
2043	>	else if ((f = tabAt(tab, i)) == null) {
2044	>	if (casTabAt(tab, i, null, fwd)) {
2045		setTabAt(nextTab, i, null);
2046		setTabAt(nextTab, i + n, null);
2047	<	setTabAt(tab, i, fwd);
2015	<	if (!g.casHash(MOVED|LOCKED, MOVED)) {
2016	<	g.hash = MOVED;
2017	<	synchronized (g) { g.notifyAll(); }
2018	<	}
2047	>	advance = true;
2048		}
2049		}
2050	<	else if ((fh = f.hash) == MOVED) {
2051	<	Object fk = f.key;
2052	<	if (fk instanceof TreeBin) {
2053	<	TreeBin t = (TreeBin)fk;
2054	<	boolean validated = false;
2055	<	t.acquire(0);
2056	<	try {
2057	<	if (tabAt(tab, i) == f) {
2058	<	validated = true;
2059	<	splitTreeBin(nextTab, i, t);
2060	<	setTabAt(tab, i, fwd);
2050	>	else if (f.hash >= 0) {
2051	>	synchronized (f) {
2052	>	if (tabAt(tab, i) == f) {
2053	>	int runBit = f.hash & n;
2054	>	Node<V> lastRun = f, lo = null, hi = null;
2055	>	for (Node<V> p = f.next; p != null; p = p.next) {
2056	>	int b = p.hash & n;
2057	>	if (b != runBit) {
2058	>	runBit = b;
2059	>	lastRun = p;
2060	>	}
2061		}
2062	<	} finally {
2063	<	t.release(0);
2062	>	if (runBit == 0)
2063	>	lo = lastRun;
2064	>	else
2065	>	hi = lastRun;
2066	>	for (Node<V> p = f; p != lastRun; p = p.next) {
2067	>	int ph = p.hash;
2068	>	Object pk = p.key; V pv = p.val;
2069	>	if ((ph & n) == 0)
2070	>	lo = new Node<V>(ph, pk, pv, lo);
2071	>	else
2072	>	hi = new Node<V>(ph, pk, pv, hi);
2073	>	}
2074	>	setTabAt(nextTab, i, lo);
2075	>	setTabAt(nextTab, i + n, hi);
2076	>	setTabAt(tab, i, fwd);
2077	>	advance = true;
2078		}
2036	–	if (!validated)
2037	–	continue;
2079		}
2080		}
2081	<	else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) {
2082	<	boolean validated = false;
2083	<	try {              // split to lo and hi lists; copying as needed
2081	>	else if ((fk = f.key) instanceof TreeBin) {
2082	>	TreeBin<V> t = (TreeBin<V>)fk;
2083	>	t.acquire(0);
2084	>	try {
2085		if (tabAt(tab, i) == f) {
2086	<	validated = true;
2087	<	splitBin(nextTab, i, f);
2086	>	TreeBin<V> lt = new TreeBin<V>();
2087	>	TreeBin<V> ht = new TreeBin<V>();
2088	>	int lc = 0, hc = 0;
2089	>	for (Node<V> e = t.first; e != null; e = e.next) {
2090	>	int h = e.hash;
2091	>	Object k = e.key; V v = e.val;
2092	>	if ((h & n) == 0) {
2093	>	++lc;
2094	>	lt.putTreeNode(h, k, v);
2095	>	}
2096	>	else {
2097	>	++hc;
2098	>	ht.putTreeNode(h, k, v);
2099	>	}
2100	>	}
2101	>	Node<V> ln, hn; // throw away trees if too small
2102	>	if (lc < TREE_THRESHOLD) {
2103	>	ln = null;
2104	>	for (Node<V> p = lt.first; p != null; p = p.next)
2105	>	ln = new Node<V>(p.hash, p.key, p.val, ln);
2106	>	}
2107	>	else
2108	>	ln = new Node<V>(MOVED, lt, null, null);
2109	>	setTabAt(nextTab, i, ln);
2110	>	if (hc < TREE_THRESHOLD) {
2111	>	hn = null;
2112	>	for (Node<V> p = ht.first; p != null; p = p.next)
2113	>	hn = new Node<V>(p.hash, p.key, p.val, hn);
2114	>	}
2115	>	else
2116	>	hn = new Node<V>(MOVED, ht, null, null);
2117	>	setTabAt(nextTab, i + n, hn);
2118		setTabAt(tab, i, fwd);
2119	+	advance = true;
2120		}
2121		} finally {
2122	<	if (!f.casHash(fh | LOCKED, fh)) {
2050	<	f.hash = fh;
2051	<	synchronized (f) { f.notifyAll(); };
2052	<	}
2122	>	t.release(0);
2123		}
2054	–	if (!validated)
2055	–	continue;
2056	–	}
2057	–	else {
2058	–	if (buffer == null) // initialize buffer for revisits
2059	–	buffer = new int[TRANSFER_BUFFER_SIZE];
2060	–	if (bin < 0 && bufferIndex > 0) {
2061	–	int j = buffer[--bufferIndex];
2062	–	buffer[bufferIndex] = i;
2063	–	i = j;         // swap with another bin
2064	–	continue;
2065	–	}
2066	–	if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) {
2067	–	f.tryAwaitLock(tab, i);
2068	–	continue;      // no other options -- block
2069	–	}
2070	–	if (rev == null)   // initialize reverse-forwarder
2071	–	rev = new Node(MOVED, tab, null, null);
2072	–	if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0)
2073	–	continue;      // recheck before adding to list
2074	–	buffer[nbuffered++] = i;
2075	–	setTabAt(nextTab, i, rev);     // install place-holders
2076	–	setTabAt(nextTab, i + n, rev);
2077	–	}
2078	–
2079	–	if (bin > 0)
2080	–	i = --bin;
2081	–	else if (buffer != null && nbuffered > 0) {
2082	–	bin = -1;
2083	–	i = buffer[bufferIndex = --nbuffered];
2124		}
2125		else
2126	<	return nextTab;
2126	>	advance = true; // already processed
2127		}
2128		}
2129
2130	<	/**
2131	<	* Splits a normal bin with list headed by e into lo and hi parts;
2132	<	* installs in given table.
2133	<	*/
2134	<	private static void splitBin(Node[] nextTab, int i, Node e) {
2135	<	int bit = nextTab.length >>> 1; // bit to split on
2136	<	int runBit = e.hash & bit;
2137	<	Node lastRun = e, lo = null, hi = null;
2138	<	for (Node p = e.next; p != null; p = p.next) {
2099	<	int b = p.hash & bit;
2100	<	if (b != runBit) {
2101	<	runBit = b;
2102	<	lastRun = p;
2130	>	/* ---------------- Counter support -------------- */
2131	>
2132	>	final long sumCount() {
2133	>	CounterCell[] as = counterCells; CounterCell a;
2134	>	long sum = baseCount;
2135	>	if (as != null) {
2136	>	for (int i = 0; i < as.length; ++i) {
2137	>	if ((a = as[i]) != null)
2138	>	sum += a.value;
2139		}
2140		}
2141	<	if (runBit == 0)
2106	<	lo = lastRun;
2107	<	else
2108	<	hi = lastRun;
2109	<	for (Node p = e; p != lastRun; p = p.next) {
2110	<	int ph = p.hash & HASH_BITS;
2111	<	Object pk = p.key, pv = p.val;
2112	<	if ((ph & bit) == 0)
2113	<	lo = new Node(ph, pk, pv, lo);
2114	<	else
2115	<	hi = new Node(ph, pk, pv, hi);
2116	<	}
2117	<	setTabAt(nextTab, i, lo);
2118	<	setTabAt(nextTab, i + bit, hi);
2141	>	return sum;
2142		}
2143
2144	<	/**
2145	<	* Splits a tree bin into lo and hi parts; installs in given table.
2146	<	*/
2147	<	private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) {
2148	<	int bit = nextTab.length >>> 1;
2149	<	TreeBin lt = new TreeBin();
2150	<	TreeBin ht = new TreeBin();
2151	<	int lc = 0, hc = 0;
2152	<	for (Node e = t.first; e != null; e = e.next) {
2130	<	int h = e.hash & HASH_BITS;
2131	<	Object k = e.key, v = e.val;
2132	<	if ((h & bit) == 0) {
2133	<	++lc;
2134	<	lt.putTreeNode(h, k, v);
2135	<	}
2136	<	else {
2137	<	++hc;
2138	<	ht.putTreeNode(h, k, v);
2139	<	}
2140	<	}
2141	<	Node ln, hn; // throw away trees if too small
2142	<	if (lc <= (TREE_THRESHOLD >>> 1)) {
2143	<	ln = null;
2144	<	for (Node p = lt.first; p != null; p = p.next)
2145	<	ln = new Node(p.hash, p.key, p.val, ln);
2146	<	}
2147	<	else
2148	<	ln = new Node(MOVED, lt, null, null);
2149	<	setTabAt(nextTab, i, ln);
2150	<	if (hc <= (TREE_THRESHOLD >>> 1)) {
2151	<	hn = null;
2152	<	for (Node p = ht.first; p != null; p = p.next)
2153	<	hn = new Node(p.hash, p.key, p.val, hn);
2144	>	// See LongAdder version for explanation
2145	>	private final void fullAddCount(long x, CounterHashCode hc,
2146	>	boolean wasUncontended) {
2147	>	int h;
2148	>	if (hc == null) {
2149	>	hc = new CounterHashCode();
2150	>	int s = counterHashCodeGenerator.addAndGet(SEED_INCREMENT);
2151	>	h = hc.code = (s == 0) ? 1 : s; // Avoid zero
2152	>	threadCounterHashCode.set(hc);
2153		}
2154		else
2155	<	hn = new Node(MOVED, ht, null, null);
2156	<	setTabAt(nextTab, i + bit, hn);
2157	<	}
2158	<
2159	<	/**
2160	<	* Implementation for clear. Steps through each bin, removing all
2161	<	* nodes.
2162	<	*/
2163	<	private final void internalClear() {
2164	<	long delta = 0L; // negative number of deletions
2165	<	int i = 0;
2166	<	Node[] tab = table;
2167	<	while (tab != null && i < tab.length) {
2168	<	int fh; Object fk;
2169	<	Node f = tabAt(tab, i);
2170	<	if (f == null)
2171	<	++i;
2172	<	else if ((fh = f.hash) == MOVED) {
2173	<	if ((fk = f.key) instanceof TreeBin) {
2174	<	TreeBin t = (TreeBin)fk;
2175	<	t.acquire(0);
2177	<	try {
2178	<	if (tabAt(tab, i) == f) {
2179	<	for (Node p = t.first; p != null; p = p.next) {
2180	<	p.val = null;
2181	<	--delta;
2155	>	h = hc.code;
2156	>	boolean collide = false;                // True if last slot nonempty
2157	>	for (;;) {
2158	>	CounterCell[] as; CounterCell a; int n; long v;
2159	>	if ((as = counterCells) != null && (n = as.length) > 0) {
2160	>	if ((a = as[(n - 1) & h]) == null) {
2161	>	if (counterBusy == 0) {            // Try to attach new Cell
2162	>	CounterCell r = new CounterCell(x); // Optimistic create
2163	>	if (counterBusy == 0 &&
2164	>	U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
2165	>	boolean created = false;
2166	>	try {               // Recheck under lock
2167	>	CounterCell[] rs; int m, j;
2168	>	if ((rs = counterCells) != null &&
2169	>	(m = rs.length) > 0 &&
2170	>	rs[j = (m - 1) & h] == null) {
2171	>	rs[j] = r;
2172	>	created = true;
2173	>	}
2174	>	} finally {
2175	>	counterBusy = 0;
2176		}
2177	<	t.first = null;
2178	<	t.root = null;
2179	<	++i;
2177	>	if (created)
2178	>	break;
2179	>	continue;           // Slot is now non-empty
2180		}
2187	–	} finally {
2188	–	t.release(0);
2181		}
2182	+	collide = false;
2183		}
2184	<	else
2185	<	tab = (Node[])fk;
2186	<	}
2187	<	else if ((fh & LOCKED) != 0) {
2188	<	counter.add(delta); // opportunistically update count
2189	<	delta = 0L;
2190	<	f.tryAwaitLock(tab, i);
2191	<	}
2192	<	else if (f.casHash(fh, fh | LOCKED)) {
2193	<	try {
2194	<	if (tabAt(tab, i) == f) {
2195	<	for (Node e = f; e != null; e = e.next) {
2196	<	e.val = null;
2197	<	--delta;
2184	>	else if (!wasUncontended)       // CAS already known to fail
2185	>	wasUncontended = true;      // Continue after rehash
2186	>	else if (U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))
2187	>	break;
2188	>	else if (counterCells != as || n >= NCPU)
2189	>	collide = false;            // At max size or stale
2190	>	else if (!collide)
2191	>	collide = true;
2192	>	else if (counterBusy == 0 &&
2193	>	U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
2194	>	try {
2195	>	if (counterCells == as) {// Expand table unless stale
2196	>	CounterCell[] rs = new CounterCell[n << 1];
2197	>	for (int i = 0; i < n; ++i)
2198	>	rs[i] = as[i];
2199	>	counterCells = rs;
2200		}
2201	<	setTabAt(tab, i, null);
2202	<	++i;
2201	>	} finally {
2202	>	counterBusy = 0;
2203		}
2204	<	} finally {
2205	<	if (!f.casHash(fh | LOCKED, fh)) {
2206	<	f.hash = fh;
2207	<	synchronized (f) { f.notifyAll(); };
2204	>	collide = false;
2205	>	continue;                   // Retry with expanded table
2206	>	}
2207	>	h ^= h << 13;                   // Rehash
2208	>	h ^= h >>> 17;
2209	>	h ^= h << 5;
2210	>	}
2211	>	else if (counterBusy == 0 && counterCells == as &&
2212	>	U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
2213	>	boolean init = false;
2214	>	try {                           // Initialize table
2215	>	if (counterCells == as) {
2216	>	CounterCell[] rs = new CounterCell[2];
2217	>	rs[h & 1] = new CounterCell(x);
2218	>	counterCells = rs;
2219	>	init = true;
2220		}
2221	+	} finally {
2222	+	counterBusy = 0;
2223		}
2224	+	if (init)
2225	+	break;
2226		}
2227	+	else if (U.compareAndSwapLong(this, BASECOUNT, v = baseCount, v + x))
2228	+	break;                          // Fall back on using base
2229		}
2230	<	if (delta != 0)
2218	<	counter.add(delta);
2230	>	hc.code = h;                            // Record index for next time
2231		}
2232
2233		/* ----------------Table Traversal -------------- */
2234
2235		/**
2236		* Encapsulates traversal for methods such as containsValue; also
2237	<	* serves as a base class for other iterators.
2237	>	* serves as a base class for other iterators and bulk tasks.
2238		*
2239		* At each step, the iterator snapshots the key ("nextKey") and
2240		* value ("nextVal") of a valid node (i.e., one that, at point of
#	Line 2230 | Line 2242 | public class ConcurrentHashMapV8<K, V>
2242		* change (including to null, indicating deletion), field nextVal
2243		* might not be accurate at point of use, but still maintains the
2244		* weak consistency property of holding a value that was once
2245	<	* valid.
2245	>	* valid. To support iterator.remove, the nextKey field is not
2246	>	* updated (nulled out) when the iterator cannot advance.
2247		*
2248		* Internal traversals directly access these fields, as in:
2249		* {@code while (it.advance() != null) { process(it.nextKey); }}
#	Line 2257 | Line 2270 | public class ConcurrentHashMapV8<K, V>
2270		* across threads, iteration terminates if a bounds checks fails
2271		* for a table read.
2272		*
2273	<	* This class extends ForkJoinTask to streamline parallel
2274	<	* iteration in bulk operations (see BulkTask). This adds only an
2275	<	* int of space overhead, which is close enough to negligible in
2276	<	* cases where it is not needed to not worry about it.
2277	<	*/
2278	<	static class Traverser<K,V,R> extends ForkJoinTask<R> {
2279	<	final ConcurrentHashMapV8<K, V> map;
2280	<	Node next;           // the next entry to use
2281	<	Node last;           // the last entry used
2273	>	* This class extends CountedCompleter to streamline parallel
2274	>	* iteration in bulk operations. This adds only a few fields of
2275	>	* space overhead, which is small enough in cases where it is not
2276	>	* needed to not worry about it.  Because CountedCompleter is
2277	>	* Serializable, but iterators need not be, we need to add warning
2278	>	* suppressions.
2279	>	*/
2280	>	@SuppressWarnings("serial") static class Traverser<K,V,R>
2281	>	extends CountedCompleter<R> {
2282	>	final ConcurrentHashMapV8<K,V> map;
2283	>	Node<V> next;        // the next entry to use
2284		Object nextKey;      // cached key field of next
2285	<	Object nextVal;      // cached val field of next
2286	<	Node[] tab;          // current table; updated if resized
2285	>	V nextVal;           // cached val field of next
2286	>	Node<V>[] tab;       // current table; updated if resized
2287		int index;           // index of bin to use next
2288		int baseIndex;       // current index of initial table
2289		int baseLimit;       // index bound for initial table
2290	<	final int baseSize;  // initial table size
2290	>	int baseSize;        // initial table size
2291	>	int batch;           // split control
2292
2293		/** Creates iterator for all entries in the table. */
2294	<	Traverser(ConcurrentHashMapV8<K, V> map) {
2295	<	this.tab = (this.map = map).table;
2296	<	baseLimit = baseSize = (tab == null) ? 0 : tab.length;
2297	<	}
2298	<
2299	<	/** Creates iterator for split() methods */
2300	<	Traverser(Traverser<K,V,?> it, boolean split) {
2301	<	this.map = it.map;
2302	<	this.tab = it.tab;
2303	<	this.baseSize = it.baseSize;
2304	<	int lo = it.baseIndex;
2305	<	int hi = this.baseLimit = it.baseLimit;
2306	<	int i;
2307	<	if (split) // adjust parent
2308	<	i = it.baseLimit = (lo + hi + 1) >>> 1;
2309	<	else       // clone parent
2310	<	i = lo;
2311	<	this.index = this.baseIndex = i;
2294	>	Traverser(ConcurrentHashMapV8<K,V> map) {
2295	>	this.map = map;
2296	>	}
2297	>
2298	>	/** Creates iterator for split() methods and task constructors */
2299	>	Traverser(ConcurrentHashMapV8<K,V> map, Traverser<K,V,?> it, int batch) {
2300	>	super(it);
2301	>	this.batch = batch;
2302	>	if ((this.map = map) != null && it != null) { // split parent
2303	>	Node<V>[] t;
2304	>	if ((t = it.tab) == null &&
2305	>	(t = it.tab = map.table) != null)
2306	>	it.baseLimit = it.baseSize = t.length;
2307	>	this.tab = t;
2308	>	this.baseSize = it.baseSize;
2309	>	int hi = this.baseLimit = it.baseLimit;
2310	>	it.baseLimit = this.index = this.baseIndex =
2311	>	(hi + it.baseIndex + 1) >>> 1;
2312	>	}
2313		}
2314
2315		/**
2316		* Advances next; returns nextVal or null if terminated.
2317		* See above for explanation.
2318		*/
2319	<	final Object advance() {
2320	<	Node e = last = next;
2321	<	Object ev = null;
2319	>	@SuppressWarnings("unchecked") final V advance() {
2320	>	Node<V> e = next;
2321	>	V ev = null;
2322		outer: do {
2323		if (e != null)                  // advance past used/skipped node
2324		e = e.next;
2325		while (e == null) {             // get to next non-null bin
2326	<	Node[] t; int b, i, n; Object ek; // checks must use locals
2327	<	if ((b = baseIndex) >= baseLimit || (i = index) < 0 ||
2328	<	(t = tab) == null || i >= (n = t.length))
2326	>	ConcurrentHashMapV8<K,V> m;
2327	>	Node<V>[] t; int b, i, n; Object ek; //  must use locals
2328	>	if ((t = tab) != null)
2329	>	n = t.length;
2330	>	else if ((m = map) != null && (t = tab = m.table) != null)
2331	>	n = baseLimit = baseSize = t.length;
2332	>	else
2333		break outer;
2334	<	else if ((e = tabAt(t, i)) != null && e.hash == MOVED) {
2334	>	if ((b = baseIndex) >= baseLimit ||
2335	>	(i = index) < 0 || i >= n)
2336	>	break outer;
2337	>	if ((e = tabAt(t, i)) != null && e.hash < 0) {
2338		if ((ek = e.key) instanceof TreeBin)
2339	<	e = ((TreeBin)ek).first;
2339	>	e = ((TreeBin<V>)ek).first;
2340		else {
2341	<	tab = (Node[])ek;
2341	>	tab = (Node<V>[])ek;
2342		continue;           // restarts due to null val
2343		}
2344		}                           // visit upper slots if present
#	Line 2327 | Line 2351 | public class ConcurrentHashMapV8<K, V>
2351		}
2352
2353		public final void remove() {
2354	<	if (nextVal == null)
2355	<	advance();
2332	<	Node e = last;
2333	<	if (e == null)
2354	>	Object k = nextKey;
2355	>	if (k == null && (advance() == null || (k = nextKey) == null))
2356		throw new IllegalStateException();
2357	<	last = null;
2336	<	map.remove(e.key);
2357	>	map.internalReplace(k, null, null);
2358		}
2359
2360		public final boolean hasNext() {
#	Line 2341 | Line 2362 | public class ConcurrentHashMapV8<K, V>
2362		}
2363
2364		public final boolean hasMoreElements() { return hasNext(); }
2365	<	public final void setRawResult(Object x) { }
2366	<	public R getRawResult() { return null; }
2367	<	public boolean exec() { return true; }
2365	>
2366	>	public void compute() { } // default no-op CountedCompleter body
2367	>
2368	>	/**
2369	>	* Returns a batch value > 0 if this task should (and must) be
2370	>	* split, if so, adding to pending count, and in any case
2371	>	* updating batch value. The initial batch value is approx
2372	>	* exp2 of the number of times (minus one) to split task by
2373	>	* two before executing leaf action. This value is faster to
2374	>	* compute and more convenient to use as a guide to splitting
2375	>	* than is the depth, since it is used while dividing by two
2376	>	* anyway.
2377	>	*/
2378	>	final int preSplit() {
2379	>	ConcurrentHashMapV8<K,V> m; int b; Node<V>[] t;  ForkJoinPool pool;
2380	>	if ((b = batch) < 0 && (m = map) != null) { // force initialization
2381	>	if ((t = tab) == null && (t = tab = m.table) != null)
2382	>	baseLimit = baseSize = t.length;
2383	>	if (t != null) {
2384	>	long n = m.sumCount();
2385	>	int par = ((pool = getPool()) == null) ?
2386	>	ForkJoinPool.getCommonPoolParallelism() :
2387	>	pool.getParallelism();
2388	>	int sp = par << 3; // slack of 8
2389	>	b = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
2390	>	}
2391	>	}
2392	>	b = (b <= 1 || baseIndex == baseLimit) ? 0 : (b >>> 1);
2393	>	if ((batch = b) > 0)
2394	>	addToPendingCount(1);
2395	>	return b;
2396	>	}
2397	>
2398		}
2399
2400		/* ---------------- Public operations -------------- */
#	Line 2352 | Line 2403 | public class ConcurrentHashMapV8<K, V>
2403		* Creates a new, empty map with the default initial table size (16).
2404		*/
2405		public ConcurrentHashMapV8() {
2355	–	this.counter = new LongAdder();
2406		}
2407
2408		/**
#	Line 2371 | Line 2421 | public class ConcurrentHashMapV8<K, V>
2421		int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
2422		MAXIMUM_CAPACITY :
2423		tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
2374	–	this.counter = new LongAdder();
2424		this.sizeCtl = cap;
2425		}
2426
#	Line 2381 | Line 2430 | public class ConcurrentHashMapV8<K, V>
2430		* @param m the map
2431		*/
2432		public ConcurrentHashMapV8(Map<? extends K, ? extends V> m) {
2384	–	this.counter = new LongAdder();
2433		this.sizeCtl = DEFAULT_CAPACITY;
2434		internalPutAll(m);
2435		}
#	Line 2432 | Line 2480 | public class ConcurrentHashMapV8<K, V>
2480		long size = (long)(1.0 + (long)initialCapacity / loadFactor);
2481		int cap = (size >= (long)MAXIMUM_CAPACITY) ?
2482		MAXIMUM_CAPACITY : tableSizeFor((int)size);
2435	–	this.counter = new LongAdder();
2483		this.sizeCtl = cap;
2484		}
2485
2486		/**
2487	+	* Creates a new {@link Set} backed by a ConcurrentHashMapV8
2488	+	* from the given type to {@code Boolean.TRUE}.
2489	+	*
2490	+	* @return the new set
2491	+	*/
2492	+	public static <K> KeySetView<K,Boolean> newKeySet() {
2493	+	return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(),
2494	+	Boolean.TRUE);
2495	+	}
2496	+
2497	+	/**
2498	+	* Creates a new {@link Set} backed by a ConcurrentHashMapV8
2499	+	* from the given type to {@code Boolean.TRUE}.
2500	+	*
2501	+	* @param initialCapacity The implementation performs internal
2502	+	* sizing to accommodate this many elements.
2503	+	* @throws IllegalArgumentException if the initial capacity of
2504	+	* elements is negative
2505	+	* @return the new set
2506	+	*/
2507	+	public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
2508	+	return new KeySetView<K,Boolean>
2509	+	(new ConcurrentHashMapV8<K,Boolean>(initialCapacity), Boolean.TRUE);
2510	+	}
2511	+
2512	+	/**
2513		* {@inheritDoc}
2514		*/
2515		public boolean isEmpty() {
2516	<	return counter.sum() <= 0L; // ignore transient negative values
2516	>	return sumCount() <= 0L; // ignore transient negative values
2517		}
2518
2519		/**
2520		* {@inheritDoc}
2521		*/
2522		public int size() {
2523	<	long n = counter.sum();
2523	>	long n = sumCount();
2524		return ((n < 0L) ? 0 :
2525		(n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
2526		(int)n);
#	Line 2455 | Line 2528 | public class ConcurrentHashMapV8<K, V>
2528
2529		/**
2530		* Returns the number of mappings. This method should be used
2531	<	* instead of {@link #size} because a ConcurrentHashMap may
2531	>	* instead of {@link #size} because a ConcurrentHashMapV8 may
2532		* contain more mappings than can be represented as an int. The
2533	<	* value returned is a snapshot; the actual count may differ if
2534	<	* there are ongoing concurrent insertions of removals.
2533	>	* value returned is an estimate; the actual count may differ if
2534	>	* there are concurrent insertions or removals.
2535		*
2536		* @return the number of mappings
2537		*/
2538		public long mappingCount() {
2539	<	long n = counter.sum();
2540	<	return (n < 0L) ? 0L : n;
2539	>	long n = sumCount();
2540	>	return (n < 0L) ? 0L : n; // ignore transient negative values
2541		}
2542
2543		/**
#	Line 2478 | Line 2551 | public class ConcurrentHashMapV8<K, V>
2551		*
2552		* @throws NullPointerException if the specified key is null
2553		*/
2554	<	@SuppressWarnings("unchecked")
2555	<	public V get(Object key) {
2556	<	if (key == null)
2557	<	throw new NullPointerException();
2558	<	return (V)internalGet(key);
2554	>	public V get(Object key) {
2555	>	return internalGet(key);
2556	>	}
2557	>
2558	>	/**
2559	>	* Returns the value to which the specified key is mapped,
2560	>	* or the given defaultValue if this map contains no mapping for the key.
2561	>	*
2562	>	* @param key the key
2563	>	* @param defaultValue the value to return if this map contains
2564	>	* no mapping for the given key
2565	>	* @return the mapping for the key, if present; else the defaultValue
2566	>	* @throws NullPointerException if the specified key is null
2567	>	*/
2568	>	public V getValueOrDefault(Object key, V defaultValue) {
2569	>	V v;
2570	>	return (v = internalGet(key)) == null ? defaultValue : v;
2571		}
2572
2573		/**
2574		* Tests if the specified object is a key in this table.
2575		*
2576	<	* @param  key   possible key
2576	>	* @param  key possible key
2577		* @return {@code true} if and only if the specified object
2578		*         is a key in this table, as determined by the
2579		*         {@code equals} method; {@code false} otherwise
2580		* @throws NullPointerException if the specified key is null
2581		*/
2582		public boolean containsKey(Object key) {
2498	–	if (key == null)
2499	–	throw new NullPointerException();
2583		return internalGet(key) != null;
2584		}
2585
#	Line 2513 | Line 2596 | public class ConcurrentHashMapV8<K, V>
2596		public boolean containsValue(Object value) {
2597		if (value == null)
2598		throw new NullPointerException();
2599	<	Object v;
2599	>	V v;
2600		Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2601		while ((v = it.advance()) != null) {
2602		if (v == value || value.equals(v))
#	Line 2537 | Line 2620 | public class ConcurrentHashMapV8<K, V>
2620		*         {@code false} otherwise
2621		* @throws NullPointerException if the specified value is null
2622		*/
2623	<	public boolean contains(Object value) {
2623	>	@Deprecated public boolean contains(Object value) {
2624		return containsValue(value);
2625		}
2626
#	Line 2545 | Line 2628 | public class ConcurrentHashMapV8<K, V>
2628		* Maps the specified key to the specified value in this table.
2629		* Neither the key nor the value can be null.
2630		*
2631	<	* <p> The value can be retrieved by calling the {@code get} method
2631	>	* <p>The value can be retrieved by calling the {@code get} method
2632		* with a key that is equal to the original key.
2633		*
2634		* @param key key with which the specified value is to be associated
#	Line 2554 | Line 2637 | public class ConcurrentHashMapV8<K, V>
2637		*         {@code null} if there was no mapping for {@code key}
2638		* @throws NullPointerException if the specified key or value is null
2639		*/
2640	<	@SuppressWarnings("unchecked")
2641	<	public V put(K key, V value) {
2559	<	if (key == null || value == null)
2560	<	throw new NullPointerException();
2561	<	return (V)internalPut(key, value);
2640	>	public V put(K key, V value) {
2641	>	return internalPut(key, value, false);
2642		}
2643
2644		/**
#	Line 2568 | Line 2648 | public class ConcurrentHashMapV8<K, V>
2648		*         or {@code null} if there was no mapping for the key
2649		* @throws NullPointerException if the specified key or value is null
2650		*/
2651	<	@SuppressWarnings("unchecked")
2652	<	public V putIfAbsent(K key, V value) {
2573	<	if (key == null || value == null)
2574	<	throw new NullPointerException();
2575	<	return (V)internalPutIfAbsent(key, value);
2651	>	public V putIfAbsent(K key, V value) {
2652	>	return internalPut(key, value, true);
2653		}
2654
2655		/**
#	Line 2610 | Line 2687 | public class ConcurrentHashMapV8<K, V>
2687		* memoized result, as in:
2688		*
2689		*  <pre> {@code
2690	<	* map.computeIfAbsent(key, new Fun<K, V>() {
2690	>	* map.computeIfAbsent(key, new Fun<K,V>() {
2691		*   public V map(K k) { return new Value(f(k)); }});}</pre>
2692		*
2693		* @param key key with which the specified value is to be associated
2694		* @param mappingFunction the function to compute a value
2695		* @return the current (existing or computed) value associated with
2696	<	*         the specified key, or null if the computed value is null.
2696	>	*         the specified key, or null if the computed value is null
2697		* @throws NullPointerException if the specified key or mappingFunction
2698		*         is null
2699		* @throws IllegalStateException if the computation detectably
#	Line 2625 | Line 2702 | public class ConcurrentHashMapV8<K, V>
2702		* @throws RuntimeException or Error if the mappingFunction does so,
2703		*         in which case the mapping is left unestablished
2704		*/
2705	<	@SuppressWarnings("unchecked")
2706	<	public V computeIfAbsent(K key, Fun<? super K, ? extends V> mappingFunction) {
2707	<	if (key == null || mappingFunction == null)
2631	<	throw new NullPointerException();
2632	<	return (V)internalComputeIfAbsent(key, mappingFunction);
2705	>	public V computeIfAbsent
2706	>	(K key, Fun<? super K, ? extends V> mappingFunction) {
2707	>	return internalComputeIfAbsent(key, mappingFunction);
2708		}
2709
2710		/**
#	Line 2666 | Line 2741 | public class ConcurrentHashMapV8<K, V>
2741		* @throws RuntimeException or Error if the remappingFunction does so,
2742		*         in which case the mapping is unchanged
2743		*/
2744	<	public V computeIfPresent(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2745	<	if (key == null || remappingFunction == null)
2746	<	throw new NullPointerException();
2672	<	return (V)internalCompute(key, true, remappingFunction);
2744	>	public V computeIfPresent
2745	>	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2746	>	return internalCompute(key, true, remappingFunction);
2747		}
2748
2749		/**
#	Line 2712 | Line 2786 | public class ConcurrentHashMapV8<K, V>
2786		* @throws RuntimeException or Error if the remappingFunction does so,
2787		*         in which case the mapping is unchanged
2788		*/
2789	<	//    @SuppressWarnings("unchecked")
2790	<	public V compute(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2791	<	if (key == null || remappingFunction == null)
2718	<	throw new NullPointerException();
2719	<	return (V)internalCompute(key, false, remappingFunction);
2789	>	public V compute
2790	>	(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2791	>	return internalCompute(key, false, remappingFunction);
2792		}
2793
2794		/**
#	Line 2744 | Line 2816 | public class ConcurrentHashMapV8<K, V>
2816		* so the computation should be short and simple, and must not
2817		* attempt to update any other mappings of this Map.
2818		*/
2819	<	//    @SuppressWarnings("unchecked")
2820	<	public V merge(K key, V value, BiFun<? super V, ? super V, ? extends V> remappingFunction) {
2821	<	if (key == null || value == null || remappingFunction == null)
2822	<	throw new NullPointerException();
2751	<	return (V)internalMerge(key, value, remappingFunction);
2819	>	public V merge
2820	>	(K key, V value,
2821	>	BiFun<? super V, ? super V, ? extends V> remappingFunction) {
2822	>	return internalMerge(key, value, remappingFunction);
2823		}
2824
2825		/**
#	Line 2760 | Line 2831 | public class ConcurrentHashMapV8<K, V>
2831		*         {@code null} if there was no mapping for {@code key}
2832		* @throws NullPointerException if the specified key is null
2833		*/
2834	<	@SuppressWarnings("unchecked")
2835	<	public V remove(Object key) {
2765	<	if (key == null)
2766	<	throw new NullPointerException();
2767	<	return (V)internalReplace(key, null, null);
2834	>	public V remove(Object key) {
2835	>	return internalReplace(key, null, null);
2836		}
2837
2838		/**
#	Line 2773 | Line 2841 | public class ConcurrentHashMapV8<K, V>
2841		* @throws NullPointerException if the specified key is null
2842		*/
2843		public boolean remove(Object key, Object value) {
2844	<	if (key == null)
2777	<	throw new NullPointerException();
2778	<	if (value == null)
2779	<	return false;
2780	<	return internalReplace(key, null, value) != null;
2844	>	return value != null && internalReplace(key, null, value) != null;
2845		}
2846
2847		/**
#	Line 2798 | Line 2862 | public class ConcurrentHashMapV8<K, V>
2862		*         or {@code null} if there was no mapping for the key
2863		* @throws NullPointerException if the specified key or value is null
2864		*/
2865	<	@SuppressWarnings("unchecked")
2802	<	public V replace(K key, V value) {
2865	>	public V replace(K key, V value) {
2866		if (key == null || value == null)
2867		throw new NullPointerException();
2868	<	return (V)internalReplace(key, value, null);
2868	>	return internalReplace(key, value, null);
2869		}
2870
2871		/**
#	Line 2815 | Line 2878 | public class ConcurrentHashMapV8<K, V>
2878		/**
2879		* Returns a {@link Set} view of the keys contained in this map.
2880		* The set is backed by the map, so changes to the map are
2881	<	* reflected in the set, and vice-versa.  The set supports element
2819	<	* removal, which removes the corresponding mapping from this map,
2820	<	* via the {@code Iterator.remove}, {@code Set.remove},
2821	<	* {@code removeAll}, {@code retainAll}, and {@code clear}
2822	<	* operations.  It does not support the {@code add} or
2823	<	* {@code addAll} operations.
2881	>	* reflected in the set, and vice-versa.
2882		*
2883	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
2884	<	* that will never throw {@link ConcurrentModificationException},
2885	<	* and guarantees to traverse elements as they existed upon
2886	<	* construction of the iterator, and may (but is not guaranteed to)
2887	<	* reflect any modifications subsequent to construction.
2883	>	* @return the set view
2884	>	*/
2885	>	public KeySetView<K,V> keySet() {
2886	>	KeySetView<K,V> ks = keySet;
2887	>	return (ks != null) ? ks : (keySet = new KeySetView<K,V>(this, null));
2888	>	}
2889	>
2890	>	/**
2891	>	* Returns a {@link Set} view of the keys in this map, using the
2892	>	* given common mapped value for any additions (i.e., {@link
2893	>	* Collection#add} and {@link Collection#addAll}). This is of
2894	>	* course only appropriate if it is acceptable to use the same
2895	>	* value for all additions from this view.
2896	>	*
2897	>	* @param mappedValue the mapped value to use for any additions
2898	>	* @return the set view
2899	>	* @throws NullPointerException if the mappedValue is null
2900		*/
2901	<	public Set<K> keySet() {
2902	<	KeySet<K,V> ks = keySet;
2903	<	return (ks != null) ? ks : (keySet = new KeySet<K,V>(this));
2901	>	public KeySetView<K,V> keySet(V mappedValue) {
2902	>	if (mappedValue == null)
2903	>	throw new NullPointerException();
2904	>	return new KeySetView<K,V>(this, mappedValue);
2905		}
2906
2907		/**
2908		* Returns a {@link Collection} view of the values contained in this map.
2909		* The collection is backed by the map, so changes to the map are
2910	<	* reflected in the collection, and vice-versa.  The collection
2840	<	* supports element removal, which removes the corresponding
2841	<	* mapping from this map, via the {@code Iterator.remove},
2842	<	* {@code Collection.remove}, {@code removeAll},
2843	<	* {@code retainAll}, and {@code clear} operations.  It does not
2844	<	* support the {@code add} or {@code addAll} operations.
2845	<	*
2846	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
2847	<	* that will never throw {@link ConcurrentModificationException},
2848	<	* and guarantees to traverse elements as they existed upon
2849	<	* construction of the iterator, and may (but is not guaranteed to)
2850	<	* reflect any modifications subsequent to construction.
2910	>	* reflected in the collection, and vice-versa.
2911		*/
2912	<	public Collection<V> values() {
2913	<	Values<K,V> vs = values;
2914	<	return (vs != null) ? vs : (values = new Values<K,V>(this));
2912	>	public ValuesView<K,V> values() {
2913	>	ValuesView<K,V> vs = values;
2914	>	return (vs != null) ? vs : (values = new ValuesView<K,V>(this));
2915		}
2916
2917		/**
#	Line 2871 | Line 2931 | public class ConcurrentHashMapV8<K, V>
2931		* reflect any modifications subsequent to construction.
2932		*/
2933		public Set<Map.Entry<K,V>> entrySet() {
2934	<	EntrySet<K,V> es = entrySet;
2935	<	return (es != null) ? es : (entrySet = new EntrySet<K,V>(this));
2934	>	EntrySetView<K,V> es = entrySet;
2935	>	return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this));
2936		}
2937
2938		/**
#	Line 2932 | Line 2992 | public class ConcurrentHashMapV8<K, V>
2992		public int hashCode() {
2993		int h = 0;
2994		Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2995	<	Object v;
2995	>	V v;
2996		while ((v = it.advance()) != null) {
2997		h += it.nextKey.hashCode() ^ v.hashCode();
2998		}
#	Line 2954 | Line 3014 | public class ConcurrentHashMapV8<K, V>
3014		Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3015		StringBuilder sb = new StringBuilder();
3016		sb.append('{');
3017	<	Object v;
3017	>	V v;
3018		if ((v = it.advance()) != null) {
3019		for (;;) {
3020		Object k = it.nextKey;
#	Line 2985 | Line 3045 | public class ConcurrentHashMapV8<K, V>
3045		return false;
3046		Map<?,?> m = (Map<?,?>) o;
3047		Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3048	<	Object val;
3048	>	V val;
3049		while ((val = it.advance()) != null) {
3050		Object v = m.get(it.nextKey);
3051		if (v == null || (v != val && !v.equals(val)))
#	Line 3005 | Line 3065 | public class ConcurrentHashMapV8<K, V>
3065
3066		/* ----------------Iterators -------------- */
3067
3068	<	static final class KeyIterator<K,V> extends Traverser<K,V,Object>
3068	>	@SuppressWarnings("serial") static final class KeyIterator<K,V>
3069	>	extends Traverser<K,V,Object>
3070		implements Spliterator<K>, Enumeration<K> {
3071	<	KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3072	<	KeyIterator(Traverser<K,V,Object> it, boolean split) {
3073	<	super(it, split);
3071	>	KeyIterator(ConcurrentHashMapV8<K,V> map) { super(map); }
3072	>	KeyIterator(ConcurrentHashMapV8<K,V> map, Traverser<K,V,Object> it) {
3073	>	super(map, it, -1);
3074		}
3075		public KeyIterator<K,V> split() {
3076	<	if (last != null || (next != null && nextVal == null))
3076	>	if (nextKey != null)
3077		throw new IllegalStateException();
3078	<	return new KeyIterator<K,V>(this, true);
3078	>	return new KeyIterator<K,V>(map, this);
3079		}
3080	<	@SuppressWarnings("unchecked")
3020	<	public final K next() {
3080	>	@SuppressWarnings("unchecked") public final K next() {
3081		if (nextVal == null && advance() == null)
3082		throw new NoSuchElementException();
3083		Object k = nextKey;
#	Line 3028 | Line 3088 | public class ConcurrentHashMapV8<K, V>
3088		public final K nextElement() { return next(); }
3089		}
3090
3091	<	static final class ValueIterator<K,V> extends Traverser<K,V,Object>
3091	>	@SuppressWarnings("serial") static final class ValueIterator<K,V>
3092	>	extends Traverser<K,V,Object>
3093		implements Spliterator<V>, Enumeration<V> {
3094	<	ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3095	<	ValueIterator(Traverser<K,V,Object> it, boolean split) {
3096	<	super(it, split);
3094	>	ValueIterator(ConcurrentHashMapV8<K,V> map) { super(map); }
3095	>	ValueIterator(ConcurrentHashMapV8<K,V> map, Traverser<K,V,Object> it) {
3096	>	super(map, it, -1);
3097		}
3098		public ValueIterator<K,V> split() {
3099	<	if (last != null || (next != null && nextVal == null))
3099	>	if (nextKey != null)
3100		throw new IllegalStateException();
3101	<	return new ValueIterator<K,V>(this, true);
3101	>	return new ValueIterator<K,V>(map, this);
3102		}
3103
3104	<	@SuppressWarnings("unchecked")
3105	<	public final V next() {
3045	<	Object v;
3104	>	public final V next() {
3105	>	V v;
3106		if ((v = nextVal) == null && (v = advance()) == null)
3107		throw new NoSuchElementException();
3108		nextVal = null;
3109	<	return (V) v;
3109	>	return v;
3110		}
3111
3112		public final V nextElement() { return next(); }
3113		}
3114
3115	<	static final class EntryIterator<K,V> extends Traverser<K,V,Object>
3115	>	@SuppressWarnings("serial") static final class EntryIterator<K,V>
3116	>	extends Traverser<K,V,Object>
3117		implements Spliterator<Map.Entry<K,V>> {
3118	<	EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3119	<	EntryIterator(Traverser<K,V,Object> it, boolean split) {
3120	<	super(it, split);
3118	>	EntryIterator(ConcurrentHashMapV8<K,V> map) { super(map); }
3119	>	EntryIterator(ConcurrentHashMapV8<K,V> map, Traverser<K,V,Object> it) {
3120	>	super(map, it, -1);
3121		}
3122		public EntryIterator<K,V> split() {
3123	<	if (last != null || (next != null && nextVal == null))
3123	>	if (nextKey != null)
3124		throw new IllegalStateException();
3125	<	return new EntryIterator<K,V>(this, true);
3125	>	return new EntryIterator<K,V>(map, this);
3126		}
3127
3128	<	@SuppressWarnings("unchecked")
3129	<	public final Map.Entry<K,V> next() {
3069	<	Object v;
3128	>	@SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
3129	>	V v;
3130		if ((v = nextVal) == null && (v = advance()) == null)
3131		throw new NoSuchElementException();
3132		Object k = nextKey;
3133		nextVal = null;
3134	<	return new MapEntry<K,V>((K)k, (V)v, map);
3134	>	return new MapEntry<K,V>((K)k, v, map);
3135		}
3136		}
3137
3138		/**
3139		* Exported Entry for iterators
3140		*/
3141	<	static final class MapEntry<K,V> implements Map.Entry<K, V> {
3141	>	static final class MapEntry<K,V> implements Map.Entry<K,V> {
3142		final K key; // non-null
3143		V val;       // non-null
3144	<	final ConcurrentHashMapV8<K, V> map;
3145	<	MapEntry(K key, V val, ConcurrentHashMapV8<K, V> map) {
3144	>	final ConcurrentHashMapV8<K,V> map;
3145	>	MapEntry(K key, V val, ConcurrentHashMapV8<K,V> map) {
3146		this.key = key;
3147		this.val = val;
3148		this.map = map;
#	Line 3118 | Line 3178 | public class ConcurrentHashMapV8<K, V>
3178		}
3179		}
3180
3121	–	/* ----------------Views -------------- */
3122	–
3181		/**
3182	<	* Base class for views.
3182	>	* Returns exportable snapshot entry for the given key and value
3183	>	* when write-through can't or shouldn't be used.
3184		*/
3185	<	static abstract class CHMView<K, V> {
3186	<	final ConcurrentHashMapV8<K, V> map;
3128	<	CHMView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
3129	<	public final int size()                 { return map.size(); }
3130	<	public final boolean isEmpty()          { return map.isEmpty(); }
3131	<	public final void clear()               { map.clear(); }
3132	<
3133	<	// implementations below rely on concrete classes supplying these
3134	<	abstract public Iterator<?> iterator();
3135	<	abstract public boolean contains(Object o);
3136	<	abstract public boolean remove(Object o);
3137	<
3138	<	private static final String oomeMsg = "Required array size too large";
3139	<
3140	<	public final Object[] toArray() {
3141	<	long sz = map.mappingCount();
3142	<	if (sz > (long)(MAX_ARRAY_SIZE))
3143	<	throw new OutOfMemoryError(oomeMsg);
3144	<	int n = (int)sz;
3145	<	Object[] r = new Object[n];
3146	<	int i = 0;
3147	<	Iterator<?> it = iterator();
3148	<	while (it.hasNext()) {
3149	<	if (i == n) {
3150	<	if (n >= MAX_ARRAY_SIZE)
3151	<	throw new OutOfMemoryError(oomeMsg);
3152	<	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
3153	<	n = MAX_ARRAY_SIZE;
3154	<	else
3155	<	n += (n >>> 1) + 1;
3156	<	r = Arrays.copyOf(r, n);
3157	<	}
3158	<	r[i++] = it.next();
3159	<	}
3160	<	return (i == n) ? r : Arrays.copyOf(r, i);
3161	<	}
3162	<
3163	<	@SuppressWarnings("unchecked")
3164	<	public final <T> T[] toArray(T[] a) {
3165	<	long sz = map.mappingCount();
3166	<	if (sz > (long)(MAX_ARRAY_SIZE))
3167	<	throw new OutOfMemoryError(oomeMsg);
3168	<	int m = (int)sz;
3169	<	T[] r = (a.length >= m) ? a :
3170	<	(T[])java.lang.reflect.Array
3171	<	.newInstance(a.getClass().getComponentType(), m);
3172	<	int n = r.length;
3173	<	int i = 0;
3174	<	Iterator<?> it = iterator();
3175	<	while (it.hasNext()) {
3176	<	if (i == n) {
3177	<	if (n >= MAX_ARRAY_SIZE)
3178	<	throw new OutOfMemoryError(oomeMsg);
3179	<	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
3180	<	n = MAX_ARRAY_SIZE;
3181	<	else
3182	<	n += (n >>> 1) + 1;
3183	<	r = Arrays.copyOf(r, n);
3184	<	}
3185	<	r[i++] = (T)it.next();
3186	<	}
3187	<	if (a == r && i < n) {
3188	<	r[i] = null; // null-terminate
3189	<	return r;
3190	<	}
3191	<	return (i == n) ? r : Arrays.copyOf(r, i);
3192	<	}
3193	<
3194	<	public final int hashCode() {
3195	<	int h = 0;
3196	<	for (Iterator<?> it = iterator(); it.hasNext();)
3197	<	h += it.next().hashCode();
3198	<	return h;
3199	<	}
3200	<
3201	<	public final String toString() {
3202	<	StringBuilder sb = new StringBuilder();
3203	<	sb.append('[');
3204	<	Iterator<?> it = iterator();
3205	<	if (it.hasNext()) {
3206	<	for (;;) {
3207	<	Object e = it.next();
3208	<	sb.append(e == this ? "(this Collection)" : e);
3209	<	if (!it.hasNext())
3210	<	break;
3211	<	sb.append(',').append(' ');
3212	<	}
3213	<	}
3214	<	return sb.append(']').toString();
3215	<	}
3216	<
3217	<	public final boolean containsAll(Collection<?> c) {
3218	<	if (c != this) {
3219	<	for (Iterator<?> it = c.iterator(); it.hasNext();) {
3220	<	Object e = it.next();
3221	<	if (e == null || !contains(e))
3222	<	return false;
3223	<	}
3224	<	}
3225	<	return true;
3226	<	}
3227	<
3228	<	public final boolean removeAll(Collection<?> c) {
3229	<	boolean modified = false;
3230	<	for (Iterator<?> it = iterator(); it.hasNext();) {
3231	<	if (c.contains(it.next())) {
3232	<	it.remove();
3233	<	modified = true;
3234	<	}
3235	<	}
3236	<	return modified;
3237	<	}
3238	<
3239	<	public final boolean retainAll(Collection<?> c) {
3240	<	boolean modified = false;
3241	<	for (Iterator<?> it = iterator(); it.hasNext();) {
3242	<	if (!c.contains(it.next())) {
3243	<	it.remove();
3244	<	modified = true;
3245	<	}
3246	<	}
3247	<	return modified;
3248	<	}
3249	<
3250	<	}
3251	<
3252	<	static final class KeySet<K,V> extends CHMView<K,V> implements Set<K> {
3253	<	KeySet(ConcurrentHashMapV8<K, V> map)  {
3254	<	super(map);
3255	<	}
3256	<	public final boolean contains(Object o) { return map.containsKey(o); }
3257	<	public final boolean remove(Object o)   { return map.remove(o) != null; }
3258	<	public final Iterator<K> iterator() {
3259	<	return new KeyIterator<K,V>(map);
3260	<	}
3261	<	public final boolean add(K e) {
3262	<	throw new UnsupportedOperationException();
3263	<	}
3264	<	public final boolean addAll(Collection<? extends K> c) {
3265	<	throw new UnsupportedOperationException();
3266	<	}
3267	<	public boolean equals(Object o) {
3268	<	Set<?> c;
3269	<	return ((o instanceof Set) &&
3270	<	((c = (Set<?>)o) == this ||
3271	<	(containsAll(c) && c.containsAll(this))));
3272	<	}
3273	<	}
3274	<
3275	<
3276	<	static final class Values<K,V> extends CHMView<K,V>
3277	<	implements Collection<V> {
3278	<	Values(ConcurrentHashMapV8<K, V> map)   { super(map); }
3279	<	public final boolean contains(Object o) { return map.containsValue(o); }
3280	<	public final boolean remove(Object o) {
3281	<	if (o != null) {
3282	<	Iterator<V> it = new ValueIterator<K,V>(map);
3283	<	while (it.hasNext()) {
3284	<	if (o.equals(it.next())) {
3285	<	it.remove();
3286	<	return true;
3287	<	}
3288	<	}
3289	<	}
3290	<	return false;
3291	<	}
3292	<	public final Iterator<V> iterator() {
3293	<	return new ValueIterator<K,V>(map);
3294	<	}
3295	<	public final boolean add(V e) {
3296	<	throw new UnsupportedOperationException();
3297	<	}
3298	<	public final boolean addAll(Collection<? extends V> c) {
3299	<	throw new UnsupportedOperationException();
3300	<	}
3301	<
3302	<	}
3303	<
3304	<	static final class EntrySet<K,V> extends CHMView<K,V>
3305	<	implements Set<Map.Entry<K,V>> {
3306	<	EntrySet(ConcurrentHashMapV8<K, V> map) { super(map); }
3307	<	public final boolean contains(Object o) {
3308	<	Object k, v, r; Map.Entry<?,?> e;
3309	<	return ((o instanceof Map.Entry) &&
3310	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3311	<	(r = map.get(k)) != null &&
3312	<	(v = e.getValue()) != null &&
3313	<	(v == r || v.equals(r)));
3314	<	}
3315	<	public final boolean remove(Object o) {
3316	<	Object k, v; Map.Entry<?,?> e;
3317	<	return ((o instanceof Map.Entry) &&
3318	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3319	<	(v = e.getValue()) != null &&
3320	<	map.remove(k, v));
3321	<	}
3322	<	public final Iterator<Map.Entry<K,V>> iterator() {
3323	<	return new EntryIterator<K,V>(map);
3324	<	}
3325	<	public final boolean add(Entry<K,V> e) {
3326	<	throw new UnsupportedOperationException();
3327	<	}
3328	<	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
3329	<	throw new UnsupportedOperationException();
3330	<	}
3331	<	public boolean equals(Object o) {
3332	<	Set<?> c;
3333	<	return ((o instanceof Set) &&
3334	<	((c = (Set<?>)o) == this ||
3335	<	(containsAll(c) && c.containsAll(this))));
3336	<	}
3185	>	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
3186	>	return new AbstractMap.SimpleEntry<K,V>(k, v);
3187		}
3188
3189		/* ---------------- Serialization Support -------------- */
#	Line 3357 | Line 3207 | public class ConcurrentHashMapV8<K, V>
3207		* for each key-value mapping, followed by a null pair.
3208		* The key-value mappings are emitted in no particular order.
3209		*/
3210	<	@SuppressWarnings("unchecked")
3211	<	private void writeObject(java.io.ObjectOutputStream s)
3210	>	@SuppressWarnings("unchecked") private void writeObject
3211	>	(java.io.ObjectOutputStream s)
3212		throws java.io.IOException {
3213		if (segments == null) { // for serialization compatibility
3214		segments = (Segment<K,V>[])
#	Line 3368 | Line 3218 | public class ConcurrentHashMapV8<K, V>
3218		}
3219		s.defaultWriteObject();
3220		Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3221	<	Object v;
3221	>	V v;
3222		while ((v = it.advance()) != null) {
3223		s.writeObject(it.nextKey);
3224		s.writeObject(v);
#	Line 3382 | Line 3232 | public class ConcurrentHashMapV8<K, V>
3232		* Reconstitutes the instance from a stream (that is, deserializes it).
3233		* @param s the stream
3234		*/
3235	<	@SuppressWarnings("unchecked")
3236	<	private void readObject(java.io.ObjectInputStream s)
3235	>	@SuppressWarnings("unchecked") private void readObject
3236	>	(java.io.ObjectInputStream s)
3237		throws java.io.IOException, ClassNotFoundException {
3238		s.defaultReadObject();
3239		this.segments = null; // unneeded
3390	–	// initialize transient final field
3391	–	UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder());
3240
3241		// Create all nodes, then place in table once size is known
3242		long size = 0L;
3243	<	Node p = null;
3243	>	Node<V> p = null;
3244		for (;;) {
3245		K k = (K) s.readObject();
3246		V v = (V) s.readObject();
3247		if (k != null && v != null) {
3248		int h = spread(k.hashCode());
3249	<	p = new Node(h, k, v, p);
3249	>	p = new Node<V>(h, k, v, p);
3250		++size;
3251		}
3252		else
#	Line 3416 | Line 3264 | public class ConcurrentHashMapV8<K, V>
3264		int sc = sizeCtl;
3265		boolean collide = false;
3266		if (n > sc &&
3267	<	UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
3267	>	U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
3268		try {
3269		if (table == null) {
3270		init = true;
3271	<	Node[] tab = new Node[n];
3271	>	@SuppressWarnings("rawtypes") Node[] rt = new Node[n];
3272	>	Node<V>[] tab = (Node<V>[])rt;
3273		int mask = n - 1;
3274		while (p != null) {
3275		int j = p.hash & mask;
3276	<	Node next = p.next;
3277	<	Node q = p.next = tabAt(tab, j);
3276	>	Node<V> next = p.next;
3277	>	Node<V> q = p.next = tabAt(tab, j);
3278		setTabAt(tab, j, p);
3279		if (!collide && q != null && q.hash == p.hash)
3280		collide = true;
3281		p = next;
3282		}
3283		table = tab;
3284	<	counter.add(size);
3284	>	addCount(size, -1);
3285		sc = n - (n >>> 2);
3286		}
3287		} finally {
3288		sizeCtl = sc;
3289		}
3290		if (collide) { // rescan and convert to TreeBins
3291	<	Node[] tab = table;
3291	>	Node<V>[] tab = table;
3292		for (int i = 0; i < tab.length; ++i) {
3293		int c = 0;
3294	<	for (Node e = tabAt(tab, i); e != null; e = e.next) {
3294	>	for (Node<V> e = tabAt(tab, i); e != null; e = e.next) {
3295		if (++c > TREE_THRESHOLD &&
3296		(e.key instanceof Comparable)) {
3297		replaceWithTreeBin(tab, i, e.key);
#	Line 3454 | Line 3303 | public class ConcurrentHashMapV8<K, V>
3303		}
3304		if (!init) { // Can only happen if unsafely published.
3305		while (p != null) {
3306	<	internalPut(p.key, p.val);
3306	>	internalPut((K)p.key, p.val, false);
3307		p = p.next;
3308		}
3309		}
3310		}
3311		}
3312
3464	–
3313		// -------------------------------------------------------
3314
3315		// Sams
#	Line 3503 | Line 3351 | public class ConcurrentHashMapV8<K, V>
3351
3352		// -------------------------------------------------------
3353
3354	+	// Sequential bulk operations
3355	+
3356		/**
3357	<	* Returns an extended {@link Parallel} view of this map using the
3508	<	* given executor for bulk parallel operations.
3357	>	* Performs the given action for each (key, value).
3358		*
3359	<	* @param executor the executor
3511	<	* @return a parallel view
3359	>	* @param action the action
3360		*/
3361	<	public Parallel parallel(ForkJoinPool executor)  {
3362	<	return new Parallel(executor);
3361	>	@SuppressWarnings("unchecked") public void forEachSequentially
3362	>	(BiAction<K,V> action) {
3363	>	if (action == null) throw new NullPointerException();
3364	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3365	>	V v;
3366	>	while ((v = it.advance()) != null)
3367	>	action.apply((K)it.nextKey, v);
3368		}
3369
3370		/**
3371	<	* An extended view of a ConcurrentHashMap supporting bulk
3372	<	* parallel operations. These operations are designed to be
3373	<	* safely, and often sensibly, applied even with maps that are
3374	<	* being concurrently updated by other threads; for example, when
3375	<	* computing a snapshot summary of the values in a shared
3376	<	* registry.  There are three kinds of operation, each with four
3377	<	* forms, accepting functions with Keys, Values, Entries, and
3525	<	* (Key, Value) arguments and/or return values. Because the
3526	<	* elements of a ConcurrentHashMap are not ordered in any
3527	<	* particular way, and may be processed in different orders in
3528	<	* different parallel executions, the correctness of supplied
3529	<	* functions should not depend on any ordering, or on any other
3530	<	* objects or values that may transiently change while computation
3531	<	* is in progress; and except for forEach actions, should ideally
3532	<	* be side-effect-free.
3533	<	*
3534	<	* <ul>
3535	<	* <li> forEach: Perform a given action on each element.
3536	<	* A variant form applies a given transformation on each element
3537	<	* before performing the action.</li>
3538	<	*
3539	<	* <li> search: Return the first available non-null result of
3540	<	* applying a given function on each element; skipping further
3541	<	* search when a result is found.</li>
3542	<	*
3543	<	* <li> reduce: Accumulate each element.  The supplied reduction
3544	<	* function cannot rely on ordering (more formally, it should be
3545	<	* both associative and commutative).  There are five variants:
3546	<	*
3547	<	* <ul>
3548	<	*
3549	<	* <li> Plain reductions. (There is not a form of this method for
3550	<	* (key, value) function arguments since there is no corresponding
3551	<	* return type.)</li>
3552	<	*
3553	<	* <li> Mapped reductions that accumulate the results of a given
3554	<	* function applied to each element.</li>
3555	<	*
3556	<	* <li> Reductions to scalar doubles, longs, and ints, using a
3557	<	* given basis value.</li>
3558	<	*
3559	<	* </li>
3560	<	* </ul>
3561	<	* </ul>
3562	<	*
3563	<	* <p>The concurrency properties of the bulk operations follow
3564	<	* from those of ConcurrentHashMap: Any non-null result returned
3565	<	* from {@code get(key)} and related access methods bears a
3566	<	* happens-before relation with the associated insertion or
3567	<	* update.  The result of any bulk operation reflects the
3568	<	* composition of these per-element relations (but is not
3569	<	* necessarily atomic with respect to the map as a whole unless it
3570	<	* is somehow known to be quiescent).  Conversely, because keys
3571	<	* and values in the map are never null, null serves as a reliable
3572	<	* atomic indicator of the current lack of any result.  To
3573	<	* maintain this property, null serves as an implicit basis for
3574	<	* all non-scalar reduction operations. For the double, long, and
3575	<	* int versions, the basis should be one that, when combined with
3576	<	* any other value, returns that other value (more formally, it
3577	<	* should be the identity element for the reduction). Most common
3578	<	* reductions have these properties; for example, computing a sum
3579	<	* with basis 0 or a minimum with basis MAX_VALUE.
3580	<	*
3581	<	* <p>Search and transformation functions provided as arguments
3582	<	* should similarly return null to indicate the lack of any result
3583	<	* (in which case it is not used). In the case of mapped
3584	<	* reductions, this also enables transformations to serve as
3585	<	* filters, returning null (or, in the case of primitive
3586	<	* specializations, the identity basis) if the element should not
3587	<	* be combined. You can create compound transformations and
3588	<	* filterings by composing them yourself under this "null means
3589	<	* there is nothing there now" rule before using them in search or
3590	<	* reduce operations.
3591	<	*
3592	<	* <p>Methods accepting and/or returning Entry arguments maintain
3593	<	* key-value associations. They may be useful for example when
3594	<	* finding the key for the greatest value. Note that "plain" Entry
3595	<	* arguments can be supplied using {@code new
3596	<	* AbstractMap.SimpleEntry(k,v)}.
3597	<	*
3598	<	* <p> Bulk operations may complete abruptly, throwing an
3599	<	* exception encountered in the application of a supplied
3600	<	* function. Bear in mind when handling such exceptions that other
3601	<	* concurrently executing functions could also have thrown
3602	<	* exceptions, or would have done so if the first exception had
3603	<	* not occurred.
3604	<	*
3605	<	* <p>Parallel speedups compared to sequential processing are
3606	<	* common but not guaranteed.  Operations involving brief
3607	<	* functions on small maps may execute more slowly than sequential
3608	<	* loops if the underlying work to parallelize the computation is
3609	<	* more expensive than the computation itself. Similarly,
3610	<	* parallelization may not lead to much actual parallelism if all
3611	<	* processors are busy performing unrelated tasks.
3612	<	*
3613	<	* <p> All arguments to all task methods must be non-null.
3614	<	*
3615	<	* <p><em>jsr166e note: During transition, this class
3616	<	* uses nested functional interfaces with different names but the
3617	<	* same forms as those expected for JDK8.<em>
3371	>	* Performs the given action for each non-null transformation
3372	>	* of each (key, value).
3373	>	*
3374	>	* @param transformer a function returning the transformation
3375	>	* for an element, or null if there is no transformation (in
3376	>	* which case the action is not applied)
3377	>	* @param action the action
3378		*/
3379	<	public class Parallel {
3380	<	final ForkJoinPool fjp;
3381	<
3382	<	/**
3383	<	* Returns an extended view of this map using the given
3384	<	* executor for bulk parallel operations.
3385	<	*
3386	<	* @param executor the executor
3387	<	*/
3388	<	public Parallel(ForkJoinPool executor)  {
3629	<	this.fjp = executor;
3379	>	@SuppressWarnings("unchecked") public <U> void forEachSequentially
3380	>	(BiFun<? super K, ? super V, ? extends U> transformer,
3381	>	Action<U> action) {
3382	>	if (transformer == null || action == null)
3383	>	throw new NullPointerException();
3384	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3385	>	V v; U u;
3386	>	while ((v = it.advance()) != null) {
3387	>	if ((u = transformer.apply((K)it.nextKey, v)) != null)
3388	>	action.apply(u);
3389		}
3390	+	}
3391
3392	<	/**
3393	<	* Performs the given action for each (key, value).
3394	<	*
3395	<	* @param action the action
3396	<	*/
3397	<	public void forEach(BiAction<K,V> action) {
3398	<	fjp.invoke(ForkJoinTasks.forEach
3399	<	(ConcurrentHashMapV8.this, action));
3392	>	/**
3393	>	* Returns a non-null result from applying the given search
3394	>	* function on each (key, value), or null if none.
3395	>	*
3396	>	* @param searchFunction a function returning a non-null
3397	>	* result on success, else null
3398	>	* @return a non-null result from applying the given search
3399	>	* function on each (key, value), or null if none
3400	>	*/
3401	>	@SuppressWarnings("unchecked") public <U> U searchSequentially
3402	>	(BiFun<? super K, ? super V, ? extends U> searchFunction) {
3403	>	if (searchFunction == null) throw new NullPointerException();
3404	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3405	>	V v; U u;
3406	>	while ((v = it.advance()) != null) {
3407	>	if ((u = searchFunction.apply((K)it.nextKey, v)) != null)
3408	>	return u;
3409		}
3410	+	return null;
3411	+	}
3412
3413	<	/**
3414	<	* Performs the given action for each non-null transformation
3415	<	* of each (key, value).
3416	<	*
3417	<	* @param transformer a function returning the transformation
3418	<	* for an element, or null of there is no transformation (in
3419	<	* which case the action is not applied).
3420	<	* @param action the action
3421	<	*/
3422	<	public <U> void forEach(BiFun<? super K, ? super V, ? extends U> transformer,
3423	<	Action<U> action) {
3424	<	fjp.invoke(ForkJoinTasks.forEach
3425	<	(ConcurrentHashMapV8.this, transformer, action));
3413	>	/**
3414	>	* Returns the result of accumulating the given transformation
3415	>	* of all (key, value) pairs using the given reducer to
3416	>	* combine values, or null if none.
3417	>	*
3418	>	* @param transformer a function returning the transformation
3419	>	* for an element, or null if there is no transformation (in
3420	>	* which case it is not combined)
3421	>	* @param reducer a commutative associative combining function
3422	>	* @return the result of accumulating the given transformation
3423	>	* of all (key, value) pairs
3424	>	*/
3425	>	@SuppressWarnings("unchecked") public <U> U reduceSequentially
3426	>	(BiFun<? super K, ? super V, ? extends U> transformer,
3427	>	BiFun<? super U, ? super U, ? extends U> reducer) {
3428	>	if (transformer == null || reducer == null)
3429	>	throw new NullPointerException();
3430	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3431	>	U r = null, u; V v;
3432	>	while ((v = it.advance()) != null) {
3433	>	if ((u = transformer.apply((K)it.nextKey, v)) != null)
3434	>	r = (r == null) ? u : reducer.apply(r, u);
3435		}
3436	+	return r;
3437	+	}
3438
3439	<	/**
3440	<	* Returns a non-null result from applying the given search
3441	<	* function on each (key, value), or null if none.  Further
3442	<	* element processing is suppressed upon success. However,
3443	<	* this method does not return until other in-progress
3444	<	* parallel invocations of the search function also complete.
3445	<	*
3446	<	* @param searchFunction a function returning a non-null
3447	<	* result on success, else null
3448	<	* @return a non-null result from applying the given search
3449	<	* function on each (key, value), or null if none
3450	<	*/
3451	<	public <U> U search(BiFun<? super K, ? super V, ? extends U> searchFunction) {
3452	<	return fjp.invoke(ForkJoinTasks.search
3453	<	(ConcurrentHashMapV8.this, searchFunction));
3454	<	}
3439	>	/**
3440	>	* Returns the result of accumulating the given transformation
3441	>	* of all (key, value) pairs using the given reducer to
3442	>	* combine values, and the given basis as an identity value.
3443	>	*
3444	>	* @param transformer a function returning the transformation
3445	>	* for an element
3446	>	* @param basis the identity (initial default value) for the reduction
3447	>	* @param reducer a commutative associative combining function
3448	>	* @return the result of accumulating the given transformation
3449	>	* of all (key, value) pairs
3450	>	*/
3451	>	@SuppressWarnings("unchecked") public double reduceToDoubleSequentially
3452	>	(ObjectByObjectToDouble<? super K, ? super V> transformer,
3453	>	double basis,
3454	>	DoubleByDoubleToDouble reducer) {
3455	>	if (transformer == null || reducer == null)
3456	>	throw new NullPointerException();
3457	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3458	>	double r = basis; V v;
3459	>	while ((v = it.advance()) != null)
3460	>	r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
3461	>	return r;
3462	>	}
3463
3464	<	/**
3465	<	* Returns the result of accumulating the given transformation
3466	<	* of all (key, value) pairs using the given reducer to
3467	<	* combine values, or null if none.
3468	<	*
3469	<	* @param transformer a function returning the transformation
3470	<	* for an element, or null of there is no transformation (in
3471	<	* which case it is not combined).
3472	<	* @param reducer a commutative associative combining function
3473	<	* @return the result of accumulating the given transformation
3474	<	* of all (key, value) pairs
3475	<	*/
3476	<	public <U> U reduce(BiFun<? super K, ? super V, ? extends U> transformer,
3477	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3478	<	return fjp.invoke(ForkJoinTasks.reduce
3479	<	(ConcurrentHashMapV8.this, transformer, reducer));
3480	<	}
3464	>	/**
3465	>	* Returns the result of accumulating the given transformation
3466	>	* of all (key, value) pairs using the given reducer to
3467	>	* combine values, and the given basis as an identity value.
3468	>	*
3469	>	* @param transformer a function returning the transformation
3470	>	* for an element
3471	>	* @param basis the identity (initial default value) for the reduction
3472	>	* @param reducer a commutative associative combining function
3473	>	* @return the result of accumulating the given transformation
3474	>	* of all (key, value) pairs
3475	>	*/
3476	>	@SuppressWarnings("unchecked") public long reduceToLongSequentially
3477	>	(ObjectByObjectToLong<? super K, ? super V> transformer,
3478	>	long basis,
3479	>	LongByLongToLong reducer) {
3480	>	if (transformer == null || reducer == null)
3481	>	throw new NullPointerException();
3482	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3483	>	long r = basis; V v;
3484	>	while ((v = it.advance()) != null)
3485	>	r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
3486	>	return r;
3487	>	}
3488
3489	<	/**
3490	<	* Returns the result of accumulating the given transformation
3491	<	* of all (key, value) pairs using the given reducer to
3492	<	* combine values, and the given basis as an identity value.
3493	<	*
3494	<	* @param transformer a function returning the transformation
3495	<	* for an element
3496	<	* @param basis the identity (initial default value) for the reduction
3497	<	* @param reducer a commutative associative combining function
3498	<	* @return the result of accumulating the given transformation
3499	<	* of all (key, value) pairs
3500	<	*/
3501	<	public double reduceToDouble(ObjectByObjectToDouble<? super K, ? super V> transformer,
3502	<	double basis,
3503	<	DoubleByDoubleToDouble reducer) {
3504	<	return fjp.invoke(ForkJoinTasks.reduceToDouble
3505	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3506	<	}
3489	>	/**
3490	>	* Returns the result of accumulating the given transformation
3491	>	* of all (key, value) pairs using the given reducer to
3492	>	* combine values, and the given basis as an identity value.
3493	>	*
3494	>	* @param transformer a function returning the transformation
3495	>	* for an element
3496	>	* @param basis the identity (initial default value) for the reduction
3497	>	* @param reducer a commutative associative combining function
3498	>	* @return the result of accumulating the given transformation
3499	>	* of all (key, value) pairs
3500	>	*/
3501	>	@SuppressWarnings("unchecked") public int reduceToIntSequentially
3502	>	(ObjectByObjectToInt<? super K, ? super V> transformer,
3503	>	int basis,
3504	>	IntByIntToInt reducer) {
3505	>	if (transformer == null || reducer == null)
3506	>	throw new NullPointerException();
3507	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3508	>	int r = basis; V v;
3509	>	while ((v = it.advance()) != null)
3510	>	r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
3511	>	return r;
3512	>	}
3513
3514	<	/**
3515	<	* Returns the result of accumulating the given transformation
3516	<	* of all (key, value) pairs using the given reducer to
3517	<	* combine values, and the given basis as an identity value.
3518	<	*
3519	<	* @param transformer a function returning the transformation
3520	<	* for an element
3521	<	* @param basis the identity (initial default value) for the reduction
3522	<	* @param reducer a commutative associative combining function
3523	<	* @return the result of accumulating the given transformation
3524	<	* of all (key, value) pairs using the given reducer to
3525	<	* combine values, and the given basis as an identity value.
3723	<	*/
3724	<	public long reduceToLong(ObjectByObjectToLong<? super K, ? super V> transformer,
3725	<	long basis,
3726	<	LongByLongToLong reducer) {
3727	<	return fjp.invoke(ForkJoinTasks.reduceToLong
3728	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3729	<	}
3514	>	/**
3515	>	* Performs the given action for each key.
3516	>	*
3517	>	* @param action the action
3518	>	*/
3519	>	@SuppressWarnings("unchecked") public void forEachKeySequentially
3520	>	(Action<K> action) {
3521	>	if (action == null) throw new NullPointerException();
3522	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3523	>	while (it.advance() != null)
3524	>	action.apply((K)it.nextKey);
3525	>	}
3526
3527	<	/**
3528	<	* Returns the result of accumulating the given transformation
3529	<	* of all (key, value) pairs using the given reducer to
3530	<	* combine values, and the given basis as an identity value.
3531	<	*
3532	<	* @param transformer a function returning the transformation
3533	<	* for an element
3534	<	* @param basis the identity (initial default value) for the reduction
3535	<	* @param reducer a commutative associative combining function
3536	<	* @return the result of accumulating the given transformation
3537	<	* of all (key, value) pairs
3538	<	*/
3539	<	public int reduceToInt(ObjectByObjectToInt<? super K, ? super V> transformer,
3540	<	int basis,
3541	<	IntByIntToInt reducer) {
3542	<	return fjp.invoke(ForkJoinTasks.reduceToInt
3543	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3527	>	/**
3528	>	* Performs the given action for each non-null transformation
3529	>	* of each key.
3530	>	*
3531	>	* @param transformer a function returning the transformation
3532	>	* for an element, or null if there is no transformation (in
3533	>	* which case the action is not applied)
3534	>	* @param action the action
3535	>	*/
3536	>	@SuppressWarnings("unchecked") public <U> void forEachKeySequentially
3537	>	(Fun<? super K, ? extends U> transformer,
3538	>	Action<U> action) {
3539	>	if (transformer == null || action == null)
3540	>	throw new NullPointerException();
3541	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3542	>	U u;
3543	>	while (it.advance() != null) {
3544	>	if ((u = transformer.apply((K)it.nextKey)) != null)
3545	>	action.apply(u);
3546		}
3547	+	ForkJoinTasks.forEachKey
3548	+	(this, transformer, action).invoke();
3549	+	}
3550
3551	<	/**
3552	<	* Performs the given action for each key.
3553	<	*
3554	<	* @param action the action
3555	<	*/
3556	<	public void forEachKey(Action<K> action) {
3557	<	fjp.invoke(ForkJoinTasks.forEachKey
3558	<	(ConcurrentHashMapV8.this, action));
3551	>	/**
3552	>	* Returns a non-null result from applying the given search
3553	>	* function on each key, or null if none.
3554	>	*
3555	>	* @param searchFunction a function returning a non-null
3556	>	* result on success, else null
3557	>	* @return a non-null result from applying the given search
3558	>	* function on each key, or null if none
3559	>	*/
3560	>	@SuppressWarnings("unchecked") public <U> U searchKeysSequentially
3561	>	(Fun<? super K, ? extends U> searchFunction) {
3562	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3563	>	U u;
3564	>	while (it.advance() != null) {
3565	>	if ((u = searchFunction.apply((K)it.nextKey)) != null)
3566	>	return u;
3567		}
3568	+	return null;
3569	+	}
3570
3571	<	/**
3572	<	* Performs the given action for each non-null transformation
3573	<	* of each key.
3574	<	*
3575	<	* @param transformer a function returning the transformation
3576	<	* for an element, or null of there is no transformation (in
3577	<	* which case the action is not applied).
3578	<	* @param action the action
3579	<	*/
3580	<	public <U> void forEachKey(Fun<? super K, ? extends U> transformer,
3581	<	Action<U> action) {
3582	<	fjp.invoke(ForkJoinTasks.forEachKey
3583	<	(ConcurrentHashMapV8.this, transformer, action));
3571	>	/**
3572	>	* Returns the result of accumulating all keys using the given
3573	>	* reducer to combine values, or null if none.
3574	>	*
3575	>	* @param reducer a commutative associative combining function
3576	>	* @return the result of accumulating all keys using the given
3577	>	* reducer to combine values, or null if none
3578	>	*/
3579	>	@SuppressWarnings("unchecked") public K reduceKeysSequentially
3580	>	(BiFun<? super K, ? super K, ? extends K> reducer) {
3581	>	if (reducer == null) throw new NullPointerException();
3582	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3583	>	K r = null;
3584	>	while (it.advance() != null) {
3585	>	K u = (K)it.nextKey;
3586	>	r = (r == null) ? u : reducer.apply(r, u);
3587	>	}
3588	>	return r;
3589	>	}
3590	>
3591	>	/**
3592	>	* Returns the result of accumulating the given transformation
3593	>	* of all keys using the given reducer to combine values, or
3594	>	* null if none.
3595	>	*
3596	>	* @param transformer a function returning the transformation
3597	>	* for an element, or null if there is no transformation (in
3598	>	* which case it is not combined)
3599	>	* @param reducer a commutative associative combining function
3600	>	* @return the result of accumulating the given transformation
3601	>	* of all keys
3602	>	*/
3603	>	@SuppressWarnings("unchecked") public <U> U reduceKeysSequentially
3604	>	(Fun<? super K, ? extends U> transformer,
3605	>	BiFun<? super U, ? super U, ? extends U> reducer) {
3606	>	if (transformer == null || reducer == null)
3607	>	throw new NullPointerException();
3608	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3609	>	U r = null, u;
3610	>	while (it.advance() != null) {
3611	>	if ((u = transformer.apply((K)it.nextKey)) != null)
3612	>	r = (r == null) ? u : reducer.apply(r, u);
3613		}
3614	+	return r;
3615	+	}
3616
3617	<	/**
3618	<	* Returns a non-null result from applying the given search
3619	<	* function on each key, or null if none.  Further element
3620	<	* processing is suppressed upon success. However, this method
3621	<	* does not return until other in-progress parallel
3622	<	* invocations of the search function also complete.
3623	<	*
3624	<	* @param searchFunction a function returning a non-null
3625	<	* result on success, else null
3626	<	* @return a non-null result from applying the given search
3627	<	* function on each key, or null if none
3628	<	*/
3629	<	public <U> U searchKeys(Fun<? super K, ? extends U> searchFunction) {
3630	<	return fjp.invoke(ForkJoinTasks.searchKeys
3631	<	(ConcurrentHashMapV8.this, searchFunction));
3617	>	/**
3618	>	* Returns the result of accumulating the given transformation
3619	>	* of all keys using the given reducer to combine values, and
3620	>	* the given basis as an identity value.
3621	>	*
3622	>	* @param transformer a function returning the transformation
3623	>	* for an element
3624	>	* @param basis the identity (initial default value) for the reduction
3625	>	* @param reducer a commutative associative combining function
3626	>	* @return  the result of accumulating the given transformation
3627	>	* of all keys
3628	>	*/
3629	>	@SuppressWarnings("unchecked") public double reduceKeysToDoubleSequentially
3630	>	(ObjectToDouble<? super K> transformer,
3631	>	double basis,
3632	>	DoubleByDoubleToDouble reducer) {
3633	>	if (transformer == null || reducer == null)
3634	>	throw new NullPointerException();
3635	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3636	>	double r = basis;
3637	>	while (it.advance() != null)
3638	>	r = reducer.apply(r, transformer.apply((K)it.nextKey));
3639	>	return r;
3640	>	}
3641	>
3642	>	/**
3643	>	* Returns the result of accumulating the given transformation
3644	>	* of all keys using the given reducer to combine values, and
3645	>	* the given basis as an identity value.
3646	>	*
3647	>	* @param transformer a function returning the transformation
3648	>	* for an element
3649	>	* @param basis the identity (initial default value) for the reduction
3650	>	* @param reducer a commutative associative combining function
3651	>	* @return the result of accumulating the given transformation
3652	>	* of all keys
3653	>	*/
3654	>	@SuppressWarnings("unchecked") public long reduceKeysToLongSequentially
3655	>	(ObjectToLong<? super K> transformer,
3656	>	long basis,
3657	>	LongByLongToLong reducer) {
3658	>	if (transformer == null || reducer == null)
3659	>	throw new NullPointerException();
3660	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3661	>	long r = basis;
3662	>	while (it.advance() != null)
3663	>	r = reducer.apply(r, transformer.apply((K)it.nextKey));
3664	>	return r;
3665	>	}
3666	>
3667	>	/**
3668	>	* Returns the result of accumulating the given transformation
3669	>	* of all keys using the given reducer to combine values, and
3670	>	* the given basis as an identity value.
3671	>	*
3672	>	* @param transformer a function returning the transformation
3673	>	* for an element
3674	>	* @param basis the identity (initial default value) for the reduction
3675	>	* @param reducer a commutative associative combining function
3676	>	* @return the result of accumulating the given transformation
3677	>	* of all keys
3678	>	*/
3679	>	@SuppressWarnings("unchecked") public int reduceKeysToIntSequentially
3680	>	(ObjectToInt<? super K> transformer,
3681	>	int basis,
3682	>	IntByIntToInt reducer) {
3683	>	if (transformer == null || reducer == null)
3684	>	throw new NullPointerException();
3685	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3686	>	int r = basis;
3687	>	while (it.advance() != null)
3688	>	r = reducer.apply(r, transformer.apply((K)it.nextKey));
3689	>	return r;
3690	>	}
3691	>
3692	>	/**
3693	>	* Performs the given action for each value.
3694	>	*
3695	>	* @param action the action
3696	>	*/
3697	>	public void forEachValueSequentially(Action<V> action) {
3698	>	if (action == null) throw new NullPointerException();
3699	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3700	>	V v;
3701	>	while ((v = it.advance()) != null)
3702	>	action.apply(v);
3703	>	}
3704	>
3705	>	/**
3706	>	* Performs the given action for each non-null transformation
3707	>	* of each value.
3708	>	*
3709	>	* @param transformer a function returning the transformation
3710	>	* for an element, or null if there is no transformation (in
3711	>	* which case the action is not applied)
3712	>	*/
3713	>	public <U> void forEachValueSequentially
3714	>	(Fun<? super V, ? extends U> transformer,
3715	>	Action<U> action) {
3716	>	if (transformer == null || action == null)
3717	>	throw new NullPointerException();
3718	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3719	>	V v; U u;
3720	>	while ((v = it.advance()) != null) {
3721	>	if ((u = transformer.apply(v)) != null)
3722	>	action.apply(u);
3723		}
3724	+	}
3725
3726	<	/**
3727	<	* Returns the result of accumulating all keys using the given
3728	<	* reducer to combine values, or null if none.
3729	<	*
3730	<	* @param reducer a commutative associative combining function
3731	<	* @return the result of accumulating all keys using the given
3732	<	* reducer to combine values, or null if none
3733	<	*/
3734	<	public K reduceKeys(BiFun<? super K, ? super K, ? extends K> reducer) {
3735	<	return fjp.invoke(ForkJoinTasks.reduceKeys
3736	<	(ConcurrentHashMapV8.this, reducer));
3726	>	/**
3727	>	* Returns a non-null result from applying the given search
3728	>	* function on each value, or null if none.
3729	>	*
3730	>	* @param searchFunction a function returning a non-null
3731	>	* result on success, else null
3732	>	* @return a non-null result from applying the given search
3733	>	* function on each value, or null if none
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 the given transformation
3749	<	* of all keys using the given reducer to combine values, or
3750	<	* null if none.
3751	<	*
3752	<	* @param transformer a function returning the transformation
3753	<	* for an element, or null of there is no transformation (in
3754	<	* which case it is not combined).
3755	<	* @param reducer a commutative associative combining function
3756	<	* @return the result of accumulating the given transformation
3757	<	* of all keys
3758	<	*/
3759	<	public <U> U reduceKeys(Fun<? super K, ? extends U> transformer,
3760	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3761	<	return fjp.invoke(ForkJoinTasks.reduceKeys
3762	<	(ConcurrentHashMapV8.this, transformer, reducer));
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 if 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 keys using the given reducer to combine values, and
3793	<	* 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 keys
3801	<	*/
3802	<	public double reduceKeysToDouble(ObjectToDouble<? super K> transformer,
3803	<	double basis,
3804	<	DoubleByDoubleToDouble reducer) {
3805	<	return fjp.invoke(ForkJoinTasks.reduceKeysToDouble
3806	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
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 if 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 the result of accumulating the given transformation
3903	<	* of all keys using the given reducer to combine values, and
3904	<	* the given basis as an identity value.
3905	<	*
3906	<	* @param transformer a function returning the transformation
3907	<	* for an element
3908	<	* @param basis the identity (initial default value) for the reduction
3909	<	* @param reducer a commutative associative combining function
3910	<	* @return the result of accumulating the given transformation
3911	<	* of all keys
3912	<	*/
3913	<	public long reduceKeysToLong(ObjectToLong<? super K> transformer,
3914	<	long basis,
3915	<	LongByLongToLong reducer) {
3916	<	return fjp.invoke(ForkJoinTasks.reduceKeysToLong
3917	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
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 the given transformation
3924	<	* of all keys using the given reducer to combine values, and
3925	<	* the given basis as an identity value.
3926	<	*
3927	<	* @param transformer a function returning the transformation
3928	<	* for an element
3929	<	* @param basis the identity (initial default value) for the reduction
3930	<	* @param reducer a commutative associative combining function
3931	<	* @return the result of accumulating the given transformation
3932	<	* of all keys
3933	<	*/
3934	<	public int reduceKeysToInt(ObjectToInt<? super K> transformer,
3935	<	int basis,
3936	<	IntByIntToInt reducer) {
3876	<	return fjp.invoke(ForkJoinTasks.reduceKeysToInt
3877	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
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	<	* Performs the given action for each value.
3943	<	*
3944	<	* @param action the action
3945	<	*/
3946	<	public void forEachValue(Action<V> action) {
3947	<	fjp.invoke(ForkJoinTasks.forEachValue
3948	<	(ConcurrentHashMapV8.this, action));
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 if 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 if 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 if 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 if 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 if 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 if 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	+	public <U> U searchValuesInParallel
4342	+	(Fun<? super V, ? extends U> searchFunction) {
4343	+	return ForkJoinTasks.searchValues
4344	+	(this, searchFunction).invoke();
4345	+	}
4346	+
4347	+	/**
4348	+	* Returns the result of accumulating all values using the
4349	+	* given reducer to combine values, or null if none.
4350	+	*
4351	+	* @param reducer a commutative associative combining function
4352	+	* @return  the result of accumulating all values
4353	+	*/
4354	+	public V reduceValuesInParallel
4355	+	(BiFun<? super V, ? super V, ? extends V> reducer) {
4356	+	return ForkJoinTasks.reduceValues
4357	+	(this, reducer).invoke();
4358	+	}
4359	+
4360	+	/**
4361	+	* Returns the result of accumulating the given transformation
4362	+	* of all values using the given reducer to combine values, or
4363	+	* null if none.
4364	+	*
4365	+	* @param transformer a function returning the transformation
4366	+	* for an element, or null if there is no transformation (in
4367	+	* which case it is not combined)
4368	+	* @param reducer a commutative associative combining function
4369	+	* @return the result of accumulating the given transformation
4370	+	* of all values
4371	+	*/
4372	+	public <U> U reduceValuesInParallel
4373	+	(Fun<? super V, ? extends U> transformer,
4374	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4375	+	return ForkJoinTasks.reduceValues
4376	+	(this, transformer, reducer).invoke();
4377	+	}
4378	+
4379	+	/**
4380	+	* Returns the result of accumulating the given transformation
4381	+	* of all values using the given reducer to combine values,
4382	+	* and the given basis as an identity value.
4383	+	*
4384	+	* @param transformer a function returning the transformation
4385	+	* for an element
4386	+	* @param basis the identity (initial default value) for the reduction
4387	+	* @param reducer a commutative associative combining function
4388	+	* @return the result of accumulating the given transformation
4389	+	* of all values
4390	+	*/
4391	+	public double reduceValuesToDoubleInParallel
4392	+	(ObjectToDouble<? super V> transformer,
4393	+	double basis,
4394	+	DoubleByDoubleToDouble reducer) {
4395	+	return ForkJoinTasks.reduceValuesToDouble
4396	+	(this, transformer, basis, reducer).invoke();
4397	+	}
4398	+
4399	+	/**
4400	+	* Returns the result of accumulating the given transformation
4401	+	* of all values using the given reducer to combine values,
4402	+	* and the given basis as an identity value.
4403	+	*
4404	+	* @param transformer a function returning the transformation
4405	+	* for an element
4406	+	* @param basis the identity (initial default value) for the reduction
4407	+	* @param reducer a commutative associative combining function
4408	+	* @return the result of accumulating the given transformation
4409	+	* of all values
4410	+	*/
4411	+	public long reduceValuesToLongInParallel
4412	+	(ObjectToLong<? super V> transformer,
4413	+	long basis,
4414	+	LongByLongToLong reducer) {
4415	+	return ForkJoinTasks.reduceValuesToLong
4416	+	(this, transformer, basis, reducer).invoke();
4417	+	}
4418	+
4419	+	/**
4420	+	* Returns the result of accumulating the given transformation
4421	+	* of all values using the given reducer to combine values,
4422	+	* and the given basis as an identity value.
4423	+	*
4424	+	* @param transformer a function returning the transformation
4425	+	* for an element
4426	+	* @param basis the identity (initial default value) for the reduction
4427	+	* @param reducer a commutative associative combining function
4428	+	* @return the result of accumulating the given transformation
4429	+	* of all values
4430	+	*/
4431	+	public int reduceValuesToIntInParallel
4432	+	(ObjectToInt<? super V> transformer,
4433	+	int basis,
4434	+	IntByIntToInt reducer) {
4435	+	return ForkJoinTasks.reduceValuesToInt
4436	+	(this, transformer, basis, reducer).invoke();
4437	+	}
4438	+
4439	+	/**
4440	+	* Performs the given action for each entry.
4441	+	*
4442	+	* @param action the action
4443	+	*/
4444	+	public void forEachEntryInParallel(Action<Map.Entry<K,V>> action) {
4445	+	ForkJoinTasks.forEachEntry
4446	+	(this, action).invoke();
4447	+	}
4448	+
4449	+	/**
4450	+	* Performs the given action for each non-null transformation
4451	+	* of each entry.
4452	+	*
4453	+	* @param transformer a function returning the transformation
4454	+	* for an element, or null if there is no transformation (in
4455	+	* which case the action is not applied)
4456	+	* @param action the action
4457	+	*/
4458	+	public <U> void forEachEntryInParallel
4459	+	(Fun<Map.Entry<K,V>, ? extends U> transformer,
4460	+	Action<U> action) {
4461	+	ForkJoinTasks.forEachEntry
4462	+	(this, transformer, action).invoke();
4463	+	}
4464	+
4465	+	/**
4466	+	* Returns a non-null result from applying the given search
4467	+	* function on each entry, or null if none.  Upon success,
4468	+	* further element processing is suppressed and the results of
4469	+	* any other parallel invocations of the search function are
4470	+	* ignored.
4471	+	*
4472	+	* @param searchFunction a function returning a non-null
4473	+	* result on success, else null
4474	+	* @return a non-null result from applying the given search
4475	+	* function on each entry, or null if none
4476	+	*/
4477	+	public <U> U searchEntriesInParallel
4478	+	(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4479	+	return ForkJoinTasks.searchEntries
4480	+	(this, searchFunction).invoke();
4481	+	}
4482	+
4483	+	/**
4484	+	* Returns the result of accumulating all entries using the
4485	+	* given reducer to combine values, or null if none.
4486	+	*
4487	+	* @param reducer a commutative associative combining function
4488	+	* @return the result of accumulating all entries
4489	+	*/
4490	+	public Map.Entry<K,V> reduceEntriesInParallel
4491	+	(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4492	+	return ForkJoinTasks.reduceEntries
4493	+	(this, reducer).invoke();
4494	+	}
4495	+
4496	+	/**
4497	+	* Returns the result of accumulating the given transformation
4498	+	* of all entries using the given reducer to combine values,
4499	+	* or null if none.
4500	+	*
4501	+	* @param transformer a function returning the transformation
4502	+	* for an element, or null if there is no transformation (in
4503	+	* which case it is not combined)
4504	+	* @param reducer a commutative associative combining function
4505	+	* @return the result of accumulating the given transformation
4506	+	* of all entries
4507	+	*/
4508	+	public <U> U reduceEntriesInParallel
4509	+	(Fun<Map.Entry<K,V>, ? extends U> transformer,
4510	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4511	+	return ForkJoinTasks.reduceEntries
4512	+	(this, transformer, reducer).invoke();
4513	+	}
4514	+
4515	+	/**
4516	+	* Returns the result of accumulating the given transformation
4517	+	* of all entries using the given reducer to combine values,
4518	+	* and the given basis as an identity value.
4519	+	*
4520	+	* @param transformer a function returning the transformation
4521	+	* for an element
4522	+	* @param basis the identity (initial default value) for the reduction
4523	+	* @param reducer a commutative associative combining function
4524	+	* @return the result of accumulating the given transformation
4525	+	* of all entries
4526	+	*/
4527	+	public double reduceEntriesToDoubleInParallel
4528	+	(ObjectToDouble<Map.Entry<K,V>> transformer,
4529	+	double basis,
4530	+	DoubleByDoubleToDouble reducer) {
4531	+	return ForkJoinTasks.reduceEntriesToDouble
4532	+	(this, transformer, basis, reducer).invoke();
4533	+	}
4534	+
4535	+	/**
4536	+	* Returns the result of accumulating the given transformation
4537	+	* of all entries using the given reducer to combine values,
4538	+	* and the given basis as an identity value.
4539	+	*
4540	+	* @param transformer a function returning the transformation
4541	+	* for an element
4542	+	* @param basis the identity (initial default value) for the reduction
4543	+	* @param reducer a commutative associative combining function
4544	+	* @return  the result of accumulating the given transformation
4545	+	* of all entries
4546	+	*/
4547	+	public long reduceEntriesToLongInParallel
4548	+	(ObjectToLong<Map.Entry<K,V>> transformer,
4549	+	long basis,
4550	+	LongByLongToLong reducer) {
4551	+	return ForkJoinTasks.reduceEntriesToLong
4552	+	(this, transformer, basis, reducer).invoke();
4553	+	}
4554	+
4555	+	/**
4556	+	* Returns the result of accumulating the given transformation
4557	+	* of all entries using the given reducer to combine values,
4558	+	* and the given basis as an identity value.
4559	+	*
4560	+	* @param transformer a function returning the transformation
4561	+	* for an element
4562	+	* @param basis the identity (initial default value) for the reduction
4563	+	* @param reducer a commutative associative combining function
4564	+	* @return the result of accumulating the given transformation
4565	+	* of all entries
4566	+	*/
4567	+	public int reduceEntriesToIntInParallel
4568	+	(ObjectToInt<Map.Entry<K,V>> transformer,
4569	+	int basis,
4570	+	IntByIntToInt reducer) {
4571	+	return ForkJoinTasks.reduceEntriesToInt
4572	+	(this, transformer, basis, reducer).invoke();
4573	+	}
4574	+
4575	+
4576	+	/* ----------------Views -------------- */
4577	+
4578	+	/**
4579	+	* Base class for views.
4580	+	*/
4581	+	abstract static class CHMView<K,V> {
4582	+	final ConcurrentHashMapV8<K,V> map;
4583	+	CHMView(ConcurrentHashMapV8<K,V> map)  { this.map = map; }
4584
4585		/**
4586	<	* Performs the given action for each non-null transformation
3892	<	* of each value.
4586	>	* Returns the map backing this view.
4587		*
4588	<	* @param transformer a function returning the transformation
3895	<	* for an element, or null of there is no transformation (in
3896	<	* which case the action is not applied).
4588	>	* @return the map backing this view
4589		*/
4590	<	public <U> void forEachValue(Fun<? super V, ? extends U> transformer,
4591	<	Action<U> action) {
4592	<	fjp.invoke(ForkJoinTasks.forEachValue
4593	<	(ConcurrentHashMapV8.this, transformer, action));
4590	>	public ConcurrentHashMapV8<K,V> getMap() { return map; }
4591	>
4592	>	public final int size()                 { return map.size(); }
4593	>	public final boolean isEmpty()          { return map.isEmpty(); }
4594	>	public final void clear()               { map.clear(); }
4595	>
4596	>	// implementations below rely on concrete classes supplying these
4597	>	public abstract Iterator<?> iterator();
4598	>	public abstract boolean contains(Object o);
4599	>	public abstract boolean remove(Object o);
4600	>
4601	>	private static final String oomeMsg = "Required array size too large";
4602	>
4603	>	public final Object[] toArray() {
4604	>	long sz = map.mappingCount();
4605	>	if (sz > (long)(MAX_ARRAY_SIZE))
4606	>	throw new OutOfMemoryError(oomeMsg);
4607	>	int n = (int)sz;
4608	>	Object[] r = new Object[n];
4609	>	int i = 0;
4610	>	Iterator<?> it = iterator();
4611	>	while (it.hasNext()) {
4612	>	if (i == n) {
4613	>	if (n >= MAX_ARRAY_SIZE)
4614	>	throw new OutOfMemoryError(oomeMsg);
4615	>	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4616	>	n = MAX_ARRAY_SIZE;
4617	>	else
4618	>	n += (n >>> 1) + 1;
4619	>	r = Arrays.copyOf(r, n);
4620	>	}
4621	>	r[i++] = it.next();
4622	>	}
4623	>	return (i == n) ? r : Arrays.copyOf(r, i);
4624		}
4625
4626	<	/**
4627	<	* Returns a non-null result from applying the given search
4628	<	* function on each value, or null if none.  Further element
4629	<	* processing is suppressed upon success. However, this method
4630	<	* does not return until other in-progress parallel
4631	<	* invocations of the search function also complete.
4632	<	*
4633	<	* @param searchFunction a function returning a non-null
4634	<	* result on success, else null
4635	<	* @return a non-null result from applying the given search
4636	<	* function on each value, or null if none
4637	<	*
4638	<	*/
4639	<	public <U> U searchValues(Fun<? super V, ? extends U> searchFunction) {
4640	<	return fjp.invoke(ForkJoinTasks.searchValues
4641	<	(ConcurrentHashMapV8.this, searchFunction));
4626	>	@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
4627	>	long sz = map.mappingCount();
4628	>	if (sz > (long)(MAX_ARRAY_SIZE))
4629	>	throw new OutOfMemoryError(oomeMsg);
4630	>	int m = (int)sz;
4631	>	T[] r = (a.length >= m) ? a :
4632	>	(T[])java.lang.reflect.Array
4633	>	.newInstance(a.getClass().getComponentType(), m);
4634	>	int n = r.length;
4635	>	int i = 0;
4636	>	Iterator<?> it = iterator();
4637	>	while (it.hasNext()) {
4638	>	if (i == n) {
4639	>	if (n >= MAX_ARRAY_SIZE)
4640	>	throw new OutOfMemoryError(oomeMsg);
4641	>	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4642	>	n = MAX_ARRAY_SIZE;
4643	>	else
4644	>	n += (n >>> 1) + 1;
4645	>	r = Arrays.copyOf(r, n);
4646	>	}
4647	>	r[i++] = (T)it.next();
4648	>	}
4649	>	if (a == r && i < n) {
4650	>	r[i] = null; // null-terminate
4651	>	return r;
4652	>	}
4653	>	return (i == n) ? r : Arrays.copyOf(r, i);
4654		}
4655
4656	<	/**
4657	<	* Returns the result of accumulating all values using the
4658	<	* given reducer to combine values, or null if none.
4659	<	*
4660	<	* @param reducer a commutative associative combining function
3927	<	* @return  the result of accumulating all values
3928	<	*/
3929	<	public V reduceValues(BiFun<? super V, ? super V, ? extends V> reducer) {
3930	<	return fjp.invoke(ForkJoinTasks.reduceValues
3931	<	(ConcurrentHashMapV8.this, reducer));
4656	>	public final int hashCode() {
4657	>	int h = 0;
4658	>	for (Iterator<?> it = iterator(); it.hasNext();)
4659	>	h += it.next().hashCode();
4660	>	return h;
4661		}
4662
4663	<	/**
4664	<	* Returns the result of accumulating the given transformation
4665	<	* of all values using the given reducer to combine values, or
4666	<	* null if none.
4667	<	*
4668	<	* @param transformer a function returning the transformation
4669	<	* for an element, or null of there is no transformation (in
4670	<	* which case it is not combined).
4671	<	* @param reducer a commutative associative combining function
4672	<	* @return the result of accumulating the given transformation
4673	<	* of all values
4674	<	*/
4675	<	public <U> U reduceValues(Fun<? super V, ? extends U> transformer,
4676	<	BiFun<? super U, ? super U, ? extends U> reducer) {
3948	<	return fjp.invoke(ForkJoinTasks.reduceValues
3949	<	(ConcurrentHashMapV8.this, transformer, reducer));
4663	>	public final String toString() {
4664	>	StringBuilder sb = new StringBuilder();
4665	>	sb.append('[');
4666	>	Iterator<?> it = iterator();
4667	>	if (it.hasNext()) {
4668	>	for (;;) {
4669	>	Object e = it.next();
4670	>	sb.append(e == this ? "(this Collection)" : e);
4671	>	if (!it.hasNext())
4672	>	break;
4673	>	sb.append(',').append(' ');
4674	>	}
4675	>	}
4676	>	return sb.append(']').toString();
4677		}
4678
4679	<	/**
4680	<	* Returns the result of accumulating the given transformation
4681	<	* of all values using the given reducer to combine values,
4682	<	* and the given basis as an identity value.
4683	<	*
4684	<	* @param transformer a function returning the transformation
4685	<	* for an element
4686	<	* @param basis the identity (initial default value) for the reduction
4687	<	* @param reducer a commutative associative combining function
3961	<	* @return the result of accumulating the given transformation
3962	<	* of all values
3963	<	*/
3964	<	public double reduceValuesToDouble(ObjectToDouble<? super V> transformer,
3965	<	double basis,
3966	<	DoubleByDoubleToDouble reducer) {
3967	<	return fjp.invoke(ForkJoinTasks.reduceValuesToDouble
3968	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4679	>	public final boolean containsAll(Collection<?> c) {
4680	>	if (c != this) {
4681	>	for (Iterator<?> it = c.iterator(); it.hasNext();) {
4682	>	Object e = it.next();
4683	>	if (e == null || !contains(e))
4684	>	return false;
4685	>	}
4686	>	}
4687	>	return true;
4688		}
4689
4690	<	/**
4691	<	* Returns the result of accumulating the given transformation
4692	<	* of all values using the given reducer to combine values,
4693	<	* and the given basis as an identity value.
4694	<	*
4695	<	* @param transformer a function returning the transformation
4696	<	* for an element
4697	<	* @param basis the identity (initial default value) for the reduction
4698	<	* @param reducer a commutative associative combining function
3980	<	* @return the result of accumulating the given transformation
3981	<	* of all values
3982	<	*/
3983	<	public long reduceValuesToLong(ObjectToLong<? super V> transformer,
3984	<	long basis,
3985	<	LongByLongToLong reducer) {
3986	<	return fjp.invoke(ForkJoinTasks.reduceValuesToLong
3987	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4690	>	public final boolean removeAll(Collection<?> c) {
4691	>	boolean modified = false;
4692	>	for (Iterator<?> it = iterator(); it.hasNext();) {
4693	>	if (c.contains(it.next())) {
4694	>	it.remove();
4695	>	modified = true;
4696	>	}
4697	>	}
4698	>	return modified;
4699		}
4700
4701	<	/**
4702	<	* Returns the result of accumulating the given transformation
4703	<	* of all values using the given reducer to combine values,
4704	<	* and the given basis as an identity value.
4705	<	*
4706	<	* @param transformer a function returning the transformation
4707	<	* for an element
4708	<	* @param basis the identity (initial default value) for the reduction
4709	<	* @param reducer a commutative associative combining function
3999	<	* @return the result of accumulating the given transformation
4000	<	* of all values
4001	<	*/
4002	<	public int reduceValuesToInt(ObjectToInt<? super V> transformer,
4003	<	int basis,
4004	<	IntByIntToInt reducer) {
4005	<	return fjp.invoke(ForkJoinTasks.reduceValuesToInt
4006	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4701	>	public final boolean retainAll(Collection<?> c) {
4702	>	boolean modified = false;
4703	>	for (Iterator<?> it = iterator(); it.hasNext();) {
4704	>	if (!c.contains(it.next())) {
4705	>	it.remove();
4706	>	modified = true;
4707	>	}
4708	>	}
4709	>	return modified;
4710		}
4711
4712	<	/**
4713	<	* Performs the given action for each entry.
4714	<	*
4715	<	* @param action the action
4716	<	*/
4717	<	public void forEachEntry(Action<Map.Entry<K,V>> action) {
4718	<	fjp.invoke(ForkJoinTasks.forEachEntry
4719	<	(ConcurrentHashMapV8.this, action));
4712	>	}
4713	>
4714	>	/**
4715	>	* A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in
4716	>	* which additions may optionally be enabled by mapping to a
4717	>	* common value.  This class cannot be directly instantiated. See
4718	>	* {@link #keySet()}, {@link #keySet(Object)}, {@link #newKeySet()},
4719	>	* {@link #newKeySet(int)}.
4720	>	*/
4721	>	public static class KeySetView<K,V> extends CHMView<K,V>
4722	>	implements Set<K>, java.io.Serializable {
4723	>	private static final long serialVersionUID = 7249069246763182397L;
4724	>	private final V value;
4725	>	KeySetView(ConcurrentHashMapV8<K,V> map, V value) {  // non-public
4726	>	super(map);
4727	>	this.value = value;
4728		}
4729
4730		/**
4731	<	* Performs the given action for each non-null transformation
4732	<	* of each entry.
4731	>	* Returns the default mapped value for additions,
4732	>	* or {@code null} if additions are not supported.
4733		*
4734	<	* @param transformer a function returning the transformation
4735	<	* for an element, or null of there is no transformation (in
4025	<	* which case the action is not applied).
4026	<	* @param action the action
4734	>	* @return the default mapped value for additions, or {@code null}
4735	>	* if not supported
4736		*/
4737	<	public <U> void forEachEntry(Fun<Map.Entry<K,V>, ? extends U> transformer,
4738	<	Action<U> action) {
4739	<	fjp.invoke(ForkJoinTasks.forEachEntry
4740	<	(ConcurrentHashMapV8.this, transformer, action));
4741	<	}
4737	>	public V getMappedValue() { return value; }
4738	>
4739	>	// implement Set API
4740	>
4741	>	public boolean contains(Object o) { return map.containsKey(o); }
4742	>	public boolean remove(Object o)   { return map.remove(o) != null; }
4743
4744		/**
4745	<	* Returns a non-null result from applying the given search
4746	<	* function on each entry, or null if none.  Further element
4747	<	* processing is suppressed upon success. However, this method
4748	<	* does not return until other in-progress parallel
4749	<	* invocations of the search function also complete.
4745	>	* Returns a "weakly consistent" iterator that will never
4746	>	* throw {@link ConcurrentModificationException}, and
4747	>	* guarantees to traverse elements as they existed upon
4748	>	* construction of the iterator, and may (but is not
4749	>	* guaranteed to) reflect any modifications subsequent to
4750	>	* construction.
4751		*
4752	<	* @param searchFunction a function returning a non-null
4042	<	* result on success, else null
4043	<	* @return a non-null result from applying the given search
4044	<	* function on each entry, or null if none
4752	>	* @return an iterator over the keys of this map
4753		*/
4754	<	public <U> U searchEntries(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4755	<	return fjp.invoke(ForkJoinTasks.searchEntries
4756	<	(ConcurrentHashMapV8.this, searchFunction));
4754	>	public Iterator<K> iterator()     { return new KeyIterator<K,V>(map); }
4755	>	public boolean add(K e) {
4756	>	V v;
4757	>	if ((v = value) == null)
4758	>	throw new UnsupportedOperationException();
4759	>	return map.internalPut(e, v, true) == null;
4760		}
4761	+	public boolean addAll(Collection<? extends K> c) {
4762	+	boolean added = false;
4763	+	V v;
4764	+	if ((v = value) == null)
4765	+	throw new UnsupportedOperationException();
4766	+	for (K e : c) {
4767	+	if (map.internalPut(e, v, true) == null)
4768	+	added = true;
4769	+	}
4770	+	return added;
4771	+	}
4772	+	public boolean equals(Object o) {
4773	+	Set<?> c;
4774	+	return ((o instanceof Set) &&
4775	+	((c = (Set<?>)o) == this ||
4776	+	(containsAll(c) && c.containsAll(this))));
4777	+	}
4778	+	}
4779
4780	<	/**
4781	<	* Returns the result of accumulating all entries using the
4782	<	* given reducer to combine values, or null if none.
4783	<	*
4784	<	* @param reducer a commutative associative combining function
4785	<	* @return the result of accumulating all entries
4786	<	*/
4787	<	public Map.Entry<K,V> reduceEntries(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4788	<	return fjp.invoke(ForkJoinTasks.reduceEntries
4789	<	(ConcurrentHashMapV8.this, reducer));
4780	>	/**
4781	>	* A view of a ConcurrentHashMapV8 as a {@link Collection} of
4782	>	* values, in which additions are disabled. This class cannot be
4783	>	* directly instantiated. See {@link #values()}.
4784	>	*
4785	>	* <p>The view's {@code iterator} is a "weakly consistent" iterator
4786	>	* that will never throw {@link ConcurrentModificationException},
4787	>	* and guarantees to traverse elements as they existed upon
4788	>	* construction of the iterator, and may (but is not guaranteed to)
4789	>	* reflect any modifications subsequent to construction.
4790	>	*/
4791	>	public static final class ValuesView<K,V> extends CHMView<K,V>
4792	>	implements Collection<V> {
4793	>	ValuesView(ConcurrentHashMapV8<K,V> map)   { super(map); }
4794	>	public final boolean contains(Object o) { return map.containsValue(o); }
4795	>	public final boolean remove(Object o) {
4796	>	if (o != null) {
4797	>	Iterator<V> it = new ValueIterator<K,V>(map);
4798	>	while (it.hasNext()) {
4799	>	if (o.equals(it.next())) {
4800	>	it.remove();
4801	>	return true;
4802	>	}
4803	>	}
4804	>	}
4805	>	return false;
4806		}
4807
4808		/**
4809	<	* Returns the result of accumulating the given transformation
4810	<	* of all entries using the given reducer to combine values,
4811	<	* or null if none.
4809	>	* Returns a "weakly consistent" iterator that will never
4810	>	* throw {@link ConcurrentModificationException}, and
4811	>	* guarantees to traverse elements as they existed upon
4812	>	* construction of the iterator, and may (but is not
4813	>	* guaranteed to) reflect any modifications subsequent to
4814	>	* construction.
4815		*
4816	<	* @param transformer a function returning the transformation
4069	<	* for an element, or null of there is no transformation (in
4070	<	* which case it is not combined).
4071	<	* @param reducer a commutative associative combining function
4072	<	* @return the result of accumulating the given transformation
4073	<	* of all entries
4816	>	* @return an iterator over the values of this map
4817		*/
4818	<	public <U> U reduceEntries(Fun<Map.Entry<K,V>, ? extends U> transformer,
4819	<	BiFun<? super U, ? super U, ? extends U> reducer) {
4820	<	return fjp.invoke(ForkJoinTasks.reduceEntries
4821	<	(ConcurrentHashMapV8.this, transformer, reducer));
4818	>	public final Iterator<V> iterator() {
4819	>	return new ValueIterator<K,V>(map);
4820	>	}
4821	>	public final boolean add(V e) {
4822	>	throw new UnsupportedOperationException();
4823	>	}
4824	>	public final boolean addAll(Collection<? extends V> c) {
4825	>	throw new UnsupportedOperationException();
4826		}
4827
4828	<	/**
4829	<	* Returns the result of accumulating the given transformation
4830	<	* of all entries using the given reducer to combine values,
4831	<	* and the given basis as an identity value.
4832	<	*
4833	<	* @param transformer a function returning the transformation
4834	<	* for an element
4835	<	* @param basis the identity (initial default value) for the reduction
4836	<	* @param reducer a commutative associative combining function
4837	<	* @return the result of accumulating the given transformation
4838	<	* of all entries
4839	<	*/
4840	<	public double reduceEntriesToDouble(ObjectToDouble<Map.Entry<K,V>> transformer,
4841	<	double basis,
4842	<	DoubleByDoubleToDouble reducer) {
4843	<	return fjp.invoke(ForkJoinTasks.reduceEntriesToDouble
4844	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4828	>	}
4829	>
4830	>	/**
4831	>	* A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value)
4832	>	* entries.  This class cannot be directly instantiated. See
4833	>	* {@link #entrySet()}.
4834	>	*/
4835	>	public static final class EntrySetView<K,V> extends CHMView<K,V>
4836	>	implements Set<Map.Entry<K,V>> {
4837	>	EntrySetView(ConcurrentHashMapV8<K,V> map) { super(map); }
4838	>	public final boolean contains(Object o) {
4839	>	Object k, v, r; Map.Entry<?,?> e;
4840	>	return ((o instanceof Map.Entry) &&
4841	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4842	>	(r = map.get(k)) != null &&
4843	>	(v = e.getValue()) != null &&
4844	>	(v == r || v.equals(r)));
4845	>	}
4846	>	public final boolean remove(Object o) {
4847	>	Object k, v; Map.Entry<?,?> e;
4848	>	return ((o instanceof Map.Entry) &&
4849	>	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4850	>	(v = e.getValue()) != null &&
4851	>	map.remove(k, v));
4852		}
4853
4854		/**
4855	<	* Returns the result of accumulating the given transformation
4856	<	* of all entries using the given reducer to combine values,
4857	<	* and the given basis as an identity value.
4855	>	* Returns a "weakly consistent" iterator that will never
4856	>	* throw {@link ConcurrentModificationException}, and
4857	>	* guarantees to traverse elements as they existed upon
4858	>	* construction of the iterator, and may (but is not
4859	>	* guaranteed to) reflect any modifications subsequent to
4860	>	* construction.
4861		*
4862	<	* @param transformer a function returning the transformation
4106	<	* for an element
4107	<	* @param basis the identity (initial default value) for the reduction
4108	<	* @param reducer a commutative associative combining function
4109	<	* @return  the result of accumulating the given transformation
4110	<	* of all entries
4862	>	* @return an iterator over the entries of this map
4863		*/
4864	<	public long reduceEntriesToLong(ObjectToLong<Map.Entry<K,V>> transformer,
4865	<	long basis,
4114	<	LongByLongToLong reducer) {
4115	<	return fjp.invoke(ForkJoinTasks.reduceEntriesToLong
4116	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4864	>	public final Iterator<Map.Entry<K,V>> iterator() {
4865	>	return new EntryIterator<K,V>(map);
4866		}
4867
4868	<	/**
4869	<	* Returns the result of accumulating the given transformation
4870	<	* of all entries using the given reducer to combine values,
4871	<	* and the given basis as an identity value.
4872	<	*
4873	<	* @param transformer a function returning the transformation
4874	<	* for an element
4875	<	* @param basis the identity (initial default value) for the reduction
4876	<	* @param reducer a commutative associative combining function
4877	<	* @return the result of accumulating the given transformation
4878	<	* of all entries
4879	<	*/
4880	<	public int reduceEntriesToInt(ObjectToInt<Map.Entry<K,V>> transformer,
4881	<	int basis,
4882	<	IntByIntToInt reducer) {
4883	<	return fjp.invoke(ForkJoinTasks.reduceEntriesToInt
4135	<	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4868	>	public final boolean add(Entry<K,V> e) {
4869	>	return map.internalPut(e.getKey(), e.getValue(), false) == null;
4870	>	}
4871	>	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
4872	>	boolean added = false;
4873	>	for (Entry<K,V> e : c) {
4874	>	if (add(e))
4875	>	added = true;
4876	>	}
4877	>	return added;
4878	>	}
4879	>	public boolean equals(Object o) {
4880	>	Set<?> c;
4881	>	return ((o instanceof Set) &&
4882	>	((c = (Set<?>)o) == this ||
4883	>	(containsAll(c) && c.containsAll(this))));
4884		}
4885		}
4886
#	Line 4140 | Line 4888 | public class ConcurrentHashMapV8<K, V>
4888
4889		/**
4890		* Predefined tasks for performing bulk parallel operations on
4891	<	* ConcurrentHashMaps. These tasks follow the forms and rules used
4892	<	* in class {@link Parallel}. Each method has the same name, but
4893	<	* returns a task rather than invoking it. These methods may be
4894	<	* useful in custom applications such as submitting a task without
4895	<	* waiting for completion, or combining with other tasks.
4891	>	* ConcurrentHashMapV8s. These tasks follow the forms and rules used
4892	>	* for bulk operations. Each method has the same name, but returns
4893	>	* a task rather than invoking it. These methods may be useful in
4894	>	* custom applications such as submitting a task without waiting
4895	>	* for completion, using a custom pool, or combining with other
4896	>	* tasks.
4897		*/
4898		public static class ForkJoinTasks {
4899		private ForkJoinTasks() {}
#	Line 4161 | Line 4910 | public class ConcurrentHashMapV8<K, V>
4910		(ConcurrentHashMapV8<K,V> map,
4911		BiAction<K,V> action) {
4912		if (action == null) throw new NullPointerException();
4913	<	return new ForEachMappingTask<K,V>(map, action);
4913	>	return new ForEachMappingTask<K,V>(map, null, -1, action);
4914		}
4915
4916		/**
#	Line 4170 | Line 4919 | public class ConcurrentHashMapV8<K, V>
4919		*
4920		* @param map the map
4921		* @param transformer a function returning the transformation
4922	<	* for an element, or null of there is no transformation (in
4923	<	* which case the action is not applied).
4922	>	* for an element, or null if there is no transformation (in
4923	>	* which case the action is not applied)
4924		* @param action the action
4925		* @return the task
4926		*/
#	Line 4182 | Line 4931 | public class ConcurrentHashMapV8<K, V>
4931		if (transformer == null || action == null)
4932		throw new NullPointerException();
4933		return new ForEachTransformedMappingTask<K,V,U>
4934	<	(map, transformer, action);
4934	>	(map, null, -1, transformer, action);
4935		}
4936
4937		/**
4938	<	* Returns a task that when invoked, returns a non-null
4939	<	* result from applying the given search function on each
4940	<	* (key, value), or null if none.  Further element processing
4941	<	* is suppressed upon success. However, this method does not
4942	<	* return until other in-progress parallel invocations of the
4194	<	* search function also complete.
4938	>	* Returns a task that when invoked, returns a non-null result
4939	>	* from applying the given search function on each (key,
4940	>	* value), or null if none. Upon success, further element
4941	>	* processing is suppressed and the results of any other
4942	>	* parallel invocations of the search function are ignored.
4943		*
4944		* @param map the map
4945		* @param searchFunction a function returning a non-null
#	Line 4203 | Line 4951 | public class ConcurrentHashMapV8<K, V>
4951		BiFun<? super K, ? super V, ? extends U> searchFunction) {
4952		if (searchFunction == null) throw new NullPointerException();
4953		return new SearchMappingsTask<K,V,U>
4954	<	(map, searchFunction,
4954	>	(map, null, -1, searchFunction,
4955		new AtomicReference<U>());
4956		}
4957
#	Line 4214 | Line 4962 | public class ConcurrentHashMapV8<K, V>
4962		*
4963		* @param map the map
4964		* @param transformer a function returning the transformation
4965	<	* for an element, or null of there is no transformation (in
4966	<	* which case it is not combined).
4965	>	* for an element, or null if there is no transformation (in
4966	>	* which case it is not combined)
4967		* @param reducer a commutative associative combining function
4968		* @return the task
4969		*/
#	Line 4226 | Line 4974 | public class ConcurrentHashMapV8<K, V>
4974		if (transformer == null || reducer == null)
4975		throw new NullPointerException();
4976		return new MapReduceMappingsTask<K,V,U>
4977	<	(map, transformer, reducer);
4977	>	(map, null, -1, null, transformer, reducer);
4978		}
4979
4980		/**
#	Line 4250 | Line 4998 | public class ConcurrentHashMapV8<K, V>
4998		if (transformer == null || reducer == null)
4999		throw new NullPointerException();
5000		return new MapReduceMappingsToDoubleTask<K,V>
5001	<	(map, transformer, basis, reducer);
5001	>	(map, null, -1, null, transformer, basis, reducer);
5002		}
5003
5004		/**
#	Line 4274 | Line 5022 | public class ConcurrentHashMapV8<K, V>
5022		if (transformer == null || reducer == null)
5023		throw new NullPointerException();
5024		return new MapReduceMappingsToLongTask<K,V>
5025	<	(map, transformer, basis, reducer);
5025	>	(map, null, -1, null, transformer, basis, reducer);
5026		}
5027
5028		/**
#	Line 4297 | Line 5045 | public class ConcurrentHashMapV8<K, V>
5045		if (transformer == null || reducer == null)
5046		throw new NullPointerException();
5047		return new MapReduceMappingsToIntTask<K,V>
5048	<	(map, transformer, basis, reducer);
5048	>	(map, null, -1, null, transformer, basis, reducer);
5049		}
5050
5051		/**
#	Line 4312 | Line 5060 | public class ConcurrentHashMapV8<K, V>
5060		(ConcurrentHashMapV8<K,V> map,
5061		Action<K> action) {
5062		if (action == null) throw new NullPointerException();
5063	<	return new ForEachKeyTask<K,V>(map, action);
5063	>	return new ForEachKeyTask<K,V>(map, null, -1, action);
5064		}
5065
5066		/**
#	Line 4321 | Line 5069 | public class ConcurrentHashMapV8<K, V>
5069		*
5070		* @param map the map
5071		* @param transformer a function returning the transformation
5072	<	* for an element, or null of there is no transformation (in
5073	<	* which case the action is not applied).
5072	>	* for an element, or null if there is no transformation (in
5073	>	* which case the action is not applied)
5074		* @param action the action
5075		* @return the task
5076		*/
#	Line 4333 | Line 5081 | public class ConcurrentHashMapV8<K, V>
5081		if (transformer == null || action == null)
5082		throw new NullPointerException();
5083		return new ForEachTransformedKeyTask<K,V,U>
5084	<	(map, transformer, action);
5084	>	(map, null, -1, transformer, action);
5085		}
5086
5087		/**
5088		* Returns a task that when invoked, returns a non-null result
5089		* from applying the given search function on each key, or
5090	<	* null if none.  Further element processing is suppressed
5091	<	* upon success. However, this method does not return until
5092	<	* other in-progress parallel invocations of the search
4345	<	* function also complete.
5090	>	* null if none.  Upon success, further element processing is
5091	>	* suppressed and the results of any other parallel
5092	>	* invocations of the search function are ignored.
5093		*
5094		* @param map the map
5095		* @param searchFunction a function returning a non-null
#	Line 4354 | Line 5101 | public class ConcurrentHashMapV8<K, V>
5101		Fun<? super K, ? extends U> searchFunction) {
5102		if (searchFunction == null) throw new NullPointerException();
5103		return new SearchKeysTask<K,V,U>
5104	<	(map, searchFunction,
5104	>	(map, null, -1, searchFunction,
5105		new AtomicReference<U>());
5106		}
5107
#	Line 4372 | Line 5119 | public class ConcurrentHashMapV8<K, V>
5119		BiFun<? super K, ? super K, ? extends K> reducer) {
5120		if (reducer == null) throw new NullPointerException();
5121		return new ReduceKeysTask<K,V>
5122	<	(map, reducer);
5122	>	(map, null, -1, null, reducer);
5123		}
5124	+
5125		/**
5126		* Returns a task that when invoked, returns the result of
5127		* accumulating the given transformation of all keys using the given
#	Line 4381 | Line 5129 | public class ConcurrentHashMapV8<K, V>
5129		*
5130		* @param map the map
5131		* @param transformer a function returning the transformation
5132	<	* for an element, or null of there is no transformation (in
5133	<	* which case it is not combined).
5132	>	* for an element, or null if there is no transformation (in
5133	>	* which case it is not combined)
5134		* @param reducer a commutative associative combining function
5135		* @return the task
5136		*/
#	Line 4393 | Line 5141 | public class ConcurrentHashMapV8<K, V>
5141		if (transformer == null || reducer == null)
5142		throw new NullPointerException();
5143		return new MapReduceKeysTask<K,V,U>
5144	<	(map, transformer, reducer);
5144	>	(map, null, -1, null, transformer, reducer);
5145		}
5146
5147		/**
#	Line 4417 | Line 5165 | public class ConcurrentHashMapV8<K, V>
5165		if (transformer == null || reducer == null)
5166		throw new NullPointerException();
5167		return new MapReduceKeysToDoubleTask<K,V>
5168	<	(map, transformer, basis, reducer);
5168	>	(map, null, -1, null, transformer, basis, reducer);
5169		}
5170
5171		/**
#	Line 4441 | Line 5189 | public class ConcurrentHashMapV8<K, V>
5189		if (transformer == null || reducer == null)
5190		throw new NullPointerException();
5191		return new MapReduceKeysToLongTask<K,V>
5192	<	(map, transformer, basis, reducer);
5192	>	(map, null, -1, null, transformer, basis, reducer);
5193		}
5194
5195		/**
#	Line 4465 | Line 5213 | public class ConcurrentHashMapV8<K, V>
5213		if (transformer == null || reducer == null)
5214		throw new NullPointerException();
5215		return new MapReduceKeysToIntTask<K,V>
5216	<	(map, transformer, basis, reducer);
5216	>	(map, null, -1, null, transformer, basis, reducer);
5217		}
5218
5219		/**
#	Line 4479 | Line 5227 | public class ConcurrentHashMapV8<K, V>
5227		(ConcurrentHashMapV8<K,V> map,
5228		Action<V> action) {
5229		if (action == null) throw new NullPointerException();
5230	<	return new ForEachValueTask<K,V>(map, action);
5230	>	return new ForEachValueTask<K,V>(map, null, -1, action);
5231		}
5232
5233		/**
#	Line 4488 | Line 5236 | public class ConcurrentHashMapV8<K, V>
5236		*
5237		* @param map the map
5238		* @param transformer a function returning the transformation
5239	<	* for an element, or null of there is no transformation (in
5240	<	* which case the action is not applied).
5239	>	* for an element, or null if there is no transformation (in
5240	>	* which case the action is not applied)
5241		* @param action the action
5242		*/
5243		public static <K,V,U> ForkJoinTask<Void> forEachValue
#	Line 4499 | Line 5247 | public class ConcurrentHashMapV8<K, V>
5247		if (transformer == null || action == null)
5248		throw new NullPointerException();
5249		return new ForEachTransformedValueTask<K,V,U>
5250	<	(map, transformer, action);
5250	>	(map, null, -1, transformer, action);
5251		}
5252
5253		/**
5254		* Returns a task that when invoked, returns a non-null result
5255		* from applying the given search function on each value, or
5256	<	* null if none.  Further element processing is suppressed
5257	<	* upon success. However, this method does not return until
5258	<	* other in-progress parallel invocations of the search
4511	<	* function also complete.
5256	>	* null if none.  Upon success, further element processing is
5257	>	* suppressed and the results of any other parallel
5258	>	* invocations of the search function are ignored.
5259		*
5260		* @param map the map
5261		* @param searchFunction a function returning a non-null
5262		* result on success, else null
5263		* @return the task
4517	–	*
5264		*/
5265		public static <K,V,U> ForkJoinTask<U> searchValues
5266		(ConcurrentHashMapV8<K,V> map,
5267		Fun<? super V, ? extends U> searchFunction) {
5268		if (searchFunction == null) throw new NullPointerException();
5269		return new SearchValuesTask<K,V,U>
5270	<	(map, searchFunction,
5270	>	(map, null, -1, searchFunction,
5271		new AtomicReference<U>());
5272		}
5273
#	Line 4539 | Line 5285 | public class ConcurrentHashMapV8<K, V>
5285		BiFun<? super V, ? super V, ? extends V> reducer) {
5286		if (reducer == null) throw new NullPointerException();
5287		return new ReduceValuesTask<K,V>
5288	<	(map, reducer);
5288	>	(map, null, -1, null, reducer);
5289		}
5290
5291		/**
#	Line 4549 | Line 5295 | public class ConcurrentHashMapV8<K, V>
5295		*
5296		* @param map the map
5297		* @param transformer a function returning the transformation
5298	<	* for an element, or null of there is no transformation (in
5299	<	* which case it is not combined).
5298	>	* for an element, or null if there is no transformation (in
5299	>	* which case it is not combined)
5300		* @param reducer a commutative associative combining function
5301		* @return the task
5302		*/
#	Line 4561 | Line 5307 | public class ConcurrentHashMapV8<K, V>
5307		if (transformer == null || reducer == null)
5308		throw new NullPointerException();
5309		return new MapReduceValuesTask<K,V,U>
5310	<	(map, transformer, reducer);
5310	>	(map, null, -1, null, transformer, reducer);
5311		}
5312
5313		/**
#	Line 4585 | Line 5331 | public class ConcurrentHashMapV8<K, V>
5331		if (transformer == null || reducer == null)
5332		throw new NullPointerException();
5333		return new MapReduceValuesToDoubleTask<K,V>
5334	<	(map, transformer, basis, reducer);
5334	>	(map, null, -1, null, transformer, basis, reducer);
5335		}
5336
5337		/**
#	Line 4609 | Line 5355 | public class ConcurrentHashMapV8<K, V>
5355		if (transformer == null || reducer == null)
5356		throw new NullPointerException();
5357		return new MapReduceValuesToLongTask<K,V>
5358	<	(map, transformer, basis, reducer);
5358	>	(map, null, -1, null, transformer, basis, reducer);
5359		}
5360
5361		/**
#	Line 4633 | Line 5379 | public class ConcurrentHashMapV8<K, V>
5379		if (transformer == null || reducer == null)
5380		throw new NullPointerException();
5381		return new MapReduceValuesToIntTask<K,V>
5382	<	(map, transformer, basis, reducer);
5382	>	(map, null, -1, null, transformer, basis, reducer);
5383		}
5384
5385		/**
#	Line 4647 | Line 5393 | public class ConcurrentHashMapV8<K, V>
5393		(ConcurrentHashMapV8<K,V> map,
5394		Action<Map.Entry<K,V>> action) {
5395		if (action == null) throw new NullPointerException();
5396	<	return new ForEachEntryTask<K,V>(map, action);
5396	>	return new ForEachEntryTask<K,V>(map, null, -1, action);
5397		}
5398
5399		/**
#	Line 4656 | Line 5402 | public class ConcurrentHashMapV8<K, V>
5402		*
5403		* @param map the map
5404		* @param transformer a function returning the transformation
5405	<	* for an element, or null of there is no transformation (in
5406	<	* which case the action is not applied).
5405	>	* for an element, or null if there is no transformation (in
5406	>	* which case the action is not applied)
5407		* @param action the action
5408		*/
5409		public static <K,V,U> ForkJoinTask<Void> forEachEntry
#	Line 4667 | Line 5413 | public class ConcurrentHashMapV8<K, V>
5413		if (transformer == null || action == null)
5414		throw new NullPointerException();
5415		return new ForEachTransformedEntryTask<K,V,U>
5416	<	(map, transformer, action);
5416	>	(map, null, -1, transformer, action);
5417		}
5418
5419		/**
5420		* Returns a task that when invoked, returns a non-null result
5421		* from applying the given search function on each entry, or
5422	<	* null if none.  Further element processing is suppressed
5423	<	* upon success. However, this method does not return until
5424	<	* other in-progress parallel invocations of the search
4679	<	* function also complete.
5422	>	* null if none.  Upon success, further element processing is
5423	>	* suppressed and the results of any other parallel
5424	>	* invocations of the search function are ignored.
5425		*
5426		* @param map the map
5427		* @param searchFunction a function returning a non-null
5428		* result on success, else null
5429		* @return the task
4685	–	*
5430		*/
5431		public static <K,V,U> ForkJoinTask<U> searchEntries
5432		(ConcurrentHashMapV8<K,V> map,
5433		Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
5434		if (searchFunction == null) throw new NullPointerException();
5435		return new SearchEntriesTask<K,V,U>
5436	<	(map, searchFunction,
5436	>	(map, null, -1, searchFunction,
5437		new AtomicReference<U>());
5438		}
5439
#	Line 4707 | Line 5451 | public class ConcurrentHashMapV8<K, V>
5451		BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5452		if (reducer == null) throw new NullPointerException();
5453		return new ReduceEntriesTask<K,V>
5454	<	(map, reducer);
5454	>	(map, null, -1, null, reducer);
5455		}
5456
5457		/**
#	Line 4717 | Line 5461 | public class ConcurrentHashMapV8<K, V>
5461		*
5462		* @param map the map
5463		* @param transformer a function returning the transformation
5464	<	* for an element, or null of there is no transformation (in
5465	<	* which case it is not combined).
5464	>	* for an element, or null if there is no transformation (in
5465	>	* which case it is not combined)
5466		* @param reducer a commutative associative combining function
5467		* @return the task
5468		*/
#	Line 4729 | Line 5473 | public class ConcurrentHashMapV8<K, V>
5473		if (transformer == null || reducer == null)
5474		throw new NullPointerException();
5475		return new MapReduceEntriesTask<K,V,U>
5476	<	(map, transformer, reducer);
5476	>	(map, null, -1, null, transformer, reducer);
5477		}
5478
5479		/**
#	Line 4753 | Line 5497 | public class ConcurrentHashMapV8<K, V>
5497		if (transformer == null || reducer == null)
5498		throw new NullPointerException();
5499		return new MapReduceEntriesToDoubleTask<K,V>
5500	<	(map, transformer, basis, reducer);
5500	>	(map, null, -1, null, transformer, basis, reducer);
5501		}
5502
5503		/**
#	Line 4777 | Line 5521 | public class ConcurrentHashMapV8<K, V>
5521		if (transformer == null || reducer == null)
5522		throw new NullPointerException();
5523		return new MapReduceEntriesToLongTask<K,V>
5524	<	(map, transformer, basis, reducer);
5524	>	(map, null, -1, null, transformer, basis, reducer);
5525		}
5526
5527		/**
#	Line 4801 | Line 5545 | public class ConcurrentHashMapV8<K, V>
5545		if (transformer == null || reducer == null)
5546		throw new NullPointerException();
5547		return new MapReduceEntriesToIntTask<K,V>
5548	<	(map, transformer, basis, reducer);
5548	>	(map, null, -1, null, transformer, basis, reducer);
5549		}
5550		}
5551
5552		// -------------------------------------------------------
5553
4810	–	/**
4811	–	* Base for FJ tasks for bulk operations. This adds a variant of
4812	–	* CountedCompleters and some split and merge bookkeeping to
4813	–	* iterator functionality. The forEach and reduce methods are
4814	–	* similar to those illustrated in CountedCompleter documentation,
4815	–	* except that bottom-up reduction completions perform them within
4816	–	* their compute methods. The search methods are like forEach
4817	–	* except they continually poll for success and exit early.  Also,
4818	–	* exceptions are handled in a simpler manner, by just trying to
4819	–	* complete root task exceptionally.
4820	–	*/
4821	–	static abstract class BulkTask<K,V,R> extends Traverser<K,V,R> {
4822	–	final BulkTask<K,V,?> parent;  // completion target
4823	–	int batch;                     // split control
4824	–	int pending;                   // completion control
4825	–
4826	–	/** Constructor for root tasks */
4827	–	BulkTask(ConcurrentHashMapV8<K,V> map) {
4828	–	super(map);
4829	–	this.parent = null;
4830	–	this.batch = -1; // force call to batch() on execution
4831	–	}
4832	–
4833	–	/** Constructor for subtasks */
4834	–	BulkTask(BulkTask<K,V,?> parent, int batch, boolean split) {
4835	–	super(parent, split);
4836	–	this.parent = parent;
4837	–	this.batch = batch;
4838	–	}
4839	–
4840	–	// FJ methods
4841	–
4842	–	/**
4843	–	* Propagates completion. Note that all reduce actions
4844	–	* bypass this method to combine while completing.
4845	–	*/
4846	–	final void tryComplete() {
4847	–	BulkTask<K,V,?> a = this, s = a;
4848	–	for (int c;;) {
4849	–	if ((c = a.pending) == 0) {
4850	–	if ((a = (s = a).parent) == null) {
4851	–	s.quietlyComplete();
4852	–	break;
4853	–	}
4854	–	}
4855	–	else if (U.compareAndSwapInt(a, PENDING, c, c - 1))
4856	–	break;
4857	–	}
4858	–	}
4859	–
4860	–	/**
4861	–	* Forces root task to throw exception unless already complete.
4862	–	*/
4863	–	final void tryAbortComputation(Throwable ex) {
4864	–	for (BulkTask<K,V,?> a = this;;) {
4865	–	BulkTask<K,V,?> p = a.parent;
4866	–	if (p == null) {
4867	–	a.completeExceptionally(ex);
4868	–	break;
4869	–	}
4870	–	a = p;
4871	–	}
4872	–	}
4873	–
4874	–	public final boolean exec() {
4875	–	try {
4876	–	compute();
4877	–	}
4878	–	catch (Throwable ex) {
4879	–	tryAbortComputation(ex);
4880	–	}
4881	–	return false;
4882	–	}
4883	–
4884	–	public abstract void compute();
4885	–
4886	–	// utilities
4887	–
4888	–	/** CompareAndSet pending count */
4889	–	final boolean casPending(int cmp, int val) {
4890	–	return U.compareAndSwapInt(this, PENDING, cmp, val);
4891	–	}
4892	–
4893	–	/**
4894	–	* Returns approx exp2 of the number of times (minus one) to
4895	–	* split task by two before executing leaf action. This value
4896	–	* is faster to compute and more convenient to use as a guide
4897	–	* to splitting than is the depth, since it is used while
4898	–	* dividing by two anyway.
4899	–	*/
4900	–	final int batch() {
4901	–	int b = batch;
4902	–	if (b < 0) {
4903	–	long n = map.counter.sum();
4904	–	int sp = getPool().getParallelism() << 3; // slack of 8
4905	–	b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
4906	–	}
4907	–	return b;
4908	–	}
4909	–
4910	–	/**
4911	–	* Error message for hoisted null checks of functions
4912	–	*/
4913	–	static final String NullFunctionMessage =
4914	–	"Unexpected null function";
4915	–
4916	–	/**
4917	–	* Returns exportable snapshot entry.
4918	–	*/
4919	–	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
4920	–	return new AbstractMap.SimpleEntry(k, v);
4921	–	}
4922	–
4923	–	// Unsafe mechanics
4924	–	private static final sun.misc.Unsafe U;
4925	–	private static final long PENDING;
4926	–	static {
4927	–	try {
4928	–	U = sun.misc.Unsafe.getUnsafe();
4929	–	PENDING = U.objectFieldOffset
4930	–	(BulkTask.class.getDeclaredField("pending"));
4931	–	} catch (Exception e) {
4932	–	throw new Error(e);
4933	–	}
4934	–	}
4935	–	}
4936	–
5554		/*
5555		* Task classes. Coded in a regular but ugly format/style to
5556		* simplify checks that each variant differs in the right way from
5557	<	* others.
5557	>	* others. The null screenings exist because compilers cannot tell
5558	>	* that we've already null-checked task arguments, so we force
5559	>	* simplest hoisted bypass to help avoid convoluted traps.
5560		*/
5561
5562	<	static final class ForEachKeyTask<K,V>
5563	<	extends BulkTask<K,V,Void> {
5562	>	@SuppressWarnings("serial") static final class ForEachKeyTask<K,V>
5563	>	extends Traverser<K,V,Void> {
5564		final Action<K> action;
5565		ForEachKeyTask
5566	<	(ConcurrentHashMapV8<K,V> m,
5566	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5567		Action<K> action) {
5568	<	super(m);
5568	>	super(m, p, b);
5569		this.action = action;
5570		}
5571	<	ForEachKeyTask
5572	<	(BulkTask<K,V,?> p, int b, boolean split,
5573	<	Action<K> action) {
5574	<	super(p, b, split);
5575	<	this.action = action;
5576	<	}
5577	<	public final void compute() {
5578	<	final Action<K> action = this.action;
5579	<	if (action == null)
4961	<	throw new Error(NullFunctionMessage);
4962	<	int b = batch(), c;
4963	<	while (b > 1 && baseIndex != baseLimit) {
4964	<	do {} while (!casPending(c = pending, c+1));
4965	<	new ForEachKeyTask<K,V>(this, b >>>= 1, true, action).fork();
4966	<	}
4967	<	while (advance() != null)
4968	<	action.apply((K)nextKey);
4969	<	tryComplete();
5571	>	@SuppressWarnings("unchecked") public final void compute() {
5572	>	final Action<K> action;
5573	>	if ((action = this.action) != null) {
5574	>	for (int b; (b = preSplit()) > 0;)
5575	>	new ForEachKeyTask<K,V>(map, this, b, action).fork();
5576	>	while (advance() != null)
5577	>	action.apply((K)nextKey);
5578	>	propagateCompletion();
5579	>	}
5580		}
5581		}
5582
5583	<	static final class ForEachValueTask<K,V>
5584	<	extends BulkTask<K,V,Void> {
5583	>	@SuppressWarnings("serial") static final class ForEachValueTask<K,V>
5584	>	extends Traverser<K,V,Void> {
5585		final Action<V> action;
5586		ForEachValueTask
5587	<	(ConcurrentHashMapV8<K,V> m,
4978	<	Action<V> action) {
4979	<	super(m);
4980	<	this.action = action;
4981	<	}
4982	<	ForEachValueTask
4983	<	(BulkTask<K,V,?> p, int b, boolean split,
5587	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5588		Action<V> action) {
5589	<	super(p, b, split);
5589	>	super(m, p, b);
5590		this.action = action;
5591		}
5592	<	public final void compute() {
5593	<	final Action<V> action = this.action;
5594	<	if (action == null)
5595	<	throw new Error(NullFunctionMessage);
5596	<	int b = batch(), c;
5597	<	while (b > 1 && baseIndex != baseLimit) {
5598	<	do {} while (!casPending(c = pending, c+1));
5599	<	new ForEachValueTask<K,V>(this, b >>>= 1, true, action).fork();
5600	<	}
5601	<	Object v;
4998	<	while ((v = advance()) != null)
4999	<	action.apply((V)v);
5000	<	tryComplete();
5592	>	@SuppressWarnings("unchecked") public final void compute() {
5593	>	final Action<V> action;
5594	>	if ((action = this.action) != null) {
5595	>	for (int b; (b = preSplit()) > 0;)
5596	>	new ForEachValueTask<K,V>(map, this, b, action).fork();
5597	>	V v;
5598	>	while ((v = advance()) != null)
5599	>	action.apply(v);
5600	>	propagateCompletion();
5601	>	}
5602		}
5603		}
5604
5605	<	static final class ForEachEntryTask<K,V>
5606	<	extends BulkTask<K,V,Void> {
5605	>	@SuppressWarnings("serial") static final class ForEachEntryTask<K,V>
5606	>	extends Traverser<K,V,Void> {
5607		final Action<Entry<K,V>> action;
5608		ForEachEntryTask
5609	<	(ConcurrentHashMapV8<K,V> m,
5009	<	Action<Entry<K,V>> action) {
5010	<	super(m);
5011	<	this.action = action;
5012	<	}
5013	<	ForEachEntryTask
5014	<	(BulkTask<K,V,?> p, int b, boolean split,
5609	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5610		Action<Entry<K,V>> action) {
5611	<	super(p, b, split);
5611	>	super(m, p, b);
5612		this.action = action;
5613		}
5614	<	public final void compute() {
5615	<	final Action<Entry<K,V>> action = this.action;
5616	<	if (action == null)
5617	<	throw new Error(NullFunctionMessage);
5618	<	int b = batch(), c;
5619	<	while (b > 1 && baseIndex != baseLimit) {
5620	<	do {} while (!casPending(c = pending, c+1));
5621	<	new ForEachEntryTask<K,V>(this, b >>>= 1, true, action).fork();
5622	<	}
5623	<	Object v;
5029	<	while ((v = advance()) != null)
5030	<	action.apply(entryFor((K)nextKey, (V)v));
5031	<	tryComplete();
5614	>	@SuppressWarnings("unchecked") public final void compute() {
5615	>	final Action<Entry<K,V>> action;
5616	>	if ((action = this.action) != null) {
5617	>	for (int b; (b = preSplit()) > 0;)
5618	>	new ForEachEntryTask<K,V>(map, this, b, action).fork();
5619	>	V v;
5620	>	while ((v = advance()) != null)
5621	>	action.apply(entryFor((K)nextKey, v));
5622	>	propagateCompletion();
5623	>	}
5624		}
5625		}
5626
5627	<	static final class ForEachMappingTask<K,V>
5628	<	extends BulkTask<K,V,Void> {
5627	>	@SuppressWarnings("serial") static final class ForEachMappingTask<K,V>
5628	>	extends Traverser<K,V,Void> {
5629		final BiAction<K,V> action;
5630		ForEachMappingTask
5631	<	(ConcurrentHashMapV8<K,V> m,
5631	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5632		BiAction<K,V> action) {
5633	<	super(m);
5633	>	super(m, p, b);
5634		this.action = action;
5635		}
5636	<	ForEachMappingTask
5637	<	(BulkTask<K,V,?> p, int b, boolean split,
5638	<	BiAction<K,V> action) {
5639	<	super(p, b, split);
5640	<	this.action = action;
5641	<	}
5642	<
5643	<	public final void compute() {
5644	<	final BiAction<K,V> action = this.action;
5645	<	if (action == null)
5054	<	throw new Error(NullFunctionMessage);
5055	<	int b = batch(), c;
5056	<	while (b > 1 && baseIndex != baseLimit) {
5057	<	do {} while (!casPending(c = pending, c+1));
5058	<	new ForEachMappingTask<K,V>(this, b >>>= 1, true,
5059	<	action).fork();
5060	<	}
5061	<	Object v;
5062	<	while ((v = advance()) != null)
5063	<	action.apply((K)nextKey, (V)v);
5064	<	tryComplete();
5636	>	@SuppressWarnings("unchecked") public final void compute() {
5637	>	final BiAction<K,V> action;
5638	>	if ((action = this.action) != null) {
5639	>	for (int b; (b = preSplit()) > 0;)
5640	>	new ForEachMappingTask<K,V>(map, this, b, action).fork();
5641	>	V v;
5642	>	while ((v = advance()) != null)
5643	>	action.apply((K)nextKey, v);
5644	>	propagateCompletion();
5645	>	}
5646		}
5647		}
5648
5649	<	static final class ForEachTransformedKeyTask<K,V,U>
5650	<	extends BulkTask<K,V,Void> {
5649	>	@SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U>
5650	>	extends Traverser<K,V,Void> {
5651		final Fun<? super K, ? extends U> transformer;
5652		final Action<U> action;
5653		ForEachTransformedKeyTask
5654	<	(ConcurrentHashMapV8<K,V> m,
5655	<	Fun<? super K, ? extends U> transformer,
5656	<	Action<U> action) {
5657	<	super(m);
5658	<	this.transformer = transformer;
5659	<	this.action = action;
5660	<
5661	<	}
5662	<	ForEachTransformedKeyTask
5663	<	(BulkTask<K,V,?> p, int b, boolean split,
5664	<	Fun<? super K, ? extends U> transformer,
5665	<	Action<U> action) {
5666	<	super(p, b, split);
5667	<	this.transformer = transformer;
5668	<	this.action = action;
5669	<	}
5670	<	public final void compute() {
5671	<	final Fun<? super K, ? extends U> transformer =
5672	<	this.transformer;
5092	<	final Action<U> action = this.action;
5093	<	if (transformer == null || action == null)
5094	<	throw new Error(NullFunctionMessage);
5095	<	int b = batch(), c;
5096	<	while (b > 1 && baseIndex != baseLimit) {
5097	<	do {} while (!casPending(c = pending, c+1));
5098	<	new ForEachTransformedKeyTask<K,V,U>
5099	<	(this, b >>>= 1, true, transformer, action).fork();
5100	<	}
5101	<	U u;
5102	<	while (advance() != null) {
5103	<	if ((u = transformer.apply((K)nextKey)) != null)
5104	<	action.apply(u);
5654	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5655	>	Fun<? super K, ? extends U> transformer, Action<U> action) {
5656	>	super(m, p, b);
5657	>	this.transformer = transformer; this.action = action;
5658	>	}
5659	>	@SuppressWarnings("unchecked") public final void compute() {
5660	>	final Fun<? super K, ? extends U> transformer;
5661	>	final Action<U> action;
5662	>	if ((transformer = this.transformer) != null &&
5663	>	(action = this.action) != null) {
5664	>	for (int b; (b = preSplit()) > 0;)
5665	>	new ForEachTransformedKeyTask<K,V,U>
5666	>	(map, this, b, transformer, action).fork();
5667	>	U u;
5668	>	while (advance() != null) {
5669	>	if ((u = transformer.apply((K)nextKey)) != null)
5670	>	action.apply(u);
5671	>	}
5672	>	propagateCompletion();
5673		}
5106	–	tryComplete();
5674		}
5675		}
5676
5677	<	static final class ForEachTransformedValueTask<K,V,U>
5678	<	extends BulkTask<K,V,Void> {
5677	>	@SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U>
5678	>	extends Traverser<K,V,Void> {
5679		final Fun<? super V, ? extends U> transformer;
5680		final Action<U> action;
5681		ForEachTransformedValueTask
5682	<	(ConcurrentHashMapV8<K,V> m,
5683	<	Fun<? super V, ? extends U> transformer,
5684	<	Action<U> action) {
5685	<	super(m);
5686	<	this.transformer = transformer;
5687	<	this.action = action;
5688	<
5689	<	}
5690	<	ForEachTransformedValueTask
5691	<	(BulkTask<K,V,?> p, int b, boolean split,
5692	<	Fun<? super V, ? extends U> transformer,
5693	<	Action<U> action) {
5694	<	super(p, b, split);
5695	<	this.transformer = transformer;
5696	<	this.action = action;
5697	<	}
5698	<	public final void compute() {
5699	<	final Fun<? super V, ? extends U> transformer =
5700	<	this.transformer;
5134	<	final Action<U> action = this.action;
5135	<	if (transformer == null || action == null)
5136	<	throw new Error(NullFunctionMessage);
5137	<	int b = batch(), c;
5138	<	while (b > 1 && baseIndex != baseLimit) {
5139	<	do {} while (!casPending(c = pending, c+1));
5140	<	new ForEachTransformedValueTask<K,V,U>
5141	<	(this, b >>>= 1, true, transformer, action).fork();
5142	<	}
5143	<	Object v; U u;
5144	<	while ((v = advance()) != null) {
5145	<	if ((u = transformer.apply((V)v)) != null)
5146	<	action.apply(u);
5682	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5683	>	Fun<? super V, ? extends U> transformer, Action<U> action) {
5684	>	super(m, p, b);
5685	>	this.transformer = transformer; this.action = action;
5686	>	}
5687	>	@SuppressWarnings("unchecked") public final void compute() {
5688	>	final Fun<? super V, ? extends U> transformer;
5689	>	final Action<U> action;
5690	>	if ((transformer = this.transformer) != null &&
5691	>	(action = this.action) != null) {
5692	>	for (int b; (b = preSplit()) > 0;)
5693	>	new ForEachTransformedValueTask<K,V,U>
5694	>	(map, this, b, transformer, action).fork();
5695	>	V v; U u;
5696	>	while ((v = advance()) != null) {
5697	>	if ((u = transformer.apply(v)) != null)
5698	>	action.apply(u);
5699	>	}
5700	>	propagateCompletion();
5701		}
5148	–	tryComplete();
5702		}
5703		}
5704
5705	<	static final class ForEachTransformedEntryTask<K,V,U>
5706	<	extends BulkTask<K,V,Void> {
5705	>	@SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U>
5706	>	extends Traverser<K,V,Void> {
5707		final Fun<Map.Entry<K,V>, ? extends U> transformer;
5708		final Action<U> action;
5709		ForEachTransformedEntryTask
5710	<	(ConcurrentHashMapV8<K,V> m,
5711	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5712	<	Action<U> action) {
5713	<	super(m);
5714	<	this.transformer = transformer;
5715	<	this.action = action;
5716	<
5717	<	}
5718	<	ForEachTransformedEntryTask
5719	<	(BulkTask<K,V,?> p, int b, boolean split,
5720	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5721	<	Action<U> action) {
5722	<	super(p, b, split);
5723	<	this.transformer = transformer;
5724	<	this.action = action;
5725	<	}
5726	<	public final void compute() {
5727	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5728	<	this.transformer;
5729	<	final Action<U> action = this.action;
5177	<	if (transformer == null || action == null)
5178	<	throw new Error(NullFunctionMessage);
5179	<	int b = batch(), c;
5180	<	while (b > 1 && baseIndex != baseLimit) {
5181	<	do {} while (!casPending(c = pending, c+1));
5182	<	new ForEachTransformedEntryTask<K,V,U>
5183	<	(this, b >>>= 1, true, transformer, action).fork();
5184	<	}
5185	<	Object v; U u;
5186	<	while ((v = advance()) != null) {
5187	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5188	<	action.apply(u);
5710	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5711	>	Fun<Map.Entry<K,V>, ? extends U> transformer, Action<U> action) {
5712	>	super(m, p, b);
5713	>	this.transformer = transformer; this.action = action;
5714	>	}
5715	>	@SuppressWarnings("unchecked") public final void compute() {
5716	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5717	>	final Action<U> action;
5718	>	if ((transformer = this.transformer) != null &&
5719	>	(action = this.action) != null) {
5720	>	for (int b; (b = preSplit()) > 0;)
5721	>	new ForEachTransformedEntryTask<K,V,U>
5722	>	(map, this, b, transformer, action).fork();
5723	>	V v; U u;
5724	>	while ((v = advance()) != null) {
5725	>	if ((u = transformer.apply(entryFor((K)nextKey,
5726	>	v))) != null)
5727	>	action.apply(u);
5728	>	}
5729	>	propagateCompletion();
5730		}
5190	–	tryComplete();
5731		}
5732		}
5733
5734	<	static final class ForEachTransformedMappingTask<K,V,U>
5735	<	extends BulkTask<K,V,Void> {
5734	>	@SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U>
5735	>	extends Traverser<K,V,Void> {
5736		final BiFun<? super K, ? super V, ? extends U> transformer;
5737		final Action<U> action;
5738		ForEachTransformedMappingTask
5739	<	(ConcurrentHashMapV8<K,V> m,
5200	<	BiFun<? super K, ? super V, ? extends U> transformer,
5201	<	Action<U> action) {
5202	<	super(m);
5203	<	this.transformer = transformer;
5204	<	this.action = action;
5205	<
5206	<	}
5207	<	ForEachTransformedMappingTask
5208	<	(BulkTask<K,V,?> p, int b, boolean split,
5739	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5740		BiFun<? super K, ? super V, ? extends U> transformer,
5741		Action<U> action) {
5742	<	super(p, b, split);
5743	<	this.transformer = transformer;
5213	<	this.action = action;
5742	>	super(m, p, b);
5743	>	this.transformer = transformer; this.action = action;
5744		}
5745	<	public final void compute() {
5746	<	final BiFun<? super K, ? super V, ? extends U> transformer =
5747	<	this.transformer;
5748	<	final Action<U> action = this.action;
5749	<	if (transformer == null || action == null)
5750	<	throw new Error(NullFunctionMessage);
5751	<	int b = batch(), c;
5752	<	while (b > 1 && baseIndex != baseLimit) {
5753	<	do {} while (!casPending(c = pending, c+1));
5754	<	new ForEachTransformedMappingTask<K,V,U>
5755	<	(this, b >>>= 1, true, transformer, action).fork();
5756	<	}
5757	<	Object v; U u;
5758	<	while ((v = advance()) != null) {
5229	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5230	<	action.apply(u);
5745	>	@SuppressWarnings("unchecked") public final void compute() {
5746	>	final BiFun<? super K, ? super V, ? extends U> transformer;
5747	>	final Action<U> action;
5748	>	if ((transformer = this.transformer) != null &&
5749	>	(action = this.action) != null) {
5750	>	for (int b; (b = preSplit()) > 0;)
5751	>	new ForEachTransformedMappingTask<K,V,U>
5752	>	(map, this, b, transformer, action).fork();
5753	>	V v; U u;
5754	>	while ((v = advance()) != null) {
5755	>	if ((u = transformer.apply((K)nextKey, v)) != null)
5756	>	action.apply(u);
5757	>	}
5758	>	propagateCompletion();
5759		}
5232	–	tryComplete();
5760		}
5761		}
5762
5763	<	static final class SearchKeysTask<K,V,U>
5764	<	extends BulkTask<K,V,U> {
5763	>	@SuppressWarnings("serial") static final class SearchKeysTask<K,V,U>
5764	>	extends Traverser<K,V,U> {
5765		final Fun<? super K, ? extends U> searchFunction;
5766		final AtomicReference<U> result;
5767		SearchKeysTask
5768	<	(ConcurrentHashMapV8<K,V> m,
5242	<	Fun<? super K, ? extends U> searchFunction,
5243	<	AtomicReference<U> result) {
5244	<	super(m);
5245	<	this.searchFunction = searchFunction; this.result = result;
5246	<	}
5247	<	SearchKeysTask
5248	<	(BulkTask<K,V,?> p, int b, boolean split,
5768	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5769		Fun<? super K, ? extends U> searchFunction,
5770		AtomicReference<U> result) {
5771	<	super(p, b, split);
5771	>	super(m, p, b);
5772		this.searchFunction = searchFunction; this.result = result;
5773		}
5774	<	public final void compute() {
5775	<	AtomicReference<U> result = this.result;
5776	<	final Fun<? super K, ? extends U> searchFunction =
5777	<	this.searchFunction;
5778	<	if (searchFunction == null || result == null)
5779	<	throw new Error(NullFunctionMessage);
5780	<	int b = batch(), c;
5781	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5782	<	do {} while (!casPending(c = pending, c+1));
5783	<	new SearchKeysTask<K,V,U>(this, b >>>= 1, true,
5784	<	searchFunction, result).fork();
5785	<	}
5786	<	U u;
5787	<	while (result.get() == null && advance() != null) {
5788	<	if ((u = searchFunction.apply((K)nextKey)) != null) {
5789	<	result.compareAndSet(null, u);
5790	<	break;
5774	>	public final U getRawResult() { return result.get(); }
5775	>	@SuppressWarnings("unchecked") public final void compute() {
5776	>	final Fun<? super K, ? extends U> searchFunction;
5777	>	final AtomicReference<U> result;
5778	>	if ((searchFunction = this.searchFunction) != null &&
5779	>	(result = this.result) != null) {
5780	>	for (int b;;) {
5781	>	if (result.get() != null)
5782	>	return;
5783	>	if ((b = preSplit()) <= 0)
5784	>	break;
5785	>	new SearchKeysTask<K,V,U>
5786	>	(map, this, b, searchFunction, result).fork();
5787	>	}
5788	>	while (result.get() == null) {
5789	>	U u;
5790	>	if (advance() == null) {
5791	>	propagateCompletion();
5792	>	break;
5793	>	}
5794	>	if ((u = searchFunction.apply((K)nextKey)) != null) {
5795	>	if (result.compareAndSet(null, u))
5796	>	quietlyCompleteRoot();
5797	>	break;
5798	>	}
5799		}
5800		}
5273	–	tryComplete();
5801		}
5275	–	public final U getRawResult() { return result.get(); }
5802		}
5803
5804	<	static final class SearchValuesTask<K,V,U>
5805	<	extends BulkTask<K,V,U> {
5804	>	@SuppressWarnings("serial") static final class SearchValuesTask<K,V,U>
5805	>	extends Traverser<K,V,U> {
5806		final Fun<? super V, ? extends U> searchFunction;
5807		final AtomicReference<U> result;
5808		SearchValuesTask
5809	<	(ConcurrentHashMapV8<K,V> m,
5284	<	Fun<? super V, ? extends U> searchFunction,
5285	<	AtomicReference<U> result) {
5286	<	super(m);
5287	<	this.searchFunction = searchFunction; this.result = result;
5288	<	}
5289	<	SearchValuesTask
5290	<	(BulkTask<K,V,?> p, int b, boolean split,
5809	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5810		Fun<? super V, ? extends U> searchFunction,
5811		AtomicReference<U> result) {
5812	<	super(p, b, split);
5812	>	super(m, p, b);
5813		this.searchFunction = searchFunction; this.result = result;
5814		}
5815	<	public final void compute() {
5816	<	AtomicReference<U> result = this.result;
5817	<	final Fun<? super V, ? extends U> searchFunction =
5818	<	this.searchFunction;
5819	<	if (searchFunction == null || result == null)
5820	<	throw new Error(NullFunctionMessage);
5821	<	int b = batch(), c;
5822	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5823	<	do {} while (!casPending(c = pending, c+1));
5824	<	new SearchValuesTask<K,V,U>(this, b >>>= 1, true,
5825	<	searchFunction, result).fork();
5826	<	}
5827	<	Object v; U u;
5828	<	while (result.get() == null && (v = advance()) != null) {
5829	<	if ((u = searchFunction.apply((V)v)) != null) {
5830	<	result.compareAndSet(null, u);
5831	<	break;
5815	>	public final U getRawResult() { return result.get(); }
5816	>	@SuppressWarnings("unchecked") public final void compute() {
5817	>	final Fun<? super V, ? extends U> searchFunction;
5818	>	final AtomicReference<U> result;
5819	>	if ((searchFunction = this.searchFunction) != null &&
5820	>	(result = this.result) != null) {
5821	>	for (int b;;) {
5822	>	if (result.get() != null)
5823	>	return;
5824	>	if ((b = preSplit()) <= 0)
5825	>	break;
5826	>	new SearchValuesTask<K,V,U>
5827	>	(map, this, b, searchFunction, result).fork();
5828	>	}
5829	>	while (result.get() == null) {
5830	>	V v; U u;
5831	>	if ((v = advance()) == null) {
5832	>	propagateCompletion();
5833	>	break;
5834	>	}
5835	>	if ((u = searchFunction.apply(v)) != null) {
5836	>	if (result.compareAndSet(null, u))
5837	>	quietlyCompleteRoot();
5838	>	break;
5839	>	}
5840		}
5841		}
5315	–	tryComplete();
5842		}
5317	–	public final U getRawResult() { return result.get(); }
5843		}
5844
5845	<	static final class SearchEntriesTask<K,V,U>
5846	<	extends BulkTask<K,V,U> {
5845	>	@SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U>
5846	>	extends Traverser<K,V,U> {
5847		final Fun<Entry<K,V>, ? extends U> searchFunction;
5848		final AtomicReference<U> result;
5849		SearchEntriesTask
5850	<	(ConcurrentHashMapV8<K,V> m,
5326	<	Fun<Entry<K,V>, ? extends U> searchFunction,
5327	<	AtomicReference<U> result) {
5328	<	super(m);
5329	<	this.searchFunction = searchFunction; this.result = result;
5330	<	}
5331	<	SearchEntriesTask
5332	<	(BulkTask<K,V,?> p, int b, boolean split,
5850	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5851		Fun<Entry<K,V>, ? extends U> searchFunction,
5852		AtomicReference<U> result) {
5853	<	super(p, b, split);
5853	>	super(m, p, b);
5854		this.searchFunction = searchFunction; this.result = result;
5855		}
5856	<	public final void compute() {
5857	<	AtomicReference<U> result = this.result;
5858	<	final Fun<Entry<K,V>, ? extends U> searchFunction =
5859	<	this.searchFunction;
5860	<	if (searchFunction == null || result == null)
5861	<	throw new Error(NullFunctionMessage);
5862	<	int b = batch(), c;
5863	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5864	<	do {} while (!casPending(c = pending, c+1));
5865	<	new SearchEntriesTask<K,V,U>(this, b >>>= 1, true,
5866	<	searchFunction, result).fork();
5867	<	}
5868	<	Object v; U u;
5869	<	while (result.get() == null && (v = advance()) != null) {
5870	<	if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) {
5871	<	result.compareAndSet(null, u);
5872	<	break;
5856	>	public final U getRawResult() { return result.get(); }
5857	>	@SuppressWarnings("unchecked") public final void compute() {
5858	>	final Fun<Entry<K,V>, ? extends U> searchFunction;
5859	>	final AtomicReference<U> result;
5860	>	if ((searchFunction = this.searchFunction) != null &&
5861	>	(result = this.result) != null) {
5862	>	for (int b;;) {
5863	>	if (result.get() != null)
5864	>	return;
5865	>	if ((b = preSplit()) <= 0)
5866	>	break;
5867	>	new SearchEntriesTask<K,V,U>
5868	>	(map, this, b, searchFunction, result).fork();
5869	>	}
5870	>	while (result.get() == null) {
5871	>	V v; U u;
5872	>	if ((v = advance()) == null) {
5873	>	propagateCompletion();
5874	>	break;
5875	>	}
5876	>	if ((u = searchFunction.apply(entryFor((K)nextKey,
5877	>	v))) != null) {
5878	>	if (result.compareAndSet(null, u))
5879	>	quietlyCompleteRoot();
5880	>	return;
5881	>	}
5882		}
5883		}
5357	–	tryComplete();
5884		}
5359	–	public final U getRawResult() { return result.get(); }
5885		}
5886
5887	<	static final class SearchMappingsTask<K,V,U>
5888	<	extends BulkTask<K,V,U> {
5887	>	@SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U>
5888	>	extends Traverser<K,V,U> {
5889		final BiFun<? super K, ? super V, ? extends U> searchFunction;
5890		final AtomicReference<U> result;
5891		SearchMappingsTask
5892	<	(ConcurrentHashMapV8<K,V> m,
5892	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5893		BiFun<? super K, ? super V, ? extends U> searchFunction,
5894		AtomicReference<U> result) {
5895	<	super(m);
5895	>	super(m, p, b);
5896		this.searchFunction = searchFunction; this.result = result;
5897		}
5898	<	SearchMappingsTask
5899	<	(BulkTask<K,V,?> p, int b, boolean split,
5900	<	BiFun<? super K, ? super V, ? extends U> searchFunction,
5901	<	AtomicReference<U> result) {
5902	<	super(p, b, split);
5903	<	this.searchFunction = searchFunction; this.result = result;
5904	<	}
5905	<	public final void compute() {
5906	<	AtomicReference<U> result = this.result;
5907	<	final BiFun<? super K, ? super V, ? extends U> searchFunction =
5908	<	this.searchFunction;
5909	<	if (searchFunction == null || result == null)
5910	<	throw new Error(NullFunctionMessage);
5911	<	int b = batch(), c;
5912	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5913	<	do {} while (!casPending(c = pending, c+1));
5914	<	new SearchMappingsTask<K,V,U>(this, b >>>= 1, true,
5915	<	searchFunction, result).fork();
5916	<	}
5917	<	Object v; U u;
5918	<	while (result.get() == null && (v = advance()) != null) {
5919	<	if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) {
5920	<	result.compareAndSet(null, u);
5921	<	break;
5898	>	public final U getRawResult() { return result.get(); }
5899	>	@SuppressWarnings("unchecked") public final void compute() {
5900	>	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5901	>	final AtomicReference<U> result;
5902	>	if ((searchFunction = this.searchFunction) != null &&
5903	>	(result = this.result) != null) {
5904	>	for (int b;;) {
5905	>	if (result.get() != null)
5906	>	return;
5907	>	if ((b = preSplit()) <= 0)
5908	>	break;
5909	>	new SearchMappingsTask<K,V,U>
5910	>	(map, this, b, searchFunction, result).fork();
5911	>	}
5912	>	while (result.get() == null) {
5913	>	V v; U u;
5914	>	if ((v = advance()) == null) {
5915	>	propagateCompletion();
5916	>	break;
5917	>	}
5918	>	if ((u = searchFunction.apply((K)nextKey, v)) != null) {
5919	>	if (result.compareAndSet(null, u))
5920	>	quietlyCompleteRoot();
5921	>	break;
5922	>	}
5923		}
5924		}
5399	–	tryComplete();
5925		}
5401	–	public final U getRawResult() { return result.get(); }
5926		}
5927
5928	<	static final class ReduceKeysTask<K,V>
5929	<	extends BulkTask<K,V,K> {
5928	>	@SuppressWarnings("serial") static final class ReduceKeysTask<K,V>
5929	>	extends Traverser<K,V,K> {
5930		final BiFun<? super K, ? super K, ? extends K> reducer;
5931		K result;
5932	<	ReduceKeysTask<K,V> sibling;
5932	>	ReduceKeysTask<K,V> rights, nextRight;
5933		ReduceKeysTask
5934	<	(ConcurrentHashMapV8<K,V> m,
5934	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5935	>	ReduceKeysTask<K,V> nextRight,
5936		BiFun<? super K, ? super K, ? extends K> reducer) {
5937	<	super(m);
5937	>	super(m, p, b); this.nextRight = nextRight;
5938		this.reducer = reducer;
5939		}
5940	<	ReduceKeysTask
5941	<	(BulkTask<K,V,?> p, int b, boolean split,
5942	<	BiFun<? super K, ? super K, ? extends K> reducer) {
5943	<	super(p, b, split);
5944	<	this.reducer = reducer;
5945	<	}
5946	<
5947	<	public final void compute() {
5948	<	ReduceKeysTask<K,V> t = this;
5949	<	final BiFun<? super K, ? super K, ? extends K> reducer =
5950	<	this.reducer;
5426	<	if (reducer == null)
5427	<	throw new Error(NullFunctionMessage);
5428	<	int b = batch();
5429	<	while (b > 1 && t.baseIndex != t.baseLimit) {
5430	<	b >>>= 1;
5431	<	t.pending = 1;
5432	<	ReduceKeysTask<K,V> rt =
5433	<	new ReduceKeysTask<K,V>
5434	<	(t, b, true, reducer);
5435	<	t = new ReduceKeysTask<K,V>
5436	<	(t, b, false, reducer);
5437	<	t.sibling = rt;
5438	<	rt.sibling = t;
5439	<	rt.fork();
5440	<	}
5441	<	K r = null;
5442	<	while (t.advance() != null) {
5443	<	K u = (K)t.nextKey;
5444	<	r = (r == null) ? u : reducer.apply(r, u);
5445	<	}
5446	<	t.result = r;
5447	<	for (;;) {
5448	<	int c; BulkTask<K,V,?> par; ReduceKeysTask<K,V> s, p; K u;
5449	<	if ((par = t.parent) == null ||
5450	<	!(par instanceof ReduceKeysTask)) {
5451	<	t.quietlyComplete();
5452	<	break;
5940	>	public final K getRawResult() { return result; }
5941	>	@SuppressWarnings("unchecked") public final void compute() {
5942	>	final BiFun<? super K, ? super K, ? extends K> reducer;
5943	>	if ((reducer = this.reducer) != null) {
5944	>	for (int b; (b = preSplit()) > 0;)
5945	>	(rights = new ReduceKeysTask<K,V>
5946	>	(map, this, b, rights, reducer)).fork();
5947	>	K r = null;
5948	>	while (advance() != null) {
5949	>	K u = (K)nextKey;
5950	>	r = (r == null) ? u : reducer.apply(r, u);
5951		}
5952	<	else if ((c = (p = (ReduceKeysTask<K,V>)par).pending) == 0) {
5953	<	if ((s = t.sibling) != null && (u = s.result) != null)
5954	<	r = (r == null) ? u : reducer.apply(r, u);
5955	<	(t = p).result = r;
5952	>	result = r;
5953	>	CountedCompleter<?> c;
5954	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5955	>	ReduceKeysTask<K,V>
5956	>	t = (ReduceKeysTask<K,V>)c,
5957	>	s = t.rights;
5958	>	while (s != null) {
5959	>	K tr, sr;
5960	>	if ((sr = s.result) != null)
5961	>	t.result = (((tr = t.result) == null) ? sr :
5962	>	reducer.apply(tr, sr));
5963	>	s = t.rights = s.nextRight;
5964	>	}
5965		}
5459	–	else if (p.casPending(c, 0))
5460	–	break;
5966		}
5967		}
5463	–	public final K getRawResult() { return result; }
5968		}
5969
5970	<	static final class ReduceValuesTask<K,V>
5971	<	extends BulkTask<K,V,V> {
5970	>	@SuppressWarnings("serial") static final class ReduceValuesTask<K,V>
5971	>	extends Traverser<K,V,V> {
5972		final BiFun<? super V, ? super V, ? extends V> reducer;
5973		V result;
5974	<	ReduceValuesTask<K,V> sibling;
5974	>	ReduceValuesTask<K,V> rights, nextRight;
5975		ReduceValuesTask
5976	<	(ConcurrentHashMapV8<K,V> m,
5976	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5977	>	ReduceValuesTask<K,V> nextRight,
5978		BiFun<? super V, ? super V, ? extends V> reducer) {
5979	<	super(m);
5979	>	super(m, p, b); this.nextRight = nextRight;
5980		this.reducer = reducer;
5981		}
5982	<	ReduceValuesTask
5983	<	(BulkTask<K,V,?> p, int b, boolean split,
5984	<	BiFun<? super V, ? super V, ? extends V> reducer) {
5985	<	super(p, b, split);
5986	<	this.reducer = reducer;
5987	<	}
5988	<
5989	<	public final void compute() {
5990	<	ReduceValuesTask<K,V> t = this;
5991	<	final BiFun<? super V, ? super V, ? extends V> reducer =
5992	<	this.reducer;
5993	<	if (reducer == null)
5489	<	throw new Error(NullFunctionMessage);
5490	<	int b = batch();
5491	<	while (b > 1 && t.baseIndex != t.baseLimit) {
5492	<	b >>>= 1;
5493	<	t.pending = 1;
5494	<	ReduceValuesTask<K,V> rt =
5495	<	new ReduceValuesTask<K,V>
5496	<	(t, b, true, reducer);
5497	<	t = new ReduceValuesTask<K,V>
5498	<	(t, b, false, reducer);
5499	<	t.sibling = rt;
5500	<	rt.sibling = t;
5501	<	rt.fork();
5502	<	}
5503	<	V r = null;
5504	<	Object v;
5505	<	while ((v = t.advance()) != null) {
5506	<	V u = (V)v;
5507	<	r = (r == null) ? u : reducer.apply(r, u);
5508	<	}
5509	<	t.result = r;
5510	<	for (;;) {
5511	<	int c; BulkTask<K,V,?> par; ReduceValuesTask<K,V> s, p; V u;
5512	<	if ((par = t.parent) == null ||
5513	<	!(par instanceof ReduceValuesTask)) {
5514	<	t.quietlyComplete();
5515	<	break;
5982	>	public final V getRawResult() { return result; }
5983	>	@SuppressWarnings("unchecked") public final void compute() {
5984	>	final BiFun<? super V, ? super V, ? extends V> reducer;
5985	>	if ((reducer = this.reducer) != null) {
5986	>	for (int b; (b = preSplit()) > 0;)
5987	>	(rights = new ReduceValuesTask<K,V>
5988	>	(map, this, b, rights, reducer)).fork();
5989	>	V r = null;
5990	>	V v;
5991	>	while ((v = advance()) != null) {
5992	>	V u = v;
5993	>	r = (r == null) ? u : reducer.apply(r, u);
5994		}
5995	<	else if ((c = (p = (ReduceValuesTask<K,V>)par).pending) == 0) {
5996	<	if ((s = t.sibling) != null && (u = s.result) != null)
5997	<	r = (r == null) ? u : reducer.apply(r, u);
5998	<	(t = p).result = r;
5995	>	result = r;
5996	>	CountedCompleter<?> c;
5997	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5998	>	ReduceValuesTask<K,V>
5999	>	t = (ReduceValuesTask<K,V>)c,
6000	>	s = t.rights;
6001	>	while (s != null) {
6002	>	V tr, sr;
6003	>	if ((sr = s.result) != null)
6004	>	t.result = (((tr = t.result) == null) ? sr :
6005	>	reducer.apply(tr, sr));
6006	>	s = t.rights = s.nextRight;
6007	>	}
6008		}
5522	–	else if (p.casPending(c, 0))
5523	–	break;
6009		}
6010		}
5526	–	public final V getRawResult() { return result; }
6011		}
6012
6013	<	static final class ReduceEntriesTask<K,V>
6014	<	extends BulkTask<K,V,Map.Entry<K,V>> {
6013	>	@SuppressWarnings("serial") static final class ReduceEntriesTask<K,V>
6014	>	extends Traverser<K,V,Map.Entry<K,V>> {
6015		final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
6016		Map.Entry<K,V> result;
6017	<	ReduceEntriesTask<K,V> sibling;
6017	>	ReduceEntriesTask<K,V> rights, nextRight;
6018		ReduceEntriesTask
6019	<	(ConcurrentHashMapV8<K,V> m,
6019	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6020	>	ReduceEntriesTask<K,V> nextRight,
6021		BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
6022	<	super(m);
5538	<	this.reducer = reducer;
5539	<	}
5540	<	ReduceEntriesTask
5541	<	(BulkTask<K,V,?> p, int b, boolean split,
5542	<	BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5543	<	super(p, b, split);
6022	>	super(m, p, b); this.nextRight = nextRight;
6023		this.reducer = reducer;
6024		}
6025	<
6026	<	public final void compute() {
6027	<	ReduceEntriesTask<K,V> t = this;
6028	<	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer =
6029	<	this.reducer;
6030	<	if (reducer == null)
6031	<	throw new Error(NullFunctionMessage);
6032	<	int b = batch();
6033	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6034	<	b >>>= 1;
6035	<	t.pending = 1;
6036	<	ReduceEntriesTask<K,V> rt =
5558	<	new ReduceEntriesTask<K,V>
5559	<	(t, b, true, reducer);
5560	<	t = new ReduceEntriesTask<K,V>
5561	<	(t, b, false, reducer);
5562	<	t.sibling = rt;
5563	<	rt.sibling = t;
5564	<	rt.fork();
5565	<	}
5566	<	Map.Entry<K,V> r = null;
5567	<	Object v;
5568	<	while ((v = t.advance()) != null) {
5569	<	Map.Entry<K,V> u = entryFor((K)t.nextKey, (V)v);
5570	<	r = (r == null) ? u : reducer.apply(r, u);
5571	<	}
5572	<	t.result = r;
5573	<	for (;;) {
5574	<	int c; BulkTask<K,V,?> par; ReduceEntriesTask<K,V> s, p;
5575	<	Map.Entry<K,V> u;
5576	<	if ((par = t.parent) == null ||
5577	<	!(par instanceof ReduceEntriesTask)) {
5578	<	t.quietlyComplete();
5579	<	break;
6025	>	public final Map.Entry<K,V> getRawResult() { return result; }
6026	>	@SuppressWarnings("unchecked") public final void compute() {
6027	>	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
6028	>	if ((reducer = this.reducer) != null) {
6029	>	for (int b; (b = preSplit()) > 0;)
6030	>	(rights = new ReduceEntriesTask<K,V>
6031	>	(map, this, b, rights, reducer)).fork();
6032	>	Map.Entry<K,V> r = null;
6033	>	V v;
6034	>	while ((v = advance()) != null) {
6035	>	Map.Entry<K,V> u = entryFor((K)nextKey, v);
6036	>	r = (r == null) ? u : reducer.apply(r, u);
6037		}
6038	<	else if ((c = (p = (ReduceEntriesTask<K,V>)par).pending) == 0) {
6039	<	if ((s = t.sibling) != null && (u = s.result) != null)
6040	<	r = (r == null) ? u : reducer.apply(r, u);
6041	<	(t = p).result = r;
6038	>	result = r;
6039	>	CountedCompleter<?> c;
6040	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6041	>	ReduceEntriesTask<K,V>
6042	>	t = (ReduceEntriesTask<K,V>)c,
6043	>	s = t.rights;
6044	>	while (s != null) {
6045	>	Map.Entry<K,V> tr, sr;
6046	>	if ((sr = s.result) != null)
6047	>	t.result = (((tr = t.result) == null) ? sr :
6048	>	reducer.apply(tr, sr));
6049	>	s = t.rights = s.nextRight;
6050	>	}
6051		}
5586	–	else if (p.casPending(c, 0))
5587	–	break;
6052		}
6053		}
5590	–	public final Map.Entry<K,V> getRawResult() { return result; }
6054		}
6055
6056	<	static final class MapReduceKeysTask<K,V,U>
6057	<	extends BulkTask<K,V,U> {
6056	>	@SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U>
6057	>	extends Traverser<K,V,U> {
6058		final Fun<? super K, ? extends U> transformer;
6059		final BiFun<? super U, ? super U, ? extends U> reducer;
6060		U result;
6061	<	MapReduceKeysTask<K,V,U> sibling;
6061	>	MapReduceKeysTask<K,V,U> rights, nextRight;
6062		MapReduceKeysTask
6063	<	(ConcurrentHashMapV8<K,V> m,
6063	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6064	>	MapReduceKeysTask<K,V,U> nextRight,
6065		Fun<? super K, ? extends U> transformer,
6066		BiFun<? super U, ? super U, ? extends U> reducer) {
6067	<	super(m);
6067	>	super(m, p, b); this.nextRight = nextRight;
6068		this.transformer = transformer;
6069		this.reducer = reducer;
6070		}
6071	<	MapReduceKeysTask
6072	<	(BulkTask<K,V,?> p, int b, boolean split,
6073	<	Fun<? super K, ? extends U> transformer,
6074	<	BiFun<? super U, ? super U, ? extends U> reducer) {
6075	<	super(p, b, split);
6076	<	this.transformer = transformer;
6077	<	this.reducer = reducer;
6078	<	}
6079	<	public final void compute() {
6080	<	MapReduceKeysTask<K,V,U> t = this;
6081	<	final Fun<? super K, ? extends U> transformer =
6082	<	this.transformer;
5619	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5620	<	this.reducer;
5621	<	if (transformer == null || reducer == null)
5622	<	throw new Error(NullFunctionMessage);
5623	<	int b = batch();
5624	<	while (b > 1 && t.baseIndex != t.baseLimit) {
5625	<	b >>>= 1;
5626	<	t.pending = 1;
5627	<	MapReduceKeysTask<K,V,U> rt =
5628	<	new MapReduceKeysTask<K,V,U>
5629	<	(t, b, true, transformer, reducer);
5630	<	t = new MapReduceKeysTask<K,V,U>
5631	<	(t, b, false, transformer, reducer);
5632	<	t.sibling = rt;
5633	<	rt.sibling = t;
5634	<	rt.fork();
5635	<	}
5636	<	U r = null, u;
5637	<	while (t.advance() != null) {
5638	<	if ((u = transformer.apply((K)t.nextKey)) != null)
5639	<	r = (r == null) ? u : reducer.apply(r, u);
5640	<	}
5641	<	t.result = r;
5642	<	for (;;) {
5643	<	int c; BulkTask<K,V,?> par; MapReduceKeysTask<K,V,U> s, p;
5644	<	if ((par = t.parent) == null ||
5645	<	!(par instanceof MapReduceKeysTask)) {
5646	<	t.quietlyComplete();
5647	<	break;
5648	<	}
5649	<	else if ((c = (p = (MapReduceKeysTask<K,V,U>)par).pending) == 0) {
5650	<	if ((s = t.sibling) != null && (u = s.result) != null)
6071	>	public final U getRawResult() { return result; }
6072	>	@SuppressWarnings("unchecked") public final void compute() {
6073	>	final Fun<? super K, ? extends U> transformer;
6074	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6075	>	if ((transformer = this.transformer) != null &&
6076	>	(reducer = this.reducer) != null) {
6077	>	for (int b; (b = preSplit()) > 0;)
6078	>	(rights = new MapReduceKeysTask<K,V,U>
6079	>	(map, this, b, rights, transformer, reducer)).fork();
6080	>	U r = null, u;
6081	>	while (advance() != null) {
6082	>	if ((u = transformer.apply((K)nextKey)) != null)
6083		r = (r == null) ? u : reducer.apply(r, u);
5652	–	(t = p).result = r;
6084		}
6085	<	else if (p.casPending(c, 0))
6086	<	break;
6085	>	result = r;
6086	>	CountedCompleter<?> c;
6087	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6088	>	MapReduceKeysTask<K,V,U>
6089	>	t = (MapReduceKeysTask<K,V,U>)c,
6090	>	s = t.rights;
6091	>	while (s != null) {
6092	>	U tr, sr;
6093	>	if ((sr = s.result) != null)
6094	>	t.result = (((tr = t.result) == null) ? sr :
6095	>	reducer.apply(tr, sr));
6096	>	s = t.rights = s.nextRight;
6097	>	}
6098	>	}
6099		}
6100		}
5658	–	public final U getRawResult() { return result; }
6101		}
6102
6103	<	static final class MapReduceValuesTask<K,V,U>
6104	<	extends BulkTask<K,V,U> {
6103	>	@SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U>
6104	>	extends Traverser<K,V,U> {
6105		final Fun<? super V, ? extends U> transformer;
6106		final BiFun<? super U, ? super U, ? extends U> reducer;
6107		U result;
6108	<	MapReduceValuesTask<K,V,U> sibling;
6108	>	MapReduceValuesTask<K,V,U> rights, nextRight;
6109		MapReduceValuesTask
6110	<	(ConcurrentHashMapV8<K,V> m,
6110	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6111	>	MapReduceValuesTask<K,V,U> nextRight,
6112		Fun<? super V, ? extends U> transformer,
6113		BiFun<? super U, ? super U, ? extends U> reducer) {
6114	<	super(m);
6114	>	super(m, p, b); this.nextRight = nextRight;
6115		this.transformer = transformer;
6116		this.reducer = reducer;
6117		}
6118	<	MapReduceValuesTask
6119	<	(BulkTask<K,V,?> p, int b, boolean split,
6120	<	Fun<? super V, ? extends U> transformer,
6121	<	BiFun<? super U, ? super U, ? extends U> reducer) {
6122	<	super(p, b, split);
6123	<	this.transformer = transformer;
6124	<	this.reducer = reducer;
6125	<	}
6126	<	public final void compute() {
6127	<	MapReduceValuesTask<K,V,U> t = this;
6128	<	final Fun<? super V, ? extends U> transformer =
6129	<	this.transformer;
6130	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5688	<	this.reducer;
5689	<	if (transformer == null || reducer == null)
5690	<	throw new Error(NullFunctionMessage);
5691	<	int b = batch();
5692	<	while (b > 1 && t.baseIndex != t.baseLimit) {
5693	<	b >>>= 1;
5694	<	t.pending = 1;
5695	<	MapReduceValuesTask<K,V,U> rt =
5696	<	new MapReduceValuesTask<K,V,U>
5697	<	(t, b, true, transformer, reducer);
5698	<	t = new MapReduceValuesTask<K,V,U>
5699	<	(t, b, false, transformer, reducer);
5700	<	t.sibling = rt;
5701	<	rt.sibling = t;
5702	<	rt.fork();
5703	<	}
5704	<	U r = null, u;
5705	<	Object v;
5706	<	while ((v = t.advance()) != null) {
5707	<	if ((u = transformer.apply((V)v)) != null)
5708	<	r = (r == null) ? u : reducer.apply(r, u);
5709	<	}
5710	<	t.result = r;
5711	<	for (;;) {
5712	<	int c; BulkTask<K,V,?> par; MapReduceValuesTask<K,V,U> s, p;
5713	<	if ((par = t.parent) == null ||
5714	<	!(par instanceof MapReduceValuesTask)) {
5715	<	t.quietlyComplete();
5716	<	break;
5717	<	}
5718	<	else if ((c = (p = (MapReduceValuesTask<K,V,U>)par).pending) == 0) {
5719	<	if ((s = t.sibling) != null && (u = s.result) != null)
6118	>	public final U getRawResult() { return result; }
6119	>	@SuppressWarnings("unchecked") public final void compute() {
6120	>	final Fun<? super V, ? extends U> transformer;
6121	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6122	>	if ((transformer = this.transformer) != null &&
6123	>	(reducer = this.reducer) != null) {
6124	>	for (int b; (b = preSplit()) > 0;)
6125	>	(rights = new MapReduceValuesTask<K,V,U>
6126	>	(map, this, b, rights, transformer, reducer)).fork();
6127	>	U r = null, u;
6128	>	V v;
6129	>	while ((v = advance()) != null) {
6130	>	if ((u = transformer.apply(v)) != null)
6131		r = (r == null) ? u : reducer.apply(r, u);
5721	–	(t = p).result = r;
6132		}
6133	<	else if (p.casPending(c, 0))
6134	<	break;
6133	>	result = r;
6134	>	CountedCompleter<?> c;
6135	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6136	>	MapReduceValuesTask<K,V,U>
6137	>	t = (MapReduceValuesTask<K,V,U>)c,
6138	>	s = t.rights;
6139	>	while (s != null) {
6140	>	U tr, sr;
6141	>	if ((sr = s.result) != null)
6142	>	t.result = (((tr = t.result) == null) ? sr :
6143	>	reducer.apply(tr, sr));
6144	>	s = t.rights = s.nextRight;
6145	>	}
6146	>	}
6147		}
6148		}
5727	–	public final U getRawResult() { return result; }
6149		}
6150
6151	<	static final class MapReduceEntriesTask<K,V,U>
6152	<	extends BulkTask<K,V,U> {
6151	>	@SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U>
6152	>	extends Traverser<K,V,U> {
6153		final Fun<Map.Entry<K,V>, ? extends U> transformer;
6154		final BiFun<? super U, ? super U, ? extends U> reducer;
6155		U result;
6156	<	MapReduceEntriesTask<K,V,U> sibling;
5736	<	MapReduceEntriesTask
5737	<	(ConcurrentHashMapV8<K,V> m,
5738	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5739	<	BiFun<? super U, ? super U, ? extends U> reducer) {
5740	<	super(m);
5741	<	this.transformer = transformer;
5742	<	this.reducer = reducer;
5743	<	}
6156	>	MapReduceEntriesTask<K,V,U> rights, nextRight;
6157		MapReduceEntriesTask
6158	<	(BulkTask<K,V,?> p, int b, boolean split,
6158	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6159	>	MapReduceEntriesTask<K,V,U> nextRight,
6160		Fun<Map.Entry<K,V>, ? extends U> transformer,
6161		BiFun<? super U, ? super U, ? extends U> reducer) {
6162	<	super(p, b, split);
6162	>	super(m, p, b); this.nextRight = nextRight;
6163		this.transformer = transformer;
6164		this.reducer = reducer;
6165		}
6166	<	public final void compute() {
6167	<	MapReduceEntriesTask<K,V,U> t = this;
6168	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
6169	<	this.transformer;
6170	<	final BiFun<? super U, ? super U, ? extends U> reducer =
6171	<	this.reducer;
6172	<	if (transformer == null || reducer == null)
6173	<	throw new Error(NullFunctionMessage);
6174	<	int b = batch();
6175	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6176	<	b >>>= 1;
6177	<	t.pending = 1;
6178	<	MapReduceEntriesTask<K,V,U> rt =
6179	<	new MapReduceEntriesTask<K,V,U>
5766	<	(t, b, true, transformer, reducer);
5767	<	t = new MapReduceEntriesTask<K,V,U>
5768	<	(t, b, false, transformer, reducer);
5769	<	t.sibling = rt;
5770	<	rt.sibling = t;
5771	<	rt.fork();
5772	<	}
5773	<	U r = null, u;
5774	<	Object v;
5775	<	while ((v = t.advance()) != null) {
5776	<	if ((u = transformer.apply(entryFor((K)t.nextKey, (V)v))) != null)
5777	<	r = (r == null) ? u : reducer.apply(r, u);
5778	<	}
5779	<	t.result = r;
5780	<	for (;;) {
5781	<	int c; BulkTask<K,V,?> par; MapReduceEntriesTask<K,V,U> s, p;
5782	<	if ((par = t.parent) == null ||
5783	<	!(par instanceof MapReduceEntriesTask)) {
5784	<	t.quietlyComplete();
5785	<	break;
5786	<	}
5787	<	else if ((c = (p = (MapReduceEntriesTask<K,V,U>)par).pending) == 0) {
5788	<	if ((s = t.sibling) != null && (u = s.result) != null)
6166	>	public final U getRawResult() { return result; }
6167	>	@SuppressWarnings("unchecked") public final void compute() {
6168	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
6169	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6170	>	if ((transformer = this.transformer) != null &&
6171	>	(reducer = this.reducer) != null) {
6172	>	for (int b; (b = preSplit()) > 0;)
6173	>	(rights = new MapReduceEntriesTask<K,V,U>
6174	>	(map, this, b, rights, transformer, reducer)).fork();
6175	>	U r = null, u;
6176	>	V v;
6177	>	while ((v = advance()) != null) {
6178	>	if ((u = transformer.apply(entryFor((K)nextKey,
6179	>	v))) != null)
6180		r = (r == null) ? u : reducer.apply(r, u);
5790	–	(t = p).result = r;
6181		}
6182	<	else if (p.casPending(c, 0))
6183	<	break;
6182	>	result = r;
6183	>	CountedCompleter<?> c;
6184	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6185	>	MapReduceEntriesTask<K,V,U>
6186	>	t = (MapReduceEntriesTask<K,V,U>)c,
6187	>	s = t.rights;
6188	>	while (s != null) {
6189	>	U tr, sr;
6190	>	if ((sr = s.result) != null)
6191	>	t.result = (((tr = t.result) == null) ? sr :
6192	>	reducer.apply(tr, sr));
6193	>	s = t.rights = s.nextRight;
6194	>	}
6195	>	}
6196		}
6197		}
5796	–	public final U getRawResult() { return result; }
6198		}
6199
6200	<	static final class MapReduceMappingsTask<K,V,U>
6201	<	extends BulkTask<K,V,U> {
6200	>	@SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U>
6201	>	extends Traverser<K,V,U> {
6202		final BiFun<? super K, ? super V, ? extends U> transformer;
6203		final BiFun<? super U, ? super U, ? extends U> reducer;
6204		U result;
6205	<	MapReduceMappingsTask<K,V,U> sibling;
6205	>	MapReduceMappingsTask<K,V,U> rights, nextRight;
6206		MapReduceMappingsTask
6207	<	(ConcurrentHashMapV8<K,V> m,
6207	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6208	>	MapReduceMappingsTask<K,V,U> nextRight,
6209		BiFun<? super K, ? super V, ? extends U> transformer,
6210		BiFun<? super U, ? super U, ? extends U> reducer) {
6211	<	super(m);
6211	>	super(m, p, b); this.nextRight = nextRight;
6212		this.transformer = transformer;
6213		this.reducer = reducer;
6214		}
6215	<	MapReduceMappingsTask
6216	<	(BulkTask<K,V,?> p, int b, boolean split,
6217	<	BiFun<? super K, ? super V, ? extends U> transformer,
6218	<	BiFun<? super U, ? super U, ? extends U> reducer) {
6219	<	super(p, b, split);
6220	<	this.transformer = transformer;
6221	<	this.reducer = reducer;
6222	<	}
6223	<	public final void compute() {
6224	<	MapReduceMappingsTask<K,V,U> t = this;
6225	<	final BiFun<? super K, ? super V, ? extends U> transformer =
6226	<	this.transformer;
6227	<	final BiFun<? super U, ? super U, ? extends U> reducer =
5826	<	this.reducer;
5827	<	if (transformer == null || reducer == null)
5828	<	throw new Error(NullFunctionMessage);
5829	<	int b = batch();
5830	<	while (b > 1 && t.baseIndex != t.baseLimit) {
5831	<	b >>>= 1;
5832	<	t.pending = 1;
5833	<	MapReduceMappingsTask<K,V,U> rt =
5834	<	new MapReduceMappingsTask<K,V,U>
5835	<	(t, b, true, transformer, reducer);
5836	<	t = new MapReduceMappingsTask<K,V,U>
5837	<	(t, b, false, transformer, reducer);
5838	<	t.sibling = rt;
5839	<	rt.sibling = t;
5840	<	rt.fork();
5841	<	}
5842	<	U r = null, u;
5843	<	Object v;
5844	<	while ((v = t.advance()) != null) {
5845	<	if ((u = transformer.apply((K)t.nextKey, (V)v)) != null)
5846	<	r = (r == null) ? u : reducer.apply(r, u);
5847	<	}
5848	<	for (;;) {
5849	<	int c; BulkTask<K,V,?> par; MapReduceMappingsTask<K,V,U> s, p;
5850	<	if ((par = t.parent) == null ||
5851	<	!(par instanceof MapReduceMappingsTask)) {
5852	<	t.quietlyComplete();
5853	<	break;
5854	<	}
5855	<	else if ((c = (p = (MapReduceMappingsTask<K,V,U>)par).pending) == 0) {
5856	<	if ((s = t.sibling) != null && (u = s.result) != null)
6215	>	public final U getRawResult() { return result; }
6216	>	@SuppressWarnings("unchecked") public final void compute() {
6217	>	final BiFun<? super K, ? super V, ? extends U> transformer;
6218	>	final BiFun<? super U, ? super U, ? extends U> reducer;
6219	>	if ((transformer = this.transformer) != null &&
6220	>	(reducer = this.reducer) != null) {
6221	>	for (int b; (b = preSplit()) > 0;)
6222	>	(rights = new MapReduceMappingsTask<K,V,U>
6223	>	(map, this, b, rights, transformer, reducer)).fork();
6224	>	U r = null, u;
6225	>	V v;
6226	>	while ((v = advance()) != null) {
6227	>	if ((u = transformer.apply((K)nextKey, v)) != null)
6228		r = (r == null) ? u : reducer.apply(r, u);
5858	–	(t = p).result = r;
6229		}
6230	<	else if (p.casPending(c, 0))
6231	<	break;
6230	>	result = r;
6231	>	CountedCompleter<?> c;
6232	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6233	>	MapReduceMappingsTask<K,V,U>
6234	>	t = (MapReduceMappingsTask<K,V,U>)c,
6235	>	s = t.rights;
6236	>	while (s != null) {
6237	>	U tr, sr;
6238	>	if ((sr = s.result) != null)
6239	>	t.result = (((tr = t.result) == null) ? sr :
6240	>	reducer.apply(tr, sr));
6241	>	s = t.rights = s.nextRight;
6242	>	}
6243	>	}
6244		}
6245		}
5864	–	public final U getRawResult() { return result; }
6246		}
6247
6248	<	static final class MapReduceKeysToDoubleTask<K,V>
6249	<	extends BulkTask<K,V,Double> {
6248	>	@SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V>
6249	>	extends Traverser<K,V,Double> {
6250		final ObjectToDouble<? super K> transformer;
6251		final DoubleByDoubleToDouble reducer;
6252		final double basis;
6253		double result;
6254	<	MapReduceKeysToDoubleTask<K,V> sibling;
5874	<	MapReduceKeysToDoubleTask
5875	<	(ConcurrentHashMapV8<K,V> m,
5876	<	ObjectToDouble<? super K> transformer,
5877	<	double basis,
5878	<	DoubleByDoubleToDouble reducer) {
5879	<	super(m);
5880	<	this.transformer = transformer;
5881	<	this.basis = basis; this.reducer = reducer;
5882	<	}
6254	>	MapReduceKeysToDoubleTask<K,V> rights, nextRight;
6255		MapReduceKeysToDoubleTask
6256	<	(BulkTask<K,V,?> p, int b, boolean split,
6256	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6257	>	MapReduceKeysToDoubleTask<K,V> nextRight,
6258		ObjectToDouble<? super K> transformer,
6259		double basis,
6260		DoubleByDoubleToDouble reducer) {
6261	<	super(p, b, split);
6261	>	super(m, p, b); this.nextRight = nextRight;
6262		this.transformer = transformer;
6263		this.basis = basis; this.reducer = reducer;
6264		}
6265	<	public final void compute() {
6266	<	MapReduceKeysToDoubleTask<K,V> t = this;
6267	<	final ObjectToDouble<? super K> transformer =
6268	<	this.transformer;
6269	<	final DoubleByDoubleToDouble reducer = this.reducer;
6270	<	if (transformer == null || reducer == null)
6271	<	throw new Error(NullFunctionMessage);
6272	<	final double id = this.basis;
6273	<	int b = batch();
6274	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6275	<	b >>>= 1;
6276	<	t.pending = 1;
6277	<	MapReduceKeysToDoubleTask<K,V> rt =
6278	<	new MapReduceKeysToDoubleTask<K,V>
6279	<	(t, b, true, transformer, id, reducer);
6280	<	t = new MapReduceKeysToDoubleTask<K,V>
6281	<	(t, b, false, transformer, id, reducer);
6282	<	t.sibling = rt;
6283	<	rt.sibling = t;
6284	<	rt.fork();
6285	<	}
6286	<	double r = id;
5914	<	while (t.advance() != null)
5915	<	r = reducer.apply(r, transformer.apply((K)t.nextKey));
5916	<	t.result = r;
5917	<	for (;;) {
5918	<	int c; BulkTask<K,V,?> par; MapReduceKeysToDoubleTask<K,V> s, p;
5919	<	if ((par = t.parent) == null ||
5920	<	!(par instanceof MapReduceKeysToDoubleTask)) {
5921	<	t.quietlyComplete();
5922	<	break;
5923	<	}
5924	<	else if ((c = (p = (MapReduceKeysToDoubleTask<K,V>)par).pending) == 0) {
5925	<	if ((s = t.sibling) != null)
5926	<	r = reducer.apply(r, s.result);
5927	<	(t = p).result = r;
6265	>	public final Double getRawResult() { return result; }
6266	>	@SuppressWarnings("unchecked") public final void compute() {
6267	>	final ObjectToDouble<? super K> transformer;
6268	>	final DoubleByDoubleToDouble reducer;
6269	>	if ((transformer = this.transformer) != null &&
6270	>	(reducer = this.reducer) != null) {
6271	>	double r = this.basis;
6272	>	for (int b; (b = preSplit()) > 0;)
6273	>	(rights = new MapReduceKeysToDoubleTask<K,V>
6274	>	(map, this, b, rights, transformer, r, reducer)).fork();
6275	>	while (advance() != null)
6276	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6277	>	result = r;
6278	>	CountedCompleter<?> c;
6279	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6280	>	MapReduceKeysToDoubleTask<K,V>
6281	>	t = (MapReduceKeysToDoubleTask<K,V>)c,
6282	>	s = t.rights;
6283	>	while (s != null) {
6284	>	t.result = reducer.apply(t.result, s.result);
6285	>	s = t.rights = s.nextRight;
6286	>	}
6287		}
5929	–	else if (p.casPending(c, 0))
5930	–	break;
6288		}
6289		}
5933	–	public final Double getRawResult() { return result; }
6290		}
6291
6292	<	static final class MapReduceValuesToDoubleTask<K,V>
6293	<	extends BulkTask<K,V,Double> {
6292	>	@SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V>
6293	>	extends Traverser<K,V,Double> {
6294		final ObjectToDouble<? super V> transformer;
6295		final DoubleByDoubleToDouble reducer;
6296		final double basis;
6297		double result;
6298	<	MapReduceValuesToDoubleTask<K,V> sibling;
6298	>	MapReduceValuesToDoubleTask<K,V> rights, nextRight;
6299		MapReduceValuesToDoubleTask
6300	<	(ConcurrentHashMapV8<K,V> m,
6300	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6301	>	MapReduceValuesToDoubleTask<K,V> nextRight,
6302		ObjectToDouble<? super V> transformer,
6303		double basis,
6304		DoubleByDoubleToDouble reducer) {
6305	<	super(m);
6305	>	super(m, p, b); this.nextRight = nextRight;
6306		this.transformer = transformer;
6307		this.basis = basis; this.reducer = reducer;
6308		}
6309	<	MapReduceValuesToDoubleTask
6310	<	(BulkTask<K,V,?> p, int b, boolean split,
6311	<	ObjectToDouble<? super V> transformer,
6312	<	double basis,
6313	<	DoubleByDoubleToDouble reducer) {
6314	<	super(p, b, split);
6315	<	this.transformer = transformer;
6316	<	this.basis = basis; this.reducer = reducer;
6317	<	}
6318	<	public final void compute() {
6319	<	MapReduceValuesToDoubleTask<K,V> t = this;
6320	<	final ObjectToDouble<? super V> transformer =
6321	<	this.transformer;
6322	<	final DoubleByDoubleToDouble reducer = this.reducer;
6323	<	if (transformer == null || reducer == null)
6324	<	throw new Error(NullFunctionMessage);
6325	<	final double id = this.basis;
6326	<	int b = batch();
6327	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6328	<	b >>>= 1;
6329	<	t.pending = 1;
6330	<	MapReduceValuesToDoubleTask<K,V> rt =
6331	<	new MapReduceValuesToDoubleTask<K,V>
5975	<	(t, b, true, transformer, id, reducer);
5976	<	t = new MapReduceValuesToDoubleTask<K,V>
5977	<	(t, b, false, transformer, id, reducer);
5978	<	t.sibling = rt;
5979	<	rt.sibling = t;
5980	<	rt.fork();
5981	<	}
5982	<	double r = id;
5983	<	Object v;
5984	<	while ((v = t.advance()) != null)
5985	<	r = reducer.apply(r, transformer.apply((V)v));
5986	<	t.result = r;
5987	<	for (;;) {
5988	<	int c; BulkTask<K,V,?> par; MapReduceValuesToDoubleTask<K,V> s, p;
5989	<	if ((par = t.parent) == null ||
5990	<	!(par instanceof MapReduceValuesToDoubleTask)) {
5991	<	t.quietlyComplete();
5992	<	break;
5993	<	}
5994	<	else if ((c = (p = (MapReduceValuesToDoubleTask<K,V>)par).pending) == 0) {
5995	<	if ((s = t.sibling) != null)
5996	<	r = reducer.apply(r, s.result);
5997	<	(t = p).result = r;
6309	>	public final Double getRawResult() { return result; }
6310	>	@SuppressWarnings("unchecked") public final void compute() {
6311	>	final ObjectToDouble<? super V> transformer;
6312	>	final DoubleByDoubleToDouble reducer;
6313	>	if ((transformer = this.transformer) != null &&
6314	>	(reducer = this.reducer) != null) {
6315	>	double r = this.basis;
6316	>	for (int b; (b = preSplit()) > 0;)
6317	>	(rights = new MapReduceValuesToDoubleTask<K,V>
6318	>	(map, this, b, rights, transformer, r, reducer)).fork();
6319	>	V v;
6320	>	while ((v = advance()) != null)
6321	>	r = reducer.apply(r, transformer.apply(v));
6322	>	result = r;
6323	>	CountedCompleter<?> c;
6324	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6325	>	MapReduceValuesToDoubleTask<K,V>
6326	>	t = (MapReduceValuesToDoubleTask<K,V>)c,
6327	>	s = t.rights;
6328	>	while (s != null) {
6329	>	t.result = reducer.apply(t.result, s.result);
6330	>	s = t.rights = s.nextRight;
6331	>	}
6332		}
5999	–	else if (p.casPending(c, 0))
6000	–	break;
6333		}
6334		}
6003	–	public final Double getRawResult() { return result; }
6335		}
6336
6337	<	static final class MapReduceEntriesToDoubleTask<K,V>
6338	<	extends BulkTask<K,V,Double> {
6337	>	@SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V>
6338	>	extends Traverser<K,V,Double> {
6339		final ObjectToDouble<Map.Entry<K,V>> transformer;
6340		final DoubleByDoubleToDouble reducer;
6341		final double basis;
6342		double result;
6343	<	MapReduceEntriesToDoubleTask<K,V> sibling;
6013	<	MapReduceEntriesToDoubleTask
6014	<	(ConcurrentHashMapV8<K,V> m,
6015	<	ObjectToDouble<Map.Entry<K,V>> transformer,
6016	<	double basis,
6017	<	DoubleByDoubleToDouble reducer) {
6018	<	super(m);
6019	<	this.transformer = transformer;
6020	<	this.basis = basis; this.reducer = reducer;
6021	<	}
6343	>	MapReduceEntriesToDoubleTask<K,V> rights, nextRight;
6344		MapReduceEntriesToDoubleTask
6345	<	(BulkTask<K,V,?> p, int b, boolean split,
6345	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6346	>	MapReduceEntriesToDoubleTask<K,V> nextRight,
6347		ObjectToDouble<Map.Entry<K,V>> transformer,
6348		double basis,
6349		DoubleByDoubleToDouble reducer) {
6350	<	super(p, b, split);
6350	>	super(m, p, b); this.nextRight = nextRight;
6351		this.transformer = transformer;
6352		this.basis = basis; this.reducer = reducer;
6353		}
6354	<	public final void compute() {
6355	<	MapReduceEntriesToDoubleTask<K,V> t = this;
6356	<	final ObjectToDouble<Map.Entry<K,V>> transformer =
6357	<	this.transformer;
6358	<	final DoubleByDoubleToDouble reducer = this.reducer;
6359	<	if (transformer == null || reducer == null)
6360	<	throw new Error(NullFunctionMessage);
6361	<	final double id = this.basis;
6362	<	int b = batch();
6363	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6364	<	b >>>= 1;
6365	<	t.pending = 1;
6366	<	MapReduceEntriesToDoubleTask<K,V> rt =
6367	<	new MapReduceEntriesToDoubleTask<K,V>
6368	<	(t, b, true, transformer, id, reducer);
6369	<	t = new MapReduceEntriesToDoubleTask<K,V>
6370	<	(t, b, false, transformer, id, reducer);
6371	<	t.sibling = rt;
6372	<	rt.sibling = t;
6373	<	rt.fork();
6374	<	}
6375	<	double r = id;
6376	<	Object v;
6377	<	while ((v = t.advance()) != null)
6055	<	r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v)));
6056	<	t.result = r;
6057	<	for (;;) {
6058	<	int c; BulkTask<K,V,?> par; MapReduceEntriesToDoubleTask<K,V> s, p;
6059	<	if ((par = t.parent) == null ||
6060	<	!(par instanceof MapReduceEntriesToDoubleTask)) {
6061	<	t.quietlyComplete();
6062	<	break;
6063	<	}
6064	<	else if ((c = (p = (MapReduceEntriesToDoubleTask<K,V>)par).pending) == 0) {
6065	<	if ((s = t.sibling) != null)
6066	<	r = reducer.apply(r, s.result);
6067	<	(t = p).result = r;
6354	>	public final Double getRawResult() { return result; }
6355	>	@SuppressWarnings("unchecked") public final void compute() {
6356	>	final ObjectToDouble<Map.Entry<K,V>> transformer;
6357	>	final DoubleByDoubleToDouble reducer;
6358	>	if ((transformer = this.transformer) != null &&
6359	>	(reducer = this.reducer) != null) {
6360	>	double r = this.basis;
6361	>	for (int b; (b = preSplit()) > 0;)
6362	>	(rights = new MapReduceEntriesToDoubleTask<K,V>
6363	>	(map, this, b, rights, transformer, r, reducer)).fork();
6364	>	V v;
6365	>	while ((v = advance()) != null)
6366	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
6367	>	v)));
6368	>	result = r;
6369	>	CountedCompleter<?> c;
6370	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6371	>	MapReduceEntriesToDoubleTask<K,V>
6372	>	t = (MapReduceEntriesToDoubleTask<K,V>)c,
6373	>	s = t.rights;
6374	>	while (s != null) {
6375	>	t.result = reducer.apply(t.result, s.result);
6376	>	s = t.rights = s.nextRight;
6377	>	}
6378		}
6069	–	else if (p.casPending(c, 0))
6070	–	break;
6379		}
6380		}
6073	–	public final Double getRawResult() { return result; }
6381		}
6382
6383	<	static final class MapReduceMappingsToDoubleTask<K,V>
6384	<	extends BulkTask<K,V,Double> {
6383	>	@SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V>
6384	>	extends Traverser<K,V,Double> {
6385		final ObjectByObjectToDouble<? super K, ? super V> transformer;
6386		final DoubleByDoubleToDouble reducer;
6387		final double basis;
6388		double result;
6389	<	MapReduceMappingsToDoubleTask<K,V> sibling;
6389	>	MapReduceMappingsToDoubleTask<K,V> rights, nextRight;
6390		MapReduceMappingsToDoubleTask
6391	<	(ConcurrentHashMapV8<K,V> m,
6391	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6392	>	MapReduceMappingsToDoubleTask<K,V> nextRight,
6393		ObjectByObjectToDouble<? super K, ? super V> transformer,
6394		double basis,
6395		DoubleByDoubleToDouble reducer) {
6396	<	super(m);
6396	>	super(m, p, b); this.nextRight = nextRight;
6397		this.transformer = transformer;
6398		this.basis = basis; this.reducer = reducer;
6399		}
6400	<	MapReduceMappingsToDoubleTask
6401	<	(BulkTask<K,V,?> p, int b, boolean split,
6402	<	ObjectByObjectToDouble<? super K, ? super V> transformer,
6403	<	double basis,
6404	<	DoubleByDoubleToDouble reducer) {
6405	<	super(p, b, split);
6406	<	this.transformer = transformer;
6407	<	this.basis = basis; this.reducer = reducer;
6408	<	}
6409	<	public final void compute() {
6410	<	MapReduceMappingsToDoubleTask<K,V> t = this;
6411	<	final ObjectByObjectToDouble<? super K, ? super V> transformer =
6412	<	this.transformer;
6413	<	final DoubleByDoubleToDouble reducer = this.reducer;
6414	<	if (transformer == null || reducer == null)
6415	<	throw new Error(NullFunctionMessage);
6416	<	final double id = this.basis;
6417	<	int b = batch();
6418	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6419	<	b >>>= 1;
6420	<	t.pending = 1;
6421	<	MapReduceMappingsToDoubleTask<K,V> rt =
6422	<	new MapReduceMappingsToDoubleTask<K,V>
6115	<	(t, b, true, transformer, id, reducer);
6116	<	t = new MapReduceMappingsToDoubleTask<K,V>
6117	<	(t, b, false, transformer, id, reducer);
6118	<	t.sibling = rt;
6119	<	rt.sibling = t;
6120	<	rt.fork();
6121	<	}
6122	<	double r = id;
6123	<	Object v;
6124	<	while ((v = t.advance()) != null)
6125	<	r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v));
6126	<	t.result = r;
6127	<	for (;;) {
6128	<	int c; BulkTask<K,V,?> par; MapReduceMappingsToDoubleTask<K,V> s, p;
6129	<	if ((par = t.parent) == null ||
6130	<	!(par instanceof MapReduceMappingsToDoubleTask)) {
6131	<	t.quietlyComplete();
6132	<	break;
6133	<	}
6134	<	else if ((c = (p = (MapReduceMappingsToDoubleTask<K,V>)par).pending) == 0) {
6135	<	if ((s = t.sibling) != null)
6136	<	r = reducer.apply(r, s.result);
6137	<	(t = p).result = r;
6400	>	public final Double getRawResult() { return result; }
6401	>	@SuppressWarnings("unchecked") public final void compute() {
6402	>	final ObjectByObjectToDouble<? super K, ? super V> transformer;
6403	>	final DoubleByDoubleToDouble reducer;
6404	>	if ((transformer = this.transformer) != null &&
6405	>	(reducer = this.reducer) != null) {
6406	>	double r = this.basis;
6407	>	for (int b; (b = preSplit()) > 0;)
6408	>	(rights = new MapReduceMappingsToDoubleTask<K,V>
6409	>	(map, this, b, rights, transformer, r, reducer)).fork();
6410	>	V v;
6411	>	while ((v = advance()) != null)
6412	>	r = reducer.apply(r, transformer.apply((K)nextKey, v));
6413	>	result = r;
6414	>	CountedCompleter<?> c;
6415	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6416	>	MapReduceMappingsToDoubleTask<K,V>
6417	>	t = (MapReduceMappingsToDoubleTask<K,V>)c,
6418	>	s = t.rights;
6419	>	while (s != null) {
6420	>	t.result = reducer.apply(t.result, s.result);
6421	>	s = t.rights = s.nextRight;
6422	>	}
6423		}
6139	–	else if (p.casPending(c, 0))
6140	–	break;
6424		}
6425		}
6143	–	public final Double getRawResult() { return result; }
6426		}
6427
6428	<	static final class MapReduceKeysToLongTask<K,V>
6429	<	extends BulkTask<K,V,Long> {
6428	>	@SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V>
6429	>	extends Traverser<K,V,Long> {
6430		final ObjectToLong<? super K> transformer;
6431		final LongByLongToLong reducer;
6432		final long basis;
6433		long result;
6434	<	MapReduceKeysToLongTask<K,V> sibling;
6434	>	MapReduceKeysToLongTask<K,V> rights, nextRight;
6435		MapReduceKeysToLongTask
6436	<	(ConcurrentHashMapV8<K,V> m,
6436	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6437	>	MapReduceKeysToLongTask<K,V> nextRight,
6438		ObjectToLong<? super K> transformer,
6439		long basis,
6440		LongByLongToLong reducer) {
6441	<	super(m);
6441	>	super(m, p, b); this.nextRight = nextRight;
6442		this.transformer = transformer;
6443		this.basis = basis; this.reducer = reducer;
6444		}
6445	<	MapReduceKeysToLongTask
6446	<	(BulkTask<K,V,?> p, int b, boolean split,
6447	<	ObjectToLong<? super K> transformer,
6448	<	long basis,
6449	<	LongByLongToLong reducer) {
6450	<	super(p, b, split);
6451	<	this.transformer = transformer;
6452	<	this.basis = basis; this.reducer = reducer;
6453	<	}
6454	<	public final void compute() {
6455	<	MapReduceKeysToLongTask<K,V> t = this;
6456	<	final ObjectToLong<? super K> transformer =
6457	<	this.transformer;
6458	<	final LongByLongToLong reducer = this.reducer;
6459	<	if (transformer == null || reducer == null)
6460	<	throw new Error(NullFunctionMessage);
6461	<	final long id = this.basis;
6462	<	int b = batch();
6463	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6464	<	b >>>= 1;
6465	<	t.pending = 1;
6466	<	MapReduceKeysToLongTask<K,V> rt =
6184	<	new MapReduceKeysToLongTask<K,V>
6185	<	(t, b, true, transformer, id, reducer);
6186	<	t = new MapReduceKeysToLongTask<K,V>
6187	<	(t, b, false, transformer, id, reducer);
6188	<	t.sibling = rt;
6189	<	rt.sibling = t;
6190	<	rt.fork();
6191	<	}
6192	<	long r = id;
6193	<	while (t.advance() != null)
6194	<	r = reducer.apply(r, transformer.apply((K)t.nextKey));
6195	<	t.result = r;
6196	<	for (;;) {
6197	<	int c; BulkTask<K,V,?> par; MapReduceKeysToLongTask<K,V> s, p;
6198	<	if ((par = t.parent) == null ||
6199	<	!(par instanceof MapReduceKeysToLongTask)) {
6200	<	t.quietlyComplete();
6201	<	break;
6202	<	}
6203	<	else if ((c = (p = (MapReduceKeysToLongTask<K,V>)par).pending) == 0) {
6204	<	if ((s = t.sibling) != null)
6205	<	r = reducer.apply(r, s.result);
6206	<	(t = p).result = r;
6445	>	public final Long getRawResult() { return result; }
6446	>	@SuppressWarnings("unchecked") public final void compute() {
6447	>	final ObjectToLong<? super K> transformer;
6448	>	final LongByLongToLong reducer;
6449	>	if ((transformer = this.transformer) != null &&
6450	>	(reducer = this.reducer) != null) {
6451	>	long r = this.basis;
6452	>	for (int b; (b = preSplit()) > 0;)
6453	>	(rights = new MapReduceKeysToLongTask<K,V>
6454	>	(map, this, b, rights, transformer, r, reducer)).fork();
6455	>	while (advance() != null)
6456	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6457	>	result = r;
6458	>	CountedCompleter<?> c;
6459	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6460	>	MapReduceKeysToLongTask<K,V>
6461	>	t = (MapReduceKeysToLongTask<K,V>)c,
6462	>	s = t.rights;
6463	>	while (s != null) {
6464	>	t.result = reducer.apply(t.result, s.result);
6465	>	s = t.rights = s.nextRight;
6466	>	}
6467		}
6208	–	else if (p.casPending(c, 0))
6209	–	break;
6468		}
6469		}
6212	–	public final Long getRawResult() { return result; }
6470		}
6471
6472	<	static final class MapReduceValuesToLongTask<K,V>
6473	<	extends BulkTask<K,V,Long> {
6472	>	@SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V>
6473	>	extends Traverser<K,V,Long> {
6474		final ObjectToLong<? super V> transformer;
6475		final LongByLongToLong reducer;
6476		final long basis;
6477		long result;
6478	<	MapReduceValuesToLongTask<K,V> sibling;
6222	<	MapReduceValuesToLongTask
6223	<	(ConcurrentHashMapV8<K,V> m,
6224	<	ObjectToLong<? super V> transformer,
6225	<	long basis,
6226	<	LongByLongToLong reducer) {
6227	<	super(m);
6228	<	this.transformer = transformer;
6229	<	this.basis = basis; this.reducer = reducer;
6230	<	}
6478	>	MapReduceValuesToLongTask<K,V> rights, nextRight;
6479		MapReduceValuesToLongTask
6480	<	(BulkTask<K,V,?> p, int b, boolean split,
6480	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6481	>	MapReduceValuesToLongTask<K,V> nextRight,
6482		ObjectToLong<? super V> transformer,
6483		long basis,
6484		LongByLongToLong reducer) {
6485	<	super(p, b, split);
6485	>	super(m, p, b); this.nextRight = nextRight;
6486		this.transformer = transformer;
6487		this.basis = basis; this.reducer = reducer;
6488		}
6489	<	public final void compute() {
6490	<	MapReduceValuesToLongTask<K,V> t = this;
6491	<	final ObjectToLong<? super V> transformer =
6492	<	this.transformer;
6493	<	final LongByLongToLong reducer = this.reducer;
6494	<	if (transformer == null || reducer == null)
6495	<	throw new Error(NullFunctionMessage);
6496	<	final long id = this.basis;
6497	<	int b = batch();
6498	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6499	<	b >>>= 1;
6500	<	t.pending = 1;
6501	<	MapReduceValuesToLongTask<K,V> rt =
6502	<	new MapReduceValuesToLongTask<K,V>
6503	<	(t, b, true, transformer, id, reducer);
6504	<	t = new MapReduceValuesToLongTask<K,V>
6505	<	(t, b, false, transformer, id, reducer);
6506	<	t.sibling = rt;
6507	<	rt.sibling = t;
6508	<	rt.fork();
6509	<	}
6510	<	long r = id;
6511	<	Object v;
6263	<	while ((v = t.advance()) != null)
6264	<	r = reducer.apply(r, transformer.apply((V)v));
6265	<	t.result = r;
6266	<	for (;;) {
6267	<	int c; BulkTask<K,V,?> par; MapReduceValuesToLongTask<K,V> s, p;
6268	<	if ((par = t.parent) == null ||
6269	<	!(par instanceof MapReduceValuesToLongTask)) {
6270	<	t.quietlyComplete();
6271	<	break;
6272	<	}
6273	<	else if ((c = (p = (MapReduceValuesToLongTask<K,V>)par).pending) == 0) {
6274	<	if ((s = t.sibling) != null)
6275	<	r = reducer.apply(r, s.result);
6276	<	(t = p).result = r;
6489	>	public final Long getRawResult() { return result; }
6490	>	@SuppressWarnings("unchecked") public final void compute() {
6491	>	final ObjectToLong<? super V> transformer;
6492	>	final LongByLongToLong reducer;
6493	>	if ((transformer = this.transformer) != null &&
6494	>	(reducer = this.reducer) != null) {
6495	>	long r = this.basis;
6496	>	for (int b; (b = preSplit()) > 0;)
6497	>	(rights = new MapReduceValuesToLongTask<K,V>
6498	>	(map, this, b, rights, transformer, r, reducer)).fork();
6499	>	V v;
6500	>	while ((v = advance()) != null)
6501	>	r = reducer.apply(r, transformer.apply(v));
6502	>	result = r;
6503	>	CountedCompleter<?> c;
6504	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6505	>	MapReduceValuesToLongTask<K,V>
6506	>	t = (MapReduceValuesToLongTask<K,V>)c,
6507	>	s = t.rights;
6508	>	while (s != null) {
6509	>	t.result = reducer.apply(t.result, s.result);
6510	>	s = t.rights = s.nextRight;
6511	>	}
6512		}
6278	–	else if (p.casPending(c, 0))
6279	–	break;
6513		}
6514		}
6282	–	public final Long getRawResult() { return result; }
6515		}
6516
6517	<	static final class MapReduceEntriesToLongTask<K,V>
6518	<	extends BulkTask<K,V,Long> {
6517	>	@SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V>
6518	>	extends Traverser<K,V,Long> {
6519		final ObjectToLong<Map.Entry<K,V>> transformer;
6520		final LongByLongToLong reducer;
6521		final long basis;
6522		long result;
6523	<	MapReduceEntriesToLongTask<K,V> sibling;
6292	<	MapReduceEntriesToLongTask
6293	<	(ConcurrentHashMapV8<K,V> m,
6294	<	ObjectToLong<Map.Entry<K,V>> transformer,
6295	<	long basis,
6296	<	LongByLongToLong reducer) {
6297	<	super(m);
6298	<	this.transformer = transformer;
6299	<	this.basis = basis; this.reducer = reducer;
6300	<	}
6523	>	MapReduceEntriesToLongTask<K,V> rights, nextRight;
6524		MapReduceEntriesToLongTask
6525	<	(BulkTask<K,V,?> p, int b, boolean split,
6525	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6526	>	MapReduceEntriesToLongTask<K,V> nextRight,
6527		ObjectToLong<Map.Entry<K,V>> transformer,
6528		long basis,
6529		LongByLongToLong reducer) {
6530	<	super(p, b, split);
6530	>	super(m, p, b); this.nextRight = nextRight;
6531		this.transformer = transformer;
6532		this.basis = basis; this.reducer = reducer;
6533		}
6534	<	public final void compute() {
6535	<	MapReduceEntriesToLongTask<K,V> t = this;
6536	<	final ObjectToLong<Map.Entry<K,V>> transformer =
6537	<	this.transformer;
6538	<	final LongByLongToLong reducer = this.reducer;
6539	<	if (transformer == null || reducer == null)
6540	<	throw new Error(NullFunctionMessage);
6541	<	final long id = this.basis;
6542	<	int b = batch();
6543	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6544	<	b >>>= 1;
6545	<	t.pending = 1;
6546	<	MapReduceEntriesToLongTask<K,V> rt =
6547	<	new MapReduceEntriesToLongTask<K,V>
6548	<	(t, b, true, transformer, id, reducer);
6549	<	t = new MapReduceEntriesToLongTask<K,V>
6550	<	(t, b, false, transformer, id, reducer);
6551	<	t.sibling = rt;
6552	<	rt.sibling = t;
6553	<	rt.fork();
6554	<	}
6555	<	long r = id;
6556	<	Object v;
6557	<	while ((v = t.advance()) != null)
6334	<	r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v)));
6335	<	t.result = r;
6336	<	for (;;) {
6337	<	int c; BulkTask<K,V,?> par; MapReduceEntriesToLongTask<K,V> s, p;
6338	<	if ((par = t.parent) == null ||
6339	<	!(par instanceof MapReduceEntriesToLongTask)) {
6340	<	t.quietlyComplete();
6341	<	break;
6342	<	}
6343	<	else if ((c = (p = (MapReduceEntriesToLongTask<K,V>)par).pending) == 0) {
6344	<	if ((s = t.sibling) != null)
6345	<	r = reducer.apply(r, s.result);
6346	<	(t = p).result = r;
6534	>	public final Long getRawResult() { return result; }
6535	>	@SuppressWarnings("unchecked") public final void compute() {
6536	>	final ObjectToLong<Map.Entry<K,V>> transformer;
6537	>	final LongByLongToLong reducer;
6538	>	if ((transformer = this.transformer) != null &&
6539	>	(reducer = this.reducer) != null) {
6540	>	long r = this.basis;
6541	>	for (int b; (b = preSplit()) > 0;)
6542	>	(rights = new MapReduceEntriesToLongTask<K,V>
6543	>	(map, this, b, rights, transformer, r, reducer)).fork();
6544	>	V v;
6545	>	while ((v = advance()) != null)
6546	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
6547	>	v)));
6548	>	result = r;
6549	>	CountedCompleter<?> c;
6550	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6551	>	MapReduceEntriesToLongTask<K,V>
6552	>	t = (MapReduceEntriesToLongTask<K,V>)c,
6553	>	s = t.rights;
6554	>	while (s != null) {
6555	>	t.result = reducer.apply(t.result, s.result);
6556	>	s = t.rights = s.nextRight;
6557	>	}
6558		}
6348	–	else if (p.casPending(c, 0))
6349	–	break;
6559		}
6560		}
6352	–	public final Long getRawResult() { return result; }
6561		}
6562
6563	<	static final class MapReduceMappingsToLongTask<K,V>
6564	<	extends BulkTask<K,V,Long> {
6563	>	@SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V>
6564	>	extends Traverser<K,V,Long> {
6565		final ObjectByObjectToLong<? super K, ? super V> transformer;
6566		final LongByLongToLong reducer;
6567		final long basis;
6568		long result;
6569	<	MapReduceMappingsToLongTask<K,V> sibling;
6362	<	MapReduceMappingsToLongTask
6363	<	(ConcurrentHashMapV8<K,V> m,
6364	<	ObjectByObjectToLong<? super K, ? super V> transformer,
6365	<	long basis,
6366	<	LongByLongToLong reducer) {
6367	<	super(m);
6368	<	this.transformer = transformer;
6369	<	this.basis = basis; this.reducer = reducer;
6370	<	}
6569	>	MapReduceMappingsToLongTask<K,V> rights, nextRight;
6570		MapReduceMappingsToLongTask
6571	<	(BulkTask<K,V,?> p, int b, boolean split,
6571	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6572	>	MapReduceMappingsToLongTask<K,V> nextRight,
6573		ObjectByObjectToLong<? super K, ? super V> transformer,
6574		long basis,
6575		LongByLongToLong reducer) {
6576	<	super(p, b, split);
6576	>	super(m, p, b); this.nextRight = nextRight;
6577		this.transformer = transformer;
6578		this.basis = basis; this.reducer = reducer;
6579		}
6580	<	public final void compute() {
6581	<	MapReduceMappingsToLongTask<K,V> t = this;
6582	<	final ObjectByObjectToLong<? super K, ? super V> transformer =
6583	<	this.transformer;
6584	<	final LongByLongToLong reducer = this.reducer;
6585	<	if (transformer == null || reducer == null)
6586	<	throw new Error(NullFunctionMessage);
6587	<	final long id = this.basis;
6588	<	int b = batch();
6589	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6590	<	b >>>= 1;
6591	<	t.pending = 1;
6592	<	MapReduceMappingsToLongTask<K,V> rt =
6593	<	new MapReduceMappingsToLongTask<K,V>
6594	<	(t, b, true, transformer, id, reducer);
6595	<	t = new MapReduceMappingsToLongTask<K,V>
6596	<	(t, b, false, transformer, id, reducer);
6597	<	t.sibling = rt;
6598	<	rt.sibling = t;
6599	<	rt.fork();
6600	<	}
6601	<	long r = id;
6602	<	Object v;
6403	<	while ((v = t.advance()) != null)
6404	<	r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v));
6405	<	t.result = r;
6406	<	for (;;) {
6407	<	int c; BulkTask<K,V,?> par; MapReduceMappingsToLongTask<K,V> s, p;
6408	<	if ((par = t.parent) == null ||
6409	<	!(par instanceof MapReduceMappingsToLongTask)) {
6410	<	t.quietlyComplete();
6411	<	break;
6412	<	}
6413	<	else if ((c = (p = (MapReduceMappingsToLongTask<K,V>)par).pending) == 0) {
6414	<	if ((s = t.sibling) != null)
6415	<	r = reducer.apply(r, s.result);
6416	<	(t = p).result = r;
6580	>	public final Long getRawResult() { return result; }
6581	>	@SuppressWarnings("unchecked") public final void compute() {
6582	>	final ObjectByObjectToLong<? super K, ? super V> transformer;
6583	>	final LongByLongToLong reducer;
6584	>	if ((transformer = this.transformer) != null &&
6585	>	(reducer = this.reducer) != null) {
6586	>	long r = this.basis;
6587	>	for (int b; (b = preSplit()) > 0;)
6588	>	(rights = new MapReduceMappingsToLongTask<K,V>
6589	>	(map, this, b, rights, transformer, r, reducer)).fork();
6590	>	V v;
6591	>	while ((v = advance()) != null)
6592	>	r = reducer.apply(r, transformer.apply((K)nextKey, v));
6593	>	result = r;
6594	>	CountedCompleter<?> c;
6595	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6596	>	MapReduceMappingsToLongTask<K,V>
6597	>	t = (MapReduceMappingsToLongTask<K,V>)c,
6598	>	s = t.rights;
6599	>	while (s != null) {
6600	>	t.result = reducer.apply(t.result, s.result);
6601	>	s = t.rights = s.nextRight;
6602	>	}
6603		}
6418	–	else if (p.casPending(c, 0))
6419	–	break;
6604		}
6605		}
6422	–	public final Long getRawResult() { return result; }
6606		}
6607
6608	<	static final class MapReduceKeysToIntTask<K,V>
6609	<	extends BulkTask<K,V,Integer> {
6608	>	@SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V>
6609	>	extends Traverser<K,V,Integer> {
6610		final ObjectToInt<? super K> transformer;
6611		final IntByIntToInt reducer;
6612		final int basis;
6613		int result;
6614	<	MapReduceKeysToIntTask<K,V> sibling;
6432	<	MapReduceKeysToIntTask
6433	<	(ConcurrentHashMapV8<K,V> m,
6434	<	ObjectToInt<? super K> transformer,
6435	<	int basis,
6436	<	IntByIntToInt reducer) {
6437	<	super(m);
6438	<	this.transformer = transformer;
6439	<	this.basis = basis; this.reducer = reducer;
6440	<	}
6614	>	MapReduceKeysToIntTask<K,V> rights, nextRight;
6615		MapReduceKeysToIntTask
6616	<	(BulkTask<K,V,?> p, int b, boolean split,
6616	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6617	>	MapReduceKeysToIntTask<K,V> nextRight,
6618		ObjectToInt<? super K> transformer,
6619		int basis,
6620		IntByIntToInt reducer) {
6621	<	super(p, b, split);
6621	>	super(m, p, b); this.nextRight = nextRight;
6622		this.transformer = transformer;
6623		this.basis = basis; this.reducer = reducer;
6624		}
6625	<	public final void compute() {
6626	<	MapReduceKeysToIntTask<K,V> t = this;
6627	<	final ObjectToInt<? super K> transformer =
6628	<	this.transformer;
6629	<	final IntByIntToInt reducer = this.reducer;
6630	<	if (transformer == null || reducer == null)
6631	<	throw new Error(NullFunctionMessage);
6632	<	final int id = this.basis;
6633	<	int b = batch();
6634	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6635	<	b >>>= 1;
6636	<	t.pending = 1;
6637	<	MapReduceKeysToIntTask<K,V> rt =
6638	<	new MapReduceKeysToIntTask<K,V>
6639	<	(t, b, true, transformer, id, reducer);
6640	<	t = new MapReduceKeysToIntTask<K,V>
6641	<	(t, b, false, transformer, id, reducer);
6642	<	t.sibling = rt;
6643	<	rt.sibling = t;
6644	<	rt.fork();
6645	<	}
6646	<	int r = id;
6472	<	while (t.advance() != null)
6473	<	r = reducer.apply(r, transformer.apply((K)t.nextKey));
6474	<	t.result = r;
6475	<	for (;;) {
6476	<	int c; BulkTask<K,V,?> par; MapReduceKeysToIntTask<K,V> s, p;
6477	<	if ((par = t.parent) == null ||
6478	<	!(par instanceof MapReduceKeysToIntTask)) {
6479	<	t.quietlyComplete();
6480	<	break;
6481	<	}
6482	<	else if ((c = (p = (MapReduceKeysToIntTask<K,V>)par).pending) == 0) {
6483	<	if ((s = t.sibling) != null)
6484	<	r = reducer.apply(r, s.result);
6485	<	(t = p).result = r;
6625	>	public final Integer getRawResult() { return result; }
6626	>	@SuppressWarnings("unchecked") public final void compute() {
6627	>	final ObjectToInt<? super K> transformer;
6628	>	final IntByIntToInt reducer;
6629	>	if ((transformer = this.transformer) != null &&
6630	>	(reducer = this.reducer) != null) {
6631	>	int r = this.basis;
6632	>	for (int b; (b = preSplit()) > 0;)
6633	>	(rights = new MapReduceKeysToIntTask<K,V>
6634	>	(map, this, b, rights, transformer, r, reducer)).fork();
6635	>	while (advance() != null)
6636	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6637	>	result = r;
6638	>	CountedCompleter<?> c;
6639	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6640	>	MapReduceKeysToIntTask<K,V>
6641	>	t = (MapReduceKeysToIntTask<K,V>)c,
6642	>	s = t.rights;
6643	>	while (s != null) {
6644	>	t.result = reducer.apply(t.result, s.result);
6645	>	s = t.rights = s.nextRight;
6646	>	}
6647		}
6487	–	else if (p.casPending(c, 0))
6488	–	break;
6648		}
6649		}
6491	–	public final Integer getRawResult() { return result; }
6650		}
6651
6652	<	static final class MapReduceValuesToIntTask<K,V>
6653	<	extends BulkTask<K,V,Integer> {
6652	>	@SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V>
6653	>	extends Traverser<K,V,Integer> {
6654		final ObjectToInt<? super V> transformer;
6655		final IntByIntToInt reducer;
6656		final int basis;
6657		int result;
6658	<	MapReduceValuesToIntTask<K,V> sibling;
6501	<	MapReduceValuesToIntTask
6502	<	(ConcurrentHashMapV8<K,V> m,
6503	<	ObjectToInt<? super V> transformer,
6504	<	int basis,
6505	<	IntByIntToInt reducer) {
6506	<	super(m);
6507	<	this.transformer = transformer;
6508	<	this.basis = basis; this.reducer = reducer;
6509	<	}
6658	>	MapReduceValuesToIntTask<K,V> rights, nextRight;
6659		MapReduceValuesToIntTask
6660	<	(BulkTask<K,V,?> p, int b, boolean split,
6660	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6661	>	MapReduceValuesToIntTask<K,V> nextRight,
6662		ObjectToInt<? super V> transformer,
6663		int basis,
6664		IntByIntToInt reducer) {
6665	<	super(p, b, split);
6665	>	super(m, p, b); this.nextRight = nextRight;
6666		this.transformer = transformer;
6667		this.basis = basis; this.reducer = reducer;
6668		}
6669	<	public final void compute() {
6670	<	MapReduceValuesToIntTask<K,V> t = this;
6671	<	final ObjectToInt<? super V> transformer =
6672	<	this.transformer;
6673	<	final IntByIntToInt reducer = this.reducer;
6674	<	if (transformer == null || reducer == null)
6675	<	throw new Error(NullFunctionMessage);
6676	<	final int id = this.basis;
6677	<	int b = batch();
6678	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6679	<	b >>>= 1;
6680	<	t.pending = 1;
6681	<	MapReduceValuesToIntTask<K,V> rt =
6682	<	new MapReduceValuesToIntTask<K,V>
6683	<	(t, b, true, transformer, id, reducer);
6684	<	t = new MapReduceValuesToIntTask<K,V>
6685	<	(t, b, false, transformer, id, reducer);
6686	<	t.sibling = rt;
6687	<	rt.sibling = t;
6688	<	rt.fork();
6689	<	}
6690	<	int r = id;
6691	<	Object v;
6542	<	while ((v = t.advance()) != null)
6543	<	r = reducer.apply(r, transformer.apply((V)v));
6544	<	t.result = r;
6545	<	for (;;) {
6546	<	int c; BulkTask<K,V,?> par; MapReduceValuesToIntTask<K,V> s, p;
6547	<	if ((par = t.parent) == null ||
6548	<	!(par instanceof MapReduceValuesToIntTask)) {
6549	<	t.quietlyComplete();
6550	<	break;
6551	<	}
6552	<	else if ((c = (p = (MapReduceValuesToIntTask<K,V>)par).pending) == 0) {
6553	<	if ((s = t.sibling) != null)
6554	<	r = reducer.apply(r, s.result);
6555	<	(t = p).result = r;
6669	>	public final Integer getRawResult() { return result; }
6670	>	@SuppressWarnings("unchecked") public final void compute() {
6671	>	final ObjectToInt<? super V> transformer;
6672	>	final IntByIntToInt reducer;
6673	>	if ((transformer = this.transformer) != null &&
6674	>	(reducer = this.reducer) != null) {
6675	>	int r = this.basis;
6676	>	for (int b; (b = preSplit()) > 0;)
6677	>	(rights = new MapReduceValuesToIntTask<K,V>
6678	>	(map, this, b, rights, transformer, r, reducer)).fork();
6679	>	V v;
6680	>	while ((v = advance()) != null)
6681	>	r = reducer.apply(r, transformer.apply(v));
6682	>	result = r;
6683	>	CountedCompleter<?> c;
6684	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6685	>	MapReduceValuesToIntTask<K,V>
6686	>	t = (MapReduceValuesToIntTask<K,V>)c,
6687	>	s = t.rights;
6688	>	while (s != null) {
6689	>	t.result = reducer.apply(t.result, s.result);
6690	>	s = t.rights = s.nextRight;
6691	>	}
6692		}
6557	–	else if (p.casPending(c, 0))
6558	–	break;
6693		}
6694		}
6561	–	public final Integer getRawResult() { return result; }
6695		}
6696
6697	<	static final class MapReduceEntriesToIntTask<K,V>
6698	<	extends BulkTask<K,V,Integer> {
6697	>	@SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V>
6698	>	extends Traverser<K,V,Integer> {
6699		final ObjectToInt<Map.Entry<K,V>> transformer;
6700		final IntByIntToInt reducer;
6701		final int basis;
6702		int result;
6703	<	MapReduceEntriesToIntTask<K,V> sibling;
6571	<	MapReduceEntriesToIntTask
6572	<	(ConcurrentHashMapV8<K,V> m,
6573	<	ObjectToInt<Map.Entry<K,V>> transformer,
6574	<	int basis,
6575	<	IntByIntToInt reducer) {
6576	<	super(m);
6577	<	this.transformer = transformer;
6578	<	this.basis = basis; this.reducer = reducer;
6579	<	}
6703	>	MapReduceEntriesToIntTask<K,V> rights, nextRight;
6704		MapReduceEntriesToIntTask
6705	<	(BulkTask<K,V,?> p, int b, boolean split,
6705	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6706	>	MapReduceEntriesToIntTask<K,V> nextRight,
6707		ObjectToInt<Map.Entry<K,V>> transformer,
6708		int basis,
6709		IntByIntToInt reducer) {
6710	<	super(p, b, split);
6710	>	super(m, p, b); this.nextRight = nextRight;
6711		this.transformer = transformer;
6712		this.basis = basis; this.reducer = reducer;
6713		}
6714	<	public final void compute() {
6715	<	MapReduceEntriesToIntTask<K,V> t = this;
6716	<	final ObjectToInt<Map.Entry<K,V>> transformer =
6717	<	this.transformer;
6718	<	final IntByIntToInt reducer = this.reducer;
6719	<	if (transformer == null || reducer == null)
6720	<	throw new Error(NullFunctionMessage);
6721	<	final int id = this.basis;
6722	<	int b = batch();
6723	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6724	<	b >>>= 1;
6725	<	t.pending = 1;
6726	<	MapReduceEntriesToIntTask<K,V> rt =
6727	<	new MapReduceEntriesToIntTask<K,V>
6728	<	(t, b, true, transformer, id, reducer);
6729	<	t = new MapReduceEntriesToIntTask<K,V>
6730	<	(t, b, false, transformer, id, reducer);
6731	<	t.sibling = rt;
6732	<	rt.sibling = t;
6733	<	rt.fork();
6734	<	}
6735	<	int r = id;
6736	<	Object v;
6737	<	while ((v = t.advance()) != null)
6613	<	r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v)));
6614	<	t.result = r;
6615	<	for (;;) {
6616	<	int c; BulkTask<K,V,?> par; MapReduceEntriesToIntTask<K,V> s, p;
6617	<	if ((par = t.parent) == null ||
6618	<	!(par instanceof MapReduceEntriesToIntTask)) {
6619	<	t.quietlyComplete();
6620	<	break;
6621	<	}
6622	<	else if ((c = (p = (MapReduceEntriesToIntTask<K,V>)par).pending) == 0) {
6623	<	if ((s = t.sibling) != null)
6624	<	r = reducer.apply(r, s.result);
6625	<	(t = p).result = r;
6714	>	public final Integer getRawResult() { return result; }
6715	>	@SuppressWarnings("unchecked") public final void compute() {
6716	>	final ObjectToInt<Map.Entry<K,V>> transformer;
6717	>	final IntByIntToInt reducer;
6718	>	if ((transformer = this.transformer) != null &&
6719	>	(reducer = this.reducer) != null) {
6720	>	int r = this.basis;
6721	>	for (int b; (b = preSplit()) > 0;)
6722	>	(rights = new MapReduceEntriesToIntTask<K,V>
6723	>	(map, this, b, rights, transformer, r, reducer)).fork();
6724	>	V v;
6725	>	while ((v = advance()) != null)
6726	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
6727	>	v)));
6728	>	result = r;
6729	>	CountedCompleter<?> c;
6730	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6731	>	MapReduceEntriesToIntTask<K,V>
6732	>	t = (MapReduceEntriesToIntTask<K,V>)c,
6733	>	s = t.rights;
6734	>	while (s != null) {
6735	>	t.result = reducer.apply(t.result, s.result);
6736	>	s = t.rights = s.nextRight;
6737	>	}
6738		}
6627	–	else if (p.casPending(c, 0))
6628	–	break;
6739		}
6740		}
6631	–	public final Integer getRawResult() { return result; }
6741		}
6742
6743	<	static final class MapReduceMappingsToIntTask<K,V>
6744	<	extends BulkTask<K,V,Integer> {
6743	>	@SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V>
6744	>	extends Traverser<K,V,Integer> {
6745		final ObjectByObjectToInt<? super K, ? super V> transformer;
6746		final IntByIntToInt reducer;
6747		final int basis;
6748		int result;
6749	<	MapReduceMappingsToIntTask<K,V> sibling;
6749	>	MapReduceMappingsToIntTask<K,V> rights, nextRight;
6750		MapReduceMappingsToIntTask
6751	<	(ConcurrentHashMapV8<K,V> m,
6751	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6752	>	MapReduceMappingsToIntTask<K,V> nextRight,
6753		ObjectByObjectToInt<? super K, ? super V> transformer,
6754		int basis,
6755		IntByIntToInt reducer) {
6756	<	super(m);
6756	>	super(m, p, b); this.nextRight = nextRight;
6757		this.transformer = transformer;
6758		this.basis = basis; this.reducer = reducer;
6759		}
6760	<	MapReduceMappingsToIntTask
6761	<	(BulkTask<K,V,?> p, int b, boolean split,
6762	<	ObjectByObjectToInt<? super K, ? super V> transformer,
6763	<	int basis,
6764	<	IntByIntToInt reducer) {
6765	<	super(p, b, split);
6766	<	this.transformer = transformer;
6767	<	this.basis = basis; this.reducer = reducer;
6768	<	}
6769	<	public final void compute() {
6770	<	MapReduceMappingsToIntTask<K,V> t = this;
6771	<	final ObjectByObjectToInt<? super K, ? super V> transformer =
6772	<	this.transformer;
6773	<	final IntByIntToInt reducer = this.reducer;
6774	<	if (transformer == null || reducer == null)
6775	<	throw new Error(NullFunctionMessage);
6776	<	final int id = this.basis;
6777	<	int b = batch();
6778	<	while (b > 1 && t.baseIndex != t.baseLimit) {
6779	<	b >>>= 1;
6780	<	t.pending = 1;
6781	<	MapReduceMappingsToIntTask<K,V> rt =
6782	<	new MapReduceMappingsToIntTask<K,V>
6673	<	(t, b, true, transformer, id, reducer);
6674	<	t = new MapReduceMappingsToIntTask<K,V>
6675	<	(t, b, false, transformer, id, reducer);
6676	<	t.sibling = rt;
6677	<	rt.sibling = t;
6678	<	rt.fork();
6679	<	}
6680	<	int r = id;
6681	<	Object v;
6682	<	while ((v = t.advance()) != null)
6683	<	r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v));
6684	<	t.result = r;
6685	<	for (;;) {
6686	<	int c; BulkTask<K,V,?> par; MapReduceMappingsToIntTask<K,V> s, p;
6687	<	if ((par = t.parent) == null ||
6688	<	!(par instanceof MapReduceMappingsToIntTask)) {
6689	<	t.quietlyComplete();
6690	<	break;
6691	<	}
6692	<	else if ((c = (p = (MapReduceMappingsToIntTask<K,V>)par).pending) == 0) {
6693	<	if ((s = t.sibling) != null)
6694	<	r = reducer.apply(r, s.result);
6695	<	(t = p).result = r;
6760	>	public final Integer getRawResult() { return result; }
6761	>	@SuppressWarnings("unchecked") public final void compute() {
6762	>	final ObjectByObjectToInt<? super K, ? super V> transformer;
6763	>	final IntByIntToInt reducer;
6764	>	if ((transformer = this.transformer) != null &&
6765	>	(reducer = this.reducer) != null) {
6766	>	int r = this.basis;
6767	>	for (int b; (b = preSplit()) > 0;)
6768	>	(rights = new MapReduceMappingsToIntTask<K,V>
6769	>	(map, this, b, rights, transformer, r, reducer)).fork();
6770	>	V v;
6771	>	while ((v = advance()) != null)
6772	>	r = reducer.apply(r, transformer.apply((K)nextKey, v));
6773	>	result = r;
6774	>	CountedCompleter<?> c;
6775	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6776	>	MapReduceMappingsToIntTask<K,V>
6777	>	t = (MapReduceMappingsToIntTask<K,V>)c,
6778	>	s = t.rights;
6779	>	while (s != null) {
6780	>	t.result = reducer.apply(t.result, s.result);
6781	>	s = t.rights = s.nextRight;
6782	>	}
6783		}
6697	–	else if (p.casPending(c, 0))
6698	–	break;
6784		}
6785		}
6701	–	public final Integer getRawResult() { return result; }
6786		}
6787
6704	–
6788		// Unsafe mechanics
6789	<	private static final sun.misc.Unsafe UNSAFE;
6790	<	private static final long counterOffset;
6791	<	private static final long sizeCtlOffset;
6789	>	private static final sun.misc.Unsafe U;
6790	>	private static final long SIZECTL;
6791	>	private static final long TRANSFERINDEX;
6792	>	private static final long TRANSFERORIGIN;
6793	>	private static final long BASECOUNT;
6794	>	private static final long COUNTERBUSY;
6795	>	private static final long CELLVALUE;
6796		private static final long ABASE;
6797		private static final int ASHIFT;
6798
6799		static {
6713	–	int ss;
6800		try {
6801	<	UNSAFE = getUnsafe();
6801	>	U = getUnsafe();
6802		Class<?> k = ConcurrentHashMapV8.class;
6803	<	counterOffset = UNSAFE.objectFieldOffset
6718	<	(k.getDeclaredField("counter"));
6719	<	sizeCtlOffset = UNSAFE.objectFieldOffset
6803	>	SIZECTL = U.objectFieldOffset
6804		(k.getDeclaredField("sizeCtl"));
6805	<	Class<?> sc = Node[].class;
6806	<	ABASE = UNSAFE.arrayBaseOffset(sc);
6807	<	ss = UNSAFE.arrayIndexScale(sc);
6805	>	TRANSFERINDEX = U.objectFieldOffset
6806	>	(k.getDeclaredField("transferIndex"));
6807	>	TRANSFERORIGIN = U.objectFieldOffset
6808	>	(k.getDeclaredField("transferOrigin"));
6809	>	BASECOUNT = U.objectFieldOffset
6810	>	(k.getDeclaredField("baseCount"));
6811	>	COUNTERBUSY = U.objectFieldOffset
6812	>	(k.getDeclaredField("counterBusy"));
6813	>	Class<?> ck = CounterCell.class;
6814	>	CELLVALUE = U.objectFieldOffset
6815	>	(ck.getDeclaredField("value"));
6816	>	Class<?> ak = Node[].class;
6817	>	ABASE = U.arrayBaseOffset(ak);
6818	>	int scale = U.arrayIndexScale(ak);
6819	>	if ((scale & (scale - 1)) != 0)
6820	>	throw new Error("data type scale not a power of two");
6821	>	ASHIFT = 31 - Integer.numberOfLeadingZeros(scale);
6822		} catch (Exception e) {
6823		throw new Error(e);
6824		}
6727	–	if ((ss & (ss-1)) != 0)
6728	–	throw new Error("data type scale not a power of two");
6729	–	ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
6825		}
6826
6827		/**
#	Line 6739 | Line 6834 | public class ConcurrentHashMapV8<K, V>
6834		private static sun.misc.Unsafe getUnsafe() {
6835		try {
6836		return sun.misc.Unsafe.getUnsafe();
6837	<	} catch (SecurityException se) {
6838	<	try {
6839	<	return java.security.AccessController.doPrivileged
6840	<	(new java.security
6841	<	.PrivilegedExceptionAction<sun.misc.Unsafe>() {
6842	<	public sun.misc.Unsafe run() throws Exception {
6843	<	java.lang.reflect.Field f = sun.misc
6844	<	.Unsafe.class.getDeclaredField("theUnsafe");
6845	<	f.setAccessible(true);
6846	<	return (sun.misc.Unsafe) f.get(null);
6847	<	}});
6848	<	} catch (java.security.PrivilegedActionException e) {
6849	<	throw new RuntimeException("Could not initialize intrinsics",
6850	<	e.getCause());
6851	<	}
6837	>	} catch (SecurityException tryReflectionInstead) {}
6838	>	try {
6839	>	return java.security.AccessController.doPrivileged
6840	>	(new java.security.PrivilegedExceptionAction<sun.misc.Unsafe>() {
6841	>	public sun.misc.Unsafe run() throws Exception {
6842	>	Class<sun.misc.Unsafe> k = sun.misc.Unsafe.class;
6843	>	for (java.lang.reflect.Field f : k.getDeclaredFields()) {
6844	>	f.setAccessible(true);
6845	>	Object x = f.get(null);
6846	>	if (k.isInstance(x))
6847	>	return k.cast(x);
6848	>	}
6849	>	throw new NoSuchFieldError("the Unsafe");
6850	>	}});
6851	>	} catch (java.security.PrivilegedActionException e) {
6852	>	throw new RuntimeException("Could not initialize intrinsics",
6853	>	e.getCause());
6854		}
6855		}
6856		}

Diff Legend

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