Package com.projity.pm.task

Examples of com.projity.pm.task.Task

906
907
908
909
910
911
912
913
914
915
916
      return;
    }
    final Node node=(Node)nodes.get(0);
    Object impl=node.getImpl();
    if (impl instanceof Task||(impl instanceof Assignment&&taskType)){
      Task task=(Task)((impl instanceof Assignment)?(((Assignment)impl).getTask()):impl);
      if (taskInformationDialog == null) {
        taskInformationDialog = TaskInformationDialog.getInstance(getFrame(),task, notes);
        taskInformationDialog.pack();
        taskInformationDialog.setModal(false);
      } else {
View Full Code Here
2227
2228
2229
2230
2231
2232
2233
2234
2235
  public boolean isSubproject() {
    return false;
  }

  public boolean isJustModified(){
    Task task=getTask();
    if (task==null) return false;
    else return task.isJustModified();
  }
View Full Code Here
2370
2371
2372
2373
2374
2375
2376
2377
2378
  }
  public void setDirty(boolean dirty) {
    //System.out.println("Assignment _setDirty("+dirty+"): "+getName());
    this.dirty = dirty;
    if (dirty){
      Task task=getTask();
      if (task!=null) task.setDirty(true);
    }
  }
View Full Code Here
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
    if (actualExceptionsCalendar != null)
      return actualExceptionsCalendar;
    if (baselineCalendar != null)
      return baselineCalendar;
    Resource resource = getResource();
    Task task = getTask();
    if (((NormalTask)task).isIgnoreResourceCalendar() || isInvalidIntersectionCalendar() || resource.getEffectiveWorkCalendar() == null)
      return task.getEffectiveWorkCalendar();
    // if no task calendar, or calendar is invalid due to empty intersection of task and resource calendars
    if (task.getWorkCalendar() == null)
      return resource.getEffectiveWorkCalendar();
   
    if (intersectionCalendar == null) {
      try {
        intersectionCalendar = ((WorkingCalendar)task.getEffectiveWorkCalendar()).intersectWith((WorkingCalendar)resource.getEffectiveWorkCalendar());
      } catch (InvalidCalendarIntersectionException e) {
        intersectionCalendar = WorkingCalendar.INVALID_INTERSECTION_CALENDAR;
        Alert.error(Messages.getString("Message.invalidIntersection"));
        return task.getEffectiveWorkCalendar();
      }
    }
    return intersectionCalendar;
    // need to use intersection work calendar
  }
View Full Code Here
1109
1110
1111
1112
1113
1114
1115
1116
1117
   
  }
 
 
  public boolean isJustModified(){
    Task task=getTask();
    if (task==null) return false;
    else return task.isJustModified();
  }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
   * @param taskList
   */
  public void setAssignmentsFromTaskList(List taskList) {
    assignments = null;
    Iterator t = taskList.iterator();
    Task task;
    Object current;
    while (t.hasNext()) {
      current = t.next();
      if (!(current instanceof Task))
        continue;
View Full Code Here
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
    }

    private boolean isAllowedAction(Node node,boolean isParent){
    if (node!=null && (node.getImpl() instanceof Task)){
      boolean r=true;
      Task t=(Task)node.getImpl();
      if (t instanceof SubProj){
        Project p=isParent?((SubProj)t).getSubproject():t.getOwningProject();
        if (p!=null&&p.isReadOnly()) r=false;
      }
      else r=!t.isReadOnly();
      if (!r){
        Alert.error(MessageFormat.format(Messages.getString("Message.readOnlyTask"),new Object[]{t.getName()}));
      }
      return r;
    }
    return true;
    }
View Full Code Here
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
    };

    private void markAncestorsOfDirtyTasksDirty(Project project) {
      for(Object otask:project.getTasks()) {
        Task task = (Task)otask;
        if(task.isDirty()) {
          Task parent = task.getWbsParentTask();
          while(parent != null && !parent.isDirty()) {
            parent.setDirty(true);
            parent = parent.getWbsParentTask();
          }

        }
      }
    }
View Full Code Here
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
                  if (flatLinks==null)
                    linkData.setSuccessor(taskData);
                  else
                    linkData.setSuccessorId(taskData.getUniqueId());

                  Task pred=(Task)dependency.getPredecessor();
                  TaskData predData=(TaskData)taskLinker.getTransformationMap().get(pred);

                  if (flatLinks==null){
                    if (predData != null && !predData.isExternal())
                      linkData.setPredecessor(predData);
                    else {
                      linkData.setPredecessorId(pred.getUniqueId()); // external link
                    }
                    predecessors.add(linkData);
                  } else {
                    linkData.setPredecessorId(pred.getUniqueId());
                    flatLinks.add(linkData);

                  }
              }
              if (flatLinks==null)
View Full Code Here
507
508
509
510
511
512
513
514
515
516
517
518
519
520
      }
      //remove dist
      if (incrementalDistributions&&distMap.size()>0){
          Set<Long> noChangeTaskIds=new HashSet<Long>();

      Task task;
      for(Iterator i = project.getTaskOutlineIterator();i.hasNext();) {
        task = (Task)i.next();
        if(incremental&&!task.isDirty()) noChangeTaskIds.add(task.getUniqueId());
      }
//          for (Iterator i=projectData.getTasks().iterator();i.hasNext();){
//            TaskData task=(TaskData)i.next();
//            if (!task.isDirty()) noChangeTaskIds.add(task.getUniqueId());
//          }
View Full Code Here
TOP

Related Classes of com.projity.pm.task.Task

  • com.projity.association.AssociationList
  • com.projity.functor.CollectionVisitor
  • com.projity.functor.ObjectVisitor
  • com.projity.grouping.core.hierarchy.MutableNodeHierarchy
  • com.projity.grouping.core.model.DefaultNodeModel
  • com.projity.grouping.core.model.NodeModel
  • com.projity.grouping.core.model.NodeModelUtil
  • com.projity.grouping.core.Node
  • com.projity.grouping.core.summaries.DivisionSummaryVisitor
  • com.projity.pm.assignment.Assignment
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.