Home
last modified time | relevance | path

Searched refs:m_dependParentNodes (Results 1 – 4 of 4) sorted by relevance

/dports/editors/calligraplan/calligraplan-3.3.0/src/libs/kernel/
H A Dkptnode.cpp58 m_dependParentNodes(), in Node()
91 while (!m_dependParentNodes.isEmpty()) { in ~Node()
92 delete m_dependParentNodes.value(0); in ~Node()
349 m_dependParentNodes.append(relation); in addDependParentNode()
357 m_dependParentNodes.insert(index,relation); in insertDependParentNode()
363 if(m_dependParentNodes.indexOf(relation) != -1) in addDependParentNode()
365 m_dependParentNodes.append(relation); in addDependParentNode()
370 int i = m_dependParentNodes.indexOf(rel); in takeDependParentNode()
373 m_dependParentNodes.removeAt(i); in takeDependParentNode()
940 return m_dependParentNodes.isEmpty(); in isStartNode()
[all …]
H A Dkptnode.h208 int numDependParentNodes() const { return m_dependParentNodes.count(); } in numDependParentNodes()
222 return m_dependParentNodes.at(number); in getDependParentNode()
224 QList<Relation*> dependParentNodes() const { return m_dependParentNodes; } in dependParentNodes()
653 QList<Relation*> m_dependParentNodes; variable
H A Dkpttask.cpp2716 return m_dependParentNodes.isEmpty() && m_parentProxyRelations.isEmpty(); in isStartNode()
2841 foreach (Relation *r, m_dependParentNodes) { in calcCriticalPath()
2931 foreach (const Relation *r, m_dependParentNodes) { in state()
H A Dkptproject.cpp1428 QListIterator<Relation*> it(m_dependParentNodes); in save()