17182
|
1 |
/*
|
|
2 |
* Copyright (c) 2012, 2013, Oracle and/or its affiliates. All rights reserved.
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation. Oracle designates this
|
|
8 |
* particular file as subject to the "Classpath" exception as provided
|
|
9 |
* by Oracle in the LICENSE file that accompanied this code.
|
|
10 |
*
|
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
15 |
* accompanied this code).
|
|
16 |
*
|
|
17 |
* You should have received a copy of the GNU General Public License version
|
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
20 |
*
|
|
21 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
22 |
* or visit www.oracle.com if you need additional information or have any
|
|
23 |
* questions.
|
|
24 |
*/
|
|
25 |
package java.util.stream;
|
|
26 |
|
|
27 |
import java.util.ArrayList;
|
|
28 |
import java.util.List;
|
|
29 |
import java.util.Spliterator;
|
|
30 |
import java.util.concurrent.CountedCompleter;
|
|
31 |
import java.util.function.IntFunction;
|
|
32 |
|
|
33 |
/**
|
|
34 |
* Factory for instances of a short-circuiting stateful intermediate operations
|
|
35 |
* that produce subsequences of their input stream.
|
|
36 |
*
|
|
37 |
* @since 1.8
|
|
38 |
*/
|
|
39 |
final class SliceOps {
|
|
40 |
|
|
41 |
// No instances
|
|
42 |
private SliceOps() { }
|
|
43 |
|
|
44 |
/**
|
|
45 |
* Appends a "slice" operation to the provided stream. The slice operation
|
|
46 |
* may be may be skip-only, limit-only, or skip-and-limit.
|
|
47 |
*
|
|
48 |
* @param <T> the type of both input and output elements
|
|
49 |
* @param upstream a reference stream with element type T
|
|
50 |
* @param skip the number of elements to skip. Must be >= 0.
|
|
51 |
* @param limit the maximum size of the resulting stream, or -1 if no limit
|
|
52 |
* is to be imposed
|
|
53 |
*/
|
|
54 |
public static <T> Stream<T> makeRef(AbstractPipeline<?, T, ?> upstream,
|
|
55 |
long skip, long limit) {
|
|
56 |
if (skip < 0)
|
|
57 |
throw new IllegalArgumentException("Skip must be non-negative: " + skip);
|
|
58 |
|
|
59 |
return new ReferencePipeline.StatefulOp<T,T>(upstream, StreamShape.REFERENCE,
|
|
60 |
flags(limit)) {
|
|
61 |
@Override
|
|
62 |
<P_IN> Node<T> opEvaluateParallel(PipelineHelper<T> helper,
|
|
63 |
Spliterator<P_IN> spliterator,
|
|
64 |
IntFunction<T[]> generator) {
|
|
65 |
return new SliceTask<>(this, helper, spliterator, generator, skip, limit).invoke();
|
|
66 |
}
|
|
67 |
|
|
68 |
@Override
|
|
69 |
Sink<T> opWrapSink(int flags, Sink<T> sink) {
|
|
70 |
return new Sink.ChainedReference<T>(sink) {
|
|
71 |
long n = skip;
|
|
72 |
long m = limit >= 0 ? limit : Long.MAX_VALUE;
|
|
73 |
|
|
74 |
@Override
|
|
75 |
public void accept(T t) {
|
|
76 |
if (n == 0) {
|
|
77 |
if (m > 0) {
|
|
78 |
m--;
|
|
79 |
downstream.accept(t);
|
|
80 |
}
|
|
81 |
}
|
|
82 |
else {
|
|
83 |
n--;
|
|
84 |
}
|
|
85 |
}
|
|
86 |
|
|
87 |
@Override
|
|
88 |
public boolean cancellationRequested() {
|
|
89 |
return m == 0 || downstream.cancellationRequested();
|
|
90 |
}
|
|
91 |
};
|
|
92 |
}
|
|
93 |
};
|
|
94 |
}
|
|
95 |
|
|
96 |
/**
|
|
97 |
* Appends a "slice" operation to the provided IntStream. The slice
|
|
98 |
* operation may be may be skip-only, limit-only, or skip-and-limit.
|
|
99 |
*
|
|
100 |
* @param upstream An IntStream
|
|
101 |
* @param skip The number of elements to skip. Must be >= 0.
|
|
102 |
* @param limit The maximum size of the resulting stream, or -1 if no limit
|
|
103 |
* is to be imposed
|
|
104 |
*/
|
|
105 |
public static IntStream makeInt(AbstractPipeline<?, Integer, ?> upstream,
|
|
106 |
long skip, long limit) {
|
|
107 |
if (skip < 0)
|
|
108 |
throw new IllegalArgumentException("Skip must be non-negative: " + skip);
|
|
109 |
|
|
110 |
return new IntPipeline.StatefulOp<Integer>(upstream, StreamShape.INT_VALUE,
|
|
111 |
flags(limit)) {
|
|
112 |
@Override
|
|
113 |
<P_IN> Node<Integer> opEvaluateParallel(PipelineHelper<Integer> helper,
|
|
114 |
Spliterator<P_IN> spliterator,
|
|
115 |
IntFunction<Integer[]> generator) {
|
|
116 |
return new SliceTask<>(this, helper, spliterator, generator, skip, limit).invoke();
|
|
117 |
}
|
|
118 |
|
|
119 |
@Override
|
|
120 |
Sink<Integer> opWrapSink(int flags, Sink<Integer> sink) {
|
|
121 |
return new Sink.ChainedInt(sink) {
|
|
122 |
long n = skip;
|
|
123 |
long m = limit >= 0 ? limit : Long.MAX_VALUE;
|
|
124 |
|
|
125 |
@Override
|
|
126 |
public void accept(int t) {
|
|
127 |
if (n == 0) {
|
|
128 |
if (m > 0) {
|
|
129 |
m--;
|
|
130 |
downstream.accept(t);
|
|
131 |
}
|
|
132 |
}
|
|
133 |
else {
|
|
134 |
n--;
|
|
135 |
}
|
|
136 |
}
|
|
137 |
|
|
138 |
@Override
|
|
139 |
public boolean cancellationRequested() {
|
|
140 |
return m == 0 || downstream.cancellationRequested();
|
|
141 |
}
|
|
142 |
};
|
|
143 |
}
|
|
144 |
};
|
|
145 |
}
|
|
146 |
|
|
147 |
/**
|
|
148 |
* Appends a "slice" operation to the provided LongStream. The slice
|
|
149 |
* operation may be may be skip-only, limit-only, or skip-and-limit.
|
|
150 |
*
|
|
151 |
* @param upstream A LongStream
|
|
152 |
* @param skip The number of elements to skip. Must be >= 0.
|
|
153 |
* @param limit The maximum size of the resulting stream, or -1 if no limit
|
|
154 |
* is to be imposed
|
|
155 |
*/
|
|
156 |
public static LongStream makeLong(AbstractPipeline<?, Long, ?> upstream,
|
|
157 |
long skip, long limit) {
|
|
158 |
if (skip < 0)
|
|
159 |
throw new IllegalArgumentException("Skip must be non-negative: " + skip);
|
|
160 |
|
|
161 |
return new LongPipeline.StatefulOp<Long>(upstream, StreamShape.LONG_VALUE,
|
|
162 |
flags(limit)) {
|
|
163 |
@Override
|
|
164 |
<P_IN> Node<Long> opEvaluateParallel(PipelineHelper<Long> helper,
|
|
165 |
Spliterator<P_IN> spliterator,
|
|
166 |
IntFunction<Long[]> generator) {
|
|
167 |
return new SliceTask<>(this, helper, spliterator, generator, skip, limit).invoke();
|
|
168 |
}
|
|
169 |
|
|
170 |
@Override
|
|
171 |
Sink<Long> opWrapSink(int flags, Sink<Long> sink) {
|
|
172 |
return new Sink.ChainedLong(sink) {
|
|
173 |
long n = skip;
|
|
174 |
long m = limit >= 0 ? limit : Long.MAX_VALUE;
|
|
175 |
|
|
176 |
@Override
|
|
177 |
public void accept(long t) {
|
|
178 |
if (n == 0) {
|
|
179 |
if (m > 0) {
|
|
180 |
m--;
|
|
181 |
downstream.accept(t);
|
|
182 |
}
|
|
183 |
}
|
|
184 |
else {
|
|
185 |
n--;
|
|
186 |
}
|
|
187 |
}
|
|
188 |
|
|
189 |
@Override
|
|
190 |
public boolean cancellationRequested() {
|
|
191 |
return m == 0 || downstream.cancellationRequested();
|
|
192 |
}
|
|
193 |
};
|
|
194 |
}
|
|
195 |
};
|
|
196 |
}
|
|
197 |
|
|
198 |
/**
|
|
199 |
* Appends a "slice" operation to the provided DoubleStream. The slice
|
|
200 |
* operation may be may be skip-only, limit-only, or skip-and-limit.
|
|
201 |
*
|
|
202 |
* @param upstream A DoubleStream
|
|
203 |
* @param skip The number of elements to skip. Must be >= 0.
|
|
204 |
* @param limit The maximum size of the resulting stream, or -1 if no limit
|
|
205 |
* is to be imposed
|
|
206 |
*/
|
|
207 |
public static DoubleStream makeDouble(AbstractPipeline<?, Double, ?> upstream,
|
|
208 |
long skip, long limit) {
|
|
209 |
if (skip < 0)
|
|
210 |
throw new IllegalArgumentException("Skip must be non-negative: " + skip);
|
|
211 |
|
|
212 |
return new DoublePipeline.StatefulOp<Double>(upstream, StreamShape.DOUBLE_VALUE,
|
|
213 |
flags(limit)) {
|
|
214 |
@Override
|
|
215 |
<P_IN> Node<Double> opEvaluateParallel(PipelineHelper<Double> helper,
|
|
216 |
Spliterator<P_IN> spliterator,
|
|
217 |
IntFunction<Double[]> generator) {
|
|
218 |
return new SliceTask<>(this, helper, spliterator, generator, skip, limit).invoke();
|
|
219 |
}
|
|
220 |
|
|
221 |
@Override
|
|
222 |
Sink<Double> opWrapSink(int flags, Sink<Double> sink) {
|
|
223 |
return new Sink.ChainedDouble(sink) {
|
|
224 |
long n = skip;
|
|
225 |
long m = limit >= 0 ? limit : Long.MAX_VALUE;
|
|
226 |
|
|
227 |
@Override
|
|
228 |
public void accept(double t) {
|
|
229 |
if (n == 0) {
|
|
230 |
if (m > 0) {
|
|
231 |
m--;
|
|
232 |
downstream.accept(t);
|
|
233 |
}
|
|
234 |
}
|
|
235 |
else {
|
|
236 |
n--;
|
|
237 |
}
|
|
238 |
}
|
|
239 |
|
|
240 |
@Override
|
|
241 |
public boolean cancellationRequested() {
|
|
242 |
return m == 0 || downstream.cancellationRequested();
|
|
243 |
}
|
|
244 |
};
|
|
245 |
}
|
|
246 |
};
|
|
247 |
}
|
|
248 |
|
|
249 |
private static int flags(long limit) {
|
|
250 |
return StreamOpFlag.NOT_SIZED | ((limit != -1) ? StreamOpFlag.IS_SHORT_CIRCUIT : 0);
|
|
251 |
}
|
|
252 |
|
|
253 |
// Parallel strategy -- two cases
|
|
254 |
// IF we have full size information
|
|
255 |
// - decompose, keeping track of each leaf's (offset, size)
|
|
256 |
// - calculate leaf only if intersection between (offset, size) and desired slice
|
|
257 |
// - Construct a Node containing the appropriate sections of the appropriate leaves
|
|
258 |
// IF we don't
|
|
259 |
// - decompose, and calculate size of each leaf
|
|
260 |
// - on complete of any node, compute completed initial size from the root, and if big enough, cancel later nodes
|
|
261 |
// - @@@ this can be significantly improved
|
|
262 |
|
|
263 |
// @@@ Currently we don't do the sized version at all
|
|
264 |
|
|
265 |
// @@@ Should take into account ORDERED flag; if not ORDERED, we can limit in temporal order instead
|
|
266 |
|
|
267 |
/**
|
|
268 |
* {@code ForkJoinTask} implementing slice computation.
|
|
269 |
*
|
|
270 |
* @param <P_IN> Input element type to the stream pipeline
|
|
271 |
* @param <P_OUT> Output element type from the stream pipeline
|
|
272 |
*/
|
|
273 |
private static final class SliceTask<P_IN, P_OUT>
|
|
274 |
extends AbstractShortCircuitTask<P_IN, P_OUT, Node<P_OUT>, SliceTask<P_IN, P_OUT>> {
|
|
275 |
private final AbstractPipeline<P_OUT, P_OUT, ?> op;
|
|
276 |
private final IntFunction<P_OUT[]> generator;
|
|
277 |
private final long targetOffset, targetSize;
|
|
278 |
private long thisNodeSize;
|
|
279 |
|
|
280 |
private volatile boolean completed;
|
|
281 |
|
|
282 |
SliceTask(AbstractPipeline<?, P_OUT, ?> op,
|
|
283 |
PipelineHelper<P_OUT> helper,
|
|
284 |
Spliterator<P_IN> spliterator,
|
|
285 |
IntFunction<P_OUT[]> generator,
|
|
286 |
long offset, long size) {
|
|
287 |
super(helper, spliterator);
|
|
288 |
this.op = (AbstractPipeline<P_OUT, P_OUT, ?>) op;
|
|
289 |
this.generator = generator;
|
|
290 |
this.targetOffset = offset;
|
|
291 |
this.targetSize = size;
|
|
292 |
}
|
|
293 |
|
|
294 |
SliceTask(SliceTask<P_IN, P_OUT> parent, Spliterator<P_IN> spliterator) {
|
|
295 |
super(parent, spliterator);
|
|
296 |
this.op = parent.op;
|
|
297 |
this.generator = parent.generator;
|
|
298 |
this.targetOffset = parent.targetOffset;
|
|
299 |
this.targetSize = parent.targetSize;
|
|
300 |
}
|
|
301 |
|
|
302 |
@Override
|
|
303 |
protected SliceTask<P_IN, P_OUT> makeChild(Spliterator<P_IN> spliterator) {
|
|
304 |
return new SliceTask<>(this, spliterator);
|
|
305 |
}
|
|
306 |
|
|
307 |
@Override
|
|
308 |
protected final Node<P_OUT> getEmptyResult() {
|
|
309 |
return Nodes.emptyNode(op.getOutputShape());
|
|
310 |
}
|
|
311 |
|
|
312 |
@Override
|
|
313 |
protected final Node<P_OUT> doLeaf() {
|
|
314 |
if (isRoot()) {
|
|
315 |
long sizeIfKnown = StreamOpFlag.SIZED.isPreserved(op.sourceOrOpFlags)
|
|
316 |
? op.exactOutputSizeIfKnown(spliterator)
|
|
317 |
: -1;
|
|
318 |
final Node.Builder<P_OUT> nb = op.makeNodeBuilder(sizeIfKnown, generator);
|
|
319 |
Sink<P_OUT> opSink = op.opWrapSink(op.sourceOrOpFlags, nb);
|
|
320 |
|
|
321 |
if (!StreamOpFlag.SHORT_CIRCUIT.isKnown(op.sourceOrOpFlags))
|
|
322 |
helper.wrapAndCopyInto(opSink, spliterator);
|
|
323 |
else
|
|
324 |
helper.copyIntoWithCancel(helper.wrapSink(opSink), spliterator);
|
|
325 |
return nb.build();
|
|
326 |
}
|
|
327 |
else {
|
|
328 |
Node<P_OUT> node = helper.wrapAndCopyInto(helper.makeNodeBuilder(-1, generator),
|
|
329 |
spliterator).build();
|
|
330 |
thisNodeSize = node.count();
|
|
331 |
completed = true;
|
|
332 |
return node;
|
|
333 |
}
|
|
334 |
}
|
|
335 |
|
|
336 |
@Override
|
|
337 |
public final void onCompletion(CountedCompleter<?> caller) {
|
|
338 |
if (!isLeaf()) {
|
|
339 |
thisNodeSize = leftChild.thisNodeSize + rightChild.thisNodeSize;
|
|
340 |
completed = true;
|
|
341 |
|
|
342 |
if (isRoot()) {
|
|
343 |
// Only collect nodes once absolute size information is known
|
|
344 |
|
|
345 |
ArrayList<Node<P_OUT>> nodes = new ArrayList<>();
|
|
346 |
visit(nodes, 0);
|
|
347 |
Node<P_OUT> result;
|
|
348 |
if (nodes.size() == 0)
|
|
349 |
result = Nodes.emptyNode(op.getOutputShape());
|
|
350 |
else if (nodes.size() == 1)
|
|
351 |
result = nodes.get(0);
|
|
352 |
else
|
|
353 |
// This will create a tree of depth 1 and will not be a sub-tree
|
|
354 |
// for leaf nodes within the require range
|
|
355 |
result = Nodes.conc(op.getOutputShape(), nodes);
|
|
356 |
setLocalResult(result);
|
|
357 |
}
|
|
358 |
}
|
|
359 |
if (targetSize >= 0) {
|
|
360 |
if (((SliceTask<P_IN, P_OUT>) getRoot()).leftSize() >= targetOffset + targetSize)
|
|
361 |
cancelLaterNodes();
|
|
362 |
}
|
|
363 |
// Don't call super.onCompletion(), we don't look at the child nodes until farther up the tree
|
|
364 |
}
|
|
365 |
|
|
366 |
/** Compute the cumulative size of the longest leading prefix of completed children */
|
|
367 |
private long leftSize() {
|
|
368 |
if (completed)
|
|
369 |
return thisNodeSize;
|
|
370 |
else if (isLeaf())
|
|
371 |
return 0;
|
|
372 |
else {
|
|
373 |
long leftSize = 0;
|
|
374 |
for (SliceTask<P_IN, P_OUT> child = leftChild, p = null; child != p;
|
|
375 |
p = child, child = rightChild) {
|
|
376 |
if (child.completed)
|
|
377 |
leftSize += child.thisNodeSize;
|
|
378 |
else {
|
|
379 |
leftSize += child.leftSize();
|
|
380 |
break;
|
|
381 |
}
|
|
382 |
}
|
|
383 |
return leftSize;
|
|
384 |
}
|
|
385 |
}
|
|
386 |
|
|
387 |
private void visit(List<Node<P_OUT>> results, int offset) {
|
|
388 |
if (!isLeaf()) {
|
|
389 |
for (SliceTask<P_IN, P_OUT> child = leftChild, p = null; child != p;
|
|
390 |
p = child, child = rightChild) {
|
|
391 |
child.visit(results, offset);
|
|
392 |
offset += child.thisNodeSize;
|
|
393 |
}
|
|
394 |
}
|
|
395 |
else {
|
|
396 |
if (results.size() == 0) {
|
|
397 |
if (offset + thisNodeSize >= targetOffset)
|
|
398 |
results.add(truncateNode(getLocalResult(),
|
|
399 |
Math.max(0, targetOffset - offset),
|
|
400 |
targetSize >= 0 ? Math.max(0, offset + thisNodeSize - (targetOffset + targetSize)) : 0));
|
|
401 |
}
|
|
402 |
else {
|
|
403 |
if (targetSize == -1 || offset < targetOffset + targetSize) {
|
|
404 |
results.add(truncateNode(getLocalResult(),
|
|
405 |
0,
|
|
406 |
targetSize >= 0 ? Math.max(0, offset + thisNodeSize - (targetOffset + targetSize)) : 0));
|
|
407 |
}
|
|
408 |
}
|
|
409 |
}
|
|
410 |
}
|
|
411 |
|
|
412 |
/**
|
|
413 |
* Return a new node describing the result of truncating an existing Node
|
|
414 |
* at the left and/or right.
|
|
415 |
*/
|
|
416 |
private Node<P_OUT> truncateNode(Node<P_OUT> input,
|
|
417 |
long skipLeft, long skipRight) {
|
|
418 |
if (skipLeft == 0 && skipRight == 0)
|
|
419 |
return input;
|
|
420 |
else {
|
|
421 |
return Nodes.truncateNode(input, skipLeft, thisNodeSize - skipRight, generator);
|
|
422 |
}
|
|
423 |
}
|
|
424 |
}
|
|
425 |
|
|
426 |
// @@@ Currently unused -- optimization for when all sizes are known
|
|
427 |
// private static class SizedSliceTask<S, T> extends AbstractShortCircuitTask<S, T, Node<T>, SizedSliceTask<S, T>> {
|
|
428 |
// private final int targetOffset, targetSize;
|
|
429 |
// private final int offset, size;
|
|
430 |
//
|
|
431 |
// private SizedSliceTask(ParallelPipelineHelper<S, T> helper, int offset, int size) {
|
|
432 |
// super(helper);
|
|
433 |
// targetOffset = offset;
|
|
434 |
// targetSize = size;
|
|
435 |
// this.offset = 0;
|
|
436 |
// this.size = spliterator.getSizeIfKnown();
|
|
437 |
// }
|
|
438 |
//
|
|
439 |
// private SizedSliceTask(SizedSliceTask<S, T> parent, Spliterator<S> spliterator) {
|
|
440 |
// // Makes assumptions about order in which siblings are created and linked into parent!
|
|
441 |
// super(parent, spliterator);
|
|
442 |
// targetOffset = parent.targetOffset;
|
|
443 |
// targetSize = parent.targetSize;
|
|
444 |
// int siblingSizes = 0;
|
|
445 |
// for (SizedSliceTask<S, T> sibling = parent.children; sibling != null; sibling = sibling.nextSibling)
|
|
446 |
// siblingSizes += sibling.size;
|
|
447 |
// size = spliterator.getSizeIfKnown();
|
|
448 |
// offset = parent.offset + siblingSizes;
|
|
449 |
// }
|
|
450 |
//
|
|
451 |
// @Override
|
|
452 |
// protected SizedSliceTask<S, T> makeChild(Spliterator<S> spliterator) {
|
|
453 |
// return new SizedSliceTask<>(this, spliterator);
|
|
454 |
// }
|
|
455 |
//
|
|
456 |
// @Override
|
|
457 |
// protected Node<T> getEmptyResult() {
|
|
458 |
// return Nodes.emptyNode();
|
|
459 |
// }
|
|
460 |
//
|
|
461 |
// @Override
|
|
462 |
// public boolean taskCanceled() {
|
|
463 |
// if (offset > targetOffset+targetSize || offset+size < targetOffset)
|
|
464 |
// return true;
|
|
465 |
// else
|
|
466 |
// return super.taskCanceled();
|
|
467 |
// }
|
|
468 |
//
|
|
469 |
// @Override
|
|
470 |
// protected Node<T> doLeaf() {
|
|
471 |
// int skipLeft = Math.max(0, targetOffset - offset);
|
|
472 |
// int skipRight = Math.max(0, offset + size - (targetOffset + targetSize));
|
|
473 |
// if (skipLeft == 0 && skipRight == 0)
|
|
474 |
// return helper.into(Nodes.<T>makeBuilder(spliterator.getSizeIfKnown())).build();
|
|
475 |
// else {
|
|
476 |
// // If we're the first or last node that intersects the target range, peel off irrelevant elements
|
|
477 |
// int truncatedSize = size - skipLeft - skipRight;
|
|
478 |
// NodeBuilder<T> builder = Nodes.<T>makeBuilder(truncatedSize);
|
|
479 |
// Sink<S> wrappedSink = helper.wrapSink(builder);
|
|
480 |
// wrappedSink.begin(truncatedSize);
|
|
481 |
// Iterator<S> iterator = spliterator.iterator();
|
|
482 |
// for (int i=0; i<skipLeft; i++)
|
|
483 |
// iterator.next();
|
|
484 |
// for (int i=0; i<truncatedSize; i++)
|
|
485 |
// wrappedSink.apply(iterator.next());
|
|
486 |
// wrappedSink.end();
|
|
487 |
// return builder.build();
|
|
488 |
// }
|
|
489 |
// }
|
|
490 |
//
|
|
491 |
// @Override
|
|
492 |
// public void onCompletion(CountedCompleter<?> caller) {
|
|
493 |
// if (!isLeaf()) {
|
|
494 |
// Node<T> result = null;
|
|
495 |
// for (SizedSliceTask<S, T> child = children.nextSibling; child != null; child = child.nextSibling) {
|
|
496 |
// Node<T> childResult = child.getRawResult();
|
|
497 |
// if (childResult == null)
|
|
498 |
// continue;
|
|
499 |
// else if (result == null)
|
|
500 |
// result = childResult;
|
|
501 |
// else
|
|
502 |
// result = Nodes.node(result, childResult);
|
|
503 |
// }
|
|
504 |
// setRawResult(result);
|
|
505 |
// if (offset <= targetOffset && offset+size >= targetOffset+targetSize)
|
|
506 |
// shortCircuit(result);
|
|
507 |
// }
|
|
508 |
// }
|
|
509 |
// }
|
|
510 |
|
|
511 |
}
|