diff options
Diffstat (limited to 'juk/sortedstringlist.h')
| -rw-r--r-- | juk/sortedstringlist.h | 16 |
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; |