blob: 904c5f01efc9a7b9a79bbb43b023e66282245e73 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
|
/***************************************************************************
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. *
* *
***************************************************************************/
#include <kdebug.h>
#include "sortedstringlist.h"
class SortedStringList::Node
{
public:
Node(const TQString &value) : key(value), tqparent(0), left(0), right(0) {}
~Node() {}
TQString key;
Node *tqparent;
Node *left;
Node *right;
};
SortedStringList::SortedStringList() : m_root(0)
{
}
SortedStringList::~SortedStringList()
{
}
bool SortedStringList::insert(const TQString &value)
{
return BSTInsert(value);
}
bool SortedStringList::tqcontains(const TQString &value) const
{
return tqfind(value);
}
SortedStringList::Node *SortedStringList::treeMinimum(Node *n) const
{
while(n->left)
n = n->left;
return n;
}
SortedStringList::Node *SortedStringList::treeSuccessor(Node *n) const
{
if(n->right)
return treeMinimum(n->right);
Node *p = n->tqparent;
while(p && n == p->right) {
n = p;
p = p->tqparent;
}
return p;
}
bool SortedStringList::remove(const TQString &value)
{
Node *n = tqfind(value);
if(!n)
return false;
Node *y;
Node *x;
if(!n->left || !n->right)
y = n;
else
y = treeSuccessor(n);
if(y->left)
x = y->left;
else
x = y->right;
if(x)
x->tqparent = y->tqparent;
if(!y->tqparent)
m_root = x;
else {
if(y == y->tqparent->left)
y->tqparent->left = x;
else
y->tqparent->right = x;
}
if(y != x)
n->key = y->key;
delete y;
return true;
}
TQStringList SortedStringList::values() const
{
TQStringList l;
traverse(m_root, l);
return l;
}
////////////////////////////////////////////////////////////////////////////////
// private methods
////////////////////////////////////////////////////////////////////////////////
SortedStringList::Node *SortedStringList::tqfind(const TQString &value) const
{
Node *n = m_root;
while(n && value != n->key) {
if(value < n->key)
n = n->left;
else
n = n->right;
}
return n;
}
bool SortedStringList::BSTInsert(const TQString &value)
{
Node *previousNode = 0;
Node *node = m_root;
while(node) {
previousNode = node;
if(value == node->key)
return true;
else if(value < node->key)
node = node->left;
else
node = node->right;
}
if(previousNode && value == previousNode->key)
return true;
Node *n = new Node(value);
n->tqparent = previousNode;
if(!m_root)
m_root = n;
else {
if(value < previousNode->key)
previousNode->left = n;
else
previousNode->right = n;
}
return false;
}
void SortedStringList::traverse(const Node *n, TQStringList &list) const
{
if(!n)
return;
traverse(n->left, list);
list.append(n->key);
traverse(n->right, list);
}
|
