summaryrefslogtreecommitdiffstats
path: root/kplato/kptproject.cpp
diff options
context:
space:
mode:
authorMichele Calgaro <[email protected]>2021-05-23 20:48:35 +0900
committerMichele Calgaro <[email protected]>2021-05-29 15:16:28 +0900
commit8b78a8791bc539bcffe7159f9d9714d577cb3d7d (patch)
tree1328291f966f19a22d7b13657d3f01a588eb1083 /kplato/kptproject.cpp
parent95834e2bdc5e01ae1bd21ac0dfa4fa1d2417fae9 (diff)
downloadkoffice-8b78a8791bc539bcffe7159f9d9714d577cb3d7d.tar.gz
koffice-8b78a8791bc539bcffe7159f9d9714d577cb3d7d.zip
Renaming of files in preparation for code style tools.
Signed-off-by: Michele Calgaro <[email protected]>
Diffstat (limited to 'kplato/kptproject.cpp')
-rw-r--r--kplato/kptproject.cpp1104
1 files changed, 1104 insertions, 0 deletions
diff --git a/kplato/kptproject.cpp b/kplato/kptproject.cpp
new file mode 100644
index 00000000..97eb8202
--- /dev/null
+++ b/kplato/kptproject.cpp
@@ -0,0 +1,1104 @@
+/* This file is part of the KDE project
+ Copyright (C) 2001 Thomas zander <[email protected]>
+ Copyright (C) 2004 - 2006 Dag Andersen <[email protected]>
+
+ 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.
+*/
+
+#include "kptproject.h"
+#include "kptappointment.h"
+#include "kpttask.h"
+#include "kptprojectdialog.h"
+#include "kptdatetime.h"
+#include "kptpart.h"
+#include "kptconfig.h"
+#include "kpteffortcostmap.h"
+#include "kptschedule.h"
+
+#include <tqdom.h>
+#include <tqstring.h>
+#include <tqdatetime.h>
+#include <tqbrush.h>
+#include <tqcanvas.h>
+#include <tqptrlist.h>
+
+#include <kdatetimewidget.h>
+#include <kdebug.h>
+
+namespace KPlato
+{
+
+
+Project::Project(Node *parent)
+ : Node(parent),
+ m_accounts(*this),
+ m_baselined(false) {
+ //kdDebug()<<k_funcinfo<<"("<<this<<")"<<endl;
+ m_constraint = Node::MustStartOn;
+ m_standardWorktime = new StandardWorktime();
+ m_schedules.setAutoDelete(true);
+ init();
+}
+
+void Project::init() {
+ if (m_parent == 0) {
+ // set sensible defaults for a project wo parent
+ m_constraintStartTime = TQDateTime(TQDate::currentDate(), TQTime());
+ m_constraintEndTime = TQDateTime(m_constraintStartTime.addDays(1));
+ }
+ m_calendars.setAutoDelete(true);
+}
+
+
+Project::~Project() {
+ m_resourceGroups.setAutoDelete(true);
+ m_resourceGroups.clear();
+ delete m_standardWorktime;
+}
+
+int Project::type() const { return Node::Type_Project; }
+
+void Project::calculate(Schedule *schedule) {
+ if (schedule == 0) {
+ kdError()<<k_funcinfo<<"Schedule == 0, cannot calculate"<<endl;
+ return;
+ }
+ m_currentSchedule = schedule;
+ calculate();
+}
+
+void Project::calculate(Effort::Use estType) {
+ m_currentSchedule = findSchedule((Schedule::Type)estType);
+ if (m_currentSchedule == 0) {
+ m_currentSchedule = createSchedule(i18n("Standard"), (Schedule::Type)estType);
+ }
+ calculate();
+}
+
+void Project::calculate() {
+ if (m_currentSchedule == 0) {
+ kdError()<<k_funcinfo<<"No current schedule to calculate"<<endl;
+ return;
+ }
+ Effort::Use estType = (Effort::Use)m_currentSchedule->type();
+ if (type() == Type_Project) {
+ initiateCalculation(*m_currentSchedule);
+ if (m_constraint == Node::MustStartOn) {
+ //kdDebug()<<k_funcinfo<<"Node="<<m_name<<" Start="<<m_constraintStartTime.toString()<<endl;
+ m_currentSchedule->startTime = m_constraintStartTime;
+ m_currentSchedule->earliestStart = m_constraintStartTime;
+ // Calculate from start time
+ propagateEarliestStart(m_currentSchedule->earliestStart);
+ m_currentSchedule->latestFinish = calculateForward(estType);
+ propagateLatestFinish(m_currentSchedule->latestFinish);
+ calculateBackward(estType);
+ m_currentSchedule->endTime = scheduleForward(m_currentSchedule->startTime, estType);
+ calcCriticalPath(false);
+ } else {
+ //kdDebug()<<k_funcinfo<<"Node="<<m_name<<" End="<<m_constraintEndTime.toString()<<endl;
+ m_currentSchedule->endTime = m_constraintEndTime;
+ m_currentSchedule->latestFinish = m_constraintEndTime;
+ // Calculate from end time
+ propagateLatestFinish(m_currentSchedule->latestFinish);
+ m_currentSchedule->earliestStart = calculateBackward(estType);
+ propagateEarliestStart(m_currentSchedule->earliestStart);
+ calculateForward(estType);
+ m_currentSchedule->startTime = scheduleBackward(m_currentSchedule->endTime, estType);
+ calcCriticalPath(true);
+ }
+ makeAppointments();
+ calcResourceOverbooked();
+ m_currentSchedule->notScheduled = false;
+ } else if (type() == Type_Subproject) {
+ kdWarning()<<k_funcinfo<<"Subprojects not implemented"<<endl;
+ } else {
+ kdError()<<k_funcinfo<<"Illegal project type: "<<type()<<endl;
+ }
+}
+
+bool Project::calcCriticalPath(bool fromEnd) {
+ //kdDebug()<<k_funcinfo<<endl;
+ if (fromEnd) {
+ TQPtrListIterator<Node> startnodes = m_startNodes;
+ for (; startnodes.current(); ++startnodes) {
+ startnodes.current()->calcCriticalPath(fromEnd);
+ }
+ } else {
+ TQPtrListIterator<Node> endnodes = m_endNodes;
+ for (; endnodes.current(); ++endnodes) {
+ endnodes.current()->calcCriticalPath(fromEnd);
+ }
+ }
+ return false;
+}
+
+DateTime Project::startTime() const {
+ //kdDebug()<<k_funcinfo<<(m_currentSchedule?m_currentSchedule->id():-1)<<" "<<(m_currentSchedule?m_currentSchedule->typeToString():"")<<endl;
+ if (m_currentSchedule)
+ return m_currentSchedule->startTime;
+
+ return m_constraintStartTime;
+}
+
+DateTime Project::endTime() const {
+ //kdDebug()<<k_funcinfo<<(m_currentSchedule?m_currentSchedule->id():-1)<<" "<<(m_currentSchedule?m_currentSchedule->typeToString():"")<<endl;
+ if (m_currentSchedule)
+ return m_currentSchedule->endTime;
+
+ return m_constraintEndTime;
+}
+
+Duration *Project::getExpectedDuration() {
+ //kdDebug()<<k_funcinfo<<endl;
+ return new Duration(getLatestFinish() - getEarliestStart());
+}
+
+Duration *Project::getRandomDuration() {
+ return 0L;
+}
+
+DateTime Project::calculateForward(int use) {
+ //kdDebug()<<k_funcinfo<<m_name<<endl;
+ if (type() == Node::Type_Project) {
+ // Follow *parent* relations back and
+ // calculate forwards following the child relations
+ DateTime finish;
+ DateTime time;
+ TQPtrListIterator<Node> endnodes = m_endNodes;
+ for (; endnodes.current(); ++endnodes) {
+ time = endnodes.current()->calculateForward(use);
+ if (!finish.isValid() || time > finish)
+ finish = time;
+ }
+ //kdDebug()<<k_funcinfo<<m_name<<" finish="<<finish.toString()<<endl;
+ return finish;
+ } else {
+ //TODO: subproject
+ }
+ return DateTime();
+}
+
+DateTime Project::calculateBackward(int use) {
+ //kdDebug()<<k_funcinfo<<m_name<<endl;
+ if (type() == Node::Type_Project) {
+ // Follow *child* relations back and
+ // calculate backwards following parent relation
+ DateTime start;
+ DateTime time;
+ TQPtrListIterator<Node> startnodes = m_startNodes;
+ for (; startnodes.current(); ++startnodes) {
+ time = startnodes.current()->calculateBackward(use);
+ if (!start.isValid() || time < start)
+ start = time;
+ }
+ //kdDebug()<<k_funcinfo<<m_name<<" start="<<start.toString()<<endl;
+ return start;
+ } else {
+ //TODO: subproject
+ }
+ return DateTime();
+}
+
+DateTime Project::scheduleForward(const DateTime &earliest, int use) {
+ resetVisited();
+ DateTime end = earliest;
+ DateTime time;
+ TQPtrListIterator<Node> it(m_endNodes);
+ for (; it.current(); ++it) {
+ time = it.current()->scheduleForward(earliest, use);
+ if (time > end)
+ end = time;
+ }
+ // Fix summarytasks
+ adjustSummarytask();
+ return end;
+}
+
+DateTime Project::scheduleBackward(const DateTime &latest, int use) {
+ resetVisited();
+ DateTime start = latest;
+ DateTime time;
+ TQPtrListIterator<Node> it(m_startNodes);
+ for (; it.current(); ++it) {
+ time = it.current()->scheduleBackward(latest, use);
+ if (time < start)
+ start = time;
+ }
+ // Fix summarytasks
+ adjustSummarytask();
+ return start;
+}
+
+void Project::adjustSummarytask() {
+ TQPtrListIterator<Node> it(m_summarytasks);
+ for (; it.current(); ++it) {
+ it.current()->adjustSummarytask();
+ }
+}
+
+void Project::initiateCalculation(Schedule &sch) {
+ //kdDebug()<<k_funcinfo<<m_name<<endl;
+ // clear all resource appointments
+ m_visitedForward = false;
+ m_visitedBackward = false;
+ TQPtrListIterator<ResourceGroup> git(m_resourceGroups);
+ for ( ; git.current(); ++git ) {
+ git.current()->initiateCalculation(sch);
+ }
+ Node::initiateCalculation(sch);
+ m_startNodes.clear();
+ m_endNodes.clear();
+ m_summarytasks.clear();
+ initiateCalculationLists(m_startNodes, m_endNodes, m_summarytasks);
+}
+
+void Project::initiateCalculationLists(TQPtrList<Node> &startnodes, TQPtrList<Node> &endnodes, TQPtrList<Node> &summarytasks) {
+ //kdDebug()<<k_funcinfo<<m_name<<endl;
+ if (type() == Node::Type_Project) {
+ TQPtrListIterator<Node> it = childNodeIterator();
+ for (; it.current(); ++it) {
+ it.current()->initiateCalculationLists(startnodes, endnodes, summarytasks);
+ }
+ } else {
+ //TODO: subproject
+ }
+}
+
+bool Project::load(TQDomElement &element) {
+ //kdDebug()<<k_funcinfo<<"--->"<<endl;
+ TQString s;
+ bool ok = false;
+ TQString id = element.attribute("id");
+ if (!setId(id)) {
+ kdWarning()<<k_funcinfo<<"Id must be unique: "<<id<<endl;
+ }
+ m_name = element.attribute("name");
+ m_leader = element.attribute("leader");
+ m_description = element.attribute("description");
+
+ //m_baselined = (bool)element.attribute("baselined","0").toInt(&ok);FIXME: Removed for this release
+
+ // Allow for both numeric and text
+ s = element.attribute("scheduling","0");
+ m_constraint = (Node::ConstraintType)s.toInt(&ok);
+ if (!ok)
+ setConstraint(s);
+ if (m_constraint != Node::MustStartOn &&
+ m_constraint != Node::MustFinishOn) {
+ kdError()<<k_funcinfo<<"Illegal constraint: "<<constraintToString()<<endl;
+ setConstraint(Node::MustStartOn);
+ }
+ s = element.attribute("start-time");
+ if (!s.isEmpty())
+ m_constraintStartTime = DateTime::fromString(s);
+ s = element.attribute("end-time");
+ if (!s.isEmpty())
+ m_constraintEndTime = DateTime::fromString(s);
+
+ // Load the project children
+ // Must do these first
+ TQDomNodeList list = element.childNodes();
+ for (unsigned int i=0; i<list.count(); ++i) {
+ if (list.item(i).isElement()) {
+ TQDomElement e = list.item(i).toElement();
+ if (e.tagName() == "calendar") {
+ // Load the calendar.
+ // References by resources
+ Calendar *child = new Calendar();
+ child->setProject(this);
+ if (child->load(e)) {
+ addCalendar(child);
+ } else {
+ // TODO: Complain about this
+ kdError()<<k_funcinfo<<"Failed to load calendar"<<endl;
+ delete child;
+ }
+ } else if (e.tagName() == "standard-worktime") {
+ // Load standard worktime
+ StandardWorktime *child = new StandardWorktime();
+ if (child->load(e)) {
+ setStandardWorktime(child);
+ } else {
+ kdError()<<k_funcinfo<<"Failed to load standard worktime"<<endl;
+ delete child;
+ }
+ }
+ }
+ }
+ for (unsigned int i=0; i<list.count(); ++i) {
+ if (list.item(i).isElement()) {
+ TQDomElement e = list.item(i).toElement();
+
+ if (e.tagName() == "resource-group") {
+ // Load the resources
+ // References calendars
+ ResourceGroup *child = new ResourceGroup(this);
+ if (child->load(e)) {
+ addResourceGroup(child);
+ } else {
+ // TODO: Complain about this
+ delete child;
+ }
+ }
+ }
+ }
+ for (unsigned int i=0; i<list.count(); ++i) {
+ if (list.item(i).isElement()) {
+ TQDomElement e = list.item(i).toElement();
+
+ if (e.tagName() == "project") {
+ //kdDebug()<<k_funcinfo<<"Sub project--->"<<endl;
+ // Load the subproject
+ Project *child = new Project(this);
+ if (child->load(e)) {
+ if (!addTask(child, this)) {
+ delete child; // TODO: Complain about this
+ }
+ } else {
+ // TODO: Complain about this
+ delete child;
+ }
+ } else if (e.tagName() == "task") {
+ //kdDebug()<<k_funcinfo<<"Task--->"<<endl;
+ // Load the task (and resourcerequests).
+ // Depends on resources already loaded
+ Task *child = new Task(this);
+ if (child->load(e, *this)) {
+ if (!addTask(child, this)) {
+ delete child; // TODO: Complain about this
+ }
+ } else {
+ // TODO: Complain about this
+ delete child;
+ }
+ }
+ }
+ }
+ // These go last
+ for (unsigned int i=0; i<list.count(); ++i) {
+ if (list.item(i).isElement()) {
+ TQDomElement e = list.item(i).toElement();
+ if (e.tagName() == "accounts") {
+ //kdDebug()<<k_funcinfo<<"Accounts--->"<<endl;
+ // Load accounts
+ // References tasks
+ if (!m_accounts.load(e, *this)) {
+ kdError()<<k_funcinfo<<"Failed to load accounts"<<endl;
+ }
+ } else if (e.tagName() == "relation") {
+ //kdDebug()<<k_funcinfo<<"Relation--->"<<endl;
+ // Load the relation
+ // References tasks
+ Relation *child = new Relation();
+ if (!child->load(e, *this)) {
+ // TODO: Complain about this
+ kdError()<<k_funcinfo<<"Failed to load relation"<<endl;
+ delete child;
+ }
+ //kdDebug()<<k_funcinfo<<"Relation<---"<<endl;
+ } else if (e.tagName() == "schedules") {
+ //kdDebug()<<k_funcinfo<<"Project schedules & task appointments--->"<<endl;
+ // Prepare for multiple schedules
+ // References tasks and resources
+ TQDomNodeList lst = e.childNodes();
+ for (unsigned int i=0; i<lst.count(); ++i) {
+ if (lst.item(i).isElement()) {
+ TQDomElement el = lst.item(i).toElement();
+ if (el.tagName() == "schedule") {
+ MainSchedule *sch = new MainSchedule();
+ if (sch->loadXML(el, *this)) {
+ addSchedule(sch);
+ sch->setNode(this);
+ setParentSchedule(sch);
+ // If it's here, it's scheduled!
+ sch->setScheduled(true);
+ } else {
+ kdError()<<k_funcinfo<<"Failed to load schedule"<<endl;
+ delete sch;
+ }
+ }
+ }
+ }
+ //kdDebug()<<k_funcinfo<<"Node schedules<---"<<endl;
+ }
+ }
+ }
+ //kdDebug()<<k_funcinfo<<"Calendars--->"<<endl;
+ // calendars references calendars in arbritary saved order
+ TQPtrListIterator<Calendar> calit(m_calendars);
+ for (; calit.current(); ++calit) {
+ if (calit.current()->id() == calit.current()->parentId()) {
+ kdError()<<k_funcinfo<<"Calendar want itself as parent"<<endl;
+ continue;
+ }
+ calit.current()->setParent(calendar(calit.current()->parentId()));
+ }
+ //kdDebug()<<k_funcinfo<<"Project schedules--->"<<endl;
+ TQIntDictIterator<Schedule> it = m_schedules;
+ if (it.current()) {
+ if (m_constraint == Node::MustFinishOn)
+ m_constraintEndTime = it.current()->endTime;
+ else
+ m_constraintStartTime = it.current()->startTime;
+ }
+ //kdDebug()<<k_funcinfo<<"Project schedules<---"<<endl;
+ //kdDebug()<<k_funcinfo<<"<---"<<endl;
+ return true;
+}
+
+void Project::save(TQDomElement &element) const {
+ TQDomElement me = element.ownerDocument().createElement("project");
+ element.appendChild(me);
+
+ me.setAttribute("name", m_name);
+ me.setAttribute("leader", m_leader);
+ me.setAttribute("id", m_id);
+ me.setAttribute("description", m_description);
+
+ //me.setAttribute("baselined",(int)m_baselined); FIXME: Removed for this release
+
+ me.setAttribute("scheduling",constraintToString());
+ me.setAttribute("start-time", m_constraintStartTime.toString(Qt::ISODate));
+ me.setAttribute("end-time", m_constraintEndTime.toString(Qt::ISODate));
+
+ m_accounts.save(me);
+
+ // save calendars
+ TQPtrListIterator<Calendar> calit(m_calendars);
+ for (; calit.current(); ++calit) {
+ calit.current()->save(me);
+ }
+ // save standard worktime
+ if (m_standardWorktime)
+ m_standardWorktime->save(me);
+
+ // save project resources, must be after calendars
+ TQPtrListIterator<ResourceGroup> git(m_resourceGroups);
+ for ( ; git.current(); ++git ) {
+ git.current()->save(me);
+ }
+
+ // Only save parent relations
+ TQPtrListIterator<Relation> it(m_dependParentNodes);
+ for ( ; it.current(); ++it ) {
+ it.current()->save(me);
+ }
+
+ for (int i=0; i<numChildren(); i++)
+ // Save all children
+ getChildNode(i)->save(me);
+
+ // Now we can save relations assuming no tasks have relations outside the project
+ TQPtrListIterator<Node> nodes(m_nodes);
+ for ( ; nodes.current(); ++nodes ) {
+ nodes.current()->saveRelations(me);
+ }
+
+ if (!m_schedules.isEmpty()) {
+ TQDomElement el = me.ownerDocument().createElement("schedules");
+ me.appendChild(el);
+ TQIntDictIterator<Schedule> it = m_schedules;
+ for (; it.current(); ++it) {
+ if (!it.current()->isDeleted() && it.current()->isScheduled()) {
+ TQDomElement schs = el.ownerDocument().createElement("schedule");
+ el.appendChild(schs);
+ it.current()->saveXML(schs);
+ //kdDebug()<<k_funcinfo<<m_name<<" id="<<it.current()->id()<<(it.current()->isDeleted()?" Deleted":"")<<endl;
+ Node::saveAppointments(schs, it.current()->id());
+ }
+ }
+ }
+}
+
+void Project::setParentSchedule(Schedule *sch) {
+ TQPtrListIterator<Node> it = m_nodes;
+ for (; it.current(); ++it) {
+ it.current()->setParentSchedule(sch);
+ }
+}
+
+void Project::addResourceGroup(ResourceGroup * group) {
+ m_resourceGroups.append(group);
+}
+
+
+void Project::removeResourceGroup(ResourceGroup * group){
+ m_resourceGroups.remove(group);
+}
+
+
+void Project::removeResourceGroup(int /* number */){
+ // always auto remove
+}
+
+
+void Project::insertResourceGroup( unsigned int /* index */,
+ ResourceGroup * /* resource */) {
+}
+
+TQPtrList<ResourceGroup> &Project::resourceGroups() {
+ return m_resourceGroups;
+}
+
+bool Project::addTask( Node* task, Node* position )
+{
+ // we want to add a task at the given position. => the new node will
+ // become next sibling right after position.
+ if ( 0 == position ) {
+ kdError()<<k_funcinfo<<"position=0, could not add task: "<<task->name()<<endl;
+ return false;
+ }
+ //kdDebug()<<k_funcinfo<<"Add "<<task->name()<<" after "<<position->name()<<endl;
+ // in case we want to add to the main project, we make it child element
+ // of the root element.
+ if ( Node::Type_Project == position->type() ) {
+ return addSubTask(task, position);
+ }
+ // find the position
+ // we have to tell the parent that we want to delete one of its children
+ Node* parentNode = position->getParent();
+ if ( !parentNode ) {
+ kdDebug()<<k_funcinfo<<"parent node not found???"<<endl;
+ return false;
+ }
+ int index = parentNode->findChildNode( position );
+ if ( -1 == index ) {
+ // ok, it does not exist
+ kdDebug()<<k_funcinfo<<"Task not found???"<<endl;
+ return false;
+ }
+ return addSubTask(task, index+1, parentNode);
+}
+
+bool Project::addSubTask( Node* task, Node* position )
+{
+ // we want to add a subtask to the node "position". It will become
+ // position's last child.
+ if ( 0 == position ) {
+ kdError()<<k_funcinfo<<"No parent, can not add subtask: "<<task->name()<<endl;
+ return false;
+ }
+ if (!registerNodeId(task)) {
+ kdError()<<k_funcinfo<<"Failed to register node id, can not add subtask: "<<task->name()<<endl;
+ return false;
+ }
+ position->addChildNode(task);
+ return true;
+}
+
+bool Project::addSubTask( Node* task, int index, Node* parent )
+{
+ // we want to add a subtask to the node "parent" at the given index.
+ if ( 0 == parent ) {
+ kdError()<<k_funcinfo<<"No parent, can not add subtask: "<<task->name()<<endl;
+ return false;
+ }
+ if (!registerNodeId(task)) {
+ kdError()<<k_funcinfo<<"Failed to register node id, can not add subtask: "<<task->name()<<endl;
+ return false;
+ }
+ parent->insertChildNode(index, task);
+ return true;
+}
+
+void Project::delTask(Node *node)
+{
+ Node *parent = node->getParent();
+ if (parent == 0) {
+ kdDebug()<<k_funcinfo<<"Node must have a parent!"<<endl;
+ return;
+ }
+ removeId(node->id());
+ parent->delChildNode(node, false/*take*/);
+}
+
+bool Project::canIndentTask(Node* node)
+{
+ if (0 == node) {
+ // should always be != 0. At least we would get the Project,
+ // but you never know who might change that, so better be careful
+ return false;
+ }
+ if (node->type() == Node::Type_Project) {
+ //kdDebug()<<k_funcinfo<<"The root node cannot be indented"<<endl;
+ return false;
+ }
+ // we have to find the parent of task to manipulate its list of children
+ Node* parentNode = node->getParent();
+ if ( !parentNode ) {
+ return false;
+ }
+ if (parentNode->findChildNode(node) == -1) {
+ kdError()<<k_funcinfo<<"Tasknot found???"<<endl;
+ return false;
+ }
+ Node *sib = node->siblingBefore();
+ if (!sib) {
+ //kdDebug()<<k_funcinfo<<"new parent node not found"<<endl;
+ return false;
+ }
+ if (node->findParentRelation(sib) || node->findChildRelation(sib)) {
+ //kdDebug()<<k_funcinfo<<"Cannot have relations to parent"<<endl;
+ return false;
+ }
+ return true;
+}
+
+bool Project::indentTask( Node* node )
+{
+ if (canIndentTask(node)) {
+ Node *newParent = node->siblingBefore();
+ node->getParent()->delChildNode(node, false/*do not delete objekt*/);
+ newParent->addChildNode(node);
+ return true;
+ }
+ return false;
+}
+
+bool Project::canUnindentTask( Node* node )
+{
+ if ( 0 == node ) {
+ // is always != 0. At least we would get the Project, but you
+ // never know who might change that, so better be careful
+ return false;
+ }
+ if ( Node::Type_Project == node->type() ) {
+ //kdDebug()<<k_funcinfo<<"The root node cannot be unindented"<<endl;
+ return false;
+ }
+ // we have to find the parent of task to manipulate its list of children
+ // and we need the parent's parent too
+ Node* parentNode = node->getParent();
+ if ( !parentNode ) {
+ return false;
+ }
+ Node* grandParentNode = parentNode->getParent();
+ if ( !grandParentNode ) {
+ //kdDebug()<<k_funcinfo<<"This node already is at the top level"<<endl;
+ return false;
+ }
+ int index = parentNode->findChildNode( node );
+ if ( -1 == index ) {
+ kdError()<<k_funcinfo<<"Tasknot found???"<<endl;
+ return false;
+ }
+ return true;
+}
+
+bool Project::unindentTask( Node* node )
+{
+ if (canUnindentTask(node)) {
+ Node *parentNode = node->getParent();
+ Node *grandParentNode = parentNode->getParent();
+ parentNode->delChildNode(node, false/*do not delete objekt*/);
+ grandParentNode->addChildNode(node,parentNode);
+ return true;
+ }
+ return false;
+}
+
+bool Project::canMoveTaskUp( Node* node )
+{
+ if (node == 0)
+ return false; // safety
+ // we have to find the parent of task to manipulate its list of children
+ Node* parentNode = node->getParent();
+ if (!parentNode) {
+ //kdDebug()<<k_funcinfo<<"No parent found"<<endl;
+ return false;
+ }
+ if (parentNode->findChildNode(node) == -1) {
+ kdError()<<k_funcinfo<<"Tasknot found???"<<endl;
+ return false;
+ }
+ if (node->siblingBefore()) {
+ return true;
+ }
+ return false;
+}
+
+bool Project::moveTaskUp( Node* node )
+{
+ if (canMoveTaskUp(node)) {
+ return node->getParent()->moveChildUp(node);
+ }
+ return false;
+}
+
+bool Project::canMoveTaskDown( Node* node )
+{
+ if (node == 0)
+ return false; // safety
+ // we have to find the parent of task to manipulate its list of children
+ Node* parentNode = node->getParent();
+ if (!parentNode) {
+ return false;
+ }
+ if (parentNode->findChildNode(node) == -1) {
+ kdError()<<k_funcinfo<<"Tasknot found???"<<endl;
+ return false;
+ }
+ if (node->siblingAfter()) {
+ return true;
+ }
+ return false;
+}
+
+bool Project::moveTaskDown( Node* node )
+{
+ if (canMoveTaskDown(node)) {
+ return node->getParent()->moveChildDown(node);
+ }
+ return false;
+}
+
+Task *Project::createTask(Node* parent) {
+ Task* node = new Task(parent);
+ node->setId(uniqueNodeId());
+ return node;
+}
+
+Task *Project::createTask(Task &def, Node* parent) {
+ Task* node = new Task(def, parent);
+ node->setId(uniqueNodeId());
+ return node;
+}
+
+TQString Project::uniqueNodeId(int seed) {
+ int i = seed;
+ while (findNode(TQString("%1").arg(i))) {
+ ++i;
+ }
+ return TQString("%1").arg(i);
+}
+
+bool Project::removeId(const TQString &id) {
+ kdDebug()<<k_funcinfo<<"id="<<id<<endl;
+ return (m_parent ? m_parent->removeId(id) : nodeIdDict.remove(id));
+}
+
+void Project::insertId(const TQString &id, const Node *node) {
+ kdDebug()<<k_funcinfo<<"id="<<id<<" "<<node->name()<<endl;
+ m_parent ? m_parent->insertId(id, node) : nodeIdDict.insert(id, node);
+}
+
+bool Project::registerNodeId(Node *node) {
+ if (node->id().isEmpty()) {
+ kdError()<<k_funcinfo<<"Id is empty."<<endl;
+ return false;
+ }
+ Node *rn = findNode(node->id());
+ if (rn == 0) {
+ insertId(node->id(), node);
+ return true;
+ }
+ if (rn != node) {
+ kdError()<<k_funcinfo<<"Id allready exists for different task: "<<node->id()<<endl;
+ return false;
+ }
+ return true;
+}
+
+
+ResourceGroup *Project::group(TQString id) {
+ return findResourceGroup(id);
+}
+
+Resource *Project::resource(TQString id) {
+ return findResource(id);
+}
+
+// TODO
+EffortCostMap Project::plannedEffortCostPrDay(const TQDate &/*start*/, const TQDate &/*end*/) const {
+ //kdDebug()<<k_funcinfo<<endl;
+ EffortCostMap ec;
+ return ec;
+
+}
+
+// Returns the total planned effort for this project (or subproject)
+Duration Project::plannedEffort() {
+ //kdDebug()<<k_funcinfo<<endl;
+ Duration eff;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ eff += it.current()->plannedEffort();
+ }
+ return eff;
+}
+
+// Returns the total planned effort for this project (or subproject) on date
+Duration Project::plannedEffort(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ Duration eff;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ eff += it.current()->plannedEffort(date);
+ }
+ return eff;
+}
+
+// Returns the total planned effort for this project (or subproject) upto and including date
+Duration Project::plannedEffortTo(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ Duration eff;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ eff += it.current()->plannedEffortTo(date);
+ }
+ return eff;
+}
+
+// Returns the total actual effort for this project (or subproject)
+Duration Project::actualEffort() {
+ //kdDebug()<<k_funcinfo<<endl;
+ Duration eff;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ eff += it.current()->actualEffort();
+ }
+ return eff;
+}
+
+// Returns the total actual effort for this project (or subproject) on date
+Duration Project::actualEffort(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ Duration eff;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ eff += it.current()->actualEffort(date);
+ }
+ return eff;
+}
+
+// Returns the total actual effort for this project (or subproject) upto and including date
+Duration Project::actualEffortTo(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ Duration eff;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ eff += it.current()->actualEffortTo(date);
+ }
+ return eff;
+}
+
+double Project::plannedCost() {
+ //kdDebug()<<k_funcinfo<<endl;
+ double c = 0;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ c += it.current()->plannedCost();
+ }
+ return c;
+}
+
+// Returns the total planned effort for this project (or subproject) on date
+double Project::plannedCost(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ double c = 0;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ c += it.current()->plannedCost(date);
+ }
+ return c;
+}
+
+// Returns the total planned effort for this project (or subproject) upto and including date
+double Project::plannedCostTo(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ double c = 0;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ c += it.current()->plannedCostTo(date);
+ }
+ return c;
+}
+
+double Project::actualCost() {
+ //kdDebug()<<k_funcinfo<<endl;
+ double c = 0;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ c += it.current()->actualCost();
+ }
+ return c;
+}
+
+// Returns the total planned effort for this project (or subproject) on date
+double Project::actualCost(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ double c = 0;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ c += it.current()->actualCost(date);
+ }
+ return c;
+}
+
+// Returns the total planned effort for this project (or subproject) upto and including date
+double Project::actualCostTo(const TQDate &date) {
+ //kdDebug()<<k_funcinfo<<endl;
+ double c = 0;
+ TQPtrListIterator<Node> it(childNodeIterator());
+ for (; it.current(); ++it) {
+ c += it.current()->actualCostTo(date);
+ }
+ return c;
+}
+
+void Project::addCalendar(Calendar *calendar) {
+ //kdDebug()<<k_funcinfo<<calendar->name()<<endl;
+ m_calendars.append(calendar);
+}
+
+Calendar *Project::calendar(const TQString id) const {
+ return findCalendar(id);
+}
+
+TQPtrList<Calendar> Project::calendars() {
+ TQPtrList<Calendar> list;
+ TQPtrListIterator<Calendar> it = m_calendars;
+ for (; it.current(); ++it) {
+ if (!it.current()->isDeleted()) {
+ list.append(it.current());
+ }
+ }
+ return list;
+}
+
+void Project::setStandardWorktime(StandardWorktime * worktime) {
+ if (m_standardWorktime != worktime) {
+ delete m_standardWorktime;
+ m_standardWorktime = worktime;
+ }
+}
+
+bool Project::legalToLink(Node *par, Node *child) {
+ //kdDebug()<<k_funcinfo<<par.name()<<" ("<<par.numDependParentNodes()<<" parents) "<<child.name()<<" ("<<child.numDependChildNodes()<<" children)"<<endl;
+
+ if (!child || par->isDependChildOf(child)) {
+ return false;
+ }
+ bool legal = true;
+ // see if par/child is related
+ if (par->isParentOf(child) || child->isParentOf(par)) {
+ legal = false;
+ }
+ if (legal)
+ legal = legalChildren(par, child);
+ if (legal)
+ legal = legalParents(par, child);
+
+ return legal;
+}
+
+bool Project::legalParents(Node *par, Node *child) {
+ bool legal = true;
+ //kdDebug()<<k_funcinfo<<par->name()<<" ("<<par->numDependParentNodes()<<" parents) "<<child->name()<<" ("<<child->numDependChildNodes()<<" children)"<<endl;
+ for (int i=0; i < par->numDependParentNodes() && legal; ++i) {
+ Node *pNode = par->getDependParentNode(i)->parent();
+ if (child->isParentOf(pNode) || pNode->isParentOf(child)) {
+ //kdDebug()<<k_funcinfo<<"Found: "<<pNode->name()<<" is related to "<<child->name()<<endl;
+ legal = false;
+ } else {
+ legal = legalChildren(pNode, child);
+ }
+ if (legal)
+ legal = legalParents(pNode, child);
+ }
+ return legal;
+}
+
+bool Project::legalChildren(Node *par, Node *child) {
+ bool legal = true;
+ //kdDebug()<<k_funcinfo<<par->name()<<" ("<<par->numDependParentNodes()<<" parents) "<<child->name()<<" ("<<child->numDependChildNodes()<<" children)"<<endl;
+ for (int j=0; j < child->numDependChildNodes() && legal; ++j) {
+ Node *cNode = child->getDependChildNode(j)->child();
+ if (par->isParentOf(cNode) || cNode->isParentOf(par)) {
+ //kdDebug()<<k_funcinfo<<"Found: "<<par->name()<<" is related to "<<cNode->name()<<endl;
+ legal = false;
+ } else {
+ legal = legalChildren(par, cNode);
+ }
+ }
+ return legal;
+}
+
+void Project::generateWBS(int count, WBSDefinition &def, TQString wbs) {
+ if (type() == Type_Subproject || def.level0Enabled()) {
+ Node::generateWBS(count, def, wbs);
+ } else {
+ TQPtrListIterator<Node> it = m_nodes;
+ for (int i=0; it.current(); ++it) {
+ it.current()->generateWBS(++i, def, m_wbs);
+ }
+ }
+}
+
+void Project::setCurrentSchedule(long id) {
+ setCurrentSchedulePtr(findSchedule(id));
+ Node::setCurrentSchedule(id);
+ TQDictIterator<Resource> it = resourceIdDict;
+ for (; it.current(); ++it) {
+ it.current()->setCurrentSchedule(id);
+ }
+}
+
+MainSchedule *Project::createSchedule(TQString name, Schedule::Type type) {
+ //kdDebug()<<k_funcinfo<<"No of schedules: "<<m_schedules.count()<<endl;
+ long i=1;
+ while (m_schedules.find(i)) {
+ ++i;
+ }
+ MainSchedule *sch = new MainSchedule(this, name, type, i);
+ addSchedule(sch);
+ return sch;
+}
+
+bool Project::removeCalendarId(const TQString &id) {
+ kdDebug()<<k_funcinfo<<"id="<<id<<endl;
+ return calendarIdDict.remove(id);
+}
+
+void Project::insertCalendarId(const TQString &id, const Calendar *calendar) {
+ kdDebug()<<k_funcinfo<<"id="<<id<<": "<<calendar->name()<<endl;
+ calendarIdDict.insert(id, calendar);
+}
+
+#ifndef NDEBUG
+void Project::printDebug(bool children, TQCString indent) {
+
+ kdDebug()<<indent<<"+ Project node: "<<name()<<endl;
+ indent += "!";
+ TQPtrListIterator<ResourceGroup> it(resourceGroups());
+ for ( ; it.current(); ++it)
+ it.current()->printDebug(indent);
+
+ Node::printDebug(children, indent);
+}
+void Project::printCalendarDebug(TQCString indent) {
+ kdDebug()<<indent<<"-------- Calendars debug printout --------"<<endl;
+ TQPtrListIterator<Calendar> it = m_calendars;
+ for (; it.current(); ++it) {
+ it.current()->printDebug(indent + "--");
+ kdDebug()<<endl;
+ }
+ if (m_standardWorktime)
+ m_standardWorktime->printDebug();
+}
+#endif
+
+} //KPlato namespace