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.72 by jsr166, Tue Oct 30 16:05:35 2012 UTC vs.
Revision 1.80 by jsr166, Sat Nov 24 03:46:28 2012 UTC

#	Line 28 | Line 28 | import java.util.concurrent.atomic.Atomi
28
29		import java.io.Serializable;
30
31	+	import java.util.Comparator;
32	+	import java.util.Arrays;
33	+	import java.util.Map;
34	+	import java.util.Set;
35	+	import java.util.Collection;
36	+	import java.util.AbstractMap;
37	+	import java.util.AbstractSet;
38	+	import java.util.AbstractCollection;
39	+	import java.util.Hashtable;
40	+	import java.util.HashMap;
41	+	import java.util.Iterator;
42	+	import java.util.Enumeration;
43	+	import java.util.ConcurrentModificationException;
44	+	import java.util.NoSuchElementException;
45	+	import java.util.concurrent.ConcurrentMap;
46	+	import java.util.concurrent.ThreadLocalRandom;
47	+	import java.util.concurrent.locks.LockSupport;
48	+	import java.util.concurrent.locks.AbstractQueuedSynchronizer;
49	+	import java.util.concurrent.atomic.AtomicReference;
50	+
51	+	import java.io.Serializable;
52	+
53		/**
54		* A hash table supporting full concurrency of retrievals and
55		* high expected concurrency for updates. This class obeys the
#	Line 40 | Line 62 | import java.io.Serializable;
62		* interoperable with {@code Hashtable} in programs that rely on its
63		* thread safety but not on its synchronization details.
64		*
65	<	* <p> Retrieval operations (including {@code get}) generally do not
65	>	* <p>Retrieval operations (including {@code get}) generally do not
66		* block, so may overlap with update operations (including {@code put}
67		* and {@code remove}). Retrievals reflect the results of the most
68		* recently <em>completed</em> update operations holding upon their
#	Line 61 | Line 83 | import java.io.Serializable;
83		* that may be adequate for monitoring or estimation purposes, but not
84		* for program control.
85		*
86	<	* <p> The table is dynamically expanded when there are too many
86	>	* <p>The table is dynamically expanded when there are too many
87		* collisions (i.e., keys that have distinct hash codes but fall into
88		* the same slot modulo the table size), with the expected average
89		* effect of maintaining roughly two bins per mapping (corresponding
#	Line 82 | Line 104 | import java.io.Serializable;
104		* {@code hashCode()} is a sure way to slow down performance of any
105		* hash table.
106		*
107	<	* <p> A {@link Set} projection of a ConcurrentHashMapV8 may be created
107	>	* <p>A {@link Set} projection of a ConcurrentHashMapV8 may be created
108		* (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
109		* (using {@link #keySet(Object)} when only keys are of interest, and the
110		* mapped values are (perhaps transiently) not used or all take the
111		* same mapping value.
112		*
113	<	* <p> A ConcurrentHashMapV8 can be used as scalable frequency map (a
113	>	* <p>A ConcurrentHashMapV8 can be used as scalable frequency map (a
114		* form of histogram or multiset) by using {@link LongAdder} values
115		* and initializing via {@link #computeIfAbsent}. For example, to add
116		* a count to a {@code ConcurrentHashMapV8<String,LongAdder> freqs}, you
#	Line 99 | Line 121 | import java.io.Serializable;
121		* <em>optional</em> methods of the {@link Map} and {@link Iterator}
122		* interfaces.
123		*
124	<	* <p> Like {@link Hashtable} but unlike {@link HashMap}, this class
124	>	* <p>Like {@link Hashtable} but unlike {@link HashMap}, this class
125		* does <em>not</em> allow {@code null} to be used as a key or value.
126		*
127		* <p>ConcurrentHashMapV8s support parallel operations using the {@link
128	<	* ForkJoinPool#commonPool}. (Task that may be used in other contexts
128	>	* ForkJoinPool#commonPool}. (Tasks that may be used in other contexts
129		* are available in class {@link ForkJoinTasks}). These operations are
130		* designed to be safely, and often sensibly, applied even with maps
131		* that are being concurrently updated by other threads; for example,
132		* when computing a snapshot summary of the values in a shared
133		* registry.  There are three kinds of operation, each with four
134		* forms, accepting functions with Keys, Values, Entries, and (Key,
135	<	* Value) arguments and/or return values. Because the elements of a
135	>	* Value) arguments and/or return values. (The first three forms are
136	>	* also available via the {@link #keySet()}, {@link #values()} and
137	>	* {@link #entrySet()} views). Because the elements of a
138		* ConcurrentHashMapV8 are not ordered in any particular way, and may be
139		* processed in different orders in different parallel executions, the
140		* correctness of supplied functions should not depend on any
#	Line 182 | Line 206 | import java.io.Serializable;
206		* arguments can be supplied using {@code new
207		* AbstractMap.SimpleEntry(k,v)}.
208		*
209	<	* <p> Bulk operations may complete abruptly, throwing an
209	>	* <p>Bulk operations may complete abruptly, throwing an
210		* exception encountered in the application of a supplied
211		* function. Bear in mind when handling such exceptions that other
212		* concurrently executing functions could also have thrown
#	Line 193 | Line 217 | import java.io.Serializable;
217		* processing are common but not guaranteed.  Operations involving
218		* brief functions on small maps may execute more slowly than
219		* sequential loops if the underlying work to parallelize the
220	<	* computation is more expensive than the computation
221	<	* itself. Similarly, parallelization may not lead to much actual
222	<	* parallelism if all processors are busy performing unrelated tasks.
220	>	* computation is more expensive than the computation itself.
221	>	* Similarly, parallelization may not lead to much actual parallelism
222	>	* if all processors are busy performing unrelated tasks.
223		*
224	<	* <p> All arguments to all task methods must be non-null.
224	>	* <p>All arguments to all task methods must be non-null.
225		*
226		* <p><em>jsr166e note: During transition, this class
227		* uses nested functional interfaces with different names but the
228	<	* same forms as those expected for JDK8.<em>
228	>	* same forms as those expected for JDK8.</em>
229		*
230		* <p>This class is a member of the
231		* <a href="{@docRoot}/../technotes/guides/collections/index.html">
#	Line 223 | Line 247 | public class ConcurrentHashMapV8<K, V>
247		* portion of the elements, and so may be amenable to parallel
248		* execution.
249		*
250	<	* <p> This interface exports a subset of expected JDK8
250	>	* <p>This interface exports a subset of expected JDK8
251		* functionality.
252		*
253		* <p>Sample usage: Here is one (of the several) ways to compute
#	Line 285 | Line 309 | public class ConcurrentHashMapV8<K, V>
309		Spliterator<T> split();
310		}
311
288	–	/**
289	–	* A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in
290	–	* which additions may optionally be enabled by mapping to a
291	–	* common value.  This class cannot be directly instantiated. See
292	–	* {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()},
293	–	* {@link #newKeySet(int)}.
294	–	*
295	–	* <p>The view's {@code iterator} is a "weakly consistent" iterator
296	–	* that will never throw {@link ConcurrentModificationException},
297	–	* and guarantees to traverse elements as they existed upon
298	–	* construction of the iterator, and may (but is not guaranteed to)
299	–	* reflect any modifications subsequent to construction.
300	–	*/
301	–	public static class KeySetView<K,V> extends CHMView<K,V> implements Set<K>, java.io.Serializable {
302	–	private static final long serialVersionUID = 7249069246763182397L;
303	–	private final V value;
304	–	KeySetView(ConcurrentHashMapV8<K, V> map, V value) {  // non-public
305	–	super(map);
306	–	this.value = value;
307	–	}
308	–
309	–	/**
310	–	* Returns the map backing this view.
311	–	*
312	–	* @return the map backing this view
313	–	*/
314	–	public ConcurrentHashMapV8<K,V> getMap() { return map; }
315	–
316	–	/**
317	–	* Returns the default mapped value for additions,
318	–	* or {@code null} if additions are not supported.
319	–	*
320	–	* @return the default mapped value for additions, or {@code null}
321	–	* if not supported.
322	–	*/
323	–	public V getMappedValue() { return value; }
324	–
325	–	// implement Set API
326	–
327	–	public boolean contains(Object o) { return map.containsKey(o); }
328	–	public boolean remove(Object o)   { return map.remove(o) != null; }
329	–	public Iterator<K> iterator()     { return new KeyIterator<K,V>(map); }
330	–	public boolean add(K e) {
331	–	V v;
332	–	if ((v = value) == null)
333	–	throw new UnsupportedOperationException();
334	–	if (e == null)
335	–	throw new NullPointerException();
336	–	return map.internalPutIfAbsent(e, v) == null;
337	–	}
338	–	public boolean addAll(Collection<? extends K> c) {
339	–	boolean added = false;
340	–	V v;
341	–	if ((v = value) == null)
342	–	throw new UnsupportedOperationException();
343	–	for (K e : c) {
344	–	if (e == null)
345	–	throw new NullPointerException();
346	–	if (map.internalPutIfAbsent(e, v) == null)
347	–	added = true;
348	–	}
349	–	return added;
350	–	}
351	–	public boolean equals(Object o) {
352	–	Set<?> c;
353	–	return ((o instanceof Set) &&
354	–	((c = (Set<?>)o) == this ||
355	–	(containsAll(c) && c.containsAll(this))));
356	–	}
357	–	}
312
313		/*
314		* Overview:
#	Line 639 | Line 593 | public class ConcurrentHashMapV8<K, V>
593
594		// views
595		private transient KeySetView<K,V> keySet;
596	<	private transient Values<K,V> values;
597	<	private transient EntrySet<K,V> entrySet;
596	>	private transient ValuesView<K,V> values;
597	>	private transient EntrySetView<K,V> entrySet;
598
599		/** For serialization compatibility. Null unless serialized; see below */
600		private Segment<K,V>[] segments;
#	Line 739 | Line 693 | public class ConcurrentHashMapV8<K, V>
693		try {
694		wait();
695		} catch (InterruptedException ie) {
696	<	Thread.currentThread().interrupt();
696	>	try {
697	>	Thread.currentThread().interrupt();
698	>	} catch (SecurityException ignore) {
699	>	}
700		}
701		}
702		else
#	Line 2448 | Line 2405 | public class ConcurrentHashMapV8<K, V>
2405		* across threads, iteration terminates if a bounds checks fails
2406		* for a table read.
2407		*
2408	<	* This class extends ForkJoinTask to streamline parallel
2409	<	* iteration in bulk operations (see BulkTask). This adds only an
2410	<	* int of space overhead, which is close enough to negligible in
2411	<	* cases where it is not needed to not worry about it.  Because
2412	<	* ForkJoinTask is Serializable, but iterators need not be, we
2413	<	* need to add warning suppressions.
2408	>	* This class extends CountedCompleter to streamline parallel
2409	>	* iteration in bulk operations. This adds only a few fields of
2410	>	* space overhead, which is small enough in cases where it is not
2411	>	* needed to not worry about it.  Because CountedCompleter is
2412	>	* Serializable, but iterators need not be, we need to add warning
2413	>	* suppressions.
2414		*/
2415	<	@SuppressWarnings("serial") static class Traverser<K,V,R> extends ForkJoinTask<R> {
2415	>	@SuppressWarnings("serial") static class Traverser<K,V,R> extends CountedCompleter<R> {
2416		final ConcurrentHashMapV8<K, V> map;
2417		Node next;           // the next entry to use
2418		Object nextKey;      // cached key field of next
#	Line 2465 | Line 2422 | public class ConcurrentHashMapV8<K, V>
2422		int baseIndex;       // current index of initial table
2423		int baseLimit;       // index bound for initial table
2424		int baseSize;        // initial table size
2425	+	int batch;           // split control
2426
2427		/** Creates iterator for all entries in the table. */
2428		Traverser(ConcurrentHashMapV8<K, V> map) {
2429		this.map = map;
2430		}
2431
2432	<	/** Creates iterator for split() methods */
2433	<	Traverser(Traverser<K,V,?> it) {
2434	<	ConcurrentHashMapV8<K, V> m; Node[] t;
2435	<	if ((m = this.map = it.map) == null)
2436	<	t = null;
2437	<	else if ((t = it.tab) == null && // force parent tab initialization
2438	<	(t = it.tab = m.table) != null)
2439	<	it.baseLimit = it.baseSize = t.length;
2440	<	this.tab = t;
2441	<	this.baseSize = it.baseSize;
2442	<	it.baseLimit = this.index = this.baseIndex =
2443	<	((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1;
2432	>	/** Creates iterator for split() methods and task constructors */
2433	>	Traverser(ConcurrentHashMapV8<K,V> map, Traverser<K,V,?> it, int batch) {
2434	>	super(it);
2435	>	this.batch = batch;
2436	>	if ((this.map = map) != null && it != null) { // split parent
2437	>	Node[] t;
2438	>	if ((t = it.tab) == null &&
2439	>	(t = it.tab = map.table) != null)
2440	>	it.baseLimit = it.baseSize = t.length;
2441	>	this.tab = t;
2442	>	this.baseSize = it.baseSize;
2443	>	int hi = this.baseLimit = it.baseLimit;
2444	>	it.baseLimit = this.index = this.baseIndex =
2445	>	(hi + it.baseIndex + 1) >>> 1;
2446	>	}
2447		}
2448
2449		/**
#	Line 2535 | Line 2496 | public class ConcurrentHashMapV8<K, V>
2496		}
2497
2498		public final boolean hasMoreElements() { return hasNext(); }
2499	<	public final void setRawResult(Object x) { }
2500	<	public R getRawResult() { return null; }
2501	<	public boolean exec() { return true; }
2499	>
2500	>	public void compute() { } // default no-op CountedCompleter body
2501	>
2502	>	/**
2503	>	* Returns a batch value > 0 if this task should (and must) be
2504	>	* split, if so, adding to pending count, and in any case
2505	>	* updating batch value. The initial batch value is approx
2506	>	* exp2 of the number of times (minus one) to split task by
2507	>	* two before executing leaf action. This value is faster to
2508	>	* compute and more convenient to use as a guide to splitting
2509	>	* than is the depth, since it is used while dividing by two
2510	>	* anyway.
2511	>	*/
2512	>	final int preSplit() {
2513	>	ConcurrentHashMapV8<K, V> m; int b; Node[] t;  ForkJoinPool pool;
2514	>	if ((b = batch) < 0 && (m = map) != null) { // force initialization
2515	>	if ((t = tab) == null && (t = tab = m.table) != null)
2516	>	baseLimit = baseSize = t.length;
2517	>	if (t != null) {
2518	>	long n = m.counter.sum();
2519	>	int par = ((pool = getPool()) == null) ?
2520	>	ForkJoinPool.getCommonPoolParallelism() :
2521	>	pool.getParallelism();
2522	>	int sp = par << 3; // slack of 8
2523	>	b = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
2524	>	}
2525	>	}
2526	>	b = (b <= 1 || baseIndex == baseLimit) ? 0 : (b >>> 1);
2527	>	if ((batch = b) > 0)
2528	>	addToPendingCount(1);
2529	>	return b;
2530	>	}
2531	>
2532		}
2533
2534		/* ---------------- Public operations -------------- */
#	Line 2677 | Line 2668 | public class ConcurrentHashMapV8<K, V>
2668		* Returns the number of mappings. This method should be used
2669		* instead of {@link #size} because a ConcurrentHashMapV8 may
2670		* contain more mappings than can be represented as an int. The
2671	<	* value returned is a snapshot; the actual count may differ if
2672	<	* there are ongoing concurrent insertions or removals.
2671	>	* value returned is an estimate; the actual count may differ if
2672	>	* there are concurrent insertions or removals.
2673		*
2674		* @return the number of mappings
2675		*/
#	Line 2781 | Line 2772 | public class ConcurrentHashMapV8<K, V>
2772		* Maps the specified key to the specified value in this table.
2773		* Neither the key nor the value can be null.
2774		*
2775	<	* <p> The value can be retrieved by calling the {@code get} method
2775	>	* <p>The value can be retrieved by calling the {@code get} method
2776		* with a key that is equal to the original key.
2777		*
2778		* @param key key with which the specified value is to be associated
#	Line 3078 | Line 3069 | public class ConcurrentHashMapV8<K, V>
3069		/**
3070		* Returns a {@link Collection} view of the values contained in this map.
3071		* The collection is backed by the map, so changes to the map are
3072	<	* reflected in the collection, and vice-versa.  The collection
3082	<	* supports element removal, which removes the corresponding
3083	<	* mapping from this map, via the {@code Iterator.remove},
3084	<	* {@code Collection.remove}, {@code removeAll},
3085	<	* {@code retainAll}, and {@code clear} operations.  It does not
3086	<	* support the {@code add} or {@code addAll} operations.
3087	<	*
3088	<	* <p>The view's {@code iterator} is a "weakly consistent" iterator
3089	<	* that will never throw {@link ConcurrentModificationException},
3090	<	* and guarantees to traverse elements as they existed upon
3091	<	* construction of the iterator, and may (but is not guaranteed to)
3092	<	* reflect any modifications subsequent to construction.
3072	>	* reflected in the collection, and vice-versa.
3073		*/
3074	<	public Collection<V> values() {
3075	<	Values<K,V> vs = values;
3076	<	return (vs != null) ? vs : (values = new Values<K,V>(this));
3074	>	public ValuesView<K,V> values() {
3075	>	ValuesView<K,V> vs = values;
3076	>	return (vs != null) ? vs : (values = new ValuesView<K,V>(this));
3077		}
3078
3079		/**
#	Line 3113 | Line 3093 | public class ConcurrentHashMapV8<K, V>
3093		* reflect any modifications subsequent to construction.
3094		*/
3095		public Set<Map.Entry<K,V>> entrySet() {
3096	<	EntrySet<K,V> es = entrySet;
3097	<	return (es != null) ? es : (entrySet = new EntrySet<K,V>(this));
3096	>	EntrySetView<K,V> es = entrySet;
3097	>	return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this));
3098		}
3099
3100		/**
#	Line 3250 | Line 3230 | public class ConcurrentHashMapV8<K, V>
3230		@SuppressWarnings("serial") static final class KeyIterator<K,V> extends Traverser<K,V,Object>
3231		implements Spliterator<K>, Enumeration<K> {
3232		KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3233	<	KeyIterator(Traverser<K,V,Object> it) {
3234	<	super(it);
3233	>	KeyIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
3234	>	super(map, it, -1);
3235		}
3236		public KeyIterator<K,V> split() {
3237		if (nextKey != null)
3238		throw new IllegalStateException();
3239	<	return new KeyIterator<K,V>(this);
3239	>	return new KeyIterator<K,V>(map, this);
3240		}
3241		@SuppressWarnings("unchecked") public final K next() {
3242		if (nextVal == null && advance() == null)
#	Line 3272 | Line 3252 | public class ConcurrentHashMapV8<K, V>
3252		@SuppressWarnings("serial") static final class ValueIterator<K,V> extends Traverser<K,V,Object>
3253		implements Spliterator<V>, Enumeration<V> {
3254		ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3255	<	ValueIterator(Traverser<K,V,Object> it) {
3256	<	super(it);
3255	>	ValueIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
3256	>	super(map, it, -1);
3257		}
3258		public ValueIterator<K,V> split() {
3259		if (nextKey != null)
3260		throw new IllegalStateException();
3261	<	return new ValueIterator<K,V>(this);
3261	>	return new ValueIterator<K,V>(map, this);
3262		}
3263
3264		@SuppressWarnings("unchecked") public final V next() {
#	Line 3295 | Line 3275 | public class ConcurrentHashMapV8<K, V>
3275		@SuppressWarnings("serial") static final class EntryIterator<K,V> extends Traverser<K,V,Object>
3276		implements Spliterator<Map.Entry<K,V>> {
3277		EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3278	<	EntryIterator(Traverser<K,V,Object> it) {
3279	<	super(it);
3278	>	EntryIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
3279	>	super(map, it, -1);
3280		}
3281		public EntryIterator<K,V> split() {
3282		if (nextKey != null)
3283		throw new IllegalStateException();
3284	<	return new EntryIterator<K,V>(this);
3284	>	return new EntryIterator<K,V>(map, this);
3285		}
3286
3287		@SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
#	Line 3357 | Line 3337 | public class ConcurrentHashMapV8<K, V>
3337		}
3338		}
3339
3360	–	/* ----------------Views -------------- */
3361	–
3340		/**
3341	<	* Base class for views.
3341	>	* Returns exportable snapshot entry for the given key and value
3342	>	* when write-through can't or shouldn't be used.
3343		*/
3344	<	static abstract class CHMView<K, V> {
3345	<	final ConcurrentHashMapV8<K, V> map;
3367	<	CHMView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
3368	<	public final int size()                 { return map.size(); }
3369	<	public final boolean isEmpty()          { return map.isEmpty(); }
3370	<	public final void clear()               { map.clear(); }
3371	<
3372	<	// implementations below rely on concrete classes supplying these
3373	<	abstract public Iterator<?> iterator();
3374	<	abstract public boolean contains(Object o);
3375	<	abstract public boolean remove(Object o);
3376	<
3377	<	private static final String oomeMsg = "Required array size too large";
3378	<
3379	<	public final Object[] toArray() {
3380	<	long sz = map.mappingCount();
3381	<	if (sz > (long)(MAX_ARRAY_SIZE))
3382	<	throw new OutOfMemoryError(oomeMsg);
3383	<	int n = (int)sz;
3384	<	Object[] r = new Object[n];
3385	<	int i = 0;
3386	<	Iterator<?> it = iterator();
3387	<	while (it.hasNext()) {
3388	<	if (i == n) {
3389	<	if (n >= MAX_ARRAY_SIZE)
3390	<	throw new OutOfMemoryError(oomeMsg);
3391	<	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
3392	<	n = MAX_ARRAY_SIZE;
3393	<	else
3394	<	n += (n >>> 1) + 1;
3395	<	r = Arrays.copyOf(r, n);
3396	<	}
3397	<	r[i++] = it.next();
3398	<	}
3399	<	return (i == n) ? r : Arrays.copyOf(r, i);
3400	<	}
3401	<
3402	<	@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
3403	<	long sz = map.mappingCount();
3404	<	if (sz > (long)(MAX_ARRAY_SIZE))
3405	<	throw new OutOfMemoryError(oomeMsg);
3406	<	int m = (int)sz;
3407	<	T[] r = (a.length >= m) ? a :
3408	<	(T[])java.lang.reflect.Array
3409	<	.newInstance(a.getClass().getComponentType(), m);
3410	<	int n = r.length;
3411	<	int i = 0;
3412	<	Iterator<?> it = iterator();
3413	<	while (it.hasNext()) {
3414	<	if (i == n) {
3415	<	if (n >= MAX_ARRAY_SIZE)
3416	<	throw new OutOfMemoryError(oomeMsg);
3417	<	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
3418	<	n = MAX_ARRAY_SIZE;
3419	<	else
3420	<	n += (n >>> 1) + 1;
3421	<	r = Arrays.copyOf(r, n);
3422	<	}
3423	<	r[i++] = (T)it.next();
3424	<	}
3425	<	if (a == r && i < n) {
3426	<	r[i] = null; // null-terminate
3427	<	return r;
3428	<	}
3429	<	return (i == n) ? r : Arrays.copyOf(r, i);
3430	<	}
3431	<
3432	<	public final int hashCode() {
3433	<	int h = 0;
3434	<	for (Iterator<?> it = iterator(); it.hasNext();)
3435	<	h += it.next().hashCode();
3436	<	return h;
3437	<	}
3438	<
3439	<	public final String toString() {
3440	<	StringBuilder sb = new StringBuilder();
3441	<	sb.append('[');
3442	<	Iterator<?> it = iterator();
3443	<	if (it.hasNext()) {
3444	<	for (;;) {
3445	<	Object e = it.next();
3446	<	sb.append(e == this ? "(this Collection)" : e);
3447	<	if (!it.hasNext())
3448	<	break;
3449	<	sb.append(',').append(' ');
3450	<	}
3451	<	}
3452	<	return sb.append(']').toString();
3453	<	}
3454	<
3455	<	public final boolean containsAll(Collection<?> c) {
3456	<	if (c != this) {
3457	<	for (Iterator<?> it = c.iterator(); it.hasNext();) {
3458	<	Object e = it.next();
3459	<	if (e == null || !contains(e))
3460	<	return false;
3461	<	}
3462	<	}
3463	<	return true;
3464	<	}
3465	<
3466	<	public final boolean removeAll(Collection<?> c) {
3467	<	boolean modified = false;
3468	<	for (Iterator<?> it = iterator(); it.hasNext();) {
3469	<	if (c.contains(it.next())) {
3470	<	it.remove();
3471	<	modified = true;
3472	<	}
3473	<	}
3474	<	return modified;
3475	<	}
3476	<
3477	<	public final boolean retainAll(Collection<?> c) {
3478	<	boolean modified = false;
3479	<	for (Iterator<?> it = iterator(); it.hasNext();) {
3480	<	if (!c.contains(it.next())) {
3481	<	it.remove();
3482	<	modified = true;
3483	<	}
3484	<	}
3485	<	return modified;
3486	<	}
3487	<
3488	<	}
3489	<
3490	<	static final class Values<K,V> extends CHMView<K,V>
3491	<	implements Collection<V> {
3492	<	Values(ConcurrentHashMapV8<K, V> map)   { super(map); }
3493	<	public final boolean contains(Object o) { return map.containsValue(o); }
3494	<	public final boolean remove(Object o) {
3495	<	if (o != null) {
3496	<	Iterator<V> it = new ValueIterator<K,V>(map);
3497	<	while (it.hasNext()) {
3498	<	if (o.equals(it.next())) {
3499	<	it.remove();
3500	<	return true;
3501	<	}
3502	<	}
3503	<	}
3504	<	return false;
3505	<	}
3506	<	public final Iterator<V> iterator() {
3507	<	return new ValueIterator<K,V>(map);
3508	<	}
3509	<	public final boolean add(V e) {
3510	<	throw new UnsupportedOperationException();
3511	<	}
3512	<	public final boolean addAll(Collection<? extends V> c) {
3513	<	throw new UnsupportedOperationException();
3514	<	}
3515	<
3516	<	}
3517	<
3518	<	static final class EntrySet<K,V> extends CHMView<K,V>
3519	<	implements Set<Map.Entry<K,V>> {
3520	<	EntrySet(ConcurrentHashMapV8<K, V> map) { super(map); }
3521	<	public final boolean contains(Object o) {
3522	<	Object k, v, r; Map.Entry<?,?> e;
3523	<	return ((o instanceof Map.Entry) &&
3524	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3525	<	(r = map.get(k)) != null &&
3526	<	(v = e.getValue()) != null &&
3527	<	(v == r || v.equals(r)));
3528	<	}
3529	<	public final boolean remove(Object o) {
3530	<	Object k, v; Map.Entry<?,?> e;
3531	<	return ((o instanceof Map.Entry) &&
3532	<	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
3533	<	(v = e.getValue()) != null &&
3534	<	map.remove(k, v));
3535	<	}
3536	<	public final Iterator<Map.Entry<K,V>> iterator() {
3537	<	return new EntryIterator<K,V>(map);
3538	<	}
3539	<	public final boolean add(Entry<K,V> e) {
3540	<	throw new UnsupportedOperationException();
3541	<	}
3542	<	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
3543	<	throw new UnsupportedOperationException();
3544	<	}
3545	<	public boolean equals(Object o) {
3546	<	Set<?> c;
3547	<	return ((o instanceof Set) &&
3548	<	((c = (Set<?>)o) == this ||
3549	<	(containsAll(c) && c.containsAll(this))));
3550	<	}
3344	>	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
3345	>	return new AbstractMap.SimpleEntry<K,V>(k, v);
3346		}
3347
3348		/* ---------------- Serialization Support -------------- */
#	Line 4220 | Line 4015 | public class ConcurrentHashMapV8<K, V>
4015		(this, transformer, basis, reducer).invoke();
4016		}
4017
4018	+	/* ----------------Views -------------- */
4019	+
4020	+	/**
4021	+	* Base class for views.
4022	+	*/
4023	+	static abstract class CHMView<K, V> {
4024	+	final ConcurrentHashMapV8<K, V> map;
4025	+	CHMView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
4026	+
4027	+	/**
4028	+	* Returns the map backing this view.
4029	+	*
4030	+	* @return the map backing this view
4031	+	*/
4032	+	public ConcurrentHashMapV8<K,V> getMap() { return map; }
4033	+
4034	+	public final int size()                 { return map.size(); }
4035	+	public final boolean isEmpty()          { return map.isEmpty(); }
4036	+	public final void clear()               { map.clear(); }
4037	+
4038	+	// implementations below rely on concrete classes supplying these
4039	+	abstract public Iterator<?> iterator();
4040	+	abstract public boolean contains(Object o);
4041	+	abstract public boolean remove(Object o);
4042	+
4043	+	private static final String oomeMsg = "Required array size too large";
4044	+
4045	+	public final Object[] toArray() {
4046	+	long sz = map.mappingCount();
4047	+	if (sz > (long)(MAX_ARRAY_SIZE))
4048	+	throw new OutOfMemoryError(oomeMsg);
4049	+	int n = (int)sz;
4050	+	Object[] r = new Object[n];
4051	+	int i = 0;
4052	+	Iterator<?> it = iterator();
4053	+	while (it.hasNext()) {
4054	+	if (i == n) {
4055	+	if (n >= MAX_ARRAY_SIZE)
4056	+	throw new OutOfMemoryError(oomeMsg);
4057	+	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4058	+	n = MAX_ARRAY_SIZE;
4059	+	else
4060	+	n += (n >>> 1) + 1;
4061	+	r = Arrays.copyOf(r, n);
4062	+	}
4063	+	r[i++] = it.next();
4064	+	}
4065	+	return (i == n) ? r : Arrays.copyOf(r, i);
4066	+	}
4067	+
4068	+	@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
4069	+	long sz = map.mappingCount();
4070	+	if (sz > (long)(MAX_ARRAY_SIZE))
4071	+	throw new OutOfMemoryError(oomeMsg);
4072	+	int m = (int)sz;
4073	+	T[] r = (a.length >= m) ? a :
4074	+	(T[])java.lang.reflect.Array
4075	+	.newInstance(a.getClass().getComponentType(), m);
4076	+	int n = r.length;
4077	+	int i = 0;
4078	+	Iterator<?> it = iterator();
4079	+	while (it.hasNext()) {
4080	+	if (i == n) {
4081	+	if (n >= MAX_ARRAY_SIZE)
4082	+	throw new OutOfMemoryError(oomeMsg);
4083	+	if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1)
4084	+	n = MAX_ARRAY_SIZE;
4085	+	else
4086	+	n += (n >>> 1) + 1;
4087	+	r = Arrays.copyOf(r, n);
4088	+	}
4089	+	r[i++] = (T)it.next();
4090	+	}
4091	+	if (a == r && i < n) {
4092	+	r[i] = null; // null-terminate
4093	+	return r;
4094	+	}
4095	+	return (i == n) ? r : Arrays.copyOf(r, i);
4096	+	}
4097	+
4098	+	public final int hashCode() {
4099	+	int h = 0;
4100	+	for (Iterator<?> it = iterator(); it.hasNext();)
4101	+	h += it.next().hashCode();
4102	+	return h;
4103	+	}
4104	+
4105	+	public final String toString() {
4106	+	StringBuilder sb = new StringBuilder();
4107	+	sb.append('[');
4108	+	Iterator<?> it = iterator();
4109	+	if (it.hasNext()) {
4110	+	for (;;) {
4111	+	Object e = it.next();
4112	+	sb.append(e == this ? "(this Collection)" : e);
4113	+	if (!it.hasNext())
4114	+	break;
4115	+	sb.append(',').append(' ');
4116	+	}
4117	+	}
4118	+	return sb.append(']').toString();
4119	+	}
4120	+
4121	+	public final boolean containsAll(Collection<?> c) {
4122	+	if (c != this) {
4123	+	for (Iterator<?> it = c.iterator(); it.hasNext();) {
4124	+	Object e = it.next();
4125	+	if (e == null || !contains(e))
4126	+	return false;
4127	+	}
4128	+	}
4129	+	return true;
4130	+	}
4131	+
4132	+	public final boolean removeAll(Collection<?> c) {
4133	+	boolean modified = false;
4134	+	for (Iterator<?> it = iterator(); it.hasNext();) {
4135	+	if (c.contains(it.next())) {
4136	+	it.remove();
4137	+	modified = true;
4138	+	}
4139	+	}
4140	+	return modified;
4141	+	}
4142	+
4143	+	public final boolean retainAll(Collection<?> c) {
4144	+	boolean modified = false;
4145	+	for (Iterator<?> it = iterator(); it.hasNext();) {
4146	+	if (!c.contains(it.next())) {
4147	+	it.remove();
4148	+	modified = true;
4149	+	}
4150	+	}
4151	+	return modified;
4152	+	}
4153	+
4154	+	}
4155	+
4156	+	/**
4157	+	* A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in
4158	+	* which additions may optionally be enabled by mapping to a
4159	+	* common value.  This class cannot be directly instantiated. See
4160	+	* {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()},
4161	+	* {@link #newKeySet(int)}.
4162	+	*/
4163	+	public static class KeySetView<K,V> extends CHMView<K,V> implements Set<K>, java.io.Serializable {
4164	+	private static final long serialVersionUID = 7249069246763182397L;
4165	+	private final V value;
4166	+	KeySetView(ConcurrentHashMapV8<K, V> map, V value) {  // non-public
4167	+	super(map);
4168	+	this.value = value;
4169	+	}
4170	+
4171	+	/**
4172	+	* Returns the default mapped value for additions,
4173	+	* or {@code null} if additions are not supported.
4174	+	*
4175	+	* @return the default mapped value for additions, or {@code null}
4176	+	* if not supported.
4177	+	*/
4178	+	public V getMappedValue() { return value; }
4179	+
4180	+	// implement Set API
4181	+
4182	+	public boolean contains(Object o) { return map.containsKey(o); }
4183	+	public boolean remove(Object o)   { return map.remove(o) != null; }
4184	+
4185	+	/**
4186	+	* Returns a "weakly consistent" iterator that will never
4187	+	* throw {@link ConcurrentModificationException}, and
4188	+	* guarantees to traverse elements as they existed upon
4189	+	* construction of the iterator, and may (but is not
4190	+	* guaranteed to) reflect any modifications subsequent to
4191	+	* construction.
4192	+	*
4193	+	* @return an iterator over the keys of this map
4194	+	*/
4195	+	public Iterator<K> iterator()     { return new KeyIterator<K,V>(map); }
4196	+	public boolean add(K e) {
4197	+	V v;
4198	+	if ((v = value) == null)
4199	+	throw new UnsupportedOperationException();
4200	+	if (e == null)
4201	+	throw new NullPointerException();
4202	+	return map.internalPutIfAbsent(e, v) == null;
4203	+	}
4204	+	public boolean addAll(Collection<? extends K> c) {
4205	+	boolean added = false;
4206	+	V v;
4207	+	if ((v = value) == null)
4208	+	throw new UnsupportedOperationException();
4209	+	for (K e : c) {
4210	+	if (e == null)
4211	+	throw new NullPointerException();
4212	+	if (map.internalPutIfAbsent(e, v) == null)
4213	+	added = true;
4214	+	}
4215	+	return added;
4216	+	}
4217	+	public boolean equals(Object o) {
4218	+	Set<?> c;
4219	+	return ((o instanceof Set) &&
4220	+	((c = (Set<?>)o) == this ||
4221	+	(containsAll(c) && c.containsAll(this))));
4222	+	}
4223	+
4224	+	/**
4225	+	* Performs the given action for each key.
4226	+	*
4227	+	* @param action the action
4228	+	*/
4229	+	public void forEach(Action<K> action) {
4230	+	ForkJoinTasks.forEachKey
4231	+	(map, action).invoke();
4232	+	}
4233	+
4234	+	/**
4235	+	* Performs the given action for each non-null transformation
4236	+	* of each key.
4237	+	*
4238	+	* @param transformer a function returning the transformation
4239	+	* for an element, or null of there is no transformation (in
4240	+	* which case the action is not applied).
4241	+	* @param action the action
4242	+	*/
4243	+	public <U> void forEach(Fun<? super K, ? extends U> transformer,
4244	+	Action<U> action) {
4245	+	ForkJoinTasks.forEachKey
4246	+	(map, transformer, action).invoke();
4247	+	}
4248	+
4249	+	/**
4250	+	* Returns a non-null result from applying the given search
4251	+	* function on each key, or null if none. Upon success,
4252	+	* further element processing is suppressed and the results of
4253	+	* any other parallel invocations of the search function are
4254	+	* ignored.
4255	+	*
4256	+	* @param searchFunction a function returning a non-null
4257	+	* result on success, else null
4258	+	* @return a non-null result from applying the given search
4259	+	* function on each key, or null if none
4260	+	*/
4261	+	public <U> U search(Fun<? super K, ? extends U> searchFunction) {
4262	+	return ForkJoinTasks.searchKeys
4263	+	(map, searchFunction).invoke();
4264	+	}
4265	+
4266	+	/**
4267	+	* Returns the result of accumulating all keys using the given
4268	+	* reducer to combine values, or null if none.
4269	+	*
4270	+	* @param reducer a commutative associative combining function
4271	+	* @return the result of accumulating all keys using the given
4272	+	* reducer to combine values, or null if none
4273	+	*/
4274	+	public K reduce(BiFun<? super K, ? super K, ? extends K> reducer) {
4275	+	return ForkJoinTasks.reduceKeys
4276	+	(map, reducer).invoke();
4277	+	}
4278	+
4279	+	/**
4280	+	* Returns the result of accumulating the given transformation
4281	+	* of all keys using the given reducer to combine values, and
4282	+	* the given basis as an identity value.
4283	+	*
4284	+	* @param transformer a function returning the transformation
4285	+	* for an element
4286	+	* @param basis the identity (initial default value) for the reduction
4287	+	* @param reducer a commutative associative combining function
4288	+	* @return  the result of accumulating the given transformation
4289	+	* of all keys
4290	+	*/
4291	+	public double reduceToDouble(ObjectToDouble<? super K> transformer,
4292	+	double basis,
4293	+	DoubleByDoubleToDouble reducer) {
4294	+	return ForkJoinTasks.reduceKeysToDouble
4295	+	(map, transformer, basis, reducer).invoke();
4296	+	}
4297	+
4298	+
4299	+	/**
4300	+	* Returns the result of accumulating the given transformation
4301	+	* of all keys using the given reducer to combine values, and
4302	+	* the given basis as an identity value.
4303	+	*
4304	+	* @param transformer a function returning the transformation
4305	+	* for an element
4306	+	* @param basis the identity (initial default value) for the reduction
4307	+	* @param reducer a commutative associative combining function
4308	+	* @return the result of accumulating the given transformation
4309	+	* of all keys
4310	+	*/
4311	+	public long reduceToLong(ObjectToLong<? super K> transformer,
4312	+	long basis,
4313	+	LongByLongToLong reducer) {
4314	+	return ForkJoinTasks.reduceKeysToLong
4315	+	(map, transformer, basis, reducer).invoke();
4316	+	}
4317	+
4318	+	/**
4319	+	* Returns the result of accumulating the given transformation
4320	+	* of all keys using the given reducer to combine values, and
4321	+	* the given basis as an identity value.
4322	+	*
4323	+	* @param transformer a function returning the transformation
4324	+	* for an element
4325	+	* @param basis the identity (initial default value) for the reduction
4326	+	* @param reducer a commutative associative combining function
4327	+	* @return the result of accumulating the given transformation
4328	+	* of all keys
4329	+	*/
4330	+	public int reduceToInt(ObjectToInt<? super K> transformer,
4331	+	int basis,
4332	+	IntByIntToInt reducer) {
4333	+	return ForkJoinTasks.reduceKeysToInt
4334	+	(map, transformer, basis, reducer).invoke();
4335	+	}
4336	+
4337	+	}
4338	+
4339	+	/**
4340	+	* A view of a ConcurrentHashMapV8 as a {@link Collection} of
4341	+	* values, in which additions are disabled. This class cannot be
4342	+	* directly instantiated. See {@link #values},
4343	+	*
4344	+	* <p>The view's {@code iterator} is a "weakly consistent" iterator
4345	+	* that will never throw {@link ConcurrentModificationException},
4346	+	* and guarantees to traverse elements as they existed upon
4347	+	* construction of the iterator, and may (but is not guaranteed to)
4348	+	* reflect any modifications subsequent to construction.
4349	+	*/
4350	+	public static final class ValuesView<K,V> extends CHMView<K,V>
4351	+	implements Collection<V> {
4352	+	ValuesView(ConcurrentHashMapV8<K, V> map)   { super(map); }
4353	+	public final boolean contains(Object o) { return map.containsValue(o); }
4354	+	public final boolean remove(Object o) {
4355	+	if (o != null) {
4356	+	Iterator<V> it = new ValueIterator<K,V>(map);
4357	+	while (it.hasNext()) {
4358	+	if (o.equals(it.next())) {
4359	+	it.remove();
4360	+	return true;
4361	+	}
4362	+	}
4363	+	}
4364	+	return false;
4365	+	}
4366	+
4367	+	/**
4368	+	* Returns a "weakly consistent" iterator that will never
4369	+	* throw {@link ConcurrentModificationException}, and
4370	+	* guarantees to traverse elements as they existed upon
4371	+	* construction of the iterator, and may (but is not
4372	+	* guaranteed to) reflect any modifications subsequent to
4373	+	* construction.
4374	+	*
4375	+	* @return an iterator over the values of this map
4376	+	*/
4377	+	public final Iterator<V> iterator() {
4378	+	return new ValueIterator<K,V>(map);
4379	+	}
4380	+	public final boolean add(V e) {
4381	+	throw new UnsupportedOperationException();
4382	+	}
4383	+	public final boolean addAll(Collection<? extends V> c) {
4384	+	throw new UnsupportedOperationException();
4385	+	}
4386	+
4387	+	/**
4388	+	* Performs the given action for each value.
4389	+	*
4390	+	* @param action the action
4391	+	*/
4392	+	public void forEach(Action<V> action) {
4393	+	ForkJoinTasks.forEachValue
4394	+	(map, action).invoke();
4395	+	}
4396	+
4397	+	/**
4398	+	* Performs the given action for each non-null transformation
4399	+	* of each value.
4400	+	*
4401	+	* @param transformer a function returning the transformation
4402	+	* for an element, or null of there is no transformation (in
4403	+	* which case the action is not applied).
4404	+	*/
4405	+	public <U> void forEach(Fun<? super V, ? extends U> transformer,
4406	+	Action<U> action) {
4407	+	ForkJoinTasks.forEachValue
4408	+	(map, transformer, action).invoke();
4409	+	}
4410	+
4411	+	/**
4412	+	* Returns a non-null result from applying the given search
4413	+	* function on each value, or null if none.  Upon success,
4414	+	* further element processing is suppressed and the results of
4415	+	* any other parallel invocations of the search function are
4416	+	* ignored.
4417	+	*
4418	+	* @param searchFunction a function returning a non-null
4419	+	* result on success, else null
4420	+	* @return a non-null result from applying the given search
4421	+	* function on each value, or null if none
4422	+	*
4423	+	*/
4424	+	public <U> U search(Fun<? super V, ? extends U> searchFunction) {
4425	+	return ForkJoinTasks.searchValues
4426	+	(map, searchFunction).invoke();
4427	+	}
4428	+
4429	+	/**
4430	+	* Returns the result of accumulating all values using the
4431	+	* given reducer to combine values, or null if none.
4432	+	*
4433	+	* @param reducer a commutative associative combining function
4434	+	* @return  the result of accumulating all values
4435	+	*/
4436	+	public V reduce(BiFun<? super V, ? super V, ? extends V> reducer) {
4437	+	return ForkJoinTasks.reduceValues
4438	+	(map, reducer).invoke();
4439	+	}
4440	+
4441	+	/**
4442	+	* Returns the result of accumulating the given transformation
4443	+	* of all values using the given reducer to combine values, or
4444	+	* null if none.
4445	+	*
4446	+	* @param transformer a function returning the transformation
4447	+	* for an element, or null of there is no transformation (in
4448	+	* which case it is not combined).
4449	+	* @param reducer a commutative associative combining function
4450	+	* @return the result of accumulating the given transformation
4451	+	* of all values
4452	+	*/
4453	+	public <U> U reduce(Fun<? super V, ? extends U> transformer,
4454	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4455	+	return ForkJoinTasks.reduceValues
4456	+	(map, transformer, reducer).invoke();
4457	+	}
4458	+
4459	+	/**
4460	+	* Returns the result of accumulating the given transformation
4461	+	* of all values using the given reducer to combine values,
4462	+	* and the given basis as an identity value.
4463	+	*
4464	+	* @param transformer a function returning the transformation
4465	+	* for an element
4466	+	* @param basis the identity (initial default value) for the reduction
4467	+	* @param reducer a commutative associative combining function
4468	+	* @return the result of accumulating the given transformation
4469	+	* of all values
4470	+	*/
4471	+	public double reduceToDouble(ObjectToDouble<? super V> transformer,
4472	+	double basis,
4473	+	DoubleByDoubleToDouble reducer) {
4474	+	return ForkJoinTasks.reduceValuesToDouble
4475	+	(map, transformer, basis, reducer).invoke();
4476	+	}
4477	+
4478	+	/**
4479	+	* Returns the result of accumulating the given transformation
4480	+	* of all values using the given reducer to combine values,
4481	+	* and the given basis as an identity value.
4482	+	*
4483	+	* @param transformer a function returning the transformation
4484	+	* for an element
4485	+	* @param basis the identity (initial default value) for the reduction
4486	+	* @param reducer a commutative associative combining function
4487	+	* @return the result of accumulating the given transformation
4488	+	* of all values
4489	+	*/
4490	+	public long reduceToLong(ObjectToLong<? super V> transformer,
4491	+	long basis,
4492	+	LongByLongToLong reducer) {
4493	+	return ForkJoinTasks.reduceValuesToLong
4494	+	(map, transformer, basis, reducer).invoke();
4495	+	}
4496	+
4497	+	/**
4498	+	* Returns the result of accumulating the given transformation
4499	+	* of all values using the given reducer to combine values,
4500	+	* and the given basis as an identity value.
4501	+	*
4502	+	* @param transformer a function returning the transformation
4503	+	* for an element
4504	+	* @param basis the identity (initial default value) for the reduction
4505	+	* @param reducer a commutative associative combining function
4506	+	* @return the result of accumulating the given transformation
4507	+	* of all values
4508	+	*/
4509	+	public int reduceToInt(ObjectToInt<? super V> transformer,
4510	+	int basis,
4511	+	IntByIntToInt reducer) {
4512	+	return ForkJoinTasks.reduceValuesToInt
4513	+	(map, transformer, basis, reducer).invoke();
4514	+	}
4515	+
4516	+	}
4517	+
4518	+	/**
4519	+	* A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value)
4520	+	* entries.  This class cannot be directly instantiated. See
4521	+	* {@link #entrySet}.
4522	+	*/
4523	+	public static final class EntrySetView<K,V> extends CHMView<K,V>
4524	+	implements Set<Map.Entry<K,V>> {
4525	+	EntrySetView(ConcurrentHashMapV8<K, V> map) { super(map); }
4526	+	public final boolean contains(Object o) {
4527	+	Object k, v, r; Map.Entry<?,?> e;
4528	+	return ((o instanceof Map.Entry) &&
4529	+	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4530	+	(r = map.get(k)) != null &&
4531	+	(v = e.getValue()) != null &&
4532	+	(v == r || v.equals(r)));
4533	+	}
4534	+	public final boolean remove(Object o) {
4535	+	Object k, v; Map.Entry<?,?> e;
4536	+	return ((o instanceof Map.Entry) &&
4537	+	(k = (e = (Map.Entry<?,?>)o).getKey()) != null &&
4538	+	(v = e.getValue()) != null &&
4539	+	map.remove(k, v));
4540	+	}
4541	+
4542	+	/**
4543	+	* Returns a "weakly consistent" iterator that will never
4544	+	* throw {@link ConcurrentModificationException}, and
4545	+	* guarantees to traverse elements as they existed upon
4546	+	* construction of the iterator, and may (but is not
4547	+	* guaranteed to) reflect any modifications subsequent to
4548	+	* construction.
4549	+	*
4550	+	* @return an iterator over the entries of this map
4551	+	*/
4552	+	public final Iterator<Map.Entry<K,V>> iterator() {
4553	+	return new EntryIterator<K,V>(map);
4554	+	}
4555	+
4556	+	public final boolean add(Entry<K,V> e) {
4557	+	K key = e.getKey();
4558	+	V value = e.getValue();
4559	+	if (key == null || value == null)
4560	+	throw new NullPointerException();
4561	+	return map.internalPut(key, value) == null;
4562	+	}
4563	+	public final boolean addAll(Collection<? extends Entry<K,V>> c) {
4564	+	boolean added = false;
4565	+	for (Entry<K,V> e : c) {
4566	+	if (add(e))
4567	+	added = true;
4568	+	}
4569	+	return added;
4570	+	}
4571	+	public boolean equals(Object o) {
4572	+	Set<?> c;
4573	+	return ((o instanceof Set) &&
4574	+	((c = (Set<?>)o) == this ||
4575	+	(containsAll(c) && c.containsAll(this))));
4576	+	}
4577	+
4578	+	/**
4579	+	* Performs the given action for each entry.
4580	+	*
4581	+	* @param action the action
4582	+	*/
4583	+	public void forEach(Action<Map.Entry<K,V>> action) {
4584	+	ForkJoinTasks.forEachEntry
4585	+	(map, action).invoke();
4586	+	}
4587	+
4588	+	/**
4589	+	* Performs the given action for each non-null transformation
4590	+	* of each entry.
4591	+	*
4592	+	* @param transformer a function returning the transformation
4593	+	* for an element, or null of there is no transformation (in
4594	+	* which case the action is not applied).
4595	+	* @param action the action
4596	+	*/
4597	+	public <U> void forEach(Fun<Map.Entry<K,V>, ? extends U> transformer,
4598	+	Action<U> action) {
4599	+	ForkJoinTasks.forEachEntry
4600	+	(map, transformer, action).invoke();
4601	+	}
4602	+
4603	+	/**
4604	+	* Returns a non-null result from applying the given search
4605	+	* function on each entry, or null if none.  Upon success,
4606	+	* further element processing is suppressed and the results of
4607	+	* any other parallel invocations of the search function are
4608	+	* ignored.
4609	+	*
4610	+	* @param searchFunction a function returning a non-null
4611	+	* result on success, else null
4612	+	* @return a non-null result from applying the given search
4613	+	* function on each entry, or null if none
4614	+	*/
4615	+	public <U> U search(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4616	+	return ForkJoinTasks.searchEntries
4617	+	(map, searchFunction).invoke();
4618	+	}
4619	+
4620	+	/**
4621	+	* Returns the result of accumulating all entries using the
4622	+	* given reducer to combine values, or null if none.
4623	+	*
4624	+	* @param reducer a commutative associative combining function
4625	+	* @return the result of accumulating all entries
4626	+	*/
4627	+	public Map.Entry<K,V> reduce(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4628	+	return ForkJoinTasks.reduceEntries
4629	+	(map, reducer).invoke();
4630	+	}
4631	+
4632	+	/**
4633	+	* Returns the result of accumulating the given transformation
4634	+	* of all entries using the given reducer to combine values,
4635	+	* or null if none.
4636	+	*
4637	+	* @param transformer a function returning the transformation
4638	+	* for an element, or null of there is no transformation (in
4639	+	* which case it is not combined).
4640	+	* @param reducer a commutative associative combining function
4641	+	* @return the result of accumulating the given transformation
4642	+	* of all entries
4643	+	*/
4644	+	public <U> U reduce(Fun<Map.Entry<K,V>, ? extends U> transformer,
4645	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4646	+	return ForkJoinTasks.reduceEntries
4647	+	(map, transformer, reducer).invoke();
4648	+	}
4649	+
4650	+	/**
4651	+	* Returns the result of accumulating the given transformation
4652	+	* of all entries using the given reducer to combine values,
4653	+	* and the given basis as an identity value.
4654	+	*
4655	+	* @param transformer a function returning the transformation
4656	+	* for an element
4657	+	* @param basis the identity (initial default value) for the reduction
4658	+	* @param reducer a commutative associative combining function
4659	+	* @return the result of accumulating the given transformation
4660	+	* of all entries
4661	+	*/
4662	+	public double reduceToDouble(ObjectToDouble<Map.Entry<K,V>> transformer,
4663	+	double basis,
4664	+	DoubleByDoubleToDouble reducer) {
4665	+	return ForkJoinTasks.reduceEntriesToDouble
4666	+	(map, transformer, basis, reducer).invoke();
4667	+	}
4668	+
4669	+	/**
4670	+	* Returns the result of accumulating the given transformation
4671	+	* of all entries using the given reducer to combine values,
4672	+	* and the given basis as an identity value.
4673	+	*
4674	+	* @param transformer a function returning the transformation
4675	+	* for an element
4676	+	* @param basis the identity (initial default value) for the reduction
4677	+	* @param reducer a commutative associative combining function
4678	+	* @return  the result of accumulating the given transformation
4679	+	* of all entries
4680	+	*/
4681	+	public long reduceToLong(ObjectToLong<Map.Entry<K,V>> transformer,
4682	+	long basis,
4683	+	LongByLongToLong reducer) {
4684	+	return ForkJoinTasks.reduceEntriesToLong
4685	+	(map, transformer, basis, reducer).invoke();
4686	+	}
4687	+
4688	+	/**
4689	+	* Returns the result of accumulating the given transformation
4690	+	* of all entries using the given reducer to combine values,
4691	+	* and the given basis as an identity value.
4692	+	*
4693	+	* @param transformer a function returning the transformation
4694	+	* for an element
4695	+	* @param basis the identity (initial default value) for the reduction
4696	+	* @param reducer a commutative associative combining function
4697	+	* @return the result of accumulating the given transformation
4698	+	* of all entries
4699	+	*/
4700	+	public int reduceToInt(ObjectToInt<Map.Entry<K,V>> transformer,
4701	+	int basis,
4702	+	IntByIntToInt reducer) {
4703	+	return ForkJoinTasks.reduceEntriesToInt
4704	+	(map, transformer, basis, reducer).invoke();
4705	+	}
4706	+
4707	+	}
4708	+
4709		// ---------------------------------------------------------------------
4710
4711		/**
#	Line 4246 | Line 4732 | public class ConcurrentHashMapV8<K, V>
4732		(ConcurrentHashMapV8<K,V> map,
4733		BiAction<K,V> action) {
4734		if (action == null) throw new NullPointerException();
4735	<	return new ForEachMappingTask<K,V>(map, null, -1, null, action);
4735	>	return new ForEachMappingTask<K,V>(map, null, -1, action);
4736		}
4737
4738		/**
#	Line 4267 | Line 4753 | public class ConcurrentHashMapV8<K, V>
4753		if (transformer == null || action == null)
4754		throw new NullPointerException();
4755		return new ForEachTransformedMappingTask<K,V,U>
4756	<	(map, null, -1, null, transformer, action);
4756	>	(map, null, -1, transformer, action);
4757		}
4758
4759		/**
#	Line 4287 | Line 4773 | public class ConcurrentHashMapV8<K, V>
4773		BiFun<? super K, ? super V, ? extends U> searchFunction) {
4774		if (searchFunction == null) throw new NullPointerException();
4775		return new SearchMappingsTask<K,V,U>
4776	<	(map, null, -1, null, searchFunction,
4776	>	(map, null, -1, searchFunction,
4777		new AtomicReference<U>());
4778		}
4779
#	Line 4396 | Line 4882 | public class ConcurrentHashMapV8<K, V>
4882		(ConcurrentHashMapV8<K,V> map,
4883		Action<K> action) {
4884		if (action == null) throw new NullPointerException();
4885	<	return new ForEachKeyTask<K,V>(map, null, -1, null, action);
4885	>	return new ForEachKeyTask<K,V>(map, null, -1, action);
4886		}
4887
4888		/**
#	Line 4417 | Line 4903 | public class ConcurrentHashMapV8<K, V>
4903		if (transformer == null || action == null)
4904		throw new NullPointerException();
4905		return new ForEachTransformedKeyTask<K,V,U>
4906	<	(map, null, -1, null, transformer, action);
4906	>	(map, null, -1, transformer, action);
4907		}
4908
4909		/**
#	Line 4437 | Line 4923 | public class ConcurrentHashMapV8<K, V>
4923		Fun<? super K, ? extends U> searchFunction) {
4924		if (searchFunction == null) throw new NullPointerException();
4925		return new SearchKeysTask<K,V,U>
4926	<	(map, null, -1, null, searchFunction,
4926	>	(map, null, -1, searchFunction,
4927		new AtomicReference<U>());
4928		}
4929
#	Line 4563 | Line 5049 | public class ConcurrentHashMapV8<K, V>
5049		(ConcurrentHashMapV8<K,V> map,
5050		Action<V> action) {
5051		if (action == null) throw new NullPointerException();
5052	<	return new ForEachValueTask<K,V>(map, null, -1, null, action);
5052	>	return new ForEachValueTask<K,V>(map, null, -1, action);
5053		}
5054
5055		/**
#	Line 4583 | Line 5069 | public class ConcurrentHashMapV8<K, V>
5069		if (transformer == null || action == null)
5070		throw new NullPointerException();
5071		return new ForEachTransformedValueTask<K,V,U>
5072	<	(map, null, -1, null, transformer, action);
5072	>	(map, null, -1, transformer, action);
5073		}
5074
5075		/**
#	Line 4603 | Line 5089 | public class ConcurrentHashMapV8<K, V>
5089		Fun<? super V, ? extends U> searchFunction) {
5090		if (searchFunction == null) throw new NullPointerException();
5091		return new SearchValuesTask<K,V,U>
5092	<	(map, null, -1, null, searchFunction,
5092	>	(map, null, -1, searchFunction,
5093		new AtomicReference<U>());
5094		}
5095
#	Line 4729 | Line 5215 | public class ConcurrentHashMapV8<K, V>
5215		(ConcurrentHashMapV8<K,V> map,
5216		Action<Map.Entry<K,V>> action) {
5217		if (action == null) throw new NullPointerException();
5218	<	return new ForEachEntryTask<K,V>(map, null, -1, null, action);
5218	>	return new ForEachEntryTask<K,V>(map, null, -1, action);
5219		}
5220
5221		/**
#	Line 4749 | Line 5235 | public class ConcurrentHashMapV8<K, V>
5235		if (transformer == null || action == null)
5236		throw new NullPointerException();
5237		return new ForEachTransformedEntryTask<K,V,U>
5238	<	(map, null, -1, null, transformer, action);
5238	>	(map, null, -1, transformer, action);
5239		}
5240
5241		/**
#	Line 4769 | Line 5255 | public class ConcurrentHashMapV8<K, V>
5255		Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
5256		if (searchFunction == null) throw new NullPointerException();
5257		return new SearchEntriesTask<K,V,U>
5258	<	(map, null, -1, null, searchFunction,
5258	>	(map, null, -1, searchFunction,
5259		new AtomicReference<U>());
5260		}
5261
#	Line 4887 | Line 5373 | public class ConcurrentHashMapV8<K, V>
5373
5374		// -------------------------------------------------------
5375
4890	–	/**
4891	–	* Base for FJ tasks for bulk operations. This adds a variant of
4892	–	* CountedCompleters and some split and merge bookkeeping to
4893	–	* iterator functionality. The forEach and reduce methods are
4894	–	* similar to those illustrated in CountedCompleter documentation,
4895	–	* except that bottom-up reduction completions perform them within
4896	–	* their compute methods. The search methods are like forEach
4897	–	* except they continually poll for success and exit early.  Also,
4898	–	* exceptions are handled in a simpler manner, by just trying to
4899	–	* complete root task exceptionally.
4900	–	*/
4901	–	@SuppressWarnings("serial") static abstract class BulkTask<K,V,R> extends Traverser<K,V,R> {
4902	–	final BulkTask<K,V,?> parent;  // completion target
4903	–	int batch;                     // split control; -1 for unknown
4904	–	int pending;                   // completion control
4905	–
4906	–	BulkTask(ConcurrentHashMapV8<K,V> map, BulkTask<K,V,?> parent,
4907	–	int batch) {
4908	–	super(map);
4909	–	this.parent = parent;
4910	–	this.batch = batch;
4911	–	if (parent != null && map != null) { // split parent
4912	–	Node[] t;
4913	–	if ((t = parent.tab) == null &&
4914	–	(t = parent.tab = map.table) != null)
4915	–	parent.baseLimit = parent.baseSize = t.length;
4916	–	this.tab = t;
4917	–	this.baseSize = parent.baseSize;
4918	–	int hi = this.baseLimit = parent.baseLimit;
4919	–	parent.baseLimit = this.index = this.baseIndex =
4920	–	(hi + parent.baseIndex + 1) >>> 1;
4921	–	}
4922	–	}
4923	–
4924	–	/**
4925	–	* Forces root task to complete.
4926	–	* @param ex if null, complete normally, else exceptionally
4927	–	* @return false to simplify use
4928	–	*/
4929	–	final boolean tryCompleteComputation(Throwable ex) {
4930	–	for (BulkTask<K,V,?> a = this;;) {
4931	–	BulkTask<K,V,?> p = a.parent;
4932	–	if (p == null) {
4933	–	if (ex != null)
4934	–	a.completeExceptionally(ex);
4935	–	else
4936	–	a.quietlyComplete();
4937	–	return false;
4938	–	}
4939	–	a = p;
4940	–	}
4941	–	}
4942	–
4943	–	/**
4944	–	* Version of tryCompleteComputation for function screening checks
4945	–	*/
4946	–	final boolean abortOnNullFunction() {
4947	–	return tryCompleteComputation(new Error("Unexpected null function"));
4948	–	}
4949	–
4950	–	// utilities
4951	–
4952	–	/** CompareAndSet pending count */
4953	–	final boolean casPending(int cmp, int val) {
4954	–	return U.compareAndSwapInt(this, PENDING, cmp, val);
4955	–	}
4956	–
4957	–	/**
4958	–	* Returns approx exp2 of the number of times (minus one) to
4959	–	* split task by two before executing leaf action. This value
4960	–	* is faster to compute and more convenient to use as a guide
4961	–	* to splitting than is the depth, since it is used while
4962	–	* dividing by two anyway.
4963	–	*/
4964	–	final int batch() {
4965	–	ConcurrentHashMapV8<K, V> m; int b; Node[] t;  ForkJoinPool pool;
4966	–	if ((b = batch) < 0 && (m = map) != null) { // force initialization
4967	–	if ((t = tab) == null && (t = tab = m.table) != null)
4968	–	baseLimit = baseSize = t.length;
4969	–	if (t != null) {
4970	–	long n = m.counter.sum();
4971	–	int par = ((pool = getPool()) == null) ?
4972	–	ForkJoinPool.getCommonPoolParallelism() :
4973	–	pool.getParallelism();
4974	–	int sp = par << 3; // slack of 8
4975	–	b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
4976	–	}
4977	–	}
4978	–	return b;
4979	–	}
4980	–
4981	–	/**
4982	–	* Returns exportable snapshot entry.
4983	–	*/
4984	–	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
4985	–	return new AbstractMap.SimpleEntry<K,V>(k, v);
4986	–	}
4987	–
4988	–	// Unsafe mechanics
4989	–	private static final sun.misc.Unsafe U;
4990	–	private static final long PENDING;
4991	–	static {
4992	–	try {
4993	–	U = getUnsafe();
4994	–	PENDING = U.objectFieldOffset
4995	–	(BulkTask.class.getDeclaredField("pending"));
4996	–	} catch (Exception e) {
4997	–	throw new Error(e);
4998	–	}
4999	–	}
5000	–	}
5001	–
5002	–	/**
5003	–	* Base class for non-reductive actions
5004	–	*/
5005	–	@SuppressWarnings("serial") static abstract class BulkAction<K,V,R> extends BulkTask<K,V,R> {
5006	–	BulkAction<K,V,?> nextTask;
5007	–	BulkAction(ConcurrentHashMapV8<K,V> map, BulkTask<K,V,?> parent,
5008	–	int batch, BulkAction<K,V,?> nextTask) {
5009	–	super(map, parent, batch);
5010	–	this.nextTask = nextTask;
5011	–	}
5012	–
5013	–	/**
5014	–	* Try to complete task and upward parents. Upon hitting
5015	–	* non-completed parent, if a non-FJ task, try to help out the
5016	–	* computation.
5017	–	*/
5018	–	final void tryComplete(BulkAction<K,V,?> subtasks) {
5019	–	BulkTask<K,V,?> a = this, s = a;
5020	–	for (int c;;) {
5021	–	if ((c = a.pending) == 0) {
5022	–	if ((a = (s = a).parent) == null) {
5023	–	s.quietlyComplete();
5024	–	break;
5025	–	}
5026	–	}
5027	–	else if (a.casPending(c, c - 1)) {
5028	–	if (subtasks != null && !inForkJoinPool()) {
5029	–	while ((s = a.parent) != null)
5030	–	a = s;
5031	–	while (!a.isDone()) {
5032	–	BulkAction<K,V,?> next = subtasks.nextTask;
5033	–	if (subtasks.tryUnfork())
5034	–	subtasks.exec();
5035	–	if ((subtasks = next) == null)
5036	–	break;
5037	–	}
5038	–	}
5039	–	break;
5040	–	}
5041	–	}
5042	–	}
5043	–
5044	–	}
5045	–
5376		/*
5377		* Task classes. Coded in a regular but ugly format/style to
5378		* simplify checks that each variant differs in the right way from
#	Line 5050 | Line 5380 | public class ConcurrentHashMapV8<K, V>
5380		*/
5381
5382		@SuppressWarnings("serial") static final class ForEachKeyTask<K,V>
5383	<	extends BulkAction<K,V,Void> {
5383	>	extends Traverser<K,V,Void> {
5384		final Action<K> action;
5385		ForEachKeyTask
5386	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5057	<	ForEachKeyTask<K,V> nextTask,
5386	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5387		Action<K> action) {
5388	<	super(m, p, b, nextTask);
5388	>	super(m, p, b);
5389		this.action = action;
5390		}
5391	<	@SuppressWarnings("unchecked") public final boolean exec() {
5392	<	final Action<K> action = this.action;
5393	<	if (action == null)
5394	<	return abortOnNullFunction();
5395	<	ForEachKeyTask<K,V> subtasks = null;
5396	<	try {
5397	<	int b = batch(), c;
5398	<	while (b > 1 && baseIndex != baseLimit) {
5399	<	do {} while (!casPending(c = pending, c+1));
5071	<	(subtasks = new ForEachKeyTask<K,V>
5072	<	(map, this, b >>>= 1, subtasks, action)).fork();
5073	<	}
5074	<	while (advance() != null)
5075	<	action.apply((K)nextKey);
5076	<	} catch (Throwable ex) {
5077	<	return tryCompleteComputation(ex);
5078	<	}
5079	<	tryComplete(subtasks);
5080	<	return false;
5391	>	@SuppressWarnings("unchecked") public final void compute() {
5392	>	final Action<K> action;
5393	>	if ((action = this.action) == null)
5394	>	throw new NullPointerException();
5395	>	for (int b; (b = preSplit()) > 0;)
5396	>	new ForEachKeyTask<K,V>(map, this, b, action).fork();
5397	>	while (advance() != null)
5398	>	action.apply((K)nextKey);
5399	>	propagateCompletion();
5400		}
5401		}
5402
5403		@SuppressWarnings("serial") static final class ForEachValueTask<K,V>
5404	<	extends BulkAction<K,V,Void> {
5404	>	extends Traverser<K,V,Void> {
5405		final Action<V> action;
5406		ForEachValueTask
5407	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5089	<	ForEachValueTask<K,V> nextTask,
5407	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5408		Action<V> action) {
5409	<	super(m, p, b, nextTask);
5409	>	super(m, p, b);
5410		this.action = action;
5411		}
5412	<	@SuppressWarnings("unchecked") public final boolean exec() {
5413	<	final Action<V> action = this.action;
5414	<	if (action == null)
5415	<	return abortOnNullFunction();
5416	<	ForEachValueTask<K,V> subtasks = null;
5417	<	try {
5418	<	int b = batch(), c;
5419	<	while (b > 1 && baseIndex != baseLimit) {
5420	<	do {} while (!casPending(c = pending, c+1));
5421	<	(subtasks = new ForEachValueTask<K,V>
5104	<	(map, this, b >>>= 1, subtasks, action)).fork();
5105	<	}
5106	<	Object v;
5107	<	while ((v = advance()) != null)
5108	<	action.apply((V)v);
5109	<	} catch (Throwable ex) {
5110	<	return tryCompleteComputation(ex);
5111	<	}
5112	<	tryComplete(subtasks);
5113	<	return false;
5412	>	@SuppressWarnings("unchecked") public final void compute() {
5413	>	final Action<V> action;
5414	>	if ((action = this.action) == null)
5415	>	throw new NullPointerException();
5416	>	for (int b; (b = preSplit()) > 0;)
5417	>	new ForEachValueTask<K,V>(map, this, b, action).fork();
5418	>	Object v;
5419	>	while ((v = advance()) != null)
5420	>	action.apply((V)v);
5421	>	propagateCompletion();
5422		}
5423		}
5424
5425		@SuppressWarnings("serial") static final class ForEachEntryTask<K,V>
5426	<	extends BulkAction<K,V,Void> {
5426	>	extends Traverser<K,V,Void> {
5427		final Action<Entry<K,V>> action;
5428		ForEachEntryTask
5429	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5122	<	ForEachEntryTask<K,V> nextTask,
5429	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5430		Action<Entry<K,V>> action) {
5431	<	super(m, p, b, nextTask);
5431	>	super(m, p, b);
5432		this.action = action;
5433		}
5434	<	@SuppressWarnings("unchecked") public final boolean exec() {
5435	<	final Action<Entry<K,V>> action = this.action;
5436	<	if (action == null)
5437	<	return abortOnNullFunction();
5438	<	ForEachEntryTask<K,V> subtasks = null;
5439	<	try {
5440	<	int b = batch(), c;
5441	<	while (b > 1 && baseIndex != baseLimit) {
5442	<	do {} while (!casPending(c = pending, c+1));
5443	<	(subtasks = new ForEachEntryTask<K,V>
5137	<	(map, this, b >>>= 1, subtasks, action)).fork();
5138	<	}
5139	<	Object v;
5140	<	while ((v = advance()) != null)
5141	<	action.apply(entryFor((K)nextKey, (V)v));
5142	<	} catch (Throwable ex) {
5143	<	return tryCompleteComputation(ex);
5144	<	}
5145	<	tryComplete(subtasks);
5146	<	return false;
5434	>	@SuppressWarnings("unchecked") public final void compute() {
5435	>	final Action<Entry<K,V>> action;
5436	>	if ((action = this.action) == null)
5437	>	throw new NullPointerException();
5438	>	for (int b; (b = preSplit()) > 0;)
5439	>	new ForEachEntryTask<K,V>(map, this, b, action).fork();
5440	>	Object v;
5441	>	while ((v = advance()) != null)
5442	>	action.apply(entryFor((K)nextKey, (V)v));
5443	>	propagateCompletion();
5444		}
5445		}
5446
5447		@SuppressWarnings("serial") static final class ForEachMappingTask<K,V>
5448	<	extends BulkAction<K,V,Void> {
5448	>	extends Traverser<K,V,Void> {
5449		final BiAction<K,V> action;
5450		ForEachMappingTask
5451	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5155	<	ForEachMappingTask<K,V> nextTask,
5451	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5452		BiAction<K,V> action) {
5453	<	super(m, p, b, nextTask);
5453	>	super(m, p, b);
5454		this.action = action;
5455		}
5456	<	@SuppressWarnings("unchecked") public final boolean exec() {
5457	<	final BiAction<K,V> action = this.action;
5458	<	if (action == null)
5459	<	return abortOnNullFunction();
5460	<	ForEachMappingTask<K,V> subtasks = null;
5461	<	try {
5462	<	int b = batch(), c;
5463	<	while (b > 1 && baseIndex != baseLimit) {
5464	<	do {} while (!casPending(c = pending, c+1));
5465	<	(subtasks = new ForEachMappingTask<K,V>
5170	<	(map, this, b >>>= 1, subtasks, action)).fork();
5171	<	}
5172	<	Object v;
5173	<	while ((v = advance()) != null)
5174	<	action.apply((K)nextKey, (V)v);
5175	<	} catch (Throwable ex) {
5176	<	return tryCompleteComputation(ex);
5177	<	}
5178	<	tryComplete(subtasks);
5179	<	return false;
5456	>	@SuppressWarnings("unchecked") public final void compute() {
5457	>	final BiAction<K,V> action;
5458	>	if ((action = this.action) == null)
5459	>	throw new NullPointerException();
5460	>	for (int b; (b = preSplit()) > 0;)
5461	>	new ForEachMappingTask<K,V>(map, this, b, action).fork();
5462	>	Object v;
5463	>	while ((v = advance()) != null)
5464	>	action.apply((K)nextKey, (V)v);
5465	>	propagateCompletion();
5466		}
5467		}
5468
5469		@SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U>
5470	<	extends BulkAction<K,V,Void> {
5470	>	extends Traverser<K,V,Void> {
5471		final Fun<? super K, ? extends U> transformer;
5472		final Action<U> action;
5473		ForEachTransformedKeyTask
5474	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5475	<	ForEachTransformedKeyTask<K,V,U> nextTask,
5476	<	Fun<? super K, ? extends U> transformer,
5477	<	Action<U> action) {
5478	<	super(m, p, b, nextTask);
5479	<	this.transformer = transformer;
5480	<	this.action = action;
5481	<
5482	<	}
5483	<	@SuppressWarnings("unchecked") public final boolean exec() {
5484	<	final Fun<? super K, ? extends U> transformer =
5485	<	this.transformer;
5486	<	final Action<U> action = this.action;
5487	<	if (transformer == null || action == null)
5488	<	return abortOnNullFunction();
5489	<	ForEachTransformedKeyTask<K,V,U> subtasks = null;
5490	<	try {
5491	<	int b = batch(), c;
5206	<	while (b > 1 && baseIndex != baseLimit) {
5207	<	do {} while (!casPending(c = pending, c+1));
5208	<	(subtasks = new ForEachTransformedKeyTask<K,V,U>
5209	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5210	<	}
5211	<	U u;
5212	<	while (advance() != null) {
5213	<	if ((u = transformer.apply((K)nextKey)) != null)
5214	<	action.apply(u);
5215	<	}
5216	<	} catch (Throwable ex) {
5217	<	return tryCompleteComputation(ex);
5474	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5475	>	Fun<? super K, ? extends U> transformer, Action<U> action) {
5476	>	super(m, p, b);
5477	>	this.transformer = transformer; this.action = action;
5478	>	}
5479	>	@SuppressWarnings("unchecked") public final void compute() {
5480	>	final Fun<? super K, ? extends U> transformer;
5481	>	final Action<U> action;
5482	>	if ((transformer = this.transformer) == null ||
5483	>	(action = this.action) == null)
5484	>	throw new NullPointerException();
5485	>	for (int b; (b = preSplit()) > 0;)
5486	>	new ForEachTransformedKeyTask<K,V,U>
5487	>	(map, this, b, transformer, action).fork();
5488	>	U u;
5489	>	while (advance() != null) {
5490	>	if ((u = transformer.apply((K)nextKey)) != null)
5491	>	action.apply(u);
5492		}
5493	<	tryComplete(subtasks);
5220	<	return false;
5493	>	propagateCompletion();
5494		}
5495		}
5496
5497		@SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U>
5498	<	extends BulkAction<K,V,Void> {
5498	>	extends Traverser<K,V,Void> {
5499		final Fun<? super V, ? extends U> transformer;
5500		final Action<U> action;
5501		ForEachTransformedValueTask
5502	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5503	<	ForEachTransformedValueTask<K,V,U> nextTask,
5504	<	Fun<? super V, ? extends U> transformer,
5505	<	Action<U> action) {
5506	<	super(m, p, b, nextTask);
5507	<	this.transformer = transformer;
5508	<	this.action = action;
5509	<
5510	<	}
5511	<	@SuppressWarnings("unchecked") public final boolean exec() {
5512	<	final Fun<? super V, ? extends U> transformer =
5513	<	this.transformer;
5514	<	final Action<U> action = this.action;
5515	<	if (transformer == null || action == null)
5516	<	return abortOnNullFunction();
5517	<	ForEachTransformedValueTask<K,V,U> subtasks = null;
5518	<	try {
5519	<	int b = batch(), c;
5247	<	while (b > 1 && baseIndex != baseLimit) {
5248	<	do {} while (!casPending(c = pending, c+1));
5249	<	(subtasks = new ForEachTransformedValueTask<K,V,U>
5250	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5251	<	}
5252	<	Object v; U u;
5253	<	while ((v = advance()) != null) {
5254	<	if ((u = transformer.apply((V)v)) != null)
5255	<	action.apply(u);
5256	<	}
5257	<	} catch (Throwable ex) {
5258	<	return tryCompleteComputation(ex);
5502	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5503	>	Fun<? super V, ? extends U> transformer, Action<U> action) {
5504	>	super(m, p, b);
5505	>	this.transformer = transformer; this.action = action;
5506	>	}
5507	>	@SuppressWarnings("unchecked") public final void compute() {
5508	>	final Fun<? super V, ? extends U> transformer;
5509	>	final Action<U> action;
5510	>	if ((transformer = this.transformer) == null ||
5511	>	(action = this.action) == null)
5512	>	throw new NullPointerException();
5513	>	for (int b; (b = preSplit()) > 0;)
5514	>	new ForEachTransformedValueTask<K,V,U>
5515	>	(map, this, b, transformer, action).fork();
5516	>	Object v; U u;
5517	>	while ((v = advance()) != null) {
5518	>	if ((u = transformer.apply((V)v)) != null)
5519	>	action.apply(u);
5520		}
5521	<	tryComplete(subtasks);
5261	<	return false;
5521	>	propagateCompletion();
5522		}
5523		}
5524
5525		@SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U>
5526	<	extends BulkAction<K,V,Void> {
5526	>	extends Traverser<K,V,Void> {
5527		final Fun<Map.Entry<K,V>, ? extends U> transformer;
5528		final Action<U> action;
5529		ForEachTransformedEntryTask
5530	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5531	<	ForEachTransformedEntryTask<K,V,U> nextTask,
5532	<	Fun<Map.Entry<K,V>, ? extends U> transformer,
5533	<	Action<U> action) {
5534	<	super(m, p, b, nextTask);
5535	<	this.transformer = transformer;
5536	<	this.action = action;
5537	<
5538	<	}
5539	<	@SuppressWarnings("unchecked") public final boolean exec() {
5540	<	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5541	<	this.transformer;
5542	<	final Action<U> action = this.action;
5543	<	if (transformer == null || action == null)
5544	<	return abortOnNullFunction();
5545	<	ForEachTransformedEntryTask<K,V,U> subtasks = null;
5546	<	try {
5547	<	int b = batch(), c;
5288	<	while (b > 1 && baseIndex != baseLimit) {
5289	<	do {} while (!casPending(c = pending, c+1));
5290	<	(subtasks = new ForEachTransformedEntryTask<K,V,U>
5291	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5292	<	}
5293	<	Object v; U u;
5294	<	while ((v = advance()) != null) {
5295	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5296	<	action.apply(u);
5297	<	}
5298	<	} catch (Throwable ex) {
5299	<	return tryCompleteComputation(ex);
5530	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5531	>	Fun<Map.Entry<K,V>, ? extends U> transformer, Action<U> action) {
5532	>	super(m, p, b);
5533	>	this.transformer = transformer; this.action = action;
5534	>	}
5535	>	@SuppressWarnings("unchecked") public final void compute() {
5536	>	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5537	>	final Action<U> action;
5538	>	if ((transformer = this.transformer) == null ||
5539	>	(action = this.action) == null)
5540	>	throw new NullPointerException();
5541	>	for (int b; (b = preSplit()) > 0;)
5542	>	new ForEachTransformedEntryTask<K,V,U>
5543	>	(map, this, b, transformer, action).fork();
5544	>	Object v; U u;
5545	>	while ((v = advance()) != null) {
5546	>	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5547	>	action.apply(u);
5548		}
5549	<	tryComplete(subtasks);
5302	<	return false;
5549	>	propagateCompletion();
5550		}
5551		}
5552
5553		@SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U>
5554	<	extends BulkAction<K,V,Void> {
5554	>	extends Traverser<K,V,Void> {
5555		final BiFun<? super K, ? super V, ? extends U> transformer;
5556		final Action<U> action;
5557		ForEachTransformedMappingTask
5558	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5312	<	ForEachTransformedMappingTask<K,V,U> nextTask,
5558	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5559		BiFun<? super K, ? super V, ? extends U> transformer,
5560		Action<U> action) {
5561	<	super(m, p, b, nextTask);
5562	<	this.transformer = transformer;
5317	<	this.action = action;
5318	<
5561	>	super(m, p, b);
5562	>	this.transformer = transformer; this.action = action;
5563		}
5564	<	@SuppressWarnings("unchecked") public final boolean exec() {
5565	<	final BiFun<? super K, ? super V, ? extends U> transformer =
5566	<	this.transformer;
5567	<	final Action<U> action = this.action;
5568	<	if (transformer == null || action == null)
5569	<	return abortOnNullFunction();
5570	<	ForEachTransformedMappingTask<K,V,U> subtasks = null;
5571	<	try {
5572	<	int b = batch(), c;
5573	<	while (b > 1 && baseIndex != baseLimit) {
5574	<	do {} while (!casPending(c = pending, c+1));
5575	<	(subtasks = new ForEachTransformedMappingTask<K,V,U>
5576	<	(map, this, b >>>= 1, subtasks, transformer, action)).fork();
5333	<	}
5334	<	Object v; U u;
5335	<	while ((v = advance()) != null) {
5336	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5337	<	action.apply(u);
5338	<	}
5339	<	} catch (Throwable ex) {
5340	<	return tryCompleteComputation(ex);
5564	>	@SuppressWarnings("unchecked") public final void compute() {
5565	>	final BiFun<? super K, ? super V, ? extends U> transformer;
5566	>	final Action<U> action;
5567	>	if ((transformer = this.transformer) == null ||
5568	>	(action = this.action) == null)
5569	>	throw new NullPointerException();
5570	>	for (int b; (b = preSplit()) > 0;)
5571	>	new ForEachTransformedMappingTask<K,V,U>
5572	>	(map, this, b, transformer, action).fork();
5573	>	Object v; U u;
5574	>	while ((v = advance()) != null) {
5575	>	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5576	>	action.apply(u);
5577		}
5578	<	tryComplete(subtasks);
5343	<	return false;
5578	>	propagateCompletion();
5579		}
5580		}
5581
5582		@SuppressWarnings("serial") static final class SearchKeysTask<K,V,U>
5583	<	extends BulkAction<K,V,U> {
5583	>	extends Traverser<K,V,U> {
5584		final Fun<? super K, ? extends U> searchFunction;
5585		final AtomicReference<U> result;
5586		SearchKeysTask
5587	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5353	<	SearchKeysTask<K,V,U> nextTask,
5587	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5588		Fun<? super K, ? extends U> searchFunction,
5589		AtomicReference<U> result) {
5590	<	super(m, p, b, nextTask);
5590	>	super(m, p, b);
5591		this.searchFunction = searchFunction; this.result = result;
5592		}
5593	<	@SuppressWarnings("unchecked") public final boolean exec() {
5594	<	AtomicReference<U> result = this.result;
5595	<	final Fun<? super K, ? extends U> searchFunction =
5596	<	this.searchFunction;
5597	<	if (searchFunction == null || result == null)
5598	<	return abortOnNullFunction();
5599	<	SearchKeysTask<K,V,U> subtasks = null;
5600	<	try {
5601	<	int b = batch(), c;
5602	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5603	<	do {} while (!casPending(c = pending, c+1));
5604	<	(subtasks = new SearchKeysTask<K,V,U>
5605	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5606	<	}
5593	>	public final U getRawResult() { return result.get(); }
5594	>	@SuppressWarnings("unchecked") public final void compute() {
5595	>	final Fun<? super K, ? extends U> searchFunction;
5596	>	final AtomicReference<U> result;
5597	>	if ((searchFunction = this.searchFunction) == null ||
5598	>	(result = this.result) == null)
5599	>	throw new NullPointerException();
5600	>	for (int b;;) {
5601	>	if (result.get() != null)
5602	>	return;
5603	>	if ((b = preSplit()) <= 0)
5604	>	break;
5605	>	new SearchKeysTask<K,V,U>
5606	>	(map, this, b, searchFunction, result).fork();
5607	>	}
5608	>	while (result.get() == null) {
5609		U u;
5610	<	while (result.get() == null && advance() != null) {
5611	<	if ((u = searchFunction.apply((K)nextKey)) != null) {
5612	<	if (result.compareAndSet(null, u))
5613	<	tryCompleteComputation(null);
5614	<	break;
5615	<	}
5610	>	if (advance() == null) {
5611	>	propagateCompletion();
5612	>	break;
5613	>	}
5614	>	if ((u = searchFunction.apply((K)nextKey)) != null) {
5615	>	if (result.compareAndSet(null, u))
5616	>	quietlyCompleteRoot();
5617	>	break;
5618		}
5381	–	} catch (Throwable ex) {
5382	–	return tryCompleteComputation(ex);
5619		}
5384	–	tryComplete(subtasks);
5385	–	return false;
5620		}
5387	–	public final U getRawResult() { return result.get(); }
5621		}
5622
5623		@SuppressWarnings("serial") static final class SearchValuesTask<K,V,U>
5624	<	extends BulkAction<K,V,U> {
5624	>	extends Traverser<K,V,U> {
5625		final Fun<? super V, ? extends U> searchFunction;
5626		final AtomicReference<U> result;
5627		SearchValuesTask
5628	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5396	<	SearchValuesTask<K,V,U> nextTask,
5628	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5629		Fun<? super V, ? extends U> searchFunction,
5630		AtomicReference<U> result) {
5631	<	super(m, p, b, nextTask);
5631	>	super(m, p, b);
5632		this.searchFunction = searchFunction; this.result = result;
5633		}
5634	<	@SuppressWarnings("unchecked") public final boolean exec() {
5635	<	AtomicReference<U> result = this.result;
5636	<	final Fun<? super V, ? extends U> searchFunction =
5637	<	this.searchFunction;
5638	<	if (searchFunction == null || result == null)
5639	<	return abortOnNullFunction();
5640	<	SearchValuesTask<K,V,U> subtasks = null;
5641	<	try {
5642	<	int b = batch(), c;
5643	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5644	<	do {} while (!casPending(c = pending, c+1));
5645	<	(subtasks = new SearchValuesTask<K,V,U>
5646	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5647	<	}
5634	>	public final U getRawResult() { return result.get(); }
5635	>	@SuppressWarnings("unchecked") public final void compute() {
5636	>	final Fun<? super V, ? extends U> searchFunction;
5637	>	final AtomicReference<U> result;
5638	>	if ((searchFunction = this.searchFunction) == null ||
5639	>	(result = this.result) == null)
5640	>	throw new NullPointerException();
5641	>	for (int b;;) {
5642	>	if (result.get() != null)
5643	>	return;
5644	>	if ((b = preSplit()) <= 0)
5645	>	break;
5646	>	new SearchValuesTask<K,V,U>
5647	>	(map, this, b, searchFunction, result).fork();
5648	>	}
5649	>	while (result.get() == null) {
5650		Object v; U u;
5651	<	while (result.get() == null && (v = advance()) != null) {
5652	<	if ((u = searchFunction.apply((V)v)) != null) {
5653	<	if (result.compareAndSet(null, u))
5654	<	tryCompleteComputation(null);
5655	<	break;
5656	<	}
5651	>	if ((v = advance()) == null) {
5652	>	propagateCompletion();
5653	>	break;
5654	>	}
5655	>	if ((u = searchFunction.apply((V)v)) != null) {
5656	>	if (result.compareAndSet(null, u))
5657	>	quietlyCompleteRoot();
5658	>	break;
5659		}
5424	–	} catch (Throwable ex) {
5425	–	return tryCompleteComputation(ex);
5660		}
5427	–	tryComplete(subtasks);
5428	–	return false;
5661		}
5430	–	public final U getRawResult() { return result.get(); }
5662		}
5663
5664		@SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U>
5665	<	extends BulkAction<K,V,U> {
5665	>	extends Traverser<K,V,U> {
5666		final Fun<Entry<K,V>, ? extends U> searchFunction;
5667		final AtomicReference<U> result;
5668		SearchEntriesTask
5669	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5439	<	SearchEntriesTask<K,V,U> nextTask,
5669	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5670		Fun<Entry<K,V>, ? extends U> searchFunction,
5671		AtomicReference<U> result) {
5672	<	super(m, p, b, nextTask);
5672	>	super(m, p, b);
5673		this.searchFunction = searchFunction; this.result = result;
5674		}
5675	<	@SuppressWarnings("unchecked") public final boolean exec() {
5676	<	AtomicReference<U> result = this.result;
5677	<	final Fun<Entry<K,V>, ? extends U> searchFunction =
5678	<	this.searchFunction;
5679	<	if (searchFunction == null || result == null)
5680	<	return abortOnNullFunction();
5681	<	SearchEntriesTask<K,V,U> subtasks = null;
5682	<	try {
5683	<	int b = batch(), c;
5684	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5685	<	do {} while (!casPending(c = pending, c+1));
5686	<	(subtasks = new SearchEntriesTask<K,V,U>
5687	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5688	<	}
5675	>	public final U getRawResult() { return result.get(); }
5676	>	@SuppressWarnings("unchecked") public final void compute() {
5677	>	final Fun<Entry<K,V>, ? extends U> searchFunction;
5678	>	final AtomicReference<U> result;
5679	>	if ((searchFunction = this.searchFunction) == null ||
5680	>	(result = this.result) == null)
5681	>	throw new NullPointerException();
5682	>	for (int b;;) {
5683	>	if (result.get() != null)
5684	>	return;
5685	>	if ((b = preSplit()) <= 0)
5686	>	break;
5687	>	new SearchEntriesTask<K,V,U>
5688	>	(map, this, b, searchFunction, result).fork();
5689	>	}
5690	>	while (result.get() == null) {
5691		Object v; U u;
5692	<	while (result.get() == null && (v = advance()) != null) {
5693	<	if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) {
5694	<	if (result.compareAndSet(null, u))
5695	<	tryCompleteComputation(null);
5696	<	break;
5697	<	}
5692	>	if ((v = advance()) == null) {
5693	>	propagateCompletion();
5694	>	break;
5695	>	}
5696	>	if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) {
5697	>	if (result.compareAndSet(null, u))
5698	>	quietlyCompleteRoot();
5699	>	return;
5700		}
5467	–	} catch (Throwable ex) {
5468	–	return tryCompleteComputation(ex);
5701		}
5470	–	tryComplete(subtasks);
5471	–	return false;
5702		}
5473	–	public final U getRawResult() { return result.get(); }
5703		}
5704
5705		@SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U>
5706	<	extends BulkAction<K,V,U> {
5706	>	extends Traverser<K,V,U> {
5707		final BiFun<? super K, ? super V, ? extends U> searchFunction;
5708		final AtomicReference<U> result;
5709		SearchMappingsTask
5710	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5482	<	SearchMappingsTask<K,V,U> nextTask,
5710	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5711		BiFun<? super K, ? super V, ? extends U> searchFunction,
5712		AtomicReference<U> result) {
5713	<	super(m, p, b, nextTask);
5713	>	super(m, p, b);
5714		this.searchFunction = searchFunction; this.result = result;
5715		}
5716	<	@SuppressWarnings("unchecked") public final boolean exec() {
5717	<	AtomicReference<U> result = this.result;
5718	<	final BiFun<? super K, ? super V, ? extends U> searchFunction =
5719	<	this.searchFunction;
5720	<	if (searchFunction == null || result == null)
5721	<	return abortOnNullFunction();
5722	<	SearchMappingsTask<K,V,U> subtasks = null;
5723	<	try {
5724	<	int b = batch(), c;
5725	<	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5726	<	do {} while (!casPending(c = pending, c+1));
5727	<	(subtasks = new SearchMappingsTask<K,V,U>
5728	<	(map, this, b >>>= 1, subtasks, searchFunction, result)).fork();
5729	<	}
5716	>	public final U getRawResult() { return result.get(); }
5717	>	@SuppressWarnings("unchecked") public final void compute() {
5718	>	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5719	>	final AtomicReference<U> result;
5720	>	if ((searchFunction = this.searchFunction) == null ||
5721	>	(result = this.result) == null)
5722	>	throw new NullPointerException();
5723	>	for (int b;;) {
5724	>	if (result.get() != null)
5725	>	return;
5726	>	if ((b = preSplit()) <= 0)
5727	>	break;
5728	>	new SearchMappingsTask<K,V,U>
5729	>	(map, this, b, searchFunction, result).fork();
5730	>	}
5731	>	while (result.get() == null) {
5732		Object v; U u;
5733	<	while (result.get() == null && (v = advance()) != null) {
5734	<	if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) {
5735	<	if (result.compareAndSet(null, u))
5736	<	tryCompleteComputation(null);
5737	<	break;
5738	<	}
5733	>	if ((v = advance()) == null) {
5734	>	propagateCompletion();
5735	>	break;
5736	>	}
5737	>	if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) {
5738	>	if (result.compareAndSet(null, u))
5739	>	quietlyCompleteRoot();
5740	>	break;
5741		}
5510	–	} catch (Throwable ex) {
5511	–	return tryCompleteComputation(ex);
5742		}
5513	–	tryComplete(subtasks);
5514	–	return false;
5743		}
5516	–	public final U getRawResult() { return result.get(); }
5744		}
5745
5746		@SuppressWarnings("serial") static final class ReduceKeysTask<K,V>
5747	<	extends BulkTask<K,V,K> {
5747	>	extends Traverser<K,V,K> {
5748		final BiFun<? super K, ? super K, ? extends K> reducer;
5749		K result;
5750		ReduceKeysTask<K,V> rights, nextRight;
5751		ReduceKeysTask
5752	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5752	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5753		ReduceKeysTask<K,V> nextRight,
5754		BiFun<? super K, ? super K, ? extends K> reducer) {
5755		super(m, p, b); this.nextRight = nextRight;
5756		this.reducer = reducer;
5757		}
5758	<	@SuppressWarnings("unchecked") public final boolean exec() {
5758	>	public final K getRawResult() { return result; }
5759	>	@SuppressWarnings("unchecked") public final void compute() {
5760		final BiFun<? super K, ? super K, ? extends K> reducer =
5761		this.reducer;
5762		if (reducer == null)
5763	<	return abortOnNullFunction();
5764	<	try {
5765	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5766	<	do {} while (!casPending(c = pending, c+1));
5767	<	(rights = new ReduceKeysTask<K,V>
5768	<	(map, this, b >>>= 1, rights, reducer)).fork();
5769	<	}
5770	<	K r = null;
5771	<	while (advance() != null) {
5772	<	K u = (K)nextKey;
5773	<	r = (r == null) ? u : reducer.apply(r, u);
5774	<	}
5775	<	result = r;
5776	<	for (ReduceKeysTask<K,V> t = this, s;;) {
5777	<	int c; BulkTask<K,V,?> par; K tr, sr;
5778	<	if ((c = t.pending) == 0) {
5779	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5780	<	if ((sr = s.result) != null)
5781	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5782	<	}
5783	<	if ((par = t.parent) == null ||
5556	<	!(par instanceof ReduceKeysTask)) {
5557	<	t.quietlyComplete();
5558	<	break;
5559	<	}
5560	<	t = (ReduceKeysTask<K,V>)par;
5561	<	}
5562	<	else if (t.casPending(c, c - 1))
5563	<	break;
5763	>	throw new NullPointerException();
5764	>	for (int b; (b = preSplit()) > 0;)
5765	>	(rights = new ReduceKeysTask<K,V>
5766	>	(map, this, b, rights, reducer)).fork();
5767	>	K r = null;
5768	>	while (advance() != null) {
5769	>	K u = (K)nextKey;
5770	>	r = (r == null) ? u : reducer.apply(r, u);
5771	>	}
5772	>	result = r;
5773	>	CountedCompleter<?> c;
5774	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5775	>	ReduceKeysTask<K,V>
5776	>	t = (ReduceKeysTask<K,V>)c,
5777	>	s = t.rights;
5778	>	while (s != null) {
5779	>	K tr, sr;
5780	>	if ((sr = s.result) != null)
5781	>	t.result = (((tr = t.result) == null) ? sr :
5782	>	reducer.apply(tr, sr));
5783	>	s = t.rights = s.nextRight;
5784		}
5565	–	} catch (Throwable ex) {
5566	–	return tryCompleteComputation(ex);
5567	–	}
5568	–	ReduceKeysTask<K,V> s = rights;
5569	–	if (s != null && !inForkJoinPool()) {
5570	–	do  {
5571	–	if (s.tryUnfork())
5572	–	s.exec();
5573	–	} while ((s = s.nextRight) != null);
5785		}
5575	–	return false;
5786		}
5577	–	public final K getRawResult() { return result; }
5787		}
5788
5789		@SuppressWarnings("serial") static final class ReduceValuesTask<K,V>
5790	<	extends BulkTask<K,V,V> {
5790	>	extends Traverser<K,V,V> {
5791		final BiFun<? super V, ? super V, ? extends V> reducer;
5792		V result;
5793		ReduceValuesTask<K,V> rights, nextRight;
5794		ReduceValuesTask
5795	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5795	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5796		ReduceValuesTask<K,V> nextRight,
5797		BiFun<? super V, ? super V, ? extends V> reducer) {
5798		super(m, p, b); this.nextRight = nextRight;
5799		this.reducer = reducer;
5800		}
5801	<	@SuppressWarnings("unchecked") public final boolean exec() {
5801	>	public final V getRawResult() { return result; }
5802	>	@SuppressWarnings("unchecked") public final void compute() {
5803		final BiFun<? super V, ? super V, ? extends V> reducer =
5804		this.reducer;
5805		if (reducer == null)
5806	<	return abortOnNullFunction();
5807	<	try {
5808	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5809	<	do {} while (!casPending(c = pending, c+1));
5810	<	(rights = new ReduceValuesTask<K,V>
5811	<	(map, this, b >>>= 1, rights, reducer)).fork();
5812	<	}
5813	<	V r = null;
5814	<	Object v;
5815	<	while ((v = advance()) != null) {
5816	<	V u = (V)v;
5817	<	r = (r == null) ? u : reducer.apply(r, u);
5818	<	}
5819	<	result = r;
5820	<	for (ReduceValuesTask<K,V> t = this, s;;) {
5821	<	int c; BulkTask<K,V,?> par; V tr, sr;
5822	<	if ((c = t.pending) == 0) {
5823	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5824	<	if ((sr = s.result) != null)
5825	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5826	<	}
5827	<	if ((par = t.parent) == null ||
5618	<	!(par instanceof ReduceValuesTask)) {
5619	<	t.quietlyComplete();
5620	<	break;
5621	<	}
5622	<	t = (ReduceValuesTask<K,V>)par;
5623	<	}
5624	<	else if (t.casPending(c, c - 1))
5625	<	break;
5806	>	throw new NullPointerException();
5807	>	for (int b; (b = preSplit()) > 0;)
5808	>	(rights = new ReduceValuesTask<K,V>
5809	>	(map, this, b, rights, reducer)).fork();
5810	>	V r = null;
5811	>	Object v;
5812	>	while ((v = advance()) != null) {
5813	>	V u = (V)v;
5814	>	r = (r == null) ? u : reducer.apply(r, u);
5815	>	}
5816	>	result = r;
5817	>	CountedCompleter<?> c;
5818	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5819	>	ReduceValuesTask<K,V>
5820	>	t = (ReduceValuesTask<K,V>)c,
5821	>	s = t.rights;
5822	>	while (s != null) {
5823	>	V tr, sr;
5824	>	if ((sr = s.result) != null)
5825	>	t.result = (((tr = t.result) == null) ? sr :
5826	>	reducer.apply(tr, sr));
5827	>	s = t.rights = s.nextRight;
5828		}
5627	–	} catch (Throwable ex) {
5628	–	return tryCompleteComputation(ex);
5829		}
5630	–	ReduceValuesTask<K,V> s = rights;
5631	–	if (s != null && !inForkJoinPool()) {
5632	–	do  {
5633	–	if (s.tryUnfork())
5634	–	s.exec();
5635	–	} while ((s = s.nextRight) != null);
5636	–	}
5637	–	return false;
5830		}
5639	–	public final V getRawResult() { return result; }
5831		}
5832
5833		@SuppressWarnings("serial") static final class ReduceEntriesTask<K,V>
5834	<	extends BulkTask<K,V,Map.Entry<K,V>> {
5834	>	extends Traverser<K,V,Map.Entry<K,V>> {
5835		final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5836		Map.Entry<K,V> result;
5837		ReduceEntriesTask<K,V> rights, nextRight;
5838		ReduceEntriesTask
5839	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5839	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5840		ReduceEntriesTask<K,V> nextRight,
5841		BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5842		super(m, p, b); this.nextRight = nextRight;
5843		this.reducer = reducer;
5844		}
5845	<	@SuppressWarnings("unchecked") public final boolean exec() {
5845	>	public final Map.Entry<K,V> getRawResult() { return result; }
5846	>	@SuppressWarnings("unchecked") public final void compute() {
5847		final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer =
5848		this.reducer;
5849		if (reducer == null)
5850	<	return abortOnNullFunction();
5851	<	try {
5852	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5853	<	do {} while (!casPending(c = pending, c+1));
5854	<	(rights = new ReduceEntriesTask<K,V>
5855	<	(map, this, b >>>= 1, rights, reducer)).fork();
5856	<	}
5857	<	Map.Entry<K,V> r = null;
5858	<	Object v;
5859	<	while ((v = advance()) != null) {
5860	<	Map.Entry<K,V> u = entryFor((K)nextKey, (V)v);
5861	<	r = (r == null) ? u : reducer.apply(r, u);
5862	<	}
5863	<	result = r;
5864	<	for (ReduceEntriesTask<K,V> t = this, s;;) {
5865	<	int c; BulkTask<K,V,?> par; Map.Entry<K,V> tr, sr;
5866	<	if ((c = t.pending) == 0) {
5867	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5868	<	if ((sr = s.result) != null)
5869	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5870	<	}
5871	<	if ((par = t.parent) == null ||
5680	<	!(par instanceof ReduceEntriesTask)) {
5681	<	t.quietlyComplete();
5682	<	break;
5683	<	}
5684	<	t = (ReduceEntriesTask<K,V>)par;
5685	<	}
5686	<	else if (t.casPending(c, c - 1))
5687	<	break;
5850	>	throw new NullPointerException();
5851	>	for (int b; (b = preSplit()) > 0;)
5852	>	(rights = new ReduceEntriesTask<K,V>
5853	>	(map, this, b, rights, reducer)).fork();
5854	>	Map.Entry<K,V> r = null;
5855	>	Object v;
5856	>	while ((v = advance()) != null) {
5857	>	Map.Entry<K,V> u = entryFor((K)nextKey, (V)v);
5858	>	r = (r == null) ? u : reducer.apply(r, u);
5859	>	}
5860	>	result = r;
5861	>	CountedCompleter<?> c;
5862	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5863	>	ReduceEntriesTask<K,V>
5864	>	t = (ReduceEntriesTask<K,V>)c,
5865	>	s = t.rights;
5866	>	while (s != null) {
5867	>	Map.Entry<K,V> tr, sr;
5868	>	if ((sr = s.result) != null)
5869	>	t.result = (((tr = t.result) == null) ? sr :
5870	>	reducer.apply(tr, sr));
5871	>	s = t.rights = s.nextRight;
5872		}
5689	–	} catch (Throwable ex) {
5690	–	return tryCompleteComputation(ex);
5691	–	}
5692	–	ReduceEntriesTask<K,V> s = rights;
5693	–	if (s != null && !inForkJoinPool()) {
5694	–	do  {
5695	–	if (s.tryUnfork())
5696	–	s.exec();
5697	–	} while ((s = s.nextRight) != null);
5873		}
5699	–	return false;
5874		}
5701	–	public final Map.Entry<K,V> getRawResult() { return result; }
5875		}
5876
5877		@SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U>
5878	<	extends BulkTask<K,V,U> {
5878	>	extends Traverser<K,V,U> {
5879		final Fun<? super K, ? extends U> transformer;
5880		final BiFun<? super U, ? super U, ? extends U> reducer;
5881		U result;
5882		MapReduceKeysTask<K,V,U> rights, nextRight;
5883		MapReduceKeysTask
5884	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5884	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5885		MapReduceKeysTask<K,V,U> nextRight,
5886		Fun<? super K, ? extends U> transformer,
5887		BiFun<? super U, ? super U, ? extends U> reducer) {
#	Line 5716 | Line 5889 | public class ConcurrentHashMapV8<K, V>
5889		this.transformer = transformer;
5890		this.reducer = reducer;
5891		}
5892	<	@SuppressWarnings("unchecked") public final boolean exec() {
5892	>	public final U getRawResult() { return result; }
5893	>	@SuppressWarnings("unchecked") public final void compute() {
5894		final Fun<? super K, ? extends U> transformer =
5895		this.transformer;
5896		final BiFun<? super U, ? super U, ? extends U> reducer =
5897		this.reducer;
5898		if (transformer == null || reducer == null)
5899	<	return abortOnNullFunction();
5900	<	try {
5901	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5902	<	do {} while (!casPending(c = pending, c+1));
5903	<	(rights = new MapReduceKeysTask<K,V,U>
5904	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5905	<	}
5906	<	U r = null, u;
5733	<	while (advance() != null) {
5734	<	if ((u = transformer.apply((K)nextKey)) != null)
5735	<	r = (r == null) ? u : reducer.apply(r, u);
5736	<	}
5737	<	result = r;
5738	<	for (MapReduceKeysTask<K,V,U> t = this, s;;) {
5739	<	int c; BulkTask<K,V,?> par; U tr, sr;
5740	<	if ((c = t.pending) == 0) {
5741	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5742	<	if ((sr = s.result) != null)
5743	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5744	<	}
5745	<	if ((par = t.parent) == null ||
5746	<	!(par instanceof MapReduceKeysTask)) {
5747	<	t.quietlyComplete();
5748	<	break;
5749	<	}
5750	<	t = (MapReduceKeysTask<K,V,U>)par;
5751	<	}
5752	<	else if (t.casPending(c, c - 1))
5753	<	break;
5754	<	}
5755	<	} catch (Throwable ex) {
5756	<	return tryCompleteComputation(ex);
5899	>	throw new NullPointerException();
5900	>	for (int b; (b = preSplit()) > 0;)
5901	>	(rights = new MapReduceKeysTask<K,V,U>
5902	>	(map, this, b, rights, transformer, reducer)).fork();
5903	>	U r = null, u;
5904	>	while (advance() != null) {
5905	>	if ((u = transformer.apply((K)nextKey)) != null)
5906	>	r = (r == null) ? u : reducer.apply(r, u);
5907		}
5908	<	MapReduceKeysTask<K,V,U> s = rights;
5909	<	if (s != null && !inForkJoinPool()) {
5910	<	do  {
5911	<	if (s.tryUnfork())
5912	<	s.exec();
5913	<	} while ((s = s.nextRight) != null);
5908	>	result = r;
5909	>	CountedCompleter<?> c;
5910	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5911	>	MapReduceKeysTask<K,V,U>
5912	>	t = (MapReduceKeysTask<K,V,U>)c,
5913	>	s = t.rights;
5914	>	while (s != null) {
5915	>	U tr, sr;
5916	>	if ((sr = s.result) != null)
5917	>	t.result = (((tr = t.result) == null) ? sr :
5918	>	reducer.apply(tr, sr));
5919	>	s = t.rights = s.nextRight;
5920	>	}
5921		}
5765	–	return false;
5922		}
5767	–	public final U getRawResult() { return result; }
5923		}
5924
5925		@SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U>
5926	<	extends BulkTask<K,V,U> {
5926	>	extends Traverser<K,V,U> {
5927		final Fun<? super V, ? extends U> transformer;
5928		final BiFun<? super U, ? super U, ? extends U> reducer;
5929		U result;
5930		MapReduceValuesTask<K,V,U> rights, nextRight;
5931		MapReduceValuesTask
5932	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5932	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5933		MapReduceValuesTask<K,V,U> nextRight,
5934		Fun<? super V, ? extends U> transformer,
5935		BiFun<? super U, ? super U, ? extends U> reducer) {
#	Line 5782 | Line 5937 | public class ConcurrentHashMapV8<K, V>
5937		this.transformer = transformer;
5938		this.reducer = reducer;
5939		}
5940	<	@SuppressWarnings("unchecked") public final boolean exec() {
5940	>	public final U getRawResult() { return result; }
5941	>	@SuppressWarnings("unchecked") public final void compute() {
5942		final Fun<? super V, ? extends U> transformer =
5943		this.transformer;
5944		final BiFun<? super U, ? super U, ? extends U> reducer =
5945		this.reducer;
5946		if (transformer == null || reducer == null)
5947	<	return abortOnNullFunction();
5948	<	try {
5949	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5950	<	do {} while (!casPending(c = pending, c+1));
5951	<	(rights = new MapReduceValuesTask<K,V,U>
5952	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
5953	<	}
5954	<	U r = null, u;
5955	<	Object v;
5800	<	while ((v = advance()) != null) {
5801	<	if ((u = transformer.apply((V)v)) != null)
5802	<	r = (r == null) ? u : reducer.apply(r, u);
5803	<	}
5804	<	result = r;
5805	<	for (MapReduceValuesTask<K,V,U> t = this, s;;) {
5806	<	int c; BulkTask<K,V,?> par; U tr, sr;
5807	<	if ((c = t.pending) == 0) {
5808	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5809	<	if ((sr = s.result) != null)
5810	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5811	<	}
5812	<	if ((par = t.parent) == null ||
5813	<	!(par instanceof MapReduceValuesTask)) {
5814	<	t.quietlyComplete();
5815	<	break;
5816	<	}
5817	<	t = (MapReduceValuesTask<K,V,U>)par;
5818	<	}
5819	<	else if (t.casPending(c, c - 1))
5820	<	break;
5821	<	}
5822	<	} catch (Throwable ex) {
5823	<	return tryCompleteComputation(ex);
5947	>	throw new NullPointerException();
5948	>	for (int b; (b = preSplit()) > 0;)
5949	>	(rights = new MapReduceValuesTask<K,V,U>
5950	>	(map, this, b, rights, transformer, reducer)).fork();
5951	>	U r = null, u;
5952	>	Object v;
5953	>	while ((v = advance()) != null) {
5954	>	if ((u = transformer.apply((V)v)) != null)
5955	>	r = (r == null) ? u : reducer.apply(r, u);
5956		}
5957	<	MapReduceValuesTask<K,V,U> s = rights;
5958	<	if (s != null && !inForkJoinPool()) {
5959	<	do  {
5960	<	if (s.tryUnfork())
5961	<	s.exec();
5962	<	} while ((s = s.nextRight) != null);
5957	>	result = r;
5958	>	CountedCompleter<?> c;
5959	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
5960	>	MapReduceValuesTask<K,V,U>
5961	>	t = (MapReduceValuesTask<K,V,U>)c,
5962	>	s = t.rights;
5963	>	while (s != null) {
5964	>	U tr, sr;
5965	>	if ((sr = s.result) != null)
5966	>	t.result = (((tr = t.result) == null) ? sr :
5967	>	reducer.apply(tr, sr));
5968	>	s = t.rights = s.nextRight;
5969	>	}
5970		}
5832	–	return false;
5971		}
5834	–	public final U getRawResult() { return result; }
5972		}
5973
5974		@SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U>
5975	<	extends BulkTask<K,V,U> {
5975	>	extends Traverser<K,V,U> {
5976		final Fun<Map.Entry<K,V>, ? extends U> transformer;
5977		final BiFun<? super U, ? super U, ? extends U> reducer;
5978		U result;
5979		MapReduceEntriesTask<K,V,U> rights, nextRight;
5980		MapReduceEntriesTask
5981	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
5981	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
5982		MapReduceEntriesTask<K,V,U> nextRight,
5983		Fun<Map.Entry<K,V>, ? extends U> transformer,
5984		BiFun<? super U, ? super U, ? extends U> reducer) {
#	Line 5849 | Line 5986 | public class ConcurrentHashMapV8<K, V>
5986		this.transformer = transformer;
5987		this.reducer = reducer;
5988		}
5989	<	@SuppressWarnings("unchecked") public final boolean exec() {
5989	>	public final U getRawResult() { return result; }
5990	>	@SuppressWarnings("unchecked") public final void compute() {
5991		final Fun<Map.Entry<K,V>, ? extends U> transformer =
5992		this.transformer;
5993		final BiFun<? super U, ? super U, ? extends U> reducer =
5994		this.reducer;
5995		if (transformer == null || reducer == null)
5996	<	return abortOnNullFunction();
5997	<	try {
5998	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
5999	<	do {} while (!casPending(c = pending, c+1));
6000	<	(rights = new MapReduceEntriesTask<K,V,U>
6001	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
6002	<	}
6003	<	U r = null, u;
6004	<	Object v;
5867	<	while ((v = advance()) != null) {
5868	<	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5869	<	r = (r == null) ? u : reducer.apply(r, u);
5870	<	}
5871	<	result = r;
5872	<	for (MapReduceEntriesTask<K,V,U> t = this, s;;) {
5873	<	int c; BulkTask<K,V,?> par; U tr, sr;
5874	<	if ((c = t.pending) == 0) {
5875	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5876	<	if ((sr = s.result) != null)
5877	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5878	<	}
5879	<	if ((par = t.parent) == null ||
5880	<	!(par instanceof MapReduceEntriesTask)) {
5881	<	t.quietlyComplete();
5882	<	break;
5883	<	}
5884	<	t = (MapReduceEntriesTask<K,V,U>)par;
5885	<	}
5886	<	else if (t.casPending(c, c - 1))
5887	<	break;
5888	<	}
5889	<	} catch (Throwable ex) {
5890	<	return tryCompleteComputation(ex);
5996	>	throw new NullPointerException();
5997	>	for (int b; (b = preSplit()) > 0;)
5998	>	(rights = new MapReduceEntriesTask<K,V,U>
5999	>	(map, this, b, rights, transformer, reducer)).fork();
6000	>	U r = null, u;
6001	>	Object v;
6002	>	while ((v = advance()) != null) {
6003	>	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
6004	>	r = (r == null) ? u : reducer.apply(r, u);
6005		}
6006	<	MapReduceEntriesTask<K,V,U> s = rights;
6007	<	if (s != null && !inForkJoinPool()) {
6008	<	do  {
6009	<	if (s.tryUnfork())
6010	<	s.exec();
6011	<	} while ((s = s.nextRight) != null);
6006	>	result = r;
6007	>	CountedCompleter<?> c;
6008	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6009	>	MapReduceEntriesTask<K,V,U>
6010	>	t = (MapReduceEntriesTask<K,V,U>)c,
6011	>	s = t.rights;
6012	>	while (s != null) {
6013	>	U tr, sr;
6014	>	if ((sr = s.result) != null)
6015	>	t.result = (((tr = t.result) == null) ? sr :
6016	>	reducer.apply(tr, sr));
6017	>	s = t.rights = s.nextRight;
6018	>	}
6019		}
5899	–	return false;
6020		}
5901	–	public final U getRawResult() { return result; }
6021		}
6022
6023		@SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U>
6024	<	extends BulkTask<K,V,U> {
6024	>	extends Traverser<K,V,U> {
6025		final BiFun<? super K, ? super V, ? extends U> transformer;
6026		final BiFun<? super U, ? super U, ? extends U> reducer;
6027		U result;
6028		MapReduceMappingsTask<K,V,U> rights, nextRight;
6029		MapReduceMappingsTask
6030	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6030	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6031		MapReduceMappingsTask<K,V,U> nextRight,
6032		BiFun<? super K, ? super V, ? extends U> transformer,
6033		BiFun<? super U, ? super U, ? extends U> reducer) {
#	Line 5916 | Line 6035 | public class ConcurrentHashMapV8<K, V>
6035		this.transformer = transformer;
6036		this.reducer = reducer;
6037		}
6038	<	@SuppressWarnings("unchecked") public final boolean exec() {
6038	>	public final U getRawResult() { return result; }
6039	>	@SuppressWarnings("unchecked") public final void compute() {
6040		final BiFun<? super K, ? super V, ? extends U> transformer =
6041		this.transformer;
6042		final BiFun<? super U, ? super U, ? extends U> reducer =
6043		this.reducer;
6044		if (transformer == null || reducer == null)
6045	<	return abortOnNullFunction();
6046	<	try {
6047	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6048	<	do {} while (!casPending(c = pending, c+1));
6049	<	(rights = new MapReduceMappingsTask<K,V,U>
6050	<	(map, this, b >>>= 1, rights, transformer, reducer)).fork();
6051	<	}
6052	<	U r = null, u;
6053	<	Object v;
5934	<	while ((v = advance()) != null) {
5935	<	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5936	<	r = (r == null) ? u : reducer.apply(r, u);
5937	<	}
5938	<	result = r;
5939	<	for (MapReduceMappingsTask<K,V,U> t = this, s;;) {
5940	<	int c; BulkTask<K,V,?> par; U tr, sr;
5941	<	if ((c = t.pending) == 0) {
5942	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
5943	<	if ((sr = s.result) != null)
5944	<	t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr);
5945	<	}
5946	<	if ((par = t.parent) == null ||
5947	<	!(par instanceof MapReduceMappingsTask)) {
5948	<	t.quietlyComplete();
5949	<	break;
5950	<	}
5951	<	t = (MapReduceMappingsTask<K,V,U>)par;
5952	<	}
5953	<	else if (t.casPending(c, c - 1))
5954	<	break;
5955	<	}
5956	<	} catch (Throwable ex) {
5957	<	return tryCompleteComputation(ex);
6045	>	throw new NullPointerException();
6046	>	for (int b; (b = preSplit()) > 0;)
6047	>	(rights = new MapReduceMappingsTask<K,V,U>
6048	>	(map, this, b, rights, transformer, reducer)).fork();
6049	>	U r = null, u;
6050	>	Object v;
6051	>	while ((v = advance()) != null) {
6052	>	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
6053	>	r = (r == null) ? u : reducer.apply(r, u);
6054		}
6055	<	MapReduceMappingsTask<K,V,U> s = rights;
6056	<	if (s != null && !inForkJoinPool()) {
6057	<	do  {
6058	<	if (s.tryUnfork())
6059	<	s.exec();
6060	<	} while ((s = s.nextRight) != null);
6055	>	result = r;
6056	>	CountedCompleter<?> c;
6057	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6058	>	MapReduceMappingsTask<K,V,U>
6059	>	t = (MapReduceMappingsTask<K,V,U>)c,
6060	>	s = t.rights;
6061	>	while (s != null) {
6062	>	U tr, sr;
6063	>	if ((sr = s.result) != null)
6064	>	t.result = (((tr = t.result) == null) ? sr :
6065	>	reducer.apply(tr, sr));
6066	>	s = t.rights = s.nextRight;
6067	>	}
6068		}
5966	–	return false;
6069		}
5968	–	public final U getRawResult() { return result; }
6070		}
6071
6072		@SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V>
6073	<	extends BulkTask<K,V,Double> {
6073	>	extends Traverser<K,V,Double> {
6074		final ObjectToDouble<? super K> transformer;
6075		final DoubleByDoubleToDouble reducer;
6076		final double basis;
6077		double result;
6078		MapReduceKeysToDoubleTask<K,V> rights, nextRight;
6079		MapReduceKeysToDoubleTask
6080	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6080	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6081		MapReduceKeysToDoubleTask<K,V> nextRight,
6082		ObjectToDouble<? super K> transformer,
6083		double basis,
#	Line 5985 | Line 6086 | public class ConcurrentHashMapV8<K, V>
6086		this.transformer = transformer;
6087		this.basis = basis; this.reducer = reducer;
6088		}
6089	<	@SuppressWarnings("unchecked") public final boolean exec() {
6089	>	public final Double getRawResult() { return result; }
6090	>	@SuppressWarnings("unchecked") public final void compute() {
6091		final ObjectToDouble<? super K> transformer =
6092		this.transformer;
6093		final DoubleByDoubleToDouble reducer = this.reducer;
6094		if (transformer == null || reducer == null)
6095	<	return abortOnNullFunction();
6096	<	try {
6097	<	final double id = this.basis;
6098	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6099	<	do {} while (!casPending(c = pending, c+1));
6100	<	(rights = new MapReduceKeysToDoubleTask<K,V>
6101	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6102	<	}
6103	<	double r = id;
6104	<	while (advance() != null)
6105	<	r = reducer.apply(r, transformer.apply((K)nextKey));
6106	<	result = r;
6107	<	for (MapReduceKeysToDoubleTask<K,V> t = this, s;;) {
6108	<	int c; BulkTask<K,V,?> par;
6109	<	if ((c = t.pending) == 0) {
6110	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6009	<	t.result = reducer.apply(t.result, s.result);
6010	<	}
6011	<	if ((par = t.parent) == null ||
6012	<	!(par instanceof MapReduceKeysToDoubleTask)) {
6013	<	t.quietlyComplete();
6014	<	break;
6015	<	}
6016	<	t = (MapReduceKeysToDoubleTask<K,V>)par;
6017	<	}
6018	<	else if (t.casPending(c, c - 1))
6019	<	break;
6095	>	throw new NullPointerException();
6096	>	double r = this.basis;
6097	>	for (int b; (b = preSplit()) > 0;)
6098	>	(rights = new MapReduceKeysToDoubleTask<K,V>
6099	>	(map, this, b, rights, transformer, r, reducer)).fork();
6100	>	while (advance() != null)
6101	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6102	>	result = r;
6103	>	CountedCompleter<?> c;
6104	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6105	>	MapReduceKeysToDoubleTask<K,V>
6106	>	t = (MapReduceKeysToDoubleTask<K,V>)c,
6107	>	s = t.rights;
6108	>	while (s != null) {
6109	>	t.result = reducer.apply(t.result, s.result);
6110	>	s = t.rights = s.nextRight;
6111		}
6021	–	} catch (Throwable ex) {
6022	–	return tryCompleteComputation(ex);
6023	–	}
6024	–	MapReduceKeysToDoubleTask<K,V> s = rights;
6025	–	if (s != null && !inForkJoinPool()) {
6026	–	do  {
6027	–	if (s.tryUnfork())
6028	–	s.exec();
6029	–	} while ((s = s.nextRight) != null);
6112		}
6031	–	return false;
6113		}
6033	–	public final Double getRawResult() { return result; }
6114		}
6115
6116		@SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V>
6117	<	extends BulkTask<K,V,Double> {
6117	>	extends Traverser<K,V,Double> {
6118		final ObjectToDouble<? super V> transformer;
6119		final DoubleByDoubleToDouble reducer;
6120		final double basis;
6121		double result;
6122		MapReduceValuesToDoubleTask<K,V> rights, nextRight;
6123		MapReduceValuesToDoubleTask
6124	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6124	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6125		MapReduceValuesToDoubleTask<K,V> nextRight,
6126		ObjectToDouble<? super V> transformer,
6127		double basis,
#	Line 6050 | Line 6130 | public class ConcurrentHashMapV8<K, V>
6130		this.transformer = transformer;
6131		this.basis = basis; this.reducer = reducer;
6132		}
6133	<	@SuppressWarnings("unchecked") public final boolean exec() {
6133	>	public final Double getRawResult() { return result; }
6134	>	@SuppressWarnings("unchecked") public final void compute() {
6135		final ObjectToDouble<? super V> transformer =
6136		this.transformer;
6137		final DoubleByDoubleToDouble reducer = this.reducer;
6138		if (transformer == null || reducer == null)
6139	<	return abortOnNullFunction();
6140	<	try {
6141	<	final double id = this.basis;
6142	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6143	<	do {} while (!casPending(c = pending, c+1));
6144	<	(rights = new MapReduceValuesToDoubleTask<K,V>
6145	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6146	<	}
6147	<	double r = id;
6148	<	Object v;
6149	<	while ((v = advance()) != null)
6150	<	r = reducer.apply(r, transformer.apply((V)v));
6151	<	result = r;
6152	<	for (MapReduceValuesToDoubleTask<K,V> t = this, s;;) {
6153	<	int c; BulkTask<K,V,?> par;
6154	<	if ((c = t.pending) == 0) {
6155	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6075	<	t.result = reducer.apply(t.result, s.result);
6076	<	}
6077	<	if ((par = t.parent) == null ||
6078	<	!(par instanceof MapReduceValuesToDoubleTask)) {
6079	<	t.quietlyComplete();
6080	<	break;
6081	<	}
6082	<	t = (MapReduceValuesToDoubleTask<K,V>)par;
6083	<	}
6084	<	else if (t.casPending(c, c - 1))
6085	<	break;
6139	>	throw new NullPointerException();
6140	>	double r = this.basis;
6141	>	for (int b; (b = preSplit()) > 0;)
6142	>	(rights = new MapReduceValuesToDoubleTask<K,V>
6143	>	(map, this, b, rights, transformer, r, reducer)).fork();
6144	>	Object v;
6145	>	while ((v = advance()) != null)
6146	>	r = reducer.apply(r, transformer.apply((V)v));
6147	>	result = r;
6148	>	CountedCompleter<?> c;
6149	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6150	>	MapReduceValuesToDoubleTask<K,V>
6151	>	t = (MapReduceValuesToDoubleTask<K,V>)c,
6152	>	s = t.rights;
6153	>	while (s != null) {
6154	>	t.result = reducer.apply(t.result, s.result);
6155	>	s = t.rights = s.nextRight;
6156		}
6087	–	} catch (Throwable ex) {
6088	–	return tryCompleteComputation(ex);
6089	–	}
6090	–	MapReduceValuesToDoubleTask<K,V> s = rights;
6091	–	if (s != null && !inForkJoinPool()) {
6092	–	do  {
6093	–	if (s.tryUnfork())
6094	–	s.exec();
6095	–	} while ((s = s.nextRight) != null);
6157		}
6097	–	return false;
6158		}
6099	–	public final Double getRawResult() { return result; }
6159		}
6160
6161		@SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V>
6162	<	extends BulkTask<K,V,Double> {
6162	>	extends Traverser<K,V,Double> {
6163		final ObjectToDouble<Map.Entry<K,V>> transformer;
6164		final DoubleByDoubleToDouble reducer;
6165		final double basis;
6166		double result;
6167		MapReduceEntriesToDoubleTask<K,V> rights, nextRight;
6168		MapReduceEntriesToDoubleTask
6169	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6169	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6170		MapReduceEntriesToDoubleTask<K,V> nextRight,
6171		ObjectToDouble<Map.Entry<K,V>> transformer,
6172		double basis,
#	Line 6116 | Line 6175 | public class ConcurrentHashMapV8<K, V>
6175		this.transformer = transformer;
6176		this.basis = basis; this.reducer = reducer;
6177		}
6178	<	@SuppressWarnings("unchecked") public final boolean exec() {
6178	>	public final Double getRawResult() { return result; }
6179	>	@SuppressWarnings("unchecked") public final void compute() {
6180		final ObjectToDouble<Map.Entry<K,V>> transformer =
6181		this.transformer;
6182		final DoubleByDoubleToDouble reducer = this.reducer;
6183		if (transformer == null || reducer == null)
6184	<	return abortOnNullFunction();
6185	<	try {
6186	<	final double id = this.basis;
6187	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6188	<	do {} while (!casPending(c = pending, c+1));
6189	<	(rights = new MapReduceEntriesToDoubleTask<K,V>
6190	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6191	<	}
6192	<	double r = id;
6193	<	Object v;
6194	<	while ((v = advance()) != null)
6195	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6196	<	result = r;
6197	<	for (MapReduceEntriesToDoubleTask<K,V> t = this, s;;) {
6198	<	int c; BulkTask<K,V,?> par;
6199	<	if ((c = t.pending) == 0) {
6200	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6141	<	t.result = reducer.apply(t.result, s.result);
6142	<	}
6143	<	if ((par = t.parent) == null ||
6144	<	!(par instanceof MapReduceEntriesToDoubleTask)) {
6145	<	t.quietlyComplete();
6146	<	break;
6147	<	}
6148	<	t = (MapReduceEntriesToDoubleTask<K,V>)par;
6149	<	}
6150	<	else if (t.casPending(c, c - 1))
6151	<	break;
6184	>	throw new NullPointerException();
6185	>	double r = this.basis;
6186	>	for (int b; (b = preSplit()) > 0;)
6187	>	(rights = new MapReduceEntriesToDoubleTask<K,V>
6188	>	(map, this, b, rights, transformer, r, reducer)).fork();
6189	>	Object v;
6190	>	while ((v = advance()) != null)
6191	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6192	>	result = r;
6193	>	CountedCompleter<?> c;
6194	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6195	>	MapReduceEntriesToDoubleTask<K,V>
6196	>	t = (MapReduceEntriesToDoubleTask<K,V>)c,
6197	>	s = t.rights;
6198	>	while (s != null) {
6199	>	t.result = reducer.apply(t.result, s.result);
6200	>	s = t.rights = s.nextRight;
6201		}
6153	–	} catch (Throwable ex) {
6154	–	return tryCompleteComputation(ex);
6202		}
6156	–	MapReduceEntriesToDoubleTask<K,V> s = rights;
6157	–	if (s != null && !inForkJoinPool()) {
6158	–	do  {
6159	–	if (s.tryUnfork())
6160	–	s.exec();
6161	–	} while ((s = s.nextRight) != null);
6162	–	}
6163	–	return false;
6203		}
6165	–	public final Double getRawResult() { return result; }
6204		}
6205
6206		@SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V>
6207	<	extends BulkTask<K,V,Double> {
6207	>	extends Traverser<K,V,Double> {
6208		final ObjectByObjectToDouble<? super K, ? super V> transformer;
6209		final DoubleByDoubleToDouble reducer;
6210		final double basis;
6211		double result;
6212		MapReduceMappingsToDoubleTask<K,V> rights, nextRight;
6213		MapReduceMappingsToDoubleTask
6214	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6214	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6215		MapReduceMappingsToDoubleTask<K,V> nextRight,
6216		ObjectByObjectToDouble<? super K, ? super V> transformer,
6217		double basis,
#	Line 6182 | Line 6220 | public class ConcurrentHashMapV8<K, V>
6220		this.transformer = transformer;
6221		this.basis = basis; this.reducer = reducer;
6222		}
6223	<	@SuppressWarnings("unchecked") public final boolean exec() {
6223	>	public final Double getRawResult() { return result; }
6224	>	@SuppressWarnings("unchecked") public final void compute() {
6225		final ObjectByObjectToDouble<? super K, ? super V> transformer =
6226		this.transformer;
6227		final DoubleByDoubleToDouble reducer = this.reducer;
6228		if (transformer == null || reducer == null)
6229	<	return abortOnNullFunction();
6230	<	try {
6231	<	final double id = this.basis;
6232	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6233	<	do {} while (!casPending(c = pending, c+1));
6234	<	(rights = new MapReduceMappingsToDoubleTask<K,V>
6235	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6236	<	}
6237	<	double r = id;
6238	<	Object v;
6239	<	while ((v = advance()) != null)
6240	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6241	<	result = r;
6242	<	for (MapReduceMappingsToDoubleTask<K,V> t = this, s;;) {
6243	<	int c; BulkTask<K,V,?> par;
6244	<	if ((c = t.pending) == 0) {
6245	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6207	<	t.result = reducer.apply(t.result, s.result);
6208	<	}
6209	<	if ((par = t.parent) == null ||
6210	<	!(par instanceof MapReduceMappingsToDoubleTask)) {
6211	<	t.quietlyComplete();
6212	<	break;
6213	<	}
6214	<	t = (MapReduceMappingsToDoubleTask<K,V>)par;
6215	<	}
6216	<	else if (t.casPending(c, c - 1))
6217	<	break;
6229	>	throw new NullPointerException();
6230	>	double r = this.basis;
6231	>	for (int b; (b = preSplit()) > 0;)
6232	>	(rights = new MapReduceMappingsToDoubleTask<K,V>
6233	>	(map, this, b, rights, transformer, r, reducer)).fork();
6234	>	Object v;
6235	>	while ((v = advance()) != null)
6236	>	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6237	>	result = r;
6238	>	CountedCompleter<?> c;
6239	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6240	>	MapReduceMappingsToDoubleTask<K,V>
6241	>	t = (MapReduceMappingsToDoubleTask<K,V>)c,
6242	>	s = t.rights;
6243	>	while (s != null) {
6244	>	t.result = reducer.apply(t.result, s.result);
6245	>	s = t.rights = s.nextRight;
6246		}
6219	–	} catch (Throwable ex) {
6220	–	return tryCompleteComputation(ex);
6221	–	}
6222	–	MapReduceMappingsToDoubleTask<K,V> s = rights;
6223	–	if (s != null && !inForkJoinPool()) {
6224	–	do  {
6225	–	if (s.tryUnfork())
6226	–	s.exec();
6227	–	} while ((s = s.nextRight) != null);
6247		}
6229	–	return false;
6248		}
6231	–	public final Double getRawResult() { return result; }
6249		}
6250
6251		@SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V>
6252	<	extends BulkTask<K,V,Long> {
6252	>	extends Traverser<K,V,Long> {
6253		final ObjectToLong<? super K> transformer;
6254		final LongByLongToLong reducer;
6255		final long basis;
6256		long result;
6257		MapReduceKeysToLongTask<K,V> rights, nextRight;
6258		MapReduceKeysToLongTask
6259	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6259	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6260		MapReduceKeysToLongTask<K,V> nextRight,
6261		ObjectToLong<? super K> transformer,
6262		long basis,
#	Line 6248 | Line 6265 | public class ConcurrentHashMapV8<K, V>
6265		this.transformer = transformer;
6266		this.basis = basis; this.reducer = reducer;
6267		}
6268	<	@SuppressWarnings("unchecked") public final boolean exec() {
6268	>	public final Long getRawResult() { return result; }
6269	>	@SuppressWarnings("unchecked") public final void compute() {
6270		final ObjectToLong<? super K> transformer =
6271		this.transformer;
6272		final LongByLongToLong reducer = this.reducer;
6273		if (transformer == null || reducer == null)
6274	<	return abortOnNullFunction();
6275	<	try {
6276	<	final long id = this.basis;
6277	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6278	<	do {} while (!casPending(c = pending, c+1));
6279	<	(rights = new MapReduceKeysToLongTask<K,V>
6280	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6281	<	}
6282	<	long r = id;
6283	<	while (advance() != null)
6284	<	r = reducer.apply(r, transformer.apply((K)nextKey));
6285	<	result = r;
6286	<	for (MapReduceKeysToLongTask<K,V> t = this, s;;) {
6287	<	int c; BulkTask<K,V,?> par;
6288	<	if ((c = t.pending) == 0) {
6289	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6272	<	t.result = reducer.apply(t.result, s.result);
6273	<	}
6274	<	if ((par = t.parent) == null ||
6275	<	!(par instanceof MapReduceKeysToLongTask)) {
6276	<	t.quietlyComplete();
6277	<	break;
6278	<	}
6279	<	t = (MapReduceKeysToLongTask<K,V>)par;
6280	<	}
6281	<	else if (t.casPending(c, c - 1))
6282	<	break;
6274	>	throw new NullPointerException();
6275	>	long r = this.basis;
6276	>	for (int b; (b = preSplit()) > 0;)
6277	>	(rights = new MapReduceKeysToLongTask<K,V>
6278	>	(map, this, b, rights, transformer, r, reducer)).fork();
6279	>	while (advance() != null)
6280	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6281	>	result = r;
6282	>	CountedCompleter<?> c;
6283	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6284	>	MapReduceKeysToLongTask<K,V>
6285	>	t = (MapReduceKeysToLongTask<K,V>)c,
6286	>	s = t.rights;
6287	>	while (s != null) {
6288	>	t.result = reducer.apply(t.result, s.result);
6289	>	s = t.rights = s.nextRight;
6290		}
6284	–	} catch (Throwable ex) {
6285	–	return tryCompleteComputation(ex);
6291		}
6287	–	MapReduceKeysToLongTask<K,V> s = rights;
6288	–	if (s != null && !inForkJoinPool()) {
6289	–	do  {
6290	–	if (s.tryUnfork())
6291	–	s.exec();
6292	–	} while ((s = s.nextRight) != null);
6293	–	}
6294	–	return false;
6292		}
6296	–	public final Long getRawResult() { return result; }
6293		}
6294
6295		@SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V>
6296	<	extends BulkTask<K,V,Long> {
6296	>	extends Traverser<K,V,Long> {
6297		final ObjectToLong<? super V> transformer;
6298		final LongByLongToLong reducer;
6299		final long basis;
6300		long result;
6301		MapReduceValuesToLongTask<K,V> rights, nextRight;
6302		MapReduceValuesToLongTask
6303	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6303	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6304		MapReduceValuesToLongTask<K,V> nextRight,
6305		ObjectToLong<? super V> transformer,
6306		long basis,
#	Line 6313 | Line 6309 | public class ConcurrentHashMapV8<K, V>
6309		this.transformer = transformer;
6310		this.basis = basis; this.reducer = reducer;
6311		}
6312	<	@SuppressWarnings("unchecked") public final boolean exec() {
6312	>	public final Long getRawResult() { return result; }
6313	>	@SuppressWarnings("unchecked") public final void compute() {
6314		final ObjectToLong<? super V> transformer =
6315		this.transformer;
6316		final LongByLongToLong reducer = this.reducer;
6317		if (transformer == null || reducer == null)
6318	<	return abortOnNullFunction();
6319	<	try {
6320	<	final long id = this.basis;
6321	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6322	<	do {} while (!casPending(c = pending, c+1));
6323	<	(rights = new MapReduceValuesToLongTask<K,V>
6324	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6325	<	}
6326	<	long r = id;
6327	<	Object v;
6328	<	while ((v = advance()) != null)
6329	<	r = reducer.apply(r, transformer.apply((V)v));
6330	<	result = r;
6331	<	for (MapReduceValuesToLongTask<K,V> t = this, s;;) {
6332	<	int c; BulkTask<K,V,?> par;
6333	<	if ((c = t.pending) == 0) {
6334	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6338	<	t.result = reducer.apply(t.result, s.result);
6339	<	}
6340	<	if ((par = t.parent) == null ||
6341	<	!(par instanceof MapReduceValuesToLongTask)) {
6342	<	t.quietlyComplete();
6343	<	break;
6344	<	}
6345	<	t = (MapReduceValuesToLongTask<K,V>)par;
6346	<	}
6347	<	else if (t.casPending(c, c - 1))
6348	<	break;
6318	>	throw new NullPointerException();
6319	>	long r = this.basis;
6320	>	for (int b; (b = preSplit()) > 0;)
6321	>	(rights = new MapReduceValuesToLongTask<K,V>
6322	>	(map, this, b, rights, transformer, r, reducer)).fork();
6323	>	Object v;
6324	>	while ((v = advance()) != null)
6325	>	r = reducer.apply(r, transformer.apply((V)v));
6326	>	result = r;
6327	>	CountedCompleter<?> c;
6328	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6329	>	MapReduceValuesToLongTask<K,V>
6330	>	t = (MapReduceValuesToLongTask<K,V>)c,
6331	>	s = t.rights;
6332	>	while (s != null) {
6333	>	t.result = reducer.apply(t.result, s.result);
6334	>	s = t.rights = s.nextRight;
6335		}
6350	–	} catch (Throwable ex) {
6351	–	return tryCompleteComputation(ex);
6336		}
6353	–	MapReduceValuesToLongTask<K,V> s = rights;
6354	–	if (s != null && !inForkJoinPool()) {
6355	–	do  {
6356	–	if (s.tryUnfork())
6357	–	s.exec();
6358	–	} while ((s = s.nextRight) != null);
6359	–	}
6360	–	return false;
6337		}
6362	–	public final Long getRawResult() { return result; }
6338		}
6339
6340		@SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V>
6341	<	extends BulkTask<K,V,Long> {
6341	>	extends Traverser<K,V,Long> {
6342		final ObjectToLong<Map.Entry<K,V>> transformer;
6343		final LongByLongToLong reducer;
6344		final long basis;
6345		long result;
6346		MapReduceEntriesToLongTask<K,V> rights, nextRight;
6347		MapReduceEntriesToLongTask
6348	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6348	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6349		MapReduceEntriesToLongTask<K,V> nextRight,
6350		ObjectToLong<Map.Entry<K,V>> transformer,
6351		long basis,
#	Line 6379 | Line 6354 | public class ConcurrentHashMapV8<K, V>
6354		this.transformer = transformer;
6355		this.basis = basis; this.reducer = reducer;
6356		}
6357	<	@SuppressWarnings("unchecked") public final boolean exec() {
6357	>	public final Long getRawResult() { return result; }
6358	>	@SuppressWarnings("unchecked") public final void compute() {
6359		final ObjectToLong<Map.Entry<K,V>> transformer =
6360		this.transformer;
6361		final LongByLongToLong reducer = this.reducer;
6362		if (transformer == null || reducer == null)
6363	<	return abortOnNullFunction();
6364	<	try {
6365	<	final long id = this.basis;
6366	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6367	<	do {} while (!casPending(c = pending, c+1));
6368	<	(rights = new MapReduceEntriesToLongTask<K,V>
6369	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6370	<	}
6371	<	long r = id;
6372	<	Object v;
6373	<	while ((v = advance()) != null)
6374	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6375	<	result = r;
6376	<	for (MapReduceEntriesToLongTask<K,V> t = this, s;;) {
6377	<	int c; BulkTask<K,V,?> par;
6378	<	if ((c = t.pending) == 0) {
6379	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6404	<	t.result = reducer.apply(t.result, s.result);
6405	<	}
6406	<	if ((par = t.parent) == null ||
6407	<	!(par instanceof MapReduceEntriesToLongTask)) {
6408	<	t.quietlyComplete();
6409	<	break;
6410	<	}
6411	<	t = (MapReduceEntriesToLongTask<K,V>)par;
6412	<	}
6413	<	else if (t.casPending(c, c - 1))
6414	<	break;
6363	>	throw new NullPointerException();
6364	>	long r = this.basis;
6365	>	for (int b; (b = preSplit()) > 0;)
6366	>	(rights = new MapReduceEntriesToLongTask<K,V>
6367	>	(map, this, b, rights, transformer, r, reducer)).fork();
6368	>	Object v;
6369	>	while ((v = advance()) != null)
6370	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6371	>	result = r;
6372	>	CountedCompleter<?> c;
6373	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6374	>	MapReduceEntriesToLongTask<K,V>
6375	>	t = (MapReduceEntriesToLongTask<K,V>)c,
6376	>	s = t.rights;
6377	>	while (s != null) {
6378	>	t.result = reducer.apply(t.result, s.result);
6379	>	s = t.rights = s.nextRight;
6380		}
6416	–	} catch (Throwable ex) {
6417	–	return tryCompleteComputation(ex);
6418	–	}
6419	–	MapReduceEntriesToLongTask<K,V> s = rights;
6420	–	if (s != null && !inForkJoinPool()) {
6421	–	do  {
6422	–	if (s.tryUnfork())
6423	–	s.exec();
6424	–	} while ((s = s.nextRight) != null);
6381		}
6426	–	return false;
6382		}
6428	–	public final Long getRawResult() { return result; }
6383		}
6384
6385		@SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V>
6386	<	extends BulkTask<K,V,Long> {
6386	>	extends Traverser<K,V,Long> {
6387		final ObjectByObjectToLong<? super K, ? super V> transformer;
6388		final LongByLongToLong reducer;
6389		final long basis;
6390		long result;
6391		MapReduceMappingsToLongTask<K,V> rights, nextRight;
6392		MapReduceMappingsToLongTask
6393	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6393	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6394		MapReduceMappingsToLongTask<K,V> nextRight,
6395		ObjectByObjectToLong<? super K, ? super V> transformer,
6396		long basis,
#	Line 6445 | Line 6399 | public class ConcurrentHashMapV8<K, V>
6399		this.transformer = transformer;
6400		this.basis = basis; this.reducer = reducer;
6401		}
6402	<	@SuppressWarnings("unchecked") public final boolean exec() {
6402	>	public final Long getRawResult() { return result; }
6403	>	@SuppressWarnings("unchecked") public final void compute() {
6404		final ObjectByObjectToLong<? super K, ? super V> transformer =
6405		this.transformer;
6406		final LongByLongToLong reducer = this.reducer;
6407		if (transformer == null || reducer == null)
6408	<	return abortOnNullFunction();
6409	<	try {
6410	<	final long id = this.basis;
6411	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6412	<	do {} while (!casPending(c = pending, c+1));
6413	<	(rights = new MapReduceMappingsToLongTask<K,V>
6414	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6415	<	}
6416	<	long r = id;
6417	<	Object v;
6418	<	while ((v = advance()) != null)
6419	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6420	<	result = r;
6421	<	for (MapReduceMappingsToLongTask<K,V> t = this, s;;) {
6422	<	int c; BulkTask<K,V,?> par;
6423	<	if ((c = t.pending) == 0) {
6424	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6470	<	t.result = reducer.apply(t.result, s.result);
6471	<	}
6472	<	if ((par = t.parent) == null ||
6473	<	!(par instanceof MapReduceMappingsToLongTask)) {
6474	<	t.quietlyComplete();
6475	<	break;
6476	<	}
6477	<	t = (MapReduceMappingsToLongTask<K,V>)par;
6478	<	}
6479	<	else if (t.casPending(c, c - 1))
6480	<	break;
6408	>	throw new NullPointerException();
6409	>	long r = this.basis;
6410	>	for (int b; (b = preSplit()) > 0;)
6411	>	(rights = new MapReduceMappingsToLongTask<K,V>
6412	>	(map, this, b, rights, transformer, r, reducer)).fork();
6413	>	Object v;
6414	>	while ((v = advance()) != null)
6415	>	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6416	>	result = r;
6417	>	CountedCompleter<?> c;
6418	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6419	>	MapReduceMappingsToLongTask<K,V>
6420	>	t = (MapReduceMappingsToLongTask<K,V>)c,
6421	>	s = t.rights;
6422	>	while (s != null) {
6423	>	t.result = reducer.apply(t.result, s.result);
6424	>	s = t.rights = s.nextRight;
6425		}
6482	–	} catch (Throwable ex) {
6483	–	return tryCompleteComputation(ex);
6484	–	}
6485	–	MapReduceMappingsToLongTask<K,V> s = rights;
6486	–	if (s != null && !inForkJoinPool()) {
6487	–	do  {
6488	–	if (s.tryUnfork())
6489	–	s.exec();
6490	–	} while ((s = s.nextRight) != null);
6426		}
6492	–	return false;
6427		}
6494	–	public final Long getRawResult() { return result; }
6428		}
6429
6430		@SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V>
6431	<	extends BulkTask<K,V,Integer> {
6431	>	extends Traverser<K,V,Integer> {
6432		final ObjectToInt<? super K> transformer;
6433		final IntByIntToInt reducer;
6434		final int basis;
6435		int result;
6436		MapReduceKeysToIntTask<K,V> rights, nextRight;
6437		MapReduceKeysToIntTask
6438	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6438	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6439		MapReduceKeysToIntTask<K,V> nextRight,
6440		ObjectToInt<? super K> transformer,
6441		int basis,
#	Line 6511 | Line 6444 | public class ConcurrentHashMapV8<K, V>
6444		this.transformer = transformer;
6445		this.basis = basis; this.reducer = reducer;
6446		}
6447	<	@SuppressWarnings("unchecked") public final boolean exec() {
6447	>	public final Integer getRawResult() { return result; }
6448	>	@SuppressWarnings("unchecked") public final void compute() {
6449		final ObjectToInt<? super K> transformer =
6450		this.transformer;
6451		final IntByIntToInt reducer = this.reducer;
6452		if (transformer == null || reducer == null)
6453	<	return abortOnNullFunction();
6454	<	try {
6455	<	final int id = this.basis;
6456	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6457	<	do {} while (!casPending(c = pending, c+1));
6458	<	(rights = new MapReduceKeysToIntTask<K,V>
6459	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6460	<	}
6461	<	int r = id;
6462	<	while (advance() != null)
6463	<	r = reducer.apply(r, transformer.apply((K)nextKey));
6464	<	result = r;
6465	<	for (MapReduceKeysToIntTask<K,V> t = this, s;;) {
6466	<	int c; BulkTask<K,V,?> par;
6467	<	if ((c = t.pending) == 0) {
6468	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6535	<	t.result = reducer.apply(t.result, s.result);
6536	<	}
6537	<	if ((par = t.parent) == null ||
6538	<	!(par instanceof MapReduceKeysToIntTask)) {
6539	<	t.quietlyComplete();
6540	<	break;
6541	<	}
6542	<	t = (MapReduceKeysToIntTask<K,V>)par;
6543	<	}
6544	<	else if (t.casPending(c, c - 1))
6545	<	break;
6453	>	throw new NullPointerException();
6454	>	int r = this.basis;
6455	>	for (int b; (b = preSplit()) > 0;)
6456	>	(rights = new MapReduceKeysToIntTask<K,V>
6457	>	(map, this, b, rights, transformer, r, reducer)).fork();
6458	>	while (advance() != null)
6459	>	r = reducer.apply(r, transformer.apply((K)nextKey));
6460	>	result = r;
6461	>	CountedCompleter<?> c;
6462	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6463	>	MapReduceKeysToIntTask<K,V>
6464	>	t = (MapReduceKeysToIntTask<K,V>)c,
6465	>	s = t.rights;
6466	>	while (s != null) {
6467	>	t.result = reducer.apply(t.result, s.result);
6468	>	s = t.rights = s.nextRight;
6469		}
6547	–	} catch (Throwable ex) {
6548	–	return tryCompleteComputation(ex);
6470		}
6550	–	MapReduceKeysToIntTask<K,V> s = rights;
6551	–	if (s != null && !inForkJoinPool()) {
6552	–	do  {
6553	–	if (s.tryUnfork())
6554	–	s.exec();
6555	–	} while ((s = s.nextRight) != null);
6556	–	}
6557	–	return false;
6471		}
6559	–	public final Integer getRawResult() { return result; }
6472		}
6473
6474		@SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V>
6475	<	extends BulkTask<K,V,Integer> {
6475	>	extends Traverser<K,V,Integer> {
6476		final ObjectToInt<? super V> transformer;
6477		final IntByIntToInt reducer;
6478		final int basis;
6479		int result;
6480		MapReduceValuesToIntTask<K,V> rights, nextRight;
6481		MapReduceValuesToIntTask
6482	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6482	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6483		MapReduceValuesToIntTask<K,V> nextRight,
6484		ObjectToInt<? super V> transformer,
6485		int basis,
#	Line 6576 | Line 6488 | public class ConcurrentHashMapV8<K, V>
6488		this.transformer = transformer;
6489		this.basis = basis; this.reducer = reducer;
6490		}
6491	<	@SuppressWarnings("unchecked") public final boolean exec() {
6491	>	public final Integer getRawResult() { return result; }
6492	>	@SuppressWarnings("unchecked") public final void compute() {
6493		final ObjectToInt<? super V> transformer =
6494		this.transformer;
6495		final IntByIntToInt reducer = this.reducer;
6496		if (transformer == null || reducer == null)
6497	<	return abortOnNullFunction();
6498	<	try {
6499	<	final int id = this.basis;
6500	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6501	<	do {} while (!casPending(c = pending, c+1));
6502	<	(rights = new MapReduceValuesToIntTask<K,V>
6503	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6504	<	}
6505	<	int r = id;
6506	<	Object v;
6507	<	while ((v = advance()) != null)
6508	<	r = reducer.apply(r, transformer.apply((V)v));
6509	<	result = r;
6510	<	for (MapReduceValuesToIntTask<K,V> t = this, s;;) {
6511	<	int c; BulkTask<K,V,?> par;
6512	<	if ((c = t.pending) == 0) {
6513	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6601	<	t.result = reducer.apply(t.result, s.result);
6602	<	}
6603	<	if ((par = t.parent) == null ||
6604	<	!(par instanceof MapReduceValuesToIntTask)) {
6605	<	t.quietlyComplete();
6606	<	break;
6607	<	}
6608	<	t = (MapReduceValuesToIntTask<K,V>)par;
6609	<	}
6610	<	else if (t.casPending(c, c - 1))
6611	<	break;
6497	>	throw new NullPointerException();
6498	>	int r = this.basis;
6499	>	for (int b; (b = preSplit()) > 0;)
6500	>	(rights = new MapReduceValuesToIntTask<K,V>
6501	>	(map, this, b, rights, transformer, r, reducer)).fork();
6502	>	Object v;
6503	>	while ((v = advance()) != null)
6504	>	r = reducer.apply(r, transformer.apply((V)v));
6505	>	result = r;
6506	>	CountedCompleter<?> c;
6507	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6508	>	MapReduceValuesToIntTask<K,V>
6509	>	t = (MapReduceValuesToIntTask<K,V>)c,
6510	>	s = t.rights;
6511	>	while (s != null) {
6512	>	t.result = reducer.apply(t.result, s.result);
6513	>	s = t.rights = s.nextRight;
6514		}
6613	–	} catch (Throwable ex) {
6614	–	return tryCompleteComputation(ex);
6615	–	}
6616	–	MapReduceValuesToIntTask<K,V> s = rights;
6617	–	if (s != null && !inForkJoinPool()) {
6618	–	do  {
6619	–	if (s.tryUnfork())
6620	–	s.exec();
6621	–	} while ((s = s.nextRight) != null);
6515		}
6623	–	return false;
6516		}
6625	–	public final Integer getRawResult() { return result; }
6517		}
6518
6519		@SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V>
6520	<	extends BulkTask<K,V,Integer> {
6520	>	extends Traverser<K,V,Integer> {
6521		final ObjectToInt<Map.Entry<K,V>> transformer;
6522		final IntByIntToInt reducer;
6523		final int basis;
6524		int result;
6525		MapReduceEntriesToIntTask<K,V> rights, nextRight;
6526		MapReduceEntriesToIntTask
6527	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6527	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6528		MapReduceEntriesToIntTask<K,V> nextRight,
6529		ObjectToInt<Map.Entry<K,V>> transformer,
6530		int basis,
#	Line 6642 | Line 6533 | public class ConcurrentHashMapV8<K, V>
6533		this.transformer = transformer;
6534		this.basis = basis; this.reducer = reducer;
6535		}
6536	<	@SuppressWarnings("unchecked") public final boolean exec() {
6536	>	public final Integer getRawResult() { return result; }
6537	>	@SuppressWarnings("unchecked") public final void compute() {
6538		final ObjectToInt<Map.Entry<K,V>> transformer =
6539		this.transformer;
6540		final IntByIntToInt reducer = this.reducer;
6541		if (transformer == null || reducer == null)
6542	<	return abortOnNullFunction();
6543	<	try {
6544	<	final int id = this.basis;
6545	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6546	<	do {} while (!casPending(c = pending, c+1));
6547	<	(rights = new MapReduceEntriesToIntTask<K,V>
6548	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6549	<	}
6550	<	int r = id;
6551	<	Object v;
6552	<	while ((v = advance()) != null)
6553	<	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6554	<	result = r;
6555	<	for (MapReduceEntriesToIntTask<K,V> t = this, s;;) {
6556	<	int c; BulkTask<K,V,?> par;
6557	<	if ((c = t.pending) == 0) {
6558	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6667	<	t.result = reducer.apply(t.result, s.result);
6668	<	}
6669	<	if ((par = t.parent) == null ||
6670	<	!(par instanceof MapReduceEntriesToIntTask)) {
6671	<	t.quietlyComplete();
6672	<	break;
6673	<	}
6674	<	t = (MapReduceEntriesToIntTask<K,V>)par;
6675	<	}
6676	<	else if (t.casPending(c, c - 1))
6677	<	break;
6542	>	throw new NullPointerException();
6543	>	int r = this.basis;
6544	>	for (int b; (b = preSplit()) > 0;)
6545	>	(rights = new MapReduceEntriesToIntTask<K,V>
6546	>	(map, this, b, rights, transformer, r, reducer)).fork();
6547	>	Object v;
6548	>	while ((v = advance()) != null)
6549	>	r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v)));
6550	>	result = r;
6551	>	CountedCompleter<?> c;
6552	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6553	>	MapReduceEntriesToIntTask<K,V>
6554	>	t = (MapReduceEntriesToIntTask<K,V>)c,
6555	>	s = t.rights;
6556	>	while (s != null) {
6557	>	t.result = reducer.apply(t.result, s.result);
6558	>	s = t.rights = s.nextRight;
6559		}
6679	–	} catch (Throwable ex) {
6680	–	return tryCompleteComputation(ex);
6560		}
6682	–	MapReduceEntriesToIntTask<K,V> s = rights;
6683	–	if (s != null && !inForkJoinPool()) {
6684	–	do  {
6685	–	if (s.tryUnfork())
6686	–	s.exec();
6687	–	} while ((s = s.nextRight) != null);
6688	–	}
6689	–	return false;
6561		}
6691	–	public final Integer getRawResult() { return result; }
6562		}
6563
6564		@SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V>
6565	<	extends BulkTask<K,V,Integer> {
6565	>	extends Traverser<K,V,Integer> {
6566		final ObjectByObjectToInt<? super K, ? super V> transformer;
6567		final IntByIntToInt reducer;
6568		final int basis;
6569		int result;
6570		MapReduceMappingsToIntTask<K,V> rights, nextRight;
6571		MapReduceMappingsToIntTask
6572	<	(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b,
6573	<	MapReduceMappingsToIntTask<K,V> rights,
6572	>	(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
6573	>	MapReduceMappingsToIntTask<K,V> nextRight,
6574		ObjectByObjectToInt<? super K, ? super V> transformer,
6575		int basis,
6576		IntByIntToInt reducer) {
#	Line 6708 | Line 6578 | public class ConcurrentHashMapV8<K, V>
6578		this.transformer = transformer;
6579		this.basis = basis; this.reducer = reducer;
6580		}
6581	<	@SuppressWarnings("unchecked") public final boolean exec() {
6581	>	public final Integer getRawResult() { return result; }
6582	>	@SuppressWarnings("unchecked") public final void compute() {
6583		final ObjectByObjectToInt<? super K, ? super V> transformer =
6584		this.transformer;
6585		final IntByIntToInt reducer = this.reducer;
6586		if (transformer == null || reducer == null)
6587	<	return abortOnNullFunction();
6588	<	try {
6589	<	final int id = this.basis;
6590	<	for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) {
6591	<	do {} while (!casPending(c = pending, c+1));
6592	<	(rights = new MapReduceMappingsToIntTask<K,V>
6593	<	(map, this, b >>>= 1, rights, transformer, id, reducer)).fork();
6594	<	}
6595	<	int r = id;
6596	<	Object v;
6597	<	while ((v = advance()) != null)
6598	<	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6599	<	result = r;
6600	<	for (MapReduceMappingsToIntTask<K,V> t = this, s;;) {
6601	<	int c; BulkTask<K,V,?> par;
6602	<	if ((c = t.pending) == 0) {
6603	<	for (s = t.rights; s != null; s = t.rights = s.nextRight) {
6733	<	t.result = reducer.apply(t.result, s.result);
6734	<	}
6735	<	if ((par = t.parent) == null ||
6736	<	!(par instanceof MapReduceMappingsToIntTask)) {
6737	<	t.quietlyComplete();
6738	<	break;
6739	<	}
6740	<	t = (MapReduceMappingsToIntTask<K,V>)par;
6741	<	}
6742	<	else if (t.casPending(c, c - 1))
6743	<	break;
6587	>	throw new NullPointerException();
6588	>	int r = this.basis;
6589	>	for (int b; (b = preSplit()) > 0;)
6590	>	(rights = new MapReduceMappingsToIntTask<K,V>
6591	>	(map, this, b, rights, transformer, r, reducer)).fork();
6592	>	Object v;
6593	>	while ((v = advance()) != null)
6594	>	r = reducer.apply(r, transformer.apply((K)nextKey, (V)v));
6595	>	result = r;
6596	>	CountedCompleter<?> c;
6597	>	for (c = firstComplete(); c != null; c = c.nextComplete()) {
6598	>	MapReduceMappingsToIntTask<K,V>
6599	>	t = (MapReduceMappingsToIntTask<K,V>)c,
6600	>	s = t.rights;
6601	>	while (s != null) {
6602	>	t.result = reducer.apply(t.result, s.result);
6603	>	s = t.rights = s.nextRight;
6604		}
6745	–	} catch (Throwable ex) {
6746	–	return tryCompleteComputation(ex);
6605		}
6748	–	MapReduceMappingsToIntTask<K,V> s = rights;
6749	–	if (s != null && !inForkJoinPool()) {
6750	–	do  {
6751	–	if (s.tryUnfork())
6752	–	s.exec();
6753	–	} while ((s = s.nextRight) != null);
6754	–	}
6755	–	return false;
6606		}
6757	–	public final Integer getRawResult() { return result; }
6607		}
6608
6760	–
6609		// Unsafe mechanics
6610		private static final sun.misc.Unsafe UNSAFE;
6611		private static final long counterOffset;

Diff Legend

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