From e05894553004a47b1e2f276bedcf5963b57a3932 Mon Sep 17 00:00:00 2001
From: tpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>
Date: Wed, 10 Aug 2011 06:08:18 +0000
Subject: rename the following methods: tqfind find tqreplace replace
 tqcontains contains

git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/ktechlab@1246075 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
---
 src/nodegroup.cpp | 24 ++++++++++++------------
 1 file changed, 12 insertions(+), 12 deletions(-)

(limited to 'src/nodegroup.cpp')

diff --git a/src/nodegroup.cpp b/src/nodegroup.cpp
index 903a20f..aaea114 100644
--- a/src/nodegroup.cpp
+++ b/src/nodegroup.cpp
@@ -60,7 +60,7 @@ void NodeGroup::setVisible( bool visible )
 
 void NodeGroup::addNode( Node *node, bool checkSurrouding )
 {
-	if ( !node || node->isChildNode() || m_nodeList.tqcontains(node) ) {
+	if ( !node || node->isChildNode() || m_nodeList.contains(node) ) {
 		return;
 	}
 	
@@ -209,7 +209,7 @@ IntList NodeGroup::findRoute( IntList used, int currentNode, int endNode, bool *
 	}
 	*success = false;
 	
-	if ( !used.tqcontains(currentNode) ) {
+	if ( !used.contains(currentNode) ) {
 		used.append(currentNode);
 	}
 	
@@ -221,7 +221,7 @@ IntList NodeGroup::findRoute( IntList used, int currentNode, int endNode, bool *
 	const uint n = m_nodeList.size()+m_extNodeList.size();
 	for ( uint i=0; i<n; ++i )
 	{
-		if ( b_routedMap[i*n+currentNode] && !used.tqcontains(i) )
+		if ( b_routedMap[i*n+currentNode] && !used.contains(i) )
 		{
 			IntList il = findRoute( used, i, endNode, success );
 			if (*success) {
@@ -247,7 +247,7 @@ Connector* NodeGroup::findCommonConnector( Node *n1, Node *n2 )
 	const ConnectorList::iterator end = n1Con.end();
 	for ( ConnectorList::iterator it = n1Con.begin(); it != end; ++it )
 	{
-		if ( n2Con.tqcontains(*it) ) {
+		if ( n2Con.contains(*it) ) {
 			return *it;
 		}
 	}
@@ -346,13 +346,13 @@ bool NodeGroup::canRoute( Node *n1, Node *n2 )
 	
 	IntList reachable;
 	getReachable( &reachable, getNodePos(n1) );
-	return reachable.tqcontains(getNodePos(n2));
+	return reachable.contains(getNodePos(n2));
 }
 
 
 void NodeGroup::getReachable( IntList *reachable, int node )
 {
-	if ( !reachable || reachable->tqcontains(node) ) {
+	if ( !reachable || reachable->contains(node) ) {
 		return;
 	}
 	reachable->append(node);
@@ -402,7 +402,7 @@ void NodeGroup::removeRoutedNodes( NodeList *nodes, Node *n1, Node *n2 )
 	const NodeList::iterator end = nodes->end();
 	for ( NodeList::iterator it = nodes->begin(); it != end; ++it )
 	{
-		if ( nodes->tqcontains(*it) > 1 ) {
+		if ( nodes->contains(*it) > 1 ) {
 			*it = 0l;
 		}
 	}
@@ -442,11 +442,11 @@ int NodeGroup::getNodePos( Node *n )
 	if (!n) {
 		return -1;
 	}
-	int pos = m_nodeList.tqfindIndex(n);
+	int pos = m_nodeList.findIndex(n);
 	if ( pos != -1 ) {
 		return pos;
 	}
-	pos = m_extNodeList.tqfindIndex(n);
+	pos = m_extNodeList.findIndex(n);
 	if ( pos != -1 ) {
 		return pos+m_nodeList.size();
 	}
@@ -511,7 +511,7 @@ void NodeGroup::init()
 		{
 			Connector *con = *conIt;
 			addExtNode(con->startNode());
-			if ( !m_conList.tqcontains(con) ) {
+			if ( !m_conList.contains(con) ) {
 				m_conList += con;
 				con->setNodeGroup(this);
 			}
@@ -523,7 +523,7 @@ void NodeGroup::init()
 		{
 			Connector *con = *conIt;
 			addExtNode(con->endNode());
-			if ( !m_conList.tqcontains(con) ) {
+			if ( !m_conList.contains(con) ) {
 				m_conList += con;
 				con->setNodeGroup(this);
 			}
@@ -562,7 +562,7 @@ void NodeGroup::connectorRemoved( Connector *connector )
 
 void NodeGroup::addExtNode( Node *node )
 {
-	if ( !m_extNodeList.tqcontains(node) && !m_nodeList.tqcontains(node) )
+	if ( !m_extNodeList.contains(node) && !m_nodeList.contains(node) )
 	{
 		m_extNodeList.append(node);
 		node->setNodeGroup(this);
-- 
cgit v1.2.1