5 |
|
*/ |
6 |
|
|
7 |
|
package jsr166e; |
8 |
< |
import jsr166e.LongAdder; |
9 |
< |
import jsr166e.ForkJoinPool; |
10 |
< |
import jsr166e.ForkJoinTask; |
8 |
> |
|
9 |
> |
import java.util.Comparator; |
10 |
> |
import java.util.Arrays; |
11 |
> |
import java.util.Map; |
12 |
> |
import java.util.Set; |
13 |
> |
import java.util.Collection; |
14 |
> |
import java.util.AbstractMap; |
15 |
> |
import java.util.AbstractSet; |
16 |
> |
import java.util.AbstractCollection; |
17 |
> |
import java.util.Hashtable; |
18 |
> |
import java.util.HashMap; |
19 |
> |
import java.util.Iterator; |
20 |
> |
import java.util.Enumeration; |
21 |
> |
import java.util.ConcurrentModificationException; |
22 |
> |
import java.util.NoSuchElementException; |
23 |
> |
import java.util.concurrent.ConcurrentMap; |
24 |
> |
import java.util.concurrent.ThreadLocalRandom; |
25 |
> |
import java.util.concurrent.locks.LockSupport; |
26 |
> |
import java.util.concurrent.locks.AbstractQueuedSynchronizer; |
27 |
> |
import java.util.concurrent.atomic.AtomicReference; |
28 |
> |
|
29 |
> |
import java.io.Serializable; |
30 |
|
|
31 |
|
import java.util.Comparator; |
32 |
|
import java.util.Arrays; |
62 |
|
* interoperable with {@code Hashtable} in programs that rely on its |
63 |
|
* thread safety but not on its synchronization details. |
64 |
|
* |
65 |
< |
* <p> Retrieval operations (including {@code get}) generally do not |
65 |
> |
* <p>Retrieval operations (including {@code get}) generally do not |
66 |
|
* block, so may overlap with update operations (including {@code put} |
67 |
|
* and {@code remove}). Retrievals reflect the results of the most |
68 |
|
* recently <em>completed</em> update operations holding upon their |
83 |
|
* that may be adequate for monitoring or estimation purposes, but not |
84 |
|
* for program control. |
85 |
|
* |
86 |
< |
* <p> The table is dynamically expanded when there are too many |
86 |
> |
* <p>The table is dynamically expanded when there are too many |
87 |
|
* collisions (i.e., keys that have distinct hash codes but fall into |
88 |
|
* the same slot modulo the table size), with the expected average |
89 |
|
* effect of maintaining roughly two bins per mapping (corresponding |
104 |
|
* {@code hashCode()} is a sure way to slow down performance of any |
105 |
|
* hash table. |
106 |
|
* |
107 |
+ |
* <p>A {@link Set} projection of a ConcurrentHashMapV8 may be created |
108 |
+ |
* (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed |
109 |
+ |
* (using {@link #keySet(Object)} when only keys are of interest, and the |
110 |
+ |
* mapped values are (perhaps transiently) not used or all take the |
111 |
+ |
* same mapping value. |
112 |
+ |
* |
113 |
+ |
* <p>A ConcurrentHashMapV8 can be used as scalable frequency map (a |
114 |
+ |
* form of histogram or multiset) by using {@link LongAdder} values |
115 |
+ |
* and initializing via {@link #computeIfAbsent}. For example, to add |
116 |
+ |
* a count to a {@code ConcurrentHashMapV8<String,LongAdder> freqs}, you |
117 |
+ |
* can use {@code freqs.computeIfAbsent(k -> new |
118 |
+ |
* LongAdder()).increment();} |
119 |
+ |
* |
120 |
|
* <p>This class and its views and iterators implement all of the |
121 |
|
* <em>optional</em> methods of the {@link Map} and {@link Iterator} |
122 |
|
* interfaces. |
123 |
|
* |
124 |
< |
* <p> Like {@link Hashtable} but unlike {@link HashMap}, this class |
124 |
> |
* <p>Like {@link Hashtable} but unlike {@link HashMap}, this class |
125 |
|
* does <em>not</em> allow {@code null} to be used as a key or value. |
126 |
|
* |
127 |
+ |
* <p>ConcurrentHashMapV8s support parallel operations using the {@link |
128 |
+ |
* ForkJoinPool#commonPool}. (Tasks that may be used in other contexts |
129 |
+ |
* are available in class {@link ForkJoinTasks}). These operations are |
130 |
+ |
* designed to be safely, and often sensibly, applied even with maps |
131 |
+ |
* that are being concurrently updated by other threads; for example, |
132 |
+ |
* when computing a snapshot summary of the values in a shared |
133 |
+ |
* registry. There are three kinds of operation, each with four |
134 |
+ |
* forms, accepting functions with Keys, Values, Entries, and (Key, |
135 |
+ |
* Value) arguments and/or return values. (The first three forms are |
136 |
+ |
* also available via the {@link #keySet()}, {@link #values()} and |
137 |
+ |
* {@link #entrySet()} views). Because the elements of a |
138 |
+ |
* ConcurrentHashMapV8 are not ordered in any particular way, and may be |
139 |
+ |
* processed in different orders in different parallel executions, the |
140 |
+ |
* correctness of supplied functions should not depend on any |
141 |
+ |
* ordering, or on any other objects or values that may transiently |
142 |
+ |
* change while computation is in progress; and except for forEach |
143 |
+ |
* actions, should ideally be side-effect-free. |
144 |
+ |
* |
145 |
+ |
* <ul> |
146 |
+ |
* <li> forEach: Perform a given action on each element. |
147 |
+ |
* A variant form applies a given transformation on each element |
148 |
+ |
* before performing the action.</li> |
149 |
+ |
* |
150 |
+ |
* <li> search: Return the first available non-null result of |
151 |
+ |
* applying a given function on each element; skipping further |
152 |
+ |
* search when a result is found.</li> |
153 |
+ |
* |
154 |
+ |
* <li> reduce: Accumulate each element. The supplied reduction |
155 |
+ |
* function cannot rely on ordering (more formally, it should be |
156 |
+ |
* both associative and commutative). There are five variants: |
157 |
+ |
* |
158 |
+ |
* <ul> |
159 |
+ |
* |
160 |
+ |
* <li> Plain reductions. (There is not a form of this method for |
161 |
+ |
* (key, value) function arguments since there is no corresponding |
162 |
+ |
* return type.)</li> |
163 |
+ |
* |
164 |
+ |
* <li> Mapped reductions that accumulate the results of a given |
165 |
+ |
* function applied to each element.</li> |
166 |
+ |
* |
167 |
+ |
* <li> Reductions to scalar doubles, longs, and ints, using a |
168 |
+ |
* given basis value.</li> |
169 |
+ |
* |
170 |
+ |
* </li> |
171 |
+ |
* </ul> |
172 |
+ |
* </ul> |
173 |
+ |
* |
174 |
+ |
* <p>The concurrency properties of bulk operations follow |
175 |
+ |
* from those of ConcurrentHashMapV8: Any non-null result returned |
176 |
+ |
* from {@code get(key)} and related access methods bears a |
177 |
+ |
* happens-before relation with the associated insertion or |
178 |
+ |
* update. The result of any bulk operation reflects the |
179 |
+ |
* composition of these per-element relations (but is not |
180 |
+ |
* necessarily atomic with respect to the map as a whole unless it |
181 |
+ |
* is somehow known to be quiescent). Conversely, because keys |
182 |
+ |
* and values in the map are never null, null serves as a reliable |
183 |
+ |
* atomic indicator of the current lack of any result. To |
184 |
+ |
* maintain this property, null serves as an implicit basis for |
185 |
+ |
* all non-scalar reduction operations. For the double, long, and |
186 |
+ |
* int versions, the basis should be one that, when combined with |
187 |
+ |
* any other value, returns that other value (more formally, it |
188 |
+ |
* should be the identity element for the reduction). Most common |
189 |
+ |
* reductions have these properties; for example, computing a sum |
190 |
+ |
* with basis 0 or a minimum with basis MAX_VALUE. |
191 |
+ |
* |
192 |
+ |
* <p>Search and transformation functions provided as arguments |
193 |
+ |
* should similarly return null to indicate the lack of any result |
194 |
+ |
* (in which case it is not used). In the case of mapped |
195 |
+ |
* reductions, this also enables transformations to serve as |
196 |
+ |
* filters, returning null (or, in the case of primitive |
197 |
+ |
* specializations, the identity basis) if the element should not |
198 |
+ |
* be combined. You can create compound transformations and |
199 |
+ |
* filterings by composing them yourself under this "null means |
200 |
+ |
* there is nothing there now" rule before using them in search or |
201 |
+ |
* reduce operations. |
202 |
+ |
* |
203 |
+ |
* <p>Methods accepting and/or returning Entry arguments maintain |
204 |
+ |
* key-value associations. They may be useful for example when |
205 |
+ |
* finding the key for the greatest value. Note that "plain" Entry |
206 |
+ |
* arguments can be supplied using {@code new |
207 |
+ |
* AbstractMap.SimpleEntry(k,v)}. |
208 |
+ |
* |
209 |
+ |
* <p>Bulk operations may complete abruptly, throwing an |
210 |
+ |
* exception encountered in the application of a supplied |
211 |
+ |
* function. Bear in mind when handling such exceptions that other |
212 |
+ |
* concurrently executing functions could also have thrown |
213 |
+ |
* exceptions, or would have done so if the first exception had |
214 |
+ |
* not occurred. |
215 |
+ |
* |
216 |
+ |
* <p>Parallel speedups for bulk operations compared to sequential |
217 |
+ |
* processing are common but not guaranteed. Operations involving |
218 |
+ |
* brief functions on small maps may execute more slowly than |
219 |
+ |
* sequential loops if the underlying work to parallelize the |
220 |
+ |
* computation is more expensive than the computation itself. |
221 |
+ |
* Similarly, parallelization may not lead to much actual parallelism |
222 |
+ |
* if all processors are busy performing unrelated tasks. |
223 |
+ |
* |
224 |
+ |
* <p>All arguments to all task methods must be non-null. |
225 |
+ |
* |
226 |
+ |
* <p><em>jsr166e note: During transition, this class |
227 |
+ |
* uses nested functional interfaces with different names but the |
228 |
+ |
* same forms as those expected for JDK8.</em> |
229 |
+ |
* |
230 |
|
* <p>This class is a member of the |
231 |
|
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
232 |
|
* Java Collections Framework</a>. |
233 |
|
* |
99 |
– |
* <p><em>jsr166e note: This class is a candidate replacement for |
100 |
– |
* java.util.concurrent.ConcurrentHashMap. During transition, this |
101 |
– |
* class declares and uses nested functional interfaces with different |
102 |
– |
* names but the same forms as those expected for JDK8.<em> |
103 |
– |
* |
234 |
|
* @since 1.5 |
235 |
|
* @author Doug Lea |
236 |
|
* @param <K> the type of keys maintained by this map |
247 |
|
* portion of the elements, and so may be amenable to parallel |
248 |
|
* execution. |
249 |
|
* |
250 |
< |
* <p> This interface exports a subset of expected JDK8 |
250 |
> |
* <p>This interface exports a subset of expected JDK8 |
251 |
|
* functionality. |
252 |
|
* |
253 |
|
* <p>Sample usage: Here is one (of the several) ways to compute |
309 |
|
Spliterator<T> split(); |
310 |
|
} |
311 |
|
|
312 |
+ |
|
313 |
|
/* |
314 |
|
* Overview: |
315 |
|
* |
592 |
|
private transient volatile int sizeCtl; |
593 |
|
|
594 |
|
// views |
595 |
< |
private transient KeySet<K,V> keySet; |
596 |
< |
private transient Values<K,V> values; |
597 |
< |
private transient EntrySet<K,V> entrySet; |
595 |
> |
private transient KeySetView<K,V> keySet; |
596 |
> |
private transient ValuesView<K,V> values; |
597 |
> |
private transient EntrySetView<K,V> entrySet; |
598 |
|
|
599 |
|
/** For serialization compatibility. Null unless serialized; see below */ |
600 |
|
private Segment<K,V>[] segments; |
693 |
|
try { |
694 |
|
wait(); |
695 |
|
} catch (InterruptedException ie) { |
696 |
< |
Thread.currentThread().interrupt(); |
696 |
> |
try { |
697 |
> |
Thread.currentThread().interrupt(); |
698 |
> |
} catch (SecurityException ignore) { |
699 |
> |
} |
700 |
|
} |
701 |
|
} |
702 |
|
else |
2377 |
|
* change (including to null, indicating deletion), field nextVal |
2378 |
|
* might not be accurate at point of use, but still maintains the |
2379 |
|
* weak consistency property of holding a value that was once |
2380 |
< |
* valid. |
2380 |
> |
* valid. To support iterator.remove, the nextKey field is not |
2381 |
> |
* updated (nulled out) when the iterator cannot advance. |
2382 |
|
* |
2383 |
|
* Internal traversals directly access these fields, as in: |
2384 |
|
* {@code while (it.advance() != null) { process(it.nextKey); }} |
2405 |
|
* across threads, iteration terminates if a bounds checks fails |
2406 |
|
* for a table read. |
2407 |
|
* |
2408 |
< |
* This class extends ForkJoinTask to streamline parallel |
2409 |
< |
* iteration in bulk operations (see BulkTask). This adds only an |
2410 |
< |
* int of space overhead, which is close enough to negligible in |
2411 |
< |
* cases where it is not needed to not worry about it. Because |
2412 |
< |
* ForkJoinTask is Serializable, but iterators need not be, we |
2413 |
< |
* need to add warning suppressions. |
2408 |
> |
* This class extends CountedCompleter to streamline parallel |
2409 |
> |
* iteration in bulk operations. This adds only a few fields of |
2410 |
> |
* space overhead, which is small enough in cases where it is not |
2411 |
> |
* needed to not worry about it. Because CountedCompleter is |
2412 |
> |
* Serializable, but iterators need not be, we need to add warning |
2413 |
> |
* suppressions. |
2414 |
|
*/ |
2415 |
< |
@SuppressWarnings("serial") static class Traverser<K,V,R> extends ForkJoinTask<R> { |
2415 |
> |
@SuppressWarnings("serial") static class Traverser<K,V,R> extends CountedCompleter<R> { |
2416 |
|
final ConcurrentHashMapV8<K, V> map; |
2417 |
|
Node next; // the next entry to use |
2283 |
– |
Node last; // the last entry used |
2418 |
|
Object nextKey; // cached key field of next |
2419 |
|
Object nextVal; // cached val field of next |
2420 |
|
Node[] tab; // current table; updated if resized |
2422 |
|
int baseIndex; // current index of initial table |
2423 |
|
int baseLimit; // index bound for initial table |
2424 |
|
int baseSize; // initial table size |
2425 |
+ |
int batch; // split control |
2426 |
|
|
2427 |
|
/** Creates iterator for all entries in the table. */ |
2428 |
|
Traverser(ConcurrentHashMapV8<K, V> map) { |
2429 |
|
this.map = map; |
2430 |
|
} |
2431 |
|
|
2432 |
< |
/** Creates iterator for split() methods */ |
2433 |
< |
Traverser(Traverser<K,V,?> it) { |
2434 |
< |
ConcurrentHashMapV8<K, V> m; Node[] t; |
2435 |
< |
if ((m = this.map = it.map) == null) |
2436 |
< |
t = null; |
2437 |
< |
else if ((t = it.tab) == null && // force parent tab initialization |
2438 |
< |
(t = it.tab = m.table) != null) |
2439 |
< |
it.baseLimit = it.baseSize = t.length; |
2440 |
< |
this.tab = t; |
2441 |
< |
this.baseSize = it.baseSize; |
2442 |
< |
it.baseLimit = this.index = this.baseIndex = |
2443 |
< |
((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1; |
2432 |
> |
/** Creates iterator for split() methods and task constructors */ |
2433 |
> |
Traverser(ConcurrentHashMapV8<K,V> map, Traverser<K,V,?> it, int batch) { |
2434 |
> |
super(it); |
2435 |
> |
this.batch = batch; |
2436 |
> |
if ((this.map = map) != null && it != null) { // split parent |
2437 |
> |
Node[] t; |
2438 |
> |
if ((t = it.tab) == null && |
2439 |
> |
(t = it.tab = map.table) != null) |
2440 |
> |
it.baseLimit = it.baseSize = t.length; |
2441 |
> |
this.tab = t; |
2442 |
> |
this.baseSize = it.baseSize; |
2443 |
> |
int hi = this.baseLimit = it.baseLimit; |
2444 |
> |
it.baseLimit = this.index = this.baseIndex = |
2445 |
> |
(hi + it.baseIndex + 1) >>> 1; |
2446 |
> |
} |
2447 |
|
} |
2448 |
|
|
2449 |
|
/** |
2451 |
|
* See above for explanation. |
2452 |
|
*/ |
2453 |
|
final Object advance() { |
2454 |
< |
Node e = last = next; |
2454 |
> |
Node e = next; |
2455 |
|
Object ev = null; |
2456 |
|
outer: do { |
2457 |
|
if (e != null) // advance past used/skipped node |
2485 |
|
} |
2486 |
|
|
2487 |
|
public final void remove() { |
2488 |
< |
if (nextVal == null && last == null) |
2489 |
< |
advance(); |
2352 |
< |
Node e = last; |
2353 |
< |
if (e == null) |
2488 |
> |
Object k = nextKey; |
2489 |
> |
if (k == null && (advance() == null || (k = nextKey) == null)) |
2490 |
|
throw new IllegalStateException(); |
2491 |
< |
last = null; |
2356 |
< |
map.remove(e.key); |
2491 |
> |
map.internalReplace(k, null, null); |
2492 |
|
} |
2493 |
|
|
2494 |
|
public final boolean hasNext() { |
2496 |
|
} |
2497 |
|
|
2498 |
|
public final boolean hasMoreElements() { return hasNext(); } |
2499 |
< |
public final void setRawResult(Object x) { } |
2500 |
< |
public R getRawResult() { return null; } |
2501 |
< |
public boolean exec() { return true; } |
2499 |
> |
|
2500 |
> |
public void compute() { } // default no-op CountedCompleter body |
2501 |
> |
|
2502 |
> |
/** |
2503 |
> |
* Returns a batch value > 0 if this task should (and must) be |
2504 |
> |
* split, if so, adding to pending count, and in any case |
2505 |
> |
* updating batch value. The initial batch value is approx |
2506 |
> |
* exp2 of the number of times (minus one) to split task by |
2507 |
> |
* two before executing leaf action. This value is faster to |
2508 |
> |
* compute and more convenient to use as a guide to splitting |
2509 |
> |
* than is the depth, since it is used while dividing by two |
2510 |
> |
* anyway. |
2511 |
> |
*/ |
2512 |
> |
final int preSplit() { |
2513 |
> |
ConcurrentHashMapV8<K, V> m; int b; Node[] t; ForkJoinPool pool; |
2514 |
> |
if ((b = batch) < 0 && (m = map) != null) { // force initialization |
2515 |
> |
if ((t = tab) == null && (t = tab = m.table) != null) |
2516 |
> |
baseLimit = baseSize = t.length; |
2517 |
> |
if (t != null) { |
2518 |
> |
long n = m.counter.sum(); |
2519 |
> |
int par = ((pool = getPool()) == null) ? |
2520 |
> |
ForkJoinPool.getCommonPoolParallelism() : |
2521 |
> |
pool.getParallelism(); |
2522 |
> |
int sp = par << 3; // slack of 8 |
2523 |
> |
b = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp; |
2524 |
> |
} |
2525 |
> |
} |
2526 |
> |
b = (b <= 1 || baseIndex == baseLimit) ? 0 : (b >>> 1); |
2527 |
> |
if ((batch = b) > 0) |
2528 |
> |
addToPendingCount(1); |
2529 |
> |
return b; |
2530 |
> |
} |
2531 |
> |
|
2532 |
|
} |
2533 |
|
|
2534 |
|
/* ---------------- Public operations -------------- */ |
2622 |
|
} |
2623 |
|
|
2624 |
|
/** |
2625 |
+ |
* Creates a new {@link Set} backed by a ConcurrentHashMapV8 |
2626 |
+ |
* from the given type to {@code Boolean.TRUE}. |
2627 |
+ |
* |
2628 |
+ |
* @return the new set |
2629 |
+ |
*/ |
2630 |
+ |
public static <K> KeySetView<K,Boolean> newKeySet() { |
2631 |
+ |
return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(), |
2632 |
+ |
Boolean.TRUE); |
2633 |
+ |
} |
2634 |
+ |
|
2635 |
+ |
/** |
2636 |
+ |
* Creates a new {@link Set} backed by a ConcurrentHashMapV8 |
2637 |
+ |
* from the given type to {@code Boolean.TRUE}. |
2638 |
+ |
* |
2639 |
+ |
* @param initialCapacity The implementation performs internal |
2640 |
+ |
* sizing to accommodate this many elements. |
2641 |
+ |
* @throws IllegalArgumentException if the initial capacity of |
2642 |
+ |
* elements is negative |
2643 |
+ |
* @return the new set |
2644 |
+ |
*/ |
2645 |
+ |
public static <K> KeySetView<K,Boolean> newKeySet(int initialCapacity) { |
2646 |
+ |
return new KeySetView<K,Boolean>(new ConcurrentHashMapV8<K,Boolean>(initialCapacity), |
2647 |
+ |
Boolean.TRUE); |
2648 |
+ |
} |
2649 |
+ |
|
2650 |
+ |
/** |
2651 |
|
* {@inheritDoc} |
2652 |
|
*/ |
2653 |
|
public boolean isEmpty() { |
2666 |
|
|
2667 |
|
/** |
2668 |
|
* Returns the number of mappings. This method should be used |
2669 |
< |
* instead of {@link #size} because a ConcurrentHashMap may |
2669 |
> |
* instead of {@link #size} because a ConcurrentHashMapV8 may |
2670 |
|
* contain more mappings than can be represented as an int. The |
2671 |
< |
* value returned is a snapshot; the actual count may differ if |
2672 |
< |
* there are ongoing concurrent insertions or removals. |
2671 |
> |
* value returned is an estimate; the actual count may differ if |
2672 |
> |
* there are concurrent insertions or removals. |
2673 |
|
* |
2674 |
|
* @return the number of mappings |
2675 |
|
*/ |
2772 |
|
* Maps the specified key to the specified value in this table. |
2773 |
|
* Neither the key nor the value can be null. |
2774 |
|
* |
2775 |
< |
* <p> The value can be retrieved by calling the {@code get} method |
2775 |
> |
* <p>The value can be retrieved by calling the {@code get} method |
2776 |
|
* with a key that is equal to the original key. |
2777 |
|
* |
2778 |
|
* @param key key with which the specified value is to be associated |
3039 |
|
/** |
3040 |
|
* Returns a {@link Set} view of the keys contained in this map. |
3041 |
|
* The set is backed by the map, so changes to the map are |
3042 |
< |
* reflected in the set, and vice-versa. The set supports element |
2852 |
< |
* removal, which removes the corresponding mapping from this map, |
2853 |
< |
* via the {@code Iterator.remove}, {@code Set.remove}, |
2854 |
< |
* {@code removeAll}, {@code retainAll}, and {@code clear} |
2855 |
< |
* operations. It does not support the {@code add} or |
2856 |
< |
* {@code addAll} operations. |
3042 |
> |
* reflected in the set, and vice-versa. |
3043 |
|
* |
3044 |
< |
* <p>The view's {@code iterator} is a "weakly consistent" iterator |
2859 |
< |
* that will never throw {@link ConcurrentModificationException}, |
2860 |
< |
* and guarantees to traverse elements as they existed upon |
2861 |
< |
* construction of the iterator, and may (but is not guaranteed to) |
2862 |
< |
* reflect any modifications subsequent to construction. |
3044 |
> |
* @return the set view |
3045 |
|
*/ |
3046 |
< |
public Set<K> keySet() { |
3047 |
< |
KeySet<K,V> ks = keySet; |
3048 |
< |
return (ks != null) ? ks : (keySet = new KeySet<K,V>(this)); |
3046 |
> |
public KeySetView<K,V> keySet() { |
3047 |
> |
KeySetView<K,V> ks = keySet; |
3048 |
> |
return (ks != null) ? ks : (keySet = new KeySetView<K,V>(this, null)); |
3049 |
> |
} |
3050 |
> |
|
3051 |
> |
/** |
3052 |
> |
* Returns a {@link Set} view of the keys in this map, using the |
3053 |
> |
* given common mapped value for any additions (i.e., {@link |
3054 |
> |
* Collection#add} and {@link Collection#addAll}). This is of |
3055 |
> |
* course only appropriate if it is acceptable to use the same |
3056 |
> |
* value for all additions from this view. |
3057 |
> |
* |
3058 |
> |
* @param mappedValue the mapped value to use for any |
3059 |
> |
* additions. |
3060 |
> |
* @return the set view |
3061 |
> |
* @throws NullPointerException if the mappedValue is null |
3062 |
> |
*/ |
3063 |
> |
public KeySetView<K,V> keySet(V mappedValue) { |
3064 |
> |
if (mappedValue == null) |
3065 |
> |
throw new NullPointerException(); |
3066 |
> |
return new KeySetView<K,V>(this, mappedValue); |
3067 |
|
} |
3068 |
|
|
3069 |
|
/** |
3070 |
|
* Returns a {@link Collection} view of the values contained in this map. |
3071 |
|
* The collection is backed by the map, so changes to the map are |
3072 |
< |
* reflected in the collection, and vice-versa. The collection |
2873 |
< |
* supports element removal, which removes the corresponding |
2874 |
< |
* mapping from this map, via the {@code Iterator.remove}, |
2875 |
< |
* {@code Collection.remove}, {@code removeAll}, |
2876 |
< |
* {@code retainAll}, and {@code clear} operations. It does not |
2877 |
< |
* support the {@code add} or {@code addAll} operations. |
2878 |
< |
* |
2879 |
< |
* <p>The view's {@code iterator} is a "weakly consistent" iterator |
2880 |
< |
* that will never throw {@link ConcurrentModificationException}, |
2881 |
< |
* and guarantees to traverse elements as they existed upon |
2882 |
< |
* construction of the iterator, and may (but is not guaranteed to) |
2883 |
< |
* reflect any modifications subsequent to construction. |
3072 |
> |
* reflected in the collection, and vice-versa. |
3073 |
|
*/ |
3074 |
< |
public Collection<V> values() { |
3075 |
< |
Values<K,V> vs = values; |
3076 |
< |
return (vs != null) ? vs : (values = new Values<K,V>(this)); |
3074 |
> |
public ValuesView<K,V> values() { |
3075 |
> |
ValuesView<K,V> vs = values; |
3076 |
> |
return (vs != null) ? vs : (values = new ValuesView<K,V>(this)); |
3077 |
|
} |
3078 |
|
|
3079 |
|
/** |
3093 |
|
* reflect any modifications subsequent to construction. |
3094 |
|
*/ |
3095 |
|
public Set<Map.Entry<K,V>> entrySet() { |
3096 |
< |
EntrySet<K,V> es = entrySet; |
3097 |
< |
return (es != null) ? es : (entrySet = new EntrySet<K,V>(this)); |
3096 |
> |
EntrySetView<K,V> es = entrySet; |
3097 |
> |
return (es != null) ? es : (entrySet = new EntrySetView<K,V>(this)); |
3098 |
|
} |
3099 |
|
|
3100 |
|
/** |
3230 |
|
@SuppressWarnings("serial") static final class KeyIterator<K,V> extends Traverser<K,V,Object> |
3231 |
|
implements Spliterator<K>, Enumeration<K> { |
3232 |
|
KeyIterator(ConcurrentHashMapV8<K, V> map) { super(map); } |
3233 |
< |
KeyIterator(Traverser<K,V,Object> it) { |
3234 |
< |
super(it); |
3233 |
> |
KeyIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) { |
3234 |
> |
super(map, it, -1); |
3235 |
|
} |
3236 |
|
public KeyIterator<K,V> split() { |
3237 |
< |
if (last != null || (next != null && nextVal == null)) |
3237 |
> |
if (nextKey != null) |
3238 |
|
throw new IllegalStateException(); |
3239 |
< |
return new KeyIterator<K,V>(this); |
3239 |
> |
return new KeyIterator<K,V>(map, this); |
3240 |
|
} |
3241 |
|
@SuppressWarnings("unchecked") public final K next() { |
3242 |
|
if (nextVal == null && advance() == null) |
3252 |
|
@SuppressWarnings("serial") static final class ValueIterator<K,V> extends Traverser<K,V,Object> |
3253 |
|
implements Spliterator<V>, Enumeration<V> { |
3254 |
|
ValueIterator(ConcurrentHashMapV8<K, V> map) { super(map); } |
3255 |
< |
ValueIterator(Traverser<K,V,Object> it) { |
3256 |
< |
super(it); |
3255 |
> |
ValueIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) { |
3256 |
> |
super(map, it, -1); |
3257 |
|
} |
3258 |
|
public ValueIterator<K,V> split() { |
3259 |
< |
if (last != null || (next != null && nextVal == null)) |
3259 |
> |
if (nextKey != null) |
3260 |
|
throw new IllegalStateException(); |
3261 |
< |
return new ValueIterator<K,V>(this); |
3261 |
> |
return new ValueIterator<K,V>(map, this); |
3262 |
|
} |
3263 |
|
|
3264 |
|
@SuppressWarnings("unchecked") public final V next() { |
3275 |
|
@SuppressWarnings("serial") static final class EntryIterator<K,V> extends Traverser<K,V,Object> |
3276 |
|
implements Spliterator<Map.Entry<K,V>> { |
3277 |
|
EntryIterator(ConcurrentHashMapV8<K, V> map) { super(map); } |
3278 |
< |
EntryIterator(Traverser<K,V,Object> it) { |
3279 |
< |
super(it); |
3278 |
> |
EntryIterator(ConcurrentHashMapV8<K, V> map, Traverser<K,V,Object> it) { |
3279 |
> |
super(map, it, -1); |
3280 |
|
} |
3281 |
|
public EntryIterator<K,V> split() { |
3282 |
< |
if (last != null || (next != null && nextVal == null)) |
3282 |
> |
if (nextKey != null) |
3283 |
|
throw new IllegalStateException(); |
3284 |
< |
return new EntryIterator<K,V>(this); |
3284 |
> |
return new EntryIterator<K,V>(map, this); |
3285 |
|
} |
3286 |
|
|
3287 |
|
@SuppressWarnings("unchecked") public final Map.Entry<K,V> next() { |
3337 |
|
} |
3338 |
|
} |
3339 |
|
|
3151 |
– |
/* ----------------Views -------------- */ |
3152 |
– |
|
3340 |
|
/** |
3341 |
< |
* Base class for views. |
3341 |
> |
* Returns exportable snapshot entry for the given key and value |
3342 |
> |
* when write-through can't or shouldn't be used. |
3343 |
|
*/ |
3344 |
< |
static abstract class CHMView<K, V> { |
3345 |
< |
final ConcurrentHashMapV8<K, V> map; |
3158 |
< |
CHMView(ConcurrentHashMapV8<K, V> map) { this.map = map; } |
3159 |
< |
public final int size() { return map.size(); } |
3160 |
< |
public final boolean isEmpty() { return map.isEmpty(); } |
3161 |
< |
public final void clear() { map.clear(); } |
3162 |
< |
|
3163 |
< |
// implementations below rely on concrete classes supplying these |
3164 |
< |
abstract public Iterator<?> iterator(); |
3165 |
< |
abstract public boolean contains(Object o); |
3166 |
< |
abstract public boolean remove(Object o); |
3167 |
< |
|
3168 |
< |
private static final String oomeMsg = "Required array size too large"; |
3169 |
< |
|
3170 |
< |
public final Object[] toArray() { |
3171 |
< |
long sz = map.mappingCount(); |
3172 |
< |
if (sz > (long)(MAX_ARRAY_SIZE)) |
3173 |
< |
throw new OutOfMemoryError(oomeMsg); |
3174 |
< |
int n = (int)sz; |
3175 |
< |
Object[] r = new Object[n]; |
3176 |
< |
int i = 0; |
3177 |
< |
Iterator<?> it = iterator(); |
3178 |
< |
while (it.hasNext()) { |
3179 |
< |
if (i == n) { |
3180 |
< |
if (n >= MAX_ARRAY_SIZE) |
3181 |
< |
throw new OutOfMemoryError(oomeMsg); |
3182 |
< |
if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) |
3183 |
< |
n = MAX_ARRAY_SIZE; |
3184 |
< |
else |
3185 |
< |
n += (n >>> 1) + 1; |
3186 |
< |
r = Arrays.copyOf(r, n); |
3187 |
< |
} |
3188 |
< |
r[i++] = it.next(); |
3189 |
< |
} |
3190 |
< |
return (i == n) ? r : Arrays.copyOf(r, i); |
3191 |
< |
} |
3192 |
< |
|
3193 |
< |
@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) { |
3194 |
< |
long sz = map.mappingCount(); |
3195 |
< |
if (sz > (long)(MAX_ARRAY_SIZE)) |
3196 |
< |
throw new OutOfMemoryError(oomeMsg); |
3197 |
< |
int m = (int)sz; |
3198 |
< |
T[] r = (a.length >= m) ? a : |
3199 |
< |
(T[])java.lang.reflect.Array |
3200 |
< |
.newInstance(a.getClass().getComponentType(), m); |
3201 |
< |
int n = r.length; |
3202 |
< |
int i = 0; |
3203 |
< |
Iterator<?> it = iterator(); |
3204 |
< |
while (it.hasNext()) { |
3205 |
< |
if (i == n) { |
3206 |
< |
if (n >= MAX_ARRAY_SIZE) |
3207 |
< |
throw new OutOfMemoryError(oomeMsg); |
3208 |
< |
if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) |
3209 |
< |
n = MAX_ARRAY_SIZE; |
3210 |
< |
else |
3211 |
< |
n += (n >>> 1) + 1; |
3212 |
< |
r = Arrays.copyOf(r, n); |
3213 |
< |
} |
3214 |
< |
r[i++] = (T)it.next(); |
3215 |
< |
} |
3216 |
< |
if (a == r && i < n) { |
3217 |
< |
r[i] = null; // null-terminate |
3218 |
< |
return r; |
3219 |
< |
} |
3220 |
< |
return (i == n) ? r : Arrays.copyOf(r, i); |
3221 |
< |
} |
3222 |
< |
|
3223 |
< |
public final int hashCode() { |
3224 |
< |
int h = 0; |
3225 |
< |
for (Iterator<?> it = iterator(); it.hasNext();) |
3226 |
< |
h += it.next().hashCode(); |
3227 |
< |
return h; |
3228 |
< |
} |
3229 |
< |
|
3230 |
< |
public final String toString() { |
3231 |
< |
StringBuilder sb = new StringBuilder(); |
3232 |
< |
sb.append('['); |
3233 |
< |
Iterator<?> it = iterator(); |
3234 |
< |
if (it.hasNext()) { |
3235 |
< |
for (;;) { |
3236 |
< |
Object e = it.next(); |
3237 |
< |
sb.append(e == this ? "(this Collection)" : e); |
3238 |
< |
if (!it.hasNext()) |
3239 |
< |
break; |
3240 |
< |
sb.append(',').append(' '); |
3241 |
< |
} |
3242 |
< |
} |
3243 |
< |
return sb.append(']').toString(); |
3244 |
< |
} |
3245 |
< |
|
3246 |
< |
public final boolean containsAll(Collection<?> c) { |
3247 |
< |
if (c != this) { |
3248 |
< |
for (Iterator<?> it = c.iterator(); it.hasNext();) { |
3249 |
< |
Object e = it.next(); |
3250 |
< |
if (e == null || !contains(e)) |
3251 |
< |
return false; |
3252 |
< |
} |
3253 |
< |
} |
3254 |
< |
return true; |
3255 |
< |
} |
3256 |
< |
|
3257 |
< |
public final boolean removeAll(Collection<?> c) { |
3258 |
< |
boolean modified = false; |
3259 |
< |
for (Iterator<?> it = iterator(); it.hasNext();) { |
3260 |
< |
if (c.contains(it.next())) { |
3261 |
< |
it.remove(); |
3262 |
< |
modified = true; |
3263 |
< |
} |
3264 |
< |
} |
3265 |
< |
return modified; |
3266 |
< |
} |
3267 |
< |
|
3268 |
< |
public final boolean retainAll(Collection<?> c) { |
3269 |
< |
boolean modified = false; |
3270 |
< |
for (Iterator<?> it = iterator(); it.hasNext();) { |
3271 |
< |
if (!c.contains(it.next())) { |
3272 |
< |
it.remove(); |
3273 |
< |
modified = true; |
3274 |
< |
} |
3275 |
< |
} |
3276 |
< |
return modified; |
3277 |
< |
} |
3278 |
< |
|
3279 |
< |
} |
3280 |
< |
|
3281 |
< |
static final class KeySet<K,V> extends CHMView<K,V> implements Set<K> { |
3282 |
< |
KeySet(ConcurrentHashMapV8<K, V> map) { |
3283 |
< |
super(map); |
3284 |
< |
} |
3285 |
< |
public final boolean contains(Object o) { return map.containsKey(o); } |
3286 |
< |
public final boolean remove(Object o) { return map.remove(o) != null; } |
3287 |
< |
public final Iterator<K> iterator() { |
3288 |
< |
return new KeyIterator<K,V>(map); |
3289 |
< |
} |
3290 |
< |
public final boolean add(K e) { |
3291 |
< |
throw new UnsupportedOperationException(); |
3292 |
< |
} |
3293 |
< |
public final boolean addAll(Collection<? extends K> c) { |
3294 |
< |
throw new UnsupportedOperationException(); |
3295 |
< |
} |
3296 |
< |
public boolean equals(Object o) { |
3297 |
< |
Set<?> c; |
3298 |
< |
return ((o instanceof Set) && |
3299 |
< |
((c = (Set<?>)o) == this || |
3300 |
< |
(containsAll(c) && c.containsAll(this)))); |
3301 |
< |
} |
3302 |
< |
} |
3303 |
< |
|
3304 |
< |
|
3305 |
< |
static final class Values<K,V> extends CHMView<K,V> |
3306 |
< |
implements Collection<V> { |
3307 |
< |
Values(ConcurrentHashMapV8<K, V> map) { super(map); } |
3308 |
< |
public final boolean contains(Object o) { return map.containsValue(o); } |
3309 |
< |
public final boolean remove(Object o) { |
3310 |
< |
if (o != null) { |
3311 |
< |
Iterator<V> it = new ValueIterator<K,V>(map); |
3312 |
< |
while (it.hasNext()) { |
3313 |
< |
if (o.equals(it.next())) { |
3314 |
< |
it.remove(); |
3315 |
< |
return true; |
3316 |
< |
} |
3317 |
< |
} |
3318 |
< |
} |
3319 |
< |
return false; |
3320 |
< |
} |
3321 |
< |
public final Iterator<V> iterator() { |
3322 |
< |
return new ValueIterator<K,V>(map); |
3323 |
< |
} |
3324 |
< |
public final boolean add(V e) { |
3325 |
< |
throw new UnsupportedOperationException(); |
3326 |
< |
} |
3327 |
< |
public final boolean addAll(Collection<? extends V> c) { |
3328 |
< |
throw new UnsupportedOperationException(); |
3329 |
< |
} |
3330 |
< |
|
3331 |
< |
} |
3332 |
< |
|
3333 |
< |
static final class EntrySet<K,V> extends CHMView<K,V> |
3334 |
< |
implements Set<Map.Entry<K,V>> { |
3335 |
< |
EntrySet(ConcurrentHashMapV8<K, V> map) { super(map); } |
3336 |
< |
public final boolean contains(Object o) { |
3337 |
< |
Object k, v, r; Map.Entry<?,?> e; |
3338 |
< |
return ((o instanceof Map.Entry) && |
3339 |
< |
(k = (e = (Map.Entry<?,?>)o).getKey()) != null && |
3340 |
< |
(r = map.get(k)) != null && |
3341 |
< |
(v = e.getValue()) != null && |
3342 |
< |
(v == r || v.equals(r))); |
3343 |
< |
} |
3344 |
< |
public final boolean remove(Object o) { |
3345 |
< |
Object k, v; Map.Entry<?,?> e; |
3346 |
< |
return ((o instanceof Map.Entry) && |
3347 |
< |
(k = (e = (Map.Entry<?,?>)o).getKey()) != null && |
3348 |
< |
(v = e.getValue()) != null && |
3349 |
< |
map.remove(k, v)); |
3350 |
< |
} |
3351 |
< |
public final Iterator<Map.Entry<K,V>> iterator() { |
3352 |
< |
return new EntryIterator<K,V>(map); |
3353 |
< |
} |
3354 |
< |
public final boolean add(Entry<K,V> e) { |
3355 |
< |
throw new UnsupportedOperationException(); |
3356 |
< |
} |
3357 |
< |
public final boolean addAll(Collection<? extends Entry<K,V>> c) { |
3358 |
< |
throw new UnsupportedOperationException(); |
3359 |
< |
} |
3360 |
< |
public boolean equals(Object o) { |
3361 |
< |
Set<?> c; |
3362 |
< |
return ((o instanceof Set) && |
3363 |
< |
((c = (Set<?>)o) == this || |
3364 |
< |
(containsAll(c) && c.containsAll(this)))); |
3365 |
< |
} |
3344 |
> |
static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) { |
3345 |
> |
return new AbstractMap.SimpleEntry<K,V>(k, v); |
3346 |
|
} |
3347 |
|
|
3348 |
|
/* ---------------- Serialization Support -------------- */ |
3511 |
|
// ------------------------------------------------------- |
3512 |
|
|
3513 |
|
/** |
3514 |
< |
* Returns an extended {@link Parallel} view of this map using the |
3535 |
< |
* given executor for bulk parallel operations. |
3514 |
> |
* Performs the given action for each (key, value). |
3515 |
|
* |
3516 |
< |
* @param executor the executor |
3538 |
< |
* @return a parallel view |
3516 |
> |
* @param action the action |
3517 |
|
*/ |
3518 |
< |
public Parallel parallel(ForkJoinPool executor) { |
3519 |
< |
return new Parallel(executor); |
3518 |
> |
public void forEach(BiAction<K,V> action) { |
3519 |
> |
ForkJoinTasks.forEach |
3520 |
> |
(this, action).invoke(); |
3521 |
|
} |
3522 |
|
|
3523 |
|
/** |
3524 |
< |
* An extended view of a ConcurrentHashMap supporting bulk |
3525 |
< |
* parallel operations. These operations are designed to be |
3526 |
< |
* safely, and often sensibly, applied even with maps that are |
3527 |
< |
* being concurrently updated by other threads; for example, when |
3528 |
< |
* computing a snapshot summary of the values in a shared |
3529 |
< |
* registry. There are three kinds of operation, each with four |
3530 |
< |
* forms, accepting functions with Keys, Values, Entries, and |
3531 |
< |
* (Key, Value) arguments and/or return values. Because the |
3532 |
< |
* elements of a ConcurrentHashMap are not ordered in any |
3533 |
< |
* particular way, and may be processed in different orders in |
3534 |
< |
* different parallel executions, the correctness of supplied |
3535 |
< |
* functions should not depend on any ordering, or on any other |
3536 |
< |
* objects or values that may transiently change while computation |
3537 |
< |
* is in progress; and except for forEach actions, should ideally |
3538 |
< |
* be side-effect-free. |
3539 |
< |
* |
3540 |
< |
* <ul> |
3541 |
< |
* <li> forEach: Perform a given action on each element. |
3542 |
< |
* A variant form applies a given transformation on each element |
3543 |
< |
* before performing the action.</li> |
3544 |
< |
* |
3545 |
< |
* <li> search: Return the first available non-null result of |
3546 |
< |
* applying a given function on each element; skipping further |
3547 |
< |
* search when a result is found.</li> |
3548 |
< |
* |
3549 |
< |
* <li> reduce: Accumulate each element. The supplied reduction |
3550 |
< |
* function cannot rely on ordering (more formally, it should be |
3551 |
< |
* both associative and commutative). There are five variants: |
3552 |
< |
* |
3553 |
< |
* <ul> |
3554 |
< |
* |
3555 |
< |
* <li> Plain reductions. (There is not a form of this method for |
3556 |
< |
* (key, value) function arguments since there is no corresponding |
3557 |
< |
* return type.)</li> |
3558 |
< |
* |
3559 |
< |
* <li> Mapped reductions that accumulate the results of a given |
3560 |
< |
* function applied to each element.</li> |
3561 |
< |
* |
3562 |
< |
* <li> Reductions to scalar doubles, longs, and ints, using a |
3563 |
< |
* given basis value.</li> |
3564 |
< |
* |
3565 |
< |
* </li> |
3566 |
< |
* </ul> |
3567 |
< |
* </ul> |
3568 |
< |
* |
3569 |
< |
* <p>The concurrency properties of the bulk operations follow |
3570 |
< |
* from those of ConcurrentHashMap: Any non-null result returned |
3571 |
< |
* from {@code get(key)} and related access methods bears a |
3572 |
< |
* happens-before relation with the associated insertion or |
3573 |
< |
* update. The result of any bulk operation reflects the |
3574 |
< |
* composition of these per-element relations (but is not |
3575 |
< |
* necessarily atomic with respect to the map as a whole unless it |
3576 |
< |
* is somehow known to be quiescent). Conversely, because keys |
3577 |
< |
* and values in the map are never null, null serves as a reliable |
3578 |
< |
* atomic indicator of the current lack of any result. To |
3579 |
< |
* maintain this property, null serves as an implicit basis for |
3580 |
< |
* all non-scalar reduction operations. For the double, long, and |
3581 |
< |
* int versions, the basis should be one that, when combined with |
3582 |
< |
* any other value, returns that other value (more formally, it |
3583 |
< |
* should be the identity element for the reduction). Most common |
3584 |
< |
* reductions have these properties; for example, computing a sum |
3585 |
< |
* with basis 0 or a minimum with basis MAX_VALUE. |
3586 |
< |
* |
3587 |
< |
* <p>Search and transformation functions provided as arguments |
3588 |
< |
* should similarly return null to indicate the lack of any result |
3589 |
< |
* (in which case it is not used). In the case of mapped |
3590 |
< |
* reductions, this also enables transformations to serve as |
3591 |
< |
* filters, returning null (or, in the case of primitive |
3592 |
< |
* specializations, the identity basis) if the element should not |
3593 |
< |
* be combined. You can create compound transformations and |
3594 |
< |
* filterings by composing them yourself under this "null means |
3595 |
< |
* there is nothing there now" rule before using them in search or |
3596 |
< |
* reduce operations. |
3597 |
< |
* |
3598 |
< |
* <p>Methods accepting and/or returning Entry arguments maintain |
3599 |
< |
* key-value associations. They may be useful for example when |
3600 |
< |
* finding the key for the greatest value. Note that "plain" Entry |
3601 |
< |
* arguments can be supplied using {@code new |
3602 |
< |
* AbstractMap.SimpleEntry(k,v)}. |
3603 |
< |
* |
3604 |
< |
* <p> Bulk operations may complete abruptly, throwing an |
3605 |
< |
* exception encountered in the application of a supplied |
3606 |
< |
* function. Bear in mind when handling such exceptions that other |
3607 |
< |
* concurrently executing functions could also have thrown |
3608 |
< |
* exceptions, or would have done so if the first exception had |
3609 |
< |
* not occurred. |
3610 |
< |
* |
3611 |
< |
* <p>Parallel speedups compared to sequential processing are |
3612 |
< |
* common but not guaranteed. Operations involving brief |
3613 |
< |
* functions on small maps may execute more slowly than sequential |
3614 |
< |
* loops if the underlying work to parallelize the computation is |
3615 |
< |
* more expensive than the computation itself. Similarly, |
3616 |
< |
* parallelization may not lead to much actual parallelism if all |
3617 |
< |
* processors are busy performing unrelated tasks. |
3618 |
< |
* |
3619 |
< |
* <p> All arguments to all task methods must be non-null. |
3620 |
< |
* |
3621 |
< |
* <p><em>jsr166e note: During transition, this class |
3622 |
< |
* uses nested functional interfaces with different names but the |
3623 |
< |
* same forms as those expected for JDK8.<em> |
3624 |
< |
*/ |
3625 |
< |
public class Parallel { |
3626 |
< |
final ForkJoinPool fjp; |
3627 |
< |
|
3628 |
< |
/** |
3629 |
< |
* Returns an extended view of this map using the given |
3630 |
< |
* executor for bulk parallel operations. |
3631 |
< |
* |
3632 |
< |
* @param executor the executor |
3633 |
< |
*/ |
3634 |
< |
public Parallel(ForkJoinPool executor) { |
3635 |
< |
this.fjp = executor; |
3636 |
< |
} |
3524 |
> |
* Performs the given action for each non-null transformation |
3525 |
> |
* of each (key, value). |
3526 |
> |
* |
3527 |
> |
* @param transformer a function returning the transformation |
3528 |
> |
* for an element, or null of there is no transformation (in |
3529 |
> |
* which case the action is not applied). |
3530 |
> |
* @param action the action |
3531 |
> |
*/ |
3532 |
> |
public <U> void forEach(BiFun<? super K, ? super V, ? extends U> transformer, |
3533 |
> |
Action<U> action) { |
3534 |
> |
ForkJoinTasks.forEach |
3535 |
> |
(this, transformer, action).invoke(); |
3536 |
> |
} |
3537 |
> |
|
3538 |
> |
/** |
3539 |
> |
* Returns a non-null result from applying the given search |
3540 |
> |
* function on each (key, value), or null if none. Upon |
3541 |
> |
* success, further element processing is suppressed and the |
3542 |
> |
* results of any other parallel invocations of the search |
3543 |
> |
* function are ignored. |
3544 |
> |
* |
3545 |
> |
* @param searchFunction a function returning a non-null |
3546 |
> |
* result on success, else null |
3547 |
> |
* @return a non-null result from applying the given search |
3548 |
> |
* function on each (key, value), or null if none |
3549 |
> |
*/ |
3550 |
> |
public <U> U search(BiFun<? super K, ? super V, ? extends U> searchFunction) { |
3551 |
> |
return ForkJoinTasks.search |
3552 |
> |
(this, searchFunction).invoke(); |
3553 |
> |
} |
3554 |
> |
|
3555 |
> |
/** |
3556 |
> |
* Returns the result of accumulating the given transformation |
3557 |
> |
* of all (key, value) pairs using the given reducer to |
3558 |
> |
* combine values, or null if none. |
3559 |
> |
* |
3560 |
> |
* @param transformer a function returning the transformation |
3561 |
> |
* for an element, or null of there is no transformation (in |
3562 |
> |
* which case it is not combined). |
3563 |
> |
* @param reducer a commutative associative combining function |
3564 |
> |
* @return the result of accumulating the given transformation |
3565 |
> |
* of all (key, value) pairs |
3566 |
> |
*/ |
3567 |
> |
public <U> U reduce(BiFun<? super K, ? super V, ? extends U> transformer, |
3568 |
> |
BiFun<? super U, ? super U, ? extends U> reducer) { |
3569 |
> |
return ForkJoinTasks.reduce |
3570 |
> |
(this, transformer, reducer).invoke(); |
3571 |
> |
} |
3572 |
> |
|
3573 |
> |
/** |
3574 |
> |
* Returns the result of accumulating the given transformation |
3575 |
> |
* of all (key, value) pairs using the given reducer to |
3576 |
> |
* combine values, and the given basis as an identity value. |
3577 |
> |
* |
3578 |
> |
* @param transformer a function returning the transformation |
3579 |
> |
* for an element |
3580 |
> |
* @param basis the identity (initial default value) for the reduction |
3581 |
> |
* @param reducer a commutative associative combining function |
3582 |
> |
* @return the result of accumulating the given transformation |
3583 |
> |
* of all (key, value) pairs |
3584 |
> |
*/ |
3585 |
> |
public double reduceToDouble(ObjectByObjectToDouble<? super K, ? super V> transformer, |
3586 |
> |
double basis, |
3587 |
> |
DoubleByDoubleToDouble reducer) { |
3588 |
> |
return ForkJoinTasks.reduceToDouble |
3589 |
> |
(this, transformer, basis, reducer).invoke(); |
3590 |
> |
} |
3591 |
> |
|
3592 |
> |
/** |
3593 |
> |
* Returns the result of accumulating the given transformation |
3594 |
> |
* of all (key, value) pairs using the given reducer to |
3595 |
> |
* combine values, and the given basis as an identity value. |
3596 |
> |
* |
3597 |
> |
* @param transformer a function returning the transformation |
3598 |
> |
* for an element |
3599 |
> |
* @param basis the identity (initial default value) for the reduction |
3600 |
> |
* @param reducer a commutative associative combining function |
3601 |
> |
* @return the result of accumulating the given transformation |
3602 |
> |
* of all (key, value) pairs |
3603 |
> |
*/ |
3604 |
> |
public long reduceToLong(ObjectByObjectToLong<? super K, ? super V> transformer, |
3605 |
> |
long basis, |
3606 |
> |
LongByLongToLong reducer) { |
3607 |
> |
return ForkJoinTasks.reduceToLong |
3608 |
> |
(this, transformer, basis, reducer).invoke(); |
3609 |
> |
} |
3610 |
> |
|
3611 |
> |
/** |
3612 |
> |
* Returns the result of accumulating the given transformation |
3613 |
> |
* of all (key, value) pairs using the given reducer to |
3614 |
> |
* combine values, and the given basis as an identity value. |
3615 |
> |
* |
3616 |
> |
* @param transformer a function returning the transformation |
3617 |
> |
* for an element |
3618 |
> |
* @param basis the identity (initial default value) for the reduction |
3619 |
> |
* @param reducer a commutative associative combining function |
3620 |
> |
* @return the result of accumulating the given transformation |
3621 |
> |
* of all (key, value) pairs |
3622 |
> |
*/ |
3623 |
> |
public int reduceToInt(ObjectByObjectToInt<? super K, ? super V> transformer, |
3624 |
> |
int basis, |
3625 |
> |
IntByIntToInt reducer) { |
3626 |
> |
return ForkJoinTasks.reduceToInt |
3627 |
> |
(this, transformer, basis, reducer).invoke(); |
3628 |
> |
} |
3629 |
> |
|
3630 |
> |
/** |
3631 |
> |
* Performs the given action for each key. |
3632 |
> |
* |
3633 |
> |
* @param action the action |
3634 |
> |
*/ |
3635 |
> |
public void forEachKey(Action<K> action) { |
3636 |
> |
ForkJoinTasks.forEachKey |
3637 |
> |
(this, action).invoke(); |
3638 |
> |
} |
3639 |
> |
|
3640 |
> |
/** |
3641 |
> |
* Performs the given action for each non-null transformation |
3642 |
> |
* of each key. |
3643 |
> |
* |
3644 |
> |
* @param transformer a function returning the transformation |
3645 |
> |
* for an element, or null of there is no transformation (in |
3646 |
> |
* which case the action is not applied). |
3647 |
> |
* @param action the action |
3648 |
> |
*/ |
3649 |
> |
public <U> void forEachKey(Fun<? super K, ? extends U> transformer, |
3650 |
> |
Action<U> action) { |
3651 |
> |
ForkJoinTasks.forEachKey |
3652 |
> |
(this, transformer, action).invoke(); |
3653 |
> |
} |
3654 |
> |
|
3655 |
> |
/** |
3656 |
> |
* Returns a non-null result from applying the given search |
3657 |
> |
* function on each key, or null if none. Upon success, |
3658 |
> |
* further element processing is suppressed and the results of |
3659 |
> |
* any other parallel invocations of the search function are |
3660 |
> |
* ignored. |
3661 |
> |
* |
3662 |
> |
* @param searchFunction a function returning a non-null |
3663 |
> |
* result on success, else null |
3664 |
> |
* @return a non-null result from applying the given search |
3665 |
> |
* function on each key, or null if none |
3666 |
> |
*/ |
3667 |
> |
public <U> U searchKeys(Fun<? super K, ? extends U> searchFunction) { |
3668 |
> |
return ForkJoinTasks.searchKeys |
3669 |
> |
(this, searchFunction).invoke(); |
3670 |
> |
} |
3671 |
> |
|
3672 |
> |
/** |
3673 |
> |
* Returns the result of accumulating all keys using the given |
3674 |
> |
* reducer to combine values, or null if none. |
3675 |
> |
* |
3676 |
> |
* @param reducer a commutative associative combining function |
3677 |
> |
* @return the result of accumulating all keys using the given |
3678 |
> |
* reducer to combine values, or null if none |
3679 |
> |
*/ |
3680 |
> |
public K reduceKeys(BiFun<? super K, ? super K, ? extends K> reducer) { |
3681 |
> |
return ForkJoinTasks.reduceKeys |
3682 |
> |
(this, reducer).invoke(); |
3683 |
> |
} |
3684 |
> |
|
3685 |
> |
/** |
3686 |
> |
* Returns the result of accumulating the given transformation |
3687 |
> |
* of all keys using the given reducer to combine values, or |
3688 |
> |
* null if none. |
3689 |
> |
* |
3690 |
> |
* @param transformer a function returning the transformation |
3691 |
> |
* for an element, or null of there is no transformation (in |
3692 |
> |
* which case it is not combined). |
3693 |
> |
* @param reducer a commutative associative combining function |
3694 |
> |
* @return the result of accumulating the given transformation |
3695 |
> |
* of all keys |
3696 |
> |
*/ |
3697 |
> |
public <U> U reduceKeys(Fun<? super K, ? extends U> transformer, |
3698 |
> |
BiFun<? super U, ? super U, ? extends U> reducer) { |
3699 |
> |
return ForkJoinTasks.reduceKeys |
3700 |
> |
(this, transformer, reducer).invoke(); |
3701 |
> |
} |
3702 |
> |
|
3703 |
> |
/** |
3704 |
> |
* Returns the result of accumulating the given transformation |
3705 |
> |
* of all keys using the given reducer to combine values, and |
3706 |
> |
* the given basis as an identity value. |
3707 |
> |
* |
3708 |
> |
* @param transformer a function returning the transformation |
3709 |
> |
* for an element |
3710 |
> |
* @param basis the identity (initial default value) for the reduction |
3711 |
> |
* @param reducer a commutative associative combining function |
3712 |
> |
* @return the result of accumulating the given transformation |
3713 |
> |
* of all keys |
3714 |
> |
*/ |
3715 |
> |
public double reduceKeysToDouble(ObjectToDouble<? super K> transformer, |
3716 |
> |
double basis, |
3717 |
> |
DoubleByDoubleToDouble reducer) { |
3718 |
> |
return ForkJoinTasks.reduceKeysToDouble |
3719 |
> |
(this, transformer, basis, reducer).invoke(); |
3720 |
> |
} |
3721 |
> |
|
3722 |
> |
/** |
3723 |
> |
* Returns the result of accumulating the given transformation |
3724 |
> |
* of all keys using the given reducer to combine values, and |
3725 |
> |
* the given basis as an identity value. |
3726 |
> |
* |
3727 |
> |
* @param transformer a function returning the transformation |
3728 |
> |
* for an element |
3729 |
> |
* @param basis the identity (initial default value) for the reduction |
3730 |
> |
* @param reducer a commutative associative combining function |
3731 |
> |
* @return the result of accumulating the given transformation |
3732 |
> |
* of all keys |
3733 |
> |
*/ |
3734 |
> |
public long reduceKeysToLong(ObjectToLong<? super K> transformer, |
3735 |
> |
long basis, |
3736 |
> |
LongByLongToLong reducer) { |
3737 |
> |
return ForkJoinTasks.reduceKeysToLong |
3738 |
> |
(this, transformer, basis, reducer).invoke(); |
3739 |
> |
} |
3740 |
> |
|
3741 |
> |
/** |
3742 |
> |
* Returns the result of accumulating the given transformation |
3743 |
> |
* of all keys using the given reducer to combine values, and |
3744 |
> |
* the given basis as an identity value. |
3745 |
> |
* |
3746 |
> |
* @param transformer a function returning the transformation |
3747 |
> |
* for an element |
3748 |
> |
* @param basis the identity (initial default value) for the reduction |
3749 |
> |
* @param reducer a commutative associative combining function |
3750 |
> |
* @return the result of accumulating the given transformation |
3751 |
> |
* of all keys |
3752 |
> |
*/ |
3753 |
> |
public int reduceKeysToInt(ObjectToInt<? super K> transformer, |
3754 |
> |
int basis, |
3755 |
> |
IntByIntToInt reducer) { |
3756 |
> |
return ForkJoinTasks.reduceKeysToInt |
3757 |
> |
(this, transformer, basis, reducer).invoke(); |
3758 |
> |
} |
3759 |
> |
|
3760 |
> |
/** |
3761 |
> |
* Performs the given action for each value. |
3762 |
> |
* |
3763 |
> |
* @param action the action |
3764 |
> |
*/ |
3765 |
> |
public void forEachValue(Action<V> action) { |
3766 |
> |
ForkJoinTasks.forEachValue |
3767 |
> |
(this, action).invoke(); |
3768 |
> |
} |
3769 |
> |
|
3770 |
> |
/** |
3771 |
> |
* Performs the given action for each non-null transformation |
3772 |
> |
* of each value. |
3773 |
> |
* |
3774 |
> |
* @param transformer a function returning the transformation |
3775 |
> |
* for an element, or null of there is no transformation (in |
3776 |
> |
* which case the action is not applied). |
3777 |
> |
*/ |
3778 |
> |
public <U> void forEachValue(Fun<? super V, ? extends U> transformer, |
3779 |
> |
Action<U> action) { |
3780 |
> |
ForkJoinTasks.forEachValue |
3781 |
> |
(this, transformer, action).invoke(); |
3782 |
> |
} |
3783 |
> |
|
3784 |
> |
/** |
3785 |
> |
* Returns a non-null result from applying the given search |
3786 |
> |
* function on each value, or null if none. Upon success, |
3787 |
> |
* further element processing is suppressed and the results of |
3788 |
> |
* any other parallel invocations of the search function are |
3789 |
> |
* ignored. |
3790 |
> |
* |
3791 |
> |
* @param searchFunction a function returning a non-null |
3792 |
> |
* result on success, else null |
3793 |
> |
* @return a non-null result from applying the given search |
3794 |
> |
* function on each value, or null if none |
3795 |
> |
* |
3796 |
> |
*/ |
3797 |
> |
public <U> U searchValues(Fun<? super V, ? extends U> searchFunction) { |
3798 |
> |
return ForkJoinTasks.searchValues |
3799 |
> |
(this, searchFunction).invoke(); |
3800 |
> |
} |
3801 |
> |
|
3802 |
> |
/** |
3803 |
> |
* Returns the result of accumulating all values using the |
3804 |
> |
* given reducer to combine values, or null if none. |
3805 |
> |
* |
3806 |
> |
* @param reducer a commutative associative combining function |
3807 |
> |
* @return the result of accumulating all values |
3808 |
> |
*/ |
3809 |
> |
public V reduceValues(BiFun<? super V, ? super V, ? extends V> reducer) { |
3810 |
> |
return ForkJoinTasks.reduceValues |
3811 |
> |
(this, reducer).invoke(); |
3812 |
> |
} |
3813 |
> |
|
3814 |
> |
/** |
3815 |
> |
* Returns the result of accumulating the given transformation |
3816 |
> |
* of all values using the given reducer to combine values, or |
3817 |
> |
* null if none. |
3818 |
> |
* |
3819 |
> |
* @param transformer a function returning the transformation |
3820 |
> |
* for an element, or null of there is no transformation (in |
3821 |
> |
* which case it is not combined). |
3822 |
> |
* @param reducer a commutative associative combining function |
3823 |
> |
* @return the result of accumulating the given transformation |
3824 |
> |
* of all values |
3825 |
> |
*/ |
3826 |
> |
public <U> U reduceValues(Fun<? super V, ? extends U> transformer, |
3827 |
> |
BiFun<? super U, ? super U, ? extends U> reducer) { |
3828 |
> |
return ForkJoinTasks.reduceValues |
3829 |
> |
(this, transformer, reducer).invoke(); |
3830 |
> |
} |
3831 |
> |
|
3832 |
> |
/** |
3833 |
> |
* Returns the result of accumulating the given transformation |
3834 |
> |
* of all values using the given reducer to combine values, |
3835 |
> |
* and the given basis as an identity value. |
3836 |
> |
* |
3837 |
> |
* @param transformer a function returning the transformation |
3838 |
> |
* for an element |
3839 |
> |
* @param basis the identity (initial default value) for the reduction |
3840 |
> |
* @param reducer a commutative associative combining function |
3841 |
> |
* @return the result of accumulating the given transformation |
3842 |
> |
* of all values |
3843 |
> |
*/ |
3844 |
> |
public double reduceValuesToDouble(ObjectToDouble<? super V> transformer, |
3845 |
> |
double basis, |
3846 |
> |
DoubleByDoubleToDouble reducer) { |
3847 |
> |
return ForkJoinTasks.reduceValuesToDouble |
3848 |
> |
(this, transformer, basis, reducer).invoke(); |
3849 |
> |
} |
3850 |
> |
|
3851 |
> |
/** |
3852 |
> |
* Returns the result of accumulating the given transformation |
3853 |
> |
* of all values using the given reducer to combine values, |
3854 |
> |
* and the given basis as an identity value. |
3855 |
> |
* |
3856 |
> |
* @param transformer a function returning the transformation |
3857 |
> |
* for an element |
3858 |
> |
* @param basis the identity (initial default value) for the reduction |
3859 |
> |
* @param reducer a commutative associative combining function |
3860 |
> |
* @return the result of accumulating the given transformation |
3861 |
> |
* of all values |
3862 |
> |
*/ |
3863 |
> |
public long reduceValuesToLong(ObjectToLong<? super V> transformer, |
3864 |
> |
long basis, |
3865 |
> |
LongByLongToLong reducer) { |
3866 |
> |
return ForkJoinTasks.reduceValuesToLong |
3867 |
> |
(this, transformer, basis, reducer).invoke(); |
3868 |
> |
} |
3869 |
> |
|
3870 |
> |
/** |
3871 |
> |
* Returns the result of accumulating the given transformation |
3872 |
> |
* of all values using the given reducer to combine values, |
3873 |
> |
* and the given basis as an identity value. |
3874 |
> |
* |
3875 |
> |
* @param transformer a function returning the transformation |
3876 |
> |
* for an element |
3877 |
> |
* @param basis the identity (initial default value) for the reduction |
3878 |
> |
* @param reducer a commutative associative combining function |
3879 |
> |
* @return the result of accumulating the given transformation |
3880 |
> |
* of all values |
3881 |
> |
*/ |
3882 |
> |
public int reduceValuesToInt(ObjectToInt<? super V> transformer, |
3883 |
> |
int basis, |
3884 |
> |
IntByIntToInt reducer) { |
3885 |
> |
return ForkJoinTasks.reduceValuesToInt |
3886 |
> |
(this, transformer, basis, reducer).invoke(); |
3887 |
> |
} |
3888 |
> |
|
3889 |
> |
/** |
3890 |
> |
* Performs the given action for each entry. |
3891 |
> |
* |
3892 |
> |
* @param action the action |
3893 |
> |
*/ |
3894 |
> |
public void forEachEntry(Action<Map.Entry<K,V>> action) { |
3895 |
> |
ForkJoinTasks.forEachEntry |
3896 |
> |
(this, action).invoke(); |
3897 |
> |
} |
3898 |
> |
|
3899 |
> |
/** |
3900 |
> |
* Performs the given action for each non-null transformation |
3901 |
> |
* of each entry. |
3902 |
> |
* |
3903 |
> |
* @param transformer a function returning the transformation |
3904 |
> |
* for an element, or null of there is no transformation (in |
3905 |
> |
* which case the action is not applied). |
3906 |
> |
* @param action the action |
3907 |
> |
*/ |
3908 |
> |
public <U> void forEachEntry(Fun<Map.Entry<K,V>, ? extends U> transformer, |
3909 |
> |
Action<U> action) { |
3910 |
> |
ForkJoinTasks.forEachEntry |
3911 |
> |
(this, transformer, action).invoke(); |
3912 |
> |
} |
3913 |
> |
|
3914 |
> |
/** |
3915 |
> |
* Returns a non-null result from applying the given search |
3916 |
> |
* function on each entry, or null if none. Upon success, |
3917 |
> |
* further element processing is suppressed and the results of |
3918 |
> |
* any other parallel invocations of the search function are |
3919 |
> |
* ignored. |
3920 |
> |
* |
3921 |
> |
* @param searchFunction a function returning a non-null |
3922 |
> |
* result on success, else null |
3923 |
> |
* @return a non-null result from applying the given search |
3924 |
> |
* function on each entry, or null if none |
3925 |
> |
*/ |
3926 |
> |
public <U> U searchEntries(Fun<Map.Entry<K,V>, ? extends U> searchFunction) { |
3927 |
> |
return ForkJoinTasks.searchEntries |
3928 |
> |
(this, searchFunction).invoke(); |
3929 |
> |
} |
3930 |
> |
|
3931 |
> |
/** |
3932 |
> |
* Returns the result of accumulating all entries using the |
3933 |
> |
* given reducer to combine values, or null if none. |
3934 |
> |
* |
3935 |
> |
* @param reducer a commutative associative combining function |
3936 |
> |
* @return the result of accumulating all entries |
3937 |
> |
*/ |
3938 |
> |
public Map.Entry<K,V> reduceEntries(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) { |
3939 |
> |
return ForkJoinTasks.reduceEntries |
3940 |
> |
(this, reducer).invoke(); |
3941 |
> |
} |
3942 |
> |
|
3943 |
> |
/** |
3944 |
> |
* Returns the result of accumulating the given transformation |
3945 |
> |
* of all entries using the given reducer to combine values, |
3946 |
> |
* or null if none. |
3947 |
> |
* |
3948 |
> |
* @param transformer a function returning the transformation |
3949 |
> |
* for an element, or null of there is no transformation (in |
3950 |
> |
* which case it is not combined). |
3951 |
> |
* @param reducer a commutative associative combining function |
3952 |
> |
* @return the result of accumulating the given transformation |
3953 |
> |
* of all entries |
3954 |
> |
*/ |
3955 |
> |
public <U> U reduceEntries(Fun<Map.Entry<K,V>, ? extends U> transformer, |
3956 |
> |
BiFun<? super U, ? super U, ? extends U> reducer) { |
3957 |
> |
return ForkJoinTasks.reduceEntries |
3958 |
> |
(this, transformer, reducer).invoke(); |
3959 |
> |
} |
3960 |
> |
|
3961 |
> |
/** |
3962 |
> |
* Returns the result of accumulating the given transformation |
3963 |
> |
* of all entries using the given reducer to combine values, |
3964 |
> |
* and the given basis as an identity value. |
3965 |
> |
* |
3966 |
> |
* @param transformer a function returning the transformation |
3967 |
> |
* for an element |
3968 |
> |
* @param basis the identity (initial default value) for the reduction |
3969 |
> |
* @param reducer a commutative associative combining function |
3970 |
> |
* @return the result of accumulating the given transformation |
3971 |
> |
* of all entries |
3972 |
> |
*/ |
3973 |
> |
public double reduceEntriesToDouble(ObjectToDouble<Map.Entry<K,V>> transformer, |
3974 |
> |
double basis, |
3975 |
> |
DoubleByDoubleToDouble reducer) { |
3976 |
> |
return ForkJoinTasks.reduceEntriesToDouble |
3977 |
> |
(this, transformer, basis, reducer).invoke(); |
3978 |
> |
} |
3979 |
> |
|
3980 |
> |
/** |
3981 |
> |
* Returns the result of accumulating the given transformation |
3982 |
> |
* of all entries using the given reducer to combine values, |
3983 |
> |
* and the given basis as an identity value. |
3984 |
> |
* |
3985 |
> |
* @param transformer a function returning the transformation |
3986 |
> |
* for an element |
3987 |
> |
* @param basis the identity (initial default value) for the reduction |
3988 |
> |
* @param reducer a commutative associative combining function |
3989 |
> |
* @return the result of accumulating the given transformation |
3990 |
> |
* of all entries |
3991 |
> |
*/ |
3992 |
> |
public long reduceEntriesToLong(ObjectToLong<Map.Entry<K,V>> transformer, |
3993 |
> |
long basis, |
3994 |
> |
LongByLongToLong reducer) { |
3995 |
> |
return ForkJoinTasks.reduceEntriesToLong |
3996 |
> |
(this, transformer, basis, reducer).invoke(); |
3997 |
> |
} |
3998 |
> |
|
3999 |
> |
/** |
4000 |
> |
* Returns the result of accumulating the given transformation |
4001 |
> |
* of all entries using the given reducer to combine values, |
4002 |
> |
* and the given basis as an identity value. |
4003 |
> |
* |
4004 |
> |
* @param transformer a function returning the transformation |
4005 |
> |
* for an element |
4006 |
> |
* @param basis the identity (initial default value) for the reduction |
4007 |
> |
* @param reducer a commutative associative combining function |
4008 |
> |
* @return the result of accumulating the given transformation |
4009 |
> |
* of all entries |
4010 |
> |
*/ |
4011 |
> |
public int reduceEntriesToInt(ObjectToInt<Map.Entry<K,V>> transformer, |
4012 |
> |
int basis, |
4013 |
> |
IntByIntToInt reducer) { |
4014 |
> |
return ForkJoinTasks.reduceEntriesToInt |
4015 |
> |
(this, transformer, basis, reducer).invoke(); |
4016 |
> |
} |
4017 |
> |
|
4018 |
> |
/* ----------------Views -------------- */ |
4019 |
> |
|
4020 |
> |
/** |
4021 |
> |
* Base class for views. |
4022 |
> |
*/ |
4023 |
> |
static abstract class CHMView<K, V> { |
4024 |
> |
final ConcurrentHashMapV8<K, V> map; |
4025 |
> |
CHMView(ConcurrentHashMapV8<K, V> map) { this.map = map; } |
4026 |
|
|
4027 |
|
/** |
4028 |
< |
* Performs the given action for each (key, value). |
4028 |
> |
* Returns the map backing this view. |
4029 |
|
* |
4030 |
< |
* @param action the action |
4030 |
> |
* @return the map backing this view |
4031 |
|
*/ |
4032 |
< |
public void forEach(BiAction<K,V> action) { |
4033 |
< |
fjp.invoke(ForkJoinTasks.forEach |
4034 |
< |
(ConcurrentHashMapV8.this, action)); |
4032 |
> |
public ConcurrentHashMapV8<K,V> getMap() { return map; } |
4033 |
> |
|
4034 |
> |
public final int size() { return map.size(); } |
4035 |
> |
public final boolean isEmpty() { return map.isEmpty(); } |
4036 |
> |
public final void clear() { map.clear(); } |
4037 |
> |
|
4038 |
> |
// implementations below rely on concrete classes supplying these |
4039 |
> |
abstract public Iterator<?> iterator(); |
4040 |
> |
abstract public boolean contains(Object o); |
4041 |
> |
abstract public boolean remove(Object o); |
4042 |
> |
|
4043 |
> |
private static final String oomeMsg = "Required array size too large"; |
4044 |
> |
|
4045 |
> |
public final Object[] toArray() { |
4046 |
> |
long sz = map.mappingCount(); |
4047 |
> |
if (sz > (long)(MAX_ARRAY_SIZE)) |
4048 |
> |
throw new OutOfMemoryError(oomeMsg); |
4049 |
> |
int n = (int)sz; |
4050 |
> |
Object[] r = new Object[n]; |
4051 |
> |
int i = 0; |
4052 |
> |
Iterator<?> it = iterator(); |
4053 |
> |
while (it.hasNext()) { |
4054 |
> |
if (i == n) { |
4055 |
> |
if (n >= MAX_ARRAY_SIZE) |
4056 |
> |
throw new OutOfMemoryError(oomeMsg); |
4057 |
> |
if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) |
4058 |
> |
n = MAX_ARRAY_SIZE; |
4059 |
> |
else |
4060 |
> |
n += (n >>> 1) + 1; |
4061 |
> |
r = Arrays.copyOf(r, n); |
4062 |
> |
} |
4063 |
> |
r[i++] = it.next(); |
4064 |
> |
} |
4065 |
> |
return (i == n) ? r : Arrays.copyOf(r, i); |
4066 |
|
} |
4067 |
|
|
4068 |
< |
/** |
4069 |
< |
* Performs the given action for each non-null transformation |
4070 |
< |
* of each (key, value). |
4071 |
< |
* |
4072 |
< |
* @param transformer a function returning the transformation |
4073 |
< |
* for an element, or null if there is no transformation (in |
4074 |
< |
* which case the action is not applied) |
4075 |
< |
* @param action the action |
4076 |
< |
*/ |
4077 |
< |
public <U> void forEach(BiFun<? super K, ? super V, ? extends U> transformer, |
4078 |
< |
Action<U> action) { |
4079 |
< |
fjp.invoke(ForkJoinTasks.forEach |
4080 |
< |
(ConcurrentHashMapV8.this, transformer, action)); |
4068 |
> |
@SuppressWarnings("unchecked") public final <T> T[] toArray(T[] a) { |
4069 |
> |
long sz = map.mappingCount(); |
4070 |
> |
if (sz > (long)(MAX_ARRAY_SIZE)) |
4071 |
> |
throw new OutOfMemoryError(oomeMsg); |
4072 |
> |
int m = (int)sz; |
4073 |
> |
T[] r = (a.length >= m) ? a : |
4074 |
> |
(T[])java.lang.reflect.Array |
4075 |
> |
.newInstance(a.getClass().getComponentType(), m); |
4076 |
> |
int n = r.length; |
4077 |
> |
int i = 0; |
4078 |
> |
Iterator<?> it = iterator(); |
4079 |
> |
while (it.hasNext()) { |
4080 |
> |
if (i == n) { |
4081 |
> |
if (n >= MAX_ARRAY_SIZE) |
4082 |
> |
throw new OutOfMemoryError(oomeMsg); |
4083 |
> |
if (n >= MAX_ARRAY_SIZE - (MAX_ARRAY_SIZE >>> 1) - 1) |
4084 |
> |
n = MAX_ARRAY_SIZE; |
4085 |
> |
else |
4086 |
> |
n += (n >>> 1) + 1; |
4087 |
> |
r = Arrays.copyOf(r, n); |
4088 |
> |
} |
4089 |
> |
r[i++] = (T)it.next(); |
4090 |
> |
} |
4091 |
> |
if (a == r && i < n) { |
4092 |
> |
r[i] = null; // null-terminate |
4093 |
> |
return r; |
4094 |
> |
} |
4095 |
> |
return (i == n) ? r : Arrays.copyOf(r, i); |
4096 |
|
} |
4097 |
|
|
4098 |
< |
/** |
4099 |
< |
* Returns a non-null result from applying the given search |
4100 |
< |
* function on each (key, value), or null if none. Upon |
4101 |
< |
* success, further element processing is suppressed and the |
4102 |
< |
* results of any other parallel invocations of the search |
3689 |
< |
* function are ignored. |
3690 |
< |
* |
3691 |
< |
* @param searchFunction a function returning a non-null |
3692 |
< |
* result on success, else null |
3693 |
< |
* @return a non-null result from applying the given search |
3694 |
< |
* function on each (key, value), or null if none |
3695 |
< |
*/ |
3696 |
< |
public <U> U search(BiFun<? super K, ? super V, ? extends U> searchFunction) { |
3697 |
< |
return fjp.invoke(ForkJoinTasks.search |
3698 |
< |
(ConcurrentHashMapV8.this, searchFunction)); |
4098 |
> |
public final int hashCode() { |
4099 |
> |
int h = 0; |
4100 |
> |
for (Iterator<?> it = iterator(); it.hasNext();) |
4101 |
> |
h += it.next().hashCode(); |
4102 |
> |
return h; |
4103 |
|
} |
4104 |
|
|
4105 |
< |
/** |
4106 |
< |
* Returns the result of accumulating the given transformation |
4107 |
< |
* of all (key, value) pairs using the given reducer to |
4108 |
< |
* combine values, or null if none. |
4109 |
< |
* |
4110 |
< |
* @param transformer a function returning the transformation |
4111 |
< |
* for an element, or null if there is no transformation (in |
4112 |
< |
* which case it is not combined) |
4113 |
< |
* @param reducer a commutative associative combining function |
4114 |
< |
* @return the result of accumulating the given transformation |
4115 |
< |
* of all (key, value) pairs |
4116 |
< |
*/ |
4117 |
< |
public <U> U reduce(BiFun<? super K, ? super V, ? extends U> transformer, |
4118 |
< |
BiFun<? super U, ? super U, ? extends U> reducer) { |
3715 |
< |
return fjp.invoke(ForkJoinTasks.reduce |
3716 |
< |
(ConcurrentHashMapV8.this, transformer, reducer)); |
4105 |
> |
public final String toString() { |
4106 |
> |
StringBuilder sb = new StringBuilder(); |
4107 |
> |
sb.append('['); |
4108 |
> |
Iterator<?> it = iterator(); |
4109 |
> |
if (it.hasNext()) { |
4110 |
> |
for (;;) { |
4111 |
> |
Object e = it.next(); |
4112 |
> |
sb.append(e == this ? "(this Collection)" : e); |
4113 |
> |
if (!it.hasNext()) |
4114 |
> |
break; |
4115 |
> |
sb.append(',').append(' '); |
4116 |
> |
} |
4117 |
> |
} |
4118 |
> |
return sb.append(']').toString(); |
4119 |
|
} |
4120 |
|
|
4121 |
< |
/** |
4122 |
< |
* Returns the result of accumulating the given transformation |
4123 |
< |
* of all (key, value) pairs using the given reducer to |
4124 |
< |
* combine values, and the given basis as an identity value. |
4125 |
< |
* |
4126 |
< |
* @param transformer a function returning the transformation |
4127 |
< |
* for an element |
4128 |
< |
* @param basis the identity (initial default value) for the reduction |
4129 |
< |
* @param reducer a commutative associative combining function |
4130 |
< |
* @return the result of accumulating the given transformation |
4131 |
< |
* of all (key, value) pairs |
4132 |
< |
*/ |
4133 |
< |
public double reduceToDouble(ObjectByObjectToDouble<? super K, ? super V> transformer, |
4134 |
< |
double basis, |
4135 |
< |
DoubleByDoubleToDouble reducer) { |
4136 |
< |
return fjp.invoke(ForkJoinTasks.reduceToDouble |
4137 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4121 |
> |
public final boolean containsAll(Collection<?> c) { |
4122 |
> |
if (c != this) { |
4123 |
> |
for (Iterator<?> it = c.iterator(); it.hasNext();) { |
4124 |
> |
Object e = it.next(); |
4125 |
> |
if (e == null || !contains(e)) |
4126 |
> |
return false; |
4127 |
> |
} |
4128 |
> |
} |
4129 |
> |
return true; |
4130 |
> |
} |
4131 |
> |
|
4132 |
> |
public final boolean removeAll(Collection<?> c) { |
4133 |
> |
boolean modified = false; |
4134 |
> |
for (Iterator<?> it = iterator(); it.hasNext();) { |
4135 |
> |
if (c.contains(it.next())) { |
4136 |
> |
it.remove(); |
4137 |
> |
modified = true; |
4138 |
> |
} |
4139 |
> |
} |
4140 |
> |
return modified; |
4141 |
> |
} |
4142 |
> |
|
4143 |
> |
public final boolean retainAll(Collection<?> c) { |
4144 |
> |
boolean modified = false; |
4145 |
> |
for (Iterator<?> it = iterator(); it.hasNext();) { |
4146 |
> |
if (!c.contains(it.next())) { |
4147 |
> |
it.remove(); |
4148 |
> |
modified = true; |
4149 |
> |
} |
4150 |
> |
} |
4151 |
> |
return modified; |
4152 |
> |
} |
4153 |
> |
|
4154 |
> |
} |
4155 |
> |
|
4156 |
> |
/** |
4157 |
> |
* A view of a ConcurrentHashMapV8 as a {@link Set} of keys, in |
4158 |
> |
* which additions may optionally be enabled by mapping to a |
4159 |
> |
* common value. This class cannot be directly instantiated. See |
4160 |
> |
* {@link #keySet}, {@link #keySet(Object)}, {@link #newKeySet()}, |
4161 |
> |
* {@link #newKeySet(int)}. |
4162 |
> |
*/ |
4163 |
> |
public static class KeySetView<K,V> extends CHMView<K,V> implements Set<K>, java.io.Serializable { |
4164 |
> |
private static final long serialVersionUID = 7249069246763182397L; |
4165 |
> |
private final V value; |
4166 |
> |
KeySetView(ConcurrentHashMapV8<K, V> map, V value) { // non-public |
4167 |
> |
super(map); |
4168 |
> |
this.value = value; |
4169 |
|
} |
4170 |
|
|
4171 |
|
/** |
4172 |
< |
* Returns the result of accumulating the given transformation |
4173 |
< |
* of all (key, value) pairs using the given reducer to |
3741 |
< |
* combine values, and the given basis as an identity value. |
4172 |
> |
* Returns the default mapped value for additions, |
4173 |
> |
* or {@code null} if additions are not supported. |
4174 |
|
* |
4175 |
< |
* @param transformer a function returning the transformation |
4176 |
< |
* for an element |
3745 |
< |
* @param basis the identity (initial default value) for the reduction |
3746 |
< |
* @param reducer a commutative associative combining function |
3747 |
< |
* @return the result of accumulating the given transformation |
3748 |
< |
* of all (key, value) pairs |
4175 |
> |
* @return the default mapped value for additions, or {@code null} |
4176 |
> |
* if not supported. |
4177 |
|
*/ |
4178 |
< |
public long reduceToLong(ObjectByObjectToLong<? super K, ? super V> transformer, |
4179 |
< |
long basis, |
4180 |
< |
LongByLongToLong reducer) { |
4181 |
< |
return fjp.invoke(ForkJoinTasks.reduceToLong |
4182 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4183 |
< |
} |
4178 |
> |
public V getMappedValue() { return value; } |
4179 |
> |
|
4180 |
> |
// implement Set API |
4181 |
> |
|
4182 |
> |
public boolean contains(Object o) { return map.containsKey(o); } |
4183 |
> |
public boolean remove(Object o) { return map.remove(o) != null; } |
4184 |
|
|
4185 |
|
/** |
4186 |
< |
* Returns the result of accumulating the given transformation |
4187 |
< |
* of all (key, value) pairs using the given reducer to |
4188 |
< |
* combine values, and the given basis as an identity value. |
4186 |
> |
* Returns a "weakly consistent" iterator that will never |
4187 |
> |
* throw {@link ConcurrentModificationException}, and |
4188 |
> |
* guarantees to traverse elements as they existed upon |
4189 |
> |
* construction of the iterator, and may (but is not |
4190 |
> |
* guaranteed to) reflect any modifications subsequent to |
4191 |
> |
* construction. |
4192 |
|
* |
4193 |
< |
* @param transformer a function returning the transformation |
3763 |
< |
* for an element |
3764 |
< |
* @param basis the identity (initial default value) for the reduction |
3765 |
< |
* @param reducer a commutative associative combining function |
3766 |
< |
* @return the result of accumulating the given transformation |
3767 |
< |
* of all (key, value) pairs |
4193 |
> |
* @return an iterator over the keys of this map |
4194 |
|
*/ |
4195 |
< |
public int reduceToInt(ObjectByObjectToInt<? super K, ? super V> transformer, |
4196 |
< |
int basis, |
4197 |
< |
IntByIntToInt reducer) { |
4198 |
< |
return fjp.invoke(ForkJoinTasks.reduceToInt |
4199 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4195 |
> |
public Iterator<K> iterator() { return new KeyIterator<K,V>(map); } |
4196 |
> |
public boolean add(K e) { |
4197 |
> |
V v; |
4198 |
> |
if ((v = value) == null) |
4199 |
> |
throw new UnsupportedOperationException(); |
4200 |
> |
if (e == null) |
4201 |
> |
throw new NullPointerException(); |
4202 |
> |
return map.internalPutIfAbsent(e, v) == null; |
4203 |
> |
} |
4204 |
> |
public boolean addAll(Collection<? extends K> c) { |
4205 |
> |
boolean added = false; |
4206 |
> |
V v; |
4207 |
> |
if ((v = value) == null) |
4208 |
> |
throw new UnsupportedOperationException(); |
4209 |
> |
for (K e : c) { |
4210 |
> |
if (e == null) |
4211 |
> |
throw new NullPointerException(); |
4212 |
> |
if (map.internalPutIfAbsent(e, v) == null) |
4213 |
> |
added = true; |
4214 |
> |
} |
4215 |
> |
return added; |
4216 |
> |
} |
4217 |
> |
public boolean equals(Object o) { |
4218 |
> |
Set<?> c; |
4219 |
> |
return ((o instanceof Set) && |
4220 |
> |
((c = (Set<?>)o) == this || |
4221 |
> |
(containsAll(c) && c.containsAll(this)))); |
4222 |
|
} |
4223 |
|
|
4224 |
|
/** |
4226 |
|
* |
4227 |
|
* @param action the action |
4228 |
|
*/ |
4229 |
< |
public void forEachKey(Action<K> action) { |
4230 |
< |
fjp.invoke(ForkJoinTasks.forEachKey |
4231 |
< |
(ConcurrentHashMapV8.this, action)); |
4229 |
> |
public void forEach(Action<K> action) { |
4230 |
> |
ForkJoinTasks.forEachKey |
4231 |
> |
(map, action).invoke(); |
4232 |
|
} |
4233 |
|
|
4234 |
|
/** |
4236 |
|
* of each key. |
4237 |
|
* |
4238 |
|
* @param transformer a function returning the transformation |
4239 |
< |
* for an element, or null if there is no transformation (in |
4240 |
< |
* which case the action is not applied) |
4239 |
> |
* for an element, or null of there is no transformation (in |
4240 |
> |
* which case the action is not applied). |
4241 |
|
* @param action the action |
4242 |
|
*/ |
4243 |
< |
public <U> void forEachKey(Fun<? super K, ? extends U> transformer, |
4244 |
< |
Action<U> action) { |
4245 |
< |
fjp.invoke(ForkJoinTasks.forEachKey |
4246 |
< |
(ConcurrentHashMapV8.this, transformer, action)); |
4243 |
> |
public <U> void forEach(Fun<? super K, ? extends U> transformer, |
4244 |
> |
Action<U> action) { |
4245 |
> |
ForkJoinTasks.forEachKey |
4246 |
> |
(map, transformer, action).invoke(); |
4247 |
|
} |
4248 |
|
|
4249 |
|
/** |
4258 |
|
* @return a non-null result from applying the given search |
4259 |
|
* function on each key, or null if none |
4260 |
|
*/ |
4261 |
< |
public <U> U searchKeys(Fun<? super K, ? extends U> searchFunction) { |
4262 |
< |
return fjp.invoke(ForkJoinTasks.searchKeys |
4263 |
< |
(ConcurrentHashMapV8.this, searchFunction)); |
4261 |
> |
public <U> U search(Fun<? super K, ? extends U> searchFunction) { |
4262 |
> |
return ForkJoinTasks.searchKeys |
4263 |
> |
(map, searchFunction).invoke(); |
4264 |
|
} |
4265 |
|
|
4266 |
|
/** |
4271 |
|
* @return the result of accumulating all keys using the given |
4272 |
|
* reducer to combine values, or null if none |
4273 |
|
*/ |
4274 |
< |
public K reduceKeys(BiFun<? super K, ? super K, ? extends K> reducer) { |
4275 |
< |
return fjp.invoke(ForkJoinTasks.reduceKeys |
4276 |
< |
(ConcurrentHashMapV8.this, reducer)); |
3829 |
< |
} |
3830 |
< |
|
3831 |
< |
/** |
3832 |
< |
* Returns the result of accumulating the given transformation |
3833 |
< |
* of all keys using the given reducer to combine values, or |
3834 |
< |
* null if none. |
3835 |
< |
* |
3836 |
< |
* @param transformer a function returning the transformation |
3837 |
< |
* for an element, or null if there is no transformation (in |
3838 |
< |
* which case it is not combined) |
3839 |
< |
* @param reducer a commutative associative combining function |
3840 |
< |
* @return the result of accumulating the given transformation |
3841 |
< |
* of all keys |
3842 |
< |
*/ |
3843 |
< |
public <U> U reduceKeys(Fun<? super K, ? extends U> transformer, |
3844 |
< |
BiFun<? super U, ? super U, ? extends U> reducer) { |
3845 |
< |
return fjp.invoke(ForkJoinTasks.reduceKeys |
3846 |
< |
(ConcurrentHashMapV8.this, transformer, reducer)); |
4274 |
> |
public K reduce(BiFun<? super K, ? super K, ? extends K> reducer) { |
4275 |
> |
return ForkJoinTasks.reduceKeys |
4276 |
> |
(map, reducer).invoke(); |
4277 |
|
} |
4278 |
|
|
4279 |
|
/** |
4288 |
|
* @return the result of accumulating the given transformation |
4289 |
|
* of all keys |
4290 |
|
*/ |
4291 |
< |
public double reduceKeysToDouble(ObjectToDouble<? super K> transformer, |
4292 |
< |
double basis, |
4293 |
< |
DoubleByDoubleToDouble reducer) { |
4294 |
< |
return fjp.invoke(ForkJoinTasks.reduceKeysToDouble |
4295 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4291 |
> |
public double reduceToDouble(ObjectToDouble<? super K> transformer, |
4292 |
> |
double basis, |
4293 |
> |
DoubleByDoubleToDouble reducer) { |
4294 |
> |
return ForkJoinTasks.reduceKeysToDouble |
4295 |
> |
(map, transformer, basis, reducer).invoke(); |
4296 |
|
} |
4297 |
|
|
4298 |
+ |
|
4299 |
|
/** |
4300 |
|
* Returns the result of accumulating the given transformation |
4301 |
|
* of all keys using the given reducer to combine values, and |
4308 |
|
* @return the result of accumulating the given transformation |
4309 |
|
* of all keys |
4310 |
|
*/ |
4311 |
< |
public long reduceKeysToLong(ObjectToLong<? super K> transformer, |
4312 |
< |
long basis, |
4313 |
< |
LongByLongToLong reducer) { |
4314 |
< |
return fjp.invoke(ForkJoinTasks.reduceKeysToLong |
4315 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4311 |
> |
public long reduceToLong(ObjectToLong<? super K> transformer, |
4312 |
> |
long basis, |
4313 |
> |
LongByLongToLong reducer) { |
4314 |
> |
return ForkJoinTasks.reduceKeysToLong |
4315 |
> |
(map, transformer, basis, reducer).invoke(); |
4316 |
|
} |
4317 |
|
|
4318 |
|
/** |
4327 |
|
* @return the result of accumulating the given transformation |
4328 |
|
* of all keys |
4329 |
|
*/ |
4330 |
< |
public int reduceKeysToInt(ObjectToInt<? super K> transformer, |
4331 |
< |
int basis, |
4332 |
< |
IntByIntToInt reducer) { |
4333 |
< |
return fjp.invoke(ForkJoinTasks.reduceKeysToInt |
4334 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4330 |
> |
public int reduceToInt(ObjectToInt<? super K> transformer, |
4331 |
> |
int basis, |
4332 |
> |
IntByIntToInt reducer) { |
4333 |
> |
return ForkJoinTasks.reduceKeysToInt |
4334 |
> |
(map, transformer, basis, reducer).invoke(); |
4335 |
> |
} |
4336 |
> |
|
4337 |
> |
} |
4338 |
> |
|
4339 |
> |
/** |
4340 |
> |
* A view of a ConcurrentHashMapV8 as a {@link Collection} of |
4341 |
> |
* values, in which additions are disabled. This class cannot be |
4342 |
> |
* directly instantiated. See {@link #values}, |
4343 |
> |
* |
4344 |
> |
* <p>The view's {@code iterator} is a "weakly consistent" iterator |
4345 |
> |
* that will never throw {@link ConcurrentModificationException}, |
4346 |
> |
* and guarantees to traverse elements as they existed upon |
4347 |
> |
* construction of the iterator, and may (but is not guaranteed to) |
4348 |
> |
* reflect any modifications subsequent to construction. |
4349 |
> |
*/ |
4350 |
> |
public static final class ValuesView<K,V> extends CHMView<K,V> |
4351 |
> |
implements Collection<V> { |
4352 |
> |
ValuesView(ConcurrentHashMapV8<K, V> map) { super(map); } |
4353 |
> |
public final boolean contains(Object o) { return map.containsValue(o); } |
4354 |
> |
public final boolean remove(Object o) { |
4355 |
> |
if (o != null) { |
4356 |
> |
Iterator<V> it = new ValueIterator<K,V>(map); |
4357 |
> |
while (it.hasNext()) { |
4358 |
> |
if (o.equals(it.next())) { |
4359 |
> |
it.remove(); |
4360 |
> |
return true; |
4361 |
> |
} |
4362 |
> |
} |
4363 |
> |
} |
4364 |
> |
return false; |
4365 |
> |
} |
4366 |
> |
|
4367 |
> |
/** |
4368 |
> |
* Returns a "weakly consistent" iterator that will never |
4369 |
> |
* throw {@link ConcurrentModificationException}, and |
4370 |
> |
* guarantees to traverse elements as they existed upon |
4371 |
> |
* construction of the iterator, and may (but is not |
4372 |
> |
* guaranteed to) reflect any modifications subsequent to |
4373 |
> |
* construction. |
4374 |
> |
* |
4375 |
> |
* @return an iterator over the values of this map |
4376 |
> |
*/ |
4377 |
> |
public final Iterator<V> iterator() { |
4378 |
> |
return new ValueIterator<K,V>(map); |
4379 |
> |
} |
4380 |
> |
public final boolean add(V e) { |
4381 |
> |
throw new UnsupportedOperationException(); |
4382 |
> |
} |
4383 |
> |
public final boolean addAll(Collection<? extends V> c) { |
4384 |
> |
throw new UnsupportedOperationException(); |
4385 |
|
} |
4386 |
|
|
4387 |
|
/** |
4389 |
|
* |
4390 |
|
* @param action the action |
4391 |
|
*/ |
4392 |
< |
public void forEachValue(Action<V> action) { |
4393 |
< |
fjp.invoke(ForkJoinTasks.forEachValue |
4394 |
< |
(ConcurrentHashMapV8.this, action)); |
4392 |
> |
public void forEach(Action<V> action) { |
4393 |
> |
ForkJoinTasks.forEachValue |
4394 |
> |
(map, action).invoke(); |
4395 |
|
} |
4396 |
|
|
4397 |
|
/** |
4399 |
|
* of each value. |
4400 |
|
* |
4401 |
|
* @param transformer a function returning the transformation |
4402 |
< |
* for an element, or null if there is no transformation (in |
4403 |
< |
* which case the action is not applied) |
4402 |
> |
* for an element, or null of there is no transformation (in |
4403 |
> |
* which case the action is not applied). |
4404 |
|
*/ |
4405 |
< |
public <U> void forEachValue(Fun<? super V, ? extends U> transformer, |
4405 |
> |
public <U> void forEach(Fun<? super V, ? extends U> transformer, |
4406 |
|
Action<U> action) { |
4407 |
< |
fjp.invoke(ForkJoinTasks.forEachValue |
4408 |
< |
(ConcurrentHashMapV8.this, transformer, action)); |
4407 |
> |
ForkJoinTasks.forEachValue |
4408 |
> |
(map, transformer, action).invoke(); |
4409 |
|
} |
4410 |
|
|
4411 |
|
/** |
4419 |
|
* result on success, else null |
4420 |
|
* @return a non-null result from applying the given search |
4421 |
|
* function on each value, or null if none |
4422 |
+ |
* |
4423 |
|
*/ |
4424 |
< |
public <U> U searchValues(Fun<? super V, ? extends U> searchFunction) { |
4425 |
< |
return fjp.invoke(ForkJoinTasks.searchValues |
4426 |
< |
(ConcurrentHashMapV8.this, searchFunction)); |
4424 |
> |
public <U> U search(Fun<? super V, ? extends U> searchFunction) { |
4425 |
> |
return ForkJoinTasks.searchValues |
4426 |
> |
(map, searchFunction).invoke(); |
4427 |
|
} |
4428 |
|
|
4429 |
|
/** |
4433 |
|
* @param reducer a commutative associative combining function |
4434 |
|
* @return the result of accumulating all values |
4435 |
|
*/ |
4436 |
< |
public V reduceValues(BiFun<? super V, ? super V, ? extends V> reducer) { |
4437 |
< |
return fjp.invoke(ForkJoinTasks.reduceValues |
4438 |
< |
(ConcurrentHashMapV8.this, reducer)); |
4436 |
> |
public V reduce(BiFun<? super V, ? super V, ? extends V> reducer) { |
4437 |
> |
return ForkJoinTasks.reduceValues |
4438 |
> |
(map, reducer).invoke(); |
4439 |
|
} |
4440 |
|
|
4441 |
|
/** |
4444 |
|
* null if none. |
4445 |
|
* |
4446 |
|
* @param transformer a function returning the transformation |
4447 |
< |
* for an element, or null if there is no transformation (in |
4448 |
< |
* which case it is not combined) |
4447 |
> |
* for an element, or null of there is no transformation (in |
4448 |
> |
* which case it is not combined). |
4449 |
|
* @param reducer a commutative associative combining function |
4450 |
|
* @return the result of accumulating the given transformation |
4451 |
|
* of all values |
4452 |
|
*/ |
4453 |
< |
public <U> U reduceValues(Fun<? super V, ? extends U> transformer, |
4454 |
< |
BiFun<? super U, ? super U, ? extends U> reducer) { |
4455 |
< |
return fjp.invoke(ForkJoinTasks.reduceValues |
4456 |
< |
(ConcurrentHashMapV8.this, transformer, reducer)); |
4453 |
> |
public <U> U reduce(Fun<? super V, ? extends U> transformer, |
4454 |
> |
BiFun<? super U, ? super U, ? extends U> reducer) { |
4455 |
> |
return ForkJoinTasks.reduceValues |
4456 |
> |
(map, transformer, reducer).invoke(); |
4457 |
|
} |
4458 |
|
|
4459 |
|
/** |
4468 |
|
* @return the result of accumulating the given transformation |
4469 |
|
* of all values |
4470 |
|
*/ |
4471 |
< |
public double reduceValuesToDouble(ObjectToDouble<? super V> transformer, |
4472 |
< |
double basis, |
4473 |
< |
DoubleByDoubleToDouble reducer) { |
4474 |
< |
return fjp.invoke(ForkJoinTasks.reduceValuesToDouble |
4475 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4471 |
> |
public double reduceToDouble(ObjectToDouble<? super V> transformer, |
4472 |
> |
double basis, |
4473 |
> |
DoubleByDoubleToDouble reducer) { |
4474 |
> |
return ForkJoinTasks.reduceValuesToDouble |
4475 |
> |
(map, transformer, basis, reducer).invoke(); |
4476 |
|
} |
4477 |
|
|
4478 |
|
/** |
4487 |
|
* @return the result of accumulating the given transformation |
4488 |
|
* of all values |
4489 |
|
*/ |
4490 |
< |
public long reduceValuesToLong(ObjectToLong<? super V> transformer, |
4491 |
< |
long basis, |
4492 |
< |
LongByLongToLong reducer) { |
4493 |
< |
return fjp.invoke(ForkJoinTasks.reduceValuesToLong |
4494 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4490 |
> |
public long reduceToLong(ObjectToLong<? super V> transformer, |
4491 |
> |
long basis, |
4492 |
> |
LongByLongToLong reducer) { |
4493 |
> |
return ForkJoinTasks.reduceValuesToLong |
4494 |
> |
(map, transformer, basis, reducer).invoke(); |
4495 |
|
} |
4496 |
|
|
4497 |
|
/** |
4506 |
|
* @return the result of accumulating the given transformation |
4507 |
|
* of all values |
4508 |
|
*/ |
4509 |
< |
public int reduceValuesToInt(ObjectToInt<? super V> transformer, |
4510 |
< |
int basis, |
4511 |
< |
IntByIntToInt reducer) { |
4512 |
< |
return fjp.invoke(ForkJoinTasks.reduceValuesToInt |
4513 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4509 |
> |
public int reduceToInt(ObjectToInt<? super V> transformer, |
4510 |
> |
int basis, |
4511 |
> |
IntByIntToInt reducer) { |
4512 |
> |
return ForkJoinTasks.reduceValuesToInt |
4513 |
> |
(map, transformer, basis, reducer).invoke(); |
4514 |
> |
} |
4515 |
> |
|
4516 |
> |
} |
4517 |
> |
|
4518 |
> |
/** |
4519 |
> |
* A view of a ConcurrentHashMapV8 as a {@link Set} of (key, value) |
4520 |
> |
* entries. This class cannot be directly instantiated. See |
4521 |
> |
* {@link #entrySet}. |
4522 |
> |
*/ |
4523 |
> |
public static final class EntrySetView<K,V> extends CHMView<K,V> |
4524 |
> |
implements Set<Map.Entry<K,V>> { |
4525 |
> |
EntrySetView(ConcurrentHashMapV8<K, V> map) { super(map); } |
4526 |
> |
public final boolean contains(Object o) { |
4527 |
> |
Object k, v, r; Map.Entry<?,?> e; |
4528 |
> |
return ((o instanceof Map.Entry) && |
4529 |
> |
(k = (e = (Map.Entry<?,?>)o).getKey()) != null && |
4530 |
> |
(r = map.get(k)) != null && |
4531 |
> |
(v = e.getValue()) != null && |
4532 |
> |
(v == r || v.equals(r))); |
4533 |
> |
} |
4534 |
> |
public final boolean remove(Object o) { |
4535 |
> |
Object k, v; Map.Entry<?,?> e; |
4536 |
> |
return ((o instanceof Map.Entry) && |
4537 |
> |
(k = (e = (Map.Entry<?,?>)o).getKey()) != null && |
4538 |
> |
(v = e.getValue()) != null && |
4539 |
> |
map.remove(k, v)); |
4540 |
> |
} |
4541 |
> |
|
4542 |
> |
/** |
4543 |
> |
* Returns a "weakly consistent" iterator that will never |
4544 |
> |
* throw {@link ConcurrentModificationException}, and |
4545 |
> |
* guarantees to traverse elements as they existed upon |
4546 |
> |
* construction of the iterator, and may (but is not |
4547 |
> |
* guaranteed to) reflect any modifications subsequent to |
4548 |
> |
* construction. |
4549 |
> |
* |
4550 |
> |
* @return an iterator over the entries of this map |
4551 |
> |
*/ |
4552 |
> |
public final Iterator<Map.Entry<K,V>> iterator() { |
4553 |
> |
return new EntryIterator<K,V>(map); |
4554 |
> |
} |
4555 |
> |
|
4556 |
> |
public final boolean add(Entry<K,V> e) { |
4557 |
> |
K key = e.getKey(); |
4558 |
> |
V value = e.getValue(); |
4559 |
> |
if (key == null || value == null) |
4560 |
> |
throw new NullPointerException(); |
4561 |
> |
return map.internalPut(key, value) == null; |
4562 |
> |
} |
4563 |
> |
public final boolean addAll(Collection<? extends Entry<K,V>> c) { |
4564 |
> |
boolean added = false; |
4565 |
> |
for (Entry<K,V> e : c) { |
4566 |
> |
if (add(e)) |
4567 |
> |
added = true; |
4568 |
> |
} |
4569 |
> |
return added; |
4570 |
> |
} |
4571 |
> |
public boolean equals(Object o) { |
4572 |
> |
Set<?> c; |
4573 |
> |
return ((o instanceof Set) && |
4574 |
> |
((c = (Set<?>)o) == this || |
4575 |
> |
(containsAll(c) && c.containsAll(this)))); |
4576 |
|
} |
4577 |
|
|
4578 |
|
/** |
4580 |
|
* |
4581 |
|
* @param action the action |
4582 |
|
*/ |
4583 |
< |
public void forEachEntry(Action<Map.Entry<K,V>> action) { |
4584 |
< |
fjp.invoke(ForkJoinTasks.forEachEntry |
4585 |
< |
(ConcurrentHashMapV8.this, action)); |
4583 |
> |
public void forEach(Action<Map.Entry<K,V>> action) { |
4584 |
> |
ForkJoinTasks.forEachEntry |
4585 |
> |
(map, action).invoke(); |
4586 |
|
} |
4587 |
|
|
4588 |
|
/** |
4590 |
|
* of each entry. |
4591 |
|
* |
4592 |
|
* @param transformer a function returning the transformation |
4593 |
< |
* for an element, or null if there is no transformation (in |
4594 |
< |
* which case the action is not applied) |
4593 |
> |
* for an element, or null of there is no transformation (in |
4594 |
> |
* which case the action is not applied). |
4595 |
|
* @param action the action |
4596 |
|
*/ |
4597 |
< |
public <U> void forEachEntry(Fun<Map.Entry<K,V>, ? extends U> transformer, |
4598 |
< |
Action<U> action) { |
4599 |
< |
fjp.invoke(ForkJoinTasks.forEachEntry |
4600 |
< |
(ConcurrentHashMapV8.this, transformer, action)); |
4597 |
> |
public <U> void forEach(Fun<Map.Entry<K,V>, ? extends U> transformer, |
4598 |
> |
Action<U> action) { |
4599 |
> |
ForkJoinTasks.forEachEntry |
4600 |
> |
(map, transformer, action).invoke(); |
4601 |
|
} |
4602 |
|
|
4603 |
|
/** |
4612 |
|
* @return a non-null result from applying the given search |
4613 |
|
* function on each entry, or null if none |
4614 |
|
*/ |
4615 |
< |
public <U> U searchEntries(Fun<Map.Entry<K,V>, ? extends U> searchFunction) { |
4616 |
< |
return fjp.invoke(ForkJoinTasks.searchEntries |
4617 |
< |
(ConcurrentHashMapV8.this, searchFunction)); |
4615 |
> |
public <U> U search(Fun<Map.Entry<K,V>, ? extends U> searchFunction) { |
4616 |
> |
return ForkJoinTasks.searchEntries |
4617 |
> |
(map, searchFunction).invoke(); |
4618 |
|
} |
4619 |
|
|
4620 |
|
/** |
4624 |
|
* @param reducer a commutative associative combining function |
4625 |
|
* @return the result of accumulating all entries |
4626 |
|
*/ |
4627 |
< |
public Map.Entry<K,V> reduceEntries(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) { |
4628 |
< |
return fjp.invoke(ForkJoinTasks.reduceEntries |
4629 |
< |
(ConcurrentHashMapV8.this, reducer)); |
4627 |
> |
public Map.Entry<K,V> reduce(BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) { |
4628 |
> |
return ForkJoinTasks.reduceEntries |
4629 |
> |
(map, reducer).invoke(); |
4630 |
|
} |
4631 |
|
|
4632 |
|
/** |
4635 |
|
* or null if none. |
4636 |
|
* |
4637 |
|
* @param transformer a function returning the transformation |
4638 |
< |
* for an element, or null if there is no transformation (in |
4638 |
> |
* for an element, or null of there is no transformation (in |
4639 |
|
* which case it is not combined). |
4640 |
|
* @param reducer a commutative associative combining function |
4641 |
|
* @return the result of accumulating the given transformation |
4642 |
|
* of all entries |
4643 |
|
*/ |
4644 |
< |
public <U> U reduceEntries(Fun<Map.Entry<K,V>, ? extends U> transformer, |
4645 |
< |
BiFun<? super U, ? super U, ? extends U> reducer) { |
4646 |
< |
return fjp.invoke(ForkJoinTasks.reduceEntries |
4647 |
< |
(ConcurrentHashMapV8.this, transformer, reducer)); |
4644 |
> |
public <U> U reduce(Fun<Map.Entry<K,V>, ? extends U> transformer, |
4645 |
> |
BiFun<? super U, ? super U, ? extends U> reducer) { |
4646 |
> |
return ForkJoinTasks.reduceEntries |
4647 |
> |
(map, transformer, reducer).invoke(); |
4648 |
|
} |
4649 |
|
|
4650 |
|
/** |
4659 |
|
* @return the result of accumulating the given transformation |
4660 |
|
* of all entries |
4661 |
|
*/ |
4662 |
< |
public double reduceEntriesToDouble(ObjectToDouble<Map.Entry<K,V>> transformer, |
4663 |
< |
double basis, |
4664 |
< |
DoubleByDoubleToDouble reducer) { |
4665 |
< |
return fjp.invoke(ForkJoinTasks.reduceEntriesToDouble |
4666 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4662 |
> |
public double reduceToDouble(ObjectToDouble<Map.Entry<K,V>> transformer, |
4663 |
> |
double basis, |
4664 |
> |
DoubleByDoubleToDouble reducer) { |
4665 |
> |
return ForkJoinTasks.reduceEntriesToDouble |
4666 |
> |
(map, transformer, basis, reducer).invoke(); |
4667 |
|
} |
4668 |
|
|
4669 |
|
/** |
4678 |
|
* @return the result of accumulating the given transformation |
4679 |
|
* of all entries |
4680 |
|
*/ |
4681 |
< |
public long reduceEntriesToLong(ObjectToLong<Map.Entry<K,V>> transformer, |
4682 |
< |
long basis, |
4683 |
< |
LongByLongToLong reducer) { |
4684 |
< |
return fjp.invoke(ForkJoinTasks.reduceEntriesToLong |
4685 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4681 |
> |
public long reduceToLong(ObjectToLong<Map.Entry<K,V>> transformer, |
4682 |
> |
long basis, |
4683 |
> |
LongByLongToLong reducer) { |
4684 |
> |
return ForkJoinTasks.reduceEntriesToLong |
4685 |
> |
(map, transformer, basis, reducer).invoke(); |
4686 |
|
} |
4687 |
|
|
4688 |
|
/** |
4697 |
|
* @return the result of accumulating the given transformation |
4698 |
|
* of all entries |
4699 |
|
*/ |
4700 |
< |
public int reduceEntriesToInt(ObjectToInt<Map.Entry<K,V>> transformer, |
4701 |
< |
int basis, |
4702 |
< |
IntByIntToInt reducer) { |
4703 |
< |
return fjp.invoke(ForkJoinTasks.reduceEntriesToInt |
4704 |
< |
(ConcurrentHashMapV8.this, transformer, basis, reducer)); |
4700 |
> |
public int reduceToInt(ObjectToInt<Map.Entry<K,V>> transformer, |
4701 |
> |
int basis, |
4702 |
> |
IntByIntToInt reducer) { |
4703 |
> |
return ForkJoinTasks.reduceEntriesToInt |
4704 |
> |
(map, transformer, basis, reducer).invoke(); |
4705 |
|
} |
4706 |
+ |
|
4707 |
|
} |
4708 |
|
|
4709 |
|
// --------------------------------------------------------------------- |
4710 |
|
|
4711 |
|
/** |
4712 |
|
* Predefined tasks for performing bulk parallel operations on |
4713 |
< |
* ConcurrentHashMaps. These tasks follow the forms and rules used |
4714 |
< |
* in class {@link Parallel}. Each method has the same name, but |
4715 |
< |
* returns a task rather than invoking it. These methods may be |
4716 |
< |
* useful in custom applications such as submitting a task without |
4717 |
< |
* waiting for completion, or combining with other tasks. |
4713 |
> |
* ConcurrentHashMapV8s. These tasks follow the forms and rules used |
4714 |
> |
* for bulk operations. Each method has the same name, but returns |
4715 |
> |
* a task rather than invoking it. These methods may be useful in |
4716 |
> |
* custom applications such as submitting a task without waiting |
4717 |
> |
* for completion, using a custom pool, or combining with other |
4718 |
> |
* tasks. |
4719 |
|
*/ |
4720 |
|
public static class ForkJoinTasks { |
4721 |
|
private ForkJoinTasks() {} |
5373 |
|
|
5374 |
|
// ------------------------------------------------------- |
5375 |
|
|
4830 |
– |
/** |
4831 |
– |
* Base for FJ tasks for bulk operations. This adds a variant of |
4832 |
– |
* CountedCompleters and some split and merge bookkeeping to |
4833 |
– |
* iterator functionality. The forEach and reduce methods are |
4834 |
– |
* similar to those illustrated in CountedCompleter documentation, |
4835 |
– |
* except that bottom-up reduction completions perform them within |
4836 |
– |
* their compute methods. The search methods are like forEach |
4837 |
– |
* except they continually poll for success and exit early. Also, |
4838 |
– |
* exceptions are handled in a simpler manner, by just trying to |
4839 |
– |
* complete root task exceptionally. |
4840 |
– |
*/ |
4841 |
– |
@SuppressWarnings("serial") static abstract class BulkTask<K,V,R> extends Traverser<K,V,R> { |
4842 |
– |
final BulkTask<K,V,?> parent; // completion target |
4843 |
– |
int batch; // split control; -1 for unknown |
4844 |
– |
int pending; // completion control |
4845 |
– |
|
4846 |
– |
BulkTask(ConcurrentHashMapV8<K,V> map, BulkTask<K,V,?> parent, |
4847 |
– |
int batch) { |
4848 |
– |
super(map); |
4849 |
– |
this.parent = parent; |
4850 |
– |
this.batch = batch; |
4851 |
– |
if (parent != null && map != null) { // split parent |
4852 |
– |
Node[] t; |
4853 |
– |
if ((t = parent.tab) == null && |
4854 |
– |
(t = parent.tab = map.table) != null) |
4855 |
– |
parent.baseLimit = parent.baseSize = t.length; |
4856 |
– |
this.tab = t; |
4857 |
– |
this.baseSize = parent.baseSize; |
4858 |
– |
int hi = this.baseLimit = parent.baseLimit; |
4859 |
– |
parent.baseLimit = this.index = this.baseIndex = |
4860 |
– |
(hi + parent.baseIndex + 1) >>> 1; |
4861 |
– |
} |
4862 |
– |
} |
4863 |
– |
|
4864 |
– |
// FJ methods |
4865 |
– |
|
4866 |
– |
/** |
4867 |
– |
* Propagates completion. Note that all reduce actions |
4868 |
– |
* bypass this method to combine while completing. |
4869 |
– |
*/ |
4870 |
– |
final void tryComplete() { |
4871 |
– |
BulkTask<K,V,?> a = this, s = a; |
4872 |
– |
for (int c;;) { |
4873 |
– |
if ((c = a.pending) == 0) { |
4874 |
– |
if ((a = (s = a).parent) == null) { |
4875 |
– |
s.quietlyComplete(); |
4876 |
– |
break; |
4877 |
– |
} |
4878 |
– |
} |
4879 |
– |
else if (U.compareAndSwapInt(a, PENDING, c, c - 1)) |
4880 |
– |
break; |
4881 |
– |
} |
4882 |
– |
} |
4883 |
– |
|
4884 |
– |
/** |
4885 |
– |
* Forces root task to complete. |
4886 |
– |
* @param ex if null, complete normally, else exceptionally |
4887 |
– |
* @return false to simplify use |
4888 |
– |
*/ |
4889 |
– |
final boolean tryCompleteComputation(Throwable ex) { |
4890 |
– |
for (BulkTask<K,V,?> a = this;;) { |
4891 |
– |
BulkTask<K,V,?> p = a.parent; |
4892 |
– |
if (p == null) { |
4893 |
– |
if (ex != null) |
4894 |
– |
a.completeExceptionally(ex); |
4895 |
– |
else |
4896 |
– |
a.quietlyComplete(); |
4897 |
– |
return false; |
4898 |
– |
} |
4899 |
– |
a = p; |
4900 |
– |
} |
4901 |
– |
} |
4902 |
– |
|
4903 |
– |
/** |
4904 |
– |
* Version of tryCompleteComputation for function screening checks |
4905 |
– |
*/ |
4906 |
– |
final boolean abortOnNullFunction() { |
4907 |
– |
return tryCompleteComputation(new Error("Unexpected null function")); |
4908 |
– |
} |
4909 |
– |
|
4910 |
– |
// utilities |
4911 |
– |
|
4912 |
– |
/** CompareAndSet pending count */ |
4913 |
– |
final boolean casPending(int cmp, int val) { |
4914 |
– |
return U.compareAndSwapInt(this, PENDING, cmp, val); |
4915 |
– |
} |
4916 |
– |
|
4917 |
– |
/** |
4918 |
– |
* Returns approx exp2 of the number of times (minus one) to |
4919 |
– |
* split task by two before executing leaf action. This value |
4920 |
– |
* is faster to compute and more convenient to use as a guide |
4921 |
– |
* to splitting than is the depth, since it is used while |
4922 |
– |
* dividing by two anyway. |
4923 |
– |
*/ |
4924 |
– |
final int batch() { |
4925 |
– |
ConcurrentHashMapV8<K, V> m; int b; Node[] t; |
4926 |
– |
if ((b = batch) < 0 && (m = map) != null) { // force initialization |
4927 |
– |
if ((t = tab) == null && (t = tab = m.table) != null) |
4928 |
– |
baseLimit = baseSize = t.length; |
4929 |
– |
if (t != null) { |
4930 |
– |
long n = m.counter.sum(); |
4931 |
– |
int sp = getPool().getParallelism() << 3; // slack of 8 |
4932 |
– |
b = batch = (n <= 0L) ? 0 : (n < (long)sp) ? (int)n : sp; |
4933 |
– |
} |
4934 |
– |
} |
4935 |
– |
return b; |
4936 |
– |
} |
4937 |
– |
|
4938 |
– |
/** |
4939 |
– |
* Returns exportable snapshot entry. |
4940 |
– |
*/ |
4941 |
– |
static <K,V> AbstractMap.SimpleEntry<K,V> entryFor(K k, V v) { |
4942 |
– |
return new AbstractMap.SimpleEntry<K,V>(k, v); |
4943 |
– |
} |
4944 |
– |
|
4945 |
– |
// Unsafe mechanics |
4946 |
– |
private static final sun.misc.Unsafe U; |
4947 |
– |
private static final long PENDING; |
4948 |
– |
static { |
4949 |
– |
try { |
4950 |
– |
U = getUnsafe(); |
4951 |
– |
PENDING = U.objectFieldOffset |
4952 |
– |
(BulkTask.class.getDeclaredField("pending")); |
4953 |
– |
} catch (Exception e) { |
4954 |
– |
throw new Error(e); |
4955 |
– |
} |
4956 |
– |
} |
4957 |
– |
} |
4958 |
– |
|
5376 |
|
/* |
5377 |
|
* Task classes. Coded in a regular but ugly format/style to |
5378 |
|
* simplify checks that each variant differs in the right way from |
5380 |
|
*/ |
5381 |
|
|
5382 |
|
@SuppressWarnings("serial") static final class ForEachKeyTask<K,V> |
5383 |
< |
extends BulkTask<K,V,Void> { |
5383 |
> |
extends Traverser<K,V,Void> { |
5384 |
|
final Action<K> action; |
5385 |
|
ForEachKeyTask |
5386 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5386 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5387 |
|
Action<K> action) { |
5388 |
|
super(m, p, b); |
5389 |
|
this.action = action; |
5390 |
|
} |
5391 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5392 |
< |
final Action<K> action = this.action; |
5393 |
< |
if (action == null) |
5394 |
< |
return abortOnNullFunction(); |
5395 |
< |
try { |
5396 |
< |
int b = batch(), c; |
5397 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5398 |
< |
do {} while (!casPending(c = pending, c+1)); |
5399 |
< |
new ForEachKeyTask<K,V>(map, this, b >>>= 1, action).fork(); |
4983 |
< |
} |
4984 |
< |
while (advance() != null) |
4985 |
< |
action.apply((K)nextKey); |
4986 |
< |
tryComplete(); |
4987 |
< |
} catch (Throwable ex) { |
4988 |
< |
return tryCompleteComputation(ex); |
4989 |
< |
} |
4990 |
< |
return false; |
5391 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5392 |
> |
final Action<K> action; |
5393 |
> |
if ((action = this.action) == null) |
5394 |
> |
throw new NullPointerException(); |
5395 |
> |
for (int b; (b = preSplit()) > 0;) |
5396 |
> |
new ForEachKeyTask<K,V>(map, this, b, action).fork(); |
5397 |
> |
while (advance() != null) |
5398 |
> |
action.apply((K)nextKey); |
5399 |
> |
propagateCompletion(); |
5400 |
|
} |
5401 |
|
} |
5402 |
|
|
5403 |
|
@SuppressWarnings("serial") static final class ForEachValueTask<K,V> |
5404 |
< |
extends BulkTask<K,V,Void> { |
5404 |
> |
extends Traverser<K,V,Void> { |
5405 |
|
final Action<V> action; |
5406 |
|
ForEachValueTask |
5407 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5407 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5408 |
|
Action<V> action) { |
5409 |
|
super(m, p, b); |
5410 |
|
this.action = action; |
5411 |
|
} |
5412 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5413 |
< |
final Action<V> action = this.action; |
5414 |
< |
if (action == null) |
5415 |
< |
return abortOnNullFunction(); |
5416 |
< |
try { |
5417 |
< |
int b = batch(), c; |
5418 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5419 |
< |
do {} while (!casPending(c = pending, c+1)); |
5420 |
< |
new ForEachValueTask<K,V>(map, this, b >>>= 1, action).fork(); |
5421 |
< |
} |
5013 |
< |
Object v; |
5014 |
< |
while ((v = advance()) != null) |
5015 |
< |
action.apply((V)v); |
5016 |
< |
tryComplete(); |
5017 |
< |
} catch (Throwable ex) { |
5018 |
< |
return tryCompleteComputation(ex); |
5019 |
< |
} |
5020 |
< |
return false; |
5412 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5413 |
> |
final Action<V> action; |
5414 |
> |
if ((action = this.action) == null) |
5415 |
> |
throw new NullPointerException(); |
5416 |
> |
for (int b; (b = preSplit()) > 0;) |
5417 |
> |
new ForEachValueTask<K,V>(map, this, b, action).fork(); |
5418 |
> |
Object v; |
5419 |
> |
while ((v = advance()) != null) |
5420 |
> |
action.apply((V)v); |
5421 |
> |
propagateCompletion(); |
5422 |
|
} |
5423 |
|
} |
5424 |
|
|
5425 |
|
@SuppressWarnings("serial") static final class ForEachEntryTask<K,V> |
5426 |
< |
extends BulkTask<K,V,Void> { |
5426 |
> |
extends Traverser<K,V,Void> { |
5427 |
|
final Action<Entry<K,V>> action; |
5428 |
|
ForEachEntryTask |
5429 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5429 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5430 |
|
Action<Entry<K,V>> action) { |
5431 |
|
super(m, p, b); |
5432 |
|
this.action = action; |
5433 |
|
} |
5434 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5435 |
< |
final Action<Entry<K,V>> action = this.action; |
5436 |
< |
if (action == null) |
5437 |
< |
return abortOnNullFunction(); |
5438 |
< |
try { |
5439 |
< |
int b = batch(), c; |
5440 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5441 |
< |
do {} while (!casPending(c = pending, c+1)); |
5442 |
< |
new ForEachEntryTask<K,V>(map, this, b >>>= 1, action).fork(); |
5443 |
< |
} |
5043 |
< |
Object v; |
5044 |
< |
while ((v = advance()) != null) |
5045 |
< |
action.apply(entryFor((K)nextKey, (V)v)); |
5046 |
< |
tryComplete(); |
5047 |
< |
} catch (Throwable ex) { |
5048 |
< |
return tryCompleteComputation(ex); |
5049 |
< |
} |
5050 |
< |
return false; |
5434 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5435 |
> |
final Action<Entry<K,V>> action; |
5436 |
> |
if ((action = this.action) == null) |
5437 |
> |
throw new NullPointerException(); |
5438 |
> |
for (int b; (b = preSplit()) > 0;) |
5439 |
> |
new ForEachEntryTask<K,V>(map, this, b, action).fork(); |
5440 |
> |
Object v; |
5441 |
> |
while ((v = advance()) != null) |
5442 |
> |
action.apply(entryFor((K)nextKey, (V)v)); |
5443 |
> |
propagateCompletion(); |
5444 |
|
} |
5445 |
|
} |
5446 |
|
|
5447 |
|
@SuppressWarnings("serial") static final class ForEachMappingTask<K,V> |
5448 |
< |
extends BulkTask<K,V,Void> { |
5448 |
> |
extends Traverser<K,V,Void> { |
5449 |
|
final BiAction<K,V> action; |
5450 |
|
ForEachMappingTask |
5451 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5451 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5452 |
|
BiAction<K,V> action) { |
5453 |
|
super(m, p, b); |
5454 |
|
this.action = action; |
5455 |
|
} |
5456 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5457 |
< |
final BiAction<K,V> action = this.action; |
5458 |
< |
if (action == null) |
5459 |
< |
return abortOnNullFunction(); |
5460 |
< |
try { |
5461 |
< |
int b = batch(), c; |
5462 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5463 |
< |
do {} while (!casPending(c = pending, c+1)); |
5464 |
< |
new ForEachMappingTask<K,V>(map, this, b >>>= 1, |
5465 |
< |
action).fork(); |
5073 |
< |
} |
5074 |
< |
Object v; |
5075 |
< |
while ((v = advance()) != null) |
5076 |
< |
action.apply((K)nextKey, (V)v); |
5077 |
< |
tryComplete(); |
5078 |
< |
} catch (Throwable ex) { |
5079 |
< |
return tryCompleteComputation(ex); |
5080 |
< |
} |
5081 |
< |
return false; |
5456 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5457 |
> |
final BiAction<K,V> action; |
5458 |
> |
if ((action = this.action) == null) |
5459 |
> |
throw new NullPointerException(); |
5460 |
> |
for (int b; (b = preSplit()) > 0;) |
5461 |
> |
new ForEachMappingTask<K,V>(map, this, b, action).fork(); |
5462 |
> |
Object v; |
5463 |
> |
while ((v = advance()) != null) |
5464 |
> |
action.apply((K)nextKey, (V)v); |
5465 |
> |
propagateCompletion(); |
5466 |
|
} |
5467 |
|
} |
5468 |
|
|
5469 |
|
@SuppressWarnings("serial") static final class ForEachTransformedKeyTask<K,V,U> |
5470 |
< |
extends BulkTask<K,V,Void> { |
5470 |
> |
extends Traverser<K,V,Void> { |
5471 |
|
final Fun<? super K, ? extends U> transformer; |
5472 |
|
final Action<U> action; |
5473 |
|
ForEachTransformedKeyTask |
5474 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5475 |
< |
Fun<? super K, ? extends U> transformer, |
5092 |
< |
Action<U> action) { |
5474 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5475 |
> |
Fun<? super K, ? extends U> transformer, Action<U> action) { |
5476 |
|
super(m, p, b); |
5477 |
< |
this.transformer = transformer; |
5095 |
< |
this.action = action; |
5096 |
< |
|
5477 |
> |
this.transformer = transformer; this.action = action; |
5478 |
|
} |
5479 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5480 |
< |
final Fun<? super K, ? extends U> transformer = |
5481 |
< |
this.transformer; |
5482 |
< |
final Action<U> action = this.action; |
5483 |
< |
if (transformer == null || action == null) |
5484 |
< |
return abortOnNullFunction(); |
5485 |
< |
try { |
5486 |
< |
int b = batch(), c; |
5487 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5488 |
< |
do {} while (!casPending(c = pending, c+1)); |
5489 |
< |
new ForEachTransformedKeyTask<K,V,U> |
5490 |
< |
(map, this, b >>>= 1, transformer, action).fork(); |
5491 |
< |
} |
5111 |
< |
U u; |
5112 |
< |
while (advance() != null) { |
5113 |
< |
if ((u = transformer.apply((K)nextKey)) != null) |
5114 |
< |
action.apply(u); |
5115 |
< |
} |
5116 |
< |
tryComplete(); |
5117 |
< |
} catch (Throwable ex) { |
5118 |
< |
return tryCompleteComputation(ex); |
5479 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5480 |
> |
final Fun<? super K, ? extends U> transformer; |
5481 |
> |
final Action<U> action; |
5482 |
> |
if ((transformer = this.transformer) == null || |
5483 |
> |
(action = this.action) == null) |
5484 |
> |
throw new NullPointerException(); |
5485 |
> |
for (int b; (b = preSplit()) > 0;) |
5486 |
> |
new ForEachTransformedKeyTask<K,V,U> |
5487 |
> |
(map, this, b, transformer, action).fork(); |
5488 |
> |
U u; |
5489 |
> |
while (advance() != null) { |
5490 |
> |
if ((u = transformer.apply((K)nextKey)) != null) |
5491 |
> |
action.apply(u); |
5492 |
|
} |
5493 |
< |
return false; |
5493 |
> |
propagateCompletion(); |
5494 |
|
} |
5495 |
|
} |
5496 |
|
|
5497 |
|
@SuppressWarnings("serial") static final class ForEachTransformedValueTask<K,V,U> |
5498 |
< |
extends BulkTask<K,V,Void> { |
5498 |
> |
extends Traverser<K,V,Void> { |
5499 |
|
final Fun<? super V, ? extends U> transformer; |
5500 |
|
final Action<U> action; |
5501 |
|
ForEachTransformedValueTask |
5502 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5503 |
< |
Fun<? super V, ? extends U> transformer, |
5131 |
< |
Action<U> action) { |
5502 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5503 |
> |
Fun<? super V, ? extends U> transformer, Action<U> action) { |
5504 |
|
super(m, p, b); |
5505 |
< |
this.transformer = transformer; |
5134 |
< |
this.action = action; |
5135 |
< |
|
5505 |
> |
this.transformer = transformer; this.action = action; |
5506 |
|
} |
5507 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5508 |
< |
final Fun<? super V, ? extends U> transformer = |
5509 |
< |
this.transformer; |
5510 |
< |
final Action<U> action = this.action; |
5511 |
< |
if (transformer == null || action == null) |
5512 |
< |
return abortOnNullFunction(); |
5513 |
< |
try { |
5514 |
< |
int b = batch(), c; |
5515 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5516 |
< |
do {} while (!casPending(c = pending, c+1)); |
5517 |
< |
new ForEachTransformedValueTask<K,V,U> |
5518 |
< |
(map, this, b >>>= 1, transformer, action).fork(); |
5519 |
< |
} |
5150 |
< |
Object v; U u; |
5151 |
< |
while ((v = advance()) != null) { |
5152 |
< |
if ((u = transformer.apply((V)v)) != null) |
5153 |
< |
action.apply(u); |
5154 |
< |
} |
5155 |
< |
tryComplete(); |
5156 |
< |
} catch (Throwable ex) { |
5157 |
< |
return tryCompleteComputation(ex); |
5507 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5508 |
> |
final Fun<? super V, ? extends U> transformer; |
5509 |
> |
final Action<U> action; |
5510 |
> |
if ((transformer = this.transformer) == null || |
5511 |
> |
(action = this.action) == null) |
5512 |
> |
throw new NullPointerException(); |
5513 |
> |
for (int b; (b = preSplit()) > 0;) |
5514 |
> |
new ForEachTransformedValueTask<K,V,U> |
5515 |
> |
(map, this, b, transformer, action).fork(); |
5516 |
> |
Object v; U u; |
5517 |
> |
while ((v = advance()) != null) { |
5518 |
> |
if ((u = transformer.apply((V)v)) != null) |
5519 |
> |
action.apply(u); |
5520 |
|
} |
5521 |
< |
return false; |
5521 |
> |
propagateCompletion(); |
5522 |
|
} |
5523 |
|
} |
5524 |
|
|
5525 |
|
@SuppressWarnings("serial") static final class ForEachTransformedEntryTask<K,V,U> |
5526 |
< |
extends BulkTask<K,V,Void> { |
5526 |
> |
extends Traverser<K,V,Void> { |
5527 |
|
final Fun<Map.Entry<K,V>, ? extends U> transformer; |
5528 |
|
final Action<U> action; |
5529 |
|
ForEachTransformedEntryTask |
5530 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5531 |
< |
Fun<Map.Entry<K,V>, ? extends U> transformer, |
5170 |
< |
Action<U> action) { |
5530 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5531 |
> |
Fun<Map.Entry<K,V>, ? extends U> transformer, Action<U> action) { |
5532 |
|
super(m, p, b); |
5533 |
< |
this.transformer = transformer; |
5173 |
< |
this.action = action; |
5174 |
< |
|
5533 |
> |
this.transformer = transformer; this.action = action; |
5534 |
|
} |
5535 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5536 |
< |
final Fun<Map.Entry<K,V>, ? extends U> transformer = |
5537 |
< |
this.transformer; |
5538 |
< |
final Action<U> action = this.action; |
5539 |
< |
if (transformer == null || action == null) |
5540 |
< |
return abortOnNullFunction(); |
5541 |
< |
try { |
5542 |
< |
int b = batch(), c; |
5543 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5544 |
< |
do {} while (!casPending(c = pending, c+1)); |
5545 |
< |
new ForEachTransformedEntryTask<K,V,U> |
5546 |
< |
(map, this, b >>>= 1, transformer, action).fork(); |
5547 |
< |
} |
5189 |
< |
Object v; U u; |
5190 |
< |
while ((v = advance()) != null) { |
5191 |
< |
if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) |
5192 |
< |
action.apply(u); |
5193 |
< |
} |
5194 |
< |
tryComplete(); |
5195 |
< |
} catch (Throwable ex) { |
5196 |
< |
return tryCompleteComputation(ex); |
5535 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5536 |
> |
final Fun<Map.Entry<K,V>, ? extends U> transformer; |
5537 |
> |
final Action<U> action; |
5538 |
> |
if ((transformer = this.transformer) == null || |
5539 |
> |
(action = this.action) == null) |
5540 |
> |
throw new NullPointerException(); |
5541 |
> |
for (int b; (b = preSplit()) > 0;) |
5542 |
> |
new ForEachTransformedEntryTask<K,V,U> |
5543 |
> |
(map, this, b, transformer, action).fork(); |
5544 |
> |
Object v; U u; |
5545 |
> |
while ((v = advance()) != null) { |
5546 |
> |
if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) |
5547 |
> |
action.apply(u); |
5548 |
|
} |
5549 |
< |
return false; |
5549 |
> |
propagateCompletion(); |
5550 |
|
} |
5551 |
|
} |
5552 |
|
|
5553 |
|
@SuppressWarnings("serial") static final class ForEachTransformedMappingTask<K,V,U> |
5554 |
< |
extends BulkTask<K,V,Void> { |
5554 |
> |
extends Traverser<K,V,Void> { |
5555 |
|
final BiFun<? super K, ? super V, ? extends U> transformer; |
5556 |
|
final Action<U> action; |
5557 |
|
ForEachTransformedMappingTask |
5558 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5558 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5559 |
|
BiFun<? super K, ? super V, ? extends U> transformer, |
5560 |
|
Action<U> action) { |
5561 |
|
super(m, p, b); |
5562 |
< |
this.transformer = transformer; |
5212 |
< |
this.action = action; |
5213 |
< |
|
5562 |
> |
this.transformer = transformer; this.action = action; |
5563 |
|
} |
5564 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5565 |
< |
final BiFun<? super K, ? super V, ? extends U> transformer = |
5566 |
< |
this.transformer; |
5567 |
< |
final Action<U> action = this.action; |
5568 |
< |
if (transformer == null || action == null) |
5569 |
< |
return abortOnNullFunction(); |
5570 |
< |
try { |
5571 |
< |
int b = batch(), c; |
5572 |
< |
while (b > 1 && baseIndex != baseLimit) { |
5573 |
< |
do {} while (!casPending(c = pending, c+1)); |
5574 |
< |
new ForEachTransformedMappingTask<K,V,U> |
5575 |
< |
(map, this, b >>>= 1, transformer, action).fork(); |
5576 |
< |
} |
5228 |
< |
Object v; U u; |
5229 |
< |
while ((v = advance()) != null) { |
5230 |
< |
if ((u = transformer.apply((K)nextKey, (V)v)) != null) |
5231 |
< |
action.apply(u); |
5232 |
< |
} |
5233 |
< |
tryComplete(); |
5234 |
< |
} catch (Throwable ex) { |
5235 |
< |
return tryCompleteComputation(ex); |
5564 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5565 |
> |
final BiFun<? super K, ? super V, ? extends U> transformer; |
5566 |
> |
final Action<U> action; |
5567 |
> |
if ((transformer = this.transformer) == null || |
5568 |
> |
(action = this.action) == null) |
5569 |
> |
throw new NullPointerException(); |
5570 |
> |
for (int b; (b = preSplit()) > 0;) |
5571 |
> |
new ForEachTransformedMappingTask<K,V,U> |
5572 |
> |
(map, this, b, transformer, action).fork(); |
5573 |
> |
Object v; U u; |
5574 |
> |
while ((v = advance()) != null) { |
5575 |
> |
if ((u = transformer.apply((K)nextKey, (V)v)) != null) |
5576 |
> |
action.apply(u); |
5577 |
|
} |
5578 |
< |
return false; |
5578 |
> |
propagateCompletion(); |
5579 |
|
} |
5580 |
|
} |
5581 |
|
|
5582 |
|
@SuppressWarnings("serial") static final class SearchKeysTask<K,V,U> |
5583 |
< |
extends BulkTask<K,V,U> { |
5583 |
> |
extends Traverser<K,V,U> { |
5584 |
|
final Fun<? super K, ? extends U> searchFunction; |
5585 |
|
final AtomicReference<U> result; |
5586 |
|
SearchKeysTask |
5587 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5587 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5588 |
|
Fun<? super K, ? extends U> searchFunction, |
5589 |
|
AtomicReference<U> result) { |
5590 |
|
super(m, p, b); |
5591 |
|
this.searchFunction = searchFunction; this.result = result; |
5592 |
|
} |
5593 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5594 |
< |
AtomicReference<U> result = this.result; |
5595 |
< |
final Fun<? super K, ? extends U> searchFunction = |
5596 |
< |
this.searchFunction; |
5597 |
< |
if (searchFunction == null || result == null) |
5598 |
< |
return abortOnNullFunction(); |
5599 |
< |
try { |
5600 |
< |
int b = batch(), c; |
5601 |
< |
while (b > 1 && baseIndex != baseLimit && result.get() == null) { |
5602 |
< |
do {} while (!casPending(c = pending, c+1)); |
5603 |
< |
new SearchKeysTask<K,V,U>(map, this, b >>>= 1, |
5604 |
< |
searchFunction, result).fork(); |
5605 |
< |
} |
5593 |
> |
public final U getRawResult() { return result.get(); } |
5594 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5595 |
> |
final Fun<? super K, ? extends U> searchFunction; |
5596 |
> |
final AtomicReference<U> result; |
5597 |
> |
if ((searchFunction = this.searchFunction) == null || |
5598 |
> |
(result = this.result) == null) |
5599 |
> |
throw new NullPointerException(); |
5600 |
> |
for (int b;;) { |
5601 |
> |
if (result.get() != null) |
5602 |
> |
return; |
5603 |
> |
if ((b = preSplit()) <= 0) |
5604 |
> |
break; |
5605 |
> |
new SearchKeysTask<K,V,U> |
5606 |
> |
(map, this, b, searchFunction, result).fork(); |
5607 |
> |
} |
5608 |
> |
while (result.get() == null) { |
5609 |
|
U u; |
5610 |
< |
while (result.get() == null && advance() != null) { |
5611 |
< |
if ((u = searchFunction.apply((K)nextKey)) != null) { |
5612 |
< |
if (result.compareAndSet(null, u)) |
5613 |
< |
tryCompleteComputation(null); |
5614 |
< |
break; |
5615 |
< |
} |
5610 |
> |
if (advance() == null) { |
5611 |
> |
propagateCompletion(); |
5612 |
> |
break; |
5613 |
> |
} |
5614 |
> |
if ((u = searchFunction.apply((K)nextKey)) != null) { |
5615 |
> |
if (result.compareAndSet(null, u)) |
5616 |
> |
quietlyCompleteRoot(); |
5617 |
> |
break; |
5618 |
|
} |
5273 |
– |
tryComplete(); |
5274 |
– |
} catch (Throwable ex) { |
5275 |
– |
return tryCompleteComputation(ex); |
5619 |
|
} |
5277 |
– |
return false; |
5620 |
|
} |
5279 |
– |
public final U getRawResult() { return result.get(); } |
5621 |
|
} |
5622 |
|
|
5623 |
|
@SuppressWarnings("serial") static final class SearchValuesTask<K,V,U> |
5624 |
< |
extends BulkTask<K,V,U> { |
5624 |
> |
extends Traverser<K,V,U> { |
5625 |
|
final Fun<? super V, ? extends U> searchFunction; |
5626 |
|
final AtomicReference<U> result; |
5627 |
|
SearchValuesTask |
5628 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5628 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5629 |
|
Fun<? super V, ? extends U> searchFunction, |
5630 |
|
AtomicReference<U> result) { |
5631 |
|
super(m, p, b); |
5632 |
|
this.searchFunction = searchFunction; this.result = result; |
5633 |
|
} |
5634 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5635 |
< |
AtomicReference<U> result = this.result; |
5636 |
< |
final Fun<? super V, ? extends U> searchFunction = |
5637 |
< |
this.searchFunction; |
5638 |
< |
if (searchFunction == null || result == null) |
5639 |
< |
return abortOnNullFunction(); |
5640 |
< |
try { |
5641 |
< |
int b = batch(), c; |
5642 |
< |
while (b > 1 && baseIndex != baseLimit && result.get() == null) { |
5643 |
< |
do {} while (!casPending(c = pending, c+1)); |
5644 |
< |
new SearchValuesTask<K,V,U>(map, this, b >>>= 1, |
5645 |
< |
searchFunction, result).fork(); |
5646 |
< |
} |
5634 |
> |
public final U getRawResult() { return result.get(); } |
5635 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5636 |
> |
final Fun<? super V, ? extends U> searchFunction; |
5637 |
> |
final AtomicReference<U> result; |
5638 |
> |
if ((searchFunction = this.searchFunction) == null || |
5639 |
> |
(result = this.result) == null) |
5640 |
> |
throw new NullPointerException(); |
5641 |
> |
for (int b;;) { |
5642 |
> |
if (result.get() != null) |
5643 |
> |
return; |
5644 |
> |
if ((b = preSplit()) <= 0) |
5645 |
> |
break; |
5646 |
> |
new SearchValuesTask<K,V,U> |
5647 |
> |
(map, this, b, searchFunction, result).fork(); |
5648 |
> |
} |
5649 |
> |
while (result.get() == null) { |
5650 |
|
Object v; U u; |
5651 |
< |
while (result.get() == null && (v = advance()) != null) { |
5652 |
< |
if ((u = searchFunction.apply((V)v)) != null) { |
5653 |
< |
if (result.compareAndSet(null, u)) |
5654 |
< |
tryCompleteComputation(null); |
5655 |
< |
break; |
5656 |
< |
} |
5651 |
> |
if ((v = advance()) == null) { |
5652 |
> |
propagateCompletion(); |
5653 |
> |
break; |
5654 |
> |
} |
5655 |
> |
if ((u = searchFunction.apply((V)v)) != null) { |
5656 |
> |
if (result.compareAndSet(null, u)) |
5657 |
> |
quietlyCompleteRoot(); |
5658 |
> |
break; |
5659 |
|
} |
5314 |
– |
tryComplete(); |
5315 |
– |
} catch (Throwable ex) { |
5316 |
– |
return tryCompleteComputation(ex); |
5660 |
|
} |
5318 |
– |
return false; |
5661 |
|
} |
5320 |
– |
public final U getRawResult() { return result.get(); } |
5662 |
|
} |
5663 |
|
|
5664 |
|
@SuppressWarnings("serial") static final class SearchEntriesTask<K,V,U> |
5665 |
< |
extends BulkTask<K,V,U> { |
5665 |
> |
extends Traverser<K,V,U> { |
5666 |
|
final Fun<Entry<K,V>, ? extends U> searchFunction; |
5667 |
|
final AtomicReference<U> result; |
5668 |
|
SearchEntriesTask |
5669 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5669 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5670 |
|
Fun<Entry<K,V>, ? extends U> searchFunction, |
5671 |
|
AtomicReference<U> result) { |
5672 |
|
super(m, p, b); |
5673 |
|
this.searchFunction = searchFunction; this.result = result; |
5674 |
|
} |
5675 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5676 |
< |
AtomicReference<U> result = this.result; |
5677 |
< |
final Fun<Entry<K,V>, ? extends U> searchFunction = |
5678 |
< |
this.searchFunction; |
5679 |
< |
if (searchFunction == null || result == null) |
5680 |
< |
return abortOnNullFunction(); |
5681 |
< |
try { |
5682 |
< |
int b = batch(), c; |
5683 |
< |
while (b > 1 && baseIndex != baseLimit && result.get() == null) { |
5684 |
< |
do {} while (!casPending(c = pending, c+1)); |
5685 |
< |
new SearchEntriesTask<K,V,U>(map, this, b >>>= 1, |
5686 |
< |
searchFunction, result).fork(); |
5687 |
< |
} |
5675 |
> |
public final U getRawResult() { return result.get(); } |
5676 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5677 |
> |
final Fun<Entry<K,V>, ? extends U> searchFunction; |
5678 |
> |
final AtomicReference<U> result; |
5679 |
> |
if ((searchFunction = this.searchFunction) == null || |
5680 |
> |
(result = this.result) == null) |
5681 |
> |
throw new NullPointerException(); |
5682 |
> |
for (int b;;) { |
5683 |
> |
if (result.get() != null) |
5684 |
> |
return; |
5685 |
> |
if ((b = preSplit()) <= 0) |
5686 |
> |
break; |
5687 |
> |
new SearchEntriesTask<K,V,U> |
5688 |
> |
(map, this, b, searchFunction, result).fork(); |
5689 |
> |
} |
5690 |
> |
while (result.get() == null) { |
5691 |
|
Object v; U u; |
5692 |
< |
while (result.get() == null && (v = advance()) != null) { |
5693 |
< |
if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) { |
5694 |
< |
if (result.compareAndSet(null, u)) |
5695 |
< |
tryCompleteComputation(null); |
5696 |
< |
break; |
5697 |
< |
} |
5692 |
> |
if ((v = advance()) == null) { |
5693 |
> |
propagateCompletion(); |
5694 |
> |
break; |
5695 |
> |
} |
5696 |
> |
if ((u = searchFunction.apply(entryFor((K)nextKey, (V)v))) != null) { |
5697 |
> |
if (result.compareAndSet(null, u)) |
5698 |
> |
quietlyCompleteRoot(); |
5699 |
> |
return; |
5700 |
|
} |
5355 |
– |
tryComplete(); |
5356 |
– |
} catch (Throwable ex) { |
5357 |
– |
return tryCompleteComputation(ex); |
5701 |
|
} |
5359 |
– |
return false; |
5702 |
|
} |
5361 |
– |
public final U getRawResult() { return result.get(); } |
5703 |
|
} |
5704 |
|
|
5705 |
|
@SuppressWarnings("serial") static final class SearchMappingsTask<K,V,U> |
5706 |
< |
extends BulkTask<K,V,U> { |
5706 |
> |
extends Traverser<K,V,U> { |
5707 |
|
final BiFun<? super K, ? super V, ? extends U> searchFunction; |
5708 |
|
final AtomicReference<U> result; |
5709 |
|
SearchMappingsTask |
5710 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5710 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5711 |
|
BiFun<? super K, ? super V, ? extends U> searchFunction, |
5712 |
|
AtomicReference<U> result) { |
5713 |
|
super(m, p, b); |
5714 |
|
this.searchFunction = searchFunction; this.result = result; |
5715 |
|
} |
5716 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5717 |
< |
AtomicReference<U> result = this.result; |
5718 |
< |
final BiFun<? super K, ? super V, ? extends U> searchFunction = |
5719 |
< |
this.searchFunction; |
5720 |
< |
if (searchFunction == null || result == null) |
5721 |
< |
return abortOnNullFunction(); |
5722 |
< |
try { |
5723 |
< |
int b = batch(), c; |
5724 |
< |
while (b > 1 && baseIndex != baseLimit && result.get() == null) { |
5725 |
< |
do {} while (!casPending(c = pending, c+1)); |
5726 |
< |
new SearchMappingsTask<K,V,U>(map, this, b >>>= 1, |
5727 |
< |
searchFunction, result).fork(); |
5728 |
< |
} |
5716 |
> |
public final U getRawResult() { return result.get(); } |
5717 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5718 |
> |
final BiFun<? super K, ? super V, ? extends U> searchFunction; |
5719 |
> |
final AtomicReference<U> result; |
5720 |
> |
if ((searchFunction = this.searchFunction) == null || |
5721 |
> |
(result = this.result) == null) |
5722 |
> |
throw new NullPointerException(); |
5723 |
> |
for (int b;;) { |
5724 |
> |
if (result.get() != null) |
5725 |
> |
return; |
5726 |
> |
if ((b = preSplit()) <= 0) |
5727 |
> |
break; |
5728 |
> |
new SearchMappingsTask<K,V,U> |
5729 |
> |
(map, this, b, searchFunction, result).fork(); |
5730 |
> |
} |
5731 |
> |
while (result.get() == null) { |
5732 |
|
Object v; U u; |
5733 |
< |
while (result.get() == null && (v = advance()) != null) { |
5734 |
< |
if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) { |
5735 |
< |
if (result.compareAndSet(null, u)) |
5736 |
< |
tryCompleteComputation(null); |
5737 |
< |
break; |
5738 |
< |
} |
5733 |
> |
if ((v = advance()) == null) { |
5734 |
> |
propagateCompletion(); |
5735 |
> |
break; |
5736 |
> |
} |
5737 |
> |
if ((u = searchFunction.apply((K)nextKey, (V)v)) != null) { |
5738 |
> |
if (result.compareAndSet(null, u)) |
5739 |
> |
quietlyCompleteRoot(); |
5740 |
> |
break; |
5741 |
|
} |
5396 |
– |
tryComplete(); |
5397 |
– |
} catch (Throwable ex) { |
5398 |
– |
return tryCompleteComputation(ex); |
5742 |
|
} |
5400 |
– |
return false; |
5743 |
|
} |
5402 |
– |
public final U getRawResult() { return result.get(); } |
5744 |
|
} |
5745 |
|
|
5746 |
|
@SuppressWarnings("serial") static final class ReduceKeysTask<K,V> |
5747 |
< |
extends BulkTask<K,V,K> { |
5747 |
> |
extends Traverser<K,V,K> { |
5748 |
|
final BiFun<? super K, ? super K, ? extends K> reducer; |
5749 |
|
K result; |
5750 |
|
ReduceKeysTask<K,V> rights, nextRight; |
5751 |
|
ReduceKeysTask |
5752 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5752 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5753 |
|
ReduceKeysTask<K,V> nextRight, |
5754 |
|
BiFun<? super K, ? super K, ? extends K> reducer) { |
5755 |
|
super(m, p, b); this.nextRight = nextRight; |
5756 |
|
this.reducer = reducer; |
5757 |
|
} |
5758 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5758 |
> |
public final K getRawResult() { return result; } |
5759 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5760 |
|
final BiFun<? super K, ? super K, ? extends K> reducer = |
5761 |
|
this.reducer; |
5762 |
|
if (reducer == null) |
5763 |
< |
return abortOnNullFunction(); |
5764 |
< |
try { |
5765 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
5766 |
< |
do {} while (!casPending(c = pending, c+1)); |
5767 |
< |
(rights = new ReduceKeysTask<K,V> |
5768 |
< |
(map, this, b >>>= 1, rights, reducer)).fork(); |
5769 |
< |
} |
5770 |
< |
K r = null; |
5771 |
< |
while (advance() != null) { |
5772 |
< |
K u = (K)nextKey; |
5773 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
5774 |
< |
} |
5775 |
< |
result = r; |
5776 |
< |
for (ReduceKeysTask<K,V> t = this, s;;) { |
5777 |
< |
int c; BulkTask<K,V,?> par; K tr, sr; |
5778 |
< |
if ((c = t.pending) == 0) { |
5779 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5780 |
< |
if ((sr = s.result) != null) |
5781 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
5782 |
< |
} |
5783 |
< |
if ((par = t.parent) == null || |
5442 |
< |
!(par instanceof ReduceKeysTask)) { |
5443 |
< |
t.quietlyComplete(); |
5444 |
< |
break; |
5445 |
< |
} |
5446 |
< |
t = (ReduceKeysTask<K,V>)par; |
5447 |
< |
} |
5448 |
< |
else if (t.casPending(c, c - 1)) |
5449 |
< |
break; |
5763 |
> |
throw new NullPointerException(); |
5764 |
> |
for (int b; (b = preSplit()) > 0;) |
5765 |
> |
(rights = new ReduceKeysTask<K,V> |
5766 |
> |
(map, this, b, rights, reducer)).fork(); |
5767 |
> |
K r = null; |
5768 |
> |
while (advance() != null) { |
5769 |
> |
K u = (K)nextKey; |
5770 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
5771 |
> |
} |
5772 |
> |
result = r; |
5773 |
> |
CountedCompleter<?> c; |
5774 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
5775 |
> |
ReduceKeysTask<K,V> |
5776 |
> |
t = (ReduceKeysTask<K,V>)c, |
5777 |
> |
s = t.rights; |
5778 |
> |
while (s != null) { |
5779 |
> |
K tr, sr; |
5780 |
> |
if ((sr = s.result) != null) |
5781 |
> |
t.result = (((tr = t.result) == null) ? sr : |
5782 |
> |
reducer.apply(tr, sr)); |
5783 |
> |
s = t.rights = s.nextRight; |
5784 |
|
} |
5451 |
– |
} catch (Throwable ex) { |
5452 |
– |
return tryCompleteComputation(ex); |
5785 |
|
} |
5454 |
– |
return false; |
5786 |
|
} |
5456 |
– |
public final K getRawResult() { return result; } |
5787 |
|
} |
5788 |
|
|
5789 |
|
@SuppressWarnings("serial") static final class ReduceValuesTask<K,V> |
5790 |
< |
extends BulkTask<K,V,V> { |
5790 |
> |
extends Traverser<K,V,V> { |
5791 |
|
final BiFun<? super V, ? super V, ? extends V> reducer; |
5792 |
|
V result; |
5793 |
|
ReduceValuesTask<K,V> rights, nextRight; |
5794 |
|
ReduceValuesTask |
5795 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5795 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5796 |
|
ReduceValuesTask<K,V> nextRight, |
5797 |
|
BiFun<? super V, ? super V, ? extends V> reducer) { |
5798 |
|
super(m, p, b); this.nextRight = nextRight; |
5799 |
|
this.reducer = reducer; |
5800 |
|
} |
5801 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5801 |
> |
public final V getRawResult() { return result; } |
5802 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5803 |
|
final BiFun<? super V, ? super V, ? extends V> reducer = |
5804 |
|
this.reducer; |
5805 |
|
if (reducer == null) |
5806 |
< |
return abortOnNullFunction(); |
5807 |
< |
try { |
5808 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
5809 |
< |
do {} while (!casPending(c = pending, c+1)); |
5810 |
< |
(rights = new ReduceValuesTask<K,V> |
5811 |
< |
(map, this, b >>>= 1, rights, reducer)).fork(); |
5812 |
< |
} |
5813 |
< |
V r = null; |
5814 |
< |
Object v; |
5815 |
< |
while ((v = advance()) != null) { |
5816 |
< |
V u = (V)v; |
5817 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
5818 |
< |
} |
5819 |
< |
result = r; |
5820 |
< |
for (ReduceValuesTask<K,V> t = this, s;;) { |
5821 |
< |
int c; BulkTask<K,V,?> par; V tr, sr; |
5822 |
< |
if ((c = t.pending) == 0) { |
5823 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5824 |
< |
if ((sr = s.result) != null) |
5825 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
5826 |
< |
} |
5827 |
< |
if ((par = t.parent) == null || |
5497 |
< |
!(par instanceof ReduceValuesTask)) { |
5498 |
< |
t.quietlyComplete(); |
5499 |
< |
break; |
5500 |
< |
} |
5501 |
< |
t = (ReduceValuesTask<K,V>)par; |
5502 |
< |
} |
5503 |
< |
else if (t.casPending(c, c - 1)) |
5504 |
< |
break; |
5806 |
> |
throw new NullPointerException(); |
5807 |
> |
for (int b; (b = preSplit()) > 0;) |
5808 |
> |
(rights = new ReduceValuesTask<K,V> |
5809 |
> |
(map, this, b, rights, reducer)).fork(); |
5810 |
> |
V r = null; |
5811 |
> |
Object v; |
5812 |
> |
while ((v = advance()) != null) { |
5813 |
> |
V u = (V)v; |
5814 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
5815 |
> |
} |
5816 |
> |
result = r; |
5817 |
> |
CountedCompleter<?> c; |
5818 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
5819 |
> |
ReduceValuesTask<K,V> |
5820 |
> |
t = (ReduceValuesTask<K,V>)c, |
5821 |
> |
s = t.rights; |
5822 |
> |
while (s != null) { |
5823 |
> |
V tr, sr; |
5824 |
> |
if ((sr = s.result) != null) |
5825 |
> |
t.result = (((tr = t.result) == null) ? sr : |
5826 |
> |
reducer.apply(tr, sr)); |
5827 |
> |
s = t.rights = s.nextRight; |
5828 |
|
} |
5506 |
– |
} catch (Throwable ex) { |
5507 |
– |
return tryCompleteComputation(ex); |
5829 |
|
} |
5509 |
– |
return false; |
5830 |
|
} |
5511 |
– |
public final V getRawResult() { return result; } |
5831 |
|
} |
5832 |
|
|
5833 |
|
@SuppressWarnings("serial") static final class ReduceEntriesTask<K,V> |
5834 |
< |
extends BulkTask<K,V,Map.Entry<K,V>> { |
5834 |
> |
extends Traverser<K,V,Map.Entry<K,V>> { |
5835 |
|
final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer; |
5836 |
|
Map.Entry<K,V> result; |
5837 |
|
ReduceEntriesTask<K,V> rights, nextRight; |
5838 |
|
ReduceEntriesTask |
5839 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5839 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5840 |
|
ReduceEntriesTask<K,V> nextRight, |
5841 |
|
BiFun<Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer) { |
5842 |
|
super(m, p, b); this.nextRight = nextRight; |
5843 |
|
this.reducer = reducer; |
5844 |
|
} |
5845 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5845 |
> |
public final Map.Entry<K,V> getRawResult() { return result; } |
5846 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5847 |
|
final BiFun<Map.Entry<K,V>, Map.Entry<K,V>, ? extends Map.Entry<K,V>> reducer = |
5848 |
|
this.reducer; |
5849 |
|
if (reducer == null) |
5850 |
< |
return abortOnNullFunction(); |
5851 |
< |
try { |
5852 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
5853 |
< |
do {} while (!casPending(c = pending, c+1)); |
5854 |
< |
(rights = new ReduceEntriesTask<K,V> |
5855 |
< |
(map, this, b >>>= 1, rights, reducer)).fork(); |
5856 |
< |
} |
5857 |
< |
Map.Entry<K,V> r = null; |
5858 |
< |
Object v; |
5859 |
< |
while ((v = advance()) != null) { |
5860 |
< |
Map.Entry<K,V> u = entryFor((K)nextKey, (V)v); |
5861 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
5862 |
< |
} |
5863 |
< |
result = r; |
5864 |
< |
for (ReduceEntriesTask<K,V> t = this, s;;) { |
5865 |
< |
int c; BulkTask<K,V,?> par; Map.Entry<K,V> tr, sr; |
5866 |
< |
if ((c = t.pending) == 0) { |
5867 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5868 |
< |
if ((sr = s.result) != null) |
5869 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
5870 |
< |
} |
5871 |
< |
if ((par = t.parent) == null || |
5552 |
< |
!(par instanceof ReduceEntriesTask)) { |
5553 |
< |
t.quietlyComplete(); |
5554 |
< |
break; |
5555 |
< |
} |
5556 |
< |
t = (ReduceEntriesTask<K,V>)par; |
5557 |
< |
} |
5558 |
< |
else if (t.casPending(c, c - 1)) |
5559 |
< |
break; |
5850 |
> |
throw new NullPointerException(); |
5851 |
> |
for (int b; (b = preSplit()) > 0;) |
5852 |
> |
(rights = new ReduceEntriesTask<K,V> |
5853 |
> |
(map, this, b, rights, reducer)).fork(); |
5854 |
> |
Map.Entry<K,V> r = null; |
5855 |
> |
Object v; |
5856 |
> |
while ((v = advance()) != null) { |
5857 |
> |
Map.Entry<K,V> u = entryFor((K)nextKey, (V)v); |
5858 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
5859 |
> |
} |
5860 |
> |
result = r; |
5861 |
> |
CountedCompleter<?> c; |
5862 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
5863 |
> |
ReduceEntriesTask<K,V> |
5864 |
> |
t = (ReduceEntriesTask<K,V>)c, |
5865 |
> |
s = t.rights; |
5866 |
> |
while (s != null) { |
5867 |
> |
Map.Entry<K,V> tr, sr; |
5868 |
> |
if ((sr = s.result) != null) |
5869 |
> |
t.result = (((tr = t.result) == null) ? sr : |
5870 |
> |
reducer.apply(tr, sr)); |
5871 |
> |
s = t.rights = s.nextRight; |
5872 |
|
} |
5561 |
– |
} catch (Throwable ex) { |
5562 |
– |
return tryCompleteComputation(ex); |
5873 |
|
} |
5564 |
– |
return false; |
5874 |
|
} |
5566 |
– |
public final Map.Entry<K,V> getRawResult() { return result; } |
5875 |
|
} |
5876 |
|
|
5877 |
|
@SuppressWarnings("serial") static final class MapReduceKeysTask<K,V,U> |
5878 |
< |
extends BulkTask<K,V,U> { |
5878 |
> |
extends Traverser<K,V,U> { |
5879 |
|
final Fun<? super K, ? extends U> transformer; |
5880 |
|
final BiFun<? super U, ? super U, ? extends U> reducer; |
5881 |
|
U result; |
5882 |
|
MapReduceKeysTask<K,V,U> rights, nextRight; |
5883 |
|
MapReduceKeysTask |
5884 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5884 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5885 |
|
MapReduceKeysTask<K,V,U> nextRight, |
5886 |
|
Fun<? super K, ? extends U> transformer, |
5887 |
|
BiFun<? super U, ? super U, ? extends U> reducer) { |
5889 |
|
this.transformer = transformer; |
5890 |
|
this.reducer = reducer; |
5891 |
|
} |
5892 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5892 |
> |
public final U getRawResult() { return result; } |
5893 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5894 |
|
final Fun<? super K, ? extends U> transformer = |
5895 |
|
this.transformer; |
5896 |
|
final BiFun<? super U, ? super U, ? extends U> reducer = |
5897 |
|
this.reducer; |
5898 |
|
if (transformer == null || reducer == null) |
5899 |
< |
return abortOnNullFunction(); |
5900 |
< |
try { |
5901 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
5902 |
< |
do {} while (!casPending(c = pending, c+1)); |
5903 |
< |
(rights = new MapReduceKeysTask<K,V,U> |
5904 |
< |
(map, this, b >>>= 1, rights, transformer, reducer)).fork(); |
5905 |
< |
} |
5906 |
< |
U r = null, u; |
5907 |
< |
while (advance() != null) { |
5908 |
< |
if ((u = transformer.apply((K)nextKey)) != null) |
5909 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
5910 |
< |
} |
5911 |
< |
result = r; |
5912 |
< |
for (MapReduceKeysTask<K,V,U> t = this, s;;) { |
5913 |
< |
int c; BulkTask<K,V,?> par; U tr, sr; |
5914 |
< |
if ((c = t.pending) == 0) { |
5915 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5916 |
< |
if ((sr = s.result) != null) |
5917 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
5918 |
< |
} |
5919 |
< |
if ((par = t.parent) == null || |
5611 |
< |
!(par instanceof MapReduceKeysTask)) { |
5612 |
< |
t.quietlyComplete(); |
5613 |
< |
break; |
5614 |
< |
} |
5615 |
< |
t = (MapReduceKeysTask<K,V,U>)par; |
5616 |
< |
} |
5617 |
< |
else if (t.casPending(c, c - 1)) |
5618 |
< |
break; |
5899 |
> |
throw new NullPointerException(); |
5900 |
> |
for (int b; (b = preSplit()) > 0;) |
5901 |
> |
(rights = new MapReduceKeysTask<K,V,U> |
5902 |
> |
(map, this, b, rights, transformer, reducer)).fork(); |
5903 |
> |
U r = null, u; |
5904 |
> |
while (advance() != null) { |
5905 |
> |
if ((u = transformer.apply((K)nextKey)) != null) |
5906 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
5907 |
> |
} |
5908 |
> |
result = r; |
5909 |
> |
CountedCompleter<?> c; |
5910 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
5911 |
> |
MapReduceKeysTask<K,V,U> |
5912 |
> |
t = (MapReduceKeysTask<K,V,U>)c, |
5913 |
> |
s = t.rights; |
5914 |
> |
while (s != null) { |
5915 |
> |
U tr, sr; |
5916 |
> |
if ((sr = s.result) != null) |
5917 |
> |
t.result = (((tr = t.result) == null) ? sr : |
5918 |
> |
reducer.apply(tr, sr)); |
5919 |
> |
s = t.rights = s.nextRight; |
5920 |
|
} |
5620 |
– |
} catch (Throwable ex) { |
5621 |
– |
return tryCompleteComputation(ex); |
5921 |
|
} |
5623 |
– |
return false; |
5922 |
|
} |
5625 |
– |
public final U getRawResult() { return result; } |
5923 |
|
} |
5924 |
|
|
5925 |
|
@SuppressWarnings("serial") static final class MapReduceValuesTask<K,V,U> |
5926 |
< |
extends BulkTask<K,V,U> { |
5926 |
> |
extends Traverser<K,V,U> { |
5927 |
|
final Fun<? super V, ? extends U> transformer; |
5928 |
|
final BiFun<? super U, ? super U, ? extends U> reducer; |
5929 |
|
U result; |
5930 |
|
MapReduceValuesTask<K,V,U> rights, nextRight; |
5931 |
|
MapReduceValuesTask |
5932 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5932 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5933 |
|
MapReduceValuesTask<K,V,U> nextRight, |
5934 |
|
Fun<? super V, ? extends U> transformer, |
5935 |
|
BiFun<? super U, ? super U, ? extends U> reducer) { |
5937 |
|
this.transformer = transformer; |
5938 |
|
this.reducer = reducer; |
5939 |
|
} |
5940 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5940 |
> |
public final U getRawResult() { return result; } |
5941 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5942 |
|
final Fun<? super V, ? extends U> transformer = |
5943 |
|
this.transformer; |
5944 |
|
final BiFun<? super U, ? super U, ? extends U> reducer = |
5945 |
|
this.reducer; |
5946 |
|
if (transformer == null || reducer == null) |
5947 |
< |
return abortOnNullFunction(); |
5948 |
< |
try { |
5949 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
5950 |
< |
do {} while (!casPending(c = pending, c+1)); |
5951 |
< |
(rights = new MapReduceValuesTask<K,V,U> |
5952 |
< |
(map, this, b >>>= 1, rights, transformer, reducer)).fork(); |
5953 |
< |
} |
5954 |
< |
U r = null, u; |
5955 |
< |
Object v; |
5956 |
< |
while ((v = advance()) != null) { |
5957 |
< |
if ((u = transformer.apply((V)v)) != null) |
5958 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
5959 |
< |
} |
5960 |
< |
result = r; |
5961 |
< |
for (MapReduceValuesTask<K,V,U> t = this, s;;) { |
5962 |
< |
int c; BulkTask<K,V,?> par; U tr, sr; |
5963 |
< |
if ((c = t.pending) == 0) { |
5964 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5965 |
< |
if ((sr = s.result) != null) |
5966 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
5967 |
< |
} |
5968 |
< |
if ((par = t.parent) == null || |
5671 |
< |
!(par instanceof MapReduceValuesTask)) { |
5672 |
< |
t.quietlyComplete(); |
5673 |
< |
break; |
5674 |
< |
} |
5675 |
< |
t = (MapReduceValuesTask<K,V,U>)par; |
5676 |
< |
} |
5677 |
< |
else if (t.casPending(c, c - 1)) |
5678 |
< |
break; |
5947 |
> |
throw new NullPointerException(); |
5948 |
> |
for (int b; (b = preSplit()) > 0;) |
5949 |
> |
(rights = new MapReduceValuesTask<K,V,U> |
5950 |
> |
(map, this, b, rights, transformer, reducer)).fork(); |
5951 |
> |
U r = null, u; |
5952 |
> |
Object v; |
5953 |
> |
while ((v = advance()) != null) { |
5954 |
> |
if ((u = transformer.apply((V)v)) != null) |
5955 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
5956 |
> |
} |
5957 |
> |
result = r; |
5958 |
> |
CountedCompleter<?> c; |
5959 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
5960 |
> |
MapReduceValuesTask<K,V,U> |
5961 |
> |
t = (MapReduceValuesTask<K,V,U>)c, |
5962 |
> |
s = t.rights; |
5963 |
> |
while (s != null) { |
5964 |
> |
U tr, sr; |
5965 |
> |
if ((sr = s.result) != null) |
5966 |
> |
t.result = (((tr = t.result) == null) ? sr : |
5967 |
> |
reducer.apply(tr, sr)); |
5968 |
> |
s = t.rights = s.nextRight; |
5969 |
|
} |
5680 |
– |
} catch (Throwable ex) { |
5681 |
– |
return tryCompleteComputation(ex); |
5970 |
|
} |
5683 |
– |
return false; |
5971 |
|
} |
5685 |
– |
public final U getRawResult() { return result; } |
5972 |
|
} |
5973 |
|
|
5974 |
|
@SuppressWarnings("serial") static final class MapReduceEntriesTask<K,V,U> |
5975 |
< |
extends BulkTask<K,V,U> { |
5975 |
> |
extends Traverser<K,V,U> { |
5976 |
|
final Fun<Map.Entry<K,V>, ? extends U> transformer; |
5977 |
|
final BiFun<? super U, ? super U, ? extends U> reducer; |
5978 |
|
U result; |
5979 |
|
MapReduceEntriesTask<K,V,U> rights, nextRight; |
5980 |
|
MapReduceEntriesTask |
5981 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
5981 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
5982 |
|
MapReduceEntriesTask<K,V,U> nextRight, |
5983 |
|
Fun<Map.Entry<K,V>, ? extends U> transformer, |
5984 |
|
BiFun<? super U, ? super U, ? extends U> reducer) { |
5986 |
|
this.transformer = transformer; |
5987 |
|
this.reducer = reducer; |
5988 |
|
} |
5989 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
5989 |
> |
public final U getRawResult() { return result; } |
5990 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
5991 |
|
final Fun<Map.Entry<K,V>, ? extends U> transformer = |
5992 |
|
this.transformer; |
5993 |
|
final BiFun<? super U, ? super U, ? extends U> reducer = |
5994 |
|
this.reducer; |
5995 |
|
if (transformer == null || reducer == null) |
5996 |
< |
return abortOnNullFunction(); |
5997 |
< |
try { |
5998 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
5999 |
< |
do {} while (!casPending(c = pending, c+1)); |
6000 |
< |
(rights = new MapReduceEntriesTask<K,V,U> |
6001 |
< |
(map, this, b >>>= 1, rights, transformer, reducer)).fork(); |
6002 |
< |
} |
6003 |
< |
U r = null, u; |
6004 |
< |
Object v; |
6005 |
< |
while ((v = advance()) != null) { |
6006 |
< |
if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) |
6007 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
6008 |
< |
} |
6009 |
< |
result = r; |
6010 |
< |
for (MapReduceEntriesTask<K,V,U> t = this, s;;) { |
6011 |
< |
int c; BulkTask<K,V,?> par; U tr, sr; |
6012 |
< |
if ((c = t.pending) == 0) { |
6013 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6014 |
< |
if ((sr = s.result) != null) |
6015 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
6016 |
< |
} |
6017 |
< |
if ((par = t.parent) == null || |
5731 |
< |
!(par instanceof MapReduceEntriesTask)) { |
5732 |
< |
t.quietlyComplete(); |
5733 |
< |
break; |
5734 |
< |
} |
5735 |
< |
t = (MapReduceEntriesTask<K,V,U>)par; |
5736 |
< |
} |
5737 |
< |
else if (t.casPending(c, c - 1)) |
5738 |
< |
break; |
5996 |
> |
throw new NullPointerException(); |
5997 |
> |
for (int b; (b = preSplit()) > 0;) |
5998 |
> |
(rights = new MapReduceEntriesTask<K,V,U> |
5999 |
> |
(map, this, b, rights, transformer, reducer)).fork(); |
6000 |
> |
U r = null, u; |
6001 |
> |
Object v; |
6002 |
> |
while ((v = advance()) != null) { |
6003 |
> |
if ((u = transformer.apply(entryFor((K)nextKey, (V)v))) != null) |
6004 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
6005 |
> |
} |
6006 |
> |
result = r; |
6007 |
> |
CountedCompleter<?> c; |
6008 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6009 |
> |
MapReduceEntriesTask<K,V,U> |
6010 |
> |
t = (MapReduceEntriesTask<K,V,U>)c, |
6011 |
> |
s = t.rights; |
6012 |
> |
while (s != null) { |
6013 |
> |
U tr, sr; |
6014 |
> |
if ((sr = s.result) != null) |
6015 |
> |
t.result = (((tr = t.result) == null) ? sr : |
6016 |
> |
reducer.apply(tr, sr)); |
6017 |
> |
s = t.rights = s.nextRight; |
6018 |
|
} |
5740 |
– |
} catch (Throwable ex) { |
5741 |
– |
return tryCompleteComputation(ex); |
6019 |
|
} |
5743 |
– |
return false; |
6020 |
|
} |
5745 |
– |
public final U getRawResult() { return result; } |
6021 |
|
} |
6022 |
|
|
6023 |
|
@SuppressWarnings("serial") static final class MapReduceMappingsTask<K,V,U> |
6024 |
< |
extends BulkTask<K,V,U> { |
6024 |
> |
extends Traverser<K,V,U> { |
6025 |
|
final BiFun<? super K, ? super V, ? extends U> transformer; |
6026 |
|
final BiFun<? super U, ? super U, ? extends U> reducer; |
6027 |
|
U result; |
6028 |
|
MapReduceMappingsTask<K,V,U> rights, nextRight; |
6029 |
|
MapReduceMappingsTask |
6030 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6030 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6031 |
|
MapReduceMappingsTask<K,V,U> nextRight, |
6032 |
|
BiFun<? super K, ? super V, ? extends U> transformer, |
6033 |
|
BiFun<? super U, ? super U, ? extends U> reducer) { |
6035 |
|
this.transformer = transformer; |
6036 |
|
this.reducer = reducer; |
6037 |
|
} |
6038 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6038 |
> |
public final U getRawResult() { return result; } |
6039 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6040 |
|
final BiFun<? super K, ? super V, ? extends U> transformer = |
6041 |
|
this.transformer; |
6042 |
|
final BiFun<? super U, ? super U, ? extends U> reducer = |
6043 |
|
this.reducer; |
6044 |
|
if (transformer == null || reducer == null) |
6045 |
< |
return abortOnNullFunction(); |
6046 |
< |
try { |
6047 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6048 |
< |
do {} while (!casPending(c = pending, c+1)); |
6049 |
< |
(rights = new MapReduceMappingsTask<K,V,U> |
6050 |
< |
(map, this, b >>>= 1, rights, transformer, reducer)).fork(); |
6051 |
< |
} |
6052 |
< |
U r = null, u; |
6053 |
< |
Object v; |
6054 |
< |
while ((v = advance()) != null) { |
6055 |
< |
if ((u = transformer.apply((K)nextKey, (V)v)) != null) |
6056 |
< |
r = (r == null) ? u : reducer.apply(r, u); |
6057 |
< |
} |
6058 |
< |
result = r; |
6059 |
< |
for (MapReduceMappingsTask<K,V,U> t = this, s;;) { |
6060 |
< |
int c; BulkTask<K,V,?> par; U tr, sr; |
6061 |
< |
if ((c = t.pending) == 0) { |
6062 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6063 |
< |
if ((sr = s.result) != null) |
6064 |
< |
t.result = ((tr = t.result) == null) ? sr : reducer.apply(tr, sr); |
6065 |
< |
} |
6066 |
< |
if ((par = t.parent) == null || |
5791 |
< |
!(par instanceof MapReduceMappingsTask)) { |
5792 |
< |
t.quietlyComplete(); |
5793 |
< |
break; |
5794 |
< |
} |
5795 |
< |
t = (MapReduceMappingsTask<K,V,U>)par; |
5796 |
< |
} |
5797 |
< |
else if (t.casPending(c, c - 1)) |
5798 |
< |
break; |
6045 |
> |
throw new NullPointerException(); |
6046 |
> |
for (int b; (b = preSplit()) > 0;) |
6047 |
> |
(rights = new MapReduceMappingsTask<K,V,U> |
6048 |
> |
(map, this, b, rights, transformer, reducer)).fork(); |
6049 |
> |
U r = null, u; |
6050 |
> |
Object v; |
6051 |
> |
while ((v = advance()) != null) { |
6052 |
> |
if ((u = transformer.apply((K)nextKey, (V)v)) != null) |
6053 |
> |
r = (r == null) ? u : reducer.apply(r, u); |
6054 |
> |
} |
6055 |
> |
result = r; |
6056 |
> |
CountedCompleter<?> c; |
6057 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6058 |
> |
MapReduceMappingsTask<K,V,U> |
6059 |
> |
t = (MapReduceMappingsTask<K,V,U>)c, |
6060 |
> |
s = t.rights; |
6061 |
> |
while (s != null) { |
6062 |
> |
U tr, sr; |
6063 |
> |
if ((sr = s.result) != null) |
6064 |
> |
t.result = (((tr = t.result) == null) ? sr : |
6065 |
> |
reducer.apply(tr, sr)); |
6066 |
> |
s = t.rights = s.nextRight; |
6067 |
|
} |
5800 |
– |
} catch (Throwable ex) { |
5801 |
– |
return tryCompleteComputation(ex); |
6068 |
|
} |
5803 |
– |
return false; |
6069 |
|
} |
5805 |
– |
public final U getRawResult() { return result; } |
6070 |
|
} |
6071 |
|
|
6072 |
|
@SuppressWarnings("serial") static final class MapReduceKeysToDoubleTask<K,V> |
6073 |
< |
extends BulkTask<K,V,Double> { |
6073 |
> |
extends Traverser<K,V,Double> { |
6074 |
|
final ObjectToDouble<? super K> transformer; |
6075 |
|
final DoubleByDoubleToDouble reducer; |
6076 |
|
final double basis; |
6077 |
|
double result; |
6078 |
|
MapReduceKeysToDoubleTask<K,V> rights, nextRight; |
6079 |
|
MapReduceKeysToDoubleTask |
6080 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6080 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6081 |
|
MapReduceKeysToDoubleTask<K,V> nextRight, |
6082 |
|
ObjectToDouble<? super K> transformer, |
6083 |
|
double basis, |
6086 |
|
this.transformer = transformer; |
6087 |
|
this.basis = basis; this.reducer = reducer; |
6088 |
|
} |
6089 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6089 |
> |
public final Double getRawResult() { return result; } |
6090 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6091 |
|
final ObjectToDouble<? super K> transformer = |
6092 |
|
this.transformer; |
6093 |
|
final DoubleByDoubleToDouble reducer = this.reducer; |
6094 |
|
if (transformer == null || reducer == null) |
6095 |
< |
return abortOnNullFunction(); |
6096 |
< |
try { |
6097 |
< |
final double id = this.basis; |
6098 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6099 |
< |
do {} while (!casPending(c = pending, c+1)); |
6100 |
< |
(rights = new MapReduceKeysToDoubleTask<K,V> |
6101 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6102 |
< |
} |
6103 |
< |
double r = id; |
6104 |
< |
while (advance() != null) |
6105 |
< |
r = reducer.apply(r, transformer.apply((K)nextKey)); |
6106 |
< |
result = r; |
6107 |
< |
for (MapReduceKeysToDoubleTask<K,V> t = this, s;;) { |
6108 |
< |
int c; BulkTask<K,V,?> par; |
6109 |
< |
if ((c = t.pending) == 0) { |
6110 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5846 |
< |
t.result = reducer.apply(t.result, s.result); |
5847 |
< |
} |
5848 |
< |
if ((par = t.parent) == null || |
5849 |
< |
!(par instanceof MapReduceKeysToDoubleTask)) { |
5850 |
< |
t.quietlyComplete(); |
5851 |
< |
break; |
5852 |
< |
} |
5853 |
< |
t = (MapReduceKeysToDoubleTask<K,V>)par; |
5854 |
< |
} |
5855 |
< |
else if (t.casPending(c, c - 1)) |
5856 |
< |
break; |
6095 |
> |
throw new NullPointerException(); |
6096 |
> |
double r = this.basis; |
6097 |
> |
for (int b; (b = preSplit()) > 0;) |
6098 |
> |
(rights = new MapReduceKeysToDoubleTask<K,V> |
6099 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6100 |
> |
while (advance() != null) |
6101 |
> |
r = reducer.apply(r, transformer.apply((K)nextKey)); |
6102 |
> |
result = r; |
6103 |
> |
CountedCompleter<?> c; |
6104 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6105 |
> |
MapReduceKeysToDoubleTask<K,V> |
6106 |
> |
t = (MapReduceKeysToDoubleTask<K,V>)c, |
6107 |
> |
s = t.rights; |
6108 |
> |
while (s != null) { |
6109 |
> |
t.result = reducer.apply(t.result, s.result); |
6110 |
> |
s = t.rights = s.nextRight; |
6111 |
|
} |
5858 |
– |
} catch (Throwable ex) { |
5859 |
– |
return tryCompleteComputation(ex); |
6112 |
|
} |
5861 |
– |
return false; |
6113 |
|
} |
5863 |
– |
public final Double getRawResult() { return result; } |
6114 |
|
} |
6115 |
|
|
6116 |
|
@SuppressWarnings("serial") static final class MapReduceValuesToDoubleTask<K,V> |
6117 |
< |
extends BulkTask<K,V,Double> { |
6117 |
> |
extends Traverser<K,V,Double> { |
6118 |
|
final ObjectToDouble<? super V> transformer; |
6119 |
|
final DoubleByDoubleToDouble reducer; |
6120 |
|
final double basis; |
6121 |
|
double result; |
6122 |
|
MapReduceValuesToDoubleTask<K,V> rights, nextRight; |
6123 |
|
MapReduceValuesToDoubleTask |
6124 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6124 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6125 |
|
MapReduceValuesToDoubleTask<K,V> nextRight, |
6126 |
|
ObjectToDouble<? super V> transformer, |
6127 |
|
double basis, |
6130 |
|
this.transformer = transformer; |
6131 |
|
this.basis = basis; this.reducer = reducer; |
6132 |
|
} |
6133 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6133 |
> |
public final Double getRawResult() { return result; } |
6134 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6135 |
|
final ObjectToDouble<? super V> transformer = |
6136 |
|
this.transformer; |
6137 |
|
final DoubleByDoubleToDouble reducer = this.reducer; |
6138 |
|
if (transformer == null || reducer == null) |
6139 |
< |
return abortOnNullFunction(); |
6140 |
< |
try { |
6141 |
< |
final double id = this.basis; |
6142 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6143 |
< |
do {} while (!casPending(c = pending, c+1)); |
6144 |
< |
(rights = new MapReduceValuesToDoubleTask<K,V> |
6145 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6146 |
< |
} |
6147 |
< |
double r = id; |
6148 |
< |
Object v; |
6149 |
< |
while ((v = advance()) != null) |
6150 |
< |
r = reducer.apply(r, transformer.apply((V)v)); |
6151 |
< |
result = r; |
6152 |
< |
for (MapReduceValuesToDoubleTask<K,V> t = this, s;;) { |
6153 |
< |
int c; BulkTask<K,V,?> par; |
6154 |
< |
if ((c = t.pending) == 0) { |
6155 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5905 |
< |
t.result = reducer.apply(t.result, s.result); |
5906 |
< |
} |
5907 |
< |
if ((par = t.parent) == null || |
5908 |
< |
!(par instanceof MapReduceValuesToDoubleTask)) { |
5909 |
< |
t.quietlyComplete(); |
5910 |
< |
break; |
5911 |
< |
} |
5912 |
< |
t = (MapReduceValuesToDoubleTask<K,V>)par; |
5913 |
< |
} |
5914 |
< |
else if (t.casPending(c, c - 1)) |
5915 |
< |
break; |
6139 |
> |
throw new NullPointerException(); |
6140 |
> |
double r = this.basis; |
6141 |
> |
for (int b; (b = preSplit()) > 0;) |
6142 |
> |
(rights = new MapReduceValuesToDoubleTask<K,V> |
6143 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6144 |
> |
Object v; |
6145 |
> |
while ((v = advance()) != null) |
6146 |
> |
r = reducer.apply(r, transformer.apply((V)v)); |
6147 |
> |
result = r; |
6148 |
> |
CountedCompleter<?> c; |
6149 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6150 |
> |
MapReduceValuesToDoubleTask<K,V> |
6151 |
> |
t = (MapReduceValuesToDoubleTask<K,V>)c, |
6152 |
> |
s = t.rights; |
6153 |
> |
while (s != null) { |
6154 |
> |
t.result = reducer.apply(t.result, s.result); |
6155 |
> |
s = t.rights = s.nextRight; |
6156 |
|
} |
5917 |
– |
} catch (Throwable ex) { |
5918 |
– |
return tryCompleteComputation(ex); |
6157 |
|
} |
5920 |
– |
return false; |
6158 |
|
} |
5922 |
– |
public final Double getRawResult() { return result; } |
6159 |
|
} |
6160 |
|
|
6161 |
|
@SuppressWarnings("serial") static final class MapReduceEntriesToDoubleTask<K,V> |
6162 |
< |
extends BulkTask<K,V,Double> { |
6162 |
> |
extends Traverser<K,V,Double> { |
6163 |
|
final ObjectToDouble<Map.Entry<K,V>> transformer; |
6164 |
|
final DoubleByDoubleToDouble reducer; |
6165 |
|
final double basis; |
6166 |
|
double result; |
6167 |
|
MapReduceEntriesToDoubleTask<K,V> rights, nextRight; |
6168 |
|
MapReduceEntriesToDoubleTask |
6169 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6169 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6170 |
|
MapReduceEntriesToDoubleTask<K,V> nextRight, |
6171 |
|
ObjectToDouble<Map.Entry<K,V>> transformer, |
6172 |
|
double basis, |
6175 |
|
this.transformer = transformer; |
6176 |
|
this.basis = basis; this.reducer = reducer; |
6177 |
|
} |
6178 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6178 |
> |
public final Double getRawResult() { return result; } |
6179 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6180 |
|
final ObjectToDouble<Map.Entry<K,V>> transformer = |
6181 |
|
this.transformer; |
6182 |
|
final DoubleByDoubleToDouble reducer = this.reducer; |
6183 |
|
if (transformer == null || reducer == null) |
6184 |
< |
return abortOnNullFunction(); |
6185 |
< |
try { |
6186 |
< |
final double id = this.basis; |
6187 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6188 |
< |
do {} while (!casPending(c = pending, c+1)); |
6189 |
< |
(rights = new MapReduceEntriesToDoubleTask<K,V> |
6190 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6191 |
< |
} |
6192 |
< |
double r = id; |
6193 |
< |
Object v; |
6194 |
< |
while ((v = advance()) != null) |
6195 |
< |
r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); |
6196 |
< |
result = r; |
6197 |
< |
for (MapReduceEntriesToDoubleTask<K,V> t = this, s;;) { |
6198 |
< |
int c; BulkTask<K,V,?> par; |
6199 |
< |
if ((c = t.pending) == 0) { |
6200 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
5964 |
< |
t.result = reducer.apply(t.result, s.result); |
5965 |
< |
} |
5966 |
< |
if ((par = t.parent) == null || |
5967 |
< |
!(par instanceof MapReduceEntriesToDoubleTask)) { |
5968 |
< |
t.quietlyComplete(); |
5969 |
< |
break; |
5970 |
< |
} |
5971 |
< |
t = (MapReduceEntriesToDoubleTask<K,V>)par; |
5972 |
< |
} |
5973 |
< |
else if (t.casPending(c, c - 1)) |
5974 |
< |
break; |
6184 |
> |
throw new NullPointerException(); |
6185 |
> |
double r = this.basis; |
6186 |
> |
for (int b; (b = preSplit()) > 0;) |
6187 |
> |
(rights = new MapReduceEntriesToDoubleTask<K,V> |
6188 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6189 |
> |
Object v; |
6190 |
> |
while ((v = advance()) != null) |
6191 |
> |
r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); |
6192 |
> |
result = r; |
6193 |
> |
CountedCompleter<?> c; |
6194 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6195 |
> |
MapReduceEntriesToDoubleTask<K,V> |
6196 |
> |
t = (MapReduceEntriesToDoubleTask<K,V>)c, |
6197 |
> |
s = t.rights; |
6198 |
> |
while (s != null) { |
6199 |
> |
t.result = reducer.apply(t.result, s.result); |
6200 |
> |
s = t.rights = s.nextRight; |
6201 |
|
} |
5976 |
– |
} catch (Throwable ex) { |
5977 |
– |
return tryCompleteComputation(ex); |
6202 |
|
} |
5979 |
– |
return false; |
6203 |
|
} |
5981 |
– |
public final Double getRawResult() { return result; } |
6204 |
|
} |
6205 |
|
|
6206 |
|
@SuppressWarnings("serial") static final class MapReduceMappingsToDoubleTask<K,V> |
6207 |
< |
extends BulkTask<K,V,Double> { |
6207 |
> |
extends Traverser<K,V,Double> { |
6208 |
|
final ObjectByObjectToDouble<? super K, ? super V> transformer; |
6209 |
|
final DoubleByDoubleToDouble reducer; |
6210 |
|
final double basis; |
6211 |
|
double result; |
6212 |
|
MapReduceMappingsToDoubleTask<K,V> rights, nextRight; |
6213 |
|
MapReduceMappingsToDoubleTask |
6214 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6214 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6215 |
|
MapReduceMappingsToDoubleTask<K,V> nextRight, |
6216 |
|
ObjectByObjectToDouble<? super K, ? super V> transformer, |
6217 |
|
double basis, |
6220 |
|
this.transformer = transformer; |
6221 |
|
this.basis = basis; this.reducer = reducer; |
6222 |
|
} |
6223 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6223 |
> |
public final Double getRawResult() { return result; } |
6224 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6225 |
|
final ObjectByObjectToDouble<? super K, ? super V> transformer = |
6226 |
|
this.transformer; |
6227 |
|
final DoubleByDoubleToDouble reducer = this.reducer; |
6228 |
|
if (transformer == null || reducer == null) |
6229 |
< |
return abortOnNullFunction(); |
6230 |
< |
try { |
6231 |
< |
final double id = this.basis; |
6232 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6233 |
< |
do {} while (!casPending(c = pending, c+1)); |
6234 |
< |
(rights = new MapReduceMappingsToDoubleTask<K,V> |
6235 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6236 |
< |
} |
6237 |
< |
double r = id; |
6238 |
< |
Object v; |
6239 |
< |
while ((v = advance()) != null) |
6240 |
< |
r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); |
6241 |
< |
result = r; |
6242 |
< |
for (MapReduceMappingsToDoubleTask<K,V> t = this, s;;) { |
6243 |
< |
int c; BulkTask<K,V,?> par; |
6244 |
< |
if ((c = t.pending) == 0) { |
6245 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6023 |
< |
t.result = reducer.apply(t.result, s.result); |
6024 |
< |
} |
6025 |
< |
if ((par = t.parent) == null || |
6026 |
< |
!(par instanceof MapReduceMappingsToDoubleTask)) { |
6027 |
< |
t.quietlyComplete(); |
6028 |
< |
break; |
6029 |
< |
} |
6030 |
< |
t = (MapReduceMappingsToDoubleTask<K,V>)par; |
6031 |
< |
} |
6032 |
< |
else if (t.casPending(c, c - 1)) |
6033 |
< |
break; |
6229 |
> |
throw new NullPointerException(); |
6230 |
> |
double r = this.basis; |
6231 |
> |
for (int b; (b = preSplit()) > 0;) |
6232 |
> |
(rights = new MapReduceMappingsToDoubleTask<K,V> |
6233 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6234 |
> |
Object v; |
6235 |
> |
while ((v = advance()) != null) |
6236 |
> |
r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); |
6237 |
> |
result = r; |
6238 |
> |
CountedCompleter<?> c; |
6239 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6240 |
> |
MapReduceMappingsToDoubleTask<K,V> |
6241 |
> |
t = (MapReduceMappingsToDoubleTask<K,V>)c, |
6242 |
> |
s = t.rights; |
6243 |
> |
while (s != null) { |
6244 |
> |
t.result = reducer.apply(t.result, s.result); |
6245 |
> |
s = t.rights = s.nextRight; |
6246 |
|
} |
6035 |
– |
} catch (Throwable ex) { |
6036 |
– |
return tryCompleteComputation(ex); |
6247 |
|
} |
6038 |
– |
return false; |
6248 |
|
} |
6040 |
– |
public final Double getRawResult() { return result; } |
6249 |
|
} |
6250 |
|
|
6251 |
|
@SuppressWarnings("serial") static final class MapReduceKeysToLongTask<K,V> |
6252 |
< |
extends BulkTask<K,V,Long> { |
6252 |
> |
extends Traverser<K,V,Long> { |
6253 |
|
final ObjectToLong<? super K> transformer; |
6254 |
|
final LongByLongToLong reducer; |
6255 |
|
final long basis; |
6256 |
|
long result; |
6257 |
|
MapReduceKeysToLongTask<K,V> rights, nextRight; |
6258 |
|
MapReduceKeysToLongTask |
6259 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6259 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6260 |
|
MapReduceKeysToLongTask<K,V> nextRight, |
6261 |
|
ObjectToLong<? super K> transformer, |
6262 |
|
long basis, |
6265 |
|
this.transformer = transformer; |
6266 |
|
this.basis = basis; this.reducer = reducer; |
6267 |
|
} |
6268 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6268 |
> |
public final Long getRawResult() { return result; } |
6269 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6270 |
|
final ObjectToLong<? super K> transformer = |
6271 |
|
this.transformer; |
6272 |
|
final LongByLongToLong reducer = this.reducer; |
6273 |
|
if (transformer == null || reducer == null) |
6274 |
< |
return abortOnNullFunction(); |
6275 |
< |
try { |
6276 |
< |
final long id = this.basis; |
6277 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6278 |
< |
do {} while (!casPending(c = pending, c+1)); |
6279 |
< |
(rights = new MapReduceKeysToLongTask<K,V> |
6280 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6281 |
< |
} |
6282 |
< |
long r = id; |
6283 |
< |
while (advance() != null) |
6284 |
< |
r = reducer.apply(r, transformer.apply((K)nextKey)); |
6285 |
< |
result = r; |
6286 |
< |
for (MapReduceKeysToLongTask<K,V> t = this, s;;) { |
6287 |
< |
int c; BulkTask<K,V,?> par; |
6288 |
< |
if ((c = t.pending) == 0) { |
6289 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6081 |
< |
t.result = reducer.apply(t.result, s.result); |
6082 |
< |
} |
6083 |
< |
if ((par = t.parent) == null || |
6084 |
< |
!(par instanceof MapReduceKeysToLongTask)) { |
6085 |
< |
t.quietlyComplete(); |
6086 |
< |
break; |
6087 |
< |
} |
6088 |
< |
t = (MapReduceKeysToLongTask<K,V>)par; |
6089 |
< |
} |
6090 |
< |
else if (t.casPending(c, c - 1)) |
6091 |
< |
break; |
6274 |
> |
throw new NullPointerException(); |
6275 |
> |
long r = this.basis; |
6276 |
> |
for (int b; (b = preSplit()) > 0;) |
6277 |
> |
(rights = new MapReduceKeysToLongTask<K,V> |
6278 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6279 |
> |
while (advance() != null) |
6280 |
> |
r = reducer.apply(r, transformer.apply((K)nextKey)); |
6281 |
> |
result = r; |
6282 |
> |
CountedCompleter<?> c; |
6283 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6284 |
> |
MapReduceKeysToLongTask<K,V> |
6285 |
> |
t = (MapReduceKeysToLongTask<K,V>)c, |
6286 |
> |
s = t.rights; |
6287 |
> |
while (s != null) { |
6288 |
> |
t.result = reducer.apply(t.result, s.result); |
6289 |
> |
s = t.rights = s.nextRight; |
6290 |
|
} |
6093 |
– |
} catch (Throwable ex) { |
6094 |
– |
return tryCompleteComputation(ex); |
6291 |
|
} |
6096 |
– |
return false; |
6292 |
|
} |
6098 |
– |
public final Long getRawResult() { return result; } |
6293 |
|
} |
6294 |
|
|
6295 |
|
@SuppressWarnings("serial") static final class MapReduceValuesToLongTask<K,V> |
6296 |
< |
extends BulkTask<K,V,Long> { |
6296 |
> |
extends Traverser<K,V,Long> { |
6297 |
|
final ObjectToLong<? super V> transformer; |
6298 |
|
final LongByLongToLong reducer; |
6299 |
|
final long basis; |
6300 |
|
long result; |
6301 |
|
MapReduceValuesToLongTask<K,V> rights, nextRight; |
6302 |
|
MapReduceValuesToLongTask |
6303 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6303 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6304 |
|
MapReduceValuesToLongTask<K,V> nextRight, |
6305 |
|
ObjectToLong<? super V> transformer, |
6306 |
|
long basis, |
6309 |
|
this.transformer = transformer; |
6310 |
|
this.basis = basis; this.reducer = reducer; |
6311 |
|
} |
6312 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6312 |
> |
public final Long getRawResult() { return result; } |
6313 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6314 |
|
final ObjectToLong<? super V> transformer = |
6315 |
|
this.transformer; |
6316 |
|
final LongByLongToLong reducer = this.reducer; |
6317 |
|
if (transformer == null || reducer == null) |
6318 |
< |
return abortOnNullFunction(); |
6319 |
< |
try { |
6320 |
< |
final long id = this.basis; |
6321 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6322 |
< |
do {} while (!casPending(c = pending, c+1)); |
6323 |
< |
(rights = new MapReduceValuesToLongTask<K,V> |
6324 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6325 |
< |
} |
6326 |
< |
long r = id; |
6327 |
< |
Object v; |
6328 |
< |
while ((v = advance()) != null) |
6329 |
< |
r = reducer.apply(r, transformer.apply((V)v)); |
6330 |
< |
result = r; |
6331 |
< |
for (MapReduceValuesToLongTask<K,V> t = this, s;;) { |
6332 |
< |
int c; BulkTask<K,V,?> par; |
6333 |
< |
if ((c = t.pending) == 0) { |
6334 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6140 |
< |
t.result = reducer.apply(t.result, s.result); |
6141 |
< |
} |
6142 |
< |
if ((par = t.parent) == null || |
6143 |
< |
!(par instanceof MapReduceValuesToLongTask)) { |
6144 |
< |
t.quietlyComplete(); |
6145 |
< |
break; |
6146 |
< |
} |
6147 |
< |
t = (MapReduceValuesToLongTask<K,V>)par; |
6148 |
< |
} |
6149 |
< |
else if (t.casPending(c, c - 1)) |
6150 |
< |
break; |
6318 |
> |
throw new NullPointerException(); |
6319 |
> |
long r = this.basis; |
6320 |
> |
for (int b; (b = preSplit()) > 0;) |
6321 |
> |
(rights = new MapReduceValuesToLongTask<K,V> |
6322 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6323 |
> |
Object v; |
6324 |
> |
while ((v = advance()) != null) |
6325 |
> |
r = reducer.apply(r, transformer.apply((V)v)); |
6326 |
> |
result = r; |
6327 |
> |
CountedCompleter<?> c; |
6328 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6329 |
> |
MapReduceValuesToLongTask<K,V> |
6330 |
> |
t = (MapReduceValuesToLongTask<K,V>)c, |
6331 |
> |
s = t.rights; |
6332 |
> |
while (s != null) { |
6333 |
> |
t.result = reducer.apply(t.result, s.result); |
6334 |
> |
s = t.rights = s.nextRight; |
6335 |
|
} |
6152 |
– |
} catch (Throwable ex) { |
6153 |
– |
return tryCompleteComputation(ex); |
6336 |
|
} |
6155 |
– |
return false; |
6337 |
|
} |
6157 |
– |
public final Long getRawResult() { return result; } |
6338 |
|
} |
6339 |
|
|
6340 |
|
@SuppressWarnings("serial") static final class MapReduceEntriesToLongTask<K,V> |
6341 |
< |
extends BulkTask<K,V,Long> { |
6341 |
> |
extends Traverser<K,V,Long> { |
6342 |
|
final ObjectToLong<Map.Entry<K,V>> transformer; |
6343 |
|
final LongByLongToLong reducer; |
6344 |
|
final long basis; |
6345 |
|
long result; |
6346 |
|
MapReduceEntriesToLongTask<K,V> rights, nextRight; |
6347 |
|
MapReduceEntriesToLongTask |
6348 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6348 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6349 |
|
MapReduceEntriesToLongTask<K,V> nextRight, |
6350 |
|
ObjectToLong<Map.Entry<K,V>> transformer, |
6351 |
|
long basis, |
6354 |
|
this.transformer = transformer; |
6355 |
|
this.basis = basis; this.reducer = reducer; |
6356 |
|
} |
6357 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6357 |
> |
public final Long getRawResult() { return result; } |
6358 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6359 |
|
final ObjectToLong<Map.Entry<K,V>> transformer = |
6360 |
|
this.transformer; |
6361 |
|
final LongByLongToLong reducer = this.reducer; |
6362 |
|
if (transformer == null || reducer == null) |
6363 |
< |
return abortOnNullFunction(); |
6364 |
< |
try { |
6365 |
< |
final long id = this.basis; |
6366 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6367 |
< |
do {} while (!casPending(c = pending, c+1)); |
6368 |
< |
(rights = new MapReduceEntriesToLongTask<K,V> |
6369 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6370 |
< |
} |
6371 |
< |
long r = id; |
6372 |
< |
Object v; |
6373 |
< |
while ((v = advance()) != null) |
6374 |
< |
r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); |
6375 |
< |
result = r; |
6376 |
< |
for (MapReduceEntriesToLongTask<K,V> t = this, s;;) { |
6377 |
< |
int c; BulkTask<K,V,?> par; |
6378 |
< |
if ((c = t.pending) == 0) { |
6379 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6199 |
< |
t.result = reducer.apply(t.result, s.result); |
6200 |
< |
} |
6201 |
< |
if ((par = t.parent) == null || |
6202 |
< |
!(par instanceof MapReduceEntriesToLongTask)) { |
6203 |
< |
t.quietlyComplete(); |
6204 |
< |
break; |
6205 |
< |
} |
6206 |
< |
t = (MapReduceEntriesToLongTask<K,V>)par; |
6207 |
< |
} |
6208 |
< |
else if (t.casPending(c, c - 1)) |
6209 |
< |
break; |
6363 |
> |
throw new NullPointerException(); |
6364 |
> |
long r = this.basis; |
6365 |
> |
for (int b; (b = preSplit()) > 0;) |
6366 |
> |
(rights = new MapReduceEntriesToLongTask<K,V> |
6367 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6368 |
> |
Object v; |
6369 |
> |
while ((v = advance()) != null) |
6370 |
> |
r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); |
6371 |
> |
result = r; |
6372 |
> |
CountedCompleter<?> c; |
6373 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6374 |
> |
MapReduceEntriesToLongTask<K,V> |
6375 |
> |
t = (MapReduceEntriesToLongTask<K,V>)c, |
6376 |
> |
s = t.rights; |
6377 |
> |
while (s != null) { |
6378 |
> |
t.result = reducer.apply(t.result, s.result); |
6379 |
> |
s = t.rights = s.nextRight; |
6380 |
|
} |
6211 |
– |
} catch (Throwable ex) { |
6212 |
– |
return tryCompleteComputation(ex); |
6381 |
|
} |
6214 |
– |
return false; |
6382 |
|
} |
6216 |
– |
public final Long getRawResult() { return result; } |
6383 |
|
} |
6384 |
|
|
6385 |
|
@SuppressWarnings("serial") static final class MapReduceMappingsToLongTask<K,V> |
6386 |
< |
extends BulkTask<K,V,Long> { |
6386 |
> |
extends Traverser<K,V,Long> { |
6387 |
|
final ObjectByObjectToLong<? super K, ? super V> transformer; |
6388 |
|
final LongByLongToLong reducer; |
6389 |
|
final long basis; |
6390 |
|
long result; |
6391 |
|
MapReduceMappingsToLongTask<K,V> rights, nextRight; |
6392 |
|
MapReduceMappingsToLongTask |
6393 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6393 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6394 |
|
MapReduceMappingsToLongTask<K,V> nextRight, |
6395 |
|
ObjectByObjectToLong<? super K, ? super V> transformer, |
6396 |
|
long basis, |
6399 |
|
this.transformer = transformer; |
6400 |
|
this.basis = basis; this.reducer = reducer; |
6401 |
|
} |
6402 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6402 |
> |
public final Long getRawResult() { return result; } |
6403 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6404 |
|
final ObjectByObjectToLong<? super K, ? super V> transformer = |
6405 |
|
this.transformer; |
6406 |
|
final LongByLongToLong reducer = this.reducer; |
6407 |
|
if (transformer == null || reducer == null) |
6408 |
< |
return abortOnNullFunction(); |
6409 |
< |
try { |
6410 |
< |
final long id = this.basis; |
6411 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6412 |
< |
do {} while (!casPending(c = pending, c+1)); |
6413 |
< |
(rights = new MapReduceMappingsToLongTask<K,V> |
6414 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6415 |
< |
} |
6416 |
< |
long r = id; |
6417 |
< |
Object v; |
6418 |
< |
while ((v = advance()) != null) |
6419 |
< |
r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); |
6420 |
< |
result = r; |
6421 |
< |
for (MapReduceMappingsToLongTask<K,V> t = this, s;;) { |
6422 |
< |
int c; BulkTask<K,V,?> par; |
6423 |
< |
if ((c = t.pending) == 0) { |
6424 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6258 |
< |
t.result = reducer.apply(t.result, s.result); |
6259 |
< |
} |
6260 |
< |
if ((par = t.parent) == null || |
6261 |
< |
!(par instanceof MapReduceMappingsToLongTask)) { |
6262 |
< |
t.quietlyComplete(); |
6263 |
< |
break; |
6264 |
< |
} |
6265 |
< |
t = (MapReduceMappingsToLongTask<K,V>)par; |
6266 |
< |
} |
6267 |
< |
else if (t.casPending(c, c - 1)) |
6268 |
< |
break; |
6408 |
> |
throw new NullPointerException(); |
6409 |
> |
long r = this.basis; |
6410 |
> |
for (int b; (b = preSplit()) > 0;) |
6411 |
> |
(rights = new MapReduceMappingsToLongTask<K,V> |
6412 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6413 |
> |
Object v; |
6414 |
> |
while ((v = advance()) != null) |
6415 |
> |
r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); |
6416 |
> |
result = r; |
6417 |
> |
CountedCompleter<?> c; |
6418 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6419 |
> |
MapReduceMappingsToLongTask<K,V> |
6420 |
> |
t = (MapReduceMappingsToLongTask<K,V>)c, |
6421 |
> |
s = t.rights; |
6422 |
> |
while (s != null) { |
6423 |
> |
t.result = reducer.apply(t.result, s.result); |
6424 |
> |
s = t.rights = s.nextRight; |
6425 |
|
} |
6270 |
– |
} catch (Throwable ex) { |
6271 |
– |
return tryCompleteComputation(ex); |
6426 |
|
} |
6273 |
– |
return false; |
6427 |
|
} |
6275 |
– |
public final Long getRawResult() { return result; } |
6428 |
|
} |
6429 |
|
|
6430 |
|
@SuppressWarnings("serial") static final class MapReduceKeysToIntTask<K,V> |
6431 |
< |
extends BulkTask<K,V,Integer> { |
6431 |
> |
extends Traverser<K,V,Integer> { |
6432 |
|
final ObjectToInt<? super K> transformer; |
6433 |
|
final IntByIntToInt reducer; |
6434 |
|
final int basis; |
6435 |
|
int result; |
6436 |
|
MapReduceKeysToIntTask<K,V> rights, nextRight; |
6437 |
|
MapReduceKeysToIntTask |
6438 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6438 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6439 |
|
MapReduceKeysToIntTask<K,V> nextRight, |
6440 |
|
ObjectToInt<? super K> transformer, |
6441 |
|
int basis, |
6444 |
|
this.transformer = transformer; |
6445 |
|
this.basis = basis; this.reducer = reducer; |
6446 |
|
} |
6447 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6447 |
> |
public final Integer getRawResult() { return result; } |
6448 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6449 |
|
final ObjectToInt<? super K> transformer = |
6450 |
|
this.transformer; |
6451 |
|
final IntByIntToInt reducer = this.reducer; |
6452 |
|
if (transformer == null || reducer == null) |
6453 |
< |
return abortOnNullFunction(); |
6454 |
< |
try { |
6455 |
< |
final int id = this.basis; |
6456 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6457 |
< |
do {} while (!casPending(c = pending, c+1)); |
6458 |
< |
(rights = new MapReduceKeysToIntTask<K,V> |
6459 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6460 |
< |
} |
6461 |
< |
int r = id; |
6462 |
< |
while (advance() != null) |
6463 |
< |
r = reducer.apply(r, transformer.apply((K)nextKey)); |
6464 |
< |
result = r; |
6465 |
< |
for (MapReduceKeysToIntTask<K,V> t = this, s;;) { |
6466 |
< |
int c; BulkTask<K,V,?> par; |
6467 |
< |
if ((c = t.pending) == 0) { |
6468 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6316 |
< |
t.result = reducer.apply(t.result, s.result); |
6317 |
< |
} |
6318 |
< |
if ((par = t.parent) == null || |
6319 |
< |
!(par instanceof MapReduceKeysToIntTask)) { |
6320 |
< |
t.quietlyComplete(); |
6321 |
< |
break; |
6322 |
< |
} |
6323 |
< |
t = (MapReduceKeysToIntTask<K,V>)par; |
6324 |
< |
} |
6325 |
< |
else if (t.casPending(c, c - 1)) |
6326 |
< |
break; |
6453 |
> |
throw new NullPointerException(); |
6454 |
> |
int r = this.basis; |
6455 |
> |
for (int b; (b = preSplit()) > 0;) |
6456 |
> |
(rights = new MapReduceKeysToIntTask<K,V> |
6457 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6458 |
> |
while (advance() != null) |
6459 |
> |
r = reducer.apply(r, transformer.apply((K)nextKey)); |
6460 |
> |
result = r; |
6461 |
> |
CountedCompleter<?> c; |
6462 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6463 |
> |
MapReduceKeysToIntTask<K,V> |
6464 |
> |
t = (MapReduceKeysToIntTask<K,V>)c, |
6465 |
> |
s = t.rights; |
6466 |
> |
while (s != null) { |
6467 |
> |
t.result = reducer.apply(t.result, s.result); |
6468 |
> |
s = t.rights = s.nextRight; |
6469 |
|
} |
6328 |
– |
} catch (Throwable ex) { |
6329 |
– |
return tryCompleteComputation(ex); |
6470 |
|
} |
6331 |
– |
return false; |
6471 |
|
} |
6333 |
– |
public final Integer getRawResult() { return result; } |
6472 |
|
} |
6473 |
|
|
6474 |
|
@SuppressWarnings("serial") static final class MapReduceValuesToIntTask<K,V> |
6475 |
< |
extends BulkTask<K,V,Integer> { |
6475 |
> |
extends Traverser<K,V,Integer> { |
6476 |
|
final ObjectToInt<? super V> transformer; |
6477 |
|
final IntByIntToInt reducer; |
6478 |
|
final int basis; |
6479 |
|
int result; |
6480 |
|
MapReduceValuesToIntTask<K,V> rights, nextRight; |
6481 |
|
MapReduceValuesToIntTask |
6482 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6482 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6483 |
|
MapReduceValuesToIntTask<K,V> nextRight, |
6484 |
|
ObjectToInt<? super V> transformer, |
6485 |
|
int basis, |
6488 |
|
this.transformer = transformer; |
6489 |
|
this.basis = basis; this.reducer = reducer; |
6490 |
|
} |
6491 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6491 |
> |
public final Integer getRawResult() { return result; } |
6492 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6493 |
|
final ObjectToInt<? super V> transformer = |
6494 |
|
this.transformer; |
6495 |
|
final IntByIntToInt reducer = this.reducer; |
6496 |
|
if (transformer == null || reducer == null) |
6497 |
< |
return abortOnNullFunction(); |
6498 |
< |
try { |
6499 |
< |
final int id = this.basis; |
6500 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6501 |
< |
do {} while (!casPending(c = pending, c+1)); |
6502 |
< |
(rights = new MapReduceValuesToIntTask<K,V> |
6503 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6504 |
< |
} |
6505 |
< |
int r = id; |
6506 |
< |
Object v; |
6507 |
< |
while ((v = advance()) != null) |
6508 |
< |
r = reducer.apply(r, transformer.apply((V)v)); |
6509 |
< |
result = r; |
6510 |
< |
for (MapReduceValuesToIntTask<K,V> t = this, s;;) { |
6511 |
< |
int c; BulkTask<K,V,?> par; |
6512 |
< |
if ((c = t.pending) == 0) { |
6513 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6375 |
< |
t.result = reducer.apply(t.result, s.result); |
6376 |
< |
} |
6377 |
< |
if ((par = t.parent) == null || |
6378 |
< |
!(par instanceof MapReduceValuesToIntTask)) { |
6379 |
< |
t.quietlyComplete(); |
6380 |
< |
break; |
6381 |
< |
} |
6382 |
< |
t = (MapReduceValuesToIntTask<K,V>)par; |
6383 |
< |
} |
6384 |
< |
else if (t.casPending(c, c - 1)) |
6385 |
< |
break; |
6497 |
> |
throw new NullPointerException(); |
6498 |
> |
int r = this.basis; |
6499 |
> |
for (int b; (b = preSplit()) > 0;) |
6500 |
> |
(rights = new MapReduceValuesToIntTask<K,V> |
6501 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6502 |
> |
Object v; |
6503 |
> |
while ((v = advance()) != null) |
6504 |
> |
r = reducer.apply(r, transformer.apply((V)v)); |
6505 |
> |
result = r; |
6506 |
> |
CountedCompleter<?> c; |
6507 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6508 |
> |
MapReduceValuesToIntTask<K,V> |
6509 |
> |
t = (MapReduceValuesToIntTask<K,V>)c, |
6510 |
> |
s = t.rights; |
6511 |
> |
while (s != null) { |
6512 |
> |
t.result = reducer.apply(t.result, s.result); |
6513 |
> |
s = t.rights = s.nextRight; |
6514 |
|
} |
6387 |
– |
} catch (Throwable ex) { |
6388 |
– |
return tryCompleteComputation(ex); |
6515 |
|
} |
6390 |
– |
return false; |
6516 |
|
} |
6392 |
– |
public final Integer getRawResult() { return result; } |
6517 |
|
} |
6518 |
|
|
6519 |
|
@SuppressWarnings("serial") static final class MapReduceEntriesToIntTask<K,V> |
6520 |
< |
extends BulkTask<K,V,Integer> { |
6520 |
> |
extends Traverser<K,V,Integer> { |
6521 |
|
final ObjectToInt<Map.Entry<K,V>> transformer; |
6522 |
|
final IntByIntToInt reducer; |
6523 |
|
final int basis; |
6524 |
|
int result; |
6525 |
|
MapReduceEntriesToIntTask<K,V> rights, nextRight; |
6526 |
|
MapReduceEntriesToIntTask |
6527 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6527 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6528 |
|
MapReduceEntriesToIntTask<K,V> nextRight, |
6529 |
|
ObjectToInt<Map.Entry<K,V>> transformer, |
6530 |
|
int basis, |
6533 |
|
this.transformer = transformer; |
6534 |
|
this.basis = basis; this.reducer = reducer; |
6535 |
|
} |
6536 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6536 |
> |
public final Integer getRawResult() { return result; } |
6537 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6538 |
|
final ObjectToInt<Map.Entry<K,V>> transformer = |
6539 |
|
this.transformer; |
6540 |
|
final IntByIntToInt reducer = this.reducer; |
6541 |
|
if (transformer == null || reducer == null) |
6542 |
< |
return abortOnNullFunction(); |
6543 |
< |
try { |
6544 |
< |
final int id = this.basis; |
6545 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6546 |
< |
do {} while (!casPending(c = pending, c+1)); |
6547 |
< |
(rights = new MapReduceEntriesToIntTask<K,V> |
6548 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6549 |
< |
} |
6550 |
< |
int r = id; |
6551 |
< |
Object v; |
6552 |
< |
while ((v = advance()) != null) |
6553 |
< |
r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); |
6554 |
< |
result = r; |
6555 |
< |
for (MapReduceEntriesToIntTask<K,V> t = this, s;;) { |
6556 |
< |
int c; BulkTask<K,V,?> par; |
6557 |
< |
if ((c = t.pending) == 0) { |
6558 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6434 |
< |
t.result = reducer.apply(t.result, s.result); |
6435 |
< |
} |
6436 |
< |
if ((par = t.parent) == null || |
6437 |
< |
!(par instanceof MapReduceEntriesToIntTask)) { |
6438 |
< |
t.quietlyComplete(); |
6439 |
< |
break; |
6440 |
< |
} |
6441 |
< |
t = (MapReduceEntriesToIntTask<K,V>)par; |
6442 |
< |
} |
6443 |
< |
else if (t.casPending(c, c - 1)) |
6444 |
< |
break; |
6542 |
> |
throw new NullPointerException(); |
6543 |
> |
int r = this.basis; |
6544 |
> |
for (int b; (b = preSplit()) > 0;) |
6545 |
> |
(rights = new MapReduceEntriesToIntTask<K,V> |
6546 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6547 |
> |
Object v; |
6548 |
> |
while ((v = advance()) != null) |
6549 |
> |
r = reducer.apply(r, transformer.apply(entryFor((K)nextKey, (V)v))); |
6550 |
> |
result = r; |
6551 |
> |
CountedCompleter<?> c; |
6552 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6553 |
> |
MapReduceEntriesToIntTask<K,V> |
6554 |
> |
t = (MapReduceEntriesToIntTask<K,V>)c, |
6555 |
> |
s = t.rights; |
6556 |
> |
while (s != null) { |
6557 |
> |
t.result = reducer.apply(t.result, s.result); |
6558 |
> |
s = t.rights = s.nextRight; |
6559 |
|
} |
6446 |
– |
} catch (Throwable ex) { |
6447 |
– |
return tryCompleteComputation(ex); |
6560 |
|
} |
6449 |
– |
return false; |
6561 |
|
} |
6451 |
– |
public final Integer getRawResult() { return result; } |
6562 |
|
} |
6563 |
|
|
6564 |
|
@SuppressWarnings("serial") static final class MapReduceMappingsToIntTask<K,V> |
6565 |
< |
extends BulkTask<K,V,Integer> { |
6565 |
> |
extends Traverser<K,V,Integer> { |
6566 |
|
final ObjectByObjectToInt<? super K, ? super V> transformer; |
6567 |
|
final IntByIntToInt reducer; |
6568 |
|
final int basis; |
6569 |
|
int result; |
6570 |
|
MapReduceMappingsToIntTask<K,V> rights, nextRight; |
6571 |
|
MapReduceMappingsToIntTask |
6572 |
< |
(ConcurrentHashMapV8<K,V> m, BulkTask<K,V,?> p, int b, |
6573 |
< |
MapReduceMappingsToIntTask<K,V> rights, |
6572 |
> |
(ConcurrentHashMapV8<K,V> m, Traverser<K,V,?> p, int b, |
6573 |
> |
MapReduceMappingsToIntTask<K,V> nextRight, |
6574 |
|
ObjectByObjectToInt<? super K, ? super V> transformer, |
6575 |
|
int basis, |
6576 |
|
IntByIntToInt reducer) { |
6578 |
|
this.transformer = transformer; |
6579 |
|
this.basis = basis; this.reducer = reducer; |
6580 |
|
} |
6581 |
< |
@SuppressWarnings("unchecked") public final boolean exec() { |
6581 |
> |
public final Integer getRawResult() { return result; } |
6582 |
> |
@SuppressWarnings("unchecked") public final void compute() { |
6583 |
|
final ObjectByObjectToInt<? super K, ? super V> transformer = |
6584 |
|
this.transformer; |
6585 |
|
final IntByIntToInt reducer = this.reducer; |
6586 |
|
if (transformer == null || reducer == null) |
6587 |
< |
return abortOnNullFunction(); |
6588 |
< |
try { |
6589 |
< |
final int id = this.basis; |
6590 |
< |
for (int c, b = batch(); b > 1 && baseIndex != baseLimit;) { |
6591 |
< |
do {} while (!casPending(c = pending, c+1)); |
6592 |
< |
(rights = new MapReduceMappingsToIntTask<K,V> |
6593 |
< |
(map, this, b >>>= 1, rights, transformer, id, reducer)).fork(); |
6594 |
< |
} |
6595 |
< |
int r = id; |
6596 |
< |
Object v; |
6597 |
< |
while ((v = advance()) != null) |
6598 |
< |
r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); |
6599 |
< |
result = r; |
6600 |
< |
for (MapReduceMappingsToIntTask<K,V> t = this, s;;) { |
6601 |
< |
int c; BulkTask<K,V,?> par; |
6602 |
< |
if ((c = t.pending) == 0) { |
6603 |
< |
for (s = t.rights; s != null; s = t.rights = s.nextRight) { |
6493 |
< |
t.result = reducer.apply(t.result, s.result); |
6494 |
< |
} |
6495 |
< |
if ((par = t.parent) == null || |
6496 |
< |
!(par instanceof MapReduceMappingsToIntTask)) { |
6497 |
< |
t.quietlyComplete(); |
6498 |
< |
break; |
6499 |
< |
} |
6500 |
< |
t = (MapReduceMappingsToIntTask<K,V>)par; |
6501 |
< |
} |
6502 |
< |
else if (t.casPending(c, c - 1)) |
6503 |
< |
break; |
6587 |
> |
throw new NullPointerException(); |
6588 |
> |
int r = this.basis; |
6589 |
> |
for (int b; (b = preSplit()) > 0;) |
6590 |
> |
(rights = new MapReduceMappingsToIntTask<K,V> |
6591 |
> |
(map, this, b, rights, transformer, r, reducer)).fork(); |
6592 |
> |
Object v; |
6593 |
> |
while ((v = advance()) != null) |
6594 |
> |
r = reducer.apply(r, transformer.apply((K)nextKey, (V)v)); |
6595 |
> |
result = r; |
6596 |
> |
CountedCompleter<?> c; |
6597 |
> |
for (c = firstComplete(); c != null; c = c.nextComplete()) { |
6598 |
> |
MapReduceMappingsToIntTask<K,V> |
6599 |
> |
t = (MapReduceMappingsToIntTask<K,V>)c, |
6600 |
> |
s = t.rights; |
6601 |
> |
while (s != null) { |
6602 |
> |
t.result = reducer.apply(t.result, s.result); |
6603 |
> |
s = t.rights = s.nextRight; |
6604 |
|
} |
6505 |
– |
} catch (Throwable ex) { |
6506 |
– |
return tryCompleteComputation(ex); |
6605 |
|
} |
6508 |
– |
return false; |
6606 |
|
} |
6510 |
– |
public final Integer getRawResult() { return result; } |
6607 |
|
} |
6608 |
|
|
6513 |
– |
|
6609 |
|
// Unsafe mechanics |
6610 |
|
private static final sun.misc.Unsafe UNSAFE; |
6611 |
|
private static final long counterOffset; |