summaryrefslogtreecommitdiffstats
path: root/kplato/kptnode.cc
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-08-10 06:08:18 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-08-10 06:08:18 +0000
commitb6edfe41c9395f2e20784cbf0e630af6426950a3 (patch)
tree56ed9b871d4296e6c15949c24e16420be1b28697 /kplato/kptnode.cc
parentef39e8e4178a8f98cf5f154916ba0f03e4855206 (diff)
downloadkoffice-b6edfe41c9395f2e20784cbf0e630af6426950a3.tar.gz
koffice-b6edfe41c9395f2e20784cbf0e630af6426950a3.zip
rename the following methods:
tqfind find tqreplace replace tqcontains contains git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/koffice@1246075 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'kplato/kptnode.cc')
-rw-r--r--kplato/kptnode.cc32
1 files changed, 16 insertions, 16 deletions
diff --git a/kplato/kptnode.cc b/kplato/kptnode.cc
index e8c253122..aaa770f0f 100644
--- a/kplato/kptnode.cc
+++ b/kplato/kptnode.cc
@@ -118,8 +118,8 @@ Node *Node::projectNode() {
}
void Node::delChildNode( Node *node, bool remove) {
- //kdDebug()<<k_funcinfo<<"tqfind="<<m_nodes.tqfindRef(node)<<endl;
- if ( m_nodes.tqfindRef(node) != -1 ) {
+ //kdDebug()<<k_funcinfo<<"find="<<m_nodes.findRef(node)<<endl;
+ if ( m_nodes.findRef(node) != -1 ) {
if(remove)
m_nodes.remove();
else
@@ -149,7 +149,7 @@ void Node::insertChildNode( unsigned int index, Node *node) {
void Node::addChildNode( Node *node, Node *after) {
//kdDebug()<<k_funcinfo<<endl;
- int index = m_nodes.tqfindRef(after);
+ int index = m_nodes.findRef(after);
if (index == -1) {
//kdDebug()<<k_funcinfo<<"append id="<<node->id()<<": "<<node->name()<<endl;
m_nodes.append(node);
@@ -163,7 +163,7 @@ void Node::addChildNode( Node *node, Node *after) {
int Node::findChildNode( Node* node )
{
- return m_nodes.tqfindRef( node );
+ return m_nodes.findRef( node );
}
@@ -201,7 +201,7 @@ void Node::insertDependChildNode( unsigned int index, Node *node, Relation::Type
}
bool Node::addDependChildNode( Relation *relation) {
- if(m_dependChildNodes.tqfindRef(relation) != -1)
+ if(m_dependChildNodes.findRef(relation) != -1)
return false;
m_dependChildNodes.append(relation);
return true;
@@ -209,7 +209,7 @@ bool Node::addDependChildNode( Relation *relation) {
// These delDepend... methods look suspicious to me, can someone review?
void Node::delDependChildNode( Node *node, bool remove) {
- if ( m_nodes.tqfindRef(node) != -1 ) {
+ if ( m_nodes.findRef(node) != -1 ) {
if(remove)
m_dependChildNodes.remove();
else
@@ -218,7 +218,7 @@ void Node::delDependChildNode( Node *node, bool remove) {
}
void Node::delDependChildNode( Relation *rel, bool remove) {
- if ( m_dependChildNodes.tqfindRef(rel) != -1 ) {
+ if ( m_dependChildNodes.findRef(rel) != -1 ) {
if(remove)
m_dependChildNodes.remove();
else
@@ -234,7 +234,7 @@ void Node::delDependChildNode( int number, bool remove) {
}
void Node::takeDependChildNode(Relation *rel) {
- if (m_dependChildNodes.tqfindRef(rel) != -1) {
+ if (m_dependChildNodes.findRef(rel) != -1) {
m_dependChildNodes.take();
}
}
@@ -260,7 +260,7 @@ void Node::insertDependParentNode( unsigned int index, Node *node, Relation::Typ
}
bool Node::addDependParentNode( Relation *relation) {
- if(m_dependParentNodes.tqfindRef(relation) != -1)
+ if(m_dependParentNodes.findRef(relation) != -1)
return false;
m_dependParentNodes.append(relation);
return true;
@@ -268,7 +268,7 @@ bool Node::addDependParentNode( Relation *relation) {
// These delDepend... methods look suspicious to me, can someone review?
void Node::delDependParentNode( Node *node, bool remove) {
- if ( m_nodes.tqfindRef(node) != -1 ) {
+ if ( m_nodes.findRef(node) != -1 ) {
if(remove)
m_dependParentNodes.remove();
else
@@ -277,7 +277,7 @@ void Node::delDependParentNode( Node *node, bool remove) {
}
void Node::delDependParentNode( Relation *rel, bool remove) {
- if ( m_dependParentNodes.tqfindRef(rel) != -1 ) {
+ if ( m_dependParentNodes.findRef(rel) != -1 ) {
if(remove)
m_dependParentNodes.remove();
else
@@ -293,13 +293,13 @@ void Node::delDependParentNode( int number, bool remove) {
}
void Node::takeDependParentNode(Relation *rel) {
- if (m_dependParentNodes.tqfindRef(rel) != -1) {
+ if (m_dependParentNodes.findRef(rel) != -1) {
rel = m_dependParentNodes.take();
}
}
bool Node::isParentOf(Node *node) {
- if (m_nodes.tqfindRef(node) != -1)
+ if (m_nodes.findRef(node) != -1)
return true;
TQPtrListIterator<Node> nit(childNodeIterator());
@@ -504,7 +504,7 @@ Node *Node::siblingBefore() {
Node *Node::childBefore(Node *node) {
//kdDebug()<<k_funcinfo<<endl;
- int index = m_nodes.tqfindRef(node);
+ int index = m_nodes.findRef(node);
if (index > 0){
return m_nodes.at(index-1);
}
@@ -521,7 +521,7 @@ Node *Node::siblingAfter() {
Node *Node::childAfter(Node *node)
{
//kdDebug()<<k_funcinfo<<endl;
- uint index = m_nodes.tqfindRef(node);
+ uint index = m_nodes.findRef(node);
if (index < m_nodes.count()-1) {
return m_nodes.at(index+1); }
return 0;
@@ -668,7 +668,7 @@ void Node::takeSchedule(const Schedule *schedule) {
void Node::addSchedule(Schedule *schedule) {
if (schedule == 0)
return;
- m_schedules.tqreplace(schedule->id(), schedule);
+ m_schedules.replace(schedule->id(), schedule);
}
Schedule *Node::createSchedule(TQString name, Schedule::Type type, long id) {