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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/* This file is part of the KDE libraries
Copyright (C) 1999 Carsten Pfeiffer <pfeiffer@kde.org>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef KCOMPLETION_PRIVATE_H
#define KCOMPLETION_PRIVATE_H
#include <tqstring.h>
#include <ksortablevaluelist.h>
class KCompTreeNode;
#include <kallocator.h>
/**
* @internal
*/
class TDECORE_EXPORT KCompTreeNodeList
{
public:
KCompTreeNodeList() : first(0), last(0), m_count(0) {}
KCompTreeNode *begin() const { return first; }
KCompTreeNode *end() const { return last; }
KCompTreeNode *tqat(uint index) const;
void append(KCompTreeNode *item);
void prepend(KCompTreeNode *item);
void insert(KCompTreeNode *after, KCompTreeNode *item);
KCompTreeNode *remove(KCompTreeNode *item);
uint count() const { return m_count; }
private:
KCompTreeNode *first, *last;
uint m_count;
};
typedef KCompTreeNodeList KCompTreeChildren;
/**
* A helper class for KCompletion. Implements a tree of TQChar.
*
* The tree looks like this (containing the items "kde", "kde-ui",
* "kde-core" and "pfeiffer". Every item is delimited with TQChar( 0x0 )
*
* some_root_node
* / \
* k p
* | |
* d f
* | |
* e e
* /| |
* 0x0 - i
* / \ |
* u c f
* | | |
* i o f
* | | |
* 0x0 r e
* | |
* e r
* | |
* 0x0 0x0
*
* @author Carsten Pfeiffer <pfeiffer@kde.org>
* @internal
*/
class TDECORE_EXPORT KCompTreeNode : public TQChar
{
public:
KCompTreeNode() : TQChar(), myWeight(0) {}
KCompTreeNode( const TQChar& ch, uint weight = 0 )
: TQChar( ch ),
myWeight( weight ) {}
~KCompTreeNode();
void * operator new( size_t s ) {
return alloc.allocate( s );
}
void operator delete( void * s ) {
alloc.deallocate( s );
}
// Returns a child of this node matching ch, if available.
// Otherwise, returns 0L
inline KCompTreeNode * find( const TQChar& ch ) const {
KCompTreeNode * cur = myChildren.begin();
while (cur && (*cur != ch)) cur = cur->next;
return cur;
}
KCompTreeNode * insert( const TQChar&, bool sorted );
void remove( const TQString& );
inline int childrenCount() const { return myChildren.count(); }
// weighting
inline void confirm() { myWeight++; }
inline void confirm(uint w) { myWeight += w; }
inline void decline() { myWeight--; }
inline uint weight() const { return myWeight; }
inline const KCompTreeChildren * children() const {
return &myChildren;
}
inline const KCompTreeNode * childAt(int index) const {
return myChildren.tqat(index);
}
inline const KCompTreeNode * firstChild() const {
return myChildren.begin();
}
inline const KCompTreeNode * lastChild() const {
return myChildren.end();
}
/* We want to handle a list of KCompTreeNodes on our own, to not
need to use TQValueList<>. And to make it even more fast we don't
use an accessor, but just a public member. */
KCompTreeNode *next;
private:
uint myWeight;
KCompTreeNodeList myChildren;
static KZoneAllocator alloc;
};
// some more helper stuff
typedef KSortableValueList<TQString> KCompletionMatchesList;
/**
* @internal
*/
class TDECORE_EXPORT KCompletionMatchesWrapper
{
public:
KCompletionMatchesWrapper( bool sort = false )
: sortedList( sort ? new KCompletionMatchesList : 0L ),
dirty( false )
{}
~KCompletionMatchesWrapper() {
delete sortedList;
}
void setSorting( bool sort ) {
if ( sort && !sortedList )
sortedList = new KCompletionMatchesList;
else if ( !sort ) {
delete sortedList;
sortedList = 0L;
}
stringList.clear();
dirty = false;
}
bool sorting() const {
return sortedList != 0L;
}
void append( int i, const TQString& string ) {
if ( sortedList )
sortedList->insert( i, string );
else
stringList.append( string );
dirty = true;
}
void clear() {
if ( sortedList )
sortedList->clear();
stringList.clear();
dirty = false;
}
uint count() const {
if ( sortedList )
return sortedList->count();
return stringList.count();
}
bool isEmpty() const {
return count() == 0;
}
TQString first() const {
return list().first();
}
TQString last() const {
return list().last();
}
TQStringList list() const;
mutable TQStringList stringList;
KCompletionMatchesList *sortedList;
mutable bool dirty;
};
#endif // KCOMPLETION_PRIVATE_H
|
