public final class DTree.DecidedNode.FindSplits
extends jsr166y.RecursiveAction
Constructor and Description |
---|
FindSplits(DHistogram[] hs,
Constraints cs,
int col,
DTree.UndecidedNode node) |
Modifier and Type | Method and Description |
---|---|
void |
compute() |
DTree.Split |
computeSplit() |
adapt, adapt, adapt, cancel, compareAndSetForkJoinTaskTag, complete, completeExceptionally, fork, get, get, get, getException, getForkJoinTaskTag, getPool, getQueuedTaskCount, getSurplusQueuedTaskCount, helpQuiesce, inForkJoinPool, invoke, invokeAll, invokeAll, invokeAll, isCancelled, isCompletedAbnormally, isCompletedNormally, isDone, join, peekNextLocalTask, pollNextLocalTask, pollTask, quietlyComplete, quietlyInvoke, quietlyJoin, reinitialize, setForkJoinTaskTag, tryUnfork
public FindSplits(DHistogram[] hs, Constraints cs, int col, DTree.UndecidedNode node)
public void compute()
compute
in class jsr166y.RecursiveAction
public final DTree.Split computeSplit()