summaryrefslogtreecommitdiffstats
path: root/kplato/kpttask.cc
diff options
context:
space:
mode:
Diffstat (limited to 'kplato/kpttask.cc')
-rw-r--r--kplato/kpttask.cc200
1 files changed, 100 insertions, 100 deletions
diff --git a/kplato/kpttask.cc b/kplato/kpttask.cc
index 255bf9486..f4b29f79e 100644
--- a/kplato/kpttask.cc
+++ b/kplato/kpttask.cc
@@ -28,14 +28,14 @@
#include "kpteffortcostmap.h"
#include "kptschedule.h"
-#include <qdom.h>
-#include <qbrush.h>
+#include <tqdom.h>
+#include <tqbrush.h>
#include <kdebug.h>
namespace KPlato
{
-Task::Task(Node *parent) : Node(parent), m_resource() {
+Task::Task(Node *tqparent) : Node(tqparent), m_resource() {
//kdDebug()<<k_funcinfo<<"("<<this<<")"<<endl;
m_resource.setAutoDelete(true);
Duration d(1, 0, 0);
@@ -52,8 +52,8 @@ Task::Task(Node *parent) : Node(parent), m_resource() {
m_childProxyRelations.setAutoDelete(true);
}
-Task::Task(Task &task, Node *parent)
- : Node(task, parent),
+Task::Task(Task &task, Node *tqparent)
+ : Node(task, tqparent),
m_resource() {
//kdDebug()<<k_funcinfo<<"("<<this<<")"<<endl;
m_resource.setAutoDelete(true);
@@ -97,7 +97,7 @@ Duration *Task::getRandomDuration() {
ResourceGroupRequest *Task::resourceGroupRequest(ResourceGroup *group) const {
if (m_requests)
- return m_requests->find(group);
+ return m_requests->tqfind(group);
return 0;
}
@@ -148,7 +148,7 @@ void Task::makeAppointments() {
//kdDebug()<<k_funcinfo<<m_name<<": "<<m_currentSchedule->startTime<<", "<<m_currentSchedule->endTime<<"; "<<m_currentSchedule->duration.toString()<<endl;
}
} else if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> nit(m_nodes);
+ TQPtrListIterator<Node> nit(m_nodes);
for ( ; nit.current(); ++nit ) {
nit.current()->makeAppointments();
}
@@ -169,9 +169,9 @@ void Task::setConstraint(Node::ConstraintType type) {
}
-bool Task::load(QDomElement &element, Project &project) {
+bool Task::load(TQDomElement &element, Project &project) {
// Load attributes (TODO: Handle different types of tasks, milestone, summary...)
- QString s;
+ TQString s;
bool ok = false;
m_id = element.attribute("id");
@@ -181,7 +181,7 @@ bool Task::load(QDomElement &element, Project &project) {
//kdDebug()<<k_funcinfo<<m_name<<": id="<<m_id<<endl;
// Allow for both numeric and text
- QString constraint = element.attribute("scheduling","0");
+ TQString constraint = element.attribute("scheduling","0");
m_constraint = (Node::ConstraintType)constraint.toInt(&ok);
if (!ok)
Node::setConstraint(constraint); // hmmm, why do I need Node::?
@@ -198,11 +198,11 @@ bool Task::load(QDomElement &element, Project &project) {
m_wbs = element.attribute("wbs", "");
- // Load the project children
- QDomNodeList list = element.childNodes();
+ // Load the project tqchildren
+ TQDomNodeList list = element.childNodes();
for (unsigned int i=0; i<list.count(); ++i) {
if (list.item(i).isElement()) {
- QDomElement e = list.item(i).toElement();
+ TQDomElement e = list.item(i).toElement();
if (e.tagName() == "project") {
// Load the subproject
@@ -254,10 +254,10 @@ bool Task::load(QDomElement &element, Project &project) {
m_progress.remainingEffort = Duration::fromString(e.attribute("remaining-effort"));
m_progress.totalPerformed = Duration::fromString(e.attribute("performed-effort"));
} else if (e.tagName() == "schedules") {
- QDomNodeList lst = e.childNodes();
+ TQDomNodeList lst = e.childNodes();
for (unsigned int i=0; i<lst.count(); ++i) {
if (lst.item(i).isElement()) {
- QDomElement el = lst.item(i).toElement();
+ TQDomElement el = lst.item(i).toElement();
if (el.tagName() == "schedule") {
NodeSchedule *sch = new NodeSchedule();
if (sch->loadXML(el)) {
@@ -278,8 +278,8 @@ bool Task::load(QDomElement &element, Project &project) {
}
-void Task::save(QDomElement &element) const {
- QDomElement me = element.ownerDocument().createElement("task");
+void Task::save(TQDomElement &element) const {
+ TQDomElement me = element.ownerDocument().createElement("task");
element.appendChild(me);
//TODO: Handle different types of tasks, milestone, summary...
@@ -299,7 +299,7 @@ void Task::save(QDomElement &element) const {
m_effort->save(me);
- QDomElement el = me.ownerDocument().createElement("progress");
+ TQDomElement el = me.ownerDocument().createElement("progress");
me.appendChild(el);
el.setAttribute("started", m_progress.started);
el.setAttribute("finished", m_progress.finished);
@@ -310,9 +310,9 @@ void Task::save(QDomElement &element) const {
el.setAttribute("performed-effort", m_progress.totalPerformed.toString());
if (!m_schedules.isEmpty()) {
- QDomElement schs = me.ownerDocument().createElement("schedules");
+ TQDomElement schs = me.ownerDocument().createElement("schedules");
me.appendChild(schs);
- QIntDictIterator<Schedule> it = m_schedules;
+ TQIntDictIterator<Schedule> it = m_schedules;
for (; it.current(); ++it) {
if (!it.current()->isDeleted()) {
it.current()->saveXML(schs);
@@ -327,19 +327,19 @@ void Task::save(QDomElement &element) const {
}
}
-void Task::saveAppointments(QDomElement &element, long id) const {
+void Task::saveAppointments(TQDomElement &element, long id) const {
//kdDebug()<<k_funcinfo<<m_name<<" id="<<id<<endl;
Schedule *sch = findSchedule(id);
if (sch) {
sch->saveAppointments(element);
}
- QPtrListIterator<Node> it(m_nodes);
+ TQPtrListIterator<Node> it(m_nodes);
for (; it.current(); ++it ) {
it.current()->saveAppointments(element, id);
}
}
-EffortCostMap Task::plannedEffortCostPrDay(const QDate &start, const QDate &end) const {
+EffortCostMap Task::plannedEffortCostPrDay(const TQDate &start, const TQDate &end) const {
//kdDebug()<<k_funcinfo<<m_name<<endl;
if (m_currentSchedule) {
return m_currentSchedule->plannedEffortCostPrDay(start, end);
@@ -352,7 +352,7 @@ Duration Task::plannedEffort() {
//kdDebug()<<k_funcinfo<<endl;
Duration eff;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
eff += it.current()->plannedEffort();
}
@@ -363,11 +363,11 @@ Duration Task::plannedEffort() {
}
// Returns the total planned effort for this task (or subtasks) on date
-Duration Task::plannedEffort(const QDate &date) {
+Duration Task::plannedEffort(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
Duration eff;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
eff += it.current()->plannedEffort(date);
}
@@ -378,11 +378,11 @@ Duration Task::plannedEffort(const QDate &date) {
}
// Returns the total planned effort for this task (or subtasks) upto and including date
-Duration Task::plannedEffortTo(const QDate &date) {
+Duration Task::plannedEffortTo(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
Duration eff;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
eff += it.current()->plannedEffortTo(date);
}
@@ -397,7 +397,7 @@ Duration Task::actualEffort() {
//kdDebug()<<k_funcinfo<<endl;
Duration eff;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
eff += it.current()->actualEffort();
}
@@ -412,11 +412,11 @@ Duration Task::actualEffort() {
}
// Returns the total planned effort for this task (or subtasks) on date
-Duration Task::actualEffort(const QDate &date) {
+Duration Task::actualEffort(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
Duration eff;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
eff += it.current()->actualEffort(date);
}
@@ -427,11 +427,11 @@ Duration Task::actualEffort(const QDate &date) {
}
// Returns the total planned effort for this task (or subtasks) on date
-Duration Task::actualEffortTo(const QDate &date) {
+Duration Task::actualEffortTo(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
Duration eff;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
eff += it.current()->actualEffortTo(date);
}
@@ -445,7 +445,7 @@ double Task::plannedCost() {
//kdDebug()<<k_funcinfo<<endl;
double c = 0;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
c += it.current()->plannedCost();
}
@@ -455,11 +455,11 @@ double Task::plannedCost() {
return c;
}
-double Task::plannedCost(const QDate &date) {
+double Task::plannedCost(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
double c = 0;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
c += it.current()->plannedCost(date);
}
@@ -469,11 +469,11 @@ double Task::plannedCost(const QDate &date) {
return c;
}
-double Task::plannedCostTo(const QDate &date) {
+double Task::plannedCostTo(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
double c = 0;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
c += it.current()->plannedCostTo(date);
}
@@ -487,7 +487,7 @@ double Task::actualCost() {
//kdDebug()<<k_funcinfo<<endl;
double c = 0;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
c += it.current()->actualCost();
}
@@ -497,11 +497,11 @@ double Task::actualCost() {
return c;
}
-double Task::actualCost(const QDate &date) {
+double Task::actualCost(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
double c = 0;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
c += it.current()->actualCost(date);
}
@@ -511,11 +511,11 @@ double Task::actualCost(const QDate &date) {
return c;
}
-double Task::actualCostTo(const QDate &date) {
+double Task::actualCostTo(const TQDate &date) {
//kdDebug()<<k_funcinfo<<endl;
double c = 0;
if (type() == Node::Type_Summarytask) {
- QPtrListIterator<Node> it(childNodeIterator());
+ TQPtrListIterator<Node> it(childNodeIterator());
for (; it.current(); ++it) {
c += it.current()->actualCostTo(date);
}
@@ -526,7 +526,7 @@ double Task::actualCostTo(const QDate &date) {
}
//FIXME Handle summarytasks
-double Task::effortPerformanceIndex(const QDate &date, bool *error) {
+double Task::effortPerformanceIndex(const TQDate &date, bool *error) {
double res = 0.0;
Duration ae = actualEffortTo(date);
@@ -541,9 +541,9 @@ double Task::effortPerformanceIndex(const QDate &date, bool *error) {
}
//FIXME Handle summarytasks
-double Task::costPerformanceIndex(const QDate &date, bool *error) {
+double Task::costPerformanceIndex(const TQDate &date, bool *error) {
double res = 0.0;
- Duration ac = Q_INT64(actualCostTo(date));
+ Duration ac = TQ_INT64(actualCostTo(date));
bool e = (ac == Duration::zeroDuration || m_progress.percentFinished == 0);
if (error) {
@@ -566,13 +566,13 @@ void Task::initiateCalculation(Schedule &sch) {
}
-void Task::initiateCalculationLists(QPtrList<Node> &startnodes, QPtrList<Node> &endnodes, QPtrList<Node> &summarytasks/*, QPtrList<Node> &milestones*/) {
+void Task::initiateCalculationLists(TQPtrList<Node> &startnodes, TQPtrList<Node> &endnodes, TQPtrList<Node> &summarytasks/*, TQPtrList<Node> &milestones*/) {
//kdDebug()<<k_funcinfo<<m_name<<endl;
if (type() == Node::Type_Summarytask) {
summarytasks.append(this);
- // propagate my relations to my children and dependent nodes
+ // propagate my relations to my tqchildren and dependent nodes
- QPtrListIterator<Node> nodes = m_nodes;
+ TQPtrListIterator<Node> nodes = m_nodes;
for (; nodes.current(); ++nodes) {
if (!dependParentNodes().isEmpty())
nodes.current()->addParentProxyRelations(dependParentNodes());
@@ -592,19 +592,19 @@ void Task::initiateCalculationLists(QPtrList<Node> &startnodes, QPtrList<Node> &
}
}
-DateTime Task::calculatePredeccessors(const QPtrList<Relation> &list, int use) {
+DateTime Task::calculatePredeccessors(const TQPtrList<Relation> &list, int use) {
DateTime time;
- QPtrListIterator<Relation> it = list;
+ TQPtrListIterator<Relation> it = list;
for (; it.current(); ++it) {
- if (it.current()->parent()->type() == Type_Summarytask) {
- //kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->parent()->name()<<endl;
+ if (it.current()->tqparent()->type() == Type_Summarytask) {
+ //kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->tqparent()->name()<<endl;
continue; // skip summarytasks
}
- DateTime t = it.current()->parent()->calculateForward(use); // early finish
+ DateTime t = it.current()->tqparent()->calculateForward(use); // early finish
switch (it.current()->type()) {
case Relation::StartStart:
// I can't start earlier than my predesseccor
- t = it.current()->parent()->getEarliestStart() + it.current()->lag();
+ t = it.current()->tqparent()->getEarliestStart() + it.current()->lag();
break;
case Relation::FinishFinish:
// I can't finish earlier than my predeccessor, so
@@ -718,12 +718,12 @@ DateTime Task::calculateForward(int use) {
return cs->earliestStart + m_durationForward;
}
-DateTime Task::calculateSuccessors(const QPtrList<Relation> &list, int use) {
+DateTime Task::calculateSuccessors(const TQPtrList<Relation> &list, int use) {
DateTime time;
- QPtrListIterator<Relation> it = list;
+ TQPtrListIterator<Relation> it = list;
for (; it.current(); ++it) {
if (it.current()->child()->type() == Type_Summarytask) {
- //kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->parent()->name()<<endl;
+ //kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->tqparent()->name()<<endl;
continue; // skip summarytasks
}
DateTime t = it.current()->child()->calculateBackward(use);
@@ -844,21 +844,21 @@ DateTime Task::calculateBackward(int use) {
return cs->latestFinish - m_durationBackward;
}
-DateTime Task::schedulePredeccessors(const QPtrList<Relation> &list, int use) {
+DateTime Task::schedulePredeccessors(const TQPtrList<Relation> &list, int use) {
DateTime time;
- QPtrListIterator<Relation> it = list;
+ TQPtrListIterator<Relation> it = list;
for (; it.current(); ++it) {
- if (it.current()->parent()->type() == Type_Summarytask) {
- //kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->parent()->name()<<endl;
+ if (it.current()->tqparent()->type() == Type_Summarytask) {
+ //kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->tqparent()->name()<<endl;
continue; // skip summarytasks
}
// schedule the predecessors
- DateTime earliest = it.current()->parent()->getEarliestStart();
- DateTime t = it.current()->parent()->scheduleForward(earliest, use);
+ DateTime earliest = it.current()->tqparent()->getEarliestStart();
+ DateTime t = it.current()->tqparent()->scheduleForward(earliest, use);
switch (it.current()->type()) {
case Relation::StartStart:
// I can't start before my predesseccor
- t = it.current()->parent()->startTime() + it.current()->lag();
+ t = it.current()->tqparent()->startTime() + it.current()->lag();
break;
case Relation::FinishFinish:
// I can't end before my predecessor, so
@@ -893,7 +893,7 @@ DateTime Task::scheduleForward(const DateTime &earliest, int use) {
cs->startTime = time;
//kdDebug()<<k_funcinfo<<m_name<<" new startime="<<cs->startTime<<endl;
}
- // Then my parents
+ // Then my tqparents
time = schedulePredeccessors(m_parentProxyRelations, use);
if (time.isValid() && time > cs->startTime) {
cs->startTime = time;
@@ -1042,9 +1042,9 @@ DateTime Task::scheduleForward(const DateTime &earliest, int use) {
return cs->endTime;
}
-DateTime Task::scheduleSuccessors(const QPtrList<Relation> &list, int use) {
+DateTime Task::scheduleSuccessors(const TQPtrList<Relation> &list, int use) {
DateTime time;
- QPtrListIterator<Relation> it = list;
+ TQPtrListIterator<Relation> it = list;
for (; it.current(); ++it) {
if (it.current()->child()->type() == Type_Summarytask) {
//kdDebug()<<k_funcinfo<<"Skip summarytask: "<<it.current()->child()->name()<<endl;
@@ -1087,7 +1087,7 @@ DateTime Task::scheduleBackward(const DateTime &latest, int use) {
if (time.isValid() && time < cs->endTime) {
cs->endTime = time;
}
- // Then my parents
+ // Then my tqparents
time = scheduleSuccessors(m_childProxyRelations, use);
if (time.isValid() && time < cs->endTime) {
cs->endTime = time;
@@ -1243,7 +1243,7 @@ void Task::adjustSummarytask() {
if (type() == Type_Summarytask) {
DateTime start = m_currentSchedule->latestFinish;
DateTime end = m_currentSchedule->earliestStart;
- QPtrListIterator<Node> it(m_nodes);
+ TQPtrListIterator<Node> it(m_nodes);
for (; it.current(); ++it) {
it.current()->adjustSummarytask();
if (it.current()->startTime() < start)
@@ -1290,42 +1290,42 @@ void Task::clearProxyRelations() {
m_childProxyRelations.clear();
}
-void Task::addParentProxyRelations(QPtrList<Relation> &list) {
+void Task::addParentProxyRelations(TQPtrList<Relation> &list) {
//kdDebug()<<k_funcinfo<<m_name<<endl;
if (type() == Type_Summarytask) {
- // propagate to my children
+ // propagate to my tqchildren
//kdDebug()<<k_funcinfo<<m_name<<" is summary task"<<endl;
- QPtrListIterator<Node> nodes = m_nodes;
+ TQPtrListIterator<Node> nodes = m_nodes;
for (; nodes.current(); ++nodes) {
nodes.current()->addParentProxyRelations(list);
nodes.current()->addParentProxyRelations(dependParentNodes());
}
} else {
- // add 'this' as child relation to the relations parent
+ // add 'this' as child relation to the relations tqparent
//kdDebug()<<k_funcinfo<<m_name<<" is not summary task"<<endl;
- QPtrListIterator<Relation> it = list;
+ TQPtrListIterator<Relation> it = list;
for (; it.current(); ++it) {
- it.current()->parent()->addChildProxyRelation(this, it.current());
- // add a parent relation to myself
- addParentProxyRelation(it.current()->parent(), it.current());
+ it.current()->tqparent()->addChildProxyRelation(this, it.current());
+ // add a tqparent relation to myself
+ addParentProxyRelation(it.current()->tqparent(), it.current());
}
}
}
-void Task::addChildProxyRelations(QPtrList<Relation> &list) {
+void Task::addChildProxyRelations(TQPtrList<Relation> &list) {
//kdDebug()<<k_funcinfo<<m_name<<endl;
if (type() == Type_Summarytask) {
- // propagate to my children
+ // propagate to my tqchildren
//kdDebug()<<k_funcinfo<<m_name<<" is summary task"<<endl;
- QPtrListIterator<Node> nodes = m_nodes;
+ TQPtrListIterator<Node> nodes = m_nodes;
for (; nodes.current(); ++nodes) {
nodes.current()->addChildProxyRelations(list);
nodes.current()->addChildProxyRelations(dependChildNodes());
}
} else {
- // add 'this' as parent relation to the relations child
+ // add 'this' as tqparent relation to the relations child
//kdDebug()<<k_funcinfo<<m_name<<" is not summary task"<<endl;
- QPtrListIterator<Relation> it = list;
+ TQPtrListIterator<Relation> it = list;
for (; it.current(); ++it) {
it.current()->child()->addParentProxyRelation(this, it.current());
// add a child relation to myself
@@ -1337,13 +1337,13 @@ void Task::addChildProxyRelations(QPtrList<Relation> &list) {
void Task::addParentProxyRelation(Node *node, const Relation *rel) {
if (node->type() != Type_Summarytask) {
if (type() == Type_Summarytask) {
- //kdDebug()<<"Add parent proxy from my children "<<m_name<<" to "<<node->name()<<endl;
- QPtrListIterator<Node> nodes = m_nodes;
+ //kdDebug()<<"Add tqparent proxy from my tqchildren "<<m_name<<" to "<<node->name()<<endl;
+ TQPtrListIterator<Node> nodes = m_nodes;
for (; nodes.current(); ++nodes) {
nodes.current()->addParentProxyRelation(node, rel);
}
} else {
- //kdDebug()<<"Add parent proxy from "<<node->name()<<" to (me) "<<m_name<<endl;
+ //kdDebug()<<"Add tqparent proxy from "<<node->name()<<" to (me) "<<m_name<<endl;
m_parentProxyRelations.append(new ProxyRelation(node, this, rel->type(), rel->lag()));
}
}
@@ -1352,8 +1352,8 @@ void Task::addParentProxyRelation(Node *node, const Relation *rel) {
void Task::addChildProxyRelation(Node *node, const Relation *rel) {
if (node->type() != Type_Summarytask) {
if (type() == Type_Summarytask) {
- //kdDebug()<<"Add child proxy from my children "<<m_name<<" to "<<node->name()<<endl;
- QPtrListIterator<Node> nodes = m_nodes;
+ //kdDebug()<<"Add child proxy from my tqchildren "<<m_name<<" to "<<node->name()<<endl;
+ TQPtrListIterator<Node> nodes = m_nodes;
for (; nodes.current(); ++nodes) {
nodes.current()->addChildProxyRelation(node, rel);
}
@@ -1365,12 +1365,12 @@ void Task::addChildProxyRelation(Node *node, const Relation *rel) {
}
bool Task::isEndNode() const {
- QPtrListIterator<Relation> it = m_dependChildNodes;
+ TQPtrListIterator<Relation> it = m_dependChildNodes;
for (; it.current(); ++it) {
if (it.current()->type() == Relation::FinishStart)
return false;
}
- QPtrListIterator<Relation> pit = m_childProxyRelations;
+ TQPtrListIterator<Relation> pit = m_childProxyRelations;
for (; pit.current(); ++pit) {
if (pit.current()->type() == Relation::FinishStart)
return false;
@@ -1378,13 +1378,13 @@ bool Task::isEndNode() const {
return true;
}
bool Task::isStartNode() const {
- QPtrListIterator<Relation> it = m_dependParentNodes;
+ TQPtrListIterator<Relation> it = m_dependParentNodes;
for (; it.current(); ++it) {
if (it.current()->type() == Relation::FinishStart ||
it.current()->type() == Relation::StartStart)
return false;
}
- QPtrListIterator<Relation> pit = m_parentProxyRelations;
+ TQPtrListIterator<Relation> pit = m_parentProxyRelations;
for (; pit.current(); ++pit) {
if (pit.current()->type() == Relation::FinishStart ||
pit.current()->type() == Relation::StartStart)
@@ -1477,13 +1477,13 @@ bool Task::calcCriticalPath(bool fromEnd) {
//kdDebug()<<k_funcinfo<<m_name<<" end node"<<endl;
return true;
}
- QPtrListIterator<Relation> it(m_childProxyRelations);
+ TQPtrListIterator<Relation> it(m_childProxyRelations);
for (; it.current(); ++it) {
if (it.current()->child()->calcCriticalPath(fromEnd)) {
m_currentSchedule->inCriticalPath = true;
}
}
- QPtrListIterator<Relation> pit(m_dependChildNodes);
+ TQPtrListIterator<Relation> pit(m_dependChildNodes);
for (; pit.current(); ++pit) {
if (pit.current()->child()->calcCriticalPath(fromEnd)) {
m_currentSchedule->inCriticalPath = true;
@@ -1495,15 +1495,15 @@ bool Task::calcCriticalPath(bool fromEnd) {
//kdDebug()<<k_funcinfo<<m_name<<" start node"<<endl;
return true;
}
- QPtrListIterator<Relation> it(m_parentProxyRelations);
+ TQPtrListIterator<Relation> it(m_parentProxyRelations);
for (; it.current(); ++it) {
- if (it.current()->parent()->calcCriticalPath(fromEnd)) {
+ if (it.current()->tqparent()->calcCriticalPath(fromEnd)) {
m_currentSchedule->inCriticalPath = true;
}
}
- QPtrListIterator<Relation> pit(m_dependParentNodes);
+ TQPtrListIterator<Relation> pit(m_dependParentNodes);
for (; pit.current(); ++pit) {
- if (pit.current()->parent()->calcCriticalPath(fromEnd)) {
+ if (pit.current()->tqparent()->calcCriticalPath(fromEnd)) {
m_currentSchedule->inCriticalPath = true;
}
}
@@ -1525,7 +1525,7 @@ bool Task::effortMetError() const {
}
#ifndef NDEBUG
-void Task::printDebug(bool children, QCString indent) {
+void Task::printDebug(bool tqchildren, TQCString indent) {
kdDebug()<<indent<<"+ Task node: "<<name()<<" type="<<type()<<endl;
indent += "! ";
kdDebug()<<indent<<"Requested resources (total): "<<units()<<"%"<<endl;
@@ -1533,7 +1533,7 @@ void Task::printDebug(bool children, QCString indent) {
if (m_requests)
m_requests->printDebug(indent);
- Node::printDebug(children, indent);
+ Node::printDebug(tqchildren, indent);
}
generated by cgit v1.2.3 (git 2.46.0) at 2025-10-09 15:30:53 +0000