[ViewVC] Diff of: jsr166/jsr166/src/jsr166e/ConcurrentHashMapV8.java

Comparing jsr166/src/jsr166e/ConcurrentHashMapV8.java (file contents):
Revision 1.38 by dl, Wed Jun 6 15:41:23 2012 UTC vs.
Revision 1.84 by dl, Sat Dec 15 20:21:25 2012 UTC

+ * http://creativecommons.org/publicdomain/zero/1.0/
+ */
-–
+// Snapshot Tue Jun  5 14:56:09 2012  Doug Lea  (dl at altair)
-–
+package jsr166e;
-<
+import jsr166e.LongAdder;
->
->
+import java.util.Comparator;
+import java.util.Arrays;
+import java.util.Map;
+import java.util.Set;
+import java.util.ConcurrentModificationException;
+import java.util.NoSuchElementException;
+import java.util.concurrent.ConcurrentMap;
-–
+import java.util.concurrent.ThreadLocalRandom;
-–
+import java.util.concurrent.locks.LockSupport;
+import java.util.concurrent.locks.AbstractQueuedSynchronizer;
-+
+import java.util.concurrent.atomic.AtomicInteger;
-+
+import java.util.concurrent.atomic.AtomicReference;
+import java.io.Serializable;
+/**
+ * interoperable with {@code Hashtable} in programs that rely on its
+ * thread safety but not on its synchronization details.
-<
+ * <p> Retrieval operations (including {@code get}) generally do not
->
+ * <p>Retrieval operations (including {@code get}) generally do not
+ * block, so may overlap with update operations (including {@code put}
+ * and {@code remove}). Retrievals reflect the results of the most
+ * recently <em>completed</em> update operations holding upon their
-<
+ * onset.  For aggregate operations such as {@code putAll} and {@code
-<
+ * clear}, concurrent retrievals may reflect insertion or removal of
-<
+ * only some entries.  Similarly, Iterators and Enumerations return
-<
+ * elements reflecting the state of the hash table at some point at or
-<
+ * since the creation of the iterator/enumeration.  They do
-<
+ * <em>not</em> throw {@link ConcurrentModificationException}.
-<
+ * However, iterators are designed to be used by only one thread at a
-<
+ * time.  Bear in mind that the results of aggregate status methods
-<
+ * including {@code size}, {@code isEmpty}, and {@code containsValue}
-<
+ * are typically useful only when a map is not undergoing concurrent
-<
+ * updates in other threads.  Otherwise the results of these methods
-<
+ * reflect transient states that may be adequate for monitoring
-<
+ * or estimation purposes, but not for program control.
->
+ * onset. (More formally, an update operation for a given key bears a
->
+ * <em>happens-before</em> relation with any (non-null) retrieval for
->
+ * that key reporting the updated value.)  For aggregate operations
->
+ * such as {@code putAll} and {@code clear}, concurrent retrievals may
->
+ * reflect insertion or removal of only some entries.  Similarly,
->
+ * Iterators and Enumerations return elements reflecting the state of
->
+ * the hash table at some point at or since the creation of the
->
+ * iterator/enumeration.  They do <em>not</em> throw {@link
->
+ * ConcurrentModificationException}.  However, iterators are designed
->
+ * to be used by only one thread at a time.  Bear in mind that the
->
+ * results of aggregate status methods including {@code size}, {@code
->
+ * isEmpty}, and {@code containsValue} are typically useful only when
->
+ * a map is not undergoing concurrent updates in other threads.
->
+ * Otherwise the results of these methods reflect transient states
->
+ * that may be adequate for monitoring or estimation purposes, but not
->
+ * for program control.
-<
+ * <p> The table is dynamically expanded when there are too many
->
+ * <p>The table is dynamically expanded when there are too many
+ * collisions (i.e., keys that have distinct hash codes but fall into
+ * the same slot modulo the table size), with the expected average
+ * effect of maintaining roughly two bins per mapping (corresponding
+ * {@code hashCode()} is a sure way to slow down performance of any
+ * hash table.
-+
+ * <p>A {@link Set} projection of a ConcurrentHashMapV8 may be created
-+
+ * (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
-+
+ * (using {@link #keySet(Object)} when only keys are of interest, and the
-+
+ * mapped values are (perhaps transiently) not used or all take the
-+
+ * same mapping value.
-+
+ *
-+
+ * <p>A ConcurrentHashMapV8 can be used as scalable frequency map (a
-+
+ * form of histogram or multiset) by using {@link LongAdder} values
-+
+ * and initializing via {@link #computeIfAbsent}. For example, to add
-+
+ * a count to a {@code ConcurrentHashMapV8<String,LongAdder> freqs}, you
-+
+ * can use {@code freqs.computeIfAbsent(k -> new
-+
+ * LongAdder()).increment();}
-+
+ *
+ * <p>This class and its views and iterators implement all of the
+ * <em>optional</em> methods of the {@link Map} and {@link Iterator}
+ * interfaces.
-<
+ * <p> Like {@link Hashtable} but unlike {@link HashMap}, this class
->
+ * <p>Like {@link Hashtable} but unlike {@link HashMap}, this class
+ * does <em>not</em> allow {@code null} to be used as a key or value.
-+
+ * <p>ConcurrentHashMapV8s support sequential and parallel operations
-+
+ * bulk operations. (Parallel forms use the {@link
-+
+ * ForkJoinPool#commonPool()}). Tasks that may be used in other
-+
+ * contexts are available in class {@link ForkJoinTasks}. These
-+
+ * operations are designed to be safely, and often sensibly, applied
-+
+ * even with maps that are being concurrently updated by other
-+
+ * threads; for example, when computing a snapshot summary of the
-+
+ * values in a shared registry.  There are three kinds of operation,
-+
+ * each with four forms, accepting functions with Keys, Values,
-+
+ * Entries, and (Key, Value) arguments and/or return values. Because
-+
+ * the elements of a ConcurrentHashMapV8 are not ordered in any
-+
+ * particular way, and may be processed in different orders in
-+
+ * different parallel executions, the correctness of supplied
-+
+ * functions should not depend on any ordering, or on any other
-+
+ * objects or values that may transiently change while computation is
-+
+ * in progress; and except for forEach actions, should ideally be
-+
+ * side-effect-free.
-+
+ *
-+
+ * <ul>
-+
+ * <li> forEach: Perform a given action on each element.
-+
+ * A variant form applies a given transformation on each element
-+
+ * before performing the action.</li>
-+
+ *
-+
+ * <li> search: Return the first available non-null result of
-+
+ * applying a given function on each element; skipping further
-+
+ * search when a result is found.</li>
-+
+ *
-+
+ * <li> reduce: Accumulate each element.  The supplied reduction
-+
+ * function cannot rely on ordering (more formally, it should be
-+
+ * both associative and commutative).  There are five variants:
-+
+ *
-+
+ * <ul>
-+
+ *
-+
+ * <li> Plain reductions. (There is not a form of this method for
-+
+ * (key, value) function arguments since there is no corresponding
-+
+ * return type.)</li>
-+
+ *
-+
+ * <li> Mapped reductions that accumulate the results of a given
-+
+ * function applied to each element.</li>
-+
+ *
-+
+ * <li> Reductions to scalar doubles, longs, and ints, using a
-+
+ * given basis value.</li>
-+
+ *
-+
+ * </li>
-+
+ * </ul>
-+
+ * </ul>
-+
+ *
-+
+ * <p>The concurrency properties of bulk operations follow
-+
+ * from those of ConcurrentHashMapV8: Any non-null result returned
-+
+ * from {@code get(key)} and related access methods bears a
-+
+ * happens-before relation with the associated insertion or
-+
+ * update.  The result of any bulk operation reflects the
-+
+ * composition of these per-element relations (but is not
-+
+ * necessarily atomic with respect to the map as a whole unless it
-+
+ * is somehow known to be quiescent).  Conversely, because keys
-+
+ * and values in the map are never null, null serves as a reliable
-+
+ * atomic indicator of the current lack of any result.  To
-+
+ * maintain this property, null serves as an implicit basis for
-+
+ * all non-scalar reduction operations. For the double, long, and
-+
+ * int versions, the basis should be one that, when combined with
-+
+ * any other value, returns that other value (more formally, it
-+
+ * should be the identity element for the reduction). Most common
-+
+ * reductions have these properties; for example, computing a sum
-+
+ * with basis 0 or a minimum with basis MAX_VALUE.
-+
+ *
-+
+ * <p>Search and transformation functions provided as arguments
-+
+ * should similarly return null to indicate the lack of any result
-+
+ * (in which case it is not used). In the case of mapped
-+
+ * reductions, this also enables transformations to serve as
-+
+ * filters, returning null (or, in the case of primitive
-+
+ * specializations, the identity basis) if the element should not
-+
+ * be combined. You can create compound transformations and
-+
+ * filterings by composing them yourself under this "null means
-+
+ * there is nothing there now" rule before using them in search or
-+
+ * reduce operations.
-+
+ *
-+
+ * <p>Methods accepting and/or returning Entry arguments maintain
-+
+ * key-value associations. They may be useful for example when
-+
+ * finding the key for the greatest value. Note that "plain" Entry
-+
+ * arguments can be supplied using {@code new
-+
+ * AbstractMap.SimpleEntry(k,v)}.
-+
+ *
-+
+ * <p>Bulk operations may complete abruptly, throwing an
-+
+ * exception encountered in the application of a supplied
-+
+ * function. Bear in mind when handling such exceptions that other
-+
+ * concurrently executing functions could also have thrown
-+
+ * exceptions, or would have done so if the first exception had
-+
+ * not occurred.
-+
+ *
-+
+ * <p>Speedups for parallel compared to sequential forms are common
-+
+ * but not guaranteed.  Parallel operations involving brief functions
-+
+ * on small maps may execute more slowly than sequential forms if the
-+
+ * underlying work to parallelize the computation is more expensive
-+
+ * than the computation itself.  Similarly, parallelization may not
-+
+ * lead to much actual parallelism if all processors are busy
-+
+ * performing unrelated tasks.
-+
+ *
-+
+ * <p>All arguments to all task methods must be non-null.
-+
+ *
-+
+ * <p><em>jsr166e note: During transition, this class
-+
+ * uses nested functional interfaces with different names but the
-+
+ * same forms as those expected for JDK8.</em>
-+
+ *
+ * <p>This class is a member of the
+ * <a href="{@docRoot}/../technotes/guides/collections/index.html">
+ * Java Collections Framework</a>.
-–
+ * <p><em>jsr166e note: This class is a candidate replacement for
-–
+ * java.util.concurrent.ConcurrentHashMap.<em>
-–
+ *
+ * @since 1.5
+ * @author Doug Lea
+ * @param <K> the type of keys maintained by this map
+ * @param <V> the type of mapped values
+ */
+public class ConcurrentHashMapV8<K, V>
-<
+        implements ConcurrentMap<K, V>, Serializable {
->
+    implements ConcurrentMap<K, V>, Serializable {
+    private static final long serialVersionUID = 7249069246763182397L;
+    /**
-<
+     * A function computing a mapping from the given key to a value.
-<
+     * This is a place-holder for an upcoming JDK8 interface.
-<
+     */
-<
+    public static interface MappingFunction<K, V> {
-<
+        /**
-<
+         * Returns a non-null value for the given key.
-<
+         *
-<
+         * @param key the (non-null) key
-<
+         * @return a non-null value
-<
+         */
-<
+        V map(K key);
-<
+    }
-<
-<
+    /**
-<
+     * A function computing a new mapping given a key and its current
-<
+     * mapped value (or {@code null} if there is no current
-<
+     * mapping). This is a place-holder for an upcoming JDK8
-<
+     * interface.
->
+     * A partitionable iterator. A Spliterator can be traversed
->
+     * directly, but can also be partitioned (before traversal) by
->
+     * creating another Spliterator that covers a non-overlapping
->
+     * portion of the elements, and so may be amenable to parallel
->
+     * execution.
->
+     *
->
+     * <p>This interface exports a subset of expected JDK8
->
+     * functionality.
->
+     *
->
+     * <p>Sample usage: Here is one (of the several) ways to compute
->
+     * the sum of the values held in a map using the ForkJoin
->
+     * framework. As illustrated here, Spliterators are well suited to
->
+     * designs in which a task repeatedly splits off half its work
->
+     * into forked subtasks until small enough to process directly,
->
+     * and then joins these subtasks. Variants of this style can also
->
+     * be used in completion-based designs.
->
+     *
->
+     * <pre>
->
+     * {@code ConcurrentHashMapV8<String, Long> m = ...
->
+     * // split as if have 8 * parallelism, for load balance
->
+     * int n = m.size();
->
+     * int p = aForkJoinPool.getParallelism() * 8;
->
+     * int split = (n < p)? n : p;
->
+     * long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
->
+     * // ...
->
+     * static class SumValues extends RecursiveTask<Long> {
->
+     *   final Spliterator<Long> s;
->
+     *   final int split;             // split while > 1
->
+     *   final SumValues nextJoin;    // records forked subtasks to join
->
+     *   SumValues(Spliterator<Long> s, int depth, SumValues nextJoin) {
->
+     *     this.s = s; this.depth = depth; this.nextJoin = nextJoin;
->
+     *   }
->
+     *   public Long compute() {
->
+     *     long sum = 0;
->
+     *     SumValues subtasks = null; // fork subtasks
->
+     *     for (int s = split >>> 1; s > 0; s >>>= 1)
->
+     *       (subtasks = new SumValues(s.split(), s, subtasks)).fork();
->
+     *     while (s.hasNext())        // directly process remaining elements
->
+     *       sum += s.next();
->
+     *     for (SumValues t = subtasks; t != null; t = t.nextJoin)
->
+     *       sum += t.join();         // collect subtask results
->
+     *     return sum;
->
+     *   }
->
+     * }
->
+     * }</pre>
+     */
-<
+    public static interface RemappingFunction<K, V> {
->
+    public static interface Spliterator<T> extends Iterator<T> {
+        /**
-<
+         * Returns a new value given a key and its current value.
->
+         * Returns a Spliterator covering approximately half of the
->
+         * elements, guaranteed not to overlap with those subsequently
->
+         * returned by this Spliterator.  After invoking this method,
->
+         * the current Spliterator will <em>not</em> produce any of
->
+         * the elements of the returned Spliterator, but the two
->
+         * Spliterators together will produce all of the elements that
->
+         * would have been produced by this Spliterator had this
->
+         * method not been called. The exact number of elements
->
+         * produced by the returned Spliterator is not guaranteed, and
->
+         * may be zero (i.e., with {@code hasNext()} reporting {@code
->
+         * false}) if this Spliterator cannot be further split.
-<
+         * @param key the (non-null) key
-<
+         * @param value the current value, or null if there is no mapping
-<
+         * @return a non-null value
->
+         * @return a Spliterator covering approximately half of the
->
+         * elements
->
+         * @throws IllegalStateException if this Spliterator has
->
+         * already commenced traversing elements
+         */
-<
+        V remap(K key, V value);
->
+        Spliterator<T> split();
+    /*
+     * the same or better than java.util.HashMap, and to support high
+     * initial insertion rates on an empty table by many threads.
-<
+     * Each key-value mapping is held in a Node.  Because Node fields
-<
+     * can contain special values, they are defined using plain Object
-<
+     * types. Similarly in turn, all internal methods that use them
-<
+     * work off Object types. And similarly, so do the internal
-<
+     * methods of auxiliary iterator and view classes.  All public
-<
+     * generic typed methods relay in/out of these internal methods,
-<
+     * supplying null-checks and casts as needed. This also allows
-<
+     * many of the public methods to be factored into a smaller number
-<
+     * of internal methods (although sadly not so for the five
-<
+     * variants of put-related operations). The validation-based
-<
+     * approach explained below leads to a lot of code sprawl because
->
+     * Each key-value mapping is held in a Node.  Because Node key
->
+     * fields can contain special values, they are defined using plain
->
+     * Object types (not type "K"). This leads to a lot of explicit
->
+     * casting (and many explicit warning suppressions to tell
->
+     * compilers not to complain about it). It also allows some of the
->
+     * public methods to be factored into a smaller number of internal
->
+     * methods (although sadly not so for the five variants of
->
+     * put-related operations). The validation-based approach
->
+     * explained below leads to a lot of code sprawl because
+     * retry-control precludes factoring into smaller methods.
+     * The table is lazily initialized to a power-of-two size upon the
+     * as lookups check hash code and non-nullness of value before
+     * checking key equality.
-<
+     * We use the top two bits of Node hash fields for control
-<
+     * purposes -- they are available anyway because of addressing
-<
+     * constraints.  As explained further below, these top bits are
-<
+     * used as follows:
-<
+     *  00 - Normal
-<
+     *  01 - Locked
-<
+     *  11 - Locked and may have a thread waiting for lock
-<
+     *  10 - Node is a forwarding node
-<
+     *
-<
+     * The lower 30 bits of each Node's hash field contain a
-<
+     * transformation of the key's hash code, except for forwarding
-<
+     * nodes, for which the lower bits are zero (and so always have
-<
+     * hash field == MOVED).
->
+     * We use the top (sign) bit of Node hash fields for control
->
+     * purposes -- it is available anyway because of addressing
->
+     * constraints.  Nodes with negative hash fields are forwarding
->
+     * nodes to either TreeBins or resized tables.  The lower 31 bits
->
+     * of each normal Node's hash field contain a transformation of
->
+     * the key's hash code.
+     * Insertion (via put or its variants) of the first node in an
+     * empty bin is performed by just CASing it to the bin.  This is
+     * delete, and replace) require locks.  We do not want to waste
+     * the space required to associate a distinct lock object with
+     * each bin, so instead use the first node of a bin list itself as
-<
+     * a lock. Blocking support for these locks relies on the builtin
-<
+     * "synchronized" monitors.  However, we also need a tryLock
-<
+     * construction, so we overlay these by using bits of the Node
-<
+     * hash field for lock control (see above), and so normally use
-<
+     * builtin monitors only for blocking and signalling using
-<
+     * wait/notifyAll constructions. See Node.tryAwaitLock.
->
+     * a lock. Locking support for these locks relies on builtin
->
+     * "synchronized" monitors.
+     * Using the first node of a list as a lock does not by itself
+     * suffice though: When a node is locked, any update must first
+     * iterators in the same way.
+     * The table is resized when occupancy exceeds a percentage
-<
+     * threshold (nominally, 0.75, but see below).  Only a single
-<
+     * thread performs the resize (using field "sizeCtl", to arrange
-<
+     * exclusion), but the table otherwise remains usable for reads
-<
+     * and updates. Resizing proceeds by transferring bins, one by
-<
+     * one, from the table to the next table.  Because we are using
-<
+     * power-of-two expansion, the elements from each bin must either
-<
+     * stay at same index, or move with a power of two offset. We
-<
+     * eliminate unnecessary node creation by catching cases where old
-<
+     * nodes can be reused because their next fields won't change.  On
-<
+     * average, only about one-sixth of them need cloning when a table
-<
+     * doubles. The nodes they replace will be garbage collectable as
-<
+     * soon as they are no longer referenced by any reader thread that
-<
+     * may be in the midst of concurrently traversing table.  Upon
-<
+     * transfer, the old table bin contains only a special forwarding
-<
+     * node (with hash field "MOVED") that contains the next table as
-<
+     * its key. On encountering a forwarding node, access and update
-<
+     * operations restart, using the new table.
-<
+     *
-<
+     * Each bin transfer requires its bin lock. However, unlike other
-<
+     * cases, a transfer can skip a bin if it fails to acquire its
-<
+     * lock, and revisit it later (unless it is a TreeBin). Method
-<
+     * rebuild maintains a buffer of TRANSFER_BUFFER_SIZE bins that
-<
+     * have been skipped because of failure to acquire a lock, and
-<
+     * blocks only if none are available (i.e., only very rarely).
-<
+     * The transfer operation must also ensure that all accessible
-<
+     * bins in both the old and new table are usable by any traversal.
-<
+     * When there are no lock acquisition failures, this is arranged
-<
+     * simply by proceeding from the last bin (table.length - 1) up
-<
+     * towards the first.  Upon seeing a forwarding node, traversals
-<
+     * (see class InternalIterator) arrange to move to the new table
-<
+     * without revisiting nodes.  However, when any node is skipped
-<
+     * during a transfer, all earlier table bins may have become
-<
+     * visible, so are initialized with a reverse-forwarding node back
-<
+     * to the old table until the new ones are established. (This
-<
+     * sometimes requires transiently locking a forwarding node, which
-<
+     * is possible under the above encoding.) These more expensive
-<
+     * mechanics trigger only when necessary.
->
+     * threshold (nominally, 0.75, but see below).  Any thread
->
+     * noticing an overfull bin may assist in resizing after the
->
+     * initiating thread allocates and sets up the replacement
->
+     * array. However, rather than stalling, these other threads may
->
+     * proceed with insertions etc.  The use of TreeBins shields us
->
+     * from the worst case effects of overfilling while resizes are in
->
+     * progress.  Resizing proceeds by transferring bins, one by one,
->
+     * from the table to the next table. To enable concurrency, the
->
+     * next table must be (incrementally) prefilled with place-holders
->
+     * serving as reverse forwarders to the old table.  Because we are
->
+     * using power-of-two expansion, the elements from each bin must
->
+     * either stay at same index, or move with a power of two
->
+     * offset. We eliminate unnecessary node creation by catching
->
+     * cases where old nodes can be reused because their next fields
->
+     * won't change.  On average, only about one-sixth of them need
->
+     * cloning when a table doubles. The nodes they replace will be
->
+     * garbage collectable as soon as they are no longer referenced by
->
+     * any reader thread that may be in the midst of concurrently
->
+     * traversing table.  Upon transfer, the old table bin contains
->
+     * only a special forwarding node (with hash field "MOVED") that
->
+     * contains the next table as its key. On encountering a
->
+     * forwarding node, access and update operations restart, using
->
+     * the new table.
->
+     *
->
+     * Each bin transfer requires its bin lock, which can stall
->
+     * waiting for locks while resizing. However, because other
->
+     * threads can join in and help resize rather than contend for
->
+     * locks, average aggregate waits become shorter as resizing
->
+     * progresses.  The transfer operation must also ensure that all
->
+     * accessible bins in both the old and new table are usable by any
->
+     * traversal.  This is arranged by proceeding from the last bin
->
+     * (table.length - 1) up towards the first.  Upon seeing a
->
+     * forwarding node, traversals (see class Traverser) arrange to
->
+     * move to the new table without revisiting nodes.  However, to
->
+     * ensure that no intervening nodes are skipped, bin splitting can
->
+     * only begin after the associated reverse-forwarders are in
->
+     * place.
+     * The traversal scheme also applies to partial traversals of
-<
+     * ranges of bins (via an alternate InternalIterator constructor)
-<
+     * to support partitioned aggregate operations (that are not
-<
+     * otherwise implemented yet).  Also, read-only operations give up
-<
+     * if ever forwarded to a null table, which provides support for
-<
+     * shutdown-style clearing, which is also not currently
-<
+     * implemented.
->
+     * ranges of bins (via an alternate Traverser constructor)
->
+     * to support partitioned aggregate operations.  Also, read-only
->
+     * operations give up if ever forwarded to a null table, which
->
+     * provides support for shutdown-style clearing, which is also not
->
+     * currently implemented.
+     * Lazy table initialization minimizes footprint until first use,
+     * and also avoids resizings when the first operation is from a
+     * These cases attempt to override the initial capacity settings,
+     * but harmlessly fail to take effect in cases of races.
-<
+     * The element count is maintained using a LongAdder, which avoids
-<
+     * contention on updates but can encounter cache thrashing if read
-<
+     * too frequently during concurrent access. To avoid reading so
-<
+     * often, resizing is attempted either when a bin lock is
-<
+     * contended, or upon adding to a bin already holding two or more
-<
+     * nodes (checked before adding in the xIfAbsent methods, after
-<
+     * adding in others). Under uniform hash distributions, the
-<
+     * probability of this occurring at threshold is around 13%,
-<
+     * meaning that only about 1 in 8 puts check threshold (and after
-<
+     * resizing, many fewer do so). But this approximation has high
-<
+     * variance for small table sizes, so we check on any collision
-<
+     * for sizes <= 64. The bulk putAll operation further reduces
-<
+     * contention by only committing count updates upon these size
-<
+     * checks.
->
+     * The element count is maintained using a specialization of
->
+     * LongAdder. We need to incorporate a specialization rather than
->
+     * just use a LongAdder in order to access implicit
->
+     * contention-sensing that leads to creation of multiple
->
+     * CounterCells.  The counter mechanics avoid contention on
->
+     * updates but can encounter cache thrashing if read too
->
+     * frequently during concurrent access. To avoid reading so often,
->
+     * resizing under contention is attempted only upon adding to a
->
+     * bin already holding two or more nodes. Under uniform hash
->
+     * distributions, the probability of this occurring at threshold
->
+     * is around 13%, meaning that only about 1 in 8 puts check
->
+     * threshold (and after resizing, many fewer do so). The bulk
->
+     * putAll operation further reduces contention by only committing
->
+     * count updates upon these size checks.
+     * Maintaining API and serialization compatibility with previous
+     * versions of this class introduces several oddities. Mainly: We
+    private static final float LOAD_FACTOR = 0.75f;
+    /**
-–
+     * The buffer size for skipped bins during transfers. The
-–
+     * value is arbitrary but should be large enough to avoid
-–
+     * most locking stalls during resizes.
-–
+     */
-–
+    private static final int TRANSFER_BUFFER_SIZE = 32;
-–
-–
+    /**
+     * The bin count threshold for using a tree rather than list for a
+     * bin.  The value reflects the approximate break-even point for
+     * using tree-based operations.
+     */
+    private static final int TREE_THRESHOLD = 8;
-+
+    /**
-+
+     * Minimum number of rebinnings per transfer step. Ranges are
-+
+     * subdivided to allow multiple resizer threads.  This value
-+
+     * serves as a lower bound to avoid resizers encountering
-+
+     * excessive memory contention.  The value should be at least
-+
+     * DEFAULT_CAPACITY.
-+
+     */
-+
+    private static final int MIN_TRANSFER_STRIDE = 16;
-+
+    /*
-<
+     * Encodings for special uses of Node hash fields. See above for
-<
+     * explanation.
->
+     * Encodings for Node hash fields. See above for explanation.
+     */
+    static final int MOVED     = 0x80000000; // hash field for forwarding nodes
-<
+    static final int LOCKED    = 0x40000000; // set/tested only as a bit
-<
+    static final int WAITING   = 0xc0000000; // both bits set/tested together
-<
+    static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash
->
+    static final int HASH_BITS = 0x7fffffff; // usable bits of normal node hash
->
->
+    /** Number of CPUS, to place bounds on some sizings */
->
+    static final int NCPU = Runtime.getRuntime().availableProcessors();
->
->
+    /* ---------------- Counters -------------- */
->
->
+    // Adapted from LongAdder and Striped64.
->
+    // See their internal docs for explanation.
->
->
+    // A padded cell for distributing counts
->
+    static final class CounterCell {
->
+        volatile long p0, p1, p2, p3, p4, p5, p6;
->
+        volatile long value;
->
+        volatile long q0, q1, q2, q3, q4, q5, q6;
->
+        CounterCell(long x) { value = x; }
->
+    }
->
->
+    /**
->
+     * Holder for the thread-local hash code determining which
->
+     * CounterCell to use. The code is initialized via the
->
+     * counterHashCodeGenerator, but may be moved upon collisions.
->
+     */
->
+    static final class CounterHashCode {
->
+        int code;
->
+    }
->
->
+    /**
->
+     * Generates initial value for per-thread CounterHashCodes
->
+     */
->
+    static final AtomicInteger counterHashCodeGenerator = new AtomicInteger();
->
->
+    /**
->
+     * Increment for counterHashCodeGenerator. See class ThreadLocal
->
+     * for explanation.
->
+     */
->
+    static final int SEED_INCREMENT = 0x61c88647;
->
->
+    /**
->
+     * Per-thread counter hash codes. Shared across all instances
->
+     */
->
+    static final ThreadLocal<CounterHashCode> threadCounterHashCode =
->
+        new ThreadLocal<CounterHashCode>();
+    /* ---------------- Fields -------------- */
+     * The array of bins. Lazily initialized upon first insertion.
+     * Size is always a power of two. Accessed directly by iterators.
+     */
-<
+    transient volatile Node[] table;
->
+    transient volatile Node<V>[] table;
->
->
+    /**
->
+     * The next table to use; non-null only while resizing.
->
+     */
->
+    private transient volatile Node<V>[] nextTable;
+    /**
-<
+     * The counter maintaining number of elements.
->
+     * Base counter value, used mainly when there is no contention,
->
+     * but also as a fallback during table initialization
->
+     * races. Updated via CAS.
+     */
-<
+    private transient final LongAdder counter;
->
+    private transient volatile long baseCount;
+    /**
+     * Table initialization and resizing control.  When negative, the
-<
+     * table is being initialized or resized. Otherwise, when table is
-<
+     * null, holds the initial table size to use upon creation, or 0
-<
+     * for default. After initialization, holds the next element count
-<
+     * value upon which to resize the table.
->
+     * table is being initialized or resized: -1 for initialization,
->
+     * else -(1 + the number of active resizing threads).  Otherwise,
->
+     * when table is null, holds the initial table size to use upon
->
+     * creation, or 0 for default. After initialization, holds the
->
+     * next element count value upon which to resize the table.
+     */
+    private transient volatile int sizeCtl;
-+
+    /**
-+
+     * The next table index (plus one) to split while resizing.
-+
+     */
-+
+    private transient volatile int transferIndex;
-+
-+
+    /**
-+
+     * The least available table index to split while resizing.
-+
+     */
-+
+    private transient volatile int transferOrigin;
-+
-+
+    /**
-+
+     * Spinlock (locked via CAS) used when resizing and/or creating Cells.
-+
+     */
-+
+    private transient volatile int counterBusy;
-+
-+
+    /**
-+
+     * Table of counter cells. When non-null, size is a power of 2.
-+
+     */
-+
+    private transient volatile CounterCell[] counterCells;
-+
+    // views
-<
+    private transient KeySet<K,V> keySet;
-<
+    private transient Values<K,V> values;
-<
+    private transient EntrySet<K,V> entrySet;
->
+    private transient KeySetView<K,V> keySet;
->
+    private transient ValuesView<K,V> values;
->
+    private transient EntrySetView<K,V> entrySet;
+    /** For serialization compatibility. Null unless serialized; see below */
+    private Segment<K,V>[] segments;
+     * inline assignments below.
+     */
-<
+    static final Node tabAt(Node[] tab, int i) { // used by InternalIterator
-<
+        return (Node)UNSAFE.getObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE);
->
+    @SuppressWarnings("unchecked") static final <V> Node<V> tabAt
->
+        (Node<V>[] tab, int i) { // used by Traverser
->
+        return (Node<V>)U.getObjectVolatile(tab, ((long)i << ASHIFT) + ABASE);
-<
+    private static final boolean casTabAt(Node[] tab, int i, Node c, Node v) {
-<
+        return UNSAFE.compareAndSwapObject(tab, ((long)i<<ASHIFT)+ABASE, c, v);
->
+    private static final <V> boolean casTabAt
->
+        (Node<V>[] tab, int i, Node<V> c, Node<V> v) {
->
+        return U.compareAndSwapObject(tab, ((long)i << ASHIFT) + ABASE, c, v);
-<
+    private static final void setTabAt(Node[] tab, int i, Node v) {
-<
+        UNSAFE.putObjectVolatile(tab, ((long)i<<ASHIFT)+ABASE, v);
->
+    private static final <V> void setTabAt
->
+        (Node<V>[] tab, int i, Node<V> v) {
->
+        U.putObjectVolatile(tab, ((long)i << ASHIFT) + ABASE, v);
+    /* ---------------- Nodes -------------- */
+    /**
+     * Key-value entry. Note that this is never exported out as a
-<
+     * user-visible Map.Entry (see WriteThroughEntry and SnapshotEntry
-<
+     * below). Nodes with a hash field of MOVED are special, and do
-<
+     * not contain user keys or values.  Otherwise, keys are never
-<
+     * null, and null val fields indicate that a node is in the
-<
+     * process of being deleted or created. For purposes of read-only
-<
+     * access, a key may be read before a val, but can only be used
-<
+     * after checking val to be non-null.
->
+     * user-visible Map.Entry (see MapEntry below). Nodes with a hash
->
+     * field of MOVED are special, and do not contain user keys or
->
+     * values.  Otherwise, keys are never null, and null val fields
->
+     * indicate that a node is in the process of being deleted or
->
+     * created. For purposes of read-only access, a key may be read
->
+     * before a val, but can only be used after checking val to be
->
+     * non-null.
+     */
-<
+    static class Node {
-<
+        volatile int hash;
->
+    static class Node<V> {
->
+        final int hash;
+        final Object key;
-<
+        volatile Object val;
-<
+        volatile Node next;
->
+        volatile V val;
->
+        volatile Node<V> next;
-<
+        Node(int hash, Object key, Object val, Node next) {
->
+        Node(int hash, Object key, V val, Node<V> next) {
+            this.hash = hash;
+            this.key = key;
+            this.val = val;
+            this.next = next;
-–
-–
+        /** CompareAndSet the hash field */
-–
+        final boolean casHash(int cmp, int val) {
-–
+            return UNSAFE.compareAndSwapInt(this, hashOffset, cmp, val);
-–
+        }
-–
-–
+        /** The number of spins before blocking for a lock */
-–
+        static final int MAX_SPINS =
-–
+            Runtime.getRuntime().availableProcessors() > 1 ? 64 : 1;
-–
-–
+        /**
-–
+         * Spins a while if LOCKED bit set and this node is the first
-–
+         * of its bin, and then sets WAITING bits on hash field and
-–
+         * blocks (once) if they are still set.  It is OK for this
-–
+         * method to return even if lock is not available upon exit,
-–
+         * which enables these simple single-wait mechanics.
-–
+         *
-–
+         * The corresponding signalling operation is performed within
-–
+         * callers: Upon detecting that WAITING has been set when
-–
+         * unlocking lock (via a failed CAS from non-waiting LOCKED
-–
+         * state), unlockers acquire the sync lock and perform a
-–
+         * notifyAll.
-–
+         */
-–
+        final void tryAwaitLock(Node[] tab, int i) {
-–
+            if (tab != null && i >= 0 && i < tab.length) { // bounds check
-–
+                int r = ThreadLocalRandom.current().nextInt(); // randomize spins
-–
+                int spins = MAX_SPINS, h;
-–
+                while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) {
-–
+                    if (spins >= 0) {
-–
+                        r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
-–
+                        if (r >= 0 && --spins == 0)
-–
+                            Thread.yield();  // yield before block
-–
+                    }
-–
+                    else if (casHash(h, h | WAITING)) {
-–
+                        synchronized (this) {
-–
+                            if (tabAt(tab, i) == this &&
-–
+                                (hash & WAITING) == WAITING) {
-–
+                                try {
-–
+                                    wait();
-–
+                                } catch (InterruptedException ie) {
-–
+                                    Thread.currentThread().interrupt();
-–
+                                }
-–
+                            }
-–
+                            else
-–
+                                notifyAll(); // possibly won race vs signaller
-–
+                        }
-–
+                        break;
-–
+                    }
-–
+                }
-–
+            }
-–
+        }
-–
-–
+        // Unsafe mechanics for casHash
-–
+        private static final sun.misc.Unsafe UNSAFE;
-–
+        private static final long hashOffset;
-–
-–
+        static {
-–
+            try {
-–
+                UNSAFE = getUnsafe();
-–
+                Class<?> k = Node.class;
-–
+                hashOffset = UNSAFE.objectFieldOffset
-–
+                    (k.getDeclaredField("hash"));
-–
+            } catch (Exception e) {
-–
+                throw new Error(e);
-–
+            }
-–
+        }
+    /* ---------------- TreeBins -------------- */
+    /**
+     * Nodes for use in TreeBins
+     */
-<
+    static final class TreeNode extends Node {
-<
+        TreeNode parent;  // red-black tree links
-<
+        TreeNode left;
-<
+        TreeNode right;
-<
+        TreeNode prev;    // needed to unlink next upon deletion
->
+    static final class TreeNode<V> extends Node<V> {
->
+        TreeNode<V> parent;  // red-black tree links
->
+        TreeNode<V> left;
->
+        TreeNode<V> right;
->
+        TreeNode<V> prev;    // needed to unlink next upon deletion
+        boolean red;
-<
+        TreeNode(int hash, Object key, Object val, Node next, TreeNode parent) {
->
+        TreeNode(int hash, Object key, V val, Node<V> next, TreeNode<V> parent) {
+            super(hash, key, val, next);
+            this.parent = parent;
+     * handle this, the tree is ordered primarily by hash value, then
+     * by getClass().getName() order, and then by Comparator order
+     * among elements of the same class.  On lookup at a node, if
-<
+     * non-Comparable, both left and right children may need to be
-<
+     * searched in the case of tied hash values. (This corresponds to
-<
+     * the full list search that would be necessary if all elements
-<
+     * were non-Comparable and had tied hashes.)
->
+     * elements are not comparable or compare as 0, both left and
->
+     * right children may need to be searched in the case of tied hash
->
+     * values. (This corresponds to the full list search that would be
->
+     * necessary if all elements were non-Comparable and had tied
->
+     * hashes.)  The red-black balancing code is updated from
->
+     * pre-jdk-collections
->
+     * (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
->
+     * based in turn on Cormen, Leiserson, and Rivest "Introduction to
->
+     * Algorithms" (CLR).
+     * TreeBins also maintain a separate locking discipline than
+     * regular bins. Because they are forwarded via special MOVED
+     * nodes at bin heads (which can never change once established),
-<
+     * we cannot use use those nodes as locks. Instead, TreeBin
->
+     * we cannot use those nodes as locks. Instead, TreeBin
+     * extends AbstractQueuedSynchronizer to support a simple form of
+     * read-write lock. For update operations and table validation,
+     * the exclusive form of lock behaves in the same way as bin-head
+     * and writers. Since we don't need to export full Lock API, we
+     * just override the minimal AQS methods and use them directly.
+     */
-<
+    static final class TreeBin extends AbstractQueuedSynchronizer {
->
+    static final class TreeBin<V> extends AbstractQueuedSynchronizer {
+        private static final long serialVersionUID = 2249069246763182397L;
-<
+        TreeNode root;  // root of tree
-<
+        TreeNode first; // head of next-pointer list
->
+        transient TreeNode<V> root;  // root of tree
->
+        transient TreeNode<V> first; // head of next-pointer list
+        /* AQS overrides */
+        public final boolean isHeldExclusively() { return getState() > 0; }
+            return c == -1;
-+
+        /** From CLR */
-+
+        private void rotateLeft(TreeNode<V> p) {
-+
+            if (p != null) {
-+
+                TreeNode<V> r = p.right, pp, rl;
-+
+                if ((rl = p.right = r.left) != null)
-+
+                    rl.parent = p;
-+
+                if ((pp = r.parent = p.parent) == null)
-+
+                    root = r;
-+
+                else if (pp.left == p)
-+
+                    pp.left = r;
-+
+                else
-+
+                    pp.right = r;
-+
+                r.left = p;
-+
+                p.parent = r;
-+
+            }
-+
+        }
-+
-+
+        /** From CLR */
-+
+        private void rotateRight(TreeNode<V> p) {
-+
+            if (p != null) {
-+
+                TreeNode<V> l = p.left, pp, lr;
-+
+                if ((lr = p.left = l.right) != null)
-+
+                    lr.parent = p;
-+
+                if ((pp = l.parent = p.parent) == null)
-+
+                    root = l;
-+
+                else if (pp.right == p)
-+
+                    pp.right = l;
-+
+                else
-+
+                    pp.left = l;
-+
+                l.right = p;
-+
+                p.parent = l;
-+
+            }
-+
+        }
-+
+        /**
-<
+         * Return the TreeNode (or null if not found) for the given key
->
+         * Returns the TreeNode (or null if not found) for the given key
+         * starting at given root.
+         */
-<
+        @SuppressWarnings("unchecked") // suppress Comparable cast warning
-<
+        final TreeNode getTreeNode(int h, Object k, TreeNode p) {
->
+        @SuppressWarnings("unchecked") final TreeNode<V> getTreeNode
->
+            (int h, Object k, TreeNode<V> p) {
+            Class<?> c = k.getClass();
+            while (p != null) {
-<
+                int dir, ph;  Object pk; Class<?> pc; TreeNode r;
-<
+                if (h < (ph = p.hash))
-<
+                    dir = -1;
-<
+                else if (h > ph)
-<
+                    dir = 1;
-<
+                else if ((pk = p.key) == k || k.equals(pk))
-<
+                    return p;
-<
+                else if (c != (pc = pk.getClass()))
-<
+                    dir = c.getName().compareTo(pc.getName());
-<
+                else if (k instanceof Comparable)
-<
+                    dir = ((Comparable)k).compareTo((Comparable)pk);
-<
+                else
-<
+                    dir = 0;
-<
+                TreeNode pr = p.right;
-<
+                if (dir > 0)
-<
+                    p = pr;
-<
+                else if (dir == 0 && pr != null && h >= pr.hash &&
-<
+                         (r = getTreeNode(h, k, pr)) != null)
-<
+                    return r;
->
+                int dir, ph;  Object pk; Class<?> pc;
->
+                if ((ph = p.hash) == h) {
->
+                    if ((pk = p.key) == k || k.equals(pk))
->
+                        return p;
->
+                    if (c != (pc = pk.getClass()) ||
->
+                        !(k instanceof Comparable) ||
->
+                        (dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
->
+                        if ((dir = (c == pc) ? 0 :
->
+                             c.getName().compareTo(pc.getName())) == 0) {
->
+                            TreeNode<V> r = null, pl, pr; // check both sides
->
+                            if ((pr = p.right) != null && h >= pr.hash &&
->
+                                (r = getTreeNode(h, k, pr)) != null)
->
+                                return r;
->
+                            else if ((pl = p.left) != null && h <= pl.hash)
->
+                                dir = -1;
->
+                            else // nothing there
->
+                                return null;
->
+                        }
->
+                    }
->
+                }
+                else
-<
+                    p = p.left;
->
+                    dir = (h < ph) ? -1 : 1;
->
+                p = (dir > 0) ? p.right : p.left;
+            return null;
+         * read-lock to call getTreeNode, but during failure to get
+         * lock, searches along next links.
+         */
-<
+        final Object getValue(int h, Object k) {
-<
+            Node r = null;
->
+        final V getValue(int h, Object k) {
->
+            Node<V> r = null;
+            int c = getState(); // Must read lock state first
-<
+            for (Node e = first; e != null; e = e.next) {
->
+            for (Node<V> e = first; e != null; e = e.next) {
+                if (c <= 0 && compareAndSetState(c, c - 1)) {
+                    try {
+                        r = getTreeNode(h, k, root);
+                    break;
-<
+                else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) {
->
+                else if (e.hash == h && k.equals(e.key)) {
+                    r = e;
+                    break;
+        /**
-<
+         * Find or add a node
->
+         * Finds or adds a node.
+         * @return null if added
+         */
-<
+        @SuppressWarnings("unchecked") // suppress Comparable cast warning
-<
+        final TreeNode putTreeNode(int h, Object k, Object v) {
->
+        @SuppressWarnings("unchecked") final TreeNode<V> putTreeNode
->
+            (int h, Object k, V v) {
+            Class<?> c = k.getClass();
-<
+            TreeNode p = root;
->
+            TreeNode<V> pp = root, p = null;
+            int dir = 0;
-<
+            if (p != null) {
-<
+                for (;;) {
-<
+                    int ph;  Object pk; Class<?> pc; TreeNode r;
-<
+                    if (h < (ph = p.hash))
-<
+                        dir = -1;
-<
+                    else if (h > ph)
-<
+                        dir = 1;
-<
+                    else if ((pk = p.key) == k || k.equals(pk))
->
+            while (pp != null) { // find existing node or leaf to insert at
->
+                int ph;  Object pk; Class<?> pc;
->
+                p = pp;
->
+                if ((ph = p.hash) == h) {
->
+                    if ((pk = p.key) == k || k.equals(pk))
+                        return p;
-<
+                    else if (c != (pc = (pk = p.key).getClass()))
-<
+                        dir = c.getName().compareTo(pc.getName());
-<
+                    else if (k instanceof Comparable)
-<
+                        dir = ((Comparable)k).compareTo((Comparable)pk);
-<
+                    else
-<
+                        dir = 0;
-<
+                    TreeNode pr = p.right, pl;
-<
+                    if (dir > 0) {
-<
+                        if (pr == null)
-<
+                            break;
-<
+                        p = pr;
->
+                    if (c != (pc = pk.getClass()) ||
->
+                        !(k instanceof Comparable) ||
->
+                        (dir = ((Comparable)k).compareTo((Comparable)pk)) == 0) {
->
+                        TreeNode<V> s = null, r = null, pr;
->
+                        if ((dir = (c == pc) ? 0 :
->
+                             c.getName().compareTo(pc.getName())) == 0) {
->
+                            if ((pr = p.right) != null && h >= pr.hash &&
->
+                                (r = getTreeNode(h, k, pr)) != null)
->
+                                return r;
->
+                            else // continue left
->
+                                dir = -1;
->
+                        }
->
+                        else if ((pr = p.right) != null && h >= pr.hash)
->
+                            s = pr;
->
+                        if (s != null && (r = getTreeNode(h, k, s)) != null)
->
+                            return r;
-–
+                    else if (dir == 0 && pr != null && h >= pr.hash &&
-–
+                             (r = getTreeNode(h, k, pr)) != null)
-–
+                        return r;
-–
+                    else if ((pl = p.left) == null)
-–
+                        break;
-–
+                    else
-–
+                        p = pl;
-+
+                else
-+
+                    dir = (h < ph) ? -1 : 1;
-+
+                pp = (dir > 0) ? p.right : p.left;
-<
+            TreeNode f = first;
-<
+            TreeNode r = first = new TreeNode(h, k, v, f, p);
->
->
+            TreeNode<V> f = first;
->
+            TreeNode<V> x = first = new TreeNode<V>(h, k, v, f, p);
+            if (p == null)
-<
+                root = r;
-<
+            else {
->
+                root = x;
->
+            else { // attach and rebalance; adapted from CLR
->
+                TreeNode<V> xp, xpp;
->
+                if (f != null)
->
+                    f.prev = x;
+                if (dir <= 0)
-<
+                    p.left = r;
->
+                    p.left = x;
+                else
-<
+                    p.right = r;
-<
+                if (f != null)
-<
+                    f.prev = r;
-<
+                fixAfterInsertion(r);
->
+                    p.right = x;
->
+                x.red = true;
->
+                while (x != null && (xp = x.parent) != null && xp.red &&
->
+                       (xpp = xp.parent) != null) {
->
+                    TreeNode<V> xppl = xpp.left;
->
+                    if (xp == xppl) {
->
+                        TreeNode<V> y = xpp.right;
->
+                        if (y != null && y.red) {
->
+                            y.red = false;
->
+                            xp.red = false;
->
+                            xpp.red = true;
->
+                            x = xpp;
->
+                        }
->
+                        else {
->
+                            if (x == xp.right) {
->
+                                rotateLeft(x = xp);
->
+                                xpp = (xp = x.parent) == null ? null : xp.parent;
->
+                            }
->
+                            if (xp != null) {
->
+                                xp.red = false;
->
+                                if (xpp != null) {
->
+                                    xpp.red = true;
->
+                                    rotateRight(xpp);
->
+                                }
->
+                            }
->
+                        }
->
+                    }
->
+                    else {
->
+                        TreeNode<V> y = xppl;
->
+                        if (y != null && y.red) {
->
+                            y.red = false;
->
+                            xp.red = false;
->
+                            xpp.red = true;
->
+                            x = xpp;
->
+                        }
->
+                        else {
->
+                            if (x == xp.left) {
->
+                                rotateRight(x = xp);
->
+                                xpp = (xp = x.parent) == null ? null : xp.parent;
->
+                            }
->
+                            if (xp != null) {
->
+                                xp.red = false;
->
+                                if (xpp != null) {
->
+                                    xpp.red = true;
->
+                                    rotateLeft(xpp);
->
+                                }
->
+                            }
->
+                        }
->
+                    }
->
+                }
->
+                TreeNode<V> r = root;
->
+                if (r != null && r.red)
->
+                    r.red = false;
+            return null;
+         * that are accessible independently of lock. So instead we
+         * swap the tree linkages.
+         */
-<
+        final void deleteTreeNode(TreeNode p) {
-<
+            TreeNode next = (TreeNode)p.next; // unlink traversal pointers
-<
+            TreeNode pred = p.prev;
->
+        final void deleteTreeNode(TreeNode<V> p) {
->
+            TreeNode<V> next = (TreeNode<V>)p.next; // unlink traversal pointers
->
+            TreeNode<V> pred = p.prev;
+            if (pred == null)
+                first = next;
+            else
+                pred.next = next;
+            if (next != null)
+                next.prev = pred;
-<
+            TreeNode replacement;
-<
+            TreeNode pl = p.left;
-<
+            TreeNode pr = p.right;
->
+            TreeNode<V> replacement;
->
+            TreeNode<V> pl = p.left;
->
+            TreeNode<V> pr = p.right;
+            if (pl != null && pr != null) {
-<
+                TreeNode s = pr;
-<
+                while (s.left != null) // find successor
-<
+                    s = s.left;
->
+                TreeNode<V> s = pr, sl;
->
+                while ((sl = s.left) != null) // find successor
->
+                    s = sl;
+                boolean c = s.red; s.red = p.red; p.red = c; // swap colors
-<
+                TreeNode sr = s.right;
-<
+                TreeNode pp = p.parent;
->
+                TreeNode<V> sr = s.right;
->
+                TreeNode<V> pp = p.parent;
+                if (s == pr) { // p was s's direct parent
+                    p.parent = s;
+                    s.right = p;
+                else {
-<
+                    TreeNode sp = s.parent;
->
+                    TreeNode<V> sp = s.parent;
+                    if ((p.parent = sp) != null) {
+                        if (s == sp.left)
+                            sp.left = p;
+            else
+                replacement = (pl != null) ? pl : pr;
-<
+            TreeNode pp = p.parent;
->
+            TreeNode<V> pp = p.parent;
+            if (replacement == null) {
+                if (pp == null) {
+                    root = null;
+                    pp.right = replacement;
+                p.left = p.right = p.parent = null;
-<
+            if (!p.red)
-<
+                fixAfterDeletion(replacement);
-<
+            if (p == replacement && (pp = p.parent) != null) {
-<
+                if (p == pp.left) // detach pointers
-<
+                    pp.left = null;
-<
+                else if (p == pp.right)
-<
+                    pp.right = null;
-<
+                p.parent = null;
-<
+            }
-<
+        }
-<
-<
+        // CLR code updated from pre-jdk-collections version at
-<
+        // http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java
-<
-<
+        /** From CLR */
-<
+        private void rotateLeft(TreeNode p) {
-<
+            if (p != null) {
-<
+                TreeNode r = p.right, pp, rl;
-<
+                if ((rl = p.right = r.left) != null)
-<
+                    rl.parent = p;
-<
+                if ((pp = r.parent = p.parent) == null)
-<
+                    root = r;
-<
+                else if (pp.left == p)
-<
+                    pp.left = r;
-<
+                else
-<
+                    pp.right = r;
-<
+                r.left = p;
-<
+                p.parent = r;
-<
+            }
-<
+        }
-<
-<
+        /** From CLR */
-<
+        private void rotateRight(TreeNode p) {
-<
+            if (p != null) {
-<
+                TreeNode l = p.left, pp, lr;
-<
+                if ((lr = p.left = l.right) != null)
-<
+                    lr.parent = p;
-<
+                if ((pp = l.parent = p.parent) == null)
-<
+                    root = l;
-<
+                else if (pp.right == p)
-<
+                    pp.right = l;
-<
+                else
-<
+                    pp.left = l;
-<
+                l.right = p;
-<
+                p.parent = l;
-<
+            }
-<
+        }
-<
-<
+        /** From CLR */
-<
+        private void fixAfterInsertion(TreeNode x) {
-<
+            x.red = true;
-<
+            TreeNode xp, xpp;
-<
+            while (x != null && (xp = x.parent) != null && xp.red &&
-<
+                   (xpp = xp.parent) != null) {
-<
+                TreeNode xppl = xpp.left;
-<
+                if (xp == xppl) {
-<
+                    TreeNode y = xpp.right;
-<
+                    if (y != null && y.red) {
-<
+                        y.red = false;
-<
+                        xp.red = false;
-<
+                        xpp.red = true;
-<
+                        x = xpp;
-<
+                    }
-<
+                    else {
-<
+                        if (x == xp.right) {
-<
+                            x = xp;
-<
+                            rotateLeft(x);
-<
+                            xpp = (xp = x.parent) == null ? null : xp.parent;
-<
+                        }
-<
+                        if (xp != null) {
-<
+                            xp.red = false;
-<
+                            if (xpp != null) {
-<
+                                xpp.red = true;
-<
+                                rotateRight(xpp);
-<
+                            }
-<
+                        }
-<
+                    }
-<
+                }
-<
+                else {
-<
+                    TreeNode y = xppl;
-<
+                    if (y != null && y.red) {
-<
+                        y.red = false;
-<
+                        xp.red = false;
-<
+                        xpp.red = true;
-<
+                        x = xpp;
->
+            if (!p.red) { // rebalance, from CLR
->
+                TreeNode<V> x = replacement;
->
+                while (x != null) {
->
+                    TreeNode<V> xp, xpl;
->
+                    if (x.red || (xp = x.parent) == null) {
->
+                        x.red = false;
->
+                        break;
-<
+                    else {
-<
+                        if (x == xp.left) {
-<
+                            x = xp;
-<
+                            rotateRight(x);
-<
+                            xpp = (xp = x.parent) == null ? null : xp.parent;
-<
+                        }
-<
+                        if (xp != null) {
-<
+                            xp.red = false;
-<
+                            if (xpp != null) {
-<
+                                xpp.red = true;
-<
+                                rotateLeft(xpp);
-<
+                            }
->
+                    if (x == (xpl = xp.left)) {
->
+                        TreeNode<V> sib = xp.right;
->
+                        if (sib != null && sib.red) {
->
+                            sib.red = false;
->
+                            xp.red = true;
->
+                            rotateLeft(xp);
->
+                            sib = (xp = x.parent) == null ? null : xp.right;
-<
+                    }
-<
+                }
-<
+            }
-<
+            TreeNode r = root;
-<
+            if (r != null && r.red)
-<
+                r.red = false;
-<
+        }
-<
-<
+        /** From CLR */
-<
+        private void fixAfterDeletion(TreeNode x) {
-<
+            while (x != null) {
-<
+                TreeNode xp, xpl;
-<
+                if (x.red || (xp = x.parent) == null) {
-<
+                    x.red = false;
-<
+                    break;
-<
+                }
-<
+                if (x == (xpl = xp.left)) {
-<
+                    TreeNode sib = xp.right;
-<
+                    if (sib != null && sib.red) {
-<
+                        sib.red = false;
-<
+                        xp.red = true;
-<
+                        rotateLeft(xp);
-<
+                        sib = (xp = x.parent) == null ? null : xp.right;
-<
+                    }
-<
+                    if (sib == null)
-<
+                        x = xp;
-<
+                    else {
-<
+                        TreeNode sl = sib.left, sr = sib.right;
-<
+                        if ((sr == null || !sr.red) &&
-<
+                            (sl == null || !sl.red)) {
-<
+                            sib.red = true;
->
+                        if (sib == null)
+                            x = xp;
-–
+                        }
+                        else {
-<
+                            if (sr == null || !sr.red) {
-<
+                                if (sl != null)
-<
+                                    sl.red = false;
->
+                            TreeNode<V> sl = sib.left, sr = sib.right;
->
+                            if ((sr == null || !sr.red) &&
->
+                                (sl == null || !sl.red)) {
+                                sib.red = true;
-<
+                                rotateRight(sib);
-<
+                                sib = (xp = x.parent) == null ? null : xp.right;
->
+                                x = xp;
-<
+                            if (sib != null) {
-<
+                                sib.red = (xp == null)? false : xp.red;
-<
+                                if ((sr = sib.right) != null)
-<
+                                    sr.red = false;
-<
+                            }
-<
+                            if (xp != null) {
-<
+                                xp.red = false;
-<
+                                rotateLeft(xp);
->
+                            else {
->
+                                if (sr == null || !sr.red) {
->
+                                    if (sl != null)
->
+                                        sl.red = false;
->
+                                    sib.red = true;
->
+                                    rotateRight(sib);
->
+                                    sib = (xp = x.parent) == null ?
->
+                                        null : xp.right;
->
+                                }
->
+                                if (sib != null) {
->
+                                    sib.red = (xp == null) ? false : xp.red;
->
+                                    if ((sr = sib.right) != null)
->
+                                        sr.red = false;
->
+                                }
->
+                                if (xp != null) {
->
+                                    xp.red = false;
->
+                                    rotateLeft(xp);
->
+                                }
->
+                                x = root;
-–
+                            x = root;
-<
+                }
-<
+                else { // symmetric
-<
+                    TreeNode sib = xpl;
-<
+                    if (sib != null && sib.red) {
-<
+                        sib.red = false;
-<
+                        xp.red = true;
-<
+                        rotateRight(xp);
-<
+                        sib = (xp = x.parent) == null ? null : xp.left;
-<
+                    }
-<
+                    if (sib == null)
-<
+                        x = xp;
-<
+                    else {
-<
+                        TreeNode sl = sib.left, sr = sib.right;
-<
+                        if ((sl == null || !sl.red) &&
-<
+                            (sr == null || !sr.red)) {
-<
+                            sib.red = true;
-<
+                            x = xp;
->
+                    else { // symmetric
->
+                        TreeNode<V> sib = xpl;
->
+                        if (sib != null && sib.red) {
->
+                            sib.red = false;
->
+                            xp.red = true;
->
+                            rotateRight(xp);
->
+                            sib = (xp = x.parent) == null ? null : xp.left;
-+
+                        if (sib == null)
-+
+                            x = xp;
+                        else {
-<
+                            if (sl == null || !sl.red) {
-<
+                                if (sr != null)
-<
+                                    sr.red = false;
->
+                            TreeNode<V> sl = sib.left, sr = sib.right;
->
+                            if ((sl == null || !sl.red) &&
->
+                                (sr == null || !sr.red)) {
+                                sib.red = true;
-<
+                                rotateLeft(sib);
-<
+                                sib = (xp = x.parent) == null ? null : xp.left;
->
+                                x = xp;
-<
+                            if (sib != null) {
-<
+                                sib.red = (xp == null)? false : xp.red;
-<
+                                if ((sl = sib.left) != null)
-<
+                                    sl.red = false;
-<
+                            }
-<
+                            if (xp != null) {
-<
+                                xp.red = false;
-<
+                                rotateRight(xp);
->
+                            else {
->
+                                if (sl == null || !sl.red) {
->
+                                    if (sr != null)
->
+                                        sr.red = false;
->
+                                    sib.red = true;
->
+                                    rotateLeft(sib);
->
+                                    sib = (xp = x.parent) == null ?
->
+                                        null : xp.left;
->
+                                }
->
+                                if (sib != null) {
->
+                                    sib.red = (xp == null) ? false : xp.red;
->
+                                    if ((sl = sib.left) != null)
->
+                                        sl.red = false;
->
+                                }
->
+                                if (xp != null) {
->
+                                    xp.red = false;
->
+                                    rotateRight(xp);
->
+                                }
->
+                                x = root;
-–
+                            x = root;
-+
+            if (p == replacement && (pp = p.parent) != null) {
-+
+                if (p == pp.left) // detach pointers
-+
+                    pp.left = null;
-+
+                else if (p == pp.right)
-+
+                    pp.right = null;
-+
+                p.parent = null;
-+
+            }
+    /* ---------------- Collision reduction methods -------------- */
+    /**
-<
+     * Spreads higher bits to lower, and also forces top 2 bits to 0.
->
+     * Spreads higher bits to lower, and also forces top bit to 0.
+     * Because the table uses power-of-two masking, sets of hashes
+     * that vary only in bits above the current mask will always
+     * collide. (Among known examples are sets of Float keys holding
+     * we apply a transform that spreads the impact of higher bits
+     * downward. There is a tradeoff between speed, utility, and
+     * quality of bit-spreading. Because many common sets of hashes
-<
+     * are already reaonably distributed across bits (so don't benefit
->
+     * are already reasonably distributed across bits (so don't benefit
+     * from spreading), and because we use trees to handle large sets
+     * of collisions in bins, we don't need excessively high quality.
+     */
+    /**
-<
+     * Replaces a list bin with a tree bin. Call only when locked.
-<
+     * Fails to replace if the given key is non-comparable or table
-<
+     * is, or needs, resizing.
-<
+     */
-<
+    private final void replaceWithTreeBin(Node[] tab, int index, Object key) {
-<
+        if ((key instanceof Comparable) &&
-<
+            (tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) {
-<
+            TreeBin t = new TreeBin();
-<
+            for (Node e = tabAt(tab, index); e != null; e = e.next)
-<
+                t.putTreeNode(e.hash & HASH_BITS, e.key, e.val);
-<
+            setTabAt(tab, index, new Node(MOVED, t, null, null));
->
+     * Replaces a list bin with a tree bin if key is comparable.  Call
->
+     * only when locked.
->
+     */
->
+    private final void replaceWithTreeBin(Node<V>[] tab, int index, Object key) {
->
+        if (key instanceof Comparable) {
->
+            TreeBin<V> t = new TreeBin<V>();
->
+            for (Node<V> e = tabAt(tab, index); e != null; e = e.next)
->
+                t.putTreeNode(e.hash, e.key, e.val);
->
+            setTabAt(tab, index, new Node<V>(MOVED, t, null, null));
+    /* ---------------- Internal access and update methods -------------- */
+    /** Implementation for get and containsKey */
-<
+    private final Object internalGet(Object k) {
->
+    @SuppressWarnings("unchecked") private final V internalGet(Object k) {
+        int h = spread(k.hashCode());
-<
+        retry: for (Node[] tab = table; tab != null;) {
-<
+            Node e, p; Object ek, ev; int eh;      // locals to read fields once
->
+        retry: for (Node<V>[] tab = table; tab != null;) {
->
+            Node<V> e; Object ek; V ev; int eh; // locals to read fields once
+            for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) {
-<
+                if ((eh = e.hash) == MOVED) {
->
+                if ((eh = e.hash) < 0) {
+                    if ((ek = e.key) instanceof TreeBin)  // search TreeBin
-<
+                        return ((TreeBin)ek).getValue(h, k);
-<
+                    else {                        // restart with new table
-<
+                        tab = (Node[])ek;
->
+                        return ((TreeBin<V>)ek).getValue(h, k);
->
+                    else {                      // restart with new table
->
+                        tab = (Node<V>[])ek;
+                        continue retry;
-<
+                else if ((eh & HASH_BITS) == h && (ev = e.val) != null &&
->
+                else if (eh == h && (ev = e.val) != null &&
+                         ((ek = e.key) == k || k.equals(ek)))
+                    return ev;
+     * Replaces node value with v, conditional upon match of cv if
+     * non-null.  If resulting value is null, delete.
+     */
-<
+    private final Object internalReplace(Object k, Object v, Object cv) {
->
+    @SuppressWarnings("unchecked") private final V internalReplace
->
+        (Object k, V v, Object cv) {
+        int h = spread(k.hashCode());
-<
+        Object oldVal = null;
-<
+        for (Node[] tab = table;;) {
-<
+            Node f; int i, fh; Object fk;
->
+        V oldVal = null;
->
+        for (Node<V>[] tab = table;;) {
->
+            Node<V> f; int i, fh; Object fk;
+            if (tab == null ||
+                (f = tabAt(tab, i = (tab.length - 1) & h)) == null)
+                break;
-<
+            else if ((fh = f.hash) == MOVED) {
->
+            else if ((fh = f.hash) < 0) {
+                if ((fk = f.key) instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
->
+                    TreeBin<V> t = (TreeBin<V>)fk;
+                    boolean validated = false;
+                    boolean deleted = false;
+                    t.acquire(0);
+                    try {
+                        if (tabAt(tab, i) == f) {
+                            validated = true;
-<
+                            TreeNode p = t.getTreeNode(h, k, t.root);
->
+                            TreeNode<V> p = t.getTreeNode(h, k, t.root);
+                            if (p != null) {
-<
+                                Object pv = p.val;
->
+                                V pv = p.val;
+                                if (cv == null || cv == pv || cv.equals(pv)) {
+                                    oldVal = pv;
+                                    if ((p.val = v) == null) {
+                    if (validated) {
+                        if (deleted)
-<
+                            counter.add(-1L);
->
+                            addCount(-1L, -1);
+                        break;
+                else
-<
+                    tab = (Node[])fk;
->
+                    tab = (Node<V>[])fk;
-<
+            else if ((fh & HASH_BITS) != h && f.next == null) // precheck
->
+            else if (fh != h && f.next == null) // precheck
+                break;                          // rules out possible existence
-<
+            else if ((fh & LOCKED) != 0) {
-<
+                checkForResize();               // try resizing if can't get lock
-<
+                f.tryAwaitLock(tab, i);
-<
+            }
-<
+            else if (f.casHash(fh, fh | LOCKED)) {
->
+            else {
+                boolean validated = false;
+                boolean deleted = false;
-<
+                try {
->
+                synchronized (f) {
+                    if (tabAt(tab, i) == f) {
+                        validated = true;
-<
+                        for (Node e = f, pred = null;;) {
-<
+                            Object ek, ev;
-<
+                            if ((e.hash & HASH_BITS) == h &&
->
+                        for (Node<V> e = f, pred = null;;) {
->
+                            Object ek; V ev;
->
+                            if (e.hash == h &&
+                                ((ev = e.val) != null) &&
+                                ((ek = e.key) == k || k.equals(ek))) {
+                                if (cv == null || cv == ev || cv.equals(ev)) {
+                                    oldVal = ev;
+                                    if ((e.val = v) == null) {
+                                        deleted = true;
-<
+                                        Node en = e.next;
->
+                                        Node<V> en = e.next;
+                                        if (pred != null)
+                                            pred.next = en;
+                                        else
+                                break;
-–
+                } finally {
-–
+                    if (!f.casHash(fh | LOCKED, fh)) {
-–
+                        f.hash = fh;
-–
+                        synchronized (f) { f.notifyAll(); };
-–
+                    }
+                if (validated) {
+                    if (deleted)
-<
+                        counter.add(-1L);
->
+                        addCount(-1L, -1);
+                    break;
+    /*
-<
+     * Internal versions of the five insertion methods, each a
-<
+     * little more complicated than the last. All have
-<
+     * the same basic structure as the first (internalPut):
->
+     * Internal versions of insertion methods
->
+     * All have the same basic structure as the first (internalPut):
+     *  1. If table uninitialized, create
+     *  2. If bin empty, try to CAS new node
+     *  3. If bin stale, use new table
+     *  4. if bin converted to TreeBin, validate and relay to TreeBin methods
+     *  5. Lock and validate; if valid, scan and add or update
-<
+     * The others interweave other checks and/or alternative actions:
-<
+     *  * Plain put checks for and performs resize after insertion.
-<
+     *  * putIfAbsent prescans for mapping without lock (and fails to add
-<
+     *    if present), which also makes pre-emptive resize checks worthwhile.
-<
+     *  * computeIfAbsent extends form used in putIfAbsent with additional
-<
+     *    mechanics to deal with, calls, potential exceptions and null
-<
+     *    returns from function call.
-<
+     *  * compute uses the same function-call mechanics, but without
-<
+     *    the prescans
-<
+     *  * putAll attempts to pre-allocate enough table space
-<
+     *    and more lazily performs count updates and checks.
-<
+     *
-<
+     * Someday when details settle down a bit more, it might be worth
-<
+     * some factoring to reduce sprawl.
->
+     * The putAll method differs mainly in attempting to pre-allocate
->
+     * enough table space, and also more lazily performs count updates
->
+     * and checks.
->
+     *
->
+     * Most of the function-accepting methods can't be factored nicely
->
+     * because they require different functional forms, so instead
->
+     * sprawl out similar mechanics.
+     */
-<
+    /** Implementation for put */
-<
+    private final Object internalPut(Object k, Object v) {
->
+    /** Implementation for put and putIfAbsent */
->
+    @SuppressWarnings("unchecked") private final V internalPut
->
+        (K k, V v, boolean onlyIfAbsent) {
->
+        if (k == null || v == null) throw new NullPointerException();
+        int h = spread(k.hashCode());
-<
+        int count = 0;
-<
+        for (Node[] tab = table;;) {
-<
+            int i; Node f; int fh; Object fk;
->
+        int len = 0;
->
+        for (Node<V>[] tab = table;;) {
->
+            int i, fh; Node<V> f; Object fk; V fv;
+            if (tab == null)
+                tab = initTable();
+            else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
-<
+                if (casTabAt(tab, i, null, new Node(h, k, v, null)))
->
+                if (casTabAt(tab, i, null, new Node<V>(h, k, v, null)))
+                    break;                   // no lock when adding to empty bin
-<
+            else if ((fh = f.hash) == MOVED) {
->
+            else if ((fh = f.hash) < 0) {
+                if ((fk = f.key) instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
-<
+                    Object oldVal = null;
->
+                    TreeBin<V> t = (TreeBin<V>)fk;
->
+                    V oldVal = null;
+                    t.acquire(0);
+                    try {
+                        if (tabAt(tab, i) == f) {
-<
+                            count = 2;
-<
+                            TreeNode p = t.putTreeNode(h, k, v);
->
+                            len = 2;
->
+                            TreeNode<V> p = t.putTreeNode(h, k, v);
+                            if (p != null) {
+                                oldVal = p.val;
-<
+                                p.val = v;
->
+                                if (!onlyIfAbsent)
->
+                                    p.val = v;
+                    } finally {
+                        t.release(0);
-<
+                    if (count != 0) {
->
+                    if (len != 0) {
+                        if (oldVal != null)
+                            return oldVal;
+                        break;
+                else
-<
+                    tab = (Node[])fk;
->
+                    tab = (Node<V>[])fk;
-<
+            else if ((fh & LOCKED) != 0) {
-<
+                checkForResize();
-<
+                f.tryAwaitLock(tab, i);
-<
+            }
-<
+            else if (f.casHash(fh, fh | LOCKED)) {
-<
+                Object oldVal = null;
-<
+                try {                        // needed in case equals() throws
->
+            else if (onlyIfAbsent && fh == h && (fv = f.val) != null &&
->
+                     ((fk = f.key) == k || k.equals(fk))) // peek while nearby
->
+                return fv;
->
+            else {
->
+                V oldVal = null;
->
+                synchronized (f) {
+                    if (tabAt(tab, i) == f) {
-<
+                        count = 1;
-<
+                        for (Node e = f;; ++count) {
-<
+                            Object ek, ev;
-<
+                            if ((e.hash & HASH_BITS) == h &&
->
+                        len = 1;
->
+                        for (Node<V> e = f;; ++len) {
->
+                            Object ek; V ev;
->
+                            if (e.hash == h &&
+                                (ev = e.val) != null &&
+                                ((ek = e.key) == k || k.equals(ek))) {
+                                oldVal = ev;
-<
+                                e.val = v;
->
+                                if (!onlyIfAbsent)
->
+                                    e.val = v;
+                                break;
-<
+                            Node last = e;
->
+                            Node<V> last = e;
+                            if ((e = e.next) == null) {
-<
+                                last.next = new Node(h, k, v, null);
-<
+                                if (count >= TREE_THRESHOLD)
->
+                                last.next = new Node<V>(h, k, v, null);
->
+                                if (len >= TREE_THRESHOLD)
+                                    replaceWithTreeBin(tab, i, k);
+                                break;
-–
+                } finally {                  // unlock and signal if needed
-–
+                    if (!f.casHash(fh | LOCKED, fh)) {
-–
+                        f.hash = fh;
-–
+                        synchronized (f) { f.notifyAll(); };
-–
+                    }
-<
+                if (count != 0) {
->
+                if (len != 0) {
+                    if (oldVal != null)
+                        return oldVal;
-–
+                    if (tab.length <= 64)
-–
+                        count = 2;
+                    break;
-<
+        counter.add(1L);
-<
+        if (count > 1)
-<
+            checkForResize();
->
+        addCount(1L, len);
+        return null;
-<
+    /** Implementation for putIfAbsent */
-<
+    private final Object internalPutIfAbsent(Object k, Object v) {
->
+    /** Implementation for computeIfAbsent */
->
+    @SuppressWarnings("unchecked") private final V internalComputeIfAbsent
->
+        (K k, Fun<? super K, ? extends V> mf) {
->
+        if (k == null || mf == null)
->
+            throw new NullPointerException();
+        int h = spread(k.hashCode());
-<
+        int count = 0;
-<
+        for (Node[] tab = table;;) {
-<
+            int i; Node f; int fh; Object fk, fv;
->
+        V val = null;
->
+        int len = 0;
->
+        for (Node<V>[] tab = table;;) {
->
+            Node<V> f; int i; Object fk;
+            if (tab == null)
+                tab = initTable();
+            else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
-<
+                if (casTabAt(tab, i, null, new Node(h, k, v, null)))
->
+                Node<V> node = new Node<V>(h, k, null, null);
->
+                synchronized (node) {
->
+                    if (casTabAt(tab, i, null, node)) {
->
+                        len = 1;
->
+                        try {
->
+                            if ((val = mf.apply(k)) != null)
->
+                                node.val = val;
->
+                        } finally {
->
+                            if (val == null)
->
+                                setTabAt(tab, i, null);
->
+                        }
->
+                    }
->
+                }
->
+                if (len != 0)
+                    break;
-<
+            else if ((fh = f.hash) == MOVED) {
->
+            else if (f.hash < 0) {
+                if ((fk = f.key) instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
-<
+                    Object oldVal = null;
->
+                    TreeBin<V> t = (TreeBin<V>)fk;
->
+                    boolean added = false;
+                    t.acquire(0);
+                    try {
+                        if (tabAt(tab, i) == f) {
-<
+                            count = 2;
-<
+                            TreeNode p = t.putTreeNode(h, k, v);
->
+                            len = 1;
->
+                            TreeNode<V> p = t.getTreeNode(h, k, t.root);
+                            if (p != null)
-<
+                                oldVal = p.val;
->
+                                val = p.val;
->
+                            else if ((val = mf.apply(k)) != null) {
->
+                                added = true;
->
+                                len = 2;
->
+                                t.putTreeNode(h, k, val);
->
+                            }
+                    } finally {
+                        t.release(0);
-<
+                    if (count != 0) {
-<
+                        if (oldVal != null)
-<
+                            return oldVal;
->
+                    if (len != 0) {
->
+                        if (!added)
->
+                            return val;
+                        break;
+                else
-<
+                    tab = (Node[])fk;
->
+                    tab = (Node<V>[])fk;
-–
+            else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
-–
+                     ((fk = f.key) == k || k.equals(fk)))
-–
+                return fv;
+            else {
-<
+                Node g = f.next;
-<
+                if (g != null) { // at least 2 nodes -- search and maybe resize
-<
+                    for (Node e = g;;) {
-<
+                        Object ek, ev;
-<
+                        if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
-<
+                            ((ek = e.key) == k || k.equals(ek)))
-<
+                            return ev;
-<
+                        if ((e = e.next) == null) {
-<
+                            checkForResize();
-<
+                            break;
-<
+                        }
-<
+                    }
->
+                for (Node<V> e = f; e != null; e = e.next) { // prescan
->
+                    Object ek; V ev;
->
+                    if (e.hash == h && (ev = e.val) != null &&
->
+                        ((ek = e.key) == k || k.equals(ek)))
->
+                        return ev;
-<
+                if (((fh = f.hash) & LOCKED) != 0) {
-<
+                    checkForResize();
-<
+                    f.tryAwaitLock(tab, i);
-<
+                }
-<
+                else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
-<
+                    Object oldVal = null;
-<
+                    try {
-<
+                        if (tabAt(tab, i) == f) {
-<
+                            count = 1;
-<
+                            for (Node e = f;; ++count) {
-<
+                                Object ek, ev;
-<
+                                if ((e.hash & HASH_BITS) == h &&
-<
+                                    (ev = e.val) != null &&
-<
+                                    ((ek = e.key) == k || k.equals(ek))) {
-<
+                                    oldVal = ev;
-<
+                                    break;
-<
+                                }
-<
+                                Node last = e;
-<
+                                if ((e = e.next) == null) {
-<
+                                    last.next = new Node(h, k, v, null);
-<
+                                    if (count >= TREE_THRESHOLD)
->
+                boolean added = false;
->
+                synchronized (f) {
->
+                    if (tabAt(tab, i) == f) {
->
+                        len = 1;
->
+                        for (Node<V> e = f;; ++len) {
->
+                            Object ek; V ev;
->
+                            if (e.hash == h &&
->
+                                (ev = e.val) != null &&
->
+                                ((ek = e.key) == k || k.equals(ek))) {
->
+                                val = ev;
->
+                                break;
->
+                            }
->
+                            Node<V> last = e;
->
+                            if ((e = e.next) == null) {
->
+                                if ((val = mf.apply(k)) != null) {
->
+                                    added = true;
->
+                                    last.next = new Node<V>(h, k, val, null);
->
+                                    if (len >= TREE_THRESHOLD)
+                                        replaceWithTreeBin(tab, i, k);
-–
+                                    break;
-+
+                                break;
-–
+                    } finally {
-–
+                        if (!f.casHash(fh | LOCKED, fh)) {
-–
+                            f.hash = fh;
-–
+                            synchronized (f) { f.notifyAll(); };
-–
+                        }
-–
+                    }
-–
+                    if (count != 0) {
-–
+                        if (oldVal != null)
-–
+                            return oldVal;
-–
+                        if (tab.length <= 64)
-–
+                            count = 2;
-–
+                        break;
-+
+                if (len != 0) {
-+
+                    if (!added)
-+
+                        return val;
-+
+                    break;
-+
+                }
-<
+        counter.add(1L);
-<
+        if (count > 1)
-<
+            checkForResize();
-<
+        return null;
->
+        if (val != null)
->
+            addCount(1L, len);
->
+        return val;
-<
+    /** Implementation for computeIfAbsent */
-<
+    private final Object internalComputeIfAbsent(K k,
-<
+                                                 MappingFunction<? super K, ?> mf) {
->
+    /** Implementation for compute */
->
+    @SuppressWarnings("unchecked") private final V internalCompute
->
+        (K k, boolean onlyIfPresent,
->
+         BiFun<? super K, ? super V, ? extends V> mf) {
->
+        if (k == null || mf == null)
->
+            throw new NullPointerException();
+        int h = spread(k.hashCode());
-<
+        Object val = null;
-<
+        int count = 0;
-<
+        for (Node[] tab = table;;) {
-<
+            Node f; int i, fh; Object fk, fv;
->
+        V val = null;
->
+        int delta = 0;
->
+        int len = 0;
->
+        for (Node<V>[] tab = table;;) {
->
+            Node<V> f; int i, fh; Object fk;
+            if (tab == null)
+                tab = initTable();
+            else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
-<
+                Node node = new Node(fh = h | LOCKED, k, null, null);
-<
+                if (casTabAt(tab, i, null, node)) {
-<
+                    count = 1;
-<
+                    try {
-<
+                        if ((val = mf.map(k)) != null)
-<
+                            node.val = val;
-<
+                    } finally {
-<
+                        if (val == null)
-<
+                            setTabAt(tab, i, null);
-<
+                        if (!node.casHash(fh, h)) {
-<
+                            node.hash = h;
-<
+                            synchronized (node) { node.notifyAll(); };
->
+                if (onlyIfPresent)
->
+                    break;
->
+                Node<V> node = new Node<V>(h, k, null, null);
->
+                synchronized (node) {
->
+                    if (casTabAt(tab, i, null, node)) {
->
+                        try {
->
+                            len = 1;
->
+                            if ((val = mf.apply(k, null)) != null) {
->
+                                node.val = val;
->
+                                delta = 1;
->
+                            }
->
+                        } finally {
->
+                            if (delta == 0)
->
+                                setTabAt(tab, i, null);
-<
+                if (count != 0)
->
+                if (len != 0)
+                    break;
-<
+            else if ((fh = f.hash) == MOVED) {
->
+            else if ((fh = f.hash) < 0) {
+                if ((fk = f.key) instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
-<
+                    boolean added = false;
->
+                    TreeBin<V> t = (TreeBin<V>)fk;
+                    t.acquire(0);
+                    try {
+                        if (tabAt(tab, i) == f) {
-<
+                            count = 1;
-<
+                            TreeNode p = t.getTreeNode(h, k, t.root);
-<
+                            if (p != null)
-<
+                                val = p.val;
-<
+                            else if ((val = mf.map(k)) != null) {
-<
+                                added = true;
-<
+                                count = 2;
-<
+                                t.putTreeNode(h, k, val);
->
+                            len = 1;
->
+                            TreeNode<V> p = t.getTreeNode(h, k, t.root);
->
+                            if (p == null && onlyIfPresent)
->
+                                break;
->
+                            V pv = (p == null) ? null : p.val;
->
+                            if ((val = mf.apply(k, pv)) != null) {
->
+                                if (p != null)
->
+                                    p.val = val;
->
+                                else {
->
+                                    len = 2;
->
+                                    delta = 1;
->
+                                    t.putTreeNode(h, k, val);
->
+                                }
->
+                            }
->
+                            else if (p != null) {
->
+                                delta = -1;
->
+                                t.deleteTreeNode(p);
+                    } finally {
+                        t.release(0);
-<
+                    if (count != 0) {
-<
+                        if (!added)
-<
+                            return val;
->
+                    if (len != 0)
+                        break;
-–
+                    }
+                else
-<
+                    tab = (Node[])fk;
->
+                    tab = (Node<V>[])fk;
-–
+            else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
-–
+                     ((fk = f.key) == k || k.equals(fk)))
-–
+                return fv;
+            else {
-<
+                Node g = f.next;
-<
+                if (g != null) {
-<
+                    for (Node e = g;;) {
-<
+                        Object ek, ev;
-<
+                        if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
-<
+                            ((ek = e.key) == k || k.equals(ek)))
-<
+                            return ev;
-<
+                        if ((e = e.next) == null) {
-<
+                            checkForResize();
-<
+                            break;
-<
+                        }
-<
+                    }
-<
+                }
-<
+                if (((fh = f.hash) & LOCKED) != 0) {
-<
+                    checkForResize();
-<
+                    f.tryAwaitLock(tab, i);
-<
+                }
-<
+                else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
-<
+                    boolean added = false;
-<
+                    try {
-<
+                        if (tabAt(tab, i) == f) {
-<
+                            count = 1;
-<
+                            for (Node e = f;; ++count) {
-<
+                                Object ek, ev;
-<
+                                if ((e.hash & HASH_BITS) == h &&
-<
+                                    (ev = e.val) != null &&
-<
+                                    ((ek = e.key) == k || k.equals(ek))) {
-<
+                                    val = ev;
-<
+                                    break;
->
+                synchronized (f) {
->
+                    if (tabAt(tab, i) == f) {
->
+                        len = 1;
->
+                        for (Node<V> e = f, pred = null;; ++len) {
->
+                            Object ek; V ev;
->
+                            if (e.hash == h &&
->
+                                (ev = e.val) != null &&
->
+                                ((ek = e.key) == k || k.equals(ek))) {
->
+                                val = mf.apply(k, ev);
->
+                                if (val != null)
->
+                                    e.val = val;
->
+                                else {
->
+                                    delta = -1;
->
+                                    Node<V> en = e.next;
->
+                                    if (pred != null)
->
+                                        pred.next = en;
->
+                                    else
->
+                                        setTabAt(tab, i, en);
-<
+                                Node last = e;
-<
+                                if ((e = e.next) == null) {
-<
+                                    if ((val = mf.map(k)) != null) {
-<
+                                        added = true;
-<
+                                        last.next = new Node(h, k, val, null);
-<
+                                        if (count >= TREE_THRESHOLD)
-<
+                                            replaceWithTreeBin(tab, i, k);
-<
+                                    }
-<
+                                    break;
->
+                                break;
->
+                            }
->
+                            pred = e;
->
+                            if ((e = e.next) == null) {
->
+                                if (!onlyIfPresent &&
->
+                                    (val = mf.apply(k, null)) != null) {
->
+                                    pred.next = new Node<V>(h, k, val, null);
->
+                                    delta = 1;
->
+                                    if (len >= TREE_THRESHOLD)
->
+                                        replaceWithTreeBin(tab, i, k);
-+
+                                break;
-–
+                    } finally {
-–
+                        if (!f.casHash(fh | LOCKED, fh)) {
-–
+                            f.hash = fh;
-–
+                            synchronized (f) { f.notifyAll(); };
-–
+                        }
-–
+                    }
-–
+                    if (count != 0) {
-–
+                        if (!added)
-–
+                            return val;
-–
+                        if (tab.length <= 64)
-–
+                            count = 2;
-–
+                        break;
-+
+                if (len != 0)
-+
+                    break;
-<
+        if (val == null)
-<
+            throw new NullPointerException();
-<
+        counter.add(1L);
-<
+        if (count > 1)
-<
+            checkForResize();
->
+        if (delta != 0)
->
+            addCount((long)delta, len);
+        return val;
-<
+    /** Implementation for compute */
-<
+    @SuppressWarnings("unchecked")
-<
+    private final Object internalCompute(K k,
-<
+                                         RemappingFunction<? super K, V> mf) {
->
+    /** Implementation for merge */
->
+    @SuppressWarnings("unchecked") private final V internalMerge
->
+        (K k, V v, BiFun<? super V, ? super V, ? extends V> mf) {
->
+        if (k == null || v == null || mf == null)
->
+            throw new NullPointerException();
+        int h = spread(k.hashCode());
-<
+        Object val = null;
-<
+        boolean added = false;
-<
+        int count = 0;
-<
+        for (Node[] tab = table;;) {
-<
+            Node f; int i, fh; Object fk;
->
+        V val = null;
->
+        int delta = 0;
->
+        int len = 0;
->
+        for (Node<V>[] tab = table;;) {
->
+            int i; Node<V> f; Object fk; V fv;
+            if (tab == null)
+                tab = initTable();
+            else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
-<
+                Node node = new Node(fh = h | LOCKED, k, null, null);
-<
+                if (casTabAt(tab, i, null, node)) {
-<
+                    try {
-<
+                        count = 1;
-<
+                        if ((val = mf.remap(k, null)) != null) {
-<
+                            node.val = val;
-<
+                            added = true;
-<
+                        }
-<
+                    } finally {
-<
+                        if (!added)
-<
+                            setTabAt(tab, i, null);
-<
+                        if (!node.casHash(fh, h)) {
-<
+                            node.hash = h;
-<
+                            synchronized (node) { node.notifyAll(); };
-<
+                        }
-<
+                    }
-<
+                }
-<
+                if (count != 0)
->
+                if (casTabAt(tab, i, null, new Node<V>(h, k, v, null))) {
->
+                    delta = 1;
->
+                    val = v;
+                    break;
-+
+                }
-<
+            else if ((fh = f.hash) == MOVED) {
->
+            else if (f.hash < 0) {
+                if ((fk = f.key) instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
->
+                    TreeBin<V> t = (TreeBin<V>)fk;
+                    t.acquire(0);
+                    try {
+                        if (tabAt(tab, i) == f) {
-<
+                            count = 1;
-<
+                            TreeNode p = t.getTreeNode(h, k, t.root);
-<
+                            Object pv = (p == null)? null : p.val;
-<
+                            if ((val = mf.remap(k, (V)pv)) != null) {
->
+                            len = 1;
->
+                            TreeNode<V> p = t.getTreeNode(h, k, t.root);
->
+                            val = (p == null) ? v : mf.apply(p.val, v);
->
+                            if (val != null) {
+                                if (p != null)
+                                    p.val = val;
+                                else {
-<
+                                    count = 2;
-<
+                                    added = true;
->
+                                    len = 2;
->
+                                    delta = 1;
+                                    t.putTreeNode(h, k, val);
-+
+                            else if (p != null) {
-+
+                                delta = -1;
-+
+                                t.deleteTreeNode(p);
-+
+                            }
+                    } finally {
+                        t.release(0);
-<
+                    if (count != 0)
->
+                    if (len != 0)
+                        break;
+                else
-<
+                    tab = (Node[])fk;
->
+                    tab = (Node<V>[])fk;
-<
+            else if ((fh & LOCKED) != 0) {
-<
+                checkForResize();
-<
+                f.tryAwaitLock(tab, i);
-<
+            }
-<
+            else if (f.casHash(fh, fh | LOCKED)) {
-<
+                try {
->
+            else {
->
+                synchronized (f) {
+                    if (tabAt(tab, i) == f) {
-<
+                        count = 1;
-<
+                        for (Node e = f;; ++count) {
-<
+                            Object ek, ev;
-<
+                            if ((e.hash & HASH_BITS) == h &&
->
+                        len = 1;
->
+                        for (Node<V> e = f, pred = null;; ++len) {
->
+                            Object ek; V ev;
->
+                            if (e.hash == h &&
+                                (ev = e.val) != null &&
+                                ((ek = e.key) == k || k.equals(ek))) {
-<
+                                val = mf.remap(k, (V)ev);
->
+                                val = mf.apply(ev, v);
+                                if (val != null)
+                                    e.val = val;
-+
+                                else {
-+
+                                    delta = -1;
-+
+                                    Node<V> en = e.next;
-+
+                                    if (pred != null)
-+
+                                        pred.next = en;
-+
+                                    else
-+
+                                        setTabAt(tab, i, en);
-+
+                                }
+                                break;
-<
+                            Node last = e;
->
+                            pred = e;
+                            if ((e = e.next) == null) {
-<
+                                if ((val = mf.remap(k, null)) != null) {
-<
+                                    last.next = new Node(h, k, val, null);
-<
+                                    added = true;
-<
+                                    if (count >= TREE_THRESHOLD)
-<
+                                        replaceWithTreeBin(tab, i, k);
-<
+                                }
->
+                                val = v;
->
+                                pred.next = new Node<V>(h, k, val, null);
->
+                                delta = 1;
->
+                                if (len >= TREE_THRESHOLD)
->
+                                    replaceWithTreeBin(tab, i, k);
+                                break;
-–
+                } finally {
-–
+                    if (!f.casHash(fh | LOCKED, fh)) {
-–
+                        f.hash = fh;
-–
+                        synchronized (f) { f.notifyAll(); };
-–
+                    }
-<
+                if (count != 0) {
-<
+                    if (tab.length <= 64)
-<
+                        count = 2;
->
+                if (len != 0)
+                    break;
-–
+                }
-<
+        if (val == null)
-<
+            throw new NullPointerException();
-<
+        if (added) {
-<
+            counter.add(1L);
-<
+            if (count > 1)
-<
+                checkForResize();
-<
+        }
->
+        if (delta != 0)
->
+            addCount((long)delta, len);
+        return val;
+    /** Implementation for putAll */
-<
+    private final void internalPutAll(Map<?, ?> m) {
->
+    @SuppressWarnings("unchecked") private final void internalPutAll
->
+        (Map<? extends K, ? extends V> m) {
+        tryPresize(m.size());
+        long delta = 0L;     // number of uncommitted additions
+        boolean npe = false; // to throw exception on exit for nulls
+        try {                // to clean up counts on other exceptions
-<
+            for (Map.Entry<?, ?> entry : m.entrySet()) {
-<
+                Object k, v;
->
+            for (Map.Entry<?, ? extends V> entry : m.entrySet()) {
->
+                Object k; V v;
+                if (entry == null || (k = entry.getKey()) == null ||
+                    (v = entry.getValue()) == null) {
+                    npe = true;
+                    break;
+                int h = spread(k.hashCode());
-<
+                for (Node[] tab = table;;) {
-<
+                    int i; Node f; int fh; Object fk;
->
+                for (Node<V>[] tab = table;;) {
->
+                    int i; Node<V> f; int fh; Object fk;
+                    if (tab == null)
+                        tab = initTable();
+                    else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){
-<
+                        if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
->
+                        if (casTabAt(tab, i, null, new Node<V>(h, k, v, null))) {
+                            ++delta;
+                            break;
-<
+                    else if ((fh = f.hash) == MOVED) {
->
+                    else if ((fh = f.hash) < 0) {
+                        if ((fk = f.key) instanceof TreeBin) {
-<
+                            TreeBin t = (TreeBin)fk;
->
+                            TreeBin<V> t = (TreeBin<V>)fk;
+                            boolean validated = false;
+                            t.acquire(0);
+                            try {
+                                if (tabAt(tab, i) == f) {
+                                    validated = true;
-<
+                                    TreeNode p = t.getTreeNode(h, k, t.root);
->
+                                    TreeNode<V> p = t.getTreeNode(h, k, t.root);
+                                    if (p != null)
+                                        p.val = v;
+                                    else {
+                                break;
+                        else
-<
+                            tab = (Node[])fk;
-<
+                    }
-<
+                    else if ((fh & LOCKED) != 0) {
-<
+                        counter.add(delta);
-<
+                        delta = 0L;
-<
+                        checkForResize();
-<
+                        f.tryAwaitLock(tab, i);
->
+                            tab = (Node<V>[])fk;
-<
+                    else if (f.casHash(fh, fh | LOCKED)) {
-<
+                        int count = 0;
-<
+                        try {
->
+                    else {
->
+                        int len = 0;
->
+                        synchronized (f) {
+                            if (tabAt(tab, i) == f) {
-<
+                                count = 1;
-<
+                                for (Node e = f;; ++count) {
-<
+                                    Object ek, ev;
-<
+                                    if ((e.hash & HASH_BITS) == h &&
->
+                                len = 1;
->
+                                for (Node<V> e = f;; ++len) {
->
+                                    Object ek; V ev;
->
+                                    if (e.hash == h &&
+                                        (ev = e.val) != null &&
+                                        ((ek = e.key) == k || k.equals(ek))) {
+                                        e.val = v;
+                                        break;
-<
+                                    Node last = e;
->
+                                    Node<V> last = e;
+                                    if ((e = e.next) == null) {
+                                        ++delta;
-<
+                                        last.next = new Node(h, k, v, null);
-<
+                                        if (count >= TREE_THRESHOLD)
->
+                                        last.next = new Node<V>(h, k, v, null);
->
+                                        if (len >= TREE_THRESHOLD)
+                                            replaceWithTreeBin(tab, i, k);
+                                        break;
-–
+                        } finally {
-–
+                            if (!f.casHash(fh | LOCKED, fh)) {
-–
+                                f.hash = fh;
-–
+                                synchronized (f) { f.notifyAll(); };
-–
+                            }
-<
+                        if (count != 0) {
-<
+                            if (count > 1) {
-<
+                                counter.add(delta);
-<
+                                delta = 0L;
-<
+                                checkForResize();
-<
+                            }
->
+                        if (len != 0) {
->
+                            if (len > 1)
->
+                                addCount(delta, len);
+                            break;
+        } finally {
-<
+            if (delta != 0)
-<
+                counter.add(delta);
->
+            if (delta != 0L)
->
+                addCount(delta, 2);
+        if (npe)
+            throw new NullPointerException();
-+
+    /**
-+
+     * Implementation for clear. Steps through each bin, removing all
-+
+     * nodes.
-+
+     */
-+
+    @SuppressWarnings("unchecked") private final void internalClear() {
-+
+        long delta = 0L; // negative number of deletions
-+
+        int i = 0;
-+
+        Node<V>[] tab = table;
-+
+        while (tab != null && i < tab.length) {
-+
+            Node<V> f = tabAt(tab, i);
-+
+            if (f == null)
-+
+                ++i;
-+
+            else if (f.hash < 0) {
-+
+                Object fk;
-+
+                if ((fk = f.key) instanceof TreeBin) {
-+
+                    TreeBin<V> t = (TreeBin<V>)fk;
-+
+                    t.acquire(0);
-+
+                    try {
-+
+                        if (tabAt(tab, i) == f) {
-+
+                            for (Node<V> p = t.first; p != null; p = p.next) {
-+
+                                if (p.val != null) { // (currently always true)
-+
+                                    p.val = null;
-+
+                                    --delta;
-+
+                                }
-+
+                            }
-+
+                            t.first = null;
-+
+                            t.root = null;
-+
+                            ++i;
-+
+                        }
-+
+                    } finally {
-+
+                        t.release(0);
-+
+                    }
-+
+                }
-+
+                else
-+
+                    tab = (Node<V>[])fk;
-+
+            }
-+
+            else {
-+
+                synchronized (f) {
-+
+                    if (tabAt(tab, i) == f) {
-+
+                        for (Node<V> e = f; e != null; e = e.next) {
-+
+                            if (e.val != null) {  // (currently always true)
-+
+                                e.val = null;
-+
+                                --delta;
-+
+                            }
-+
+                        }
-+
+                        setTabAt(tab, i, null);
-+
+                        ++i;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+        if (delta != 0L)
-+
+            addCount(delta, -1);
-+
+    }
-+
+    /* ---------------- Table Initialization and Resizing -------------- */
+    /**
+    /**
+     * Initializes table, using the size recorded in sizeCtl.
+     */
-<
+    private final Node[] initTable() {
-<
+        Node[] tab; int sc;
->
+    @SuppressWarnings("unchecked") private final Node<V>[] initTable() {
->
+        Node<V>[] tab; int sc;
+        while ((tab = table) == null) {
+            if ((sc = sizeCtl) < 0)
+                Thread.yield(); // lost initialization race; just spin
-<
+            else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
->
+            else if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
+                try {
+                    if ((tab = table) == null) {
+                        int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
-<
+                        tab = table = new Node[n];
->
+                        @SuppressWarnings("rawtypes") Node[] tb = new Node[n];
->
+                        table = tab = (Node<V>[])tb;
+                        sc = n - (n >>> 2);
+                } finally {
+    /**
-<
+     * If table is too small and not already resizing, creates next
-<
+     * table and transfers bins.  Rechecks occupancy after a transfer
-<
+     * to see if another resize is already needed because resizings
-<
+     * are lagging additions.
-<
+     */
-<
+    private final void checkForResize() {
-<
+        Node[] tab; int n, sc;
-<
+        while ((tab = table) != null &&
-<
+               (n = tab.length) < MAXIMUM_CAPACITY &&
-<
+               (sc = sizeCtl) >= 0 && counter.sum() >= (long)sc &&
-<
+               UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
-<
+            try {
-<
+                if (tab == table) {
-<
+                    table = rebuild(tab);
-<
+                    sc = (n << 1) - (n >>> 1);
->
+     * Adds to count, and if table is too small and not already
->
+     * resizing, initiates transfer. If already resizing, helps
->
+     * perform transfer if work is available.  Rechecks occupancy
->
+     * after a transfer to see if another resize is already needed
->
+     * because resizings are lagging additions.
->
+     *
->
+     * @param x the count to add
->
+     * @param check if <0, don't check resize, if <= 1 only check if uncontended
->
+     */
->
+    private final void addCount(long x, int check) {
->
+        CounterCell[] as; long b, s;
->
+        if ((as = counterCells) != null ||
->
+            !U.compareAndSwapLong(this, BASECOUNT, b = baseCount, s = b + x)) {
->
+            CounterHashCode hc; CounterCell a; long v; int m;
->
+            boolean uncontended = true;
->
+            if ((hc = threadCounterHashCode.get()) == null ||
->
+                as == null || (m = as.length - 1) < 0 ||
->
+                (a = as[m & hc.code]) == null ||
->
+                !(uncontended =
->
+                  U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))) {
->
+                fullAddCount(x, hc, uncontended);
->
+                return;
->
+            }
->
+            if (check <= 1)
->
+                return;
->
+            s = sumCount();
->
+        }
->
+        if (check >= 0) {
->
+            Node<V>[] tab, nt; int sc;
->
+            while (s >= (long)(sc = sizeCtl) && (tab = table) != null &&
->
+                   tab.length < MAXIMUM_CAPACITY) {
->
+                if (sc < 0) {
->
+                    if (sc == -1 || transferIndex <= transferOrigin ||
->
+                        (nt = nextTable) == null)
->
+                        break;
->
+                    if (U.compareAndSwapInt(this, SIZECTL, sc, sc - 1))
->
+                        transfer(tab, nt);
-<
+            } finally {
-<
+                sizeCtl = sc;
->
+                else if (U.compareAndSwapInt(this, SIZECTL, sc, -2))
->
+                    transfer(tab, null);
->
+                s = sumCount();
+     * @param size number of elements (doesn't need to be perfectly accurate)
+     */
-<
+    private final void tryPresize(int size) {
->
+    @SuppressWarnings("unchecked") private final void tryPresize(int size) {
+        int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
+            tableSizeFor(size + (size >>> 1) + 1);
+        int sc;
+        while ((sc = sizeCtl) >= 0) {
-<
+            Node[] tab = table; int n;
->
+            Node<V>[] tab = table; int n;
+            if (tab == null || (n = tab.length) == 0) {
+                n = (sc > c) ? sc : c;
-<
+                if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
->
+                if (U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
+                    try {
+                        if (table == tab) {
-<
+                            table = new Node[n];
->
+                            @SuppressWarnings("rawtypes") Node[] tb = new Node[n];
->
+                            table = (Node<V>[])tb;
+                            sc = n - (n >>> 2);
+                    } finally {
+            else if (c <= sc || n >= MAXIMUM_CAPACITY)
+                break;
-<
+            else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
-<
+                try {
-<
+                    if (table == tab) {
-<
+                        table = rebuild(tab);
-<
+                        sc = (n << 1) - (n >>> 1);
-<
+                    }
-<
+                } finally {
-<
+                    sizeCtl = sc;
-<
+                }
-<
+            }
->
+            else if (tab == table &&
->
+                     U.compareAndSwapInt(this, SIZECTL, sc, -2))
->
+                transfer(tab, null);
+    /*
+     * Moves and/or copies the nodes in each bin to new table. See
+     * above for explanation.
-–
+     *
-–
+     * @return the new table
+     */
-<
+    private static final Node[] rebuild(Node[] tab) {
-<
+        int n = tab.length;
-<
+        Node[] nextTab = new Node[n << 1];
-<
+        Node fwd = new Node(MOVED, nextTab, null, null);
-<
+        int[] buffer = null;       // holds bins to revisit; null until needed
-<
+        Node rev = null;           // reverse forwarder; null until needed
-<
+        int nbuffered = 0;         // the number of bins in buffer list
-<
+        int bufferIndex = 0;       // buffer index of current buffered bin
-<
+        int bin = n - 1;           // current non-buffered bin or -1 if none
-<
-<
+        for (int i = bin;;) {      // start upwards sweep
-<
+            int fh; Node f;
-<
+            if ((f = tabAt(tab, i)) == null) {
-<
+                if (bin >= 0) {    // no lock needed (or available)
-<
+                    if (!casTabAt(tab, i, f, fwd))
-<
+                        continue;
-<
+                }
-<
+                else {             // transiently use a locked forwarding node
-<
+                    Node g = new Node(MOVED|LOCKED, nextTab, null, null);
-<
+                    if (!casTabAt(tab, i, f, g))
-<
+                        continue;
->
+    @SuppressWarnings("unchecked") private final void transfer
->
+        (Node<V>[] tab, Node<V>[] nextTab) {
->
+        int n = tab.length, stride;
->
+        if ((stride = (NCPU > 1) ? (n >>> 3) / NCPU : n) < MIN_TRANSFER_STRIDE)
->
+            stride = MIN_TRANSFER_STRIDE; // subdivide range
->
+        if (nextTab == null) {            // initiating
->
+            try {
->
+                @SuppressWarnings("rawtypes") Node[] tb = new Node[n << 1];
->
+                nextTab = (Node<V>[])tb;
->
+            } catch (Throwable ex) {      // try to cope with OOME
->
+                sizeCtl = Integer.MAX_VALUE;
->
+                return;
->
+            }
->
+            nextTable = nextTab;
->
+            transferOrigin = n;
->
+            transferIndex = n;
->
+            Node<V> rev = new Node<V>(MOVED, tab, null, null);
->
+            for (int k = n; k > 0;) {    // progressively reveal ready slots
->
+                int nextk = (k > stride) ? k - stride : 0;
->
+                for (int m = nextk; m < k; ++m)
->
+                    nextTab[m] = rev;
->
+                for (int m = n + nextk; m < n + k; ++m)
->
+                    nextTab[m] = rev;
->
+                U.putOrderedInt(this, TRANSFERORIGIN, k = nextk);
->
+            }
->
+        }
->
+        int nextn = nextTab.length;
->
+        Node<V> fwd = new Node<V>(MOVED, nextTab, null, null);
->
+        boolean advance = true;
->
+        for (int i = 0, bound = 0;;) {
->
+            int nextIndex, nextBound; Node<V> f; Object fk;
->
+            while (advance) {
->
+                if (--i >= bound)
->
+                    advance = false;
->
+                else if ((nextIndex = transferIndex) <= transferOrigin) {
->
+                    i = -1;
->
+                    advance = false;
->
+                }
->
+                else if (U.compareAndSwapInt
->
+                         (this, TRANSFERINDEX, nextIndex,
->
+                          nextBound = (nextIndex > stride ?
->
+                                       nextIndex - stride : 0))) {
->
+                    bound = nextBound;
->
+                    i = nextIndex - 1;
->
+                    advance = false;
->
+                }
->
+            }
->
+            if (i < 0 || i >= n || i + n >= nextn) {
->
+                for (int sc;;) {
->
+                    if (U.compareAndSwapInt(this, SIZECTL, sc = sizeCtl, ++sc)) {
->
+                        if (sc == -1) {
->
+                            nextTable = null;
->
+                            table = nextTab;
->
+                            sizeCtl = (n << 1) - (n >>> 1);
->
+                        }
->
+                        return;
->
+                    }
->
+                }
->
+            }
->
+            else if ((f = tabAt(tab, i)) == null) {
->
+                if (casTabAt(tab, i, null, fwd)) {
+                    setTabAt(nextTab, i, null);
+                    setTabAt(nextTab, i + n, null);
-<
+                    setTabAt(tab, i, fwd);
-<
+                    if (!g.casHash(MOVED|LOCKED, MOVED)) {
-<
+                        g.hash = MOVED;
-<
+                        synchronized (g) { g.notifyAll(); }
-<
+                    }
->
+                    advance = true;
-<
+            else if ((fh = f.hash) == MOVED) {
-<
+                Object fk = f.key;
-<
+                if (fk instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
-<
+                    boolean validated = false;
-<
+                    t.acquire(0);
-<
+                    try {
-<
+                        if (tabAt(tab, i) == f) {
-<
+                            validated = true;
-<
+                            splitTreeBin(nextTab, i, t);
-<
+                            setTabAt(tab, i, fwd);
->
+            else if (f.hash >= 0) {
->
+                synchronized (f) {
->
+                    if (tabAt(tab, i) == f) {
->
+                        int runBit = f.hash & n;
->
+                        Node<V> lastRun = f, lo = null, hi = null;
->
+                        for (Node<V> p = f.next; p != null; p = p.next) {
->
+                            int b = p.hash & n;
->
+                            if (b != runBit) {
->
+                                runBit = b;
->
+                                lastRun = p;
->
+                            }
-<
+                    } finally {
-<
+                        t.release(0);
->
+                        if (runBit == 0)
->
+                            lo = lastRun;
->
+                        else
->
+                            hi = lastRun;
->
+                        for (Node<V> p = f; p != lastRun; p = p.next) {
->
+                            int ph = p.hash;
->
+                            Object pk = p.key; V pv = p.val;
->
+                            if ((ph & n) == 0)
->
+                                lo = new Node<V>(ph, pk, pv, lo);
->
+                            else
->
+                                hi = new Node<V>(ph, pk, pv, hi);
->
+                        }
->
+                        setTabAt(nextTab, i, lo);
->
+                        setTabAt(nextTab, i + n, hi);
->
+                        setTabAt(tab, i, fwd);
->
+                        advance = true;
-–
+                    if (!validated)
-–
+                        continue;
-<
+            else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) {
-<
+                boolean validated = false;
-<
+                try {              // split to lo and hi lists; copying as needed
->
+            else if ((fk = f.key) instanceof TreeBin) {
->
+                TreeBin<V> t = (TreeBin<V>)fk;
->
+                t.acquire(0);
->
+                try {
+                    if (tabAt(tab, i) == f) {
-<
+                        validated = true;
-<
+                        splitBin(nextTab, i, f);
->
+                        TreeBin<V> lt = new TreeBin<V>();
->
+                        TreeBin<V> ht = new TreeBin<V>();
->
+                        int lc = 0, hc = 0;
->
+                        for (Node<V> e = t.first; e != null; e = e.next) {
->
+                            int h = e.hash;
->
+                            Object k = e.key; V v = e.val;
->
+                            if ((h & n) == 0) {
->
+                                ++lc;
->
+                                lt.putTreeNode(h, k, v);
->
+                            }
->
+                            else {
->
+                                ++hc;
->
+                                ht.putTreeNode(h, k, v);
->
+                            }
->
+                        }
->
+                        Node<V> ln, hn; // throw away trees if too small
->
+                        if (lc < TREE_THRESHOLD) {
->
+                            ln = null;
->
+                            for (Node<V> p = lt.first; p != null; p = p.next)
->
+                                ln = new Node<V>(p.hash, p.key, p.val, ln);
->
+                        }
->
+                        else
->
+                            ln = new Node<V>(MOVED, lt, null, null);
->
+                        setTabAt(nextTab, i, ln);
->
+                        if (hc < TREE_THRESHOLD) {
->
+                            hn = null;
->
+                            for (Node<V> p = ht.first; p != null; p = p.next)
->
+                                hn = new Node<V>(p.hash, p.key, p.val, hn);
->
+                        }
->
+                        else
->
+                            hn = new Node<V>(MOVED, ht, null, null);
->
+                        setTabAt(nextTab, i + n, hn);
+                        setTabAt(tab, i, fwd);
-+
+                        advance = true;
+                } finally {
-<
+                    if (!f.casHash(fh | LOCKED, fh)) {
-<
+                        f.hash = fh;
-<
+                        synchronized (f) { f.notifyAll(); };
-<
+                    }
->
+                    t.release(0);
-–
+                if (!validated)
-–
+                    continue;
-–
+            }
-–
+            else {
-–
+                if (buffer == null) // initialize buffer for revisits
-–
+                    buffer = new int[TRANSFER_BUFFER_SIZE];
-–
+                if (bin < 0 && bufferIndex > 0) {
-–
+                    int j = buffer[--bufferIndex];
-–
+                    buffer[bufferIndex] = i;
-–
+                    i = j;         // swap with another bin
-–
+                    continue;
-–
+                }
-–
+                if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) {
-–
+                    f.tryAwaitLock(tab, i);
-–
+                    continue;      // no other options -- block
-–
+                }
-–
+                if (rev == null)   // initialize reverse-forwarder
-–
+                    rev = new Node(MOVED, tab, null, null);
-–
+                if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0)
-–
+                    continue;      // recheck before adding to list
-–
+                buffer[nbuffered++] = i;
-–
+                setTabAt(nextTab, i, rev);     // install place-holders
-–
+                setTabAt(nextTab, i + n, rev);
-–
+            }
-–
-–
+            if (bin > 0)
-–
+                i = --bin;
-–
+            else if (buffer != null && nbuffered > 0) {
-–
+                bin = -1;
-–
+                i = buffer[bufferIndex = --nbuffered];
+            else
-<
+                return nextTab;
->
+                advance = true; // already processed
-<
+    /**
-<
+     * Split a normal bin with list headed by e into lo and hi parts;
-<
+     * install in given table
-<
+     */
-<
+    private static void splitBin(Node[] nextTab, int i, Node e) {
-<
+        int bit = nextTab.length >>> 1; // bit to split on
-<
+        int runBit = e.hash & bit;
-<
+        Node lastRun = e, lo = null, hi = null;
-<
+        for (Node p = e.next; p != null; p = p.next) {
-<
+            int b = p.hash & bit;
-<
+            if (b != runBit) {
-<
+                runBit = b;
-<
+                lastRun = p;
->
+    /* ---------------- Counter support -------------- */
->
->
+    final long sumCount() {
->
+        CounterCell[] as = counterCells; CounterCell a;
->
+        long sum = baseCount;
->
+        if (as != null) {
->
+            for (int i = 0; i < as.length; ++i) {
->
+                if ((a = as[i]) != null)
->
+                    sum += a.value;
-<
+        if (runBit == 0)
-<
+            lo = lastRun;
-<
+        else
-<
+            hi = lastRun;
-<
+        for (Node p = e; p != lastRun; p = p.next) {
-<
+            int ph = p.hash & HASH_BITS;
-<
+            Object pk = p.key, pv = p.val;
-<
+            if ((ph & bit) == 0)
-<
+                lo = new Node(ph, pk, pv, lo);
-<
+            else
-<
+                hi = new Node(ph, pk, pv, hi);
-<
+        }
-<
+        setTabAt(nextTab, i, lo);
-<
+        setTabAt(nextTab, i + bit, hi);
->
+        return sum;
-<
+    /**
-<
+     * Split a tree bin into lo and hi parts; install in given table
-<
+     */
-<
+    private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) {
-<
+        int bit = nextTab.length >>> 1;
-<
+        TreeBin lt = new TreeBin();
-<
+        TreeBin ht = new TreeBin();
-<
+        int lc = 0, hc = 0;
-<
+        for (Node e = t.first; e != null; e = e.next) {
-<
+            int h = e.hash & HASH_BITS;
-<
+            Object k = e.key, v = e.val;
-<
+            if ((h & bit) == 0) {
-<
+                ++lc;
-<
+                lt.putTreeNode(h, k, v);
-<
+            }
-<
+            else {
-<
+                ++hc;
-<
+                ht.putTreeNode(h, k, v);
-<
+            }
-<
+        }
-<
+        Node ln, hn; // throw away trees if too small
-<
+        if (lc <= (TREE_THRESHOLD >>> 1)) {
-<
+            ln = null;
-<
+            for (Node p = lt.first; p != null; p = p.next)
-<
+                ln = new Node(p.hash, p.key, p.val, ln);
->
+    // See LongAdder version for explanation
->
+    private final void fullAddCount(long x, CounterHashCode hc,
->
+                                    boolean wasUncontended) {
->
+        int h;
->
+        if (hc == null) {
->
+            hc = new CounterHashCode();
->
+            int s = counterHashCodeGenerator.addAndGet(SEED_INCREMENT);
->
+            h = hc.code = (s == 0) ? 1 : s; // Avoid zero
->
+            threadCounterHashCode.set(hc);
+        else
-<
+            ln = new Node(MOVED, lt, null, null);
-<
+        setTabAt(nextTab, i, ln);
-<
+        if (hc <= (TREE_THRESHOLD >>> 1)) {
-<
+            hn = null;
-<
+            for (Node p = ht.first; p != null; p = p.next)
-<
+                hn = new Node(p.hash, p.key, p.val, hn);
-<
+        }
-<
+        else
-<
+            hn = new Node(MOVED, ht, null, null);
-<
+        setTabAt(nextTab, i + bit, hn);
-<
+    }
-<
-<
+    /**
-<
+     * Implementation for clear. Steps through each bin, removing all
-<
+     * nodes.
-<
+     */
-<
+    private final void internalClear() {
-<
+        long delta = 0L; // negative number of deletions
-<
+        int i = 0;
-<
+        Node[] tab = table;
-<
+        while (tab != null && i < tab.length) {
-<
+            int fh; Object fk;
-<
+            Node f = tabAt(tab, i);
-<
+            if (f == null)
-<
+                ++i;
-<
+            else if ((fh = f.hash) == MOVED) {
-<
+                if ((fk = f.key) instanceof TreeBin) {
-<
+                    TreeBin t = (TreeBin)fk;
-<
+                    t.acquire(0);
-<
+                    try {
-<
+                        if (tabAt(tab, i) == f) {
-<
+                            for (Node p = t.first; p != null; p = p.next) {
-<
+                                p.val = null;
-<
+                                --delta;
->
+            h = hc.code;
->
+        boolean collide = false;                // True if last slot nonempty
->
+        for (;;) {
->
+            CounterCell[] as; CounterCell a; int n; long v;
->
+            if ((as = counterCells) != null && (n = as.length) > 0) {
->
+                if ((a = as[(n - 1) & h]) == null) {
->
+                    if (counterBusy == 0) {            // Try to attach new Cell
->
+                        CounterCell r = new CounterCell(x); // Optimistic create
->
+                        if (counterBusy == 0 &&
->
+                            U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
->
+                            boolean created = false;
->
+                            try {               // Recheck under lock
->
+                                CounterCell[] rs; int m, j;
->
+                                if ((rs = counterCells) != null &&
->
+                                    (m = rs.length) > 0 &&
->
+                                    rs[j = (m - 1) & h] == null) {
->
+                                    rs[j] = r;
->
+                                    created = true;
->
+                                }
->
+                            } finally {
->
+                                counterBusy = 0;
-<
+                            t.first = null;
-<
+                            t.root = null;
-<
+                            ++i;
->
+                            if (created)
->
+                                break;
->
+                            continue;           // Slot is now non-empty
-–
+                    } finally {
-–
+                        t.release(0);
-+
+                    collide = false;
-<
+                else
-<
+                    tab = (Node[])fk;
-<
+            }
-<
+            else if ((fh & LOCKED) != 0) {
-<
+                counter.add(delta); // opportunistically update count
-<
+                delta = 0L;
-<
+                f.tryAwaitLock(tab, i);
-<
+            }
-<
+            else if (f.casHash(fh, fh | LOCKED)) {
-<
+                try {
-<
+                    if (tabAt(tab, i) == f) {
-<
+                        for (Node e = f; e != null; e = e.next) {
-<
+                            e.val = null;
-<
+                            --delta;
->
+                else if (!wasUncontended)       // CAS already known to fail
->
+                    wasUncontended = true;      // Continue after rehash
->
+                else if (U.compareAndSwapLong(a, CELLVALUE, v = a.value, v + x))
->
+                    break;
->
+                else if (counterCells != as || n >= NCPU)
->
+                    collide = false;            // At max size or stale
->
+                else if (!collide)
->
+                    collide = true;
->
+                else if (counterBusy == 0 &&
->
+                         U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
->
+                    try {
->
+                        if (counterCells == as) {// Expand table unless stale
->
+                            CounterCell[] rs = new CounterCell[n << 1];
->
+                            for (int i = 0; i < n; ++i)
->
+                                rs[i] = as[i];
->
+                            counterCells = rs;
-<
+                        setTabAt(tab, i, null);
-<
+                        ++i;
->
+                    } finally {
->
+                        counterBusy = 0;
-<
+                } finally {
-<
+                    if (!f.casHash(fh | LOCKED, fh)) {
-<
+                        f.hash = fh;
-<
+                        synchronized (f) { f.notifyAll(); };
->
+                    collide = false;
->
+                    continue;                   // Retry with expanded table
->
+                }
->
+                h ^= h << 13;                   // Rehash
->
+                h ^= h >>> 17;
->
+                h ^= h << 5;
->
+            }
->
+            else if (counterBusy == 0 && counterCells == as &&
->
+                     U.compareAndSwapInt(this, COUNTERBUSY, 0, 1)) {
->
+                boolean init = false;
->
+                try {                           // Initialize table
->
+                    if (counterCells == as) {
->
+                        CounterCell[] rs = new CounterCell[2];
->
+                        rs[h & 1] = new CounterCell(x);
->
+                        counterCells = rs;
->
+                        init = true;
-+
+                } finally {
-+
+                    counterBusy = 0;
-+
+                if (init)
-+
+                    break;
-+
+            else if (U.compareAndSwapLong(this, BASECOUNT, v = baseCount, v + x))
-+
+                break;                          // Fall back on using base
-<
+        if (delta != 0)
-<
+            counter.add(delta);
->
+        hc.code = h;                            // Record index for next time
+    /* ----------------Table Traversal -------------- */
+    /**
+     * Encapsulates traversal for methods such as containsValue; also
-<
+     * serves as a base class for other iterators.
->
+     * serves as a base class for other iterators and bulk tasks.
+     * At each step, the iterator snapshots the key ("nextKey") and
+     * value ("nextVal") of a valid node (i.e., one that, at point of
+     * change (including to null, indicating deletion), field nextVal
+     * might not be accurate at point of use, but still maintains the
+     * weak consistency property of holding a value that was once
-<
+     * valid.
->
+     * valid. To support iterator.remove, the nextKey field is not
->
+     * updated (nulled out) when the iterator cannot advance.
+     * Internal traversals directly access these fields, as in:
-<
+     * {@code while (it.next != null) { process(it.nextKey); it.advance(); }}
->
+     * {@code while (it.advance() != null) { process(it.nextKey); }}
-<
+     * Exported iterators (subclasses of ViewIterator) extract key,
-<
+     * value, or key-value pairs as return values of Iterator.next(),
-<
+     * and encapsulate the it.next check as hasNext();
->
+     * Exported iterators must track whether the iterator has advanced
->
+     * (in hasNext vs next) (by setting/checking/nulling field
->
+     * nextVal), and then extract key, value, or key-value pairs as
->
+     * return values of next().
+     * The iterator visits once each still-valid node that was
+     * reachable upon iterator construction. It might miss some that
+     * across threads, iteration terminates if a bounds checks fails
+     * for a table read.
-<
+     * The range-based constructor enables creation of parallel
-<
+     * range-splitting traversals. (Not yet implemented.)
->
+     * This class extends CountedCompleter to streamline parallel
->
+     * iteration in bulk operations. This adds only a few fields of
->
+     * space overhead, which is small enough in cases where it is not
->
+     * needed to not worry about it.  Because CountedCompleter is
->
+     * Serializable, but iterators need not be, we need to add warning
->
+     * suppressions.
+     */
-<
+    static class InternalIterator {
-<
+        Node next;           // the next entry to use
-<
+        Node last;           // the last entry used
->
+    @SuppressWarnings("serial") static class Traverser<K,V,R>
->
+        extends CountedCompleter<R> {
->
+        final ConcurrentHashMapV8<K, V> map;
->
+        Node<V> next;        // the next entry to use
+        Object nextKey;      // cached key field of next
-<
+        Object nextVal;      // cached val field of next
-<
+        Node[] tab;          // current table; updated if resized
->
+        V nextVal;           // cached val field of next
->
+        Node<V>[] tab;       // current table; updated if resized
+        int index;           // index of bin to use next
+        int baseIndex;       // current index of initial table
-<
+        final int baseLimit; // index bound for initial table
-<
+        final int baseSize;  // initial table size
->
+        int baseLimit;       // index bound for initial table
->
+        int baseSize;        // initial table size
->
+        int batch;           // split control
+        /** Creates iterator for all entries in the table. */
-<
+        InternalIterator(Node[] tab) {
-<
+            this.tab = tab;
-<
+            baseLimit = baseSize = (tab == null) ? 0 : tab.length;
-<
+            index = baseIndex = 0;
-<
+            next = null;
-<
+            advance();
-<
+        }
-<
-<
+        /** Creates iterator for the given range of the table */
-<
+        InternalIterator(Node[] tab, int lo, int hi) {
-<
+            this.tab = tab;
-<
+            baseSize = (tab == null) ? 0 : tab.length;
-<
+            baseLimit = (hi <= baseSize) ? hi : baseSize;
-<
+            index = baseIndex = (lo >= 0) ? lo : 0;
-<
+            next = null;
-<
+            advance();
-<
+        }
-<
-<
+        /** Advances next. See above for explanation. */
-<
+        final void advance() {
-<
+            Node e = last = next;
->
+        Traverser(ConcurrentHashMapV8<K, V> map) {
->
+            this.map = map;
->
+        }
->
->
+        /** Creates iterator for split() methods and task constructors */
->
+        Traverser(ConcurrentHashMapV8<K,V> map, Traverser<K,V,?> it, int batch) {
->
+            super(it);
->
+            this.batch = batch;
->
+            if ((this.map = map) != null && it != null) { // split parent
->
+                Node<V>[] t;
->
+                if ((t = it.tab) == null &&
->
+                    (t = it.tab = map.table) != null)
->
+                    it.baseLimit = it.baseSize = t.length;
->
+                this.tab = t;
->
+                this.baseSize = it.baseSize;
->
+                int hi = this.baseLimit = it.baseLimit;
->
+                it.baseLimit = this.index = this.baseIndex =
->
+                    (hi + it.baseIndex + 1) >>> 1;
->
+            }
->
+        }
->
->
+        /**
->
+         * Advances next; returns nextVal or null if terminated.
->
+         * See above for explanation.
->
+         */
->
+        @SuppressWarnings("unchecked") final V advance() {
->
+            Node<V> e = next;
->
+            V ev = null;
+            outer: do {
+                if (e != null)                  // advance past used/skipped node
+                    e = e.next;
+                while (e == null) {             // get to next non-null bin
-<
+                    Node[] t; int b, i, n; Object ek; // checks must use locals
-<
+                    if ((b = baseIndex) >= baseLimit || (i = index) < 0 ||
-<
+                        (t = tab) == null || i >= (n = t.length))
->
+                    ConcurrentHashMapV8<K, V> m;
->
+                    Node<V>[] t; int b, i, n; Object ek; //  must use locals
->
+                    if ((t = tab) != null)
->
+                        n = t.length;
->
+                    else if ((m = map) != null && (t = tab = m.table) != null)
->
+                        n = baseLimit = baseSize = t.length;
->
+                    else
->
+                        break outer;
->
+                    if ((b = baseIndex) >= baseLimit ||
->
+                        (i = index) < 0 || i >= n)
+                        break outer;
-<
+                    else if ((e = tabAt(t, i)) != null && e.hash == MOVED) {
->
+                    if ((e = tabAt(t, i)) != null && e.hash < 0) {
+                        if ((ek = e.key) instanceof TreeBin)
-<
+                            e = ((TreeBin)ek).first;
->
+                            e = ((TreeBin<V>)ek).first;
+                        else {
-<
+                            tab = (Node[])ek;
->
+                            tab = (Node<V>[])ek;
+                            continue;           // restarts due to null val
+                    }                           // visit upper slots if present
+                    index = (i += baseSize) < n ? i : (baseIndex = b + 1);
+                nextKey = e.key;
-<
+            } while ((nextVal = e.val) == null);// skip deleted or special nodes
->
+            } while ((ev = e.val) == null);    // skip deleted or special nodes
+            next = e;
-+
+            return nextVal = ev;
-+
+        }
-+
-+
+        public final void remove() {
-+
+            Object k = nextKey;
-+
+            if (k == null && (advance() == null || (k = nextKey) == null))
-+
+                throw new IllegalStateException();
-+
+            map.internalReplace(k, null, null);
-+
+        }
-+
-+
+        public final boolean hasNext() {
-+
+            return nextVal != null || advance() != null;
-+
-+
+        public final boolean hasMoreElements() { return hasNext(); }
-+
-+
+        public void compute() { } // default no-op CountedCompleter body
-+
-+
+        /**
-+
+         * Returns a batch value > 0 if this task should (and must) be
-+
+         * split, if so, adding to pending count, and in any case
-+
+         * updating batch value. The initial batch value is approx
-+
+         * exp2 of the number of times (minus one) to split task by
-+
+         * two before executing leaf action. This value is faster to
-+
+         * compute and more convenient to use as a guide to splitting
-+
+         * than is the depth, since it is used while dividing by two
-+
+         * anyway.
-+
+         */
-+
+        final int preSplit() {
-+
+            ConcurrentHashMapV8<K, V> m; int b; Node<V>[] t;  ForkJoinPool pool;
-+
+            if ((b = batch) < 0 && (m = map) != null) { // force initialization
-+
+                if ((t = tab) == null && (t = tab = m.table) != null)
-+
+                    baseLimit = baseSize = t.length;
-+
+                if (t != null) {
-+
+                    long n = m.sumCount();
-+
+                    int par = ((pool = getPool()) == null) ?
-+
+                        ForkJoinPool.getCommonPoolParallelism() :
-+
+                        pool.getParallelism();
-+
+                    int sp = par << 3; // slack of 8
-+
+                    b = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp;
-+
+                }
-+
+            }
-+
+            b = (b <= 1 || baseIndex == baseLimit) ? 0 : (b >>> 1);
-+
+            if ((batch = b) > 0)
-+
+                addToPendingCount(1);
-+
+            return b;
-+
+        }
-+
+    /* ---------------- Public operations -------------- */
+    /**
-<
+     * Creates a new, empty map with the default initial table size (16),
->
+     * Creates a new, empty map with the default initial table size (16).
+     */
+    public ConcurrentHashMapV8() {
-–
+        this.counter = new LongAdder();
+    /**
+        int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
+                   MAXIMUM_CAPACITY :
+                   tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
-–
+        this.counter = new LongAdder();
+        this.sizeCtl = cap;
+     * @param m the map
+     */
+    public ConcurrentHashMapV8(Map<? extends K, ? extends V> m) {
-–
+        this.counter = new LongAdder();
+        this.sizeCtl = DEFAULT_CAPACITY;
+        internalPutAll(m);
+        if (initialCapacity < concurrencyLevel)   // Use at least as many bins
+            initialCapacity = concurrencyLevel;   // as estimated threads
+        long size = (long)(1.0 + (long)initialCapacity / loadFactor);
-<
+        int cap = ((size >= (long)MAXIMUM_CAPACITY) ?
-<
+                   MAXIMUM_CAPACITY: tableSizeFor((int)size));
-<
+        this.counter = new LongAdder();
->
+        int cap = (size >= (long)MAXIMUM_CAPACITY) ?
->
+            MAXIMUM_CAPACITY : tableSizeFor((int)size);
+        this.sizeCtl = cap;
+    /**
-+
+     * Creates a new {@link Set} backed by a ConcurrentHashMapV8
-+
+     * from the given type to {@code Boolean.TRUE}.
-+
+     *
-+
+     * @return the new set
-+
+     */
-+
+    public static <K> KeySetView<K,Boolean> newKeySet() {
-+
+        return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(),
-+
+                                      Boolean.TRUE);
-+
+    }
-+
-+
+    /**
-+
+     * Creates a new {@link Set} backed by a ConcurrentHashMapV8
-+
+     * from the given type to {@code Boolean.TRUE}.
-+
+     *
-+
+     * @param initialCapacity The implementation performs internal
-+
+     * sizing to accommodate this many elements.
-+
+     * @throws IllegalArgumentException if the initial capacity of
-+
+     * elements is negative
-+
+     * @return the new set
-+
+     */
-+
+    public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) {
-+
+        return new KeySetView<K,Boolean>
-+
+            (new ConcurrentHashMapV8<K,Boolean>(initialCapacity), Boolean.TRUE);
-+
+    }
-+
-+
+    /**
+     * {@inheritDoc}
+     */
+    public boolean isEmpty() {
-<
+        return counter.sum() <= 0L; // ignore transient negative values
->
+        return sumCount() <= 0L; // ignore transient negative values
+    /**
+     * {@inheritDoc}
+     */
+    public int size() {
-<
+        long n = counter.sum();
->
+        long n = sumCount();
+        return ((n < 0L) ? 0 :
+                (n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
+                (int)n);
-<
+    final long longSize() { // accurate version of size needed for views
-<
+        long n = counter.sum();
-<
+        return (n < 0L) ? 0L : n;
->
+    /**
->
+     * Returns the number of mappings. This method should be used
->
+     * instead of {@link #size} because a ConcurrentHashMapV8 may
->
+     * contain more mappings than can be represented as an int. The
->
+     * value returned is an estimate; the actual count may differ if
->
+     * there are concurrent insertions or removals.
->
+     *
->
+     * @return the number of mappings
->
+     */
->
+    public long mappingCount() {
->
+        long n = sumCount();
->
+        return (n < 0L) ? 0L : n; // ignore transient negative values
+    /**
+     * @throws NullPointerException if the specified key is null
+     */
-–
+    @SuppressWarnings("unchecked")
+    public V get(Object key) {
-<
+        if (key == null)
-<
+            throw new NullPointerException();
-<
+        return (V)internalGet(key);
->
+        return internalGet(key);
->
+    }
->
->
+    /**
->
+     * Returns the value to which the specified key is mapped,
->
+     * or the given defaultValue if this map contains no mapping for the key.
->
+     *
->
+     * @param key the key
->
+     * @param defaultValue the value to return if this map contains
->
+     * no mapping for the given key
->
+     * @return the mapping for the key, if present; else the defaultValue
->
+     * @throws NullPointerException if the specified key is null
->
+     */
->
+    public V getValueOrDefault(Object key, V defaultValue) {
->
+        V v;
->
+        return (v = internalGet(key)) == null ? defaultValue : v;
+    /**
+     * @throws NullPointerException if the specified key is null
+     */
+    public boolean containsKey(Object key) {
-–
+        if (key == null)
-–
+            throw new NullPointerException();
+        return internalGet(key) != null;
+    public boolean containsValue(Object value) {
+        if (value == null)
+            throw new NullPointerException();
-<
+        Object v;
-<
+        InternalIterator it = new InternalIterator(table);
-<
+        while (it.next != null) {
-<
+            if ((v = it.nextVal) == value || value.equals(v))
->
+        V v;
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        while ((v = it.advance()) != null) {
->
+            if (v == value || value.equals(v))
+                return true;
-–
+            it.advance();
+        return false;
+     *         {@code false} otherwise
+     * @throws NullPointerException if the specified value is null
+     */
-<
+    public boolean contains(Object value) {
->
+    @Deprecated public boolean contains(Object value) {
+        return containsValue(value);
+     * Maps the specified key to the specified value in this table.
+     * Neither the key nor the value can be null.
-<
+     * <p> The value can be retrieved by calling the {@code get} method
->
+     * <p>The value can be retrieved by calling the {@code get} method
+     * with a key that is equal to the original key.
+     * @param key key with which the specified value is to be associated
+     *         {@code null} if there was no mapping for {@code key}
+     * @throws NullPointerException if the specified key or value is null
+     */
-–
+    @SuppressWarnings("unchecked")
+    public V put(K key, V value) {
-<
+        if (key == null || value == null)
-<
+            throw new NullPointerException();
-<
+        return (V)internalPut(key, value);
->
+        return internalPut(key, value, false);
+    /**
+     *         or {@code null} if there was no mapping for the key
+     * @throws NullPointerException if the specified key or value is null
+     */
-–
+    @SuppressWarnings("unchecked")
+    public V putIfAbsent(K key, V value) {
-<
+        if (key == null || value == null)
-<
+            throw new NullPointerException();
-<
+        return (V)internalPutIfAbsent(key, value);
->
+        return internalPut(key, value, true);
+    /**
+    /**
+     * If the specified key is not already associated with a value,
-<
+     * computes its value using the given mappingFunction and
-<
+     * enters it into the map.  This is equivalent to
->
+     * computes its value using the given mappingFunction and enters
->
+     * it into the map unless null.  This is equivalent to
+     * <pre> {@code
+     * if (map.containsKey(key))
+     *   return map.get(key);
-<
+     * value = mappingFunction.map(key);
-<
+     * map.put(key, value);
->
+     * value = mappingFunction.apply(key);
->
+     * if (value != null)
->
+     *   map.put(key, value);
+     * return value;}</pre>
+     * except that the action is performed atomically.  If the
-<
+     * function returns {@code null} (in which case a {@code
-<
+     * NullPointerException} is thrown), or the function itself throws
-<
+     * an (unchecked) exception, the exception is rethrown to its
-<
+     * caller, and no mapping is recorded.  Some attempted update
-<
+     * operations on this map by other threads may be blocked while
-<
+     * computation is in progress, so the computation should be short
-<
+     * and simple, and must not attempt to update any other mappings
-<
+     * of this Map. The most appropriate usage is to construct a new
-<
+     * object serving as an initial mapped value, or memoized result,
-<
+     * as in:
->
+     * function returns {@code null} no mapping is recorded. If the
->
+     * function itself throws an (unchecked) exception, the exception
->
+     * is rethrown to its caller, and no mapping is recorded.  Some
->
+     * attempted update operations on this map by other threads may be
->
+     * blocked while computation is in progress, so the computation
->
+     * should be short and simple, and must not attempt to update any
->
+     * other mappings of this Map. The most appropriate usage is to
->
+     * construct a new object serving as an initial mapped value, or
->
+     * memoized result, as in:
+     *  <pre> {@code
-<
+     * map.computeIfAbsent(key, new MappingFunction<K, V>() {
->
+     * map.computeIfAbsent(key, new Fun<K, V>() {
+     *   public V map(K k) { return new Value(f(k)); }});}</pre>
+     * @param key key with which the specified value is to be associated
+     * @param mappingFunction the function to compute a value
+     * @return the current (existing or computed) value associated with
-<
+     *         the specified key.
-<
+     * @throws NullPointerException if the specified key, mappingFunction,
-<
+     *         or computed value is null
->
+     *         the specified key, or null if the computed value is null
->
+     * @throws NullPointerException if the specified key or mappingFunction
->
+     *         is null
+     * @throws IllegalStateException if the computation detectably
+     *         attempts a recursive update to this map that would
+     *         otherwise never complete
+     * @throws RuntimeException or Error if the mappingFunction does so,
+     *         in which case the mapping is left unestablished
+     */
-<
+    @SuppressWarnings("unchecked")
-<
+    public V computeIfAbsent(K key, MappingFunction<? super K, ? extends V> mappingFunction) {
-<
+        if (key == null || mappingFunction == null)
-<
+            throw new NullPointerException();
-<
+        return (V)internalComputeIfAbsent(key, mappingFunction);
->
+    public V computeIfAbsent
->
+        (K key, Fun<? super K, ? extends V> mappingFunction) {
->
+        return internalComputeIfAbsent(key, mappingFunction);
->
+    }
->
->
+    /**
->
+     * If the given key is present, computes a new mapping value given a key and
->
+     * its current mapped value. This is equivalent to
->
+     *  <pre> {@code
->
+     *   if (map.containsKey(key)) {
->
+     *     value = remappingFunction.apply(key, map.get(key));
->
+     *     if (value != null)
->
+     *       map.put(key, value);
->
+     *     else
->
+     *       map.remove(key);
->
+     *   }
->
+     * }</pre>
->
+     *
->
+     * except that the action is performed atomically.  If the
->
+     * function returns {@code null}, the mapping is removed.  If the
->
+     * function itself throws an (unchecked) exception, the exception
->
+     * is rethrown to its caller, and the current mapping is left
->
+     * unchanged.  Some attempted update operations on this map by
->
+     * other threads may be blocked while computation is in progress,
->
+     * so the computation should be short and simple, and must not
->
+     * attempt to update any other mappings of this Map. For example,
->
+     * to either create or append new messages to a value mapping:
->
+     *
->
+     * @param key key with which the specified value is to be associated
->
+     * @param remappingFunction the function to compute a value
->
+     * @return the new value associated with the specified key, or null if none
->
+     * @throws NullPointerException if the specified key or remappingFunction
->
+     *         is null
->
+     * @throws IllegalStateException if the computation detectably
->
+     *         attempts a recursive update to this map that would
->
+     *         otherwise never complete
->
+     * @throws RuntimeException or Error if the remappingFunction does so,
->
+     *         in which case the mapping is unchanged
->
+     */
->
+    public V computeIfPresent
->
+        (K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
->
+        return internalCompute(key, true, remappingFunction);
+    /**
-<
+     * Computes and enters a new mapping value given a key and
->
+     * Computes a new mapping value given a key and
+     * its current mapped value (or {@code null} if there is no current
+     * mapping). This is equivalent to
+     *  <pre> {@code
-<
+     *  map.put(key, remappingFunction.remap(key, map.get(key));
->
+     *   value = remappingFunction.apply(key, map.get(key));
->
+     *   if (value != null)
->
+     *     map.put(key, value);
->
+     *   else
->
+     *     map.remove(key);
+     * }</pre>
+     * except that the action is performed atomically.  If the
-<
+     * function returns {@code null} (in which case a {@code
-<
+     * NullPointerException} is thrown), or the function itself throws
-<
+     * an (unchecked) exception, the exception is rethrown to its
-<
+     * caller, and current mapping is left unchanged.  Some attempted
-<
+     * update operations on this map by other threads may be blocked
-<
+     * while computation is in progress, so the computation should be
-<
+     * short and simple, and must not attempt to update any other
-<
+     * mappings of this Map. For example, to either create or
-<
+     * append new messages to a value mapping:
->
+     * function returns {@code null}, the mapping is removed.  If the
->
+     * function itself throws an (unchecked) exception, the exception
->
+     * is rethrown to its caller, and the current mapping is left
->
+     * unchanged.  Some attempted update operations on this map by
->
+     * other threads may be blocked while computation is in progress,
->
+     * so the computation should be short and simple, and must not
->
+     * attempt to update any other mappings of this Map. For example,
->
+     * to either create or append new messages to a value mapping:
+     * <pre> {@code
+     * Map<Key, String> map = ...;
+     * final String msg = ...;
-<
+     * map.compute(key, new RemappingFunction<Key, String>() {
-<
+     *   public String remap(Key k, String v) {
->
+     * map.compute(key, new BiFun<Key, String, String>() {
->
+     *   public String apply(Key k, String v) {
+     *    return (v == null) ? msg : v + msg;});}}</pre>
+     * @param key key with which the specified value is to be associated
+     * @param remappingFunction the function to compute a value
-<
+     * @return the new value associated with
-<
+     *         the specified key.
->
+     * @return the new value associated with the specified key, or null if none
+     * @throws NullPointerException if the specified key or remappingFunction
-<
+     *         or computed value is null
->
+     *         is null
+     * @throws IllegalStateException if the computation detectably
+     *         attempts a recursive update to this map that would
+     *         otherwise never complete
+     * @throws RuntimeException or Error if the remappingFunction does so,
+     *         in which case the mapping is unchanged
+     */
-<
+    @SuppressWarnings("unchecked")
-<
+    public V compute(K key, RemappingFunction<? super K, V> remappingFunction) {
-<
+        if (key == null || remappingFunction == null)
-<
+            throw new NullPointerException();
-<
+        return (V)internalCompute(key, remappingFunction);
->
+    public V compute
->
+        (K key, BiFun<? super K, ? super V, ? extends V> remappingFunction) {
->
+        return internalCompute(key, false, remappingFunction);
->
+    }
->
->
+    /**
->
+     * If the specified key is not already associated
->
+     * with a value, associate it with the given value.
->
+     * Otherwise, replace the value with the results of
->
+     * the given remapping function. This is equivalent to:
->
+     *  <pre> {@code
->
+     *   if (!map.containsKey(key))
->
+     *     map.put(value);
->
+     *   else {
->
+     *     newValue = remappingFunction.apply(map.get(key), value);
->
+     *     if (value != null)
->
+     *       map.put(key, value);
->
+     *     else
->
+     *       map.remove(key);
->
+     *   }
->
+     * }</pre>
->
+     * except that the action is performed atomically.  If the
->
+     * function returns {@code null}, the mapping is removed.  If the
->
+     * function itself throws an (unchecked) exception, the exception
->
+     * is rethrown to its caller, and the current mapping is left
->
+     * unchanged.  Some attempted update operations on this map by
->
+     * other threads may be blocked while computation is in progress,
->
+     * so the computation should be short and simple, and must not
->
+     * attempt to update any other mappings of this Map.
->
+     */
->
+    public V merge
->
+        (K key, V value,
->
+         BiFun<? super V, ? super V, ? extends V> remappingFunction) {
->
+        return internalMerge(key, value, remappingFunction);
+    /**
+     *         {@code null} if there was no mapping for {@code key}
+     * @throws NullPointerException if the specified key is null
+     */
-–
+    @SuppressWarnings("unchecked")
+    public V remove(Object key) {
-<
+        if (key == null)
-<
+            throw new NullPointerException();
-<
+        return (V)internalReplace(key, null, null);
->
+        return internalReplace(key, null, null);
+    /**
+     * @throws NullPointerException if the specified key is null
+     */
+    public boolean remove(Object key, Object value) {
-<
+        if (key == null)
-<
+            throw new NullPointerException();
-<
+        if (value == null)
-<
+            return false;
-<
+        return internalReplace(key, null, value) != null;
->
+        return value != null && internalReplace(key, null, value) != null;
+    /**
+     *         or {@code null} if there was no mapping for the key
+     * @throws NullPointerException if the specified key or value is null
+     */
-–
+    @SuppressWarnings("unchecked")
+    public V replace(K key, V value) {
+        if (key == null || value == null)
+            throw new NullPointerException();
-<
+        return (V)internalReplace(key, value, null);
->
+        return internalReplace(key, value, null);
+    /**
+    /**
+     * Returns a {@link Set} view of the keys contained in this map.
+     * The set is backed by the map, so changes to the map are
-<
+     * reflected in the set, and vice-versa.  The set supports element
-<
+     * removal, which removes the corresponding mapping from this map,
-<
+     * via the {@code Iterator.remove}, {@code Set.remove},
-<
+     * {@code removeAll}, {@code retainAll}, and {@code clear}
-<
+     * operations.  It does not support the {@code add} or
-<
+     * {@code addAll} operations.
->
+     * reflected in the set, and vice-versa.
-<
+     * <p>The view's {@code iterator} is a "weakly consistent" iterator
-<
+     * that will never throw {@link ConcurrentModificationException},
-<
+     * and guarantees to traverse elements as they existed upon
-<
+     * construction of the iterator, and may (but is not guaranteed to)
-<
+     * reflect any modifications subsequent to construction.
->
+     * @return the set view
+     */
-<
+    public Set<K> keySet() {
-<
+        KeySet<K,V> ks = keySet;
-<
+        return (ks != null) ? ks : (keySet = new KeySet<K,V>(this));
->
+    public KeySetView<K,V> keySet() {
->
+        KeySetView<K,V> ks = keySet;
->
+        return (ks != null) ? ks : (keySet = new KeySetView<K,V>(this, null));
->
+    }
->
->
+    /**
->
+     * Returns a {@link Set} view of the keys in this map, using the
->
+     * given common mapped value for any additions (i.e., {@link
->
+     * Collection#add} and {@link Collection#addAll}). This is of
->
+     * course only appropriate if it is acceptable to use the same
->
+     * value for all additions from this view.
->
+     *
->
+     * @param mappedValue the mapped value to use for any
->
+     * additions.
->
+     * @return the set view
->
+     * @throws NullPointerException if the mappedValue is null
->
+     */
->
+    public KeySetView<K,V> keySet(V mappedValue) {
->
+        if (mappedValue == null)
->
+            throw new NullPointerException();
->
+        return new KeySetView<K,V>(this, mappedValue);
+    /**
+     * Returns a {@link Collection} view of the values contained in this map.
+     * The collection is backed by the map, so changes to the map are
-<
+     * reflected in the collection, and vice-versa.  The collection
-<
+     * supports element removal, which removes the corresponding
-<
+     * mapping from this map, via the {@code Iterator.remove},
-<
+     * {@code Collection.remove}, {@code removeAll},
-<
+     * {@code retainAll}, and {@code clear} operations.  It does not
-<
+     * support the {@code add} or {@code addAll} operations.
-<
+     *
-<
+     * <p>The view's {@code iterator} is a "weakly consistent" iterator
-<
+     * that will never throw {@link ConcurrentModificationException},
-<
+     * and guarantees to traverse elements as they existed upon
-<
+     * construction of the iterator, and may (but is not guaranteed to)
-<
+     * reflect any modifications subsequent to construction.
->
+     * reflected in the collection, and vice-versa.
+     */
-<
+    public Collection<V> values() {
-<
+        Values<K,V> vs = values;
-<
+        return (vs != null) ? vs : (values = new Values<K,V>(this));
->
+    public ValuesView<K,V> values() {
->
+        ValuesView<K,V> vs = values;
->
+        return (vs != null) ? vs : (values = new ValuesView<K,V>(this));
+    /**
+     * reflect any modifications subsequent to construction.
+     */
+    public Set<Map.Entry<K,V>> entrySet() {
-<
+        EntrySet<K,V> es = entrySet;
-<
+        return (es != null) ? es : (entrySet = new EntrySet<K,V>(this));
->
+        EntrySetView<K,V> es = entrySet;
->
+        return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this));
+    /**
+    /**
-+
+     * Returns a partitionable iterator of the keys in this map.
-+
+     *
-+
+     * @return a partitionable iterator of the keys in this map
-+
+     */
-+
+    public Spliterator<K> keySpliterator() {
-+
+        return new KeyIterator<K,V>(this);
-+
+    }
-+
-+
+    /**
-+
+     * Returns a partitionable iterator of the values in this map.
-+
+     *
-+
+     * @return a partitionable iterator of the values in this map
-+
+     */
-+
+    public Spliterator<V> valueSpliterator() {
-+
+        return new ValueIterator<K,V>(this);
-+
+    }
-+
-+
+    /**
-+
+     * Returns a partitionable iterator of the entries in this map.
-+
+     *
-+
+     * @return a partitionable iterator of the entries in this map
-+
+     */
-+
+    public Spliterator<Map.Entry<K,V>> entrySpliterator() {
-+
+        return new EntryIterator<K,V>(this);
-+
+    }
-+
-+
+    /**
+     * Returns the hash code value for this {@link Map}, i.e.,
+     * the sum of, for each key-value pair in the map,
+     * {@code key.hashCode() ^ value.hashCode()}.
+     */
+    public int hashCode() {
+        int h = 0;
-<
+        InternalIterator it = new InternalIterator(table);
-<
+        while (it.next != null) {
-<
+            h += it.nextKey.hashCode() ^ it.nextVal.hashCode();
-<
+            it.advance();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v;
->
+        while ((v = it.advance()) != null) {
->
+            h += it.nextKey.hashCode() ^ v.hashCode();
+        return h;
+     * @return a string representation of this map
+     */
+    public String toString() {
-<
+        InternalIterator it = new InternalIterator(table);
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
+        StringBuilder sb = new StringBuilder();
+        sb.append('{');
-<
+        if (it.next != null) {
->
+        V v;
->
+        if ((v = it.advance()) != null) {
+            for (;;) {
-<
+                Object k = it.nextKey, v = it.nextVal;
->
+                Object k = it.nextKey;
+                sb.append(k == this ? "(this Map)" : k);
+                sb.append('=');
+                sb.append(v == this ? "(this Map)" : v);
-<
+                it.advance();
-<
+                if (it.next == null)
->
+                if ((v = it.advance()) == null)
+                    break;
+                sb.append(',').append(' ');
+            if (!(o instanceof Map))
+                return false;
+            Map<?,?> m = (Map<?,?>) o;
-<
+            InternalIterator it = new InternalIterator(table);
-<
+            while (it.next != null) {
-<
+                Object val = it.nextVal;
->
+            Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+            V val;
->
+            while ((val = it.advance()) != null) {
+                Object v = m.get(it.nextKey);
+                if (v == null || (v != val && !v.equals(val)))
+                    return false;
-–
+                it.advance();
+            for (Map.Entry<?,?> e : m.entrySet()) {
+                Object mk, mv, v;
+    /* ----------------Iterators -------------- */
-<
+    /**
-<
+     * Base class for key, value, and entry iterators.  Adds a map
-<
+     * reference to InternalIterator to support Iterator.remove.
-<
+     */
-<
+    static abstract class ViewIterator<K,V> extends InternalIterator {
-<
+        final ConcurrentHashMapV8<K, V> map;
-<
+        ViewIterator(ConcurrentHashMapV8<K, V> map) {
-<
+            super(map.table);
-<
+            this.map = map;
->
+    @SuppressWarnings("serial") static final class KeyIterator<K,V>
->
+        extends Traverser<K,V,Object>
->
+        implements Spliterator<K>, Enumeration<K> {
->
+        KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
->
+        KeyIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
->
+            super(map, it, -1);
-<
-<
+        public final void remove() {
-<
+            if (last == null)
->
+        public KeyIterator<K,V> split() {
->
+            if (nextKey != null)
+                throw new IllegalStateException();
-<
+            map.remove(last.key);
-<
+            last = null;
->
+            return new KeyIterator<K,V>(map, this);
-<
-<
+        public final boolean hasNext()         { return next != null; }
-<
+        public final boolean hasMoreElements() { return next != null; }
-<
+    }
-<
-<
+    static final class KeyIterator<K,V> extends ViewIterator<K,V>
-<
+        implements Iterator<K>, Enumeration<K> {
-<
+        KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
-<
-<
+        @SuppressWarnings("unchecked")
-<
+        public final K next() {
-<
+            if (next == null)
->
+        @SuppressWarnings("unchecked") public final K next() {
->
+            if (nextVal == null && advance() == null)
+                throw new NoSuchElementException();
+            Object k = nextKey;
-<
+            advance();
-<
+            return (K)k;
->
+            nextVal = null;
->
+            return (K) k;
+        public final K nextElement() { return next(); }
-<
+    static final class ValueIterator<K,V> extends ViewIterator<K,V>
-<
+        implements Iterator<V>, Enumeration<V> {
->
+    @SuppressWarnings("serial") static final class ValueIterator<K,V>
->
+        extends Traverser<K,V,Object>
->
+        implements Spliterator<V>, Enumeration<V> {
+        ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
-+
+        ValueIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
-+
+            super(map, it, -1);
-+
+        }
-+
+        public ValueIterator<K,V> split() {
-+
+            if (nextKey != null)
-+
+                throw new IllegalStateException();
-+
+            return new ValueIterator<K,V>(map, this);
-+
+        }
-–
+        @SuppressWarnings("unchecked")
+        public final V next() {
-<
+            if (next == null)
->
+            V v;
->
+            if ((v = nextVal) == null && (v = advance()) == null)
+                throw new NoSuchElementException();
-<
+            Object v = nextVal;
-<
+            advance();
-<
+            return (V)v;
->
+            nextVal = null;
->
+            return v;
+        public final V nextElement() { return next(); }
-<
+    static final class EntryIterator<K,V> extends ViewIterator<K,V>
-<
+        implements Iterator<Map.Entry<K,V>> {
->
+    @SuppressWarnings("serial") static final class EntryIterator<K,V>
->
+        extends Traverser<K,V,Object>
->
+        implements Spliterator<Map.Entry<K,V>> {
+        EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
-<
-<
+        @SuppressWarnings("unchecked")
-<
+        public final Map.Entry<K,V> next() {
-<
+            if (next == null)
-<
+                throw new NoSuchElementException();
-<
+            Object k = nextKey;
-<
+            Object v = nextVal;
-<
+            advance();
-<
+            return new WriteThroughEntry<K,V>((K)k, (V)v, map);
->
+        EntryIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) {
->
+            super(map, it, -1);
->
+        }
->
+        public EntryIterator<K,V> split() {
->
+            if (nextKey != null)
->
+                throw new IllegalStateException();
->
+            return new EntryIterator<K,V>(map, this);
-–
+    }
-–
-–
+    static final class SnapshotEntryIterator<K,V> extends ViewIterator<K,V>
-–
+        implements Iterator<Map.Entry<K,V>> {
-–
+        SnapshotEntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); }
-<
+        @SuppressWarnings("unchecked")
-<
+        public final Map.Entry<K,V> next() {
-<
+            if (next == null)
->
+        @SuppressWarnings("unchecked") public final Map.Entry<K,V> next() {
->
+            V v;
->
+            if ((v = nextVal) == null && (v = advance()) == null)
+                throw new NoSuchElementException();
+            Object k = nextKey;
-<
+            Object v = nextVal;
-<
+            advance();
-<
+            return new SnapshotEntry<K,V>((K)k, (V)v);
->
+            nextVal = null;
->
+            return new MapEntry<K,V>((K)k, v, map);
+    /**
-<
+     * Base of writeThrough and Snapshot entry classes
->
+     * Exported Entry for iterators
+     */
-<
+    static abstract class MapEntry<K,V> implements Map.Entry<K, V> {
->
+    static final class MapEntry<K,V> implements Map.Entry<K, V> {
+        final K key; // non-null
+        V val;       // non-null
-<
+        MapEntry(K key, V val)        { this.key = key; this.val = val; }
->
+        final ConcurrentHashMapV8<K, V> map;
->
+        MapEntry(K key, V val, ConcurrentHashMapV8<K, V> map) {
->
+            this.key = key;
->
+            this.val = val;
->
+            this.map = map;
->
+        }
+        public final K getKey()       { return key; }
+        public final V getValue()     { return val; }
+        public final int hashCode()   { return key.hashCode() ^ val.hashCode(); }
+                    (v == val || v.equals(val)));
-–
+        public abstract V setValue(V value);
-–
+    }
-–
-–
+    /**
-–
+     * Entry used by EntryIterator.next(), that relays setValue
-–
+     * changes to the underlying map.
-–
+     */
-–
+    static final class WriteThroughEntry<K,V> extends MapEntry<K,V>
-–
+        implements Map.Entry<K, V> {
-–
+        final ConcurrentHashMapV8<K, V> map;
-–
+        WriteThroughEntry(K key, V val, ConcurrentHashMapV8<K, V> map) {
-–
+            super(key, val);
-–
+            this.map = map;
-–
+        }
-–
+        /**
+         * Sets our entry's value and writes through to the map. The
-<
+         * value to return is somewhat arbitrary here. Since a
-<
+         * WriteThroughEntry does not necessarily track asynchronous
-<
+         * changes, the most recent "previous" value could be
-<
+         * different from what we return (or could even have been
-<
+         * removed in which case the put will re-establish). We do not
-<
+         * and cannot guarantee more.
->
+         * value to return is somewhat arbitrary here. Since we do not
->
+         * necessarily track asynchronous changes, the most recent
->
+         * "previous" value could be different from what we return (or
->
+         * could even have been removed in which case the put will
->
+         * re-establish). We do not and cannot guarantee more.
+         */
+        public final V setValue(V value) {
+            if (value == null) throw new NullPointerException();
+    /**
-<
+     * Internal version of entry, that doesn't write though changes
->
+     * Returns exportable snapshot entry for the given key and value
->
+     * when write-through can't or shouldn't be used.
+     */
-<
+    static final class SnapshotEntry<K,V> extends MapEntry<K,V>
-<
+        implements Map.Entry<K, V> {
-<
+        SnapshotEntry(K key, V val) { super(key, val); }
-<
+        public final V setValue(V value) { // only locally update
-<
+            if (value == null) throw new NullPointerException();
-<
+            V v = val;
-<
+            val = value;
-<
+            return v;
->
+    static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) {
->
+        return new AbstractMap.SimpleEntry<K,V>(k, v);
->
+    }
->
->
+    /* ---------------- Serialization Support -------------- */
->
->
+    /**
->
+     * Stripped-down version of helper class used in previous version,
->
+     * declared for the sake of serialization compatibility
->
+     */
->
+    static class Segment<K,V> implements Serializable {
->
+        private static final long serialVersionUID = 2249069246763182397L;
->
+        final float loadFactor;
->
+        Segment(float lf) { this.loadFactor = lf; }
->
+    }
->
->
+    /**
->
+     * Saves the state of the {@code ConcurrentHashMapV8} instance to a
->
+     * stream (i.e., serializes it).
->
+     * @param s the stream
->
+     * @serialData
->
+     * the key (Object) and value (Object)
->
+     * for each key-value mapping, followed by a null pair.
->
+     * The key-value mappings are emitted in no particular order.
->
+     */
->
+    @SuppressWarnings("unchecked") private void writeObject
->
+        (java.io.ObjectOutputStream s)
->
+        throws java.io.IOException {
->
+        if (segments == null) { // for serialization compatibility
->
+            segments = (Segment<K,V>[])
->
+                new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
->
+            for (int i = 0; i < segments.length; ++i)
->
+                segments[i] = new Segment<K,V>(LOAD_FACTOR);
->
+        }
->
+        s.defaultWriteObject();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v;
->
+        while ((v = it.advance()) != null) {
->
+            s.writeObject(it.nextKey);
->
+            s.writeObject(v);
->
+        }
->
+        s.writeObject(null);
->
+        s.writeObject(null);
->
+        segments = null; // throw away
->
+    }
->
->
+    /**
->
+     * Reconstitutes the instance from a stream (that is, deserializes it).
->
+     * @param s the stream
->
+     */
->
+    @SuppressWarnings("unchecked") private void readObject
->
+        (java.io.ObjectInputStream s)
->
+        throws java.io.IOException, ClassNotFoundException {
->
+        s.defaultReadObject();
->
+        this.segments = null; // unneeded
->
->
+        // Create all nodes, then place in table once size is known
->
+        long size = 0L;
->
+        Node<V> p = null;
->
+        for (;;) {
->
+            K k = (K) s.readObject();
->
+            V v = (V) s.readObject();
->
+            if (k != null && v != null) {
->
+                int h = spread(k.hashCode());
->
+                p = new Node<V>(h, k, v, p);
->
+                ++size;
->
+            }
->
+            else
->
+                break;
->
+        }
->
+        if (p != null) {
->
+            boolean init = false;
->
+            int n;
->
+            if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
->
+                n = MAXIMUM_CAPACITY;
->
+            else {
->
+                int sz = (int)size;
->
+                n = tableSizeFor(sz + (sz >>> 1) + 1);
->
+            }
->
+            int sc = sizeCtl;
->
+            boolean collide = false;
->
+            if (n > sc &&
->
+                U.compareAndSwapInt(this, SIZECTL, sc, -1)) {
->
+                try {
->
+                    if (table == null) {
->
+                        init = true;
->
+                        @SuppressWarnings("rawtypes") Node[] rt = new Node[n];
->
+                        Node<V>[] tab = (Node<V>[])rt;
->
+                        int mask = n - 1;
->
+                        while (p != null) {
->
+                            int j = p.hash & mask;
->
+                            Node<V> next = p.next;
->
+                            Node<V> q = p.next = tabAt(tab, j);
->
+                            setTabAt(tab, j, p);
->
+                            if (!collide && q != null && q.hash == p.hash)
->
+                                collide = true;
->
+                            p = next;
->
+                        }
->
+                        table = tab;
->
+                        addCount(size, -1);
->
+                        sc = n - (n >>> 2);
->
+                    }
->
+                } finally {
->
+                    sizeCtl = sc;
->
+                }
->
+                if (collide) { // rescan and convert to TreeBins
->
+                    Node<V>[] tab = table;
->
+                    for (int i = 0; i < tab.length; ++i) {
->
+                        int c = 0;
->
+                        for (Node<V> e = tabAt(tab, i); e != null; e = e.next) {
->
+                            if (++c > TREE_THRESHOLD &&
->
+                                (e.key instanceof Comparable)) {
->
+                                replaceWithTreeBin(tab, i, e.key);
->
+                                break;
->
+                            }
->
+                        }
->
+                    }
->
+                }
->
+            }
->
+            if (!init) { // Can only happen if unsafely published.
->
+                while (p != null) {
->
+                    internalPut((K)p.key, p.val, false);
->
+                    p = p.next;
->
+                }
->
+            }
->
+        }
->
+    }
->
->
+    // -------------------------------------------------------
->
->
+    // Sams
->
+    /** Interface describing a void action of one argument */
->
+    public interface Action<A> { void apply(A a); }
->
+    /** Interface describing a void action of two arguments */
->
+    public interface BiAction<A,B> { void apply(A a, B b); }
->
+    /** Interface describing a function of one argument */
->
+    public interface Fun<A,T> { T apply(A a); }
->
+    /** Interface describing a function of two arguments */
->
+    public interface BiFun<A,B,T> { T apply(A a, B b); }
->
+    /** Interface describing a function of no arguments */
->
+    public interface Generator<T> { T apply(); }
->
+    /** Interface describing a function mapping its argument to a double */
->
+    public interface ObjectToDouble<A> { double apply(A a); }
->
+    /** Interface describing a function mapping its argument to a long */
->
+    public interface ObjectToLong<A> { long apply(A a); }
->
+    /** Interface describing a function mapping its argument to an int */
->
+    public interface ObjectToInt<A> {int apply(A a); }
->
+    /** Interface describing a function mapping two arguments to a double */
->
+    public interface ObjectByObjectToDouble<A,B> { double apply(A a, B b); }
->
+    /** Interface describing a function mapping two arguments to a long */
->
+    public interface ObjectByObjectToLong<A,B> { long apply(A a, B b); }
->
+    /** Interface describing a function mapping two arguments to an int */
->
+    public interface ObjectByObjectToInt<A,B> {int apply(A a, B b); }
->
+    /** Interface describing a function mapping a double to a double */
->
+    public interface DoubleToDouble { double apply(double a); }
->
+    /** Interface describing a function mapping a long to a long */
->
+    public interface LongToLong { long apply(long a); }
->
+    /** Interface describing a function mapping an int to an int */
->
+    public interface IntToInt { int apply(int a); }
->
+    /** Interface describing a function mapping two doubles to a double */
->
+    public interface DoubleByDoubleToDouble { double apply(double a, double b); }
->
+    /** Interface describing a function mapping two longs to a long */
->
+    public interface LongByLongToLong { long apply(long a, long b); }
->
+    /** Interface describing a function mapping two ints to an int */
->
+    public interface IntByIntToInt { int apply(int a, int b); }
->
->
->
+    // -------------------------------------------------------
->
->
+    // Sequential bulk operations
->
->
+    /**
->
+     * Performs the given action for each (key, value).
->
+     *
->
+     * @param action the action
->
+     */
->
+    @SuppressWarnings("unchecked") public void forEachSequentially
->
+        (BiAction<K,V> action) {
->
+        if (action == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v;
->
+        while ((v = it.advance()) != null)
->
+            action.apply((K)it.nextKey, v);
->
+    }
->
->
+    /**
->
+     * Performs the given action for each non-null transformation
->
+     * of each (key, value).
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case the action is not applied).
->
+     * @param action the action
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> void forEachSequentially
->
+        (BiFun<? super K, ? super V, ? extends U> transformer,
->
+         Action<U> action) {
->
+        if (transformer == null || action == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v; U u;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = transformer.apply((K)it.nextKey, v)) != null)
->
+                action.apply(u);
->
+        }
->
+    }
->
->
+    /**
->
+     * Returns a non-null result from applying the given search
->
+     * function on each (key, value), or null if none.
->
+     *
->
+     * @param searchFunction a function returning a non-null
->
+     * result on success, else null
->
+     * @return a non-null result from applying the given search
->
+     * function on each (key, value), or null if none
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> U searchSequentially
->
+        (BiFun<? super K, ? super V, ? extends U> searchFunction) {
->
+        if (searchFunction == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v; U u;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = searchFunction.apply((K)it.nextKey, v)) != null)
->
+                return u;
->
+        }
->
+        return null;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all (key, value) pairs using the given reducer to
->
+     * combine values, or null if none.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case it is not combined).
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all (key, value) pairs
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> U reduceSequentially
->
+        (BiFun<? super K, ? super V, ? extends U> transformer,
->
+         BiFun<? super U, ? super U, ? extends U> reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        U r = null, u; V v;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = transformer.apply((K)it.nextKey, v)) != null)
->
+                r = (r == null) ? u : reducer.apply(r, u);
->
+        }
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all (key, value) pairs using the given reducer to
->
+     * combine values, and the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all (key, value) pairs
->
+     */
->
+    @SuppressWarnings("unchecked") public double reduceToDoubleSequentially
->
+        (ObjectByObjectToDouble<? super K, ? super V> transformer,
->
+         double basis,
->
+         DoubleByDoubleToDouble reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        double r = basis; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all (key, value) pairs using the given reducer to
->
+     * combine values, and the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all (key, value) pairs
->
+     */
->
+    @SuppressWarnings("unchecked") public long reduceToLongSequentially
->
+        (ObjectByObjectToLong<? super K, ? super V> transformer,
->
+         long basis,
->
+         LongByLongToLong reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        long r = basis; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all (key, value) pairs using the given reducer to
->
+     * combine values, and the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all (key, value) pairs
->
+     */
->
+    @SuppressWarnings("unchecked") public int reduceToIntSequentially
->
+        (ObjectByObjectToInt<? super K, ? super V> transformer,
->
+         int basis,
->
+         IntByIntToInt reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        int r = basis; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = reducer.apply(r, transformer.apply((K)it.nextKey, v));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Performs the given action for each key.
->
+     *
->
+     * @param action the action
->
+     */
->
+    @SuppressWarnings("unchecked") public void forEachKeySequentially
->
+        (Action<K> action) {
->
+        if (action == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        while (it.advance() != null)
->
+            action.apply((K)it.nextKey);
->
+    }
->
->
+    /**
->
+     * Performs the given action for each non-null transformation
->
+     * of each key.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case the action is not applied).
->
+     * @param action the action
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> void forEachKeySequentially
->
+        (Fun<? super K, ? extends U> transformer,
->
+         Action<U> action) {
->
+        if (transformer == null || action == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        U u;
->
+        while (it.advance() != null) {
->
+            if ((u = transformer.apply((K)it.nextKey)) != null)
->
+                action.apply(u);
->
+        }
->
+        ForkJoinTasks.forEachKey
->
+            (this, transformer, action).invoke();
->
+    }
->
->
+    /**
->
+     * Returns a non-null result from applying the given search
->
+     * function on each key, or null if none.
->
+     *
->
+     * @param searchFunction a function returning a non-null
->
+     * result on success, else null
->
+     * @return a non-null result from applying the given search
->
+     * function on each key, or null if none
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> U searchKeysSequentially
->
+        (Fun<? super K, ? extends U> searchFunction) {
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        U u;
->
+        while (it.advance() != null) {
->
+            if ((u = searchFunction.apply((K)it.nextKey)) != null)
->
+                return u;
->
+        }
->
+        return null;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating all keys using the given
->
+     * reducer to combine values, or null if none.
->
+     *
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating all keys using the given
->
+     * reducer to combine values, or null if none
->
+     */
->
+    @SuppressWarnings("unchecked") public K reduceKeysSequentially
->
+        (BiFun<? super K, ? super K, ? extends K> reducer) {
->
+        if (reducer == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        K r = null;
->
+        while (it.advance() != null) {
->
+            K u = (K)it.nextKey;
->
+            r = (r == null) ? u : reducer.apply(r, u);
->
+        }
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all keys using the given reducer to combine values, or
->
+     * null if none.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case it is not combined).
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all keys
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> U reduceKeysSequentially
->
+        (Fun<? super K, ? extends U> transformer,
->
+         BiFun<? super U, ? super U, ? extends U> reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        U r = null, u;
->
+        while (it.advance() != null) {
->
+            if ((u = transformer.apply((K)it.nextKey)) != null)
->
+                r = (r == null) ? u : reducer.apply(r, u);
->
+        }
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all keys using the given reducer to combine values, and
->
+     * the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return  the result of accumulating the given transformation
->
+     * of all keys
->
+     */
->
+    @SuppressWarnings("unchecked") public double reduceKeysToDoubleSequentially
->
+        (ObjectToDouble<? super K> transformer,
->
+         double basis,
->
+         DoubleByDoubleToDouble reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        double r = basis;
->
+        while (it.advance() != null)
->
+            r = reducer.apply(r, transformer.apply((K)it.nextKey));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all keys using the given reducer to combine values, and
->
+     * the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all keys
->
+     */
->
+    @SuppressWarnings("unchecked") public long reduceKeysToLongSequentially
->
+        (ObjectToLong<? super K> transformer,
->
+         long basis,
->
+         LongByLongToLong reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        long r = basis;
->
+        while (it.advance() != null)
->
+            r = reducer.apply(r, transformer.apply((K)it.nextKey));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all keys using the given reducer to combine values, and
->
+     * the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all keys
->
+     */
->
+    @SuppressWarnings("unchecked") public int reduceKeysToIntSequentially
->
+        (ObjectToInt<? super K> transformer,
->
+         int basis,
->
+         IntByIntToInt reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        int r = basis;
->
+        while (it.advance() != null)
->
+            r = reducer.apply(r, transformer.apply((K)it.nextKey));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Performs the given action for each value.
->
+     *
->
+     * @param action the action
->
+     */
->
+    public void forEachValueSequentially(Action<V> action) {
->
+        if (action == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v;
->
+        while ((v = it.advance()) != null)
->
+            action.apply(v);
->
+    }
->
->
+    /**
->
+     * Performs the given action for each non-null transformation
->
+     * of each value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case the action is not applied).
->
+     */
->
+    public <U> void forEachValueSequentially
->
+        (Fun<? super V, ? extends U> transformer,
->
+         Action<U> action) {
->
+        if (transformer == null || action == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v; U u;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = transformer.apply(v)) != null)
->
+                action.apply(u);
->
+        }
->
+    }
->
->
+    /**
->
+     * Returns a non-null result from applying the given search
->
+     * function on each value, or null if none.
->
+     *
->
+     * @param searchFunction a function returning a non-null
->
+     * result on success, else null
->
+     * @return a non-null result from applying the given search
->
+     * function on each value, or null if none
->
+     *
->
+     */
->
+    public <U> U searchValuesSequentially
->
+        (Fun<? super V, ? extends U> searchFunction) {
->
+        if (searchFunction == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v; U u;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = searchFunction.apply(v)) != null)
->
+                return u;
->
+        }
->
+        return null;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating all values using the
->
+     * given reducer to combine values, or null if none.
->
+     *
->
+     * @param reducer a commutative associative combining function
->
+     * @return  the result of accumulating all values
->
+     */
->
+    public V reduceValuesSequentially
->
+        (BiFun<? super V, ? super V, ? extends V> reducer) {
->
+        if (reducer == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V r = null; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = (r == null) ? v : reducer.apply(r, v);
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all values using the given reducer to combine values, or
->
+     * null if none.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case it is not combined).
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all values
->
+     */
->
+    public <U> U reduceValuesSequentially
->
+        (Fun<? super V, ? extends U> transformer,
->
+         BiFun<? super U, ? super U, ? extends U> reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        U r = null, u; V v;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = transformer.apply(v)) != null)
->
+                r = (r == null) ? u : reducer.apply(r, u);
->
+        }
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all values using the given reducer to combine values,
->
+     * and the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all values
->
+     */
->
+    public double reduceValuesToDoubleSequentially
->
+        (ObjectToDouble<? super V> transformer,
->
+         double basis,
->
+         DoubleByDoubleToDouble reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        double r = basis; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = reducer.apply(r, transformer.apply(v));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all values using the given reducer to combine values,
->
+     * and the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all values
->
+     */
->
+    public long reduceValuesToLongSequentially
->
+        (ObjectToLong<? super V> transformer,
->
+         long basis,
->
+         LongByLongToLong reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        long r = basis; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = reducer.apply(r, transformer.apply(v));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Returns the result of accumulating the given transformation
->
+     * of all values using the given reducer to combine values,
->
+     * and the given basis as an identity value.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element
->
+     * @param basis the identity (initial default value) for the reduction
->
+     * @param reducer a commutative associative combining function
->
+     * @return the result of accumulating the given transformation
->
+     * of all values
->
+     */
->
+    public int reduceValuesToIntSequentially
->
+        (ObjectToInt<? super V> transformer,
->
+         int basis,
->
+         IntByIntToInt reducer) {
->
+        if (transformer == null || reducer == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        int r = basis; V v;
->
+        while ((v = it.advance()) != null)
->
+            r = reducer.apply(r, transformer.apply(v));
->
+        return r;
->
+    }
->
->
+    /**
->
+     * Performs the given action for each entry.
->
+     *
->
+     * @param action the action
->
+     */
->
+    @SuppressWarnings("unchecked") public void forEachEntrySequentially
->
+        (Action<Map.Entry<K,V>> action) {
->
+        if (action == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v;
->
+        while ((v = it.advance()) != null)
->
+            action.apply(entryFor((K)it.nextKey, v));
->
+    }
->
->
+    /**
->
+     * Performs the given action for each non-null transformation
->
+     * of each entry.
->
+     *
->
+     * @param transformer a function returning the transformation
->
+     * for an element, or null of there is no transformation (in
->
+     * which case the action is not applied).
->
+     * @param action the action
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> void forEachEntrySequentially
->
+        (Fun<Map.Entry<K,V>, ? extends U> transformer,
->
+         Action<U> action) {
->
+        if (transformer == null || action == null)
->
+            throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v; U u;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = transformer.apply(entryFor((K)it.nextKey, v))) != null)
->
+                action.apply(u);
->
+        }
->
+    }
->
->
+    /**
->
+     * Returns a non-null result from applying the given search
->
+     * function on each entry, or null if none.
->
+     *
->
+     * @param searchFunction a function returning a non-null
->
+     * result on success, else null
->
+     * @return a non-null result from applying the given search
->
+     * function on each entry, or null if none
->
+     */
->
+    @SuppressWarnings("unchecked") public <U> U searchEntriesSequentially
->
+        (Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
->
+        if (searchFunction == null) throw new NullPointerException();
->
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
->
+        V v; U u;
->
+        while ((v = it.advance()) != null) {
->
+            if ((u = searchFunction.apply(entryFor((K)it.nextKey, v))) != null)
->
+                return u;
-+
+        return null;
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating all entries using the
-+
+     * given reducer to combine values, or null if none.
-+
+     *
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating all entries
-+
+     */
-+
+    @SuppressWarnings("unchecked") public Map.Entry<K,V> reduceEntriesSequentially
-+
+        (BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
-+
+        if (reducer == null) throw new NullPointerException();
-+
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
-+
+        Map.Entry<K,V> r = null; V v;
-+
+        while ((v = it.advance()) != null) {
-+
+            Map.Entry<K,V> u = entryFor((K)it.nextKey, v);
-+
+            r = (r == null) ? u : reducer.apply(r, u);
-+
+        }
-+
+        return r;
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * or null if none.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case it is not combined).
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    @SuppressWarnings("unchecked") public <U> U reduceEntriesSequentially
-+
+        (Fun<Map.Entry<K,V>, ? extends U> transformer,
-+
+         BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+        if (transformer == null || reducer == null)
-+
+            throw new NullPointerException();
-+
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
-+
+        U r = null, u; V v;
-+
+        while ((v = it.advance()) != null) {
-+
+            if ((u = transformer.apply(entryFor((K)it.nextKey, v))) != null)
-+
+                r = (r == null) ? u : reducer.apply(r, u);
-+
+        }
-+
+        return r;
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    @SuppressWarnings("unchecked") public double reduceEntriesToDoubleSequentially
-+
+        (ObjectToDouble<Map.Entry<K,V>> transformer,
-+
+         double basis,
-+
+         DoubleByDoubleToDouble reducer) {
-+
+        if (transformer == null || reducer == null)
-+
+            throw new NullPointerException();
-+
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
-+
+        double r = basis; V v;
-+
+        while ((v = it.advance()) != null)
-+
+            r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v)));
-+
+        return r;
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return  the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    @SuppressWarnings("unchecked") public long reduceEntriesToLongSequentially
-+
+        (ObjectToLong<Map.Entry<K,V>> transformer,
-+
+         long basis,
-+
+         LongByLongToLong reducer) {
-+
+        if (transformer == null || reducer == null)
-+
+            throw new NullPointerException();
-+
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
-+
+        long r = basis; V v;
-+
+        while ((v = it.advance()) != null)
-+
+            r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v)));
-+
+        return r;
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    @SuppressWarnings("unchecked") public int reduceEntriesToIntSequentially
-+
+        (ObjectToInt<Map.Entry<K,V>> transformer,
-+
+         int basis,
-+
+         IntByIntToInt reducer) {
-+
+        if (transformer == null || reducer == null)
-+
+            throw new NullPointerException();
-+
+        Traverser<K,V,Object> it = new Traverser<K,V,Object>(this);
-+
+        int r = basis; V v;
-+
+        while ((v = it.advance()) != null)
-+
+            r = reducer.apply(r, transformer.apply(entryFor((K)it.nextKey, v)));
-+
+        return r;
-+
+    }
-+
-+
+    // Parallel bulk operations
-+
-+
+    /**
-+
+     * Performs the given action for each (key, value).
-+
+     *
-+
+     * @param action the action
-+
+     */
-+
+    public void forEachInParallel(BiAction<K,V> action) {
-+
+        ForkJoinTasks.forEach
-+
+            (this, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Performs the given action for each non-null transformation
-+
+     * of each (key, value).
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case the action is not applied).
-+
+     * @param action the action
-+
+     */
-+
+    public <U> void forEachInParallel
-+
+        (BiFun<? super K, ? super V, ? extends U> transformer,
-+
+                            Action<U> action) {
-+
+        ForkJoinTasks.forEach
-+
+            (this, transformer, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns a non-null result from applying the given search
-+
+     * function on each (key, value), or null if none.  Upon
-+
+     * success, further element processing is suppressed and the
-+
+     * results of any other parallel invocations of the search
-+
+     * function are ignored.
-+
+     *
-+
+     * @param searchFunction a function returning a non-null
-+
+     * result on success, else null
-+
+     * @return a non-null result from applying the given search
-+
+     * function on each (key, value), or null if none
-+
+     */
-+
+    public <U> U searchInParallel
-+
+        (BiFun<? super K, ? super V, ? extends U> searchFunction) {
-+
+        return ForkJoinTasks.search
-+
+            (this, searchFunction).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all (key, value) pairs using the given reducer to
-+
+     * combine values, or null if none.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case it is not combined).
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all (key, value) pairs
-+
+     */
-+
+    public <U> U reduceInParallel
-+
+        (BiFun<? super K, ? super V, ? extends U> transformer,
-+
+         BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+        return ForkJoinTasks.reduce
-+
+            (this, transformer, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all (key, value) pairs using the given reducer to
-+
+     * combine values, and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all (key, value) pairs
-+
+     */
-+
+    public double reduceToDoubleInParallel
-+
+        (ObjectByObjectToDouble<? super K, ? super V> transformer,
-+
+         double basis,
-+
+         DoubleByDoubleToDouble reducer) {
-+
+        return ForkJoinTasks.reduceToDouble
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all (key, value) pairs using the given reducer to
-+
+     * combine values, and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all (key, value) pairs
-+
+     */
-+
+    public long reduceToLongInParallel
-+
+        (ObjectByObjectToLong<? super K, ? super V> transformer,
-+
+         long basis,
-+
+         LongByLongToLong reducer) {
-+
+        return ForkJoinTasks.reduceToLong
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all (key, value) pairs using the given reducer to
-+
+     * combine values, and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all (key, value) pairs
-+
+     */
-+
+    public int reduceToIntInParallel
-+
+        (ObjectByObjectToInt<? super K, ? super V> transformer,
-+
+         int basis,
-+
+         IntByIntToInt reducer) {
-+
+        return ForkJoinTasks.reduceToInt
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Performs the given action for each key.
-+
+     *
-+
+     * @param action the action
-+
+     */
-+
+    public void forEachKeyInParallel(Action<K> action) {
-+
+        ForkJoinTasks.forEachKey
-+
+            (this, action).invoke();
-+
+    /**
-+
+     * Performs the given action for each non-null transformation
-+
+     * of each key.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case the action is not applied).
-+
+     * @param action the action
-+
+     */
-+
+    public <U> void forEachKeyInParallel
-+
+        (Fun<? super K, ? extends U> transformer,
-+
+         Action<U> action) {
-+
+        ForkJoinTasks.forEachKey
-+
+            (this, transformer, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns a non-null result from applying the given search
-+
+     * function on each key, or null if none. Upon success,
-+
+     * further element processing is suppressed and the results of
-+
+     * any other parallel invocations of the search function are
-+
+     * ignored.
-+
+     *
-+
+     * @param searchFunction a function returning a non-null
-+
+     * result on success, else null
-+
+     * @return a non-null result from applying the given search
-+
+     * function on each key, or null if none
-+
+     */
-+
+    public <U> U searchKeysInParallel
-+
+        (Fun<? super K, ? extends U> searchFunction) {
-+
+        return ForkJoinTasks.searchKeys
-+
+            (this, searchFunction).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating all keys using the given
-+
+     * reducer to combine values, or null if none.
-+
+     *
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating all keys using the given
-+
+     * reducer to combine values, or null if none
-+
+     */
-+
+    public K reduceKeysInParallel
-+
+        (BiFun<? super K, ? super K, ? extends K> reducer) {
-+
+        return ForkJoinTasks.reduceKeys
-+
+            (this, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all keys using the given reducer to combine values, or
-+
+     * null if none.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case it is not combined).
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all keys
-+
+     */
-+
+    public <U> U reduceKeysInParallel
-+
+        (Fun<? super K, ? extends U> transformer,
-+
+         BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+        return ForkJoinTasks.reduceKeys
-+
+            (this, transformer, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all keys using the given reducer to combine values, and
-+
+     * the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return  the result of accumulating the given transformation
-+
+     * of all keys
-+
+     */
-+
+    public double reduceKeysToDoubleInParallel
-+
+        (ObjectToDouble<? super K> transformer,
-+
+         double basis,
-+
+         DoubleByDoubleToDouble reducer) {
-+
+        return ForkJoinTasks.reduceKeysToDouble
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all keys using the given reducer to combine values, and
-+
+     * the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all keys
-+
+     */
-+
+    public long reduceKeysToLongInParallel
-+
+        (ObjectToLong<? super K> transformer,
-+
+         long basis,
-+
+         LongByLongToLong reducer) {
-+
+        return ForkJoinTasks.reduceKeysToLong
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all keys using the given reducer to combine values, and
-+
+     * the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all keys
-+
+     */
-+
+    public int reduceKeysToIntInParallel
-+
+        (ObjectToInt<? super K> transformer,
-+
+         int basis,
-+
+         IntByIntToInt reducer) {
-+
+        return ForkJoinTasks.reduceKeysToInt
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Performs the given action for each value.
-+
+     *
-+
+     * @param action the action
-+
+     */
-+
+    public void forEachValueInParallel(Action<V> action) {
-+
+        ForkJoinTasks.forEachValue
-+
+            (this, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Performs the given action for each non-null transformation
-+
+     * of each value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case the action is not applied).
-+
+     */
-+
+    public <U> void forEachValueInParallel
-+
+        (Fun<? super V, ? extends U> transformer,
-+
+         Action<U> action) {
-+
+        ForkJoinTasks.forEachValue
-+
+            (this, transformer, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns a non-null result from applying the given search
-+
+     * function on each value, or null if none.  Upon success,
-+
+     * further element processing is suppressed and the results of
-+
+     * any other parallel invocations of the search function are
-+
+     * ignored.
-+
+     *
-+
+     * @param searchFunction a function returning a non-null
-+
+     * result on success, else null
-+
+     * @return a non-null result from applying the given search
-+
+     * function on each value, or null if none
-+
+     *
-+
+     */
-+
+    public <U> U searchValuesInParallel
-+
+        (Fun<? super V, ? extends U> searchFunction) {
-+
+        return ForkJoinTasks.searchValues
-+
+            (this, searchFunction).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating all values using the
-+
+     * given reducer to combine values, or null if none.
-+
+     *
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return  the result of accumulating all values
-+
+     */
-+
+    public V reduceValuesInParallel
-+
+        (BiFun<? super V, ? super V, ? extends V> reducer) {
-+
+        return ForkJoinTasks.reduceValues
-+
+            (this, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all values using the given reducer to combine values, or
-+
+     * null if none.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case it is not combined).
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all values
-+
+     */
-+
+    public <U> U reduceValuesInParallel
-+
+        (Fun<? super V, ? extends U> transformer,
-+
+         BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+        return ForkJoinTasks.reduceValues
-+
+            (this, transformer, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all values using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all values
-+
+     */
-+
+    public double reduceValuesToDoubleInParallel
-+
+        (ObjectToDouble<? super V> transformer,
-+
+         double basis,
-+
+         DoubleByDoubleToDouble reducer) {
-+
+        return ForkJoinTasks.reduceValuesToDouble
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all values using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all values
-+
+     */
-+
+    public long reduceValuesToLongInParallel
-+
+        (ObjectToLong<? super V> transformer,
-+
+         long basis,
-+
+         LongByLongToLong reducer) {
-+
+        return ForkJoinTasks.reduceValuesToLong
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all values using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all values
-+
+     */
-+
+    public int reduceValuesToIntInParallel
-+
+        (ObjectToInt<? super V> transformer,
-+
+         int basis,
-+
+         IntByIntToInt reducer) {
-+
+        return ForkJoinTasks.reduceValuesToInt
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Performs the given action for each entry.
-+
+     *
-+
+     * @param action the action
-+
+     */
-+
+    public void forEachEntryInParallel(Action<Map.Entry<K,V>> action) {
-+
+        ForkJoinTasks.forEachEntry
-+
+            (this, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Performs the given action for each non-null transformation
-+
+     * of each entry.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case the action is not applied).
-+
+     * @param action the action
-+
+     */
-+
+    public <U> void forEachEntryInParallel
-+
+        (Fun<Map.Entry<K,V>, ? extends U> transformer,
-+
+         Action<U> action) {
-+
+        ForkJoinTasks.forEachEntry
-+
+            (this, transformer, action).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns a non-null result from applying the given search
-+
+     * function on each entry, or null if none.  Upon success,
-+
+     * further element processing is suppressed and the results of
-+
+     * any other parallel invocations of the search function are
-+
+     * ignored.
-+
+     *
-+
+     * @param searchFunction a function returning a non-null
-+
+     * result on success, else null
-+
+     * @return a non-null result from applying the given search
-+
+     * function on each entry, or null if none
-+
+     */
-+
+    public <U> U searchEntriesInParallel
-+
+        (Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
-+
+        return ForkJoinTasks.searchEntries
-+
+            (this, searchFunction).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating all entries using the
-+
+     * given reducer to combine values, or null if none.
-+
+     *
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating all entries
-+
+     */
-+
+    public Map.Entry<K,V> reduceEntriesInParallel
-+
+        (BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
-+
+        return ForkJoinTasks.reduceEntries
-+
+            (this, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * or null if none.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element, or null of there is no transformation (in
-+
+     * which case it is not combined).
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    public <U> U reduceEntriesInParallel
-+
+        (Fun<Map.Entry<K,V>, ? extends U> transformer,
-+
+         BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+        return ForkJoinTasks.reduceEntries
-+
+            (this, transformer, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    public double reduceEntriesToDoubleInParallel
-+
+        (ObjectToDouble<Map.Entry<K,V>> transformer,
-+
+         double basis,
-+
+         DoubleByDoubleToDouble reducer) {
-+
+        return ForkJoinTasks.reduceEntriesToDouble
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return  the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    public long reduceEntriesToLongInParallel
-+
+        (ObjectToLong<Map.Entry<K,V>> transformer,
-+
+         long basis,
-+
+         LongByLongToLong reducer) {
-+
+        return ForkJoinTasks.reduceEntriesToLong
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /**
-+
+     * Returns the result of accumulating the given transformation
-+
+     * of all entries using the given reducer to combine values,
-+
+     * and the given basis as an identity value.
-+
+     *
-+
+     * @param transformer a function returning the transformation
-+
+     * for an element
-+
+     * @param basis the identity (initial default value) for the reduction
-+
+     * @param reducer a commutative associative combining function
-+
+     * @return the result of accumulating the given transformation
-+
+     * of all entries
-+
+     */
-+
+    public int reduceEntriesToIntInParallel
-+
+        (ObjectToInt<Map.Entry<K,V>> transformer,
-+
+         int basis,
-+
+         IntByIntToInt reducer) {
-+
+        return ForkJoinTasks.reduceEntriesToInt
-+
+            (this, transformer, basis, reducer).invoke();
-+
+    }
-+
-+
+    /* ----------------Views -------------- */
+    /**
-<
+     * Base class for views. This is done mainly to allow adding
-<
+     * customized parallel traversals (not yet implemented.)
->
+     * Base class for views.
+     */
-<
+    static abstract class MapView<K, V> {
->
+    static abstract class CHMView<K, V> {
+        final ConcurrentHashMapV8<K, V> map;
-<
+        MapView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
->
+        CHMView(ConcurrentHashMapV8<K, V> map)  { this.map = map; }
->
->
+        /**
->
+         * Returns the map backing this view.
->
+         *
->
+         * @return the map backing this view
->
+         */
->
+        public ConcurrentHashMapV8<K,V> getMap() { return map; }
->
+        public final int size()                 { return map.size(); }
+        public final boolean isEmpty()          { return map.isEmpty(); }
+        public final void clear()               { map.clear(); }
+        // implementations below rely on concrete classes supplying these
-<
+        abstract Iterator<?> iter();
->
+        abstract public Iterator<?> iterator();
+        abstract public boolean contains(Object o);
+        abstract public boolean remove(Object o);
+        private static final String oomeMsg = "Required array size too large";
+        public final Object[] toArray() {
-<
+            long sz = map.longSize();
->
+            long sz = map.mappingCount();
+            if (sz > (long)(MAX_ARRAY_SIZE))
+                throw new OutOfMemoryError(oomeMsg);
+            int n = (int)sz;
+            Object[] r = new Object[n];
+            int i = 0;
-<
+            Iterator<?> it = iter();
->
+            Iterator<?> it = iterator();
+            while (it.hasNext()) {
+                if (i == n) {
+                    if (n >= MAX_ARRAY_SIZE)
+            return (i == n) ? r : Arrays.copyOf(r, i);
-<
+        @SuppressWarnings("unchecked")
-<
+        public final <T> T[] toArray(T[] a) {
-<
+            long sz = map.longSize();
->
+        @SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) {
->
+            long sz = map.mappingCount();
+            if (sz > (long)(MAX_ARRAY_SIZE))
+                throw new OutOfMemoryError(oomeMsg);
+            int m = (int)sz;
+                .newInstance(a.getClass().getComponentType(), m);
+            int n = r.length;
+            int i = 0;
-<
+            Iterator<?> it = iter();
->
+            Iterator<?> it = iterator();
+            while (it.hasNext()) {
+                if (i == n) {
+                    if (n >= MAX_ARRAY_SIZE)
+        public final int hashCode() {
+            int h = 0;
-<
+            for (Iterator<?> it = iter(); it.hasNext();)
->
+            for (Iterator<?> it = iterator(); it.hasNext();)
+                h += it.next().hashCode();
+            return h;
+        public final String toString() {
+            StringBuilder sb = new StringBuilder();
+            sb.append('[');
-<
+            Iterator<?> it = iter();
->
+            Iterator<?> it = iterator();
+            if (it.hasNext()) {
+                for (;;) {
+                    Object e = it.next();
+        public final boolean removeAll(Collection<?> c) {
+            boolean modified = false;
-<
+            for (Iterator<?> it = iter(); it.hasNext();) {
->
+            for (Iterator<?> it = iterator(); it.hasNext();) {
+                if (c.contains(it.next())) {
+                    it.remove();
+                    modified = true;
+        public final boolean retainAll(Collection<?> c) {
+            boolean modified = false;
-<
+            for (Iterator<?> it = iter(); it.hasNext();) {
->
+            for (Iterator<?> it = iterator(); it.hasNext();) {
+                if (!c.contains(it.next())) {
+                    it.remove();
+                    modified = true;
-<
+    static final class KeySet<K,V> extends MapView<K,V> implements Set<K> {
-<
+        KeySet(ConcurrentHashMapV8<K, V> map)   { super(map); }
-<
+        public final boolean contains(Object o) { return map.containsKey(o); }
-<
+        public final boolean remove(Object o)   { return map.remove(o) != null; }
-<
-<
+        public final Iterator<K> iterator() {
-<
+            return new KeyIterator<K,V>(map);
-<
+        }
-<
+        final Iterator<?> iter() {
-<
+            return new KeyIterator<K,V>(map);
-<
+        }
-<
+        public final boolean add(K e) {
-<
+            throw new UnsupportedOperationException();
->
+    /**
->
+     * A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in
->
+     * which additions may optionally be enabled by mapping to a
->
+     * common value.  This class cannot be directly instantiated. See
->
+     * {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()},
->
+     * {@link #newKeySet(int)}.
->
+     */
->
+    public static class KeySetView<K,V> extends CHMView<K,V>
->
+        implements Set<K>, java.io.Serializable {
->
+        private static final long serialVersionUID = 7249069246763182397L;
->
+        private final V value;
->
+        KeySetView(ConcurrentHashMapV8<K, V> map, V value) {  // non-public
->
+            super(map);
->
+            this.value = value;
-<
+        public final boolean addAll(Collection<? extends K> c) {
-<
+            throw new UnsupportedOperationException();
->
->
+        /**
->
+         * Returns the default mapped value for additions,
->
+         * or {@code null} if additions are not supported.
->
+         *
->
+         * @return the default mapped value for additions, or {@code null}
->
+         * if not supported.
->
+         */
->
+        public V getMappedValue() { return value; }
->
->
+        // implement Set API
->
->
+        public boolean contains(Object o) { return map.containsKey(o); }
->
+        public boolean remove(Object o)   { return map.remove(o) != null; }
->
->
+        /**
->
+         * Returns a "weakly consistent" iterator that will never
->
+         * throw {@link ConcurrentModificationException}, and
->
+         * guarantees to traverse elements as they existed upon
->
+         * construction of the iterator, and may (but is not
->
+         * guaranteed to) reflect any modifications subsequent to
->
+         * construction.
->
+         *
->
+         * @return an iterator over the keys of this map
->
+         */
->
+        public Iterator<K> iterator()     { return new KeyIterator<K,V>(map); }
->
+        public boolean add(K e) {
->
+            V v;
->
+            if ((v = value) == null)
->
+                throw new UnsupportedOperationException();
->
+            if (e == null)
->
+                throw new NullPointerException();
->
+            return map.internalPut(e, v, true) == null;
->
+        }
->
+        public boolean addAll(Collection<? extends K> c) {
->
+            boolean added = false;
->
+            V v;
->
+            if ((v = value) == null)
->
+                throw new UnsupportedOperationException();
->
+            for (K e : c) {
->
+                if (e == null)
->
+                    throw new NullPointerException();
->
+                if (map.internalPut(e, v, true) == null)
->
+                    added = true;
->
+            }
->
+            return added;
+        public boolean equals(Object o) {
+            Set<?> c;
-<
+    static final class Values<K,V> extends MapView<K,V>
->
+    /**
->
+     * A view of a ConcurrentHashMapV8 as a {@link Collection} of
->
+     * values, in which additions are disabled. This class cannot be
->
+     * directly instantiated. See {@link #values},
->
+     *
->
+     * <p>The view's {@code iterator} is a "weakly consistent" iterator
->
+     * that will never throw {@link ConcurrentModificationException},
->
+     * and guarantees to traverse elements as they existed upon
->
+     * construction of the iterator, and may (but is not guaranteed to)
->
+     * reflect any modifications subsequent to construction.
->
+     */
->
+    public static final class ValuesView<K,V> extends CHMView<K,V>
+        implements Collection<V> {
-<
+        Values(ConcurrentHashMapV8<K, V> map)   { super(map); }
->
+        ValuesView(ConcurrentHashMapV8<K, V> map)   { super(map); }
+        public final boolean contains(Object o) { return map.containsValue(o); }
-–
+        public final boolean remove(Object o) {
+            if (o != null) {
+                Iterator<V> it = new ValueIterator<K,V>(map);
+            return false;
-+
-+
+        /**
-+
+         * Returns a "weakly consistent" iterator that will never
-+
+         * throw {@link ConcurrentModificationException}, and
-+
+         * guarantees to traverse elements as they existed upon
-+
+         * construction of the iterator, and may (but is not
-+
+         * guaranteed to) reflect any modifications subsequent to
-+
+         * construction.
-+
+         *
-+
+         * @return an iterator over the values of this map
-+
+         */
+        public final Iterator<V> iterator() {
+            return new ValueIterator<K,V>(map);
-–
+        final Iterator<?> iter() {
-–
+            return new ValueIterator<K,V>(map);
-–
+        }
+        public final boolean add(V e) {
+            throw new UnsupportedOperationException();
+        public final boolean addAll(Collection<? extends V> c) {
+            throw new UnsupportedOperationException();
-+
-<
+    static final class EntrySet<K,V> extends MapView<K,V>
->
+    /**
->
+     * A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value)
->
+     * entries.  This class cannot be directly instantiated. See
->
+     * {@link #entrySet}.
->
+     */
->
+    public static final class EntrySetView<K,V> extends CHMView<K,V>
+        implements Set<Map.Entry<K,V>> {
-<
+        EntrySet(ConcurrentHashMapV8<K, V> map) { super(map); }
-<
->
+        EntrySetView(ConcurrentHashMapV8<K, V> map) { super(map); }
+        public final boolean contains(Object o) {
+            Object k, v, r; Map.Entry<?,?> e;
+            return ((o instanceof Map.Entry) &&
+                    (v = e.getValue()) != null &&
+                    (v == r || v.equals(r)));
-–
+        public final boolean remove(Object o) {
+            Object k, v; Map.Entry<?,?> e;
+            return ((o instanceof Map.Entry) &&
+                    map.remove(k, v));
-+
+        /**
-+
+         * Returns a "weakly consistent" iterator that will never
-+
+         * throw {@link ConcurrentModificationException}, and
-+
+         * guarantees to traverse elements as they existed upon
-+
+         * construction of the iterator, and may (but is not
-+
+         * guaranteed to) reflect any modifications subsequent to
-+
+         * construction.
-+
+         *
-+
+         * @return an iterator over the entries of this map
-+
+         */
+        public final Iterator<Map.Entry<K,V>> iterator() {
+            return new EntryIterator<K,V>(map);
-<
+        final Iterator<?> iter() {
-<
+            return new SnapshotEntryIterator<K,V>(map);
-<
+        }
->
+        public final boolean add(Entry<K,V> e) {
-<
+            throw new UnsupportedOperationException();
->
+            K key = e.getKey();
->
+            V value = e.getValue();
->
+            if (key == null || value == null)
->
+                throw new NullPointerException();
->
+            return map.internalPut(key, value, false) == null;
+        public final boolean addAll(Collection<? extends Entry<K,V>> c) {
-<
+            throw new UnsupportedOperationException();
->
+            boolean added = false;
->
+            for (Entry<K,V> e : c) {
->
+                if (add(e))
->
+                    added = true;
->
+            }
->
+            return added;
+        public boolean equals(Object o) {
+            Set<?> c;
-<
+    /* ---------------- Serialization Support -------------- */
->
+    // ---------------------------------------------------------------------
+    /**
-<
+     * Stripped-down version of helper class used in previous version,
-<
+     * declared for the sake of serialization compatibility
->
+     * Predefined tasks for performing bulk parallel operations on
->
+     * ConcurrentHashMapV8s. These tasks follow the forms and rules used
->
+     * for bulk operations. Each method has the same name, but returns
->
+     * a task rather than invoking it. These methods may be useful in
->
+     * custom applications such as submitting a task without waiting
->
+     * for completion, using a custom pool, or combining with other
->
+     * tasks.
+     */
-<
+    static class Segment<K,V> implements Serializable {
-<
+        private static final long serialVersionUID = 2249069246763182397L;
-<
+        final float loadFactor;
-<
+        Segment(float lf) { this.loadFactor = lf; }
-<
+    }
->
+    public static class ForkJoinTasks {
->
+        private ForkJoinTasks() {}
-<
+    /**
-<
+     * Saves the state of the {@code ConcurrentHashMapV8} instance to a
-<
+     * stream (i.e., serializes it).
-<
+     * @param s the stream
-<
+     * @serialData
-<
+     * the key (Object) and value (Object)
-<
+     * for each key-value mapping, followed by a null pair.
-<
+     * The key-value mappings are emitted in no particular order.
-<
+     */
-<
+    @SuppressWarnings("unchecked")
-<
+    private void writeObject(java.io.ObjectOutputStream s)
-<
+            throws java.io.IOException {
-<
+        if (segments == null) { // for serialization compatibility
-<
+            segments = (Segment<K,V>[])
-<
+                new Segment<?,?>[DEFAULT_CONCURRENCY_LEVEL];
-<
+            for (int i = 0; i < segments.length; ++i)
-<
+                segments[i] = new Segment<K,V>(LOAD_FACTOR);
->
+        /**
->
+         * Returns a task that when invoked, performs the given
->
+         * action for each (key, value)
->
+         *
->
+         * @param map the map
->
+         * @param action the action
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Void> forEach
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiAction<K,V> action) {
->
+            if (action == null) throw new NullPointerException();
->
+            return new ForEachMappingTask<K,V>(map, null, -1, action);
-<
+        s.defaultWriteObject();
-<
+        InternalIterator it = new InternalIterator(table);
-<
+        while (it.next != null) {
-<
+            s.writeObject(it.nextKey);
-<
+            s.writeObject(it.nextVal);
-<
+            it.advance();
->
->
+        /**
->
+         * Returns a task that when invoked, performs the given
->
+         * action for each non-null transformation of each (key, value)
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case the action is not applied)
->
+         * @param action the action
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<Void> forEach
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiFun<? super K, ? super V, ? extends U> transformer,
->
+             Action<U> action) {
->
+            if (transformer == null || action == null)
->
+                throw new NullPointerException();
->
+            return new ForEachTransformedMappingTask<K,V,U>
->
+                (map, null, -1, transformer, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns a non-null result
->
+         * from applying the given search function on each (key,
->
+         * value), or null if none. Upon success, further element
->
+         * processing is suppressed and the results of any other
->
+         * parallel invocations of the search function are ignored.
->
+         *
->
+         * @param map the map
->
+         * @param searchFunction a function returning a non-null
->
+         * result on success, else null
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> search
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiFun<? super K, ? super V, ? extends U> searchFunction) {
->
+            if (searchFunction == null) throw new NullPointerException();
->
+            return new SearchMappingsTask<K,V,U>
->
+                (map, null, -1, searchFunction,
->
+                 new AtomicReference<U>());
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all (key, value) pairs
->
+         * using the given reducer to combine values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case it is not combined).
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> reduce
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiFun<? super K, ? super V, ? extends U> transformer,
->
+             BiFun<? super U, ? super U, ? extends U> reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceMappingsTask<K,V,U>
->
+                (map, null, -1, null, transformer, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all (key, value) pairs
->
+         * using the given reducer to combine values, and the given
->
+         * basis as an identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Double> reduceToDouble
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectByObjectToDouble<? super K, ? super V> transformer,
->
+             double basis,
->
+             DoubleByDoubleToDouble reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceMappingsToDoubleTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all (key, value) pairs
->
+         * using the given reducer to combine values, and the given
->
+         * basis as an identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Long> reduceToLong
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectByObjectToLong<? super K, ? super V> transformer,
->
+             long basis,
->
+             LongByLongToLong reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceMappingsToLongTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all (key, value) pairs
->
+         * using the given reducer to combine values, and the given
->
+         * basis as an identity value.
->
+         *
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Integer> reduceToInt
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectByObjectToInt<? super K, ? super V> transformer,
->
+             int basis,
->
+             IntByIntToInt reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceMappingsToIntTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, performs the given action
->
+         * for each key.
->
+         *
->
+         * @param map the map
->
+         * @param action the action
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Void> forEachKey
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Action<K> action) {
->
+            if (action == null) throw new NullPointerException();
->
+            return new ForEachKeyTask<K,V>(map, null, -1, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, performs the given action
->
+         * for each non-null transformation of each key.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case the action is not applied)
->
+         * @param action the action
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<Void> forEachKey
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<? super K, ? extends U> transformer,
->
+             Action<U> action) {
->
+            if (transformer == null || action == null)
->
+                throw new NullPointerException();
->
+            return new ForEachTransformedKeyTask<K,V,U>
->
+                (map, null, -1, transformer, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns a non-null result
->
+         * from applying the given search function on each key, or
->
+         * null if none.  Upon success, further element processing is
->
+         * suppressed and the results of any other parallel
->
+         * invocations of the search function are ignored.
->
+         *
->
+         * @param map the map
->
+         * @param searchFunction a function returning a non-null
->
+         * result on success, else null
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> searchKeys
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<? super K, ? extends U> searchFunction) {
->
+            if (searchFunction == null) throw new NullPointerException();
->
+            return new SearchKeysTask<K,V,U>
->
+                (map, null, -1, searchFunction,
->
+                 new AtomicReference<U>());
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating all keys using the given reducer to combine
->
+         * values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<K> reduceKeys
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiFun<? super K, ? super K, ? extends K> reducer) {
->
+            if (reducer == null) throw new NullPointerException();
->
+            return new ReduceKeysTask<K,V>
->
+                (map, null, -1, null, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all keys using the given
->
+         * reducer to combine values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case it is not combined).
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> reduceKeys
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<? super K, ? extends U> transformer,
->
+             BiFun<? super U, ? super U, ? extends U> reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceKeysTask<K,V,U>
->
+                (map, null, -1, null, transformer, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all keys using the given
->
+         * reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Double> reduceKeysToDouble
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToDouble<? super K> transformer,
->
+             double basis,
->
+             DoubleByDoubleToDouble reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceKeysToDoubleTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all keys using the given
->
+         * reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Long> reduceKeysToLong
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToLong<? super K> transformer,
->
+             long basis,
->
+             LongByLongToLong reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceKeysToLongTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all keys using the given
->
+         * reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Integer> reduceKeysToInt
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToInt<? super K> transformer,
->
+             int basis,
->
+             IntByIntToInt reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceKeysToIntTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, performs the given action
->
+         * for each value.
->
+         *
->
+         * @param map the map
->
+         * @param action the action
->
+         */
->
+        public static <K,V> ForkJoinTask<Void> forEachValue
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Action<V> action) {
->
+            if (action == null) throw new NullPointerException();
->
+            return new ForEachValueTask<K,V>(map, null, -1, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, performs the given action
->
+         * for each non-null transformation of each value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case the action is not applied)
->
+         * @param action the action
->
+         */
->
+        public static <K,V,U> ForkJoinTask<Void> forEachValue
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<? super V, ? extends U> transformer,
->
+             Action<U> action) {
->
+            if (transformer == null || action == null)
->
+                throw new NullPointerException();
->
+            return new ForEachTransformedValueTask<K,V,U>
->
+                (map, null, -1, transformer, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns a non-null result
->
+         * from applying the given search function on each value, or
->
+         * null if none.  Upon success, further element processing is
->
+         * suppressed and the results of any other parallel
->
+         * invocations of the search function are ignored.
->
+         *
->
+         * @param map the map
->
+         * @param searchFunction a function returning a non-null
->
+         * result on success, else null
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> searchValues
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<? super V, ? extends U> searchFunction) {
->
+            if (searchFunction == null) throw new NullPointerException();
->
+            return new SearchValuesTask<K,V,U>
->
+                (map, null, -1, searchFunction,
->
+                 new AtomicReference<U>());
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating all values using the given reducer to combine
->
+         * values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<V> reduceValues
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiFun<? super V, ? super V, ? extends V> reducer) {
->
+            if (reducer == null) throw new NullPointerException();
->
+            return new ReduceValuesTask<K,V>
->
+                (map, null, -1, null, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all values using the
->
+         * given reducer to combine values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case it is not combined).
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> reduceValues
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<? super V, ? extends U> transformer,
->
+             BiFun<? super U, ? super U, ? extends U> reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceValuesTask<K,V,U>
->
+                (map, null, -1, null, transformer, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all values using the
->
+         * given reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Double> reduceValuesToDouble
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToDouble<? super V> transformer,
->
+             double basis,
->
+             DoubleByDoubleToDouble reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceValuesToDoubleTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all values using the
->
+         * given reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Long> reduceValuesToLong
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToLong<? super V> transformer,
->
+             long basis,
->
+             LongByLongToLong reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceValuesToLongTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all values using the
->
+         * given reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Integer> reduceValuesToInt
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToInt<? super V> transformer,
->
+             int basis,
->
+             IntByIntToInt reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceValuesToIntTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, perform the given action
->
+         * for each entry.
->
+         *
->
+         * @param map the map
->
+         * @param action the action
->
+         */
->
+        public static <K,V> ForkJoinTask<Void> forEachEntry
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Action<Map.Entry<K,V>> action) {
->
+            if (action == null) throw new NullPointerException();
->
+            return new ForEachEntryTask<K,V>(map, null, -1, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, perform the given action
->
+         * for each non-null transformation of each entry.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case the action is not applied)
->
+         * @param action the action
->
+         */
->
+        public static <K,V,U> ForkJoinTask<Void> forEachEntry
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<Map.Entry<K,V>, ? extends U> transformer,
->
+             Action<U> action) {
->
+            if (transformer == null || action == null)
->
+                throw new NullPointerException();
->
+            return new ForEachTransformedEntryTask<K,V,U>
->
+                (map, null, -1, transformer, action);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns a non-null result
->
+         * from applying the given search function on each entry, or
->
+         * null if none.  Upon success, further element processing is
->
+         * suppressed and the results of any other parallel
->
+         * invocations of the search function are ignored.
->
+         *
->
+         * @param map the map
->
+         * @param searchFunction a function returning a non-null
->
+         * result on success, else null
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> searchEntries
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<Map.Entry<K,V>, ? extends U> searchFunction) {
->
+            if (searchFunction == null) throw new NullPointerException();
->
+            return new SearchEntriesTask<K,V,U>
->
+                (map, null, -1, searchFunction,
->
+                 new AtomicReference<U>());
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating all entries using the given reducer to combine
->
+         * values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Map.Entry<K,V>> reduceEntries
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
->
+            if (reducer == null) throw new NullPointerException();
->
+            return new ReduceEntriesTask<K,V>
->
+                (map, null, -1, null, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all entries using the
->
+         * given reducer to combine values, or null if none.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element, or null if there is no transformation (in
->
+         * which case it is not combined).
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V,U> ForkJoinTask<U> reduceEntries
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             Fun<Map.Entry<K,V>, ? extends U> transformer,
->
+             BiFun<? super U, ? super U, ? extends U> reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceEntriesTask<K,V,U>
->
+                (map, null, -1, null, transformer, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all entries using the
->
+         * given reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Double> reduceEntriesToDouble
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToDouble<Map.Entry<K,V>> transformer,
->
+             double basis,
->
+             DoubleByDoubleToDouble reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceEntriesToDoubleTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all entries using the
->
+         * given reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Long> reduceEntriesToLong
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToLong<Map.Entry<K,V>> transformer,
->
+             long basis,
->
+             LongByLongToLong reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceEntriesToLongTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
->
+        }
->
->
+        /**
->
+         * Returns a task that when invoked, returns the result of
->
+         * accumulating the given transformation of all entries using the
->
+         * given reducer to combine values, and the given basis as an
->
+         * identity value.
->
+         *
->
+         * @param map the map
->
+         * @param transformer a function returning the transformation
->
+         * for an element
->
+         * @param basis the identity (initial default value) for the reduction
->
+         * @param reducer a commutative associative combining function
->
+         * @return the task
->
+         */
->
+        public static <K,V> ForkJoinTask<Integer> reduceEntriesToInt
->
+            (ConcurrentHashMapV8<K,V> map,
->
+             ObjectToInt<Map.Entry<K,V>> transformer,
->
+             int basis,
->
+             IntByIntToInt reducer) {
->
+            if (transformer == null || reducer == null)
->
+                throw new NullPointerException();
->
+            return new MapReduceEntriesToIntTask<K,V>
->
+                (map, null, -1, null, transformer, basis, reducer);
-–
+        s.writeObject(null);
-–
+        s.writeObject(null);
-–
+        segments = null; // throw away
-<
+    /**
-<
+     * Reconstitutes the instance from a stream (that is, deserializes it).
-<
+     * @param s the stream
-<
+     */
-<
+    @SuppressWarnings("unchecked")
-<
+    private void readObject(java.io.ObjectInputStream s)
-<
+            throws java.io.IOException, ClassNotFoundException {
-<
+        s.defaultReadObject();
-<
+        this.segments = null; // unneeded
-<
+        // initialize transient final field
-<
+        UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder());
->
+    // -------------------------------------------------------
-<
+        // Create all nodes, then place in table once size is known
-<
+        long size = 0L;
-<
+        Node p = null;
-<
+        for (;;) {
-<
+            K k = (K) s.readObject();
-<
+            V v = (V) s.readObject();
-<
+            if (k != null && v != null) {
-<
+                int h = spread(k.hashCode());
-<
+                p = new Node(h, k, v, p);
-<
+                ++size;
->
+    /*
->
+     * Task classes. Coded in a regular but ugly format/style to
->
+     * simplify checks that each variant differs in the right way from
->
+     * others. The null screenings exist because compilers cannot tell
->
+     * that we've already null-checked task arguments, so we force
->
+     * simplest hoisted bypass to help avoid convoluted traps.
->
+     */
->
->
+    @SuppressWarnings("serial") static final class ForEachKeyTask<K,V>
->
+        extends Traverser<K,V,Void> {
->
+        final Action<K> action;
->
+        ForEachKeyTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Action<K> action) {
->
+            super(m, p, b);
->
+            this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Action<K> action;
->
+            if ((action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachKeyTask<K,V>(map, this, b, action).fork();
->
+                while (advance() != null)
->
+                    action.apply((K)nextKey);
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachValueTask<K,V>
->
+        extends Traverser<K,V,Void> {
->
+        final Action<V> action;
->
+        ForEachValueTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Action<V> action) {
->
+            super(m, p, b);
->
+            this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Action<V> action;
->
+            if ((action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachValueTask<K,V>(map, this, b, action).fork();
->
+                V v;
->
+                while ((v = advance()) != null)
->
+                    action.apply(v);
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachEntryTask<K,V>
->
+        extends Traverser<K,V,Void> {
->
+        final Action<Entry<K,V>> action;
->
+        ForEachEntryTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Action<Entry<K,V>> action) {
->
+            super(m, p, b);
->
+            this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Action<Entry<K,V>> action;
->
+            if ((action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachEntryTask<K,V>(map, this, b, action).fork();
->
+                V v;
->
+                while ((v = advance()) != null)
->
+                    action.apply(entryFor((K)nextKey, v));
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachMappingTask<K,V>
->
+        extends Traverser<K,V,Void> {
->
+        final BiAction<K,V> action;
->
+        ForEachMappingTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             BiAction<K,V> action) {
->
+            super(m, p, b);
->
+            this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final BiAction<K,V> action;
->
+            if ((action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachMappingTask<K,V>(map, this, b, action).fork();
->
+                V v;
->
+                while ((v = advance()) != null)
->
+                    action.apply((K)nextKey, v);
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U>
->
+        extends Traverser<K,V,Void> {
->
+        final Fun<? super K, ? extends U> transformer;
->
+        final Action<U> action;
->
+        ForEachTransformedKeyTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Fun<? super K, ? extends U> transformer, Action<U> action) {
->
+            super(m, p, b);
->
+            this.transformer = transformer; this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Fun<? super K, ? extends U> transformer;
->
+            final Action<U> action;
->
+            if ((transformer = this.transformer) != null &&
->
+                (action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachTransformedKeyTask<K,V,U>
->
+                        (map, this, b, transformer, action).fork();
->
+                U u;
->
+                while (advance() != null) {
->
+                    if ((u = transformer.apply((K)nextKey)) != null)
->
+                        action.apply(u);
->
+                }
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U>
->
+        extends Traverser<K,V,Void> {
->
+        final Fun<? super V, ? extends U> transformer;
->
+        final Action<U> action;
->
+        ForEachTransformedValueTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Fun<? super V, ? extends U> transformer, Action<U> action) {
->
+            super(m, p, b);
->
+            this.transformer = transformer; this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Fun<? super V, ? extends U> transformer;
->
+            final Action<U> action;
->
+            if ((transformer = this.transformer) != null &&
->
+                (action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachTransformedValueTask<K,V,U>
->
+                        (map, this, b, transformer, action).fork();
->
+                V v; U u;
->
+                while ((v = advance()) != null) {
->
+                    if ((u = transformer.apply(v)) != null)
->
+                        action.apply(u);
->
+                }
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U>
->
+        extends Traverser<K,V,Void> {
->
+        final Fun<Map.Entry<K,V>, ? extends U> transformer;
->
+        final Action<U> action;
->
+        ForEachTransformedEntryTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Fun<Map.Entry<K,V>, ? extends U> transformer, Action<U> action) {
->
+            super(m, p, b);
->
+            this.transformer = transformer; this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Fun<Map.Entry<K,V>, ? extends U> transformer;
->
+            final Action<U> action;
->
+            if ((transformer = this.transformer) != null &&
->
+                (action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachTransformedEntryTask<K,V,U>
->
+                        (map, this, b, transformer, action).fork();
->
+                V v; U u;
->
+                while ((v = advance()) != null) {
->
+                    if ((u = transformer.apply(entryFor((K)nextKey,
->
+                                                        v))) != null)
->
+                        action.apply(u);
->
+                }
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U>
->
+        extends Traverser<K,V,Void> {
->
+        final BiFun<? super K, ? super V, ? extends U> transformer;
->
+        final Action<U> action;
->
+        ForEachTransformedMappingTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             BiFun<? super K, ? super V, ? extends U> transformer,
->
+             Action<U> action) {
->
+            super(m, p, b);
->
+            this.transformer = transformer; this.action = action;
->
+        }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final BiFun<? super K, ? super V, ? extends U> transformer;
->
+            final Action<U> action;
->
+            if ((transformer = this.transformer) != null &&
->
+                (action = this.action) != null) {
->
+                for (int b; (b = preSplit()) > 0;)
->
+                    new ForEachTransformedMappingTask<K,V,U>
->
+                        (map, this, b, transformer, action).fork();
->
+                V v; U u;
->
+                while ((v = advance()) != null) {
->
+                    if ((u = transformer.apply((K)nextKey, v)) != null)
->
+                        action.apply(u);
->
+                }
->
+                propagateCompletion();
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class SearchKeysTask<K,V,U>
->
+        extends Traverser<K,V,U> {
->
+        final Fun<? super K, ? extends U> searchFunction;
->
+        final AtomicReference<U> result;
->
+        SearchKeysTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Fun<? super K, ? extends U> searchFunction,
->
+             AtomicReference<U> result) {
->
+            super(m, p, b);
->
+            this.searchFunction = searchFunction; this.result = result;
->
+        }
->
+        public final U getRawResult() { return result.get(); }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Fun<? super K, ? extends U> searchFunction;
->
+            final AtomicReference<U> result;
->
+            if ((searchFunction = this.searchFunction) != null &&
->
+                (result = this.result) != null) {
->
+                for (int b;;) {
->
+                    if (result.get() != null)
->
+                        return;
->
+                    if ((b = preSplit()) <= 0)
->
+                        break;
->
+                    new SearchKeysTask<K,V,U>
->
+                        (map, this, b, searchFunction, result).fork();
->
+                }
->
+                while (result.get() == null) {
->
+                    U u;
->
+                    if (advance() == null) {
->
+                        propagateCompletion();
->
+                        break;
->
+                    }
->
+                    if ((u = searchFunction.apply((K)nextKey)) != null) {
->
+                        if (result.compareAndSet(null, u))
->
+                            quietlyCompleteRoot();
->
+                        break;
->
+                    }
->
+                }
-–
+            else
-–
+                break;
-<
+        if (p != null) {
-<
+            boolean init = false;
-<
+            int n;
-<
+            if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
-<
+                n = MAXIMUM_CAPACITY;
-<
+            else {
-<
+                int sz = (int)size;
-<
+                n = tableSizeFor(sz + (sz >>> 1) + 1);
-<
+            }
-<
+            int sc = sizeCtl;
-<
+            boolean collide = false;
-<
+            if (n > sc &&
-<
+                UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
-<
+                try {
-<
+                    if (table == null) {
-<
+                        init = true;
-<
+                        Node[] tab = new Node[n];
-<
+                        int mask = n - 1;
-<
+                        while (p != null) {
-<
+                            int j = p.hash & mask;
-<
+                            Node next = p.next;
-<
+                            Node q = p.next = tabAt(tab, j);
-<
+                            setTabAt(tab, j, p);
-<
+                            if (!collide && q != null && q.hash == p.hash)
-<
+                                collide = true;
-<
+                            p = next;
-<
+                        }
-<
+                        table = tab;
-<
+                        counter.add(size);
-<
+                        sc = n - (n >>> 2);
->
+    }
->
->
+    @SuppressWarnings("serial") static final class SearchValuesTask<K,V,U>
->
+        extends Traverser<K,V,U> {
->
+        final Fun<? super V, ? extends U> searchFunction;
->
+        final AtomicReference<U> result;
->
+        SearchValuesTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Fun<? super V, ? extends U> searchFunction,
->
+             AtomicReference<U> result) {
->
+            super(m, p, b);
->
+            this.searchFunction = searchFunction; this.result = result;
->
+        }
->
+        public final U getRawResult() { return result.get(); }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Fun<? super V, ? extends U> searchFunction;
->
+            final AtomicReference<U> result;
->
+            if ((searchFunction = this.searchFunction) != null &&
->
+                (result = this.result) != null) {
->
+                for (int b;;) {
->
+                    if (result.get() != null)
->
+                        return;
->
+                    if ((b = preSplit()) <= 0)
->
+                        break;
->
+                    new SearchValuesTask<K,V,U>
->
+                        (map, this, b, searchFunction, result).fork();
->
+                }
->
+                while (result.get() == null) {
->
+                    V v; U u;
->
+                    if ((v = advance()) == null) {
->
+                        propagateCompletion();
->
+                        break;
->
+                    }
->
+                    if ((u = searchFunction.apply(v)) != null) {
->
+                        if (result.compareAndSet(null, u))
->
+                            quietlyCompleteRoot();
->
+                        break;
-–
+                } finally {
-–
+                    sizeCtl = sc;
-<
+                if (collide) { // rescan and convert to TreeBins
-<
+                    Node[] tab = table;
-<
+                    for (int i = 0; i < tab.length; ++i) {
-<
+                        int c = 0;
-<
+                        for (Node e = tabAt(tab, i); e != null; e = e.next) {
-<
+                            if (++c > TREE_THRESHOLD &&
-<
+                                (e.key instanceof Comparable)) {
-<
+                                replaceWithTreeBin(tab, i, e.key);
-<
+                                break;
-<
+                            }
-<
+                        }
->
+            }
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U>
->
+        extends Traverser<K,V,U> {
->
+        final Fun<Entry<K,V>, ? extends U> searchFunction;
->
+        final AtomicReference<U> result;
->
+        SearchEntriesTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             Fun<Entry<K,V>, ? extends U> searchFunction,
->
+             AtomicReference<U> result) {
->
+            super(m, p, b);
->
+            this.searchFunction = searchFunction; this.result = result;
->
+        }
->
+        public final U getRawResult() { return result.get(); }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final Fun<Entry<K,V>, ? extends U> searchFunction;
->
+            final AtomicReference<U> result;
->
+            if ((searchFunction = this.searchFunction) != null &&
->
+                (result = this.result) != null) {
->
+                for (int b;;) {
->
+                    if (result.get() != null)
->
+                        return;
->
+                    if ((b = preSplit()) <= 0)
->
+                        break;
->
+                    new SearchEntriesTask<K,V,U>
->
+                        (map, this, b, searchFunction, result).fork();
->
+                }
->
+                while (result.get() == null) {
->
+                    V v; U u;
->
+                    if ((v = advance()) == null) {
->
+                        propagateCompletion();
->
+                        break;
->
+                    }
->
+                    if ((u = searchFunction.apply(entryFor((K)nextKey,
->
+                                                           v))) != null) {
->
+                        if (result.compareAndSet(null, u))
->
+                            quietlyCompleteRoot();
->
+                        return;
-<
+            if (!init) { // Can only happen if unsafely published.
-<
+                while (p != null) {
-<
+                    internalPut(p.key, p.val);
-<
+                    p = p.next;
->
+        }
->
+    }
->
->
+    @SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U>
->
+        extends Traverser<K,V,U> {
->
+        final BiFun<? super K, ? super V, ? extends U> searchFunction;
->
+        final AtomicReference<U> result;
->
+        SearchMappingsTask
->
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
->
+             BiFun<? super K, ? super V, ? extends U> searchFunction,
->
+             AtomicReference<U> result) {
->
+            super(m, p, b);
->
+            this.searchFunction = searchFunction; this.result = result;
->
+        }
->
+        public final U getRawResult() { return result.get(); }
->
+        @SuppressWarnings("unchecked") public final void compute() {
->
+            final BiFun<? super K, ? super V, ? extends U> searchFunction;
->
+            final AtomicReference<U> result;
->
+            if ((searchFunction = this.searchFunction) != null &&
->
+                (result = this.result) != null) {
->
+                for (int b;;) {
->
+                    if (result.get() != null)
->
+                        return;
->
+                    if ((b = preSplit()) <= 0)
->
+                        break;
->
+                    new SearchMappingsTask<K,V,U>
->
+                        (map, this, b, searchFunction, result).fork();
->
+                }
->
+                while (result.get() == null) {
->
+                    V v; U u;
->
+                    if ((v = advance()) == null) {
->
+                        propagateCompletion();
->
+                        break;
->
+                    }
->
+                    if ((u = searchFunction.apply((K)nextKey, v)) != null) {
->
+                        if (result.compareAndSet(null, u))
->
+                            quietlyCompleteRoot();
->
+                        break;
->
+                    }
-+
+        }
-+
+    }
-+
+    @SuppressWarnings("serial") static final class ReduceKeysTask<K,V>
-+
+        extends Traverser<K,V,K> {
-+
+        final BiFun<? super K, ? super K, ? extends K> reducer;
-+
+        K result;
-+
+        ReduceKeysTask<K,V> rights, nextRight;
-+
+        ReduceKeysTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             ReduceKeysTask<K,V> nextRight,
-+
+             BiFun<? super K, ? super K, ? extends K> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final K getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final BiFun<? super K, ? super K, ? extends K> reducer;
-+
+            if ((reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new ReduceKeysTask<K,V>
-+
+                     (map, this, b, rights, reducer)).fork();
-+
+                K r = null;
-+
+                while (advance() != null) {
-+
+                    K u = (K)nextKey;
-+
+                    r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    ReduceKeysTask<K,V>
-+
+                        t = (ReduceKeysTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        K tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class ReduceValuesTask<K,V>
-+
+        extends Traverser<K,V,V> {
-+
+        final BiFun<? super V, ? super V, ? extends V> reducer;
-+
+        V result;
-+
+        ReduceValuesTask<K,V> rights, nextRight;
-+
+        ReduceValuesTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             ReduceValuesTask<K,V> nextRight,
-+
+             BiFun<? super V, ? super V, ? extends V> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final V getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final BiFun<? super V, ? super V, ? extends V> reducer;
-+
+            if ((reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new ReduceValuesTask<K,V>
-+
+                     (map, this, b, rights, reducer)).fork();
-+
+                V r = null;
-+
+                V v;
-+
+                while ((v = advance()) != null) {
-+
+                    V u = v;
-+
+                    r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    ReduceValuesTask<K,V>
-+
+                        t = (ReduceValuesTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        V tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class ReduceEntriesTask<K,V>
-+
+        extends Traverser<K,V,Map.Entry<K,V>> {
-+
+        final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
-+
+        Map.Entry<K,V> result;
-+
+        ReduceEntriesTask<K,V> rights, nextRight;
-+
+        ReduceEntriesTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             ReduceEntriesTask<K,V> nextRight,
-+
+             BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final Map.Entry<K,V> getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer;
-+
+            if ((reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new ReduceEntriesTask<K,V>
-+
+                     (map, this, b, rights, reducer)).fork();
-+
+                Map.Entry<K,V> r = null;
-+
+                V v;
-+
+                while ((v = advance()) != null) {
-+
+                    Map.Entry<K,V> u = entryFor((K)nextKey, v);
-+
+                    r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    ReduceEntriesTask<K,V>
-+
+                        t = (ReduceEntriesTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        Map.Entry<K,V> tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U>
-+
+        extends Traverser<K,V,U> {
-+
+        final Fun<? super K, ? extends U> transformer;
-+
+        final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+        U result;
-+
+        MapReduceKeysTask<K,V,U> rights, nextRight;
-+
+        MapReduceKeysTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceKeysTask<K,V,U> nextRight,
-+
+             Fun<? super K, ? extends U> transformer,
-+
+             BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final U getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final Fun<? super K, ? extends U> transformer;
-+
+            final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceKeysTask<K,V,U>
-+
+                     (map, this, b, rights, transformer, reducer)).fork();
-+
+                U r = null, u;
-+
+                while (advance() != null) {
-+
+                    if ((u = transformer.apply((K)nextKey)) != null)
-+
+                        r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceKeysTask<K,V,U>
-+
+                        t = (MapReduceKeysTask<K,V,U>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        U tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U>
-+
+        extends Traverser<K,V,U> {
-+
+        final Fun<? super V, ? extends U> transformer;
-+
+        final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+        U result;
-+
+        MapReduceValuesTask<K,V,U> rights, nextRight;
-+
+        MapReduceValuesTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceValuesTask<K,V,U> nextRight,
-+
+             Fun<? super V, ? extends U> transformer,
-+
+             BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final U getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final Fun<? super V, ? extends U> transformer;
-+
+            final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceValuesTask<K,V,U>
-+
+                     (map, this, b, rights, transformer, reducer)).fork();
-+
+                U r = null, u;
-+
+                V v;
-+
+                while ((v = advance()) != null) {
-+
+                    if ((u = transformer.apply(v)) != null)
-+
+                        r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceValuesTask<K,V,U>
-+
+                        t = (MapReduceValuesTask<K,V,U>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        U tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U>
-+
+        extends Traverser<K,V,U> {
-+
+        final Fun<Map.Entry<K,V>, ? extends U> transformer;
-+
+        final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+        U result;
-+
+        MapReduceEntriesTask<K,V,U> rights, nextRight;
-+
+        MapReduceEntriesTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceEntriesTask<K,V,U> nextRight,
-+
+             Fun<Map.Entry<K,V>, ? extends U> transformer,
-+
+             BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final U getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final Fun<Map.Entry<K,V>, ? extends U> transformer;
-+
+            final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceEntriesTask<K,V,U>
-+
+                     (map, this, b, rights, transformer, reducer)).fork();
-+
+                U r = null, u;
-+
+                V v;
-+
+                while ((v = advance()) != null) {
-+
+                    if ((u = transformer.apply(entryFor((K)nextKey,
-+
+                                                        v))) != null)
-+
+                        r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceEntriesTask<K,V,U>
-+
+                        t = (MapReduceEntriesTask<K,V,U>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        U tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U>
-+
+        extends Traverser<K,V,U> {
-+
+        final BiFun<? super K, ? super V, ? extends U> transformer;
-+
+        final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+        U result;
-+
+        MapReduceMappingsTask<K,V,U> rights, nextRight;
-+
+        MapReduceMappingsTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceMappingsTask<K,V,U> nextRight,
-+
+             BiFun<? super K, ? super V, ? extends U> transformer,
-+
+             BiFun<? super U, ? super U, ? extends U> reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.reducer = reducer;
-+
+        }
-+
+        public final U getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final BiFun<? super K, ? super V, ? extends U> transformer;
-+
+            final BiFun<? super U, ? super U, ? extends U> reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceMappingsTask<K,V,U>
-+
+                     (map, this, b, rights, transformer, reducer)).fork();
-+
+                U r = null, u;
-+
+                V v;
-+
+                while ((v = advance()) != null) {
-+
+                    if ((u = transformer.apply((K)nextKey, v)) != null)
-+
+                        r = (r == null) ? u : reducer.apply(r, u);
-+
+                }
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceMappingsTask<K,V,U>
-+
+                        t = (MapReduceMappingsTask<K,V,U>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        U tr, sr;
-+
+                        if ((sr = s.result) != null)
-+
+                            t.result = (((tr = t.result) == null) ? sr :
-+
+                                        reducer.apply(tr, sr));
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V>
-+
+        extends Traverser<K,V,Double> {
-+
+        final ObjectToDouble<? super K> transformer;
-+
+        final DoubleByDoubleToDouble reducer;
-+
+        final double basis;
-+
+        double result;
-+
+        MapReduceKeysToDoubleTask<K,V> rights, nextRight;
-+
+        MapReduceKeysToDoubleTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceKeysToDoubleTask<K,V> nextRight,
-+
+             ObjectToDouble<? super K> transformer,
-+
+             double basis,
-+
+             DoubleByDoubleToDouble reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Double getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToDouble<? super K> transformer;
-+
+            final DoubleByDoubleToDouble reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                double r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceKeysToDoubleTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                while (advance() != null)
-+
+                    r = reducer.apply(r, transformer.apply((K)nextKey));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceKeysToDoubleTask<K,V>
-+
+                        t = (MapReduceKeysToDoubleTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V>
-+
+        extends Traverser<K,V,Double> {
-+
+        final ObjectToDouble<? super V> transformer;
-+
+        final DoubleByDoubleToDouble reducer;
-+
+        final double basis;
-+
+        double result;
-+
+        MapReduceValuesToDoubleTask<K,V> rights, nextRight;
-+
+        MapReduceValuesToDoubleTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceValuesToDoubleTask<K,V> nextRight,
-+
+             ObjectToDouble<? super V> transformer,
-+
+             double basis,
-+
+             DoubleByDoubleToDouble reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Double getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToDouble<? super V> transformer;
-+
+            final DoubleByDoubleToDouble reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                double r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceValuesToDoubleTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply(v));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceValuesToDoubleTask<K,V>
-+
+                        t = (MapReduceValuesToDoubleTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V>
-+
+        extends Traverser<K,V,Double> {
-+
+        final ObjectToDouble<Map.Entry<K,V>> transformer;
-+
+        final DoubleByDoubleToDouble reducer;
-+
+        final double basis;
-+
+        double result;
-+
+        MapReduceEntriesToDoubleTask<K,V> rights, nextRight;
-+
+        MapReduceEntriesToDoubleTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceEntriesToDoubleTask<K,V> nextRight,
-+
+             ObjectToDouble<Map.Entry<K,V>> transformer,
-+
+             double basis,
-+
+             DoubleByDoubleToDouble reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Double getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToDouble<Map.Entry<K,V>> transformer;
-+
+            final DoubleByDoubleToDouble reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                double r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceEntriesToDoubleTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
-+
+                                                                    v)));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceEntriesToDoubleTask<K,V>
-+
+                        t = (MapReduceEntriesToDoubleTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V>
-+
+        extends Traverser<K,V,Double> {
-+
+        final ObjectByObjectToDouble<? super K, ? super V> transformer;
-+
+        final DoubleByDoubleToDouble reducer;
-+
+        final double basis;
-+
+        double result;
-+
+        MapReduceMappingsToDoubleTask<K,V> rights, nextRight;
-+
+        MapReduceMappingsToDoubleTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceMappingsToDoubleTask<K,V> nextRight,
-+
+             ObjectByObjectToDouble<? super K, ? super V> transformer,
-+
+             double basis,
-+
+             DoubleByDoubleToDouble reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Double getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectByObjectToDouble<? super K, ? super V> transformer;
-+
+            final DoubleByDoubleToDouble reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                double r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceMappingsToDoubleTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply((K)nextKey, v));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceMappingsToDoubleTask<K,V>
-+
+                        t = (MapReduceMappingsToDoubleTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V>
-+
+        extends Traverser<K,V,Long> {
-+
+        final ObjectToLong<? super K> transformer;
-+
+        final LongByLongToLong reducer;
-+
+        final long basis;
-+
+        long result;
-+
+        MapReduceKeysToLongTask<K,V> rights, nextRight;
-+
+        MapReduceKeysToLongTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceKeysToLongTask<K,V> nextRight,
-+
+             ObjectToLong<? super K> transformer,
-+
+             long basis,
-+
+             LongByLongToLong reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Long getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToLong<? super K> transformer;
-+
+            final LongByLongToLong reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                long r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceKeysToLongTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                while (advance() != null)
-+
+                    r = reducer.apply(r, transformer.apply((K)nextKey));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceKeysToLongTask<K,V>
-+
+                        t = (MapReduceKeysToLongTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V>
-+
+        extends Traverser<K,V,Long> {
-+
+        final ObjectToLong<? super V> transformer;
-+
+        final LongByLongToLong reducer;
-+
+        final long basis;
-+
+        long result;
-+
+        MapReduceValuesToLongTask<K,V> rights, nextRight;
-+
+        MapReduceValuesToLongTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceValuesToLongTask<K,V> nextRight,
-+
+             ObjectToLong<? super V> transformer,
-+
+             long basis,
-+
+             LongByLongToLong reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Long getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToLong<? super V> transformer;
-+
+            final LongByLongToLong reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                long r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceValuesToLongTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply(v));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceValuesToLongTask<K,V>
-+
+                        t = (MapReduceValuesToLongTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V>
-+
+        extends Traverser<K,V,Long> {
-+
+        final ObjectToLong<Map.Entry<K,V>> transformer;
-+
+        final LongByLongToLong reducer;
-+
+        final long basis;
-+
+        long result;
-+
+        MapReduceEntriesToLongTask<K,V> rights, nextRight;
-+
+        MapReduceEntriesToLongTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceEntriesToLongTask<K,V> nextRight,
-+
+             ObjectToLong<Map.Entry<K,V>> transformer,
-+
+             long basis,
-+
+             LongByLongToLong reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Long getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToLong<Map.Entry<K,V>> transformer;
-+
+            final LongByLongToLong reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                long r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceEntriesToLongTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
-+
+                                                                    v)));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceEntriesToLongTask<K,V>
-+
+                        t = (MapReduceEntriesToLongTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V>
-+
+        extends Traverser<K,V,Long> {
-+
+        final ObjectByObjectToLong<? super K, ? super V> transformer;
-+
+        final LongByLongToLong reducer;
-+
+        final long basis;
-+
+        long result;
-+
+        MapReduceMappingsToLongTask<K,V> rights, nextRight;
-+
+        MapReduceMappingsToLongTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceMappingsToLongTask<K,V> nextRight,
-+
+             ObjectByObjectToLong<? super K, ? super V> transformer,
-+
+             long basis,
-+
+             LongByLongToLong reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Long getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectByObjectToLong<? super K, ? super V> transformer;
-+
+            final LongByLongToLong reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                long r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceMappingsToLongTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply((K)nextKey, v));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceMappingsToLongTask<K,V>
-+
+                        t = (MapReduceMappingsToLongTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V>
-+
+        extends Traverser<K,V,Integer> {
-+
+        final ObjectToInt<? super K> transformer;
-+
+        final IntByIntToInt reducer;
-+
+        final int basis;
-+
+        int result;
-+
+        MapReduceKeysToIntTask<K,V> rights, nextRight;
-+
+        MapReduceKeysToIntTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceKeysToIntTask<K,V> nextRight,
-+
+             ObjectToInt<? super K> transformer,
-+
+             int basis,
-+
+             IntByIntToInt reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Integer getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToInt<? super K> transformer;
-+
+            final IntByIntToInt reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                int r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceKeysToIntTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                while (advance() != null)
-+
+                    r = reducer.apply(r, transformer.apply((K)nextKey));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceKeysToIntTask<K,V>
-+
+                        t = (MapReduceKeysToIntTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V>
-+
+        extends Traverser<K,V,Integer> {
-+
+        final ObjectToInt<? super V> transformer;
-+
+        final IntByIntToInt reducer;
-+
+        final int basis;
-+
+        int result;
-+
+        MapReduceValuesToIntTask<K,V> rights, nextRight;
-+
+        MapReduceValuesToIntTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceValuesToIntTask<K,V> nextRight,
-+
+             ObjectToInt<? super V> transformer,
-+
+             int basis,
-+
+             IntByIntToInt reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Integer getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToInt<? super V> transformer;
-+
+            final IntByIntToInt reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                int r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceValuesToIntTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply(v));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceValuesToIntTask<K,V>
-+
+                        t = (MapReduceValuesToIntTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V>
-+
+        extends Traverser<K,V,Integer> {
-+
+        final ObjectToInt<Map.Entry<K,V>> transformer;
-+
+        final IntByIntToInt reducer;
-+
+        final int basis;
-+
+        int result;
-+
+        MapReduceEntriesToIntTask<K,V> rights, nextRight;
-+
+        MapReduceEntriesToIntTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceEntriesToIntTask<K,V> nextRight,
-+
+             ObjectToInt<Map.Entry<K,V>> transformer,
-+
+             int basis,
-+
+             IntByIntToInt reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Integer getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectToInt<Map.Entry<K,V>> transformer;
-+
+            final IntByIntToInt reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                int r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceEntriesToIntTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply(entryFor((K)nextKey,
-+
+                                                                    v)));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceEntriesToIntTask<K,V>
-+
+                        t = (MapReduceEntriesToIntTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
-+
+        }
-+
+    }
-+
-+
+    @SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V>
-+
+        extends Traverser<K,V,Integer> {
-+
+        final ObjectByObjectToInt<? super K, ? super V> transformer;
-+
+        final IntByIntToInt reducer;
-+
+        final int basis;
-+
+        int result;
-+
+        MapReduceMappingsToIntTask<K,V> rights, nextRight;
-+
+        MapReduceMappingsToIntTask
-+
+            (ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b,
-+
+             MapReduceMappingsToIntTask<K,V> nextRight,
-+
+             ObjectByObjectToInt<? super K, ? super V> transformer,
-+
+             int basis,
-+
+             IntByIntToInt reducer) {
-+
+            super(m, p, b); this.nextRight = nextRight;
-+
+            this.transformer = transformer;
-+
+            this.basis = basis; this.reducer = reducer;
-+
+        }
-+
+        public final Integer getRawResult() { return result; }
-+
+        @SuppressWarnings("unchecked") public final void compute() {
-+
+            final ObjectByObjectToInt<? super K, ? super V> transformer;
-+
+            final IntByIntToInt reducer;
-+
+            if ((transformer = this.transformer) != null &&
-+
+                (reducer = this.reducer) != null) {
-+
+                int r = this.basis;
-+
+                for (int b; (b = preSplit()) > 0;)
-+
+                    (rights = new MapReduceMappingsToIntTask<K,V>
-+
+                     (map, this, b, rights, transformer, r, reducer)).fork();
-+
+                V v;
-+
+                while ((v = advance()) != null)
-+
+                    r = reducer.apply(r, transformer.apply((K)nextKey, v));
-+
+                result = r;
-+
+                CountedCompleter<?> c;
-+
+                for (c = firstComplete(); c != null; c = c.nextComplete()) {
-+
+                    MapReduceMappingsToIntTask<K,V>
-+
+                        t = (MapReduceMappingsToIntTask<K,V>)c,
-+
+                        s = t.rights;
-+
+                    while (s != null) {
-+
+                        t.result = reducer.apply(t.result, s.result);
-+
+                        s = t.rights = s.nextRight;
-+
+                    }
-+
+                }
-+
+            }
+    // Unsafe mechanics
-<
+    private static final sun.misc.Unsafe UNSAFE;
-<
+    private static final long counterOffset;
-<
+    private static final long sizeCtlOffset;
->
+    private static final sun.misc.Unsafe U;
->
+    private static final long SIZECTL;
->
+    private static final long TRANSFERINDEX;
->
+    private static final long TRANSFERORIGIN;
->
+    private static final long BASECOUNT;
->
+    private static final long COUNTERBUSY;
->
+    private static final long CELLVALUE;
+    private static final long ABASE;
+    private static final int ASHIFT;
+    static {
+        int ss;
+        try {
-<
+            UNSAFE = getUnsafe();
->
+            U = getUnsafe();
+            Class<?> k = ConcurrentHashMapV8.class;
-<
+            counterOffset = UNSAFE.objectFieldOffset
-<
+                (k.getDeclaredField("counter"));
-<
+            sizeCtlOffset = UNSAFE.objectFieldOffset
->
+            SIZECTL = U.objectFieldOffset
+                (k.getDeclaredField("sizeCtl"));
-+
+            TRANSFERINDEX = U.objectFieldOffset
-+
+                (k.getDeclaredField("transferIndex"));
-+
+            TRANSFERORIGIN = U.objectFieldOffset
-+
+                (k.getDeclaredField("transferOrigin"));
-+
+            BASECOUNT = U.objectFieldOffset
-+
+                (k.getDeclaredField("baseCount"));
-+
+            COUNTERBUSY = U.objectFieldOffset
-+
+                (k.getDeclaredField("counterBusy"));
-+
+            Class<?> ck = CounterCell.class;
-+
+            CELLVALUE = U.objectFieldOffset
-+
+                (ck.getDeclaredField("value"));
+            Class<?> sc = Node[].class;
-<
+            ABASE = UNSAFE.arrayBaseOffset(sc);
-<
+            ss = UNSAFE.arrayIndexScale(sc);
->
+            ABASE = U.arrayBaseOffset(sc);
->
+            ss = U.arrayIndexScale(sc);
->
+            ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
+        } catch (Exception e) {
+            throw new Error(e);
+        if ((ss & (ss-1)) != 0)
+            throw new Error("data type scale not a power of two");
-–
+        ASHIFT = 31 - Integer.numberOfLeadingZeros(ss);
+    /**
-–

Diff Legend

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

Comparing jsr166/src/jsr166e/ConcurrentHashMapV8.java (file contents): Revision 1.38 by dl, Wed Jun 6 15:41:23 2012 UTC vs. Revision 1.84 by dl, Sat Dec 15 20:21:25 2012 UTC

Diff Legend

Comparing jsr166/src/jsr166e/ConcurrentHashMapV8.java (file contents):
Revision 1.38 by dl, Wed Jun 6 15:41:23 2012 UTC vs.
Revision 1.84 by dl, Sat Dec 15 20:21:25 2012 UTC