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.48 by jsr166, Fri Jul 6 21:39:18 2012 UTC vs.
Revision 1.57 by dl, Mon Aug 13 19:52:33 2012 UTC

#	Line 6 | Line 6
6
7		package jsr166e;
8		import jsr166e.LongAdder;
9	+	import jsr166e.ForkJoinPool;
10	+	import jsr166e.ForkJoinTask;
11	+
12	+	import java.util.Comparator;
13		import java.util.Arrays;
14		import java.util.Map;
15		import java.util.Set;
#	Line 23 | Line 27 | import java.util.concurrent.ConcurrentMa
27		import java.util.concurrent.ThreadLocalRandom;
28		import java.util.concurrent.locks.LockSupport;
29		import java.util.concurrent.locks.AbstractQueuedSynchronizer;
30	+	import java.util.concurrent.atomic.AtomicReference;
31	+
32		import java.io.Serializable;
33
34		/**
#	Line 88 | Line 94 | import java.io.Serializable;
94		* Java Collections Framework</a>.
95		*
96		* <p><em>jsr166e note: This class is a candidate replacement for
97	<	* java.util.concurrent.ConcurrentHashMap.<em>
97	>	* java.util.concurrent.ConcurrentHashMap.  During transition, this
98	>	* class declares and uses nested functional interfaces with different
99	>	* names but the same forms as those expected for JDK8.<em>
100		*
101		* @since 1.5
102		* @author Doug Lea
#	Line 96 | Line 104 | import java.io.Serializable;
104		* @param <V> the type of mapped values
105		*/
106		public class ConcurrentHashMapV8<K, V>
107	<	implements ConcurrentMap<K, V>, Serializable {
107	>	implements ConcurrentMap<K, V>, Serializable {
108		private static final long serialVersionUID = 7249069246763182397L;
109
110		/**
103	–	* A function computing a mapping from the given key to a value.
104	–	* This is a place-holder for an upcoming JDK8 interface.
105	–	*/
106	–	public static interface MappingFunction<K, V> {
107	–	/**
108	–	* Returns a value for the given key, or null if there is no mapping.
109	–	*
110	–	* @param key the (non-null) key
111	–	* @return a value for the key, or null if none
112	–	*/
113	–	V map(K key);
114	–	}
115	–
116	–	/**
117	–	* A function computing a new mapping given a key and its current
118	–	* mapped value (or {@code null} if there is no current
119	–	* mapping). This is a place-holder for an upcoming JDK8
120	–	* interface.
121	–	*/
122	–	public static interface RemappingFunction<K, V> {
123	–	/**
124	–	* Returns a new value given a key and its current value.
125	–	*
126	–	* @param key the (non-null) key
127	–	* @param value the current value, or null if there is no mapping
128	–	* @return a value for the key, or null if none
129	–	*/
130	–	V remap(K key, V value);
131	–	}
132	–
133	–	/**
111		* A partitionable iterator. A Spliterator can be traversed
112		* directly, but can also be partitioned (before traversal) by
113		* creating another Spliterator that covers a non-overlapping
#	Line 150 | Line 127 | public class ConcurrentHashMapV8<K, V>
127		*
128		* <pre>
129		* {@code ConcurrentHashMapV8<String, Long> m = ...
130	<	* // Uses parallel depth of log2 of size / (parallelism * slack of 8).
131	<	* int depth = 32 - Integer.numberOfLeadingZeros(m.size() / (aForkJoinPool.getParallelism() * 8));
132	<	* long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), depth, null));
130	>	* // split as if have 8 * parallelism, for load balance
131	>	* int n = m.size();
132	>	* int p = aForkJoinPool.getParallelism() * 8;
133	>	* int split = (n < p)? n : p;
134	>	* long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
135		* // ...
136		* static class SumValues extends RecursiveTask<Long> {
137		*   final Spliterator<Long> s;
138	<	*   final int depth;             // number of splits before processing
138	>	*   final int split;             // split while > 1
139		*   final SumValues nextJoin;    // records forked subtasks to join
140		*   SumValues(Spliterator<Long> s, int depth, SumValues nextJoin) {
141		*     this.s = s; this.depth = depth; this.nextJoin = nextJoin;
#	Line 164 | Line 143 | public class ConcurrentHashMapV8<K, V>
143		*   public Long compute() {
144		*     long sum = 0;
145		*     SumValues subtasks = null; // fork subtasks
146	<	*     for (int d = depth - 1; d >= 0; --d)
147	<	*       (subtasks = new SumValues(s.split(), d, subtasks)).fork();
146	>	*     for (int s = split >>> 1; s > 0; s >>>= 1)
147	>	*       (subtasks = new SumValues(s.split(), s, subtasks)).fork();
148		*     while (s.hasNext())        // directly process remaining elements
149		*       sum += s.next();
150		*     for (SumValues t = subtasks; t != null; t = t.nextJoin)
#	Line 348 | Line 327 | public class ConcurrentHashMapV8<K, V>
327		* When there are no lock acquisition failures, this is arranged
328		* simply by proceeding from the last bin (table.length - 1) up
329		* towards the first.  Upon seeing a forwarding node, traversals
330	<	* (see class InternalIterator) arrange to move to the new table
330	>	* (see class Iter) arrange to move to the new table
331		* without revisiting nodes.  However, when any node is skipped
332		* during a transfer, all earlier table bins may have become
333		* visible, so are initialized with a reverse-forwarding node back
#	Line 358 | Line 337 | public class ConcurrentHashMapV8<K, V>
337		* mechanics trigger only when necessary.
338		*
339		* The traversal scheme also applies to partial traversals of
340	<	* ranges of bins (via an alternate InternalIterator constructor)
340	>	* ranges of bins (via an alternate Traverser constructor)
341		* to support partitioned aggregate operations.  Also, read-only
342		* operations give up if ever forwarded to a null table, which
343		* provides support for shutdown-style clearing, which is also not
#	Line 500 | Line 479 | public class ConcurrentHashMapV8<K, V>
479		* inline assignments below.
480		*/
481
482	<	static final Node tabAt(Node[] tab, int i) { // used by InternalIterator
482	>	static final Node tabAt(Node[] tab, int i) { // used by Iter
483		return (Node)UNSAFE.getObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE);
484		}
485
#	Line 648 | Line 627 | public class ConcurrentHashMapV8<K, V>
627		* TreeBins also maintain a separate locking discipline than
628		* regular bins. Because they are forwarded via special MOVED
629		* nodes at bin heads (which can never change once established),
630	<	* we cannot use use those nodes as locks. Instead, TreeBin
630	>	* we cannot use those nodes as locks. Instead, TreeBin
631		* extends AbstractQueuedSynchronizer to support a simple form of
632		* read-write lock. For update operations and table validation,
633		* the exclusive form of lock behaves in the same way as bin-head
#	Line 733 | Line 712 | public class ConcurrentHashMapV8<K, V>
712		}
713
714		/**
715	<	* Return the TreeNode (or null if not found) for the given key
715	>	* Returns the TreeNode (or null if not found) for the given key
716		* starting at given root.
717		*/
718		@SuppressWarnings("unchecked") // suppress Comparable cast warning
719	<	final TreeNode getTreeNode(int h, Object k, TreeNode p) {
719	>	final TreeNode getTreeNode(int h, Object k, TreeNode p) {
720		Class<?> c = k.getClass();
721		while (p != null) {
722		int dir, ph;  Object pk; Class<?> pc;
#	Line 798 | Line 777 | public class ConcurrentHashMapV8<K, V>
777		* @return null if added
778		*/
779		@SuppressWarnings("unchecked") // suppress Comparable cast warning
780	<	final TreeNode putTreeNode(int h, Object k, Object v) {
780	>	final TreeNode putTreeNode(int h, Object k, Object v) {
781		Class<?> c = k.getClass();
782		TreeNode pp = root, p = null;
783		int dir = 0;
#	Line 1439 | Line 1418 | public class ConcurrentHashMapV8<K, V>
1418
1419		/** Implementation for computeIfAbsent */
1420		private final Object internalComputeIfAbsent(K k,
1421	<	MappingFunction<? super K, ?> mf) {
1421	>	Fun<? super K, ?> mf) {
1422		int h = spread(k.hashCode());
1423		Object val = null;
1424		int count = 0;
#	Line 1452 | Line 1431 | public class ConcurrentHashMapV8<K, V>
1431		if (casTabAt(tab, i, null, node)) {
1432		count = 1;
1433		try {
1434	<	if ((val = mf.map(k)) != null)
1434	>	if ((val = mf.apply(k)) != null)
1435		node.val = val;
1436		} finally {
1437		if (val == null)
#	Line 1477 | Line 1456 | public class ConcurrentHashMapV8<K, V>
1456		TreeNode p = t.getTreeNode(h, k, t.root);
1457		if (p != null)
1458		val = p.val;
1459	<	else if ((val = mf.map(k)) != null) {
1459	>	else if ((val = mf.apply(k)) != null) {
1460		added = true;
1461		count = 2;
1462		t.putTreeNode(h, k, val);
#	Line 1531 | Line 1510 | public class ConcurrentHashMapV8<K, V>
1510		}
1511		Node last = e;
1512		if ((e = e.next) == null) {
1513	<	if ((val = mf.map(k)) != null) {
1513	>	if ((val = mf.apply(k)) != null) {
1514		added = true;
1515		last.next = new Node(h, k, val, null);
1516		if (count >= TREE_THRESHOLD)
#	Line 1567 | Line 1546 | public class ConcurrentHashMapV8<K, V>
1546
1547		/** Implementation for compute */
1548		@SuppressWarnings("unchecked")
1549	<	private final Object internalCompute(K k,
1550	<	RemappingFunction<? super K, V> mf) {
1549	>	private final Object internalCompute(K k, boolean onlyIfPresent,
1550	>	BiFun<? super K, ? super V, ? extends V> mf) {
1551		int h = spread(k.hashCode());
1552		Object val = null;
1553		int delta = 0;
#	Line 1578 | Line 1557 | public class ConcurrentHashMapV8<K, V>
1557		if (tab == null)
1558		tab = initTable();
1559		else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1560	+	if (onlyIfPresent)
1561	+	break;
1562		Node node = new Node(fh = h | LOCKED, k, null, null);
1563		if (casTabAt(tab, i, null, node)) {
1564		try {
1565		count = 1;
1566	<	if ((val = mf.remap(k, null)) != null) {
1566	>	if ((val = mf.apply(k, null)) != null) {
1567		node.val = val;
1568		delta = 1;
1569		}
#	Line 1607 | Line 1588 | public class ConcurrentHashMapV8<K, V>
1588		count = 1;
1589		TreeNode p = t.getTreeNode(h, k, t.root);
1590		Object pv = (p == null) ? null : p.val;
1591	<	if ((val = mf.remap(k, (V)pv)) != null) {
1591	>	if ((val = mf.apply(k, (V)pv)) != null) {
1592		if (p != null)
1593		p.val = val;
1594		else {
#	Line 1643 | Line 1624 | public class ConcurrentHashMapV8<K, V>
1624		if ((e.hash & HASH_BITS) == h &&
1625		(ev = e.val) != null &&
1626		((ek = e.key) == k || k.equals(ek))) {
1627	<	val = mf.remap(k, (V)ev);
1627	>	val = mf.apply(k, (V)ev);
1628		if (val != null)
1629		e.val = val;
1630		else {
#	Line 1658 | Line 1639 | public class ConcurrentHashMapV8<K, V>
1639		}
1640		pred = e;
1641		if ((e = e.next) == null) {
1642	<	if ((val = mf.remap(k, null)) != null) {
1642	>	if (!onlyIfPresent && (val = mf.apply(k, null)) != null) {
1643		pred.next = new Node(h, k, val, null);
1644		delta = 1;
1645		if (count >= TREE_THRESHOLD)
#	Line 1689 | Line 1670 | public class ConcurrentHashMapV8<K, V>
1670		return val;
1671		}
1672
1673	+	private final Object internalMerge(K k, V v,
1674	+	BiFun<? super V, ? super V, ? extends V> mf) {
1675	+	int h = spread(k.hashCode());
1676	+	Object val = null;
1677	+	int delta = 0;
1678	+	int count = 0;
1679	+	for (Node[] tab = table;;) {
1680	+	int i; Node f; int fh; Object fk, fv;
1681	+	if (tab == null)
1682	+	tab = initTable();
1683	+	else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
1684	+	if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
1685	+	delta = 1;
1686	+	val = v;
1687	+	break;
1688	+	}
1689	+	}
1690	+	else if ((fh = f.hash) == MOVED) {
1691	+	if ((fk = f.key) instanceof TreeBin) {
1692	+	TreeBin t = (TreeBin)fk;
1693	+	t.acquire(0);
1694	+	try {
1695	+	if (tabAt(tab, i) == f) {
1696	+	count = 1;
1697	+	TreeNode p = t.getTreeNode(h, k, t.root);
1698	+	val = (p == null) ? v : mf.apply((V)p.val, v);
1699	+	if (val != null) {
1700	+	if (p != null)
1701	+	p.val = val;
1702	+	else {
1703	+	count = 2;
1704	+	delta = 1;
1705	+	t.putTreeNode(h, k, val);
1706	+	}
1707	+	}
1708	+	else if (p != null) {
1709	+	delta = -1;
1710	+	t.deleteTreeNode(p);
1711	+	}
1712	+	}
1713	+	} finally {
1714	+	t.release(0);
1715	+	}
1716	+	if (count != 0)
1717	+	break;
1718	+	}
1719	+	else
1720	+	tab = (Node[])fk;
1721	+	}
1722	+	else if ((fh & LOCKED) != 0) {
1723	+	checkForResize();
1724	+	f.tryAwaitLock(tab, i);
1725	+	}
1726	+	else if (f.casHash(fh, fh | LOCKED)) {
1727	+	try {
1728	+	if (tabAt(tab, i) == f) {
1729	+	count = 1;
1730	+	for (Node e = f, pred = null;; ++count) {
1731	+	Object ek, ev;
1732	+	if ((e.hash & HASH_BITS) == h &&
1733	+	(ev = e.val) != null &&
1734	+	((ek = e.key) == k || k.equals(ek))) {
1735	+	val = mf.apply(v, (V)ev);
1736	+	if (val != null)
1737	+	e.val = val;
1738	+	else {
1739	+	delta = -1;
1740	+	Node en = e.next;
1741	+	if (pred != null)
1742	+	pred.next = en;
1743	+	else
1744	+	setTabAt(tab, i, en);
1745	+	}
1746	+	break;
1747	+	}
1748	+	pred = e;
1749	+	if ((e = e.next) == null) {
1750	+	val = v;
1751	+	pred.next = new Node(h, k, val, null);
1752	+	delta = 1;
1753	+	if (count >= TREE_THRESHOLD)
1754	+	replaceWithTreeBin(tab, i, k);
1755	+	break;
1756	+	}
1757	+	}
1758	+	}
1759	+	} finally {
1760	+	if (!f.casHash(fh | LOCKED, fh)) {
1761	+	f.hash = fh;
1762	+	synchronized (f) { f.notifyAll(); };
1763	+	}
1764	+	}
1765	+	if (count != 0) {
1766	+	if (tab.length <= 64)
1767	+	count = 2;
1768	+	break;
1769	+	}
1770	+	}
1771	+	}
1772	+	if (delta != 0) {
1773	+	counter.add((long)delta);
1774	+	if (count > 1)
1775	+	checkForResize();
1776	+	}
1777	+	return val;
1778	+	}
1779	+
1780		/** Implementation for putAll */
1781		private final void internalPutAll(Map<?, ?> m) {
1782		tryPresize(m.size());
#	Line 2168 | Line 2256 | public class ConcurrentHashMapV8<K, V>
2256		* paranoically cope with potential sharing by users of iterators
2257		* across threads, iteration terminates if a bounds checks fails
2258		* for a table read.
2259	+	*
2260	+	* This class extends ForkJoinTask to streamline parallel
2261	+	* iteration in bulk operations (see BulkTask). This adds only an
2262	+	* int of space overhead, which is close enough to negligible in
2263	+	* cases where it is not needed to not worry about it.
2264		*/
2265	<	static class InternalIterator<K,V> {
2265	>	static class Traverser<K,V,R> extends ForkJoinTask<R> {
2266		final ConcurrentHashMapV8<K, V> map;
2267		Node next;           // the next entry to use
2268		Node last;           // the last entry used
#	Line 2182 | Line 2275 | public class ConcurrentHashMapV8<K, V>
2275		final int baseSize;  // initial table size
2276
2277		/** Creates iterator for all entries in the table. */
2278	<	InternalIterator(ConcurrentHashMapV8<K, V> map) {
2278	>	Traverser(ConcurrentHashMapV8<K, V> map) {
2279		this.tab = (this.map = map).table;
2280		baseLimit = baseSize = (tab == null) ? 0 : tab.length;
2281		}
2282
2283	<	/** Creates iterator for clone() and split() methods. */
2284	<	InternalIterator(InternalIterator<K,V> it, boolean split) {
2283	>	/** Creates iterator for split() methods */
2284	>	Traverser(Traverser<K,V,?> it, boolean split) {
2285		this.map = it.map;
2286		this.tab = it.tab;
2287		this.baseSize = it.baseSize;
2288		int lo = it.baseIndex;
2289		int hi = this.baseLimit = it.baseLimit;
2290	<	this.index = this.baseIndex =
2291	<	(split) ? (it.baseLimit = (lo + hi + 1) >>> 1) : lo;
2290	>	int i;
2291	>	if (split) // adjust parent
2292	>	i = it.baseLimit = (lo + hi + 1) >>> 1;
2293	>	else       // clone parent
2294	>	i = lo;
2295	>	this.index = this.baseIndex = i;
2296		}
2297
2298		/**
#	Line 2230 | Line 2327 | public class ConcurrentHashMapV8<K, V>
2327		}
2328
2329		public final void remove() {
2330	<	if (nextVal == null)
2330	>	if (nextVal == null && last == null)
2331		advance();
2332		Node e = last;
2333		if (e == null)
#	Line 2244 | Line 2341 | public class ConcurrentHashMapV8<K, V>
2341		}
2342
2343		public final boolean hasMoreElements() { return hasNext(); }
2344	+	public final void setRawResult(Object x) { }
2345	+	public R getRawResult() { return null; }
2346	+	public boolean exec() { return true; }
2347		}
2348
2349		/* ---------------- Public operations -------------- */
#	Line 2330 | Line 2430 | public class ConcurrentHashMapV8<K, V>
2430		if (initialCapacity < concurrencyLevel)   // Use at least as many bins
2431		initialCapacity = concurrencyLevel;   // as estimated threads
2432		long size = (long)(1.0 + (long)initialCapacity / loadFactor);
2433	<	int cap = ((size >= (long)MAXIMUM_CAPACITY) ?
2434	<	MAXIMUM_CAPACITY: tableSizeFor((int)size));
2433	>	int cap = (size >= (long)MAXIMUM_CAPACITY) ?
2434	>	MAXIMUM_CAPACITY : tableSizeFor((int)size);
2435		this.counter = new LongAdder();
2436		this.sizeCtl = cap;
2437		}
#	Line 2353 | Line 2453 | public class ConcurrentHashMapV8<K, V>
2453		(int)n);
2454		}
2455
2456	<	final long longSize() { // accurate version of size needed for views
2456	>	/**
2457	>	* Returns the number of mappings. This method should be used
2458	>	* instead of {@link #size} because a ConcurrentHashMap may
2459	>	* contain more mappings than can be represented as an int. The
2460	>	* value returned is a snapshot; the actual count may differ if
2461	>	* there are ongoing concurrent insertions of removals.
2462	>	*
2463	>	* @return the number of mappings
2464	>	*/
2465	>	public long mappingCount() {
2466		long n = counter.sum();
2467		return (n < 0L) ? 0L : n;
2468		}
#	Line 2370 | Line 2479 | public class ConcurrentHashMapV8<K, V>
2479		* @throws NullPointerException if the specified key is null
2480		*/
2481		@SuppressWarnings("unchecked")
2482	<	public V get(Object key) {
2482	>	public V get(Object key) {
2483		if (key == null)
2484		throw new NullPointerException();
2485		return (V)internalGet(key);
#	Line 2405 | Line 2514 | public class ConcurrentHashMapV8<K, V>
2514		if (value == null)
2515		throw new NullPointerException();
2516		Object v;
2517	<	InternalIterator<K,V> it = new InternalIterator<K,V>(this);
2517	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2518		while ((v = it.advance()) != null) {
2519		if (v == value || value.equals(v))
2520		return true;
#	Line 2446 | Line 2555 | public class ConcurrentHashMapV8<K, V>
2555		* @throws NullPointerException if the specified key or value is null
2556		*/
2557		@SuppressWarnings("unchecked")
2558	<	public V put(K key, V value) {
2558	>	public V put(K key, V value) {
2559		if (key == null || value == null)
2560		throw new NullPointerException();
2561		return (V)internalPut(key, value);
#	Line 2460 | Line 2569 | public class ConcurrentHashMapV8<K, V>
2569		* @throws NullPointerException if the specified key or value is null
2570		*/
2571		@SuppressWarnings("unchecked")
2572	<	public V putIfAbsent(K key, V value) {
2572	>	public V putIfAbsent(K key, V value) {
2573		if (key == null || value == null)
2574		throw new NullPointerException();
2575		return (V)internalPutIfAbsent(key, value);
#	Line 2484 | Line 2593 | public class ConcurrentHashMapV8<K, V>
2593		* <pre> {@code
2594		* if (map.containsKey(key))
2595		*   return map.get(key);
2596	<	* value = mappingFunction.map(key);
2596	>	* value = mappingFunction.apply(key);
2597		* if (value != null)
2598		*   map.put(key, value);
2599		* return value;}</pre>
#	Line 2501 | Line 2610 | public class ConcurrentHashMapV8<K, V>
2610		* memoized result, as in:
2611		*
2612		*  <pre> {@code
2613	<	* map.computeIfAbsent(key, new MappingFunction<K, V>() {
2613	>	* map.computeIfAbsent(key, new Fun<K, V>() {
2614		*   public V map(K k) { return new Value(f(k)); }});}</pre>
2615		*
2616		* @param key key with which the specified value is to be associated
#	Line 2517 | Line 2626 | public class ConcurrentHashMapV8<K, V>
2626		*         in which case the mapping is left unestablished
2627		*/
2628		@SuppressWarnings("unchecked")
2629	<	public V computeIfAbsent(K key, MappingFunction<? super K, ? extends V> mappingFunction) {
2629	>	public V computeIfAbsent(K key, Fun<? super K, ? extends V> mappingFunction) {
2630		if (key == null || mappingFunction == null)
2631		throw new NullPointerException();
2632		return (V)internalComputeIfAbsent(key, mappingFunction);
2633		}
2634
2635		/**
2636	+	* If the given key is present, computes a new mapping value given a key and
2637	+	* its current mapped value. This is equivalent to
2638	+	*  <pre> {@code
2639	+	*   if (map.containsKey(key)) {
2640	+	*     value = remappingFunction.apply(key, map.get(key));
2641	+	*     if (value != null)
2642	+	*       map.put(key, value);
2643	+	*     else
2644	+	*       map.remove(key);
2645	+	*   }
2646	+	* }</pre>
2647	+	*
2648	+	* except that the action is performed atomically.  If the
2649	+	* function returns {@code null}, the mapping is removed.  If the
2650	+	* function itself throws an (unchecked) exception, the exception
2651	+	* is rethrown to its caller, and the current mapping is left
2652	+	* unchanged.  Some attempted update operations on this map by
2653	+	* other threads may be blocked while computation is in progress,
2654	+	* so the computation should be short and simple, and must not
2655	+	* attempt to update any other mappings of this Map. For example,
2656	+	* to either create or append new messages to a value mapping:
2657	+	*
2658	+	* @param key key with which the specified value is to be associated
2659	+	* @param remappingFunction the function to compute a value
2660	+	* @return the new value associated with the specified key, or null if none
2661	+	* @throws NullPointerException if the specified key or remappingFunction
2662	+	*         is null
2663	+	* @throws IllegalStateException if the computation detectably
2664	+	*         attempts a recursive update to this map that would
2665	+	*         otherwise never complete
2666	+	* @throws RuntimeException or Error if the remappingFunction does so,
2667	+	*         in which case the mapping is unchanged
2668	+	*/
2669	+	public V computeIfPresent(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2670	+	if (key == null || remappingFunction == null)
2671	+	throw new NullPointerException();
2672	+	return (V)internalCompute(key, true, remappingFunction);
2673	+	}
2674	+
2675	+	/**
2676		* Computes a new mapping value given a key and
2677		* its current mapped value (or {@code null} if there is no current
2678		* mapping). This is equivalent to
2679		*  <pre> {@code
2680	<	*   value = remappingFunction.remap(key, map.get(key));
2680	>	*   value = remappingFunction.apply(key, map.get(key));
2681		*   if (value != null)
2682		*     map.put(key, value);
2683		*   else
#	Line 2548 | Line 2697 | public class ConcurrentHashMapV8<K, V>
2697		* <pre> {@code
2698		* Map<Key, String> map = ...;
2699		* final String msg = ...;
2700	<	* map.compute(key, new RemappingFunction<Key, String>() {
2701	<	*   public String remap(Key k, String v) {
2700	>	* map.compute(key, new BiFun<Key, String, String>() {
2701	>	*   public String apply(Key k, String v) {
2702		*    return (v == null) ? msg : v + msg;});}}</pre>
2703		*
2704		* @param key key with which the specified value is to be associated
2705		* @param remappingFunction the function to compute a value
2706	<	* @return the new value associated with
2558	<	*         the specified key, or null if none.
2706	>	* @return the new value associated with the specified key, or null if none
2707		* @throws NullPointerException if the specified key or remappingFunction
2708		*         is null
2709		* @throws IllegalStateException if the computation detectably
#	Line 2564 | Line 2712 | public class ConcurrentHashMapV8<K, V>
2712		* @throws RuntimeException or Error if the remappingFunction does so,
2713		*         in which case the mapping is unchanged
2714		*/
2715	<	@SuppressWarnings("unchecked")
2716	<	public V compute(K key, RemappingFunction<? super K, V> remappingFunction) {
2715	>	//    @SuppressWarnings("unchecked")
2716	>	public V compute(K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
2717		if (key == null || remappingFunction == null)
2718		throw new NullPointerException();
2719	<	return (V)internalCompute(key, remappingFunction);
2719	>	return (V)internalCompute(key, false, remappingFunction);
2720	>	}
2721	>
2722	>	/**
2723	>	* If the specified key is not already associated
2724	>	* with a value, associate it with the given value.
2725	>	* Otherwise, replace the value with the results of
2726	>	* the given remapping function. This is equivalent to:
2727	>	*  <pre> {@code
2728	>	*   if (!map.containsKey(key))
2729	>	*     map.put(value);
2730	>	*   else {
2731	>	*     newValue = remappingFunction.apply(map.get(key), value);
2732	>	*     if (value != null)
2733	>	*       map.put(key, value);
2734	>	*     else
2735	>	*       map.remove(key);
2736	>	*   }
2737	>	* }</pre>
2738	>	* except that the action is performed atomically.  If the
2739	>	* function returns {@code null}, the mapping is removed.  If the
2740	>	* function itself throws an (unchecked) exception, the exception
2741	>	* is rethrown to its caller, and the current mapping is left
2742	>	* unchanged.  Some attempted update operations on this map by
2743	>	* other threads may be blocked while computation is in progress,
2744	>	* so the computation should be short and simple, and must not
2745	>	* attempt to update any other mappings of this Map.
2746	>	*/
2747	>	//    @SuppressWarnings("unchecked")
2748	>	public V merge(K key, V value, BiFun<? super V, ? super V, ? extends V> remappingFunction) {
2749	>	if (key == null || value == null || remappingFunction == null)
2750	>	throw new NullPointerException();
2751	>	return (V)internalMerge(key, value, remappingFunction);
2752		}
2753
2754		/**
#	Line 2581 | Line 2761 | public class ConcurrentHashMapV8<K, V>
2761		* @throws NullPointerException if the specified key is null
2762		*/
2763		@SuppressWarnings("unchecked")
2764	<	public V remove(Object key) {
2764	>	public V remove(Object key) {
2765		if (key == null)
2766		throw new NullPointerException();
2767		return (V)internalReplace(key, null, null);
#	Line 2619 | Line 2799 | public class ConcurrentHashMapV8<K, V>
2799		* @throws NullPointerException if the specified key or value is null
2800		*/
2801		@SuppressWarnings("unchecked")
2802	<	public V replace(K key, V value) {
2802	>	public V replace(K key, V value) {
2803		if (key == null || value == null)
2804		throw new NullPointerException();
2805		return (V)internalReplace(key, value, null);
#	Line 2716 | Line 2896 | public class ConcurrentHashMapV8<K, V>
2896		}
2897
2898		/**
2899	<	* Returns a partionable iterator of the keys in this map.
2899	>	* Returns a partitionable iterator of the keys in this map.
2900		*
2901	<	* @return a partionable iterator of the keys in this map
2901	>	* @return a partitionable iterator of the keys in this map
2902		*/
2903		public Spliterator<K> keySpliterator() {
2904		return new KeyIterator<K,V>(this);
2905		}
2906
2907		/**
2908	<	* Returns a partionable iterator of the values in this map.
2908	>	* Returns a partitionable iterator of the values in this map.
2909		*
2910	<	* @return a partionable iterator of the values in this map
2910	>	* @return a partitionable iterator of the values in this map
2911		*/
2912		public Spliterator<V> valueSpliterator() {
2913		return new ValueIterator<K,V>(this);
2914		}
2915
2916		/**
2917	<	* Returns a partionable iterator of the entries in this map.
2917	>	* Returns a partitionable iterator of the entries in this map.
2918		*
2919	<	* @return a partionable iterator of the entries in this map
2919	>	* @return a partitionable iterator of the entries in this map
2920		*/
2921		public Spliterator<Map.Entry<K,V>> entrySpliterator() {
2922		return new EntryIterator<K,V>(this);
#	Line 2751 | Line 2931 | public class ConcurrentHashMapV8<K, V>
2931		*/
2932		public int hashCode() {
2933		int h = 0;
2934	<	InternalIterator<K,V> it = new InternalIterator<K,V>(this);
2934	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2935		Object v;
2936		while ((v = it.advance()) != null) {
2937		h += it.nextKey.hashCode() ^ v.hashCode();
#	Line 2771 | Line 2951 | public class ConcurrentHashMapV8<K, V>
2951		* @return a string representation of this map
2952		*/
2953		public String toString() {
2954	<	InternalIterator<K,V> it = new InternalIterator<K,V>(this);
2954	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2955		StringBuilder sb = new StringBuilder();
2956		sb.append('{');
2957		Object v;
#	Line 2804 | Line 2984 | public class ConcurrentHashMapV8<K, V>
2984		if (!(o instanceof Map))
2985		return false;
2986		Map<?,?> m = (Map<?,?>) o;
2987	<	InternalIterator<K,V> it = new InternalIterator<K,V>(this);
2987	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
2988		Object val;
2989		while ((val = it.advance()) != null) {
2990		Object v = m.get(it.nextKey);
#	Line 2825 | Line 3005 | public class ConcurrentHashMapV8<K, V>
3005
3006		/* ----------------Iterators -------------- */
3007
3008	<	static final class KeyIterator<K,V> extends InternalIterator<K,V>
3008	>	static final class KeyIterator<K,V> extends Traverser<K,V,Object>
3009		implements Spliterator<K>, Enumeration<K> {
3010		KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3011	<	KeyIterator(InternalIterator<K,V> it, boolean split) {
3011	>	KeyIterator(Traverser<K,V,Object> it, boolean split) {
3012		super(it, split);
3013		}
3014		public KeyIterator<K,V> split() {
#	Line 2836 | Line 3016 | public class ConcurrentHashMapV8<K, V>
3016		throw new IllegalStateException();
3017		return new KeyIterator<K,V>(this, true);
3018		}
2839	–	public KeyIterator<K,V> clone() {
2840	–	if (last != null || (next != null && nextVal == null))
2841	–	throw new IllegalStateException();
2842	–	return new KeyIterator<K,V>(this, false);
2843	–	}
2844	–
3019		@SuppressWarnings("unchecked")
3020	<	public final K next() {
3020	>	public final K next() {
3021		if (nextVal == null && advance() == null)
3022		throw new NoSuchElementException();
3023		Object k = nextKey;
#	Line 2854 | Line 3028 | public class ConcurrentHashMapV8<K, V>
3028		public final K nextElement() { return next(); }
3029		}
3030
3031	<	static final class ValueIterator<K,V> extends InternalIterator<K,V>
3031	>	static final class ValueIterator<K,V> extends Traverser<K,V,Object>
3032		implements Spliterator<V>, Enumeration<V> {
3033		ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3034	<	ValueIterator(InternalIterator<K,V> it, boolean split) {
3034	>	ValueIterator(Traverser<K,V,Object> it, boolean split) {
3035		super(it, split);
3036		}
3037		public ValueIterator<K,V> split() {
#	Line 2866 | Line 3040 | public class ConcurrentHashMapV8<K, V>
3040		return new ValueIterator<K,V>(this, true);
3041		}
3042
2869	–	public ValueIterator<K,V> clone() {
2870	–	if (last != null || (next != null && nextVal == null))
2871	–	throw new IllegalStateException();
2872	–	return new ValueIterator<K,V>(this, false);
2873	–	}
2874	–
3043		@SuppressWarnings("unchecked")
3044	<	public final V next() {
3044	>	public final V next() {
3045		Object v;
3046		if ((v = nextVal) == null && (v = advance()) == null)
3047		throw new NoSuchElementException();
#	Line 2884 | Line 3052 | public class ConcurrentHashMapV8<K, V>
3052		public final V nextElement() { return next(); }
3053		}
3054
3055	<	static final class EntryIterator<K,V> extends InternalIterator<K,V>
3055	>	static final class EntryIterator<K,V> extends Traverser<K,V,Object>
3056		implements Spliterator<Map.Entry<K,V>> {
3057		EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
3058	<	EntryIterator(InternalIterator<K,V> it, boolean split) {
3058	>	EntryIterator(Traverser<K,V,Object> it, boolean split) {
3059		super(it, split);
3060		}
3061		public EntryIterator<K,V> split() {
#	Line 2895 | Line 3063 | public class ConcurrentHashMapV8<K, V>
3063		throw new IllegalStateException();
3064		return new EntryIterator<K,V>(this, true);
3065		}
2898	–	public EntryIterator<K,V> clone() {
2899	–	if (last != null || (next != null && nextVal == null))
2900	–	throw new IllegalStateException();
2901	–	return new EntryIterator<K,V>(this, false);
2902	–	}
3066
3067		@SuppressWarnings("unchecked")
3068	<	public final Map.Entry<K,V> next() {
3068	>	public final Map.Entry<K,V> next() {
3069		Object v;
3070		if ((v = nextVal) == null && (v = advance()) == null)
3071		throw new NoSuchElementException();
#	Line 2940 | Line 3103 | public class ConcurrentHashMapV8<K, V>
3103
3104		/**
3105		* Sets our entry's value and writes through to the map. The
3106	<	* value to return is somewhat arbitrary here. Since a we do
3107	<	* not necessarily track asynchronous changes, the most recent
3106	>	* value to return is somewhat arbitrary here. Since we do not
3107	>	* necessarily track asynchronous changes, the most recent
3108		* "previous" value could be different from what we return (or
3109		* could even have been removed in which case the put will
3110		* re-establish). We do not and cannot guarantee more.
#	Line 2960 | Line 3123 | public class ConcurrentHashMapV8<K, V>
3123		/**
3124		* Base class for views.
3125		*/
3126	<	static abstract class MapView<K, V> {
3126	>	static abstract class CHMView<K, V> {
3127		final ConcurrentHashMapV8<K, V> map;
3128	<	MapView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
3128	>	CHMView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
3129		public final int size()                 { return map.size(); }
3130		public final boolean isEmpty()          { return map.isEmpty(); }
3131		public final void clear()               { map.clear(); }
#	Line 2975 | Line 3138 | public class ConcurrentHashMapV8<K, V>
3138		private static final String oomeMsg = "Required array size too large";
3139
3140		public final Object[] toArray() {
3141	<	long sz = map.longSize();
3141	>	long sz = map.mappingCount();
3142		if (sz > (long)(MAX_ARRAY_SIZE))
3143		throw new OutOfMemoryError(oomeMsg);
3144		int n = (int)sz;
#	Line 2998 | Line 3161 | public class ConcurrentHashMapV8<K, V>
3161		}
3162
3163		@SuppressWarnings("unchecked")
3164	<	public final <T> T[] toArray(T[] a) {
3165	<	long sz = map.longSize();
3164	>	public final <T> T[] toArray(T[] a) {
3165	>	long sz = map.mappingCount();
3166		if (sz > (long)(MAX_ARRAY_SIZE))
3167		throw new OutOfMemoryError(oomeMsg);
3168		int m = (int)sz;
#	Line 3086 | Line 3249 | public class ConcurrentHashMapV8<K, V>
3249
3250		}
3251
3252	<	static final class KeySet<K,V> extends MapView<K,V> implements Set<K> {
3253	<	KeySet(ConcurrentHashMapV8<K, V> map)   { super(map); }
3252	>	static final class KeySet<K,V> extends CHMView<K,V> implements Set<K> {
3253	>	KeySet(ConcurrentHashMapV8<K, V> map)  {
3254	>	super(map);
3255	>	}
3256		public final boolean contains(Object o) { return map.containsKey(o); }
3257		public final boolean remove(Object o)   { return map.remove(o) != null; }
3258		public final Iterator<K> iterator() {
#	Line 3107 | Line 3272 | public class ConcurrentHashMapV8<K, V>
3272		}
3273		}
3274
3275	<	static final class Values<K,V> extends MapView<K,V>
3275	>
3276	>	static final class Values<K,V> extends CHMView<K,V>
3277		implements Collection<V> {
3278		Values(ConcurrentHashMapV8<K, V> map)   { super(map); }
3279		public final boolean contains(Object o) { return map.containsValue(o); }
#	Line 3132 | Line 3298 | public class ConcurrentHashMapV8<K, V>
3298		public final boolean addAll(Collection<? extends V> c) {
3299		throw new UnsupportedOperationException();
3300		}
3301	+
3302		}
3303
3304	<	static final class EntrySet<K,V> extends MapView<K,V>
3304	>	static final class EntrySet<K,V> extends CHMView<K,V>
3305		implements Set<Map.Entry<K,V>> {
3306		EntrySet(ConcurrentHashMapV8<K, V> map) { super(map); }
3307		public final boolean contains(Object o) {
#	Line 3191 | Line 3358 | public class ConcurrentHashMapV8<K, V>
3358		* The key-value mappings are emitted in no particular order.
3359		*/
3360		@SuppressWarnings("unchecked")
3361	<	private void writeObject(java.io.ObjectOutputStream s)
3362	<	throws java.io.IOException {
3361	>	private void writeObject(java.io.ObjectOutputStream s)
3362	>	throws java.io.IOException {
3363		if (segments == null) { // for serialization compatibility
3364		segments = (Segment<K,V>[])
3365		new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
#	Line 3200 | Line 3367 | public class ConcurrentHashMapV8<K, V>
3367		segments[i] = new Segment<K,V>(LOAD_FACTOR);
3368		}
3369		s.defaultWriteObject();
3370	<	InternalIterator<K,V> it = new InternalIterator<K,V>(this);
3370	>	Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
3371		Object v;
3372		while ((v = it.advance()) != null) {
3373		s.writeObject(it.nextKey);
#	Line 3216 | Line 3383 | public class ConcurrentHashMapV8<K, V>
3383		* @param s the stream
3384		*/
3385		@SuppressWarnings("unchecked")
3386	<	private void readObject(java.io.ObjectInputStream s)
3387	<	throws java.io.IOException, ClassNotFoundException {
3386	>	private void readObject(java.io.ObjectInputStream s)
3387	>	throws java.io.IOException, ClassNotFoundException {
3388		s.defaultReadObject();
3389		this.segments = null; // unneeded
3390		// initialize transient final field
#	Line 3294 | Line 3461 | public class ConcurrentHashMapV8<K, V>
3461		}
3462		}
3463
3464	+
3465	+	// -------------------------------------------------------
3466	+
3467	+	// Sams
3468	+	/** Interface describing a void action of one argument */
3469	+	public interface Action<A> { void apply(A a); }
3470	+	/** Interface describing a void action of two arguments */
3471	+	public interface BiAction<A,B> { void apply(A a, B b); }
3472	+	/** Interface describing a function of one argument */
3473	+	public interface Fun<A,T> { T apply(A a); }
3474	+	/** Interface describing a function of two arguments */
3475	+	public interface BiFun<A,B,T> { T apply(A a, B b); }
3476	+	/** Interface describing a function of no arguments */
3477	+	public interface Generator<T> { T apply(); }
3478	+	/** Interface describing a function mapping its argument to a double */
3479	+	public interface ObjectToDouble<A> { double apply(A a); }
3480	+	/** Interface describing a function mapping its argument to a long */
3481	+	public interface ObjectToLong<A> { long apply(A a); }
3482	+	/** Interface describing a function mapping its argument to an int */
3483	+	public interface ObjectToInt<A> {int apply(A a); }
3484	+	/** Interface describing a function mapping two arguments to a double */
3485	+	public interface ObjectByObjectToDouble<A,B> { double apply(A a, B b); }
3486	+	/** Interface describing a function mapping two arguments to a long */
3487	+	public interface ObjectByObjectToLong<A,B> { long apply(A a, B b); }
3488	+	/** Interface describing a function mapping two arguments to an int */
3489	+	public interface ObjectByObjectToInt<A,B> {int apply(A a, B b); }
3490	+	/** Interface describing a function mapping a double to a double */
3491	+	public interface DoubleToDouble { double apply(double a); }
3492	+	/** Interface describing a function mapping a long to a long */
3493	+	public interface LongToLong { long apply(long a); }
3494	+	/** Interface describing a function mapping an int to an int */
3495	+	public interface IntToInt { int apply(int a); }
3496	+	/** Interface describing a function mapping two doubles to a double */
3497	+	public interface DoubleByDoubleToDouble { double apply(double a, double b); }
3498	+	/** Interface describing a function mapping two longs to a long */
3499	+	public interface LongByLongToLong { long apply(long a, long b); }
3500	+	/** Interface describing a function mapping two ints to an int */
3501	+	public interface IntByIntToInt { int apply(int a, int b); }
3502	+
3503	+
3504	+	// -------------------------------------------------------
3505	+
3506	+	/**
3507	+	* Returns an extended {@link Parallel} view of this map using the
3508	+	* given executor for bulk parallel operations.
3509	+	*
3510	+	* @param executor the executor
3511	+	* @return a parallel view
3512	+	*/
3513	+	public Parallel parallel(ForkJoinPool executor)  {
3514	+	return new Parallel(executor);
3515	+	}
3516	+
3517	+	/**
3518	+	* An extended view of a ConcurrentHashMap supporting bulk
3519	+	* parallel operations. These operations are designed to be
3520	+	* safely, and often sensibly, applied even with maps that are
3521	+	* being concurrently updated by other threads; for example, when
3522	+	* computing a snapshot summary of the values in a shared
3523	+	* registry.  There are three kinds of operation, each with four
3524	+	* forms, accepting functions with Keys, Values, Entries, and
3525	+	* (Key, Value) arguments and/or return values. Because the
3526	+	* elements of a ConcurrentHashMap are not ordered in any
3527	+	* particular way, and may be processed in different orders in
3528	+	* different parallel executions, the correctness of supplied
3529	+	* functions should not depend on any ordering, or on any other
3530	+	* objects or values that may transiently change while computation
3531	+	* is in progress; and except for forEach actions, should ideally
3532	+	* be side-effect-free.
3533	+	*
3534	+	* <ul>
3535	+	* <li> forEach: Perform a given action on each element.
3536	+	* A variant form applies a given transformation on each element
3537	+	* before performing the action.</li>
3538	+	*
3539	+	* <li> search: Return the first available non-null result of
3540	+	* applying a given function on each element; skipping further
3541	+	* search when a result is found.</li>
3542	+	*
3543	+	* <li> reduce: Accumulate each element.  The supplied reduction
3544	+	* function cannot rely on ordering (more formally, it should be
3545	+	* both associative and commutative).  There are five variants:
3546	+	*
3547	+	* <ul>
3548	+	*
3549	+	* <li> Plain reductions. (There is not a form of this method for
3550	+	* (key, value) function arguments since there is no corresponding
3551	+	* return type.)</li>
3552	+	*
3553	+	* <li> Mapped reductions that accumulate the results of a given
3554	+	* function applied to each element.</li>
3555	+	*
3556	+	* <li> Reductions to scalar doubles, longs, and ints, using a
3557	+	* given basis value.</li>
3558	+	*
3559	+	* </li>
3560	+	* </ul>
3561	+	* </ul>
3562	+	*
3563	+	* <p>The concurrency properties of the bulk operations follow
3564	+	* from those of ConcurrentHashMap: Any non-null result returned
3565	+	* from {@code get(key)} and related access methods bears a
3566	+	* happens-before relation with the associated insertion or
3567	+	* update.  The result of any bulk operation reflects the
3568	+	* composition of these per-element relations (but is not
3569	+	* necessarily atomic with respect to the map as a whole unless it
3570	+	* is somehow known to be quiescent).  Conversely, because keys
3571	+	* and values in the map are never null, null serves as a reliable
3572	+	* atomic indicator of the current lack of any result.  To
3573	+	* maintain this property, null serves as an implicit basis for
3574	+	* all non-scalar reduction operations. For the double, long, and
3575	+	* int versions, the basis should be one that, when combined with
3576	+	* any other value, returns that other value (more formally, it
3577	+	* should be the identity element for the reduction). Most common
3578	+	* reductions have these properties; for example, computing a sum
3579	+	* with basis 0 or a minimum with basis MAX_VALUE.
3580	+	*
3581	+	* <p>Search and transformation functions provided as arguments
3582	+	* should similarly return null to indicate the lack of any result
3583	+	* (in which case it is not used). In the case of mapped
3584	+	* reductions, this also enables transformations to serve as
3585	+	* filters, returning null (or, in the case of primitive
3586	+	* specializations, the identity basis) if the element should not
3587	+	* be combined. You can create compound transformations and
3588	+	* filterings by composing them yourself under this "null means
3589	+	* there is nothing there now" rule before using them in search or
3590	+	* reduce operations.
3591	+	*
3592	+	* <p>Methods accepting and/or returning Entry arguments maintain
3593	+	* key-value associations. They may be useful for example when
3594	+	* finding the key for the greatest value. Note that "plain" Entry
3595	+	* arguments can be supplied using {@code new
3596	+	* AbstractMap.SimpleEntry(k,v)}.
3597	+	*
3598	+	* <p> Bulk operations may complete abruptly, throwing an
3599	+	* exception encountered in the application of a supplied
3600	+	* function. Bear in mind when handling such exceptions that other
3601	+	* concurrently executing functions could also have thrown
3602	+	* exceptions, or would have done so if the first exception had
3603	+	* not occurred.
3604	+	*
3605	+	* <p>Parallel speedups compared to sequential processing are
3606	+	* common but not guaranteed.  Operations involving brief
3607	+	* functions on small maps may execute more slowly than sequential
3608	+	* loops if the underlying work to parallelize the computation is
3609	+	* more expensive than the computation itself. Similarly,
3610	+	* parallelization may not lead to much actual parallelism if all
3611	+	* processors are busy performing unrelated tasks.
3612	+	*
3613	+	* <p> All arguments to all task methods must be non-null.
3614	+	*
3615	+	* <p><em>jsr166e note: During transition, this class
3616	+	* uses nested functional interfaces with different names but the
3617	+	* same forms as those expected for JDK8.<em>
3618	+	*/
3619	+	public class Parallel {
3620	+	final ForkJoinPool fjp;
3621	+
3622	+	/**
3623	+	* Returns an extended view of this map using the given
3624	+	* executor for bulk parallel operations.
3625	+	*
3626	+	* @param executor the executor
3627	+	*/
3628	+	public Parallel(ForkJoinPool executor)  {
3629	+	this.fjp = executor;
3630	+	}
3631	+
3632	+	/**
3633	+	* Performs the given action for each (key, value).
3634	+	*
3635	+	* @param action the action
3636	+	*/
3637	+	public void forEach(BiAction<K,V> action) {
3638	+	fjp.invoke(ForkJoinTasks.forEach
3639	+	(ConcurrentHashMapV8.this, action));
3640	+	}
3641	+
3642	+	/**
3643	+	* Performs the given action for each non-null transformation
3644	+	* of each (key, value).
3645	+	*
3646	+	* @param transformer a function returning the transformation
3647	+	* for an element, or null of there is no transformation (in
3648	+	* which case the action is not applied).
3649	+	* @param action the action
3650	+	*/
3651	+	public <U> void forEach(BiFun<? super K, ? super V, ? extends U> transformer,
3652	+	Action<U> action) {
3653	+	fjp.invoke(ForkJoinTasks.forEach
3654	+	(ConcurrentHashMapV8.this, transformer, action));
3655	+	}
3656	+
3657	+	/**
3658	+	* Returns a non-null result from applying the given search
3659	+	* function on each (key, value), or null if none.  Further
3660	+	* element processing is suppressed upon success. However,
3661	+	* this method does not return until other in-progress
3662	+	* parallel invocations of the search function also complete.
3663	+	*
3664	+	* @param searchFunction a function returning a non-null
3665	+	* result on success, else null
3666	+	* @return a non-null result from applying the given search
3667	+	* function on each (key, value), or null if none
3668	+	*/
3669	+	public <U> U search(BiFun<? super K, ? super V, ? extends U> searchFunction) {
3670	+	return fjp.invoke(ForkJoinTasks.search
3671	+	(ConcurrentHashMapV8.this, searchFunction));
3672	+	}
3673	+
3674	+	/**
3675	+	* Returns the result of accumulating the given transformation
3676	+	* of all (key, value) pairs using the given reducer to
3677	+	* combine values, or null if none.
3678	+	*
3679	+	* @param transformer a function returning the transformation
3680	+	* for an element, or null of there is no transformation (in
3681	+	* which case it is not combined).
3682	+	* @param reducer a commutative associative combining function
3683	+	* @return the result of accumulating the given transformation
3684	+	* of all (key, value) pairs
3685	+	*/
3686	+	public <U> U reduce(BiFun<? super K, ? super V, ? extends U> transformer,
3687	+	BiFun<? super U, ? super U, ? extends U> reducer) {
3688	+	return fjp.invoke(ForkJoinTasks.reduce
3689	+	(ConcurrentHashMapV8.this, transformer, reducer));
3690	+	}
3691	+
3692	+	/**
3693	+	* Returns the result of accumulating the given transformation
3694	+	* of all (key, value) pairs using the given reducer to
3695	+	* combine values, and the given basis as an identity value.
3696	+	*
3697	+	* @param transformer a function returning the transformation
3698	+	* for an element
3699	+	* @param basis the identity (initial default value) for the reduction
3700	+	* @param reducer a commutative associative combining function
3701	+	* @return the result of accumulating the given transformation
3702	+	* of all (key, value) pairs
3703	+	*/
3704	+	public double reduceToDouble(ObjectByObjectToDouble<? super K, ? super V> transformer,
3705	+	double basis,
3706	+	DoubleByDoubleToDouble reducer) {
3707	+	return fjp.invoke(ForkJoinTasks.reduceToDouble
3708	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3709	+	}
3710	+
3711	+	/**
3712	+	* Returns the result of accumulating the given transformation
3713	+	* of all (key, value) pairs using the given reducer to
3714	+	* combine values, and the given basis as an identity value.
3715	+	*
3716	+	* @param transformer a function returning the transformation
3717	+	* for an element
3718	+	* @param basis the identity (initial default value) for the reduction
3719	+	* @param reducer a commutative associative combining function
3720	+	* @return the result of accumulating the given transformation
3721	+	* of all (key, value) pairs using the given reducer to
3722	+	* combine values, and the given basis as an identity value.
3723	+	*/
3724	+	public long reduceToLong(ObjectByObjectToLong<? super K, ? super V> transformer,
3725	+	long basis,
3726	+	LongByLongToLong reducer) {
3727	+	return fjp.invoke(ForkJoinTasks.reduceToLong
3728	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3729	+	}
3730	+
3731	+	/**
3732	+	* Returns the result of accumulating the given transformation
3733	+	* of all (key, value) pairs using the given reducer to
3734	+	* combine values, and the given basis as an identity value.
3735	+	*
3736	+	* @param transformer a function returning the transformation
3737	+	* for an element
3738	+	* @param basis the identity (initial default value) for the reduction
3739	+	* @param reducer a commutative associative combining function
3740	+	* @return the result of accumulating the given transformation
3741	+	* of all (key, value) pairs
3742	+	*/
3743	+	public int reduceToInt(ObjectByObjectToInt<? super K, ? super V> transformer,
3744	+	int basis,
3745	+	IntByIntToInt reducer) {
3746	+	return fjp.invoke(ForkJoinTasks.reduceToInt
3747	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3748	+	}
3749	+
3750	+	/**
3751	+	* Performs the given action for each key.
3752	+	*
3753	+	* @param action the action
3754	+	*/
3755	+	public void forEachKey(Action<K> action) {
3756	+	fjp.invoke(ForkJoinTasks.forEachKey
3757	+	(ConcurrentHashMapV8.this, action));
3758	+	}
3759	+
3760	+	/**
3761	+	* Performs the given action for each non-null transformation
3762	+	* of each key.
3763	+	*
3764	+	* @param transformer a function returning the transformation
3765	+	* for an element, or null of there is no transformation (in
3766	+	* which case the action is not applied).
3767	+	* @param action the action
3768	+	*/
3769	+	public <U> void forEachKey(Fun<? super K, ? extends U> transformer,
3770	+	Action<U> action) {
3771	+	fjp.invoke(ForkJoinTasks.forEachKey
3772	+	(ConcurrentHashMapV8.this, transformer, action));
3773	+	}
3774	+
3775	+	/**
3776	+	* Returns a non-null result from applying the given search
3777	+	* function on each key, or null if none.  Further element
3778	+	* processing is suppressed upon success. However, this method
3779	+	* does not return until other in-progress parallel
3780	+	* invocations of the search function also complete.
3781	+	*
3782	+	* @param searchFunction a function returning a non-null
3783	+	* result on success, else null
3784	+	* @return a non-null result from applying the given search
3785	+	* function on each key, or null if none
3786	+	*/
3787	+	public <U> U searchKeys(Fun<? super K, ? extends U> searchFunction) {
3788	+	return fjp.invoke(ForkJoinTasks.searchKeys
3789	+	(ConcurrentHashMapV8.this, searchFunction));
3790	+	}
3791	+
3792	+	/**
3793	+	* Returns the result of accumulating all keys using the given
3794	+	* reducer to combine values, or null if none.
3795	+	*
3796	+	* @param reducer a commutative associative combining function
3797	+	* @return the result of accumulating all keys using the given
3798	+	* reducer to combine values, or null if none
3799	+	*/
3800	+	public K reduceKeys(BiFun<? super K, ? super K, ? extends K> reducer) {
3801	+	return fjp.invoke(ForkJoinTasks.reduceKeys
3802	+	(ConcurrentHashMapV8.this, reducer));
3803	+	}
3804	+
3805	+	/**
3806	+	* Returns the result of accumulating the given transformation
3807	+	* of all keys using the given reducer to combine values, or
3808	+	* null if none.
3809	+	*
3810	+	* @param transformer a function returning the transformation
3811	+	* for an element, or null of there is no transformation (in
3812	+	* which case it is not combined).
3813	+	* @param reducer a commutative associative combining function
3814	+	* @return the result of accumulating the given transformation
3815	+	* of all keys
3816	+	*/
3817	+	public <U> U reduceKeys(Fun<? super K, ? extends U> transformer,
3818	+	BiFun<? super U, ? super U, ? extends U> reducer) {
3819	+	return fjp.invoke(ForkJoinTasks.reduceKeys
3820	+	(ConcurrentHashMapV8.this, transformer, reducer));
3821	+	}
3822	+
3823	+	/**
3824	+	* Returns the result of accumulating the given transformation
3825	+	* of all keys using the given reducer to combine values, and
3826	+	* the given basis as an identity value.
3827	+	*
3828	+	* @param transformer a function returning the transformation
3829	+	* for an element
3830	+	* @param basis the identity (initial default value) for the reduction
3831	+	* @param reducer a commutative associative combining function
3832	+	* @return  the result of accumulating the given transformation
3833	+	* of all keys
3834	+	*/
3835	+	public double reduceKeysToDouble(ObjectToDouble<? super K> transformer,
3836	+	double basis,
3837	+	DoubleByDoubleToDouble reducer) {
3838	+	return fjp.invoke(ForkJoinTasks.reduceKeysToDouble
3839	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3840	+	}
3841	+
3842	+	/**
3843	+	* Returns the result of accumulating the given transformation
3844	+	* of all keys using the given reducer to combine values, and
3845	+	* the given basis as an identity value.
3846	+	*
3847	+	* @param transformer a function returning the transformation
3848	+	* for an element
3849	+	* @param basis the identity (initial default value) for the reduction
3850	+	* @param reducer a commutative associative combining function
3851	+	* @return the result of accumulating the given transformation
3852	+	* of all keys
3853	+	*/
3854	+	public long reduceKeysToLong(ObjectToLong<? super K> transformer,
3855	+	long basis,
3856	+	LongByLongToLong reducer) {
3857	+	return fjp.invoke(ForkJoinTasks.reduceKeysToLong
3858	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3859	+	}
3860	+
3861	+	/**
3862	+	* Returns the result of accumulating the given transformation
3863	+	* of all keys using the given reducer to combine values, and
3864	+	* the given basis as an identity value.
3865	+	*
3866	+	* @param transformer a function returning the transformation
3867	+	* for an element
3868	+	* @param basis the identity (initial default value) for the reduction
3869	+	* @param reducer a commutative associative combining function
3870	+	* @return the result of accumulating the given transformation
3871	+	* of all keys
3872	+	*/
3873	+	public int reduceKeysToInt(ObjectToInt<? super K> transformer,
3874	+	int basis,
3875	+	IntByIntToInt reducer) {
3876	+	return fjp.invoke(ForkJoinTasks.reduceKeysToInt
3877	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3878	+	}
3879	+
3880	+	/**
3881	+	* Performs the given action for each value.
3882	+	*
3883	+	* @param action the action
3884	+	*/
3885	+	public void forEachValue(Action<V> action) {
3886	+	fjp.invoke(ForkJoinTasks.forEachValue
3887	+	(ConcurrentHashMapV8.this, action));
3888	+	}
3889	+
3890	+	/**
3891	+	* Performs the given action for each non-null transformation
3892	+	* of each value.
3893	+	*
3894	+	* @param transformer a function returning the transformation
3895	+	* for an element, or null of there is no transformation (in
3896	+	* which case the action is not applied).
3897	+	*/
3898	+	public <U> void forEachValue(Fun<? super V, ? extends U> transformer,
3899	+	Action<U> action) {
3900	+	fjp.invoke(ForkJoinTasks.forEachValue
3901	+	(ConcurrentHashMapV8.this, transformer, action));
3902	+	}
3903	+
3904	+	/**
3905	+	* Returns a non-null result from applying the given search
3906	+	* function on each value, or null if none.  Further element
3907	+	* processing is suppressed upon success. However, this method
3908	+	* does not return until other in-progress parallel
3909	+	* invocations of the search function also complete.
3910	+	*
3911	+	* @param searchFunction a function returning a non-null
3912	+	* result on success, else null
3913	+	* @return a non-null result from applying the given search
3914	+	* function on each value, or null if none
3915	+	*
3916	+	*/
3917	+	public <U> U searchValues(Fun<? super V, ? extends U> searchFunction) {
3918	+	return fjp.invoke(ForkJoinTasks.searchValues
3919	+	(ConcurrentHashMapV8.this, searchFunction));
3920	+	}
3921	+
3922	+	/**
3923	+	* Returns the result of accumulating all values using the
3924	+	* given reducer to combine values, or null if none.
3925	+	*
3926	+	* @param reducer a commutative associative combining function
3927	+	* @return  the result of accumulating all values
3928	+	*/
3929	+	public V reduceValues(BiFun<? super V, ? super V, ? extends V> reducer) {
3930	+	return fjp.invoke(ForkJoinTasks.reduceValues
3931	+	(ConcurrentHashMapV8.this, reducer));
3932	+	}
3933	+
3934	+	/**
3935	+	* Returns the result of accumulating the given transformation
3936	+	* of all values using the given reducer to combine values, or
3937	+	* null if none.
3938	+	*
3939	+	* @param transformer a function returning the transformation
3940	+	* for an element, or null of there is no transformation (in
3941	+	* which case it is not combined).
3942	+	* @param reducer a commutative associative combining function
3943	+	* @return the result of accumulating the given transformation
3944	+	* of all values
3945	+	*/
3946	+	public <U> U reduceValues(Fun<? super V, ? extends U> transformer,
3947	+	BiFun<? super U, ? super U, ? extends U> reducer) {
3948	+	return fjp.invoke(ForkJoinTasks.reduceValues
3949	+	(ConcurrentHashMapV8.this, transformer, reducer));
3950	+	}
3951	+
3952	+	/**
3953	+	* Returns the result of accumulating the given transformation
3954	+	* of all values using the given reducer to combine values,
3955	+	* and the given basis as an identity value.
3956	+	*
3957	+	* @param transformer a function returning the transformation
3958	+	* for an element
3959	+	* @param basis the identity (initial default value) for the reduction
3960	+	* @param reducer a commutative associative combining function
3961	+	* @return the result of accumulating the given transformation
3962	+	* of all values
3963	+	*/
3964	+	public double reduceValuesToDouble(ObjectToDouble<? super V> transformer,
3965	+	double basis,
3966	+	DoubleByDoubleToDouble reducer) {
3967	+	return fjp.invoke(ForkJoinTasks.reduceValuesToDouble
3968	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3969	+	}
3970	+
3971	+	/**
3972	+	* Returns the result of accumulating the given transformation
3973	+	* of all values using the given reducer to combine values,
3974	+	* and the given basis as an identity value.
3975	+	*
3976	+	* @param transformer a function returning the transformation
3977	+	* for an element
3978	+	* @param basis the identity (initial default value) for the reduction
3979	+	* @param reducer a commutative associative combining function
3980	+	* @return the result of accumulating the given transformation
3981	+	* of all values
3982	+	*/
3983	+	public long reduceValuesToLong(ObjectToLong<? super V> transformer,
3984	+	long basis,
3985	+	LongByLongToLong reducer) {
3986	+	return fjp.invoke(ForkJoinTasks.reduceValuesToLong
3987	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
3988	+	}
3989	+
3990	+	/**
3991	+	* Returns the result of accumulating the given transformation
3992	+	* of all values using the given reducer to combine values,
3993	+	* and the given basis as an identity value.
3994	+	*
3995	+	* @param transformer a function returning the transformation
3996	+	* for an element
3997	+	* @param basis the identity (initial default value) for the reduction
3998	+	* @param reducer a commutative associative combining function
3999	+	* @return the result of accumulating the given transformation
4000	+	* of all values
4001	+	*/
4002	+	public int reduceValuesToInt(ObjectToInt<? super V> transformer,
4003	+	int basis,
4004	+	IntByIntToInt reducer) {
4005	+	return fjp.invoke(ForkJoinTasks.reduceValuesToInt
4006	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4007	+	}
4008	+
4009	+	/**
4010	+	* Performs the given action for each entry.
4011	+	*
4012	+	* @param action the action
4013	+	*/
4014	+	public void forEachEntry(Action<Map.Entry<K,V>> action) {
4015	+	fjp.invoke(ForkJoinTasks.forEachEntry
4016	+	(ConcurrentHashMapV8.this, action));
4017	+	}
4018	+
4019	+	/**
4020	+	* Performs the given action for each non-null transformation
4021	+	* of each entry.
4022	+	*
4023	+	* @param transformer a function returning the transformation
4024	+	* for an element, or null of there is no transformation (in
4025	+	* which case the action is not applied).
4026	+	* @param action the action
4027	+	*/
4028	+	public <U> void forEachEntry(Fun<Map.Entry<K,V>, ? extends U> transformer,
4029	+	Action<U> action) {
4030	+	fjp.invoke(ForkJoinTasks.forEachEntry
4031	+	(ConcurrentHashMapV8.this, transformer, action));
4032	+	}
4033	+
4034	+	/**
4035	+	* Returns a non-null result from applying the given search
4036	+	* function on each entry, or null if none.  Further element
4037	+	* processing is suppressed upon success. However, this method
4038	+	* does not return until other in-progress parallel
4039	+	* invocations of the search function also complete.
4040	+	*
4041	+	* @param searchFunction a function returning a non-null
4042	+	* result on success, else null
4043	+	* @return a non-null result from applying the given search
4044	+	* function on each entry, or null if none
4045	+	*/
4046	+	public <U> U searchEntries(Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4047	+	return fjp.invoke(ForkJoinTasks.searchEntries
4048	+	(ConcurrentHashMapV8.this, searchFunction));
4049	+	}
4050	+
4051	+	/**
4052	+	* Returns the result of accumulating all entries using the
4053	+	* given reducer to combine values, or null if none.
4054	+	*
4055	+	* @param reducer a commutative associative combining function
4056	+	* @return the result of accumulating all entries
4057	+	*/
4058	+	public Map.Entry<K,V> reduceEntries(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4059	+	return fjp.invoke(ForkJoinTasks.reduceEntries
4060	+	(ConcurrentHashMapV8.this, reducer));
4061	+	}
4062	+
4063	+	/**
4064	+	* Returns the result of accumulating the given transformation
4065	+	* of all entries using the given reducer to combine values,
4066	+	* or null if none.
4067	+	*
4068	+	* @param transformer a function returning the transformation
4069	+	* for an element, or null of there is no transformation (in
4070	+	* which case it is not combined).
4071	+	* @param reducer a commutative associative combining function
4072	+	* @return the result of accumulating the given transformation
4073	+	* of all entries
4074	+	*/
4075	+	public <U> U reduceEntries(Fun<Map.Entry<K,V>, ? extends U> transformer,
4076	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4077	+	return fjp.invoke(ForkJoinTasks.reduceEntries
4078	+	(ConcurrentHashMapV8.this, transformer, reducer));
4079	+	}
4080	+
4081	+	/**
4082	+	* Returns the result of accumulating the given transformation
4083	+	* of all entries using the given reducer to combine values,
4084	+	* and the given basis as an identity value.
4085	+	*
4086	+	* @param transformer a function returning the transformation
4087	+	* for an element
4088	+	* @param basis the identity (initial default value) for the reduction
4089	+	* @param reducer a commutative associative combining function
4090	+	* @return the result of accumulating the given transformation
4091	+	* of all entries
4092	+	*/
4093	+	public double reduceEntriesToDouble(ObjectToDouble<Map.Entry<K,V>> transformer,
4094	+	double basis,
4095	+	DoubleByDoubleToDouble reducer) {
4096	+	return fjp.invoke(ForkJoinTasks.reduceEntriesToDouble
4097	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4098	+	}
4099	+
4100	+	/**
4101	+	* Returns the result of accumulating the given transformation
4102	+	* of all entries using the given reducer to combine values,
4103	+	* and the given basis as an identity value.
4104	+	*
4105	+	* @param transformer a function returning the transformation
4106	+	* for an element
4107	+	* @param basis the identity (initial default value) for the reduction
4108	+	* @param reducer a commutative associative combining function
4109	+	* @return  the result of accumulating the given transformation
4110	+	* of all entries
4111	+	*/
4112	+	public long reduceEntriesToLong(ObjectToLong<Map.Entry<K,V>> transformer,
4113	+	long basis,
4114	+	LongByLongToLong reducer) {
4115	+	return fjp.invoke(ForkJoinTasks.reduceEntriesToLong
4116	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4117	+	}
4118	+
4119	+	/**
4120	+	* Returns the result of accumulating the given transformation
4121	+	* of all entries using the given reducer to combine values,
4122	+	* and the given basis as an identity value.
4123	+	*
4124	+	* @param transformer a function returning the transformation
4125	+	* for an element
4126	+	* @param basis the identity (initial default value) for the reduction
4127	+	* @param reducer a commutative associative combining function
4128	+	* @return the result of accumulating the given transformation
4129	+	* of all entries
4130	+	*/
4131	+	public int reduceEntriesToInt(ObjectToInt<Map.Entry<K,V>> transformer,
4132	+	int basis,
4133	+	IntByIntToInt reducer) {
4134	+	return fjp.invoke(ForkJoinTasks.reduceEntriesToInt
4135	+	(ConcurrentHashMapV8.this, transformer, basis, reducer));
4136	+	}
4137	+	}
4138	+
4139	+	// ---------------------------------------------------------------------
4140	+
4141	+	/**
4142	+	* Predefined tasks for performing bulk parallel operations on
4143	+	* ConcurrentHashMaps. These tasks follow the forms and rules used
4144	+	* in class {@link Parallel}. Each method has the same name, but
4145	+	* returns a task rather than invoking it. These methods may be
4146	+	* useful in custom applications such as submitting a task without
4147	+	* waiting for completion, or combining with other tasks.
4148	+	*/
4149	+	public static class ForkJoinTasks {
4150	+	private ForkJoinTasks() {}
4151	+
4152	+	/**
4153	+	* Returns a task that when invoked, performs the given
4154	+	* action for each (key, value)
4155	+	*
4156	+	* @param map the map
4157	+	* @param action the action
4158	+	* @return the task
4159	+	*/
4160	+	public static <K,V> ForkJoinTask<Void> forEach
4161	+	(ConcurrentHashMapV8<K,V> map,
4162	+	BiAction<K,V> action) {
4163	+	if (action == null) throw new NullPointerException();
4164	+	return new ForEachMappingTask<K,V>(map, action);
4165	+	}
4166	+
4167	+	/**
4168	+	* Returns a task that when invoked, performs the given
4169	+	* action for each non-null transformation of each (key, value)
4170	+	*
4171	+	* @param map the map
4172	+	* @param transformer a function returning the transformation
4173	+	* for an element, or null of there is no transformation (in
4174	+	* which case the action is not applied).
4175	+	* @param action the action
4176	+	* @return the task
4177	+	*/
4178	+	public static <K,V,U> ForkJoinTask<Void> forEach
4179	+	(ConcurrentHashMapV8<K,V> map,
4180	+	BiFun<? super K, ? super V, ? extends U> transformer,
4181	+	Action<U> action) {
4182	+	if (transformer == null || action == null)
4183	+	throw new NullPointerException();
4184	+	return new ForEachTransformedMappingTask<K,V,U>
4185	+	(map, transformer, action);
4186	+	}
4187	+
4188	+	/**
4189	+	* Returns a task that when invoked, returns a non-null
4190	+	* result from applying the given search function on each
4191	+	* (key, value), or null if none.  Further element processing
4192	+	* is suppressed upon success. However, this method does not
4193	+	* return until other in-progress parallel invocations of the
4194	+	* search function also complete.
4195	+	*
4196	+	* @param map the map
4197	+	* @param searchFunction a function returning a non-null
4198	+	* result on success, else null
4199	+	* @return the task
4200	+	*/
4201	+	public static <K,V,U> ForkJoinTask<U> search
4202	+	(ConcurrentHashMapV8<K,V> map,
4203	+	BiFun<? super K, ? super V, ? extends U> searchFunction) {
4204	+	if (searchFunction == null) throw new NullPointerException();
4205	+	return new SearchMappingsTask<K,V,U>
4206	+	(map, searchFunction,
4207	+	new AtomicReference<U>());
4208	+	}
4209	+
4210	+	/**
4211	+	* Returns a task that when invoked, returns the result of
4212	+	* accumulating the given transformation of all (key, value) pairs
4213	+	* using the given reducer to combine values, or null if none.
4214	+	*
4215	+	* @param map the map
4216	+	* @param transformer a function returning the transformation
4217	+	* for an element, or null of there is no transformation (in
4218	+	* which case it is not combined).
4219	+	* @param reducer a commutative associative combining function
4220	+	* @return the task
4221	+	*/
4222	+	public static <K,V,U> ForkJoinTask<U> reduce
4223	+	(ConcurrentHashMapV8<K,V> map,
4224	+	BiFun<? super K, ? super V, ? extends U> transformer,
4225	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4226	+	if (transformer == null || reducer == null)
4227	+	throw new NullPointerException();
4228	+	return new MapReduceMappingsTask<K,V,U>
4229	+	(map, transformer, reducer);
4230	+	}
4231	+
4232	+	/**
4233	+	* Returns a task that when invoked, returns the result of
4234	+	* accumulating the given transformation of all (key, value) pairs
4235	+	* using the given reducer to combine values, and the given
4236	+	* basis as an identity value.
4237	+	*
4238	+	* @param map the map
4239	+	* @param transformer a function returning the transformation
4240	+	* for an element
4241	+	* @param basis the identity (initial default value) for the reduction
4242	+	* @param reducer a commutative associative combining function
4243	+	* @return the task
4244	+	*/
4245	+	public static <K,V> ForkJoinTask<Double> reduceToDouble
4246	+	(ConcurrentHashMapV8<K,V> map,
4247	+	ObjectByObjectToDouble<? super K, ? super V> transformer,
4248	+	double basis,
4249	+	DoubleByDoubleToDouble reducer) {
4250	+	if (transformer == null || reducer == null)
4251	+	throw new NullPointerException();
4252	+	return new MapReduceMappingsToDoubleTask<K,V>
4253	+	(map, transformer, basis, reducer);
4254	+	}
4255	+
4256	+	/**
4257	+	* Returns a task that when invoked, returns the result of
4258	+	* accumulating the given transformation of all (key, value) pairs
4259	+	* using the given reducer to combine values, and the given
4260	+	* basis as an identity value.
4261	+	*
4262	+	* @param map the map
4263	+	* @param transformer a function returning the transformation
4264	+	* for an element
4265	+	* @param basis the identity (initial default value) for the reduction
4266	+	* @param reducer a commutative associative combining function
4267	+	* @return the task
4268	+	*/
4269	+	public static <K,V> ForkJoinTask<Long> reduceToLong
4270	+	(ConcurrentHashMapV8<K,V> map,
4271	+	ObjectByObjectToLong<? super K, ? super V> transformer,
4272	+	long basis,
4273	+	LongByLongToLong reducer) {
4274	+	if (transformer == null || reducer == null)
4275	+	throw new NullPointerException();
4276	+	return new MapReduceMappingsToLongTask<K,V>
4277	+	(map, transformer, basis, reducer);
4278	+	}
4279	+
4280	+	/**
4281	+	* Returns a task that when invoked, returns the result of
4282	+	* accumulating the given transformation of all (key, value) pairs
4283	+	* using the given reducer to combine values, and the given
4284	+	* basis as an identity value.
4285	+	*
4286	+	* @param transformer a function returning the transformation
4287	+	* for an element
4288	+	* @param basis the identity (initial default value) for the reduction
4289	+	* @param reducer a commutative associative combining function
4290	+	* @return the task
4291	+	*/
4292	+	public static <K,V> ForkJoinTask<Integer> reduceToInt
4293	+	(ConcurrentHashMapV8<K,V> map,
4294	+	ObjectByObjectToInt<? super K, ? super V> transformer,
4295	+	int basis,
4296	+	IntByIntToInt reducer) {
4297	+	if (transformer == null || reducer == null)
4298	+	throw new NullPointerException();
4299	+	return new MapReduceMappingsToIntTask<K,V>
4300	+	(map, transformer, basis, reducer);
4301	+	}
4302	+
4303	+	/**
4304	+	* Returns a task that when invoked, performs the given action
4305	+	* for each key.
4306	+	*
4307	+	* @param map the map
4308	+	* @param action the action
4309	+	* @return the task
4310	+	*/
4311	+	public static <K,V> ForkJoinTask<Void> forEachKey
4312	+	(ConcurrentHashMapV8<K,V> map,
4313	+	Action<K> action) {
4314	+	if (action == null) throw new NullPointerException();
4315	+	return new ForEachKeyTask<K,V>(map, action);
4316	+	}
4317	+
4318	+	/**
4319	+	* Returns a task that when invoked, performs the given action
4320	+	* for each non-null transformation of each key.
4321	+	*
4322	+	* @param map the map
4323	+	* @param transformer a function returning the transformation
4324	+	* for an element, or null of there is no transformation (in
4325	+	* which case the action is not applied).
4326	+	* @param action the action
4327	+	* @return the task
4328	+	*/
4329	+	public static <K,V,U> ForkJoinTask<Void> forEachKey
4330	+	(ConcurrentHashMapV8<K,V> map,
4331	+	Fun<? super K, ? extends U> transformer,
4332	+	Action<U> action) {
4333	+	if (transformer == null || action == null)
4334	+	throw new NullPointerException();
4335	+	return new ForEachTransformedKeyTask<K,V,U>
4336	+	(map, transformer, action);
4337	+	}
4338	+
4339	+	/**
4340	+	* Returns a task that when invoked, returns a non-null result
4341	+	* from applying the given search function on each key, or
4342	+	* null if none.  Further element processing is suppressed
4343	+	* upon success. However, this method does not return until
4344	+	* other in-progress parallel invocations of the search
4345	+	* function also complete.
4346	+	*
4347	+	* @param map the map
4348	+	* @param searchFunction a function returning a non-null
4349	+	* result on success, else null
4350	+	* @return the task
4351	+	*/
4352	+	public static <K,V,U> ForkJoinTask<U> searchKeys
4353	+	(ConcurrentHashMapV8<K,V> map,
4354	+	Fun<? super K, ? extends U> searchFunction) {
4355	+	if (searchFunction == null) throw new NullPointerException();
4356	+	return new SearchKeysTask<K,V,U>
4357	+	(map, searchFunction,
4358	+	new AtomicReference<U>());
4359	+	}
4360	+
4361	+	/**
4362	+	* Returns a task that when invoked, returns the result of
4363	+	* accumulating all keys using the given reducer to combine
4364	+	* values, or null if none.
4365	+	*
4366	+	* @param map the map
4367	+	* @param reducer a commutative associative combining function
4368	+	* @return the task
4369	+	*/
4370	+	public static <K,V> ForkJoinTask<K> reduceKeys
4371	+	(ConcurrentHashMapV8<K,V> map,
4372	+	BiFun<? super K, ? super K, ? extends K> reducer) {
4373	+	if (reducer == null) throw new NullPointerException();
4374	+	return new ReduceKeysTask<K,V>
4375	+	(map, reducer);
4376	+	}
4377	+	/**
4378	+	* Returns a task that when invoked, returns the result of
4379	+	* accumulating the given transformation of all keys using the given
4380	+	* reducer to combine values, or null if none.
4381	+	*
4382	+	* @param map the map
4383	+	* @param transformer a function returning the transformation
4384	+	* for an element, or null of there is no transformation (in
4385	+	* which case it is not combined).
4386	+	* @param reducer a commutative associative combining function
4387	+	* @return the task
4388	+	*/
4389	+	public static <K,V,U> ForkJoinTask<U> reduceKeys
4390	+	(ConcurrentHashMapV8<K,V> map,
4391	+	Fun<? super K, ? extends U> transformer,
4392	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4393	+	if (transformer == null || reducer == null)
4394	+	throw new NullPointerException();
4395	+	return new MapReduceKeysTask<K,V,U>
4396	+	(map, transformer, reducer);
4397	+	}
4398	+
4399	+	/**
4400	+	* Returns a task that when invoked, returns the result of
4401	+	* accumulating the given transformation of all keys using the given
4402	+	* reducer to combine values, and the given basis as an
4403	+	* identity value.
4404	+	*
4405	+	* @param map the map
4406	+	* @param transformer a function returning the transformation
4407	+	* for an element
4408	+	* @param basis the identity (initial default value) for the reduction
4409	+	* @param reducer a commutative associative combining function
4410	+	* @return the task
4411	+	*/
4412	+	public static <K,V> ForkJoinTask<Double> reduceKeysToDouble
4413	+	(ConcurrentHashMapV8<K,V> map,
4414	+	ObjectToDouble<? super K> transformer,
4415	+	double basis,
4416	+	DoubleByDoubleToDouble reducer) {
4417	+	if (transformer == null || reducer == null)
4418	+	throw new NullPointerException();
4419	+	return new MapReduceKeysToDoubleTask<K,V>
4420	+	(map, transformer, basis, reducer);
4421	+	}
4422	+
4423	+	/**
4424	+	* Returns a task that when invoked, returns the result of
4425	+	* accumulating the given transformation of all keys using the given
4426	+	* reducer to combine values, and the given basis as an
4427	+	* identity value.
4428	+	*
4429	+	* @param map the map
4430	+	* @param transformer a function returning the transformation
4431	+	* for an element
4432	+	* @param basis the identity (initial default value) for the reduction
4433	+	* @param reducer a commutative associative combining function
4434	+	* @return the task
4435	+	*/
4436	+	public static <K,V> ForkJoinTask<Long> reduceKeysToLong
4437	+	(ConcurrentHashMapV8<K,V> map,
4438	+	ObjectToLong<? super K> transformer,
4439	+	long basis,
4440	+	LongByLongToLong reducer) {
4441	+	if (transformer == null || reducer == null)
4442	+	throw new NullPointerException();
4443	+	return new MapReduceKeysToLongTask<K,V>
4444	+	(map, transformer, basis, reducer);
4445	+	}
4446	+
4447	+	/**
4448	+	* Returns a task that when invoked, returns the result of
4449	+	* accumulating the given transformation of all keys using the given
4450	+	* reducer to combine values, and the given basis as an
4451	+	* identity value.
4452	+	*
4453	+	* @param map the map
4454	+	* @param transformer a function returning the transformation
4455	+	* for an element
4456	+	* @param basis the identity (initial default value) for the reduction
4457	+	* @param reducer a commutative associative combining function
4458	+	* @return the task
4459	+	*/
4460	+	public static <K,V> ForkJoinTask<Integer> reduceKeysToInt
4461	+	(ConcurrentHashMapV8<K,V> map,
4462	+	ObjectToInt<? super K> transformer,
4463	+	int basis,
4464	+	IntByIntToInt reducer) {
4465	+	if (transformer == null || reducer == null)
4466	+	throw new NullPointerException();
4467	+	return new MapReduceKeysToIntTask<K,V>
4468	+	(map, transformer, basis, reducer);
4469	+	}
4470	+
4471	+	/**
4472	+	* Returns a task that when invoked, performs the given action
4473	+	* for each value.
4474	+	*
4475	+	* @param map the map
4476	+	* @param action the action
4477	+	*/
4478	+	public static <K,V> ForkJoinTask<Void> forEachValue
4479	+	(ConcurrentHashMapV8<K,V> map,
4480	+	Action<V> action) {
4481	+	if (action == null) throw new NullPointerException();
4482	+	return new ForEachValueTask<K,V>(map, action);
4483	+	}
4484	+
4485	+	/**
4486	+	* Returns a task that when invoked, performs the given action
4487	+	* for each non-null transformation of each value.
4488	+	*
4489	+	* @param map the map
4490	+	* @param transformer a function returning the transformation
4491	+	* for an element, or null of there is no transformation (in
4492	+	* which case the action is not applied).
4493	+	* @param action the action
4494	+	*/
4495	+	public static <K,V,U> ForkJoinTask<Void> forEachValue
4496	+	(ConcurrentHashMapV8<K,V> map,
4497	+	Fun<? super V, ? extends U> transformer,
4498	+	Action<U> action) {
4499	+	if (transformer == null || action == null)
4500	+	throw new NullPointerException();
4501	+	return new ForEachTransformedValueTask<K,V,U>
4502	+	(map, transformer, action);
4503	+	}
4504	+
4505	+	/**
4506	+	* Returns a task that when invoked, returns a non-null result
4507	+	* from applying the given search function on each value, or
4508	+	* null if none.  Further element processing is suppressed
4509	+	* upon success. However, this method does not return until
4510	+	* other in-progress parallel invocations of the search
4511	+	* function also complete.
4512	+	*
4513	+	* @param map the map
4514	+	* @param searchFunction a function returning a non-null
4515	+	* result on success, else null
4516	+	* @return the task
4517	+	*
4518	+	*/
4519	+	public static <K,V,U> ForkJoinTask<U> searchValues
4520	+	(ConcurrentHashMapV8<K,V> map,
4521	+	Fun<? super V, ? extends U> searchFunction) {
4522	+	if (searchFunction == null) throw new NullPointerException();
4523	+	return new SearchValuesTask<K,V,U>
4524	+	(map, searchFunction,
4525	+	new AtomicReference<U>());
4526	+	}
4527	+
4528	+	/**
4529	+	* Returns a task that when invoked, returns the result of
4530	+	* accumulating all values using the given reducer to combine
4531	+	* values, or null if none.
4532	+	*
4533	+	* @param map the map
4534	+	* @param reducer a commutative associative combining function
4535	+	* @return the task
4536	+	*/
4537	+	public static <K,V> ForkJoinTask<V> reduceValues
4538	+	(ConcurrentHashMapV8<K,V> map,
4539	+	BiFun<? super V, ? super V, ? extends V> reducer) {
4540	+	if (reducer == null) throw new NullPointerException();
4541	+	return new ReduceValuesTask<K,V>
4542	+	(map, reducer);
4543	+	}
4544	+
4545	+	/**
4546	+	* Returns a task that when invoked, returns the result of
4547	+	* accumulating the given transformation of all values using the
4548	+	* given reducer to combine values, or null if none.
4549	+	*
4550	+	* @param map the map
4551	+	* @param transformer a function returning the transformation
4552	+	* for an element, or null of there is no transformation (in
4553	+	* which case it is not combined).
4554	+	* @param reducer a commutative associative combining function
4555	+	* @return the task
4556	+	*/
4557	+	public static <K,V,U> ForkJoinTask<U> reduceValues
4558	+	(ConcurrentHashMapV8<K,V> map,
4559	+	Fun<? super V, ? extends U> transformer,
4560	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4561	+	if (transformer == null || reducer == null)
4562	+	throw new NullPointerException();
4563	+	return new MapReduceValuesTask<K,V,U>
4564	+	(map, transformer, reducer);
4565	+	}
4566	+
4567	+	/**
4568	+	* Returns a task that when invoked, returns the result of
4569	+	* accumulating the given transformation of all values using the
4570	+	* given reducer to combine values, and the given basis as an
4571	+	* identity value.
4572	+	*
4573	+	* @param map the map
4574	+	* @param transformer a function returning the transformation
4575	+	* for an element
4576	+	* @param basis the identity (initial default value) for the reduction
4577	+	* @param reducer a commutative associative combining function
4578	+	* @return the task
4579	+	*/
4580	+	public static <K,V> ForkJoinTask<Double> reduceValuesToDouble
4581	+	(ConcurrentHashMapV8<K,V> map,
4582	+	ObjectToDouble<? super V> transformer,
4583	+	double basis,
4584	+	DoubleByDoubleToDouble reducer) {
4585	+	if (transformer == null || reducer == null)
4586	+	throw new NullPointerException();
4587	+	return new MapReduceValuesToDoubleTask<K,V>
4588	+	(map, transformer, basis, reducer);
4589	+	}
4590	+
4591	+	/**
4592	+	* Returns a task that when invoked, returns the result of
4593	+	* accumulating the given transformation of all values using the
4594	+	* given reducer to combine values, and the given basis as an
4595	+	* identity value.
4596	+	*
4597	+	* @param map the map
4598	+	* @param transformer a function returning the transformation
4599	+	* for an element
4600	+	* @param basis the identity (initial default value) for the reduction
4601	+	* @param reducer a commutative associative combining function
4602	+	* @return the task
4603	+	*/
4604	+	public static <K,V> ForkJoinTask<Long> reduceValuesToLong
4605	+	(ConcurrentHashMapV8<K,V> map,
4606	+	ObjectToLong<? super V> transformer,
4607	+	long basis,
4608	+	LongByLongToLong reducer) {
4609	+	if (transformer == null || reducer == null)
4610	+	throw new NullPointerException();
4611	+	return new MapReduceValuesToLongTask<K,V>
4612	+	(map, transformer, basis, reducer);
4613	+	}
4614	+
4615	+	/**
4616	+	* Returns a task that when invoked, returns the result of
4617	+	* accumulating the given transformation of all values using the
4618	+	* given reducer to combine values, and the given basis as an
4619	+	* identity value.
4620	+	*
4621	+	* @param map the map
4622	+	* @param transformer a function returning the transformation
4623	+	* for an element
4624	+	* @param basis the identity (initial default value) for the reduction
4625	+	* @param reducer a commutative associative combining function
4626	+	* @return the task
4627	+	*/
4628	+	public static <K,V> ForkJoinTask<Integer> reduceValuesToInt
4629	+	(ConcurrentHashMapV8<K,V> map,
4630	+	ObjectToInt<? super V> transformer,
4631	+	int basis,
4632	+	IntByIntToInt reducer) {
4633	+	if (transformer == null || reducer == null)
4634	+	throw new NullPointerException();
4635	+	return new MapReduceValuesToIntTask<K,V>
4636	+	(map, transformer, basis, reducer);
4637	+	}
4638	+
4639	+	/**
4640	+	* Returns a task that when invoked, perform the given action
4641	+	* for each entry.
4642	+	*
4643	+	* @param map the map
4644	+	* @param action the action
4645	+	*/
4646	+	public static <K,V> ForkJoinTask<Void> forEachEntry
4647	+	(ConcurrentHashMapV8<K,V> map,
4648	+	Action<Map.Entry<K,V>> action) {
4649	+	if (action == null) throw new NullPointerException();
4650	+	return new ForEachEntryTask<K,V>(map, action);
4651	+	}
4652	+
4653	+	/**
4654	+	* Returns a task that when invoked, perform the given action
4655	+	* for each non-null transformation of each entry.
4656	+	*
4657	+	* @param map the map
4658	+	* @param transformer a function returning the transformation
4659	+	* for an element, or null of there is no transformation (in
4660	+	* which case the action is not applied).
4661	+	* @param action the action
4662	+	*/
4663	+	public static <K,V,U> ForkJoinTask<Void> forEachEntry
4664	+	(ConcurrentHashMapV8<K,V> map,
4665	+	Fun<Map.Entry<K,V>, ? extends U> transformer,
4666	+	Action<U> action) {
4667	+	if (transformer == null || action == null)
4668	+	throw new NullPointerException();
4669	+	return new ForEachTransformedEntryTask<K,V,U>
4670	+	(map, transformer, action);
4671	+	}
4672	+
4673	+	/**
4674	+	* Returns a task that when invoked, returns a non-null result
4675	+	* from applying the given search function on each entry, or
4676	+	* null if none.  Further element processing is suppressed
4677	+	* upon success. However, this method does not return until
4678	+	* other in-progress parallel invocations of the search
4679	+	* function also complete.
4680	+	*
4681	+	* @param map the map
4682	+	* @param searchFunction a function returning a non-null
4683	+	* result on success, else null
4684	+	* @return the task
4685	+	*
4686	+	*/
4687	+	public static <K,V,U> ForkJoinTask<U> searchEntries
4688	+	(ConcurrentHashMapV8<K,V> map,
4689	+	Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
4690	+	if (searchFunction == null) throw new NullPointerException();
4691	+	return new SearchEntriesTask<K,V,U>
4692	+	(map, searchFunction,
4693	+	new AtomicReference<U>());
4694	+	}
4695	+
4696	+	/**
4697	+	* Returns a task that when invoked, returns the result of
4698	+	* accumulating all entries using the given reducer to combine
4699	+	* values, or null if none.
4700	+	*
4701	+	* @param map the map
4702	+	* @param reducer a commutative associative combining function
4703	+	* @return the task
4704	+	*/
4705	+	public static <K,V> ForkJoinTask<Map.Entry<K,V>> reduceEntries
4706	+	(ConcurrentHashMapV8<K,V> map,
4707	+	BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
4708	+	if (reducer == null) throw new NullPointerException();
4709	+	return new ReduceEntriesTask<K,V>
4710	+	(map, reducer);
4711	+	}
4712	+
4713	+	/**
4714	+	* Returns a task that when invoked, returns the result of
4715	+	* accumulating the given transformation of all entries using the
4716	+	* given reducer to combine values, or null if none.
4717	+	*
4718	+	* @param map the map
4719	+	* @param transformer a function returning the transformation
4720	+	* for an element, or null of there is no transformation (in
4721	+	* which case it is not combined).
4722	+	* @param reducer a commutative associative combining function
4723	+	* @return the task
4724	+	*/
4725	+	public static <K,V,U> ForkJoinTask<U> reduceEntries
4726	+	(ConcurrentHashMapV8<K,V> map,
4727	+	Fun<Map.Entry<K,V>, ? extends U> transformer,
4728	+	BiFun<? super U, ? super U, ? extends U> reducer) {
4729	+	if (transformer == null || reducer == null)
4730	+	throw new NullPointerException();
4731	+	return new MapReduceEntriesTask<K,V,U>
4732	+	(map, transformer, reducer);
4733	+	}
4734	+
4735	+	/**
4736	+	* Returns a task that when invoked, returns the result of
4737	+	* accumulating the given transformation of all entries using the
4738	+	* given reducer to combine values, and the given basis as an
4739	+	* identity value.
4740	+	*
4741	+	* @param map the map
4742	+	* @param transformer a function returning the transformation
4743	+	* for an element
4744	+	* @param basis the identity (initial default value) for the reduction
4745	+	* @param reducer a commutative associative combining function
4746	+	* @return the task
4747	+	*/
4748	+	public static <K,V> ForkJoinTask<Double> reduceEntriesToDouble
4749	+	(ConcurrentHashMapV8<K,V> map,
4750	+	ObjectToDouble<Map.Entry<K,V>> transformer,
4751	+	double basis,
4752	+	DoubleByDoubleToDouble reducer) {
4753	+	if (transformer == null || reducer == null)
4754	+	throw new NullPointerException();
4755	+	return new MapReduceEntriesToDoubleTask<K,V>
4756	+	(map, transformer, basis, reducer);
4757	+	}
4758	+
4759	+	/**
4760	+	* Returns a task that when invoked, returns the result of
4761	+	* accumulating the given transformation of all entries using the
4762	+	* given reducer to combine values, and the given basis as an
4763	+	* identity value.
4764	+	*
4765	+	* @param map the map
4766	+	* @param transformer a function returning the transformation
4767	+	* for an element
4768	+	* @param basis the identity (initial default value) for the reduction
4769	+	* @param reducer a commutative associative combining function
4770	+	* @return the task
4771	+	*/
4772	+	public static <K,V> ForkJoinTask<Long> reduceEntriesToLong
4773	+	(ConcurrentHashMapV8<K,V> map,
4774	+	ObjectToLong<Map.Entry<K,V>> transformer,
4775	+	long basis,
4776	+	LongByLongToLong reducer) {
4777	+	if (transformer == null || reducer == null)
4778	+	throw new NullPointerException();
4779	+	return new MapReduceEntriesToLongTask<K,V>
4780	+	(map, transformer, basis, reducer);
4781	+	}
4782	+
4783	+	/**
4784	+	* Returns a task that when invoked, returns the result of
4785	+	* accumulating the given transformation of all entries using the
4786	+	* given reducer to combine values, and the given basis as an
4787	+	* identity value.
4788	+	*
4789	+	* @param map the map
4790	+	* @param transformer a function returning the transformation
4791	+	* for an element
4792	+	* @param basis the identity (initial default value) for the reduction
4793	+	* @param reducer a commutative associative combining function
4794	+	* @return the task
4795	+	*/
4796	+	public static <K,V> ForkJoinTask<Integer> reduceEntriesToInt
4797	+	(ConcurrentHashMapV8<K,V> map,
4798	+	ObjectToInt<Map.Entry<K,V>> transformer,
4799	+	int basis,
4800	+	IntByIntToInt reducer) {
4801	+	if (transformer == null || reducer == null)
4802	+	throw new NullPointerException();
4803	+	return new MapReduceEntriesToIntTask<K,V>
4804	+	(map, transformer, basis, reducer);
4805	+	}
4806	+	}
4807	+
4808	+	// -------------------------------------------------------
4809	+
4810	+	/**
4811	+	* Base for FJ tasks for bulk operations. This adds a variant of
4812	+	* CountedCompleters and some split and merge bookkeeping to
4813	+	* iterator functionality. The forEach and reduce methods are
4814	+	* similar to those illustrated in CountedCompleter documentation,
4815	+	* except that bottom-up reduction completions perform them within
4816	+	* their compute methods. The search methods are like forEach
4817	+	* except they continually poll for success and exit early.  Also,
4818	+	* exceptions are handled in a simpler manner, by just trying to
4819	+	* complete root task exceptionally.
4820	+	*/
4821	+	static abstract class BulkTask<K,V,R> extends Traverser<K,V,R> {
4822	+	final BulkTask<K,V,?> parent;  // completion target
4823	+	int batch;                     // split control
4824	+	int pending;                   // completion control
4825	+
4826	+	/** Constructor for root tasks */
4827	+	BulkTask(ConcurrentHashMapV8<K,V> map) {
4828	+	super(map);
4829	+	this.parent = null;
4830	+	this.batch = -1; // force call to batch() on execution
4831	+	}
4832	+
4833	+	/** Constructor for subtasks */
4834	+	BulkTask(BulkTask<K,V,?> parent, int batch, boolean split) {
4835	+	super(parent, split);
4836	+	this.parent = parent;
4837	+	this.batch = batch;
4838	+	}
4839	+
4840	+	// FJ methods
4841	+
4842	+	/**
4843	+	* Propagates completion. Note that all reduce actions
4844	+	* bypass this method to combine while completing.
4845	+	*/
4846	+	final void tryComplete() {
4847	+	BulkTask<K,V,?> a = this, s = a;
4848	+	for (int c;;) {
4849	+	if ((c = a.pending) == 0) {
4850	+	if ((a = (s = a).parent) == null) {
4851	+	s.quietlyComplete();
4852	+	break;
4853	+	}
4854	+	}
4855	+	else if (U.compareAndSwapInt(a, PENDING, c, c - 1))
4856	+	break;
4857	+	}
4858	+	}
4859	+
4860	+	/**
4861	+	* Forces root task to throw exception unless already complete.
4862	+	*/
4863	+	final void tryAbortComputation(Throwable ex) {
4864	+	for (BulkTask<K,V,?> a = this;;) {
4865	+	BulkTask<K,V,?> p = a.parent;
4866	+	if (p == null) {
4867	+	a.completeExceptionally(ex);
4868	+	break;
4869	+	}
4870	+	a = p;
4871	+	}
4872	+	}
4873	+
4874	+	public final boolean exec() {
4875	+	try {
4876	+	compute();
4877	+	}
4878	+	catch (Throwable ex) {
4879	+	tryAbortComputation(ex);
4880	+	}
4881	+	return false;
4882	+	}
4883	+
4884	+	public abstract void compute();
4885	+
4886	+	// utilities
4887	+
4888	+	/** CompareAndSet pending count */
4889	+	final boolean casPending(int cmp, int val) {
4890	+	return U.compareAndSwapInt(this, PENDING, cmp, val);
4891	+	}
4892	+
4893	+	/**
4894	+	* Returns approx exp2 of the number of times (minus one) to
4895	+	* split task by two before executing leaf action. This value
4896	+	* is faster to compute and more convenient to use as a guide
4897	+	* to splitting than is the depth, since it is used while
4898	+	* dividing by two anyway.
4899	+	*/
4900	+	final int batch() {
4901	+	int b = batch;
4902	+	if (b < 0) {
4903	+	long n = map.counter.sum();
4904	+	int sp = getPool().getParallelism() << 3; // slack of 8
4905	+	b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
4906	+	}
4907	+	return b;
4908	+	}
4909	+
4910	+	/**
4911	+	* Error message for hoisted null checks of functions
4912	+	*/
4913	+	static final String NullFunctionMessage =
4914	+	"Unexpected null function";
4915	+
4916	+	/**
4917	+	* Returns exportable snapshot entry.
4918	+	*/
4919	+	static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
4920	+	return new AbstractMap.SimpleEntry(k, v);
4921	+	}
4922	+
4923	+	// Unsafe mechanics
4924	+	private static final sun.misc.Unsafe U;
4925	+	private static final long PENDING;
4926	+	static {
4927	+	try {
4928	+	U = sun.misc.Unsafe.getUnsafe();
4929	+	PENDING = U.objectFieldOffset
4930	+	(BulkTask.class.getDeclaredField("pending"));
4931	+	} catch (Exception e) {
4932	+	throw new Error(e);
4933	+	}
4934	+	}
4935	+	}
4936	+
4937	+	/*
4938	+	* Task classes. Coded in a regular but ugly format/style to
4939	+	* simplify checks that each variant differs in the right way from
4940	+	* others.
4941	+	*/
4942	+
4943	+	static final class ForEachKeyTask<K,V>
4944	+	extends BulkTask<K,V,Void> {
4945	+	final Action<K> action;
4946	+	ForEachKeyTask
4947	+	(ConcurrentHashMapV8<K,V> m,
4948	+	Action<K> action) {
4949	+	super(m);
4950	+	this.action = action;
4951	+	}
4952	+	ForEachKeyTask
4953	+	(BulkTask<K,V,?> p, int b, boolean split,
4954	+	Action<K> action) {
4955	+	super(p, b, split);
4956	+	this.action = action;
4957	+	}
4958	+	public final void compute() {
4959	+	final Action<K> action = this.action;
4960	+	if (action == null)
4961	+	throw new Error(NullFunctionMessage);
4962	+	int b = batch(), c;
4963	+	while (b > 1 && baseIndex != baseLimit) {
4964	+	do {} while (!casPending(c = pending, c+1));
4965	+	new ForEachKeyTask<K,V>(this, b >>>= 1, true, action).fork();
4966	+	}
4967	+	while (advance() != null)
4968	+	action.apply((K)nextKey);
4969	+	tryComplete();
4970	+	}
4971	+	}
4972	+
4973	+	static final class ForEachValueTask<K,V>
4974	+	extends BulkTask<K,V,Void> {
4975	+	final Action<V> action;
4976	+	ForEachValueTask
4977	+	(ConcurrentHashMapV8<K,V> m,
4978	+	Action<V> action) {
4979	+	super(m);
4980	+	this.action = action;
4981	+	}
4982	+	ForEachValueTask
4983	+	(BulkTask<K,V,?> p, int b, boolean split,
4984	+	Action<V> action) {
4985	+	super(p, b, split);
4986	+	this.action = action;
4987	+	}
4988	+	public final void compute() {
4989	+	final Action<V> action = this.action;
4990	+	if (action == null)
4991	+	throw new Error(NullFunctionMessage);
4992	+	int b = batch(), c;
4993	+	while (b > 1 && baseIndex != baseLimit) {
4994	+	do {} while (!casPending(c = pending, c+1));
4995	+	new ForEachValueTask<K,V>(this, b >>>= 1, true, action).fork();
4996	+	}
4997	+	Object v;
4998	+	while ((v = advance()) != null)
4999	+	action.apply((V)v);
5000	+	tryComplete();
5001	+	}
5002	+	}
5003	+
5004	+	static final class ForEachEntryTask<K,V>
5005	+	extends BulkTask<K,V,Void> {
5006	+	final Action<Entry<K,V>> action;
5007	+	ForEachEntryTask
5008	+	(ConcurrentHashMapV8<K,V> m,
5009	+	Action<Entry<K,V>> action) {
5010	+	super(m);
5011	+	this.action = action;
5012	+	}
5013	+	ForEachEntryTask
5014	+	(BulkTask<K,V,?> p, int b, boolean split,
5015	+	Action<Entry<K,V>> action) {
5016	+	super(p, b, split);
5017	+	this.action = action;
5018	+	}
5019	+	public final void compute() {
5020	+	final Action<Entry<K,V>> action = this.action;
5021	+	if (action == null)
5022	+	throw new Error(NullFunctionMessage);
5023	+	int b = batch(), c;
5024	+	while (b > 1 && baseIndex != baseLimit) {
5025	+	do {} while (!casPending(c = pending, c+1));
5026	+	new ForEachEntryTask<K,V>(this, b >>>= 1, true, action).fork();
5027	+	}
5028	+	Object v;
5029	+	while ((v = advance()) != null)
5030	+	action.apply(entryFor((K)nextKey, (V)v));
5031	+	tryComplete();
5032	+	}
5033	+	}
5034	+
5035	+	static final class ForEachMappingTask<K,V>
5036	+	extends BulkTask<K,V,Void> {
5037	+	final BiAction<K,V> action;
5038	+	ForEachMappingTask
5039	+	(ConcurrentHashMapV8<K,V> m,
5040	+	BiAction<K,V> action) {
5041	+	super(m);
5042	+	this.action = action;
5043	+	}
5044	+	ForEachMappingTask
5045	+	(BulkTask<K,V,?> p, int b, boolean split,
5046	+	BiAction<K,V> action) {
5047	+	super(p, b, split);
5048	+	this.action = action;
5049	+	}
5050	+
5051	+	public final void compute() {
5052	+	final BiAction<K,V> action = this.action;
5053	+	if (action == null)
5054	+	throw new Error(NullFunctionMessage);
5055	+	int b = batch(), c;
5056	+	while (b > 1 && baseIndex != baseLimit) {
5057	+	do {} while (!casPending(c = pending, c+1));
5058	+	new ForEachMappingTask<K,V>(this, b >>>= 1, true,
5059	+	action).fork();
5060	+	}
5061	+	Object v;
5062	+	while ((v = advance()) != null)
5063	+	action.apply((K)nextKey, (V)v);
5064	+	tryComplete();
5065	+	}
5066	+	}
5067	+
5068	+	static final class ForEachTransformedKeyTask<K,V,U>
5069	+	extends BulkTask<K,V,Void> {
5070	+	final Fun<? super K, ? extends U> transformer;
5071	+	final Action<U> action;
5072	+	ForEachTransformedKeyTask
5073	+	(ConcurrentHashMapV8<K,V> m,
5074	+	Fun<? super K, ? extends U> transformer,
5075	+	Action<U> action) {
5076	+	super(m);
5077	+	this.transformer = transformer;
5078	+	this.action = action;
5079	+
5080	+	}
5081	+	ForEachTransformedKeyTask
5082	+	(BulkTask<K,V,?> p, int b, boolean split,
5083	+	Fun<? super K, ? extends U> transformer,
5084	+	Action<U> action) {
5085	+	super(p, b, split);
5086	+	this.transformer = transformer;
5087	+	this.action = action;
5088	+	}
5089	+	public final void compute() {
5090	+	final Fun<? super K, ? extends U> transformer =
5091	+	this.transformer;
5092	+	final Action<U> action = this.action;
5093	+	if (transformer == null || action == null)
5094	+	throw new Error(NullFunctionMessage);
5095	+	int b = batch(), c;
5096	+	while (b > 1 && baseIndex != baseLimit) {
5097	+	do {} while (!casPending(c = pending, c+1));
5098	+	new ForEachTransformedKeyTask<K,V,U>
5099	+	(this, b >>>= 1, true, transformer, action).fork();
5100	+	}
5101	+	U u;
5102	+	while (advance() != null) {
5103	+	if ((u = transformer.apply((K)nextKey)) != null)
5104	+	action.apply(u);
5105	+	}
5106	+	tryComplete();
5107	+	}
5108	+	}
5109	+
5110	+	static final class ForEachTransformedValueTask<K,V,U>
5111	+	extends BulkTask<K,V,Void> {
5112	+	final Fun<? super V, ? extends U> transformer;
5113	+	final Action<U> action;
5114	+	ForEachTransformedValueTask
5115	+	(ConcurrentHashMapV8<K,V> m,
5116	+	Fun<? super V, ? extends U> transformer,
5117	+	Action<U> action) {
5118	+	super(m);
5119	+	this.transformer = transformer;
5120	+	this.action = action;
5121	+
5122	+	}
5123	+	ForEachTransformedValueTask
5124	+	(BulkTask<K,V,?> p, int b, boolean split,
5125	+	Fun<? super V, ? extends U> transformer,
5126	+	Action<U> action) {
5127	+	super(p, b, split);
5128	+	this.transformer = transformer;
5129	+	this.action = action;
5130	+	}
5131	+	public final void compute() {
5132	+	final Fun<? super V, ? extends U> transformer =
5133	+	this.transformer;
5134	+	final Action<U> action = this.action;
5135	+	if (transformer == null || action == null)
5136	+	throw new Error(NullFunctionMessage);
5137	+	int b = batch(), c;
5138	+	while (b > 1 && baseIndex != baseLimit) {
5139	+	do {} while (!casPending(c = pending, c+1));
5140	+	new ForEachTransformedValueTask<K,V,U>
5141	+	(this, b >>>= 1, true, transformer, action).fork();
5142	+	}
5143	+	Object v; U u;
5144	+	while ((v = advance()) != null) {
5145	+	if ((u = transformer.apply((V)v)) != null)
5146	+	action.apply(u);
5147	+	}
5148	+	tryComplete();
5149	+	}
5150	+	}
5151	+
5152	+	static final class ForEachTransformedEntryTask<K,V,U>
5153	+	extends BulkTask<K,V,Void> {
5154	+	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5155	+	final Action<U> action;
5156	+	ForEachTransformedEntryTask
5157	+	(ConcurrentHashMapV8<K,V> m,
5158	+	Fun<Map.Entry<K,V>, ? extends U> transformer,
5159	+	Action<U> action) {
5160	+	super(m);
5161	+	this.transformer = transformer;
5162	+	this.action = action;
5163	+
5164	+	}
5165	+	ForEachTransformedEntryTask
5166	+	(BulkTask<K,V,?> p, int b, boolean split,
5167	+	Fun<Map.Entry<K,V>, ? extends U> transformer,
5168	+	Action<U> action) {
5169	+	super(p, b, split);
5170	+	this.transformer = transformer;
5171	+	this.action = action;
5172	+	}
5173	+	public final void compute() {
5174	+	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5175	+	this.transformer;
5176	+	final Action<U> action = this.action;
5177	+	if (transformer == null || action == null)
5178	+	throw new Error(NullFunctionMessage);
5179	+	int b = batch(), c;
5180	+	while (b > 1 && baseIndex != baseLimit) {
5181	+	do {} while (!casPending(c = pending, c+1));
5182	+	new ForEachTransformedEntryTask<K,V,U>
5183	+	(this, b >>>= 1, true, transformer, action).fork();
5184	+	}
5185	+	Object v; U u;
5186	+	while ((v = advance()) != null) {
5187	+	if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null)
5188	+	action.apply(u);
5189	+	}
5190	+	tryComplete();
5191	+	}
5192	+	}
5193	+
5194	+	static final class ForEachTransformedMappingTask<K,V,U>
5195	+	extends BulkTask<K,V,Void> {
5196	+	final BiFun<? super K, ? super V, ? extends U> transformer;
5197	+	final Action<U> action;
5198	+	ForEachTransformedMappingTask
5199	+	(ConcurrentHashMapV8<K,V> m,
5200	+	BiFun<? super K, ? super V, ? extends U> transformer,
5201	+	Action<U> action) {
5202	+	super(m);
5203	+	this.transformer = transformer;
5204	+	this.action = action;
5205	+
5206	+	}
5207	+	ForEachTransformedMappingTask
5208	+	(BulkTask<K,V,?> p, int b, boolean split,
5209	+	BiFun<? super K, ? super V, ? extends U> transformer,
5210	+	Action<U> action) {
5211	+	super(p, b, split);
5212	+	this.transformer = transformer;
5213	+	this.action = action;
5214	+	}
5215	+	public final void compute() {
5216	+	final BiFun<? super K, ? super V, ? extends U> transformer =
5217	+	this.transformer;
5218	+	final Action<U> action = this.action;
5219	+	if (transformer == null || action == null)
5220	+	throw new Error(NullFunctionMessage);
5221	+	int b = batch(), c;
5222	+	while (b > 1 && baseIndex != baseLimit) {
5223	+	do {} while (!casPending(c = pending, c+1));
5224	+	new ForEachTransformedMappingTask<K,V,U>
5225	+	(this, b >>>= 1, true, transformer, action).fork();
5226	+	}
5227	+	Object v; U u;
5228	+	while ((v = advance()) != null) {
5229	+	if ((u = transformer.apply((K)nextKey, (V)v)) != null)
5230	+	action.apply(u);
5231	+	}
5232	+	tryComplete();
5233	+	}
5234	+	}
5235	+
5236	+	static final class SearchKeysTask<K,V,U>
5237	+	extends BulkTask<K,V,U> {
5238	+	final Fun<? super K, ? extends U> searchFunction;
5239	+	final AtomicReference<U> result;
5240	+	SearchKeysTask
5241	+	(ConcurrentHashMapV8<K,V> m,
5242	+	Fun<? super K, ? extends U> searchFunction,
5243	+	AtomicReference<U> result) {
5244	+	super(m);
5245	+	this.searchFunction = searchFunction; this.result = result;
5246	+	}
5247	+	SearchKeysTask
5248	+	(BulkTask<K,V,?> p, int b, boolean split,
5249	+	Fun<? super K, ? extends U> searchFunction,
5250	+	AtomicReference<U> result) {
5251	+	super(p, b, split);
5252	+	this.searchFunction = searchFunction; this.result = result;
5253	+	}
5254	+	public final void compute() {
5255	+	AtomicReference<U> result = this.result;
5256	+	final Fun<? super K, ? extends U> searchFunction =
5257	+	this.searchFunction;
5258	+	if (searchFunction == null || result == null)
5259	+	throw new Error(NullFunctionMessage);
5260	+	int b = batch(), c;
5261	+	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5262	+	do {} while (!casPending(c = pending, c+1));
5263	+	new SearchKeysTask<K,V,U>(this, b >>>= 1, true,
5264	+	searchFunction, result).fork();
5265	+	}
5266	+	U u;
5267	+	while (result.get() == null && advance() != null) {
5268	+	if ((u = searchFunction.apply((K)nextKey)) != null) {
5269	+	result.compareAndSet(null, u);
5270	+	break;
5271	+	}
5272	+	}
5273	+	tryComplete();
5274	+	}
5275	+	public final U getRawResult() { return result.get(); }
5276	+	}
5277	+
5278	+	static final class SearchValuesTask<K,V,U>
5279	+	extends BulkTask<K,V,U> {
5280	+	final Fun<? super V, ? extends U> searchFunction;
5281	+	final AtomicReference<U> result;
5282	+	SearchValuesTask
5283	+	(ConcurrentHashMapV8<K,V> m,
5284	+	Fun<? super V, ? extends U> searchFunction,
5285	+	AtomicReference<U> result) {
5286	+	super(m);
5287	+	this.searchFunction = searchFunction; this.result = result;
5288	+	}
5289	+	SearchValuesTask
5290	+	(BulkTask<K,V,?> p, int b, boolean split,
5291	+	Fun<? super V, ? extends U> searchFunction,
5292	+	AtomicReference<U> result) {
5293	+	super(p, b, split);
5294	+	this.searchFunction = searchFunction; this.result = result;
5295	+	}
5296	+	public final void compute() {
5297	+	AtomicReference<U> result = this.result;
5298	+	final Fun<? super V, ? extends U> searchFunction =
5299	+	this.searchFunction;
5300	+	if (searchFunction == null || result == null)
5301	+	throw new Error(NullFunctionMessage);
5302	+	int b = batch(), c;
5303	+	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5304	+	do {} while (!casPending(c = pending, c+1));
5305	+	new SearchValuesTask<K,V,U>(this, b >>>= 1, true,
5306	+	searchFunction, result).fork();
5307	+	}
5308	+	Object v; U u;
5309	+	while (result.get() == null && (v = advance()) != null) {
5310	+	if ((u = searchFunction.apply((V)v)) != null) {
5311	+	result.compareAndSet(null, u);
5312	+	break;
5313	+	}
5314	+	}
5315	+	tryComplete();
5316	+	}
5317	+	public final U getRawResult() { return result.get(); }
5318	+	}
5319	+
5320	+	static final class SearchEntriesTask<K,V,U>
5321	+	extends BulkTask<K,V,U> {
5322	+	final Fun<Entry<K,V>, ? extends U> searchFunction;
5323	+	final AtomicReference<U> result;
5324	+	SearchEntriesTask
5325	+	(ConcurrentHashMapV8<K,V> m,
5326	+	Fun<Entry<K,V>, ? extends U> searchFunction,
5327	+	AtomicReference<U> result) {
5328	+	super(m);
5329	+	this.searchFunction = searchFunction; this.result = result;
5330	+	}
5331	+	SearchEntriesTask
5332	+	(BulkTask<K,V,?> p, int b, boolean split,
5333	+	Fun<Entry<K,V>, ? extends U> searchFunction,
5334	+	AtomicReference<U> result) {
5335	+	super(p, b, split);
5336	+	this.searchFunction = searchFunction; this.result = result;
5337	+	}
5338	+	public final void compute() {
5339	+	AtomicReference<U> result = this.result;
5340	+	final Fun<Entry<K,V>, ? extends U> searchFunction =
5341	+	this.searchFunction;
5342	+	if (searchFunction == null || result == null)
5343	+	throw new Error(NullFunctionMessage);
5344	+	int b = batch(), c;
5345	+	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5346	+	do {} while (!casPending(c = pending, c+1));
5347	+	new SearchEntriesTask<K,V,U>(this, b >>>= 1, true,
5348	+	searchFunction, result).fork();
5349	+	}
5350	+	Object v; U u;
5351	+	while (result.get() == null && (v = advance()) != null) {
5352	+	if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) {
5353	+	result.compareAndSet(null, u);
5354	+	break;
5355	+	}
5356	+	}
5357	+	tryComplete();
5358	+	}
5359	+	public final U getRawResult() { return result.get(); }
5360	+	}
5361	+
5362	+	static final class SearchMappingsTask<K,V,U>
5363	+	extends BulkTask<K,V,U> {
5364	+	final BiFun<? super K, ? super V, ? extends U> searchFunction;
5365	+	final AtomicReference<U> result;
5366	+	SearchMappingsTask
5367	+	(ConcurrentHashMapV8<K,V> m,
5368	+	BiFun<? super K, ? super V, ? extends U> searchFunction,
5369	+	AtomicReference<U> result) {
5370	+	super(m);
5371	+	this.searchFunction = searchFunction; this.result = result;
5372	+	}
5373	+	SearchMappingsTask
5374	+	(BulkTask<K,V,?> p, int b, boolean split,
5375	+	BiFun<? super K, ? super V, ? extends U> searchFunction,
5376	+	AtomicReference<U> result) {
5377	+	super(p, b, split);
5378	+	this.searchFunction = searchFunction; this.result = result;
5379	+	}
5380	+	public final void compute() {
5381	+	AtomicReference<U> result = this.result;
5382	+	final BiFun<? super K, ? super V, ? extends U> searchFunction =
5383	+	this.searchFunction;
5384	+	if (searchFunction == null || result == null)
5385	+	throw new Error(NullFunctionMessage);
5386	+	int b = batch(), c;
5387	+	while (b > 1 && baseIndex != baseLimit && result.get() == null) {
5388	+	do {} while (!casPending(c = pending, c+1));
5389	+	new SearchMappingsTask<K,V,U>(this, b >>>= 1, true,
5390	+	searchFunction, result).fork();
5391	+	}
5392	+	Object v; U u;
5393	+	while (result.get() == null && (v = advance()) != null) {
5394	+	if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) {
5395	+	result.compareAndSet(null, u);
5396	+	break;
5397	+	}
5398	+	}
5399	+	tryComplete();
5400	+	}
5401	+	public final U getRawResult() { return result.get(); }
5402	+	}
5403	+
5404	+	static final class ReduceKeysTask<K,V>
5405	+	extends BulkTask<K,V,K> {
5406	+	final BiFun<? super K, ? super K, ? extends K> reducer;
5407	+	K result;
5408	+	ReduceKeysTask<K,V> sibling;
5409	+	ReduceKeysTask
5410	+	(ConcurrentHashMapV8<K,V> m,
5411	+	BiFun<? super K, ? super K, ? extends K> reducer) {
5412	+	super(m);
5413	+	this.reducer = reducer;
5414	+	}
5415	+	ReduceKeysTask
5416	+	(BulkTask<K,V,?> p, int b, boolean split,
5417	+	BiFun<? super K, ? super K, ? extends K> reducer) {
5418	+	super(p, b, split);
5419	+	this.reducer = reducer;
5420	+	}
5421	+
5422	+	public final void compute() {
5423	+	ReduceKeysTask<K,V> t = this;
5424	+	final BiFun<? super K, ? super K, ? extends K> reducer =
5425	+	this.reducer;
5426	+	if (reducer == null)
5427	+	throw new Error(NullFunctionMessage);
5428	+	int b = batch();
5429	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5430	+	b >>>= 1;
5431	+	t.pending = 1;
5432	+	ReduceKeysTask<K,V> rt =
5433	+	new ReduceKeysTask<K,V>
5434	+	(t, b, true, reducer);
5435	+	t = new ReduceKeysTask<K,V>
5436	+	(t, b, false, reducer);
5437	+	t.sibling = rt;
5438	+	rt.sibling = t;
5439	+	rt.fork();
5440	+	}
5441	+	K r = null;
5442	+	while (t.advance() != null) {
5443	+	K u = (K)t.nextKey;
5444	+	r = (r == null) ? u : reducer.apply(r, u);
5445	+	}
5446	+	t.result = r;
5447	+	for (;;) {
5448	+	int c; BulkTask<K,V,?> par; ReduceKeysTask<K,V> s, p; K u;
5449	+	if ((par = t.parent) == null ||
5450	+	!(par instanceof ReduceKeysTask)) {
5451	+	t.quietlyComplete();
5452	+	break;
5453	+	}
5454	+	else if ((c = (p = (ReduceKeysTask<K,V>)par).pending) == 0) {
5455	+	if ((s = t.sibling) != null && (u = s.result) != null)
5456	+	r = (r == null) ? u : reducer.apply(r, u);
5457	+	(t = p).result = r;
5458	+	}
5459	+	else if (p.casPending(c, 0))
5460	+	break;
5461	+	}
5462	+	}
5463	+	public final K getRawResult() { return result; }
5464	+	}
5465	+
5466	+	static final class ReduceValuesTask<K,V>
5467	+	extends BulkTask<K,V,V> {
5468	+	final BiFun<? super V, ? super V, ? extends V> reducer;
5469	+	V result;
5470	+	ReduceValuesTask<K,V> sibling;
5471	+	ReduceValuesTask
5472	+	(ConcurrentHashMapV8<K,V> m,
5473	+	BiFun<? super V, ? super V, ? extends V> reducer) {
5474	+	super(m);
5475	+	this.reducer = reducer;
5476	+	}
5477	+	ReduceValuesTask
5478	+	(BulkTask<K,V,?> p, int b, boolean split,
5479	+	BiFun<? super V, ? super V, ? extends V> reducer) {
5480	+	super(p, b, split);
5481	+	this.reducer = reducer;
5482	+	}
5483	+
5484	+	public final void compute() {
5485	+	ReduceValuesTask<K,V> t = this;
5486	+	final BiFun<? super V, ? super V, ? extends V> reducer =
5487	+	this.reducer;
5488	+	if (reducer == null)
5489	+	throw new Error(NullFunctionMessage);
5490	+	int b = batch();
5491	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5492	+	b >>>= 1;
5493	+	t.pending = 1;
5494	+	ReduceValuesTask<K,V> rt =
5495	+	new ReduceValuesTask<K,V>
5496	+	(t, b, true, reducer);
5497	+	t = new ReduceValuesTask<K,V>
5498	+	(t, b, false, reducer);
5499	+	t.sibling = rt;
5500	+	rt.sibling = t;
5501	+	rt.fork();
5502	+	}
5503	+	V r = null;
5504	+	Object v;
5505	+	while ((v = t.advance()) != null) {
5506	+	V u = (V)v;
5507	+	r = (r == null) ? u : reducer.apply(r, u);
5508	+	}
5509	+	t.result = r;
5510	+	for (;;) {
5511	+	int c; BulkTask<K,V,?> par; ReduceValuesTask<K,V> s, p; V u;
5512	+	if ((par = t.parent) == null ||
5513	+	!(par instanceof ReduceValuesTask)) {
5514	+	t.quietlyComplete();
5515	+	break;
5516	+	}
5517	+	else if ((c = (p = (ReduceValuesTask<K,V>)par).pending) == 0) {
5518	+	if ((s = t.sibling) != null && (u = s.result) != null)
5519	+	r = (r == null) ? u : reducer.apply(r, u);
5520	+	(t = p).result = r;
5521	+	}
5522	+	else if (p.casPending(c, 0))
5523	+	break;
5524	+	}
5525	+	}
5526	+	public final V getRawResult() { return result; }
5527	+	}
5528	+
5529	+	static final class ReduceEntriesTask<K,V>
5530	+	extends BulkTask<K,V,Map.Entry<K,V>> {
5531	+	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
5532	+	Map.Entry<K,V> result;
5533	+	ReduceEntriesTask<K,V> sibling;
5534	+	ReduceEntriesTask
5535	+	(ConcurrentHashMapV8<K,V> m,
5536	+	BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5537	+	super(m);
5538	+	this.reducer = reducer;
5539	+	}
5540	+	ReduceEntriesTask
5541	+	(BulkTask<K,V,?> p, int b, boolean split,
5542	+	BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
5543	+	super(p, b, split);
5544	+	this.reducer = reducer;
5545	+	}
5546	+
5547	+	public final void compute() {
5548	+	ReduceEntriesTask<K,V> t = this;
5549	+	final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer =
5550	+	this.reducer;
5551	+	if (reducer == null)
5552	+	throw new Error(NullFunctionMessage);
5553	+	int b = batch();
5554	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5555	+	b >>>= 1;
5556	+	t.pending = 1;
5557	+	ReduceEntriesTask<K,V> rt =
5558	+	new ReduceEntriesTask<K,V>
5559	+	(t, b, true, reducer);
5560	+	t = new ReduceEntriesTask<K,V>
5561	+	(t, b, false, reducer);
5562	+	t.sibling = rt;
5563	+	rt.sibling = t;
5564	+	rt.fork();
5565	+	}
5566	+	Map.Entry<K,V> r = null;
5567	+	Object v;
5568	+	while ((v = t.advance()) != null) {
5569	+	Map.Entry<K,V> u = entryFor((K)t.nextKey, (V)v);
5570	+	r = (r == null) ? u : reducer.apply(r, u);
5571	+	}
5572	+	t.result = r;
5573	+	for (;;) {
5574	+	int c; BulkTask<K,V,?> par; ReduceEntriesTask<K,V> s, p;
5575	+	Map.Entry<K,V> u;
5576	+	if ((par = t.parent) == null ||
5577	+	!(par instanceof ReduceEntriesTask)) {
5578	+	t.quietlyComplete();
5579	+	break;
5580	+	}
5581	+	else if ((c = (p = (ReduceEntriesTask<K,V>)par).pending) == 0) {
5582	+	if ((s = t.sibling) != null && (u = s.result) != null)
5583	+	r = (r == null) ? u : reducer.apply(r, u);
5584	+	(t = p).result = r;
5585	+	}
5586	+	else if (p.casPending(c, 0))
5587	+	break;
5588	+	}
5589	+	}
5590	+	public final Map.Entry<K,V> getRawResult() { return result; }
5591	+	}
5592	+
5593	+	static final class MapReduceKeysTask<K,V,U>
5594	+	extends BulkTask<K,V,U> {
5595	+	final Fun<? super K, ? extends U> transformer;
5596	+	final BiFun<? super U, ? super U, ? extends U> reducer;
5597	+	U result;
5598	+	MapReduceKeysTask<K,V,U> sibling;
5599	+	MapReduceKeysTask
5600	+	(ConcurrentHashMapV8<K,V> m,
5601	+	Fun<? super K, ? extends U> transformer,
5602	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5603	+	super(m);
5604	+	this.transformer = transformer;
5605	+	this.reducer = reducer;
5606	+	}
5607	+	MapReduceKeysTask
5608	+	(BulkTask<K,V,?> p, int b, boolean split,
5609	+	Fun<? super K, ? extends U> transformer,
5610	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5611	+	super(p, b, split);
5612	+	this.transformer = transformer;
5613	+	this.reducer = reducer;
5614	+	}
5615	+	public final void compute() {
5616	+	MapReduceKeysTask<K,V,U> t = this;
5617	+	final Fun<? super K, ? extends U> transformer =
5618	+	this.transformer;
5619	+	final BiFun<? super U, ? super U, ? extends U> reducer =
5620	+	this.reducer;
5621	+	if (transformer == null || reducer == null)
5622	+	throw new Error(NullFunctionMessage);
5623	+	int b = batch();
5624	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5625	+	b >>>= 1;
5626	+	t.pending = 1;
5627	+	MapReduceKeysTask<K,V,U> rt =
5628	+	new MapReduceKeysTask<K,V,U>
5629	+	(t, b, true, transformer, reducer);
5630	+	t = new MapReduceKeysTask<K,V,U>
5631	+	(t, b, false, transformer, reducer);
5632	+	t.sibling = rt;
5633	+	rt.sibling = t;
5634	+	rt.fork();
5635	+	}
5636	+	U r = null, u;
5637	+	while (t.advance() != null) {
5638	+	if ((u = transformer.apply((K)t.nextKey)) != null)
5639	+	r = (r == null) ? u : reducer.apply(r, u);
5640	+	}
5641	+	t.result = r;
5642	+	for (;;) {
5643	+	int c; BulkTask<K,V,?> par; MapReduceKeysTask<K,V,U> s, p;
5644	+	if ((par = t.parent) == null ||
5645	+	!(par instanceof MapReduceKeysTask)) {
5646	+	t.quietlyComplete();
5647	+	break;
5648	+	}
5649	+	else if ((c = (p = (MapReduceKeysTask<K,V,U>)par).pending) == 0) {
5650	+	if ((s = t.sibling) != null && (u = s.result) != null)
5651	+	r = (r == null) ? u : reducer.apply(r, u);
5652	+	(t = p).result = r;
5653	+	}
5654	+	else if (p.casPending(c, 0))
5655	+	break;
5656	+	}
5657	+	}
5658	+	public final U getRawResult() { return result; }
5659	+	}
5660	+
5661	+	static final class MapReduceValuesTask<K,V,U>
5662	+	extends BulkTask<K,V,U> {
5663	+	final Fun<? super V, ? extends U> transformer;
5664	+	final BiFun<? super U, ? super U, ? extends U> reducer;
5665	+	U result;
5666	+	MapReduceValuesTask<K,V,U> sibling;
5667	+	MapReduceValuesTask
5668	+	(ConcurrentHashMapV8<K,V> m,
5669	+	Fun<? super V, ? extends U> transformer,
5670	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5671	+	super(m);
5672	+	this.transformer = transformer;
5673	+	this.reducer = reducer;
5674	+	}
5675	+	MapReduceValuesTask
5676	+	(BulkTask<K,V,?> p, int b, boolean split,
5677	+	Fun<? super V, ? extends U> transformer,
5678	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5679	+	super(p, b, split);
5680	+	this.transformer = transformer;
5681	+	this.reducer = reducer;
5682	+	}
5683	+	public final void compute() {
5684	+	MapReduceValuesTask<K,V,U> t = this;
5685	+	final Fun<? super V, ? extends U> transformer =
5686	+	this.transformer;
5687	+	final BiFun<? super U, ? super U, ? extends U> reducer =
5688	+	this.reducer;
5689	+	if (transformer == null || reducer == null)
5690	+	throw new Error(NullFunctionMessage);
5691	+	int b = batch();
5692	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5693	+	b >>>= 1;
5694	+	t.pending = 1;
5695	+	MapReduceValuesTask<K,V,U> rt =
5696	+	new MapReduceValuesTask<K,V,U>
5697	+	(t, b, true, transformer, reducer);
5698	+	t = new MapReduceValuesTask<K,V,U>
5699	+	(t, b, false, transformer, reducer);
5700	+	t.sibling = rt;
5701	+	rt.sibling = t;
5702	+	rt.fork();
5703	+	}
5704	+	U r = null, u;
5705	+	Object v;
5706	+	while ((v = t.advance()) != null) {
5707	+	if ((u = transformer.apply((V)v)) != null)
5708	+	r = (r == null) ? u : reducer.apply(r, u);
5709	+	}
5710	+	t.result = r;
5711	+	for (;;) {
5712	+	int c; BulkTask<K,V,?> par; MapReduceValuesTask<K,V,U> s, p;
5713	+	if ((par = t.parent) == null ||
5714	+	!(par instanceof MapReduceValuesTask)) {
5715	+	t.quietlyComplete();
5716	+	break;
5717	+	}
5718	+	else if ((c = (p = (MapReduceValuesTask<K,V,U>)par).pending) == 0) {
5719	+	if ((s = t.sibling) != null && (u = s.result) != null)
5720	+	r = (r == null) ? u : reducer.apply(r, u);
5721	+	(t = p).result = r;
5722	+	}
5723	+	else if (p.casPending(c, 0))
5724	+	break;
5725	+	}
5726	+	}
5727	+	public final U getRawResult() { return result; }
5728	+	}
5729	+
5730	+	static final class MapReduceEntriesTask<K,V,U>
5731	+	extends BulkTask<K,V,U> {
5732	+	final Fun<Map.Entry<K,V>, ? extends U> transformer;
5733	+	final BiFun<? super U, ? super U, ? extends U> reducer;
5734	+	U result;
5735	+	MapReduceEntriesTask<K,V,U> sibling;
5736	+	MapReduceEntriesTask
5737	+	(ConcurrentHashMapV8<K,V> m,
5738	+	Fun<Map.Entry<K,V>, ? extends U> transformer,
5739	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5740	+	super(m);
5741	+	this.transformer = transformer;
5742	+	this.reducer = reducer;
5743	+	}
5744	+	MapReduceEntriesTask
5745	+	(BulkTask<K,V,?> p, int b, boolean split,
5746	+	Fun<Map.Entry<K,V>, ? extends U> transformer,
5747	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5748	+	super(p, b, split);
5749	+	this.transformer = transformer;
5750	+	this.reducer = reducer;
5751	+	}
5752	+	public final void compute() {
5753	+	MapReduceEntriesTask<K,V,U> t = this;
5754	+	final Fun<Map.Entry<K,V>, ? extends U> transformer =
5755	+	this.transformer;
5756	+	final BiFun<? super U, ? super U, ? extends U> reducer =
5757	+	this.reducer;
5758	+	if (transformer == null || reducer == null)
5759	+	throw new Error(NullFunctionMessage);
5760	+	int b = batch();
5761	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5762	+	b >>>= 1;
5763	+	t.pending = 1;
5764	+	MapReduceEntriesTask<K,V,U> rt =
5765	+	new MapReduceEntriesTask<K,V,U>
5766	+	(t, b, true, transformer, reducer);
5767	+	t = new MapReduceEntriesTask<K,V,U>
5768	+	(t, b, false, transformer, reducer);
5769	+	t.sibling = rt;
5770	+	rt.sibling = t;
5771	+	rt.fork();
5772	+	}
5773	+	U r = null, u;
5774	+	Object v;
5775	+	while ((v = t.advance()) != null) {
5776	+	if ((u = transformer.apply(entryFor((K)t.nextKey, (V)v))) != null)
5777	+	r = (r == null) ? u : reducer.apply(r, u);
5778	+	}
5779	+	t.result = r;
5780	+	for (;;) {
5781	+	int c; BulkTask<K,V,?> par; MapReduceEntriesTask<K,V,U> s, p;
5782	+	if ((par = t.parent) == null ||
5783	+	!(par instanceof MapReduceEntriesTask)) {
5784	+	t.quietlyComplete();
5785	+	break;
5786	+	}
5787	+	else if ((c = (p = (MapReduceEntriesTask<K,V,U>)par).pending) == 0) {
5788	+	if ((s = t.sibling) != null && (u = s.result) != null)
5789	+	r = (r == null) ? u : reducer.apply(r, u);
5790	+	(t = p).result = r;
5791	+	}
5792	+	else if (p.casPending(c, 0))
5793	+	break;
5794	+	}
5795	+	}
5796	+	public final U getRawResult() { return result; }
5797	+	}
5798	+
5799	+	static final class MapReduceMappingsTask<K,V,U>
5800	+	extends BulkTask<K,V,U> {
5801	+	final BiFun<? super K, ? super V, ? extends U> transformer;
5802	+	final BiFun<? super U, ? super U, ? extends U> reducer;
5803	+	U result;
5804	+	MapReduceMappingsTask<K,V,U> sibling;
5805	+	MapReduceMappingsTask
5806	+	(ConcurrentHashMapV8<K,V> m,
5807	+	BiFun<? super K, ? super V, ? extends U> transformer,
5808	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5809	+	super(m);
5810	+	this.transformer = transformer;
5811	+	this.reducer = reducer;
5812	+	}
5813	+	MapReduceMappingsTask
5814	+	(BulkTask<K,V,?> p, int b, boolean split,
5815	+	BiFun<? super K, ? super V, ? extends U> transformer,
5816	+	BiFun<? super U, ? super U, ? extends U> reducer) {
5817	+	super(p, b, split);
5818	+	this.transformer = transformer;
5819	+	this.reducer = reducer;
5820	+	}
5821	+	public final void compute() {
5822	+	MapReduceMappingsTask<K,V,U> t = this;
5823	+	final BiFun<? super K, ? super V, ? extends U> transformer =
5824	+	this.transformer;
5825	+	final BiFun<? super U, ? super U, ? extends U> reducer =
5826	+	this.reducer;
5827	+	if (transformer == null || reducer == null)
5828	+	throw new Error(NullFunctionMessage);
5829	+	int b = batch();
5830	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5831	+	b >>>= 1;
5832	+	t.pending = 1;
5833	+	MapReduceMappingsTask<K,V,U> rt =
5834	+	new MapReduceMappingsTask<K,V,U>
5835	+	(t, b, true, transformer, reducer);
5836	+	t = new MapReduceMappingsTask<K,V,U>
5837	+	(t, b, false, transformer, reducer);
5838	+	t.sibling = rt;
5839	+	rt.sibling = t;
5840	+	rt.fork();
5841	+	}
5842	+	U r = null, u;
5843	+	Object v;
5844	+	while ((v = t.advance()) != null) {
5845	+	if ((u = transformer.apply((K)t.nextKey, (V)v)) != null)
5846	+	r = (r == null) ? u : reducer.apply(r, u);
5847	+	}
5848	+	for (;;) {
5849	+	int c; BulkTask<K,V,?> par; MapReduceMappingsTask<K,V,U> s, p;
5850	+	if ((par = t.parent) == null ||
5851	+	!(par instanceof MapReduceMappingsTask)) {
5852	+	t.quietlyComplete();
5853	+	break;
5854	+	}
5855	+	else if ((c = (p = (MapReduceMappingsTask<K,V,U>)par).pending) == 0) {
5856	+	if ((s = t.sibling) != null && (u = s.result) != null)
5857	+	r = (r == null) ? u : reducer.apply(r, u);
5858	+	(t = p).result = r;
5859	+	}
5860	+	else if (p.casPending(c, 0))
5861	+	break;
5862	+	}
5863	+	}
5864	+	public final U getRawResult() { return result; }
5865	+	}
5866	+
5867	+	static final class MapReduceKeysToDoubleTask<K,V>
5868	+	extends BulkTask<K,V,Double> {
5869	+	final ObjectToDouble<? super K> transformer;
5870	+	final DoubleByDoubleToDouble reducer;
5871	+	final double basis;
5872	+	double result;
5873	+	MapReduceKeysToDoubleTask<K,V> sibling;
5874	+	MapReduceKeysToDoubleTask
5875	+	(ConcurrentHashMapV8<K,V> m,
5876	+	ObjectToDouble<? super K> transformer,
5877	+	double basis,
5878	+	DoubleByDoubleToDouble reducer) {
5879	+	super(m);
5880	+	this.transformer = transformer;
5881	+	this.basis = basis; this.reducer = reducer;
5882	+	}
5883	+	MapReduceKeysToDoubleTask
5884	+	(BulkTask<K,V,?> p, int b, boolean split,
5885	+	ObjectToDouble<? super K> transformer,
5886	+	double basis,
5887	+	DoubleByDoubleToDouble reducer) {
5888	+	super(p, b, split);
5889	+	this.transformer = transformer;
5890	+	this.basis = basis; this.reducer = reducer;
5891	+	}
5892	+	public final void compute() {
5893	+	MapReduceKeysToDoubleTask<K,V> t = this;
5894	+	final ObjectToDouble<? super K> transformer =
5895	+	this.transformer;
5896	+	final DoubleByDoubleToDouble reducer = this.reducer;
5897	+	if (transformer == null || reducer == null)
5898	+	throw new Error(NullFunctionMessage);
5899	+	final double id = this.basis;
5900	+	int b = batch();
5901	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5902	+	b >>>= 1;
5903	+	t.pending = 1;
5904	+	MapReduceKeysToDoubleTask<K,V> rt =
5905	+	new MapReduceKeysToDoubleTask<K,V>
5906	+	(t, b, true, transformer, id, reducer);
5907	+	t = new MapReduceKeysToDoubleTask<K,V>
5908	+	(t, b, false, transformer, id, reducer);
5909	+	t.sibling = rt;
5910	+	rt.sibling = t;
5911	+	rt.fork();
5912	+	}
5913	+	double r = id;
5914	+	while (t.advance() != null)
5915	+	r = reducer.apply(r, transformer.apply((K)t.nextKey));
5916	+	t.result = r;
5917	+	for (;;) {
5918	+	int c; BulkTask<K,V,?> par; MapReduceKeysToDoubleTask<K,V> s, p;
5919	+	if ((par = t.parent) == null ||
5920	+	!(par instanceof MapReduceKeysToDoubleTask)) {
5921	+	t.quietlyComplete();
5922	+	break;
5923	+	}
5924	+	else if ((c = (p = (MapReduceKeysToDoubleTask<K,V>)par).pending) == 0) {
5925	+	if ((s = t.sibling) != null)
5926	+	r = reducer.apply(r, s.result);
5927	+	(t = p).result = r;
5928	+	}
5929	+	else if (p.casPending(c, 0))
5930	+	break;
5931	+	}
5932	+	}
5933	+	public final Double getRawResult() { return result; }
5934	+	}
5935	+
5936	+	static final class MapReduceValuesToDoubleTask<K,V>
5937	+	extends BulkTask<K,V,Double> {
5938	+	final ObjectToDouble<? super V> transformer;
5939	+	final DoubleByDoubleToDouble reducer;
5940	+	final double basis;
5941	+	double result;
5942	+	MapReduceValuesToDoubleTask<K,V> sibling;
5943	+	MapReduceValuesToDoubleTask
5944	+	(ConcurrentHashMapV8<K,V> m,
5945	+	ObjectToDouble<? super V> transformer,
5946	+	double basis,
5947	+	DoubleByDoubleToDouble reducer) {
5948	+	super(m);
5949	+	this.transformer = transformer;
5950	+	this.basis = basis; this.reducer = reducer;
5951	+	}
5952	+	MapReduceValuesToDoubleTask
5953	+	(BulkTask<K,V,?> p, int b, boolean split,
5954	+	ObjectToDouble<? super V> transformer,
5955	+	double basis,
5956	+	DoubleByDoubleToDouble reducer) {
5957	+	super(p, b, split);
5958	+	this.transformer = transformer;
5959	+	this.basis = basis; this.reducer = reducer;
5960	+	}
5961	+	public final void compute() {
5962	+	MapReduceValuesToDoubleTask<K,V> t = this;
5963	+	final ObjectToDouble<? super V> transformer =
5964	+	this.transformer;
5965	+	final DoubleByDoubleToDouble reducer = this.reducer;
5966	+	if (transformer == null || reducer == null)
5967	+	throw new Error(NullFunctionMessage);
5968	+	final double id = this.basis;
5969	+	int b = batch();
5970	+	while (b > 1 && t.baseIndex != t.baseLimit) {
5971	+	b >>>= 1;
5972	+	t.pending = 1;
5973	+	MapReduceValuesToDoubleTask<K,V> rt =
5974	+	new MapReduceValuesToDoubleTask<K,V>
5975	+	(t, b, true, transformer, id, reducer);
5976	+	t = new MapReduceValuesToDoubleTask<K,V>
5977	+	(t, b, false, transformer, id, reducer);
5978	+	t.sibling = rt;
5979	+	rt.sibling = t;
5980	+	rt.fork();
5981	+	}
5982	+	double r = id;
5983	+	Object v;
5984	+	while ((v = t.advance()) != null)
5985	+	r = reducer.apply(r, transformer.apply((V)v));
5986	+	t.result = r;
5987	+	for (;;) {
5988	+	int c; BulkTask<K,V,?> par; MapReduceValuesToDoubleTask<K,V> s, p;
5989	+	if ((par = t.parent) == null ||
5990	+	!(par instanceof MapReduceValuesToDoubleTask)) {
5991	+	t.quietlyComplete();
5992	+	break;
5993	+	}
5994	+	else if ((c = (p = (MapReduceValuesToDoubleTask<K,V>)par).pending) == 0) {
5995	+	if ((s = t.sibling) != null)
5996	+	r = reducer.apply(r, s.result);
5997	+	(t = p).result = r;
5998	+	}
5999	+	else if (p.casPending(c, 0))
6000	+	break;
6001	+	}
6002	+	}
6003	+	public final Double getRawResult() { return result; }
6004	+	}
6005	+
6006	+	static final class MapReduceEntriesToDoubleTask<K,V>
6007	+	extends BulkTask<K,V,Double> {
6008	+	final ObjectToDouble<Map.Entry<K,V>> transformer;
6009	+	final DoubleByDoubleToDouble reducer;
6010	+	final double basis;
6011	+	double result;
6012	+	MapReduceEntriesToDoubleTask<K,V> sibling;
6013	+	MapReduceEntriesToDoubleTask
6014	+	(ConcurrentHashMapV8<K,V> m,
6015	+	ObjectToDouble<Map.Entry<K,V>> transformer,
6016	+	double basis,
6017	+	DoubleByDoubleToDouble reducer) {
6018	+	super(m);
6019	+	this.transformer = transformer;
6020	+	this.basis = basis; this.reducer = reducer;
6021	+	}
6022	+	MapReduceEntriesToDoubleTask
6023	+	(BulkTask<K,V,?> p, int b, boolean split,
6024	+	ObjectToDouble<Map.Entry<K,V>> transformer,
6025	+	double basis,
6026	+	DoubleByDoubleToDouble reducer) {
6027	+	super(p, b, split);
6028	+	this.transformer = transformer;
6029	+	this.basis = basis; this.reducer = reducer;
6030	+	}
6031	+	public final void compute() {
6032	+	MapReduceEntriesToDoubleTask<K,V> t = this;
6033	+	final ObjectToDouble<Map.Entry<K,V>> transformer =
6034	+	this.transformer;
6035	+	final DoubleByDoubleToDouble reducer = this.reducer;
6036	+	if (transformer == null || reducer == null)
6037	+	throw new Error(NullFunctionMessage);
6038	+	final double id = this.basis;
6039	+	int b = batch();
6040	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6041	+	b >>>= 1;
6042	+	t.pending = 1;
6043	+	MapReduceEntriesToDoubleTask<K,V> rt =
6044	+	new MapReduceEntriesToDoubleTask<K,V>
6045	+	(t, b, true, transformer, id, reducer);
6046	+	t = new MapReduceEntriesToDoubleTask<K,V>
6047	+	(t, b, false, transformer, id, reducer);
6048	+	t.sibling = rt;
6049	+	rt.sibling = t;
6050	+	rt.fork();
6051	+	}
6052	+	double r = id;
6053	+	Object v;
6054	+	while ((v = t.advance()) != null)
6055	+	r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v)));
6056	+	t.result = r;
6057	+	for (;;) {
6058	+	int c; BulkTask<K,V,?> par; MapReduceEntriesToDoubleTask<K,V> s, p;
6059	+	if ((par = t.parent) == null ||
6060	+	!(par instanceof MapReduceEntriesToDoubleTask)) {
6061	+	t.quietlyComplete();
6062	+	break;
6063	+	}
6064	+	else if ((c = (p = (MapReduceEntriesToDoubleTask<K,V>)par).pending) == 0) {
6065	+	if ((s = t.sibling) != null)
6066	+	r = reducer.apply(r, s.result);
6067	+	(t = p).result = r;
6068	+	}
6069	+	else if (p.casPending(c, 0))
6070	+	break;
6071	+	}
6072	+	}
6073	+	public final Double getRawResult() { return result; }
6074	+	}
6075	+
6076	+	static final class MapReduceMappingsToDoubleTask<K,V>
6077	+	extends BulkTask<K,V,Double> {
6078	+	final ObjectByObjectToDouble<? super K, ? super V> transformer;
6079	+	final DoubleByDoubleToDouble reducer;
6080	+	final double basis;
6081	+	double result;
6082	+	MapReduceMappingsToDoubleTask<K,V> sibling;
6083	+	MapReduceMappingsToDoubleTask
6084	+	(ConcurrentHashMapV8<K,V> m,
6085	+	ObjectByObjectToDouble<? super K, ? super V> transformer,
6086	+	double basis,
6087	+	DoubleByDoubleToDouble reducer) {
6088	+	super(m);
6089	+	this.transformer = transformer;
6090	+	this.basis = basis; this.reducer = reducer;
6091	+	}
6092	+	MapReduceMappingsToDoubleTask
6093	+	(BulkTask<K,V,?> p, int b, boolean split,
6094	+	ObjectByObjectToDouble<? super K, ? super V> transformer,
6095	+	double basis,
6096	+	DoubleByDoubleToDouble reducer) {
6097	+	super(p, b, split);
6098	+	this.transformer = transformer;
6099	+	this.basis = basis; this.reducer = reducer;
6100	+	}
6101	+	public final void compute() {
6102	+	MapReduceMappingsToDoubleTask<K,V> t = this;
6103	+	final ObjectByObjectToDouble<? super K, ? super V> transformer =
6104	+	this.transformer;
6105	+	final DoubleByDoubleToDouble reducer = this.reducer;
6106	+	if (transformer == null || reducer == null)
6107	+	throw new Error(NullFunctionMessage);
6108	+	final double id = this.basis;
6109	+	int b = batch();
6110	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6111	+	b >>>= 1;
6112	+	t.pending = 1;
6113	+	MapReduceMappingsToDoubleTask<K,V> rt =
6114	+	new MapReduceMappingsToDoubleTask<K,V>
6115	+	(t, b, true, transformer, id, reducer);
6116	+	t = new MapReduceMappingsToDoubleTask<K,V>
6117	+	(t, b, false, transformer, id, reducer);
6118	+	t.sibling = rt;
6119	+	rt.sibling = t;
6120	+	rt.fork();
6121	+	}
6122	+	double r = id;
6123	+	Object v;
6124	+	while ((v = t.advance()) != null)
6125	+	r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v));
6126	+	t.result = r;
6127	+	for (;;) {
6128	+	int c; BulkTask<K,V,?> par; MapReduceMappingsToDoubleTask<K,V> s, p;
6129	+	if ((par = t.parent) == null ||
6130	+	!(par instanceof MapReduceMappingsToDoubleTask)) {
6131	+	t.quietlyComplete();
6132	+	break;
6133	+	}
6134	+	else if ((c = (p = (MapReduceMappingsToDoubleTask<K,V>)par).pending) == 0) {
6135	+	if ((s = t.sibling) != null)
6136	+	r = reducer.apply(r, s.result);
6137	+	(t = p).result = r;
6138	+	}
6139	+	else if (p.casPending(c, 0))
6140	+	break;
6141	+	}
6142	+	}
6143	+	public final Double getRawResult() { return result; }
6144	+	}
6145	+
6146	+	static final class MapReduceKeysToLongTask<K,V>
6147	+	extends BulkTask<K,V,Long> {
6148	+	final ObjectToLong<? super K> transformer;
6149	+	final LongByLongToLong reducer;
6150	+	final long basis;
6151	+	long result;
6152	+	MapReduceKeysToLongTask<K,V> sibling;
6153	+	MapReduceKeysToLongTask
6154	+	(ConcurrentHashMapV8<K,V> m,
6155	+	ObjectToLong<? super K> transformer,
6156	+	long basis,
6157	+	LongByLongToLong reducer) {
6158	+	super(m);
6159	+	this.transformer = transformer;
6160	+	this.basis = basis; this.reducer = reducer;
6161	+	}
6162	+	MapReduceKeysToLongTask
6163	+	(BulkTask<K,V,?> p, int b, boolean split,
6164	+	ObjectToLong<? super K> transformer,
6165	+	long basis,
6166	+	LongByLongToLong reducer) {
6167	+	super(p, b, split);
6168	+	this.transformer = transformer;
6169	+	this.basis = basis; this.reducer = reducer;
6170	+	}
6171	+	public final void compute() {
6172	+	MapReduceKeysToLongTask<K,V> t = this;
6173	+	final ObjectToLong<? super K> transformer =
6174	+	this.transformer;
6175	+	final LongByLongToLong reducer = this.reducer;
6176	+	if (transformer == null || reducer == null)
6177	+	throw new Error(NullFunctionMessage);
6178	+	final long id = this.basis;
6179	+	int b = batch();
6180	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6181	+	b >>>= 1;
6182	+	t.pending = 1;
6183	+	MapReduceKeysToLongTask<K,V> rt =
6184	+	new MapReduceKeysToLongTask<K,V>
6185	+	(t, b, true, transformer, id, reducer);
6186	+	t = new MapReduceKeysToLongTask<K,V>
6187	+	(t, b, false, transformer, id, reducer);
6188	+	t.sibling = rt;
6189	+	rt.sibling = t;
6190	+	rt.fork();
6191	+	}
6192	+	long r = id;
6193	+	while (t.advance() != null)
6194	+	r = reducer.apply(r, transformer.apply((K)t.nextKey));
6195	+	t.result = r;
6196	+	for (;;) {
6197	+	int c; BulkTask<K,V,?> par; MapReduceKeysToLongTask<K,V> s, p;
6198	+	if ((par = t.parent) == null ||
6199	+	!(par instanceof MapReduceKeysToLongTask)) {
6200	+	t.quietlyComplete();
6201	+	break;
6202	+	}
6203	+	else if ((c = (p = (MapReduceKeysToLongTask<K,V>)par).pending) == 0) {
6204	+	if ((s = t.sibling) != null)
6205	+	r = reducer.apply(r, s.result);
6206	+	(t = p).result = r;
6207	+	}
6208	+	else if (p.casPending(c, 0))
6209	+	break;
6210	+	}
6211	+	}
6212	+	public final Long getRawResult() { return result; }
6213	+	}
6214	+
6215	+	static final class MapReduceValuesToLongTask<K,V>
6216	+	extends BulkTask<K,V,Long> {
6217	+	final ObjectToLong<? super V> transformer;
6218	+	final LongByLongToLong reducer;
6219	+	final long basis;
6220	+	long result;
6221	+	MapReduceValuesToLongTask<K,V> sibling;
6222	+	MapReduceValuesToLongTask
6223	+	(ConcurrentHashMapV8<K,V> m,
6224	+	ObjectToLong<? super V> transformer,
6225	+	long basis,
6226	+	LongByLongToLong reducer) {
6227	+	super(m);
6228	+	this.transformer = transformer;
6229	+	this.basis = basis; this.reducer = reducer;
6230	+	}
6231	+	MapReduceValuesToLongTask
6232	+	(BulkTask<K,V,?> p, int b, boolean split,
6233	+	ObjectToLong<? super V> transformer,
6234	+	long basis,
6235	+	LongByLongToLong reducer) {
6236	+	super(p, b, split);
6237	+	this.transformer = transformer;
6238	+	this.basis = basis; this.reducer = reducer;
6239	+	}
6240	+	public final void compute() {
6241	+	MapReduceValuesToLongTask<K,V> t = this;
6242	+	final ObjectToLong<? super V> transformer =
6243	+	this.transformer;
6244	+	final LongByLongToLong reducer = this.reducer;
6245	+	if (transformer == null || reducer == null)
6246	+	throw new Error(NullFunctionMessage);
6247	+	final long id = this.basis;
6248	+	int b = batch();
6249	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6250	+	b >>>= 1;
6251	+	t.pending = 1;
6252	+	MapReduceValuesToLongTask<K,V> rt =
6253	+	new MapReduceValuesToLongTask<K,V>
6254	+	(t, b, true, transformer, id, reducer);
6255	+	t = new MapReduceValuesToLongTask<K,V>
6256	+	(t, b, false, transformer, id, reducer);
6257	+	t.sibling = rt;
6258	+	rt.sibling = t;
6259	+	rt.fork();
6260	+	}
6261	+	long r = id;
6262	+	Object v;
6263	+	while ((v = t.advance()) != null)
6264	+	r = reducer.apply(r, transformer.apply((V)v));
6265	+	t.result = r;
6266	+	for (;;) {
6267	+	int c; BulkTask<K,V,?> par; MapReduceValuesToLongTask<K,V> s, p;
6268	+	if ((par = t.parent) == null ||
6269	+	!(par instanceof MapReduceValuesToLongTask)) {
6270	+	t.quietlyComplete();
6271	+	break;
6272	+	}
6273	+	else if ((c = (p = (MapReduceValuesToLongTask<K,V>)par).pending) == 0) {
6274	+	if ((s = t.sibling) != null)
6275	+	r = reducer.apply(r, s.result);
6276	+	(t = p).result = r;
6277	+	}
6278	+	else if (p.casPending(c, 0))
6279	+	break;
6280	+	}
6281	+	}
6282	+	public final Long getRawResult() { return result; }
6283	+	}
6284	+
6285	+	static final class MapReduceEntriesToLongTask<K,V>
6286	+	extends BulkTask<K,V,Long> {
6287	+	final ObjectToLong<Map.Entry<K,V>> transformer;
6288	+	final LongByLongToLong reducer;
6289	+	final long basis;
6290	+	long result;
6291	+	MapReduceEntriesToLongTask<K,V> sibling;
6292	+	MapReduceEntriesToLongTask
6293	+	(ConcurrentHashMapV8<K,V> m,
6294	+	ObjectToLong<Map.Entry<K,V>> transformer,
6295	+	long basis,
6296	+	LongByLongToLong reducer) {
6297	+	super(m);
6298	+	this.transformer = transformer;
6299	+	this.basis = basis; this.reducer = reducer;
6300	+	}
6301	+	MapReduceEntriesToLongTask
6302	+	(BulkTask<K,V,?> p, int b, boolean split,
6303	+	ObjectToLong<Map.Entry<K,V>> transformer,
6304	+	long basis,
6305	+	LongByLongToLong reducer) {
6306	+	super(p, b, split);
6307	+	this.transformer = transformer;
6308	+	this.basis = basis; this.reducer = reducer;
6309	+	}
6310	+	public final void compute() {
6311	+	MapReduceEntriesToLongTask<K,V> t = this;
6312	+	final ObjectToLong<Map.Entry<K,V>> transformer =
6313	+	this.transformer;
6314	+	final LongByLongToLong reducer = this.reducer;
6315	+	if (transformer == null || reducer == null)
6316	+	throw new Error(NullFunctionMessage);
6317	+	final long id = this.basis;
6318	+	int b = batch();
6319	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6320	+	b >>>= 1;
6321	+	t.pending = 1;
6322	+	MapReduceEntriesToLongTask<K,V> rt =
6323	+	new MapReduceEntriesToLongTask<K,V>
6324	+	(t, b, true, transformer, id, reducer);
6325	+	t = new MapReduceEntriesToLongTask<K,V>
6326	+	(t, b, false, transformer, id, reducer);
6327	+	t.sibling = rt;
6328	+	rt.sibling = t;
6329	+	rt.fork();
6330	+	}
6331	+	long r = id;
6332	+	Object v;
6333	+	while ((v = t.advance()) != null)
6334	+	r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v)));
6335	+	t.result = r;
6336	+	for (;;) {
6337	+	int c; BulkTask<K,V,?> par; MapReduceEntriesToLongTask<K,V> s, p;
6338	+	if ((par = t.parent) == null ||
6339	+	!(par instanceof MapReduceEntriesToLongTask)) {
6340	+	t.quietlyComplete();
6341	+	break;
6342	+	}
6343	+	else if ((c = (p = (MapReduceEntriesToLongTask<K,V>)par).pending) == 0) {
6344	+	if ((s = t.sibling) != null)
6345	+	r = reducer.apply(r, s.result);
6346	+	(t = p).result = r;
6347	+	}
6348	+	else if (p.casPending(c, 0))
6349	+	break;
6350	+	}
6351	+	}
6352	+	public final Long getRawResult() { return result; }
6353	+	}
6354	+
6355	+	static final class MapReduceMappingsToLongTask<K,V>
6356	+	extends BulkTask<K,V,Long> {
6357	+	final ObjectByObjectToLong<? super K, ? super V> transformer;
6358	+	final LongByLongToLong reducer;
6359	+	final long basis;
6360	+	long result;
6361	+	MapReduceMappingsToLongTask<K,V> sibling;
6362	+	MapReduceMappingsToLongTask
6363	+	(ConcurrentHashMapV8<K,V> m,
6364	+	ObjectByObjectToLong<? super K, ? super V> transformer,
6365	+	long basis,
6366	+	LongByLongToLong reducer) {
6367	+	super(m);
6368	+	this.transformer = transformer;
6369	+	this.basis = basis; this.reducer = reducer;
6370	+	}
6371	+	MapReduceMappingsToLongTask
6372	+	(BulkTask<K,V,?> p, int b, boolean split,
6373	+	ObjectByObjectToLong<? super K, ? super V> transformer,
6374	+	long basis,
6375	+	LongByLongToLong reducer) {
6376	+	super(p, b, split);
6377	+	this.transformer = transformer;
6378	+	this.basis = basis; this.reducer = reducer;
6379	+	}
6380	+	public final void compute() {
6381	+	MapReduceMappingsToLongTask<K,V> t = this;
6382	+	final ObjectByObjectToLong<? super K, ? super V> transformer =
6383	+	this.transformer;
6384	+	final LongByLongToLong reducer = this.reducer;
6385	+	if (transformer == null || reducer == null)
6386	+	throw new Error(NullFunctionMessage);
6387	+	final long id = this.basis;
6388	+	int b = batch();
6389	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6390	+	b >>>= 1;
6391	+	t.pending = 1;
6392	+	MapReduceMappingsToLongTask<K,V> rt =
6393	+	new MapReduceMappingsToLongTask<K,V>
6394	+	(t, b, true, transformer, id, reducer);
6395	+	t = new MapReduceMappingsToLongTask<K,V>
6396	+	(t, b, false, transformer, id, reducer);
6397	+	t.sibling = rt;
6398	+	rt.sibling = t;
6399	+	rt.fork();
6400	+	}
6401	+	long r = id;
6402	+	Object v;
6403	+	while ((v = t.advance()) != null)
6404	+	r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v));
6405	+	t.result = r;
6406	+	for (;;) {
6407	+	int c; BulkTask<K,V,?> par; MapReduceMappingsToLongTask<K,V> s, p;
6408	+	if ((par = t.parent) == null ||
6409	+	!(par instanceof MapReduceMappingsToLongTask)) {
6410	+	t.quietlyComplete();
6411	+	break;
6412	+	}
6413	+	else if ((c = (p = (MapReduceMappingsToLongTask<K,V>)par).pending) == 0) {
6414	+	if ((s = t.sibling) != null)
6415	+	r = reducer.apply(r, s.result);
6416	+	(t = p).result = r;
6417	+	}
6418	+	else if (p.casPending(c, 0))
6419	+	break;
6420	+	}
6421	+	}
6422	+	public final Long getRawResult() { return result; }
6423	+	}
6424	+
6425	+	static final class MapReduceKeysToIntTask<K,V>
6426	+	extends BulkTask<K,V,Integer> {
6427	+	final ObjectToInt<? super K> transformer;
6428	+	final IntByIntToInt reducer;
6429	+	final int basis;
6430	+	int result;
6431	+	MapReduceKeysToIntTask<K,V> sibling;
6432	+	MapReduceKeysToIntTask
6433	+	(ConcurrentHashMapV8<K,V> m,
6434	+	ObjectToInt<? super K> transformer,
6435	+	int basis,
6436	+	IntByIntToInt reducer) {
6437	+	super(m);
6438	+	this.transformer = transformer;
6439	+	this.basis = basis; this.reducer = reducer;
6440	+	}
6441	+	MapReduceKeysToIntTask
6442	+	(BulkTask<K,V,?> p, int b, boolean split,
6443	+	ObjectToInt<? super K> transformer,
6444	+	int basis,
6445	+	IntByIntToInt reducer) {
6446	+	super(p, b, split);
6447	+	this.transformer = transformer;
6448	+	this.basis = basis; this.reducer = reducer;
6449	+	}
6450	+	public final void compute() {
6451	+	MapReduceKeysToIntTask<K,V> t = this;
6452	+	final ObjectToInt<? super K> transformer =
6453	+	this.transformer;
6454	+	final IntByIntToInt reducer = this.reducer;
6455	+	if (transformer == null || reducer == null)
6456	+	throw new Error(NullFunctionMessage);
6457	+	final int id = this.basis;
6458	+	int b = batch();
6459	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6460	+	b >>>= 1;
6461	+	t.pending = 1;
6462	+	MapReduceKeysToIntTask<K,V> rt =
6463	+	new MapReduceKeysToIntTask<K,V>
6464	+	(t, b, true, transformer, id, reducer);
6465	+	t = new MapReduceKeysToIntTask<K,V>
6466	+	(t, b, false, transformer, id, reducer);
6467	+	t.sibling = rt;
6468	+	rt.sibling = t;
6469	+	rt.fork();
6470	+	}
6471	+	int r = id;
6472	+	while (t.advance() != null)
6473	+	r = reducer.apply(r, transformer.apply((K)t.nextKey));
6474	+	t.result = r;
6475	+	for (;;) {
6476	+	int c; BulkTask<K,V,?> par; MapReduceKeysToIntTask<K,V> s, p;
6477	+	if ((par = t.parent) == null ||
6478	+	!(par instanceof MapReduceKeysToIntTask)) {
6479	+	t.quietlyComplete();
6480	+	break;
6481	+	}
6482	+	else if ((c = (p = (MapReduceKeysToIntTask<K,V>)par).pending) == 0) {
6483	+	if ((s = t.sibling) != null)
6484	+	r = reducer.apply(r, s.result);
6485	+	(t = p).result = r;
6486	+	}
6487	+	else if (p.casPending(c, 0))
6488	+	break;
6489	+	}
6490	+	}
6491	+	public final Integer getRawResult() { return result; }
6492	+	}
6493	+
6494	+	static final class MapReduceValuesToIntTask<K,V>
6495	+	extends BulkTask<K,V,Integer> {
6496	+	final ObjectToInt<? super V> transformer;
6497	+	final IntByIntToInt reducer;
6498	+	final int basis;
6499	+	int result;
6500	+	MapReduceValuesToIntTask<K,V> sibling;
6501	+	MapReduceValuesToIntTask
6502	+	(ConcurrentHashMapV8<K,V> m,
6503	+	ObjectToInt<? super V> transformer,
6504	+	int basis,
6505	+	IntByIntToInt reducer) {
6506	+	super(m);
6507	+	this.transformer = transformer;
6508	+	this.basis = basis; this.reducer = reducer;
6509	+	}
6510	+	MapReduceValuesToIntTask
6511	+	(BulkTask<K,V,?> p, int b, boolean split,
6512	+	ObjectToInt<? super V> transformer,
6513	+	int basis,
6514	+	IntByIntToInt reducer) {
6515	+	super(p, b, split);
6516	+	this.transformer = transformer;
6517	+	this.basis = basis; this.reducer = reducer;
6518	+	}
6519	+	public final void compute() {
6520	+	MapReduceValuesToIntTask<K,V> t = this;
6521	+	final ObjectToInt<? super V> transformer =
6522	+	this.transformer;
6523	+	final IntByIntToInt reducer = this.reducer;
6524	+	if (transformer == null || reducer == null)
6525	+	throw new Error(NullFunctionMessage);
6526	+	final int id = this.basis;
6527	+	int b = batch();
6528	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6529	+	b >>>= 1;
6530	+	t.pending = 1;
6531	+	MapReduceValuesToIntTask<K,V> rt =
6532	+	new MapReduceValuesToIntTask<K,V>
6533	+	(t, b, true, transformer, id, reducer);
6534	+	t = new MapReduceValuesToIntTask<K,V>
6535	+	(t, b, false, transformer, id, reducer);
6536	+	t.sibling = rt;
6537	+	rt.sibling = t;
6538	+	rt.fork();
6539	+	}
6540	+	int r = id;
6541	+	Object v;
6542	+	while ((v = t.advance()) != null)
6543	+	r = reducer.apply(r, transformer.apply((V)v));
6544	+	t.result = r;
6545	+	for (;;) {
6546	+	int c; BulkTask<K,V,?> par; MapReduceValuesToIntTask<K,V> s, p;
6547	+	if ((par = t.parent) == null ||
6548	+	!(par instanceof MapReduceValuesToIntTask)) {
6549	+	t.quietlyComplete();
6550	+	break;
6551	+	}
6552	+	else if ((c = (p = (MapReduceValuesToIntTask<K,V>)par).pending) == 0) {
6553	+	if ((s = t.sibling) != null)
6554	+	r = reducer.apply(r, s.result);
6555	+	(t = p).result = r;
6556	+	}
6557	+	else if (p.casPending(c, 0))
6558	+	break;
6559	+	}
6560	+	}
6561	+	public final Integer getRawResult() { return result; }
6562	+	}
6563	+
6564	+	static final class MapReduceEntriesToIntTask<K,V>
6565	+	extends BulkTask<K,V,Integer> {
6566	+	final ObjectToInt<Map.Entry<K,V>> transformer;
6567	+	final IntByIntToInt reducer;
6568	+	final int basis;
6569	+	int result;
6570	+	MapReduceEntriesToIntTask<K,V> sibling;
6571	+	MapReduceEntriesToIntTask
6572	+	(ConcurrentHashMapV8<K,V> m,
6573	+	ObjectToInt<Map.Entry<K,V>> transformer,
6574	+	int basis,
6575	+	IntByIntToInt reducer) {
6576	+	super(m);
6577	+	this.transformer = transformer;
6578	+	this.basis = basis; this.reducer = reducer;
6579	+	}
6580	+	MapReduceEntriesToIntTask
6581	+	(BulkTask<K,V,?> p, int b, boolean split,
6582	+	ObjectToInt<Map.Entry<K,V>> transformer,
6583	+	int basis,
6584	+	IntByIntToInt reducer) {
6585	+	super(p, b, split);
6586	+	this.transformer = transformer;
6587	+	this.basis = basis; this.reducer = reducer;
6588	+	}
6589	+	public final void compute() {
6590	+	MapReduceEntriesToIntTask<K,V> t = this;
6591	+	final ObjectToInt<Map.Entry<K,V>> transformer =
6592	+	this.transformer;
6593	+	final IntByIntToInt reducer = this.reducer;
6594	+	if (transformer == null || reducer == null)
6595	+	throw new Error(NullFunctionMessage);
6596	+	final int id = this.basis;
6597	+	int b = batch();
6598	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6599	+	b >>>= 1;
6600	+	t.pending = 1;
6601	+	MapReduceEntriesToIntTask<K,V> rt =
6602	+	new MapReduceEntriesToIntTask<K,V>
6603	+	(t, b, true, transformer, id, reducer);
6604	+	t = new MapReduceEntriesToIntTask<K,V>
6605	+	(t, b, false, transformer, id, reducer);
6606	+	t.sibling = rt;
6607	+	rt.sibling = t;
6608	+	rt.fork();
6609	+	}
6610	+	int r = id;
6611	+	Object v;
6612	+	while ((v = t.advance()) != null)
6613	+	r = reducer.apply(r, transformer.apply(entryFor((K)t.nextKey, (V)v)));
6614	+	t.result = r;
6615	+	for (;;) {
6616	+	int c; BulkTask<K,V,?> par; MapReduceEntriesToIntTask<K,V> s, p;
6617	+	if ((par = t.parent) == null ||
6618	+	!(par instanceof MapReduceEntriesToIntTask)) {
6619	+	t.quietlyComplete();
6620	+	break;
6621	+	}
6622	+	else if ((c = (p = (MapReduceEntriesToIntTask<K,V>)par).pending) == 0) {
6623	+	if ((s = t.sibling) != null)
6624	+	r = reducer.apply(r, s.result);
6625	+	(t = p).result = r;
6626	+	}
6627	+	else if (p.casPending(c, 0))
6628	+	break;
6629	+	}
6630	+	}
6631	+	public final Integer getRawResult() { return result; }
6632	+	}
6633	+
6634	+	static final class MapReduceMappingsToIntTask<K,V>
6635	+	extends BulkTask<K,V,Integer> {
6636	+	final ObjectByObjectToInt<? super K, ? super V> transformer;
6637	+	final IntByIntToInt reducer;
6638	+	final int basis;
6639	+	int result;
6640	+	MapReduceMappingsToIntTask<K,V> sibling;
6641	+	MapReduceMappingsToIntTask
6642	+	(ConcurrentHashMapV8<K,V> m,
6643	+	ObjectByObjectToInt<? super K, ? super V> transformer,
6644	+	int basis,
6645	+	IntByIntToInt reducer) {
6646	+	super(m);
6647	+	this.transformer = transformer;
6648	+	this.basis = basis; this.reducer = reducer;
6649	+	}
6650	+	MapReduceMappingsToIntTask
6651	+	(BulkTask<K,V,?> p, int b, boolean split,
6652	+	ObjectByObjectToInt<? super K, ? super V> transformer,
6653	+	int basis,
6654	+	IntByIntToInt reducer) {
6655	+	super(p, b, split);
6656	+	this.transformer = transformer;
6657	+	this.basis = basis; this.reducer = reducer;
6658	+	}
6659	+	public final void compute() {
6660	+	MapReduceMappingsToIntTask<K,V> t = this;
6661	+	final ObjectByObjectToInt<? super K, ? super V> transformer =
6662	+	this.transformer;
6663	+	final IntByIntToInt reducer = this.reducer;
6664	+	if (transformer == null || reducer == null)
6665	+	throw new Error(NullFunctionMessage);
6666	+	final int id = this.basis;
6667	+	int b = batch();
6668	+	while (b > 1 && t.baseIndex != t.baseLimit) {
6669	+	b >>>= 1;
6670	+	t.pending = 1;
6671	+	MapReduceMappingsToIntTask<K,V> rt =
6672	+	new MapReduceMappingsToIntTask<K,V>
6673	+	(t, b, true, transformer, id, reducer);
6674	+	t = new MapReduceMappingsToIntTask<K,V>
6675	+	(t, b, false, transformer, id, reducer);
6676	+	t.sibling = rt;
6677	+	rt.sibling = t;
6678	+	rt.fork();
6679	+	}
6680	+	int r = id;
6681	+	Object v;
6682	+	while ((v = t.advance()) != null)
6683	+	r = reducer.apply(r, transformer.apply((K)t.nextKey, (V)v));
6684	+	t.result = r;
6685	+	for (;;) {
6686	+	int c; BulkTask<K,V,?> par; MapReduceMappingsToIntTask<K,V> s, p;
6687	+	if ((par = t.parent) == null ||
6688	+	!(par instanceof MapReduceMappingsToIntTask)) {
6689	+	t.quietlyComplete();
6690	+	break;
6691	+	}
6692	+	else if ((c = (p = (MapReduceMappingsToIntTask<K,V>)par).pending) == 0) {
6693	+	if ((s = t.sibling) != null)
6694	+	r = reducer.apply(r, s.result);
6695	+	(t = p).result = r;
6696	+	}
6697	+	else if (p.casPending(c, 0))
6698	+	break;
6699	+	}
6700	+	}
6701	+	public final Integer getRawResult() { return result; }
6702	+	}
6703	+
6704	+
6705		// Unsafe mechanics
6706		private static final sun.misc.Unsafe UNSAFE;
6707		private static final long counterOffset;
#	Line 3348 | Line 6756 | public class ConcurrentHashMapV8<K, V>
6756		}
6757		}
6758		}
3351	–
6759		}

Diff Legend

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