Home
last modified time | relevance | path

Searched refs:leftChild (Results 1 – 7 of 7) sorted by relevance

/libcore/ojluni/src/main/java/java/util/stream/
DAbstractTask.java116 protected K leftChild; field in AbstractTask
255 return leftChild == null; in isLeaf()
298 K leftChild, rightChild, taskToFork; in compute() local
299 task.leftChild = leftChild = task.makeChild(ls); in compute()
305 task = leftChild; in compute()
311 taskToFork = leftChild; in compute()
331 leftChild = rightChild = null; in onCompletion()
346 if (parent != null && parent.leftChild != node) in isLeftmostNode()
DAbstractShortCircuitTask.java118 K leftChild, rightChild, taskToFork; in compute() local
119 task.leftChild = leftChild = task.makeChild(ls); in compute()
125 task = leftChild; in compute()
131 taskToFork = leftChild; in compute()
227 if (parent.leftChild == node) { in cancelLaterNodes()
DForEachOps.java409 ForEachOrderedTask<S, T> leftChild = in doCompute() local
412 new ForEachOrderedTask<>(task, rightSplit, leftChild); in doCompute()
421 task.completionMap.put(leftChild, rightChild); in doCompute()
434 leftChild.addToPendingCount(1); in doCompute()
437 if (task.completionMap.replace(task.leftPredecessor, task, leftChild)) { in doCompute()
445 leftChild.addToPendingCount(-1); in doCompute()
453 task = leftChild; in doCompute()
459 taskToFork = leftChild; in doCompute()
DSliceOps.java625 thisNodeSize = leftChild.thisNodeSize + rightChild.thisNodeSize;
632 else if (leftChild.thisNodeSize == 0)
636 leftChild.getLocalResult(), rightChild.getLocalResult());
677 SliceTask<P_IN, P_OUT> left = parent.leftChild;
702 SliceTask<P_IN, P_OUT> left = leftChild;
DFindOps.java304 for (FindTask<P_IN, P_OUT, O> child = leftChild, p = null; child != p; in onCompletion()
DReduceOps.java753 S leftResult = leftChild.getLocalResult();
DNodes.java2189 … setLocalResult(concFactory.apply(leftChild.getLocalResult(), rightChild.getLocalResult()));