#include <kptnode.h>
|
| enum | ConstraintType {
ASAP
, ALAP
, MustStartOn
, MustFinishOn
,
StartNotEarlier
, FinishNotLater
, FixedInterval
} |
| enum | NodeTypes {
Type_Node = 0
, Type_Project = 1
, Type_Subproject = 2
, Type_Task = 3
,
Type_Milestone = 4
, Type_Periodic = 5
, Type_Summarytask = 6
} |
|
| | Node (Node *parent=0) |
| | Node (Node &node, Node *parent=0) |
| bool | setId (TQString id) |
| TQString | id () const |
| virtual int | type () const =0 |
| virtual Node * | projectNode () |
| virtual bool | load (TQDomElement &) |
| virtual bool | load (TQDomElement &, Project &) |
| virtual void | save (TQDomElement &element) const =0 |
| virtual void | saveRelations (TQDomElement &element) const |
| Node * | getParent () const |
| void | setParent (Node *newParent) |
| const TQPtrList< Node > & | childNodeIterator () const |
| int | numChildren () const |
| virtual void | addChildNode (Node *node, Node *after=0) |
| virtual void | insertChildNode (unsigned int index, Node *node) |
| void | delChildNode (Node *node, bool remove=true) |
| void | delChildNode (int number, bool remove=true) |
| Node * | getChildNode (int number) |
| const Node * | getChildNode (int number) const |
| int | findChildNode (Node *node) |
| int | numDependChildNodes () const |
| virtual void | addDependChildNode (Node *node, Relation::Type p=Relation::FinishStart) |
| virtual void | addDependChildNode (Node *node, Relation::Type p, Duration lag) |
| virtual bool | addDependChildNode (Relation *relation) |
| virtual void | insertDependChildNode (unsigned int index, Node *node, Relation::Type p=Relation::FinishStart) |
| void | delDependChildNode (Node *node, bool remove=false) |
| void | delDependChildNode (Relation *rel, bool remove=false) |
| void | delDependChildNode (int number, bool remove=false) |
| Relation * | getDependChildNode (int number) |
| TQPtrList< Relation > & | dependChildNodes () |
| void | takeDependChildNode (Relation *rel) |
| int | numDependParentNodes () const |
| virtual void | addDependParentNode (Node *node, Relation::Type p=Relation::FinishStart) |
| virtual void | addDependParentNode (Node *node, Relation::Type p, Duration lag) |
| virtual bool | addDependParentNode (Relation *relation) |
| virtual void | insertDependParentNode (unsigned int index, Node *node, Relation::Type p=Relation::FinishStart) |
| void | delDependParentNode (Node *node, bool remove=false) |
| void | delDependParentNode (Relation *rel, bool remove=false) |
| void | delDependParentNode (int number, bool remove=false) |
| Relation * | getDependParentNode (int number) |
| TQPtrList< Relation > & | dependParentNodes () |
| void | takeDependParentNode (Relation *rel) |
| bool | isParentOf (Node *node) |
| bool | isDependChildOf (Node *node) |
| Relation * | findParentRelation (Node *node) |
| Relation * | findChildRelation (Node *node) |
| Relation * | findRelation (Node *node) |
| void | setStartTime (DateTime startTime) |
| virtual DateTime | startTime () const |
| const TQDate & | startDate () const |
| void | setEndTime (DateTime endTime) |
| virtual DateTime | endTime () const |
| const TQDate & | endDate () const |
| void | setEffort (Effort *e) |
| Effort * | effort () const |
| virtual Duration * | getExpectedDuration ()=0 |
| virtual Duration * | getRandomDuration ()=0 |
| Duration * | getDelay () |
| DateTime | getEarliestStart () const |
| void | setEarliestStart (const DateTime &dt) |
| DateTime | getLatestFinish () const |
| void | setLatestFinish (const DateTime &dt) |
| TQString & | name () |
| TQString & | leader () |
| TQString & | description () |
| const TQString & | name () const |
| const TQString & | leader () const |
| const TQString & | description () const |
| void | setName (const TQString &n) |
| void | setLeader (const TQString &l) |
| void | setDescription (const TQString &d) |
| virtual void | setConstraint (Node::ConstraintType type) |
| void | setConstraint (TQString &type) |
| int | constraint () const |
| TQString | constraintToString () const |
| virtual void | setConstraintStartTime (TQDateTime time) |
| virtual void | setConstraintEndTime (TQDateTime time) |
| virtual DateTime | constraintStartTime () const |
| virtual DateTime | constraintEndTime () const |
| virtual DateTime | startNotEarlier () const |
| virtual DateTime | finishNotLater () const |
| virtual DateTime | mustStartOn () const |
| virtual DateTime | mustFinishOn () const |
| virtual ResourceGroupRequest * | resourceRequest (ResourceGroup *) const |
| virtual void | makeAppointments () |
| bool | resourceError () const |
| virtual bool | resourceOverbooked () const |
| virtual TQStringList | overbookedResources () const |
| virtual void | calcResourceOverbooked () |
| bool | resourceNotAvailable () const |
| virtual bool | schedulingError () const |
| bool | notScheduled () const |
| virtual EffortCostMap | plannedEffortCostPrDay (const TQDate &start, const TQDate &end) const =0 |
| virtual Duration | plannedEffort () |
| virtual Duration | plannedEffort (const TQDate &) |
| virtual Duration | plannedEffortTo (const TQDate &) |
| virtual Duration | actualEffort () |
| virtual Duration | actualEffort (const TQDate &) |
| virtual Duration | actualEffortTo (const TQDate &) |
| virtual double | plannedCost () |
| virtual double | plannedCost (const TQDate &) |
| virtual double | plannedCostTo (const TQDate &) |
| virtual double | actualCost () |
| virtual double | actualCost (const TQDate &) |
| virtual double | actualCostTo (const TQDate &) |
| double | effortPerformanceIndex (const TQDate &, bool *) |
| double | costPerformanceIndex (const TQDate &, bool *) |
| virtual void | initiateCalculationLists (TQPtrList< Node > &startnodes, TQPtrList< Node > &endnodes, TQPtrList< Node > &summarytasks)=0 |
| virtual DateTime | calculateForward (int)=0 |
| virtual DateTime | calculateBackward (int)=0 |
| virtual DateTime | scheduleForward (const DateTime &, int)=0 |
| virtual DateTime | scheduleBackward (const DateTime &, int)=0 |
| virtual void | adjustSummarytask ()=0 |
| virtual void | initiateCalculation (Schedule &sch) |
| virtual void | resetVisited () |
| void | propagateEarliestStart (DateTime &time) |
| void | propagateLatestFinish (DateTime &time) |
| void | moveEarliestStart (DateTime &time) |
| void | moveLatestFinish (DateTime &time) |
| virtual Duration | summarytaskDurationForward (const DateTime &) |
| virtual DateTime | summarytaskEarliestStart () |
| virtual Duration | summarytaskDurationBackward (const DateTime &) |
| virtual DateTime | summarytaskLatestFinish () |
| const Duration & | duration () |
| Duration | duration (const DateTime &time, int use, bool backward) |
| virtual Duration | calcDuration (const DateTime &, const Duration &, bool) |
| Node * | siblingBefore () |
| Node * | childBefore (Node *node) |
| Node * | siblingAfter () |
| Node * | childAfter (Node *node) |
| bool | moveChildUp (Node *node) |
| bool | moveChildDown (Node *node) |
| bool | legalToLink (Node *node) |
| virtual bool | legalToLink (Node *, Node *) |
| virtual bool | isEndNode () const |
| virtual bool | isStartNode () const |
| virtual void | clearProxyRelations () |
| virtual void | addParentProxyRelations (TQPtrList< Relation > &) |
| virtual void | addChildProxyRelations (TQPtrList< Relation > &) |
| virtual void | addParentProxyRelation (Node *, const Relation *) |
| virtual void | addChildProxyRelation (Node *, const Relation *) |
| virtual void | saveAppointments (TQDomElement &element, long id) const |
| TQPtrList< Appointment > | appointments () |
| virtual bool | addAppointment (Appointment *appointment) |
| virtual bool | addAppointment (Appointment *appointment, Schedule &main) |
| virtual void | addAppointment (ResourceSchedule *resource, DateTime &start, DateTime &end, double load=100) |
| virtual Node * | findNode () const |
| virtual Node * | findNode (const TQString &id) const |
| virtual bool | removeId () |
| virtual bool | removeId (const TQString &id) |
| virtual void | insertId (const TQString &id) |
| virtual void | insertId (const TQString &id, const Node *node) |
| virtual DateTime | workStartTime () const |
| void | setWorkStartTime (const DateTime &dt) |
| virtual DateTime | workEndTime () const |
| void | setWorkEndTime (const DateTime &dt) |
| virtual bool | isCritical () const |
| virtual bool | inCriticalPath () const |
| virtual bool | calcCriticalPath (bool fromEnd) |
| virtual int | level () |
| virtual void | generateWBS (int count, WBSDefinition &def, TQString wbs=TQString()) |
| TQString | wbs () const |
| double | startupCost () const |
| void | setStartupCost (double cost) |
| Account * | startupAccount () const |
| void | setStartupAccount (Account *acc) |
| double | shutdownCost () const |
| void | setShutdownCost (double cost) |
| Account * | shutdownAccount () const |
| void | setShutdownAccount (Account *acc) |
| Account * | runningAccount () const |
| void | setRunningAccount (Account *acc) |
| Schedule * | currentSchedule () const |
| virtual void | setCurrentSchedule (long id) |
| void | setCurrentSchedulePtr (Schedule *schedule) |
| TQIntDict< Schedule > & | schedules () |
| Schedule * | findSchedule (const TQString name, const Schedule::Type type) const |
| Schedule * | findSchedule (const Schedule::Type type) const |
| Schedule * | findSchedule (long id) const |
| void | takeSchedule (const Schedule *schedule) |
| void | addSchedule (Schedule *schedule) |
| Schedule * | createSchedule (TQString name, Schedule::Type type, long id) |
| Schedule * | createSchedule (Schedule *parent) |
| void | setScheduleDeleted (long id, bool onoff) |
| virtual void | setParentSchedule (Schedule *sch) |
| DateTime | startTime () |
| DateTime | endTime () |
| virtual void | printDebug (bool children, TQCString indent) |
This class represents any node in the project, a node can be a project or a subproject or any task.
This class is basically an abstract interface to make the design more OO.
Definition at line 57 of file kptnode.h.
◆ ConstraintType
| enum KPlato::Node::ConstraintType |
◆ NodeTypes
| enum KPlato::Node::NodeTypes |
◆ Node() [1/2]
| KPlato::Node::Node |
( |
Node * | parent = 0 | ) |
|
◆ Node() [2/2]
| KPlato::Node::Node |
( |
Node & | node, |
|
|
Node * | parent = 0 ) |
◆ ~Node()
◆ actualCost() [1/2]
| virtual double KPlato::Node::actualCost |
( |
| ) |
|
|
inlinevirtual |
◆ actualCost() [2/2]
| virtual double KPlato::Node::actualCost |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ actualCostTo()
| virtual double KPlato::Node::actualCostTo |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ actualEffort() [1/2]
| virtual Duration KPlato::Node::actualEffort |
( |
| ) |
|
|
inlinevirtual |
◆ actualEffort() [2/2]
| virtual Duration KPlato::Node::actualEffort |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ actualEffortTo()
| virtual Duration KPlato::Node::actualEffortTo |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ addAppointment() [1/3]
| bool KPlato::Node::addAppointment |
( |
Appointment * | appointment | ) |
|
|
virtual |
Return appointment this node have with resource.
Adds appointment to this node only (not to resource)
Definition at line 636 of file kptnode.cpp.
◆ addAppointment() [2/3]
Adds appointment to this node only (not to resource).
Definition at line 642 of file kptnode.cpp.
◆ addAppointment() [3/3]
Adds appointment to both this node and resource.
Definition at line 652 of file kptnode.cpp.
◆ addChildNode()
| void KPlato::Node::addChildNode |
( |
Node * | node, |
|
|
Node * | after = 0 ) |
|
virtual |
◆ addChildProxyRelation()
| virtual void KPlato::Node::addChildProxyRelation |
( |
Node * | , |
|
|
const Relation * | ) |
|
inlinevirtual |
◆ addChildProxyRelations()
| virtual void KPlato::Node::addChildProxyRelations |
( |
TQPtrList< Relation > & | | ) |
|
|
inlinevirtual |
◆ addDependChildNode() [1/3]
| void KPlato::Node::addDependChildNode |
( |
Node * | node, |
|
|
Relation::Type | p, |
|
|
Duration | lag ) |
|
virtual |
Adds relation to both this node and address node.
Definition at line 187 of file kptnode.cpp.
◆ addDependChildNode() [2/3]
| void KPlato::Node::addDependChildNode |
( |
Node * | node, |
|
|
Relation::Type | p = Relation::FinishStart ) |
|
virtual |
Adds relation to both this node and address node.
Definition at line 183 of file kptnode.cpp.
◆ addDependChildNode() [3/3]
| bool KPlato::Node::addDependChildNode |
( |
Relation * | relation | ) |
|
|
virtual |
Adds relation only to this node.
Definition at line 203 of file kptnode.cpp.
◆ addDependParentNode() [1/3]
| void KPlato::Node::addDependParentNode |
( |
Node * | node, |
|
|
Relation::Type | p, |
|
|
Duration | lag ) |
|
virtual |
Adds relation to both this node and node.
Definition at line 246 of file kptnode.cpp.
◆ addDependParentNode() [2/3]
| void KPlato::Node::addDependParentNode |
( |
Node * | node, |
|
|
Relation::Type | p = Relation::FinishStart ) |
|
virtual |
Adds relation to both this node and node.
Definition at line 242 of file kptnode.cpp.
◆ addDependParentNode() [3/3]
| bool KPlato::Node::addDependParentNode |
( |
Relation * | relation | ) |
|
|
virtual |
Adds relation only to this node.
Definition at line 262 of file kptnode.cpp.
◆ addParentProxyRelation()
| virtual void KPlato::Node::addParentProxyRelation |
( |
Node * | , |
|
|
const Relation * | ) |
|
inlinevirtual |
◆ addParentProxyRelations()
| virtual void KPlato::Node::addParentProxyRelations |
( |
TQPtrList< Relation > & | | ) |
|
|
inlinevirtual |
◆ addSchedule()
| void KPlato::Node::addSchedule |
( |
Schedule * | schedule | ) |
|
Add schedule to list, replace if schedule with same id allready exists.
Definition at line 668 of file kptnode.cpp.
◆ adjustSummarytask()
| virtual void KPlato::Node::adjustSummarytask |
( |
| ) |
|
|
pure virtual |
◆ appointments()
| TQPtrList< Appointment > KPlato::Node::appointments |
( |
| ) |
|
Return the list of appointments for current schedule.
Definition at line 624 of file kptnode.cpp.
◆ calcCriticalPath()
| bool KPlato::Node::calcCriticalPath |
( |
bool | fromEnd | ) |
|
|
virtual |
◆ calcDuration()
◆ calcResourceOverbooked()
| void KPlato::Node::calcResourceOverbooked |
( |
| ) |
|
|
virtual |
Calculates if the assigned resource is overbooked within the duration of this node.
Reimplemented in KPlato::Task.
Definition at line 376 of file kptnode.cpp.
◆ calculateBackward()
| virtual DateTime KPlato::Node::calculateBackward |
( |
int | | ) |
|
|
pure virtual |
◆ calculateForward()
| virtual DateTime KPlato::Node::calculateForward |
( |
int | | ) |
|
|
pure virtual |
◆ childAfter()
| Node * KPlato::Node::childAfter |
( |
Node * | node | ) |
|
◆ childBefore()
| Node * KPlato::Node::childBefore |
( |
Node * | node | ) |
|
◆ childNodeIterator()
| const TQPtrList< Node > & KPlato::Node::childNodeIterator |
( |
| ) |
const |
|
inline |
◆ clearProxyRelations()
| virtual void KPlato::Node::clearProxyRelations |
( |
| ) |
|
|
inlinevirtual |
◆ constraint()
| int KPlato::Node::constraint |
( |
| ) |
const |
|
inline |
◆ constraintEndTime()
| virtual DateTime KPlato::Node::constraintEndTime |
( |
| ) |
const |
|
inlinevirtual |
◆ constraintStartTime()
| virtual DateTime KPlato::Node::constraintStartTime |
( |
| ) |
const |
|
inlinevirtual |
◆ constraintToString()
| TQString KPlato::Node::constraintToString |
( |
| ) |
const |
◆ costPerformanceIndex()
| double KPlato::Node::costPerformanceIndex |
( |
const TQDate & | , |
|
|
bool * | ) |
|
inline |
Cost performance index.
Definition at line 322 of file kptnode.h.
◆ createSchedule() [1/2]
◆ createSchedule() [2/2]
| Schedule * KPlato::Node::createSchedule |
( |
TQString | name, |
|
|
Schedule::Type | type, |
|
|
long | id ) |
◆ currentSchedule()
| Schedule * KPlato::Node::currentSchedule |
( |
| ) |
const |
|
inline |
◆ delChildNode() [1/2]
| void KPlato::Node::delChildNode |
( |
int | number, |
|
|
bool | remove = true ) |
◆ delChildNode() [2/2]
| void KPlato::Node::delChildNode |
( |
Node * | node, |
|
|
bool | remove = true ) |
◆ delDependChildNode() [1/3]
| void KPlato::Node::delDependChildNode |
( |
int | number, |
|
|
bool | remove = false ) |
◆ delDependChildNode() [2/3]
| void KPlato::Node::delDependChildNode |
( |
Node * | node, |
|
|
bool | remove = false ) |
◆ delDependChildNode() [3/3]
| void KPlato::Node::delDependChildNode |
( |
Relation * | rel, |
|
|
bool | remove = false ) |
◆ delDependParentNode() [1/3]
| void KPlato::Node::delDependParentNode |
( |
int | number, |
|
|
bool | remove = false ) |
◆ delDependParentNode() [2/3]
| void KPlato::Node::delDependParentNode |
( |
Node * | node, |
|
|
bool | remove = false ) |
◆ delDependParentNode() [3/3]
| void KPlato::Node::delDependParentNode |
( |
Relation * | rel, |
|
|
bool | remove = false ) |
◆ dependChildNodes()
| TQPtrList< Relation > & KPlato::Node::dependChildNodes |
( |
| ) |
|
|
inline |
◆ dependParentNodes()
| TQPtrList< Relation > & KPlato::Node::dependParentNodes |
( |
| ) |
|
|
inline |
◆ description() [1/2]
| TQString & KPlato::Node::description |
( |
| ) |
|
|
inline |
◆ description() [2/2]
| const TQString & KPlato::Node::description |
( |
| ) |
const |
|
inline |
◆ duration() [1/2]
| const Duration & KPlato::Node::duration |
( |
| ) |
|
|
inline |
◆ duration() [2/2]
| Duration KPlato::Node::duration |
( |
const DateTime & | time, |
|
|
int | use, |
|
|
bool | backward ) |
Calculates and returns the duration of the node.
Uses the correct expected-, optimistic- or pessimistic effort dependent on use. - Parameters
-
| time | Where to start calculation. |
| use | Calculate using expected-, optimistic- or pessimistic estimate. |
| backward | If true, time specifies when the task should end. |
Definition at line 350 of file kptnode.cpp.
◆ effort()
| Effort * KPlato::Node::effort |
( |
| ) |
const |
|
inline |
◆ effortPerformanceIndex()
| double KPlato::Node::effortPerformanceIndex |
( |
const TQDate & | , |
|
|
bool * | ) |
|
inline |
◆ endDate()
| const TQDate & KPlato::Node::endDate |
( |
| ) |
const |
|
inline |
◆ endTime() [1/2]
◆ endTime() [2/2]
| virtual DateTime KPlato::Node::endTime |
( |
| ) |
const |
|
inlinevirtual |
◆ findChildNode()
| int KPlato::Node::findChildNode |
( |
Node * | node | ) |
|
◆ findChildRelation()
| Relation * KPlato::Node::findChildRelation |
( |
Node * | node | ) |
|
◆ findNode() [1/2]
| virtual Node * KPlato::Node::findNode |
( |
| ) |
const |
|
inlinevirtual |
Find the node with my id.
Definition at line 399 of file kptnode.h.
◆ findNode() [2/2]
| virtual Node * KPlato::Node::findNode |
( |
const TQString & | id | ) |
const |
|
inlinevirtual |
◆ findParentRelation()
| Relation * KPlato::Node::findParentRelation |
( |
Node * | node | ) |
|
◆ findRelation()
| Relation * KPlato::Node::findRelation |
( |
Node * | node | ) |
|
◆ findSchedule() [1/3]
| Schedule * KPlato::Node::findSchedule |
( |
const Schedule::Type | type | ) |
const |
Find schedule matching type. Does not return deleted schedule.
Definition at line 698 of file kptnode.cpp.
◆ findSchedule() [2/3]
| Schedule * KPlato::Node::findSchedule |
( |
const TQString | name, |
|
|
const Schedule::Type | type ) const |
Find schedule matching name and type. Does not return deleted schedule.
Definition at line 688 of file kptnode.cpp.
◆ findSchedule() [3/3]
| Schedule * KPlato::Node::findSchedule |
( |
long | id | ) |
const |
|
inline |
Find schedule matching id. Also returns deleted schedule.
Definition at line 472 of file kptnode.h.
◆ finishNotLater()
| virtual DateTime KPlato::Node::finishNotLater |
( |
| ) |
const |
|
inlinevirtual |
◆ generateWBS()
| void KPlato::Node::generateWBS |
( |
int | count, |
|
|
WBSDefinition & | def, |
|
|
TQString | wbs = TQString() ) |
|
virtual |
◆ getChildNode() [1/2]
| Node * KPlato::Node::getChildNode |
( |
int | number | ) |
|
|
inline |
◆ getChildNode() [2/2]
| const Node * KPlato::Node::getChildNode |
( |
int | number | ) |
const |
◆ getDelay()
Calculate the delay of this node.
It is the difference between the actual startTime and scheduled startTime.
Definition at line 176 of file kptnode.cpp.
◆ getDependChildNode()
| Relation * KPlato::Node::getDependChildNode |
( |
int | number | ) |
|
|
inline |
◆ getDependParentNode()
| Relation * KPlato::Node::getDependParentNode |
( |
int | number | ) |
|
|
inline |
◆ getEarliestStart()
| DateTime KPlato::Node::getEarliestStart |
( |
| ) |
const |
|
inline |
getEarliestStart() returns earliest time this node can start given the constraints of the network.
- See also
- earliestStart
Definition at line 209 of file kptnode.h.
◆ getExpectedDuration()
| virtual Duration * KPlato::Node::getExpectedDuration |
( |
| ) |
|
|
pure virtual |
◆ getLatestFinish()
| DateTime KPlato::Node::getLatestFinish |
( |
| ) |
const |
|
inline |
◆ getParent()
| Node * KPlato::Node::getParent |
( |
| ) |
const |
|
inline |
◆ getRandomDuration()
| virtual Duration * KPlato::Node::getRandomDuration |
( |
| ) |
|
|
pure virtual |
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.
Implemented in KPlato::Project, and KPlato::Task.
◆ id()
| TQString KPlato::Node::id |
( |
| ) |
const |
|
inline |
◆ inCriticalPath()
| virtual bool KPlato::Node::inCriticalPath |
( |
| ) |
const |
|
inlinevirtual |
◆ initiateCalculation()
| void KPlato::Node::initiateCalculation |
( |
Schedule & | sch | ) |
|
|
virtual |
◆ initiateCalculationLists()
| virtual void KPlato::Node::initiateCalculationLists |
( |
TQPtrList< Node > & | startnodes, |
|
|
TQPtrList< Node > & | endnodes, |
|
|
TQPtrList< Node > & | summarytasks ) |
|
pure virtual |
◆ insertChildNode()
| void KPlato::Node::insertChildNode |
( |
unsigned int | index, |
|
|
Node * | node ) |
|
virtual |
◆ insertDependChildNode()
| void KPlato::Node::insertDependChildNode |
( |
unsigned int | index, |
|
|
Node * | node, |
|
|
Relation::Type | p = Relation::FinishStart ) |
|
virtual |
Inserts relation to this node at index address index and appends relation to address node.
Definition at line 195 of file kptnode.cpp.
◆ insertDependParentNode()
| void KPlato::Node::insertDependParentNode |
( |
unsigned int | index, |
|
|
Node * | node, |
|
|
Relation::Type | p = Relation::FinishStart ) |
|
virtual |
Inserts relation to this node at index and appends relation to node.
Definition at line 254 of file kptnode.cpp.
◆ insertId() [1/2]
| virtual void KPlato::Node::insertId |
( |
const TQString & | id | ) |
|
|
inlinevirtual |
Insert myself into the id register.
Definition at line 409 of file kptnode.h.
◆ insertId() [2/2]
| virtual void KPlato::Node::insertId |
( |
const TQString & | id, |
|
|
const Node * | node ) |
|
inlinevirtual |
◆ isCritical()
| virtual bool KPlato::Node::isCritical |
( |
| ) |
const |
|
inlinevirtual |
◆ isDependChildOf()
| bool KPlato::Node::isDependChildOf |
( |
Node * | node | ) |
|
◆ isEndNode()
| bool KPlato::Node::isEndNode |
( |
| ) |
const |
|
virtual |
◆ isParentOf()
| bool KPlato::Node::isParentOf |
( |
Node * | node | ) |
|
◆ isStartNode()
| bool KPlato::Node::isStartNode |
( |
| ) |
const |
|
virtual |
◆ leader() [1/2]
| TQString & KPlato::Node::leader |
( |
| ) |
|
|
inline |
◆ leader() [2/2]
| const TQString & KPlato::Node::leader |
( |
| ) |
const |
|
inline |
◆ legalToLink() [1/2]
| virtual bool KPlato::Node::legalToLink |
( |
Node * | , |
|
|
Node * | ) |
|
inlinevirtual |
Check if node par can be linked to node child. (Reimplement).
Reimplemented in KPlato::Project.
Definition at line 374 of file kptnode.h.
◆ legalToLink() [2/2]
| bool KPlato::Node::legalToLink |
( |
Node * | node | ) |
|
Check if this node can be linked to node.
Definition at line 559 of file kptnode.cpp.
◆ level()
| int KPlato::Node::level |
( |
| ) |
|
|
virtual |
Returns the level this node is in the hierarchy. Top node is level 0.
Definition at line 753 of file kptnode.cpp.
◆ load() [1/2]
| virtual bool KPlato::Node::load |
( |
TQDomElement & | | ) |
|
|
inlinevirtual |
◆ load() [2/2]
| virtual bool KPlato::Node::load |
( |
TQDomElement & | , |
|
|
Project & | ) |
|
inlinevirtual |
◆ makeAppointments()
| void KPlato::Node::makeAppointments |
( |
| ) |
|
|
virtual |
◆ moveChildDown()
| bool KPlato::Node::moveChildDown |
( |
Node * | node | ) |
|
◆ moveChildUp()
| bool KPlato::Node::moveChildUp |
( |
Node * | node | ) |
|
◆ moveEarliestStart()
| void KPlato::Node::moveEarliestStart |
( |
DateTime & | time | ) |
|
◆ moveLatestFinish()
| void KPlato::Node::moveLatestFinish |
( |
DateTime & | time | ) |
|
◆ mustFinishOn()
| virtual DateTime KPlato::Node::mustFinishOn |
( |
| ) |
const |
|
inlinevirtual |
◆ mustStartOn()
| virtual DateTime KPlato::Node::mustStartOn |
( |
| ) |
const |
|
inlinevirtual |
◆ name() [1/2]
| TQString & KPlato::Node::name |
( |
| ) |
|
|
inline |
◆ name() [2/2]
| const TQString & KPlato::Node::name |
( |
| ) |
const |
|
inline |
◆ notScheduled()
| bool KPlato::Node::notScheduled |
( |
| ) |
const |
|
inline |
The node has not been scheduled.
Definition at line 277 of file kptnode.h.
◆ numChildren()
| int KPlato::Node::numChildren |
( |
| ) |
const |
|
inline |
◆ numDependChildNodes()
| int KPlato::Node::numDependChildNodes |
( |
| ) |
const |
|
inline |
◆ numDependParentNodes()
| int KPlato::Node::numDependParentNodes |
( |
| ) |
const |
|
inline |
◆ overbookedResources()
| TQStringList KPlato::Node::overbookedResources |
( |
| ) |
const |
|
virtual |
Return a list of overbooked resources.
Definition at line 383 of file kptnode.cpp.
◆ plannedCost() [1/2]
| virtual double KPlato::Node::plannedCost |
( |
| ) |
|
|
inlinevirtual |
◆ plannedCost() [2/2]
| virtual double KPlato::Node::plannedCost |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ plannedCostTo()
| virtual double KPlato::Node::plannedCostTo |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
Planned cost from start of activity up to and including date is the sum of all resource costs and other costs planned for this node.
Reimplemented in KPlato::Project, and KPlato::Task.
Definition at line 308 of file kptnode.h.
◆ plannedEffort() [1/2]
| virtual Duration KPlato::Node::plannedEffort |
( |
| ) |
|
|
inlinevirtual |
◆ plannedEffort() [2/2]
| virtual Duration KPlato::Node::plannedEffort |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ plannedEffortCostPrDay()
| virtual EffortCostMap KPlato::Node::plannedEffortCostPrDay |
( |
const TQDate & | start, |
|
|
const TQDate & | end ) const |
|
pure virtual |
◆ plannedEffortTo()
| virtual Duration KPlato::Node::plannedEffortTo |
( |
const TQDate & | | ) |
|
|
inlinevirtual |
◆ printDebug()
| void KPlato::Node::printDebug |
( |
bool | children, |
|
|
TQCString | indent ) |
|
virtual |
◆ projectNode()
| Node * KPlato::Node::projectNode |
( |
| ) |
|
|
virtual |
Returns a pointer to the project node (main- or sub-project) Returns 0 if no project exists.
Definition at line 109 of file kptnode.cpp.
◆ propagateEarliestStart()
| void KPlato::Node::propagateEarliestStart |
( |
DateTime & | time | ) |
|
◆ propagateLatestFinish()
| void KPlato::Node::propagateLatestFinish |
( |
DateTime & | time | ) |
|
◆ removeId() [1/2]
| virtual bool KPlato::Node::removeId |
( |
| ) |
|
|
inlinevirtual |
Remove myself from the id register.
Definition at line 404 of file kptnode.h.
◆ removeId() [2/2]
| virtual bool KPlato::Node::removeId |
( |
const TQString & | id | ) |
|
|
inlinevirtual |
◆ resetVisited()
| void KPlato::Node::resetVisited |
( |
| ) |
|
|
virtual |
◆ resourceError()
| bool KPlato::Node::resourceError |
( |
| ) |
const |
|
inline |
EffortType == Effort, but no resource is requested.
Definition at line 260 of file kptnode.h.
◆ resourceNotAvailable()
| bool KPlato::Node::resourceNotAvailable |
( |
| ) |
const |
|
inline |
The requested resource is not available.
Definition at line 271 of file kptnode.h.
◆ resourceOverbooked()
| virtual bool KPlato::Node::resourceOverbooked |
( |
| ) |
const |
|
inlinevirtual |
The assigned resource is overbooked.
Definition at line 263 of file kptnode.h.
◆ resourceRequest()
| virtual ResourceGroupRequest * KPlato::Node::resourceRequest |
( |
ResourceGroup * | | ) |
const |
|
inlinevirtual |
◆ runningAccount()
| Account * KPlato::Node::runningAccount |
( |
| ) |
const |
|
inline |
◆ save()
| virtual void KPlato::Node::save |
( |
TQDomElement & | element | ) |
const |
|
pure virtual |
◆ saveAppointments()
| void KPlato::Node::saveAppointments |
( |
TQDomElement & | element, |
|
|
long | id ) const |
|
virtual |
◆ saveRelations()
| void KPlato::Node::saveRelations |
( |
TQDomElement & | element | ) |
const |
|
virtual |
Save my and my childrens relations.
Definition at line 387 of file kptnode.cpp.
◆ scheduleBackward()
◆ scheduleForward()
◆ schedules()
| TQIntDict< Schedule > & KPlato::Node::schedules |
( |
| ) |
|
|
inline |
◆ schedulingError()
| virtual bool KPlato::Node::schedulingError |
( |
| ) |
const |
|
inlinevirtual |
The task cannot be scheduled to fullfill all the constraints.
Definition at line 274 of file kptnode.h.
◆ setConstraint() [1/2]
| virtual void KPlato::Node::setConstraint |
( |
Node::ConstraintType | type | ) |
|
|
inlinevirtual |
◆ setConstraint() [2/2]
| void KPlato::Node::setConstraint |
( |
TQString & | type | ) |
|
◆ setConstraintEndTime()
| virtual void KPlato::Node::setConstraintEndTime |
( |
TQDateTime | time | ) |
|
|
inlinevirtual |
◆ setConstraintStartTime()
| virtual void KPlato::Node::setConstraintStartTime |
( |
TQDateTime | time | ) |
|
|
inlinevirtual |
◆ setCurrentSchedule()
| void KPlato::Node::setCurrentSchedule |
( |
long | id | ) |
|
|
virtual |
◆ setCurrentSchedulePtr()
| void KPlato::Node::setCurrentSchedulePtr |
( |
Schedule * | schedule | ) |
|
|
inline |
◆ setDescription()
| void KPlato::Node::setDescription |
( |
const TQString & | d | ) |
|
|
inline |
◆ setEarliestStart()
| void KPlato::Node::setEarliestStart |
( |
const DateTime & | dt | ) |
|
|
inline |
◆ setEffort()
| void KPlato::Node::setEffort |
( |
Effort * | e | ) |
|
|
inline |
◆ setEndTime()
| void KPlato::Node::setEndTime |
( |
DateTime | endTime | ) |
|
◆ setId()
| bool KPlato::Node::setId |
( |
TQString | id | ) |
|
◆ setLatestFinish()
| void KPlato::Node::setLatestFinish |
( |
const DateTime & | dt | ) |
|
|
inline |
setLatestFinish() sets latest time this node can finish given the constraints of the network.
- See also
- latestFinish
Definition at line 228 of file kptnode.h.
◆ setLeader()
| void KPlato::Node::setLeader |
( |
const TQString & | l | ) |
|
|
inline |
◆ setName()
| void KPlato::Node::setName |
( |
const TQString & | n | ) |
|
|
inline |
◆ setParent()
| void KPlato::Node::setParent |
( |
Node * | newParent | ) |
|
|
inline |
◆ setParentSchedule()
| void KPlato::Node::setParentSchedule |
( |
Schedule * | sch | ) |
|
|
virtual |
◆ setRunningAccount()
| void KPlato::Node::setRunningAccount |
( |
Account * | acc | ) |
|
|
inline |
◆ setScheduleDeleted()
| void KPlato::Node::setScheduleDeleted |
( |
long | id, |
|
|
bool | onoff ) |
Set deleted = onoff for schedule with id.
Definition at line 709 of file kptnode.cpp.
◆ setShutdownAccount()
| void KPlato::Node::setShutdownAccount |
( |
Account * | acc | ) |
|
|
inline |
◆ setShutdownCost()
| void KPlato::Node::setShutdownCost |
( |
double | cost | ) |
|
|
inline |
◆ setStartTime()
| void KPlato::Node::setStartTime |
( |
DateTime | startTime | ) |
|
◆ setStartupAccount()
| void KPlato::Node::setStartupAccount |
( |
Account * | acc | ) |
|
|
inline |
◆ setStartupCost()
| void KPlato::Node::setStartupCost |
( |
double | cost | ) |
|
|
inline |
◆ setWorkEndTime()
| void KPlato::Node::setWorkEndTime |
( |
const DateTime & | dt | ) |
|
|
inline |
◆ setWorkStartTime()
| void KPlato::Node::setWorkStartTime |
( |
const DateTime & | dt | ) |
|
|
inline |
◆ shutdownAccount()
| Account * KPlato::Node::shutdownAccount |
( |
| ) |
const |
|
inline |
◆ shutdownCost()
| double KPlato::Node::shutdownCost |
( |
| ) |
const |
|
inline |
◆ siblingAfter()
| Node * KPlato::Node::siblingAfter |
( |
| ) |
|
◆ siblingBefore()
| Node * KPlato::Node::siblingBefore |
( |
| ) |
|
◆ startDate()
| const TQDate & KPlato::Node::startDate |
( |
| ) |
const |
|
inline |
◆ startNotEarlier()
| virtual DateTime KPlato::Node::startNotEarlier |
( |
| ) |
const |
|
inlinevirtual |
◆ startTime() [1/2]
◆ startTime() [2/2]
| virtual DateTime KPlato::Node::startTime |
( |
| ) |
const |
|
inlinevirtual |
◆ startupAccount()
| Account * KPlato::Node::startupAccount |
( |
| ) |
const |
|
inline |
◆ startupCost()
| double KPlato::Node::startupCost |
( |
| ) |
const |
|
inline |
◆ summarytaskDurationBackward()
◆ summarytaskDurationForward()
◆ summarytaskEarliestStart()
| virtual DateTime KPlato::Node::summarytaskEarliestStart |
( |
| ) |
|
|
inlinevirtual |
◆ summarytaskLatestFinish()
| virtual DateTime KPlato::Node::summarytaskLatestFinish |
( |
| ) |
|
|
inlinevirtual |
◆ takeDependChildNode()
| void KPlato::Node::takeDependChildNode |
( |
Relation * | rel | ) |
|
Takes the relation rel from this node only.
Never deletes even when autoDelete = true.
Definition at line 236 of file kptnode.cpp.
◆ takeDependParentNode()
| void KPlato::Node::takeDependParentNode |
( |
Relation * | rel | ) |
|
Takes the relation rel from this node only.
Never deletes even when autoDelete = true.
Definition at line 295 of file kptnode.cpp.
◆ takeSchedule()
| void KPlato::Node::takeSchedule |
( |
const Schedule * | schedule | ) |
|
Take, don't delete (as in destruct).
Definition at line 660 of file kptnode.cpp.
◆ type()
| virtual int KPlato::Node::type |
( |
| ) |
const |
|
pure virtual |
◆ wbs()
| TQString KPlato::Node::wbs |
( |
| ) |
const |
|
inline |
◆ workEndTime()
| virtual DateTime KPlato::Node::workEndTime |
( |
| ) |
const |
|
inlinevirtual |
This is when work can finish on this node in accordance with the calendar of allocated resources.
Normally this is the same as endTime(), but may differ if timing constraints are set.
Reimplemented in KPlato::Task.
Definition at line 429 of file kptnode.h.
◆ workStartTime()
| virtual DateTime KPlato::Node::workStartTime |
( |
| ) |
const |
|
inlinevirtual |
This is when work can start on this node in accordance with the calendar of allocated resources.
Normally this is the same as startTime(), but may differ if timing constraints are set.
Reimplemented in KPlato::Task.
Definition at line 419 of file kptnode.h.
◆ m_constraint
| ConstraintType KPlato::Node::m_constraint |
|
protected |
◆ m_constraintEndTime
| DateTime KPlato::Node::m_constraintEndTime |
|
protected |
m_constraintEndTime is used if any of the constraints FixedInterval, FinishNotLater, MustFinishOn or FixedInterval is selected
Definition at line 517 of file kptnode.h.
◆ m_constraintStartTime
| DateTime KPlato::Node::m_constraintStartTime |
|
protected |
m_constraintTime is used if any of the constraints FixedInterval, StartNotEarlier, MustStartOn or FixedInterval is selected
Definition at line 512 of file kptnode.h.
◆ m_currentSchedule
| Schedule* KPlato::Node::m_currentSchedule |
|
protected |
◆ m_dateOnlyDuration
| Duration KPlato::Node::m_dateOnlyDuration |
|
protected |
◆ m_dateOnlyEndDate
| TQDate KPlato::Node::m_dateOnlyEndDate |
|
protected |
◆ m_dateOnlyStartDate
| TQDate KPlato::Node::m_dateOnlyStartDate |
|
protected |
◆ m_dependChildNodes
| TQPtrList<Relation> KPlato::Node::m_dependChildNodes |
|
protected |
◆ m_dependParentNodes
| TQPtrList<Relation> KPlato::Node::m_dependParentNodes |
|
protected |
◆ m_description
| TQString KPlato::Node::m_description |
|
protected |
◆ m_durationBackward
| Duration KPlato::Node::m_durationBackward |
|
protected |
◆ m_durationForward
| Duration KPlato::Node::m_durationForward |
|
protected |
◆ m_effort
| Effort* KPlato::Node::m_effort |
|
protected |
◆ m_id
| TQString KPlato::Node::m_id |
|
protected |
◆ m_leader
| TQString KPlato::Node::m_leader |
|
protected |
◆ m_name
| TQString KPlato::Node::m_name |
|
protected |
◆ m_nodes
| TQPtrList<Node> KPlato::Node::m_nodes |
|
protected |
◆ m_parent
| Node* KPlato::Node::m_parent |
|
protected |
◆ m_runningAccount
| Account* KPlato::Node::m_runningAccount |
|
protected |
◆ m_schedules
| TQIntDict<Schedule> KPlato::Node::m_schedules |
|
protected |
◆ m_shutdownAccount
| Account* KPlato::Node::m_shutdownAccount |
|
protected |
◆ m_shutdownCost
| double KPlato::Node::m_shutdownCost |
|
protected |
◆ m_startupAccount
| Account* KPlato::Node::m_startupAccount |
|
protected |
◆ m_startupCost
| double KPlato::Node::m_startupCost |
|
protected |
◆ m_visitedBackward
| bool KPlato::Node::m_visitedBackward |
|
protected |
◆ m_visitedForward
| bool KPlato::Node::m_visitedForward |
|
protected |
◆ m_wbs
| TQString KPlato::Node::m_wbs |
|
protected |
The documentation for this class was generated from the following files:
|