From e654398e46e37abf457b2b1122ab898d2c51c49f Mon Sep 17 00:00:00 2001
From: tpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>
Date: Sat, 31 Jul 2010 19:43:15 +0000
Subject: Trinity Qt initial conversion

git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdemultimedia@1157644 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
---
 juk/sortedstringlist.cpp | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

(limited to 'juk/sortedstringlist.cpp')

diff --git a/juk/sortedstringlist.cpp b/juk/sortedstringlist.cpp
index 87f2938d..0886a88d 100644
--- a/juk/sortedstringlist.cpp
+++ b/juk/sortedstringlist.cpp
@@ -20,10 +20,10 @@
 class SortedStringList::Node 
 {
 public:
-    Node(const QString &value) : key(value), parent(0), left(0), right(0) {}
+    Node(const TQString &value) : key(value), parent(0), left(0), right(0) {}
     ~Node() {}
     
-    QString key;
+    TQString key;
     Node *parent;
     Node *left;
     Node *right;
@@ -39,12 +39,12 @@ SortedStringList::~SortedStringList()
     
 }
 
-bool SortedStringList::insert(const QString &value)
+bool SortedStringList::insert(const TQString &value)
 {
     return BSTInsert(value);
 }
 
-bool SortedStringList::contains(const QString &value) const
+bool SortedStringList::contains(const TQString &value) const
 {
     return find(value);
 }
@@ -71,7 +71,7 @@ SortedStringList::Node *SortedStringList::treeSuccessor(Node *n) const
     return p;
 }
 
-bool SortedStringList::remove(const QString &value)
+bool SortedStringList::remove(const TQString &value)
 {
     Node *n = find(value);
 
@@ -111,9 +111,9 @@ bool SortedStringList::remove(const QString &value)
     return true;
 }
 
-QStringList SortedStringList::values() const
+TQStringList SortedStringList::values() const
 {
-    QStringList l;
+    TQStringList l;
     traverse(m_root, l);
     return l;
 }
@@ -122,7 +122,7 @@ QStringList SortedStringList::values() const
 // private methods
 ////////////////////////////////////////////////////////////////////////////////
 
-SortedStringList::Node *SortedStringList::find(const QString &value) const
+SortedStringList::Node *SortedStringList::find(const TQString &value) const
 {
     Node *n = m_root;
     while(n && value != n->key) {
@@ -135,7 +135,7 @@ SortedStringList::Node *SortedStringList::find(const QString &value) const
     return n;
 }
 
-bool SortedStringList::BSTInsert(const QString &value)
+bool SortedStringList::BSTInsert(const TQString &value)
 {
     Node *previousNode = 0;
     Node *node = m_root;
@@ -169,7 +169,7 @@ bool SortedStringList::BSTInsert(const QString &value)
     return false;
 }
 
-void SortedStringList::traverse(const Node *n, QStringList &list) const
+void SortedStringList::traverse(const Node *n, TQStringList &list) const
 {
     if(!n)
 	return;
-- 
cgit v1.2.1