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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
|
/****************************************************************************
**
** Definition of TQGList and TQGListIterator classes
**
** Created : 920624
**
** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the tools module of the TQt GUI Toolkit.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free TQt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing requirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at sales@trolltech.com.
**
** This file may be used under the terms of the Q Public License as
** defined by Trolltech ASA and appearing in the file LICENSE.TQPL
** included in the packaging of this file. Licensees holding valid TQt
** Commercial licenses may use this file in accordance with the TQt
** Commercial License Agreement provided with the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#ifndef TQGLIST_H
#define TQGLIST_H
#ifndef QT_H
#include "ntqptrcollection.h"
#endif // QT_H
class Q_EXPORT TQLNode
{
friend class TQGList;
friend class TQGListIterator;
friend class TQGListStdIterator;
public:
TQPtrCollection::Item getData() { return data; }
private:
TQPtrCollection::Item data;
TQLNode *prev;
TQLNode *next;
TQLNode( TQPtrCollection::Item d ) { data = d; }
};
class TQGListIteratorList; // internal helper class
class Q_EXPORT TQGList : public TQPtrCollection // doubly linked generic list
{
friend class TQGListIterator;
friend class TQGListIteratorList;
friend class TQGVector; // needed by TQGVector::toList
public:
uint count() const; // return number of nodes
#ifndef QT_NO_DATASTREAM
TQDataStream &read( TQDataStream & ); // read list from stream
TQDataStream &write( TQDataStream & ) const; // write list to stream
#endif
protected:
TQGList(); // create empty list
TQGList( const TQGList & ); // make copy of other list
virtual ~TQGList();
TQGList &operator=( const TQGList & ); // assign from other list
bool operator==( const TQGList& ) const;
void inSort( TQPtrCollection::Item ); // add item sorted in list
void append( TQPtrCollection::Item ); // add item at end of list
bool insertAt( uint index, TQPtrCollection::Item ); // add item at i'th position
void relinkNode( TQLNode * ); // relink as first item
bool removeNode( TQLNode * ); // remove node
bool remove( TQPtrCollection::Item = 0 ); // remove item (0=current)
bool removeRef( TQPtrCollection::Item = 0 ); // remove item (0=current)
bool removeFirst(); // remove first item
bool removeLast(); // remove last item
bool removeAt( uint ); // remove item at i'th position
bool replaceAt( uint, TQPtrCollection::Item ); // replace item at position i with item
TQPtrCollection::Item takeNode( TQLNode * ); // take out node
TQPtrCollection::Item take(); // take out current item
TQPtrCollection::Item takeAt( uint index ); // take out item at i'th pos
TQPtrCollection::Item takeFirst(); // take out first item
TQPtrCollection::Item takeLast(); // take out last item
void sort(); // sort all items;
void clear(); // remove all items
int findRef( TQPtrCollection::Item, bool = TRUE ); // find exact item in list
int find( TQPtrCollection::Item, bool = TRUE ); // find equal item in list
uint containsRef( TQPtrCollection::Item ) const; // get number of exact matches
uint contains( TQPtrCollection::Item ) const; // get number of equal matches
TQPtrCollection::Item at( uint index ); // access item at i'th pos
int at() const; // get current index
TQLNode *currentNode() const; // get current node
TQPtrCollection::Item get() const; // get current item
TQPtrCollection::Item cfirst() const; // get ptr to first list item
TQPtrCollection::Item clast() const; // get ptr to last list item
TQPtrCollection::Item first(); // set first item in list curr
TQPtrCollection::Item last(); // set last item in list curr
TQPtrCollection::Item next(); // set next item in list curr
TQPtrCollection::Item prev(); // set prev item in list curr
void toVector( TQGVector * ) const; // put items in vector
virtual int compareItems( TQPtrCollection::Item, TQPtrCollection::Item );
#ifndef QT_NO_DATASTREAM
virtual TQDataStream &read( TQDataStream &, TQPtrCollection::Item & );
virtual TQDataStream &write( TQDataStream &, TQPtrCollection::Item ) const;
#endif
TQLNode* begin() const { return firstNode; }
TQLNode* end() const { return 0; }
TQLNode* erase( TQLNode* it );
private:
void prepend( TQPtrCollection::Item ); // add item at start of list
void heapSortPushDown( TQPtrCollection::Item* heap, int first, int last );
TQLNode *firstNode; // first node
TQLNode *lastNode; // last node
TQLNode *curNode; // current node
int curIndex; // current index
uint numNodes; // number of nodes
TQGListIteratorList *iterators; // list of iterators
TQLNode *locate( uint ); // get node at i'th pos
TQLNode *unlink(); // unlink node
};
inline uint TQGList::count() const
{
return numNodes;
}
inline bool TQGList::removeFirst()
{
first();
return remove();
}
inline bool TQGList::removeLast()
{
last();
return remove();
}
inline int TQGList::at() const
{
return curIndex;
}
inline TQPtrCollection::Item TQGList::at( uint index )
{
TQLNode *n = locate( index );
return n ? n->data : 0;
}
inline TQLNode *TQGList::currentNode() const
{
return curNode;
}
inline TQPtrCollection::Item TQGList::get() const
{
return curNode ? curNode->data : 0;
}
inline TQPtrCollection::Item TQGList::cfirst() const
{
return firstNode ? firstNode->data : 0;
}
inline TQPtrCollection::Item TQGList::clast() const
{
return lastNode ? lastNode->data : 0;
}
/*****************************************************************************
TQGList stream functions
*****************************************************************************/
#ifndef QT_NO_DATASTREAM
Q_EXPORT TQDataStream &operator>>( TQDataStream &, TQGList & );
Q_EXPORT TQDataStream &operator<<( TQDataStream &, const TQGList & );
#endif
/*****************************************************************************
TQGListIterator class
*****************************************************************************/
class Q_EXPORT TQGListIterator // TQGList iterator
{
friend class TQGList;
friend class TQGListIteratorList;
protected:
TQGListIterator( const TQGList & );
TQGListIterator( const TQGListIterator & );
TQGListIterator &operator=( const TQGListIterator & );
~TQGListIterator();
bool atFirst() const; // test if at first item
bool atLast() const; // test if at last item
TQPtrCollection::Item toFirst(); // move to first item
TQPtrCollection::Item toLast(); // move to last item
TQPtrCollection::Item get() const; // get current item
TQPtrCollection::Item operator()(); // get current and move to next
TQPtrCollection::Item operator++(); // move to next item (prefix)
TQPtrCollection::Item operator+=(uint); // move n positions forward
TQPtrCollection::Item operator--(); // move to prev item (prefix)
TQPtrCollection::Item operator-=(uint); // move n positions backward
protected:
TQGList *list; // reference to list
private:
TQLNode *curNode; // current node in list
};
inline bool TQGListIterator::atFirst() const
{
return curNode == list->firstNode;
}
inline bool TQGListIterator::atLast() const
{
return curNode == list->lastNode;
}
inline TQPtrCollection::Item TQGListIterator::get() const
{
return curNode ? curNode->data : 0;
}
class Q_EXPORT TQGListStdIterator
{
public:
inline TQGListStdIterator( TQLNode* n ) : node( n ){}
inline operator TQLNode* () { return node; }
protected:
inline TQLNode *next() { return node->next; }
TQLNode *node;
};
#endif // TQGLIST_H
|
