| Methods Summary |
|---|
| TaskStack | getStack()Returns the task stack (not null if this is a leaf)
return mStack;
|
| public java.util.ArrayList | getStacks()
ArrayList<TaskStack> stacks = new ArrayList<TaskStack>();
getStacksRec(stacks);
return stacks;
|
| private void | getStacksRec(java.util.ArrayList stacks)Returns all the descendent task stacks
if (isLeafNode()) {
stacks.add(mStack);
} else {
mStartNode.getStacksRec(stacks);
mEndNode.getStacksRec(stacks);
}
|
| public boolean | hasTasks()Returns whether there are any tasks in any stacks below this node.
return (mStack.getTaskCount() > 0) ||
(mStartNode != null && mStartNode.hasTasks()) ||
(mEndNode != null && mEndNode.hasTasks());
|
| boolean | isLeafNode()Returns whether this is a leaf node
return (mStartNode == null) && (mEndNode == null);
|
| public void | setStack(TaskStack stack)Sets the current stack for this space node
mStack = stack;
|
