1 files changed, 59 insertions, 0 deletions
diff --git a/juk/sortedstringlist.h b/juk/sortedstringlist.h
new file mode 100644
index 00000000..108a16c6
--- /dev/null
+++ b/juk/sortedstringlist.h
@@ -0,0 +1,59 @@
+/***************************************************************************
+    begin                : Wed Jan 29 2003
+    copyright            : (C) 2003 - 2004 by Scott Wheeler
+    email                : wheeler@kde.org
+ ***************************************************************************/
+
+/***************************************************************************
+ *                                                                         *
+ *   This program is free software; you can redistribute it and/or modify  *
+ *   it under the terms of the GNU General Public License as published by  *
+ *   the Free Software Foundation; either version 2 of the License, or     *
+ *   (at your option) any later version.                                   *
+ *                                                                         *
+ ***************************************************************************/
+
+#ifndef SORTEDSTRINGLIST_H
+#define SORTEDSTRINGLIST_H
+
+#include <qstringlist.h>
+
+class SortedStringList 
+{
+public: 
+    SortedStringList();
+    ~SortedStringList();
+
+    /**
+     * 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);
+
+    /**
+     * Returns a sorted list of the values.
+     * Warning, this method is expensive and shouldn't be used except when 
+     * necessary.
+     */
+    QStringList values() const;
+
+private:
+    class Node;
+
+    Node *find(const QString &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;
+
+    Node *treeMinimum(Node *n) const;
+    Node *treeSuccessor(Node *n) const;
+
+    Node *m_root;
+};
+
+#endif