|
| |
|
| java.lang.Object
 com.projity.pm.criticalpath.PredecessorTaskList
| PredecessorTaskList | | public class PredecessorTaskList (Code) | | This class implements a task list in predecessor/parent order. That is, the successors of any given
task are guaranteed to be after that task in the list. Also wbs children are after their parents.
This ordering is needed for the critical path algorithm.
|
| Inner Class :final public static class TaskReference implements Comparable | |
| CALCULATION_STATUS_STEP | | final public static int CALCULATION_STATUS_STEP(Code) | | |
| addSubproject | | public void addSubproject(Task subproject)(Code) | | Add a subproject. It will convert the existing task into a parent and add all children
Parameters:
subproject - |
| arrangeTask | | void arrangeTask(Task task)(Code) | | Insert a task into the list. Go thru and insert it after its parent
The task being inserted is a new task and as such has no preds/succs. Just insert it after its parent
Parameters:
hasDependencies - |
| getCalculationStateCount | | int getCalculationStateCount()(Code) | | |
| getFreshCalculationStateCount | | synchronized int getFreshCalculationStateCount()(Code) | | |
| getMarkerStatus | | final public boolean getMarkerStatus()(Code) | | Returns the markerStatus. |
| getNextCalculationStateCount | | synchronized int getNextCalculationStateCount()(Code) | | |
| hasReverseScheduledTasks | | boolean hasReverseScheduledTasks()(Code) | | |
| listIterator | | ListIterator listIterator()(Code) | | Return a list iterator - delegates to internal list
list iterator |
| rearrangeAll | | void rearrangeAll()(Code) | | |
| recalculateReverseScheduledCount | | void recalculateReverseScheduledCount()(Code) | | Refresh the Reverse schedule count - called in response to change in constraint type field
|
| toggleMarkerStatus | | final boolean toggleMarkerStatus()(Code) | | |
|
|
|