summaryrefslogtreecommitdiffstats
path: root/juk/sortedstringlist.h
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2010-07-31 19:43:15 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2010-07-31 19:43:15 +0000
commite654398e46e37abf457b2b1122ab898d2c51c49f (patch)
treed39ee6440f3c3663c3ead84a2d4cc2d034667e96 /juk/sortedstringlist.h
parente4f29b18e19394b9352f52a6c0d0d0e3932cf511 (diff)
downloadtdemultimedia-e654398e46e37abf457b2b1122ab898d2c51c49f.tar.gz
tdemultimedia-e654398e46e37abf457b2b1122ab898d2c51c49f.zip
Trinity Qt initial conversion
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdemultimedia@1157644 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'juk/sortedstringlist.h')
-rw-r--r--juk/sortedstringlist.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/juk/sortedstringlist.h b/juk/sortedstringlist.h
index 108a16c6..01386262 100644
--- a/juk/sortedstringlist.h
+++ b/juk/sortedstringlist.h
@@ -16,7 +16,7 @@
#ifndef SORTEDSTRINGLIST_H
#define SORTEDSTRINGLIST_H
-#include <qstringlist.h>
+#include <tqstringlist.h>
class SortedStringList
{
@@ -28,27 +28,27 @@ public:
* Insert the value. Returns true if the item was already in the list
* or false otherwise.
*/
- bool insert(const QString &value);
- bool contains(const QString &value) const;
- bool remove(const QString &value);
+ bool insert(const TQString &value);
+ bool contains(const TQString &value) const;
+ bool remove(const TQString &value);
/**
* Returns a sorted list of the values.
* Warning, this method is expensive and shouldn't be used except when
* necessary.
*/
- QStringList values() const;
+ TQStringList values() const;
private:
class Node;
- Node *find(const QString &value) const;
+ Node *find(const TQString &value) const;
/**
* The insertion implementation. Returns true if the item was already
* present in the list.
*/
- bool BSTInsert(const QString &value);
- void traverse(const Node *n, QStringList &list) const;
+ bool BSTInsert(const TQString &value);
+ void traverse(const Node *n, TQStringList &list) const;
Node *treeMinimum(Node *n) const;
Node *treeSuccessor(Node *n) const;