You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
282 lines
9.7 KiB
282 lines
9.7 KiB
/* This file is part of the KDE project
|
|
Copyright (C) 2001 Thomas Zander zander@kde.org
|
|
Copyright (C) 2004 - 2006 Dag Andersen <danders@get2net.dk>
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Library General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Library General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Library General Public License
|
|
along with this library; see the file COPYING.LIB. If not, write to
|
|
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
* Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#ifndef KPTPROJECT_H
|
|
#define KPTPROJECT_H
|
|
|
|
#include "kptnode.h"
|
|
|
|
#include "kptaccount.h"
|
|
#include "kptcalendar.h"
|
|
#include "kptdatetime.h"
|
|
#include "kptduration.h"
|
|
#include "kptresource.h"
|
|
|
|
#include <tqmap.h>
|
|
#include <tqptrlist.h>
|
|
#include <tqdict.h>
|
|
|
|
#include <klistview.h>
|
|
#include <klocale.h>
|
|
|
|
namespace KPlato
|
|
{
|
|
|
|
class Part;
|
|
class Schedule;
|
|
class StandardWorktime;
|
|
|
|
//#define DEBUGPERT
|
|
/**
|
|
* Project is the main node in a project, it contains child nodes and
|
|
* possibly sub-projects. A sub-project is just another instantion of this
|
|
* node however.
|
|
*/
|
|
class Project : public Node {
|
|
public:
|
|
Project(Node *parent = 0);
|
|
~Project();
|
|
|
|
/// Returns the node type. Can be Type_Project or Type_Subproject.
|
|
virtual int type() const;
|
|
|
|
/**
|
|
* Calculate the whole project.
|
|
*
|
|
* @param schedule Schedule to use
|
|
*/
|
|
void calculate(Schedule *scedule);
|
|
/**
|
|
* Calculate the whole project.
|
|
*
|
|
* @param use Calculate using expected-, optimistic- or pessimistic estimate.
|
|
*/
|
|
void calculate(Effort::Use use);
|
|
/// Calculate current schedule
|
|
void calculate();
|
|
|
|
virtual bool calcCriticalPath(bool fromEnd);
|
|
|
|
virtual DateTime startTime() const;
|
|
virtual DateTime endTime() const;
|
|
|
|
/// Returns the duration calculated as latestFinish - earliestStart.
|
|
Duration *getExpectedDuration();
|
|
|
|
/**
|
|
* Instead of using the expected duration, generate a random value using
|
|
* the Distribution of each Task. This can be used for Monte-Carlo
|
|
* estimation of Project duration.
|
|
*/
|
|
Duration *getRandomDuration();
|
|
|
|
virtual bool load(TQDomElement &element);
|
|
virtual void save(TQDomElement &element) const;
|
|
|
|
TQPtrList<ResourceGroup> &resourceGroups();
|
|
virtual void addResourceGroup(ResourceGroup *resource);
|
|
virtual void insertResourceGroup(unsigned int index, ResourceGroup *resource);
|
|
void removeResourceGroup(ResourceGroup *resource);
|
|
void removeResourceGroup(int number);
|
|
ResourceGroup *takeResourceGroup(ResourceGroup *resource)
|
|
{ return m_resourceGroups.take(m_resourceGroups.findRef(resource)); }
|
|
|
|
bool addTask( Node* task, Node* position );
|
|
bool addSubTask( Node* task, Node* position );
|
|
bool addSubTask( Node* task, int index, Node* parent );
|
|
void delTask(Node *node);
|
|
bool canIndentTask(Node* node);
|
|
bool indentTask( Node* node );
|
|
bool canUnindentTask( Node* node );
|
|
bool unindentTask( Node* node );
|
|
bool canMoveTaskUp( Node* node );
|
|
bool moveTaskUp( Node* node );
|
|
bool canMoveTaskDown( Node* node );
|
|
bool moveTaskDown( Node* node );
|
|
Task *createTask(Node* parent);
|
|
Task *createTask(Task &def, Node* parent);
|
|
|
|
/// Returns the resourcegroup with identity id.
|
|
ResourceGroup *group(TQString id);
|
|
/// Returns the resource with identity id.
|
|
Resource *resource(TQString id);
|
|
|
|
virtual EffortCostMap plannedEffortCostPrDay(const TQDate &start, const TQDate &end) const;
|
|
|
|
/// Returns the total planned effort for this project (or subproject)
|
|
virtual Duration plannedEffort();
|
|
/// Returns the total planned effort for this project (or subproject) on date
|
|
virtual Duration plannedEffort(const TQDate &date);
|
|
/// Returns the planned effort up to and including date
|
|
virtual Duration plannedEffortTo(const TQDate &date);
|
|
|
|
/// Returns the actual effort
|
|
virtual Duration actualEffort();
|
|
/// Returns the actual effort on date
|
|
virtual Duration actualEffort(const TQDate &date);
|
|
/// Returns the actual effort up to and including date
|
|
virtual Duration actualEffortTo(const TQDate &date);
|
|
/**
|
|
* Returns the total planned cost for this project
|
|
*/
|
|
virtual double plannedCost();
|
|
/// Planned cost on date
|
|
virtual double plannedCost(const TQDate &date);
|
|
/// Planned cost up to and including date
|
|
virtual double plannedCostTo(const TQDate &date);
|
|
|
|
/**
|
|
* Returns the actually reported cost for this project
|
|
*/
|
|
virtual double actualCost();
|
|
/// Actual cost on date
|
|
virtual double actualCost(const TQDate &date);
|
|
/// Actual cost up to and including date
|
|
virtual double actualCostTo(const TQDate &date);
|
|
|
|
Calendar *defaultCalendar() { return m_standardWorktime->calendar(); }
|
|
TQPtrList<Calendar> calendars();
|
|
void addCalendar(Calendar *calendar);
|
|
/// Returns the calendar with identity id.
|
|
Calendar *calendar(const TQString id) const;
|
|
|
|
/**
|
|
* Defines the length of days, weeks, months and years
|
|
* and the standard working week.
|
|
* Used for estimation and calculation of effort,
|
|
* and presentation in gantt chart.
|
|
*/
|
|
StandardWorktime *standardWorktime() { return m_standardWorktime; }
|
|
void setStandardWorktime(StandardWorktime * worktime);
|
|
|
|
/// Check if node par can be linked to node child.
|
|
bool legalToLink(Node *par, Node *child);
|
|
|
|
virtual const TQDict<Node> &nodeDict() { return nodeIdDict; }
|
|
|
|
/// Find the node with identity id
|
|
virtual Node *findNode(const TQString &id) const
|
|
{ return (m_parent ? m_parent->findNode(id) : nodeIdDict.find(id)); }
|
|
/// Remove the node with identity id from the register
|
|
virtual bool removeId(const TQString &id);
|
|
/// Insert the node with identity id
|
|
virtual void insertId(const TQString &id, const Node *node);
|
|
/// Register node. The nodes id must be unique and non-empty.
|
|
bool registerNodeId(Node *node);
|
|
/// Create a unique id.
|
|
TQString uniqueNodeId(int seed=1);
|
|
|
|
ResourceGroup *findResourceGroup(const TQString &id) const
|
|
{ return resourceGroupIdDict.find(id); }
|
|
/// Remove the resourcegroup with identity id from the register
|
|
bool removeResourceGroupId(const TQString &id)
|
|
{ return resourceGroupIdDict.remove(id); }
|
|
/// Insert the resourcegroup with identity id
|
|
void insertResourceGroupId(const TQString &id, const ResourceGroup* group)
|
|
{ resourceGroupIdDict.insert(id, group); }
|
|
|
|
Resource *findResource(const TQString &id) const
|
|
{ return resourceIdDict.find(id); }
|
|
/// Remove the resource with identity id from the register
|
|
bool removeResourceId(const TQString &id)
|
|
{ return resourceIdDict.remove(id); }
|
|
/// Insert the resource with identity id
|
|
void insertResourceId(const TQString &id, const Resource *resource)
|
|
{ resourceIdDict.insert(id, resource); }
|
|
|
|
/// Find the calendar with identity id
|
|
virtual Calendar *findCalendar(const TQString &id) const
|
|
{ return id.isEmpty() ? 0 : calendarIdDict.find(id); }
|
|
/// Remove the calendar with identity id from the register
|
|
virtual bool removeCalendarId(const TQString &id);
|
|
/// Insert the calendar with identity id
|
|
virtual void insertCalendarId(const TQString &id, const Calendar *calendar);
|
|
|
|
/**
|
|
* Setting a project to be baselined means the project data can not be edited anymore.
|
|
* @param on the new baseline value
|
|
*/
|
|
void setBaselined(bool on) { m_baselined = on; }
|
|
/**
|
|
* @return if the project is baselined; a baselined project becomes uneditable.
|
|
*/
|
|
bool isBaselined() const { return m_baselined; }
|
|
|
|
void generateWBS(int count, WBSDefinition &def, TQString wbs=TQString());
|
|
|
|
Accounts &accounts() { return m_accounts; }
|
|
|
|
/// Set current schedule to schedule with identity id, for me and my children
|
|
virtual void setCurrentSchedule(long id);
|
|
/// Create new schedule with unique id.
|
|
MainSchedule *createSchedule(TQString name, Schedule::Type type);
|
|
/// Set parent schedule for my children
|
|
virtual void setParentSchedule(Schedule *sch);
|
|
|
|
protected:
|
|
Accounts m_accounts;
|
|
TQPtrList<ResourceGroup> m_resourceGroups;
|
|
|
|
TQPtrList<Calendar> m_calendars;
|
|
|
|
StandardWorktime *m_standardWorktime;
|
|
|
|
DateTime calculateForward(int use);
|
|
DateTime calculateBackward(int use);
|
|
DateTime scheduleForward(const DateTime &earliest, int use);
|
|
DateTime scheduleBackward(const DateTime &latest, int use);
|
|
void adjustSummarytask();
|
|
|
|
void initiateCalculation(Schedule &sch);
|
|
void initiateCalculationLists(TQPtrList<Node> &startnodes, TQPtrList<Node> &endnodes, TQPtrList<Node> &summarytasks);
|
|
|
|
bool legalParents(Node *par, Node *child);
|
|
bool legalChildren(Node *par, Node *child);
|
|
|
|
private:
|
|
void init();
|
|
|
|
TQPtrList<Node> m_startNodes;
|
|
TQPtrList<Node> m_endNodes;
|
|
TQPtrList<Node> m_summarytasks;
|
|
|
|
bool m_baselined;
|
|
|
|
TQDict<ResourceGroup> resourceGroupIdDict;
|
|
TQDict<Resource> resourceIdDict;
|
|
TQDict<Node> nodeIdDict;
|
|
TQDict<Calendar> calendarIdDict;
|
|
|
|
#ifndef NDEBUG
|
|
#include <tqcstring.h>
|
|
public:
|
|
void printDebug(bool children, TQCString indent);
|
|
void printCalendarDebug(TQCString indent="");
|
|
#ifdef DEBUGPERT
|
|
static void pert_test();
|
|
static void printTree(Node *n, TQString s);
|
|
#endif
|
|
#endif
|
|
};
|
|
|
|
} //KPlato namespace
|
|
|
|
#endif
|