You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
60 lines
1.9 KiB
60 lines
1.9 KiB
/***************************************************************************
|
|
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 <tqstringlist.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 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.
|
|
*/
|
|
TQStringList values() const;
|
|
|
|
private:
|
|
class Node;
|
|
|
|
Node *find(const TQString &value) const;
|
|
/**
|
|
* The insertion implementation. Returns true if the item was already
|
|
* present in the list.
|
|
*/
|
|
bool BSTInsert(const TQString &value);
|
|
void traverse(const Node *n, TQStringList &list) const;
|
|
|
|
Node *treeMinimum(Node *n) const;
|
|
Node *treeSuccessor(Node *n) const;
|
|
|
|
Node *m_root;
|
|
};
|
|
|
|
#endif
|