Rename a number of old tq methods that are no longer tq specific

1 files changed, 12 insertions, 12 deletions

diff --git a/tdecore/kcompletion.cpp b/tdecore/kcompletion.cpp
index 813b56027..84a4cfca2 100644
--- a/tdecore/kcompletion.cpp
+++ b/tdecore/kcompletion.cpp
@@ -127,7 +127,7 @@ void KCompletion::addItem( const TQString& item, uint weight )
     // nodes.
 
     for ( uint i = 0; i < len; i++ ) {
-        node = node->insert( item.tqat(i), sorted );
+        node = node->insert( item.at(i), sorted );
         if ( weighted )
             node->confirm( weight -1 ); // node->insert() sets weighting to 1
     }
@@ -419,7 +419,7 @@ TQString KCompletion::findCompletion( const TQString& string )
 
     // start at the tree-root and try to find the search-string
     for( uint i = 0; i < string.length(); i++ ) {
-        ch = string.tqat( i );
+        ch = string.at( i );
         node = node->find( ch );
 
         if ( node )
@@ -463,7 +463,7 @@ TQString KCompletion::findCompletion( const TQString& string )
                     uint weight = temp_node->weight();
                     const KCompTreeNode* hit = temp_node;
                     for( int i = 1; i < count; i++ ) {
-                        temp_node = node->tqchildAt(i);
+                        temp_node = node->childAt(i);
                         if( temp_node->weight() > weight ) {
                             hit = temp_node;
                             weight = hit->weight();
@@ -508,7 +508,7 @@ void KCompletion::findAllCompletions(const TQString& string,
 
     // start at the tree-root and try to find the search-string
     for( uint i = 0; i < string.length(); i++ ) {
-        ch = string.tqat( i );
+        ch = string.at( i );
         node = node->find( ch );
 
         if ( node )
@@ -595,7 +595,7 @@ void KCompletion::extractStringsFromNodeCI( const KCompTreeNode *node,
         return;
     }
 
-    TQChar ch1 = restString.tqat(0);
+    TQChar ch1 = restString.at(0);
     TQString newRest = restString.mid(1);
     KCompTreeNode *child1, *child2;
 
@@ -628,19 +628,19 @@ void KCompletion::doBeep( BeepMode mode ) const
 
     switch ( mode ) {
         case Rotation:
-            event = TQString::tqfromLatin1("Textcompletion: rotation");
+            event = TQString::fromLatin1("Textcompletion: rotation");
             text = i18n("You reached the end of the list\nof matching items.\n");
             break;
         case PartialMatch:
             if ( myCompletionMode == KGlobalSettings::CompletionShell ||
                  myCompletionMode == KGlobalSettings::CompletionMan ) {
-                event = TQString::tqfromLatin1("Textcompletion: partial match");
+                event = TQString::fromLatin1("Textcompletion: partial match");
                 text = i18n("The completion is ambiguous, more than one\nmatch is available.\n");
             }
             break;
         case NoMatch:
             if ( myCompletionMode == KGlobalSettings::CompletionShell ) {
-                event = TQString::tqfromLatin1("Textcompletion: no match");
+                event = TQString::fromLatin1("Textcompletion: no match");
                 text = i18n("There is no matching item available.\n");
             }
             break;
@@ -725,7 +725,7 @@ void KCompTreeNode::remove( const TQString& str )
     uint i = 0;
     for ( ; i < string.length(); i++ )
     {
-        child = parent->find( string.tqat( i ) );
+        child = parent->find( string.at( i ) );
         if ( child )
             deletables.insert( i + 1, child );
         else
@@ -736,8 +736,8 @@ void KCompTreeNode::remove( const TQString& str )
 
     for ( ; i >= 1; i-- )
     {
-        parent = deletables.tqat( i - 1 );
-        child = deletables.tqat( i );
+        parent = deletables.at( i - 1 );
+        child = deletables.at( i );
         if ( child->myChildren.count() == 0 )
             delete parent->myChildren.remove( child );
     }
@@ -874,7 +874,7 @@ KCompTreeNode *KCompTreeNodeList::remove(KCompTreeNode *item)
     return item;
 }
 
-KCompTreeNode *KCompTreeNodeList::tqat(uint index) const
+KCompTreeNode *KCompTreeNodeList::at(uint index) const
 {
     KCompTreeNode *cur = first;
     while (index-- && cur) cur = cur->next;