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
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <private/qtreewidgetitemiterator_p.h>
#include "qtreewidget.h"
#include "qtreewidget_p.h"
#include "qwidgetitemdata_p.h"
#ifndef QT_NO_TREEWIDGET
QT_BEGIN_NAMESPACE
/*!
\class QTreeWidgetItemIterator
\ingroup model-view
\brief The QTreeWidgetItemIterator class provides a way to iterate over the
items in a QTreeWidget instance.
The iterator will walk the items in a pre-order traversal order, thus visiting the
parent node \e before it continues to the child nodes.
For example, the following code examples each item in a tree, checking the
text in the first column against a user-specified search string:
\snippet doc/src/snippets/qtreewidgetitemiterator-using/mainwindow.cpp 0
It is also possible to filter out certain types of node by passing certain
\l{IteratorFlag}{flags} to the constructor of QTreeWidgetItemIterator.
\sa QTreeWidget, {Model/View Programming}, QTreeWidgetItem
*/
/*!
Constructs an iterator for the same QTreeWidget as \a it. The
current iterator item is set to point on the current item of \a it.
*/
QTreeWidgetItemIterator::QTreeWidgetItemIterator(const QTreeWidgetItemIterator &it)
: d_ptr(new QTreeWidgetItemIteratorPrivate(*(it.d_ptr))),
current(it.current), flags(it.flags)
{
Q_D(QTreeWidgetItemIterator);
Q_ASSERT(d->m_model);
d->m_model->iterators.append(this);
}
/*!
Constructs an iterator for the given \a widget that uses the specified \a flags
to determine which items are found during iteration.
The iterator is set to point to the first top-level item contained in the widget,
or the next matching item if the top-level item doesn't match the flags.
\sa QTreeWidgetItemIterator::IteratorFlag
*/
QTreeWidgetItemIterator::QTreeWidgetItemIterator(QTreeWidget *widget, IteratorFlags flags)
: current(0), flags(flags)
{
Q_ASSERT(widget);
QTreeModel *model = qobject_cast<QTreeModel*>(widget->model());
Q_ASSERT(model);
d_ptr.reset(new QTreeWidgetItemIteratorPrivate(this, model));
model->iterators.append(this);
if (!model->rootItem->children.isEmpty()) current = model->rootItem->children.first();
if (current && !matchesFlags(current))
++(*this);
}
/*!
Constructs an iterator for the given \a item that uses the specified \a flags
to determine which items are found during iteration.
The iterator is set to point to \a item, or the next matching item if \a item
doesn't match the flags.
\sa QTreeWidgetItemIterator::IteratorFlag
*/
QTreeWidgetItemIterator::QTreeWidgetItemIterator(QTreeWidgetItem *item, IteratorFlags flags)
: d_ptr(new QTreeWidgetItemIteratorPrivate(
this, qobject_cast<QTreeModel*>(item->view->model()))),
current(item), flags(flags)
{
Q_D(QTreeWidgetItemIterator);
Q_ASSERT(item);
QTreeModel *model = qobject_cast<QTreeModel*>(item->view->model());
Q_ASSERT(model);
model->iterators.append(this);
// Initialize m_currentIndex and m_parentIndex as it would be if we had traversed from
// the beginning.
QTreeWidgetItem *parent = item;
parent = parent->parent();
QList<QTreeWidgetItem *> children = parent ? parent->children : d->m_model->rootItem->children;
d->m_currentIndex = children.indexOf(item);
while (parent) {
QTreeWidgetItem *itm = parent;
parent = parent->parent();
QList<QTreeWidgetItem *> children = parent ? parent->children : d->m_model->rootItem->children;
int index = children.indexOf(itm);
d->m_parentIndex.prepend(index);
}
if (current && !matchesFlags(current))
++(*this);
}
/*!
Destroys the iterator.
*/
QTreeWidgetItemIterator::~QTreeWidgetItemIterator()
{
d_func()->m_model->iterators.removeAll(this);
}
/*!
Assignment. Makes a copy of \a it and returns a reference to its
iterator.
*/
QTreeWidgetItemIterator &QTreeWidgetItemIterator::operator=(const QTreeWidgetItemIterator &it)
{
Q_D(QTreeWidgetItemIterator);
if (d_func()->m_model != it.d_func()->m_model) {
d_func()->m_model->iterators.removeAll(this);
it.d_func()->m_model->iterators.append(this);
}
current = it.current;
flags = it.flags;
d->operator=(*it.d_func());
return *this;
}
/*!
The prefix ++ operator (++it) advances the iterator to the next matching item
and returns a reference to the resulting iterator.
Sets the current pointer to 0 if the current item is the last matching item.
*/
QTreeWidgetItemIterator &QTreeWidgetItemIterator::operator++()
{
if (current)
do {
current = d_func()->next(current);
} while (current && !matchesFlags(current));
return *this;
}
/*!
The prefix -- operator (--it) advances the iterator to the previous matching item
and returns a reference to the resulting iterator.
Sets the current pointer to 0 if the current item is the first matching item.
*/
QTreeWidgetItemIterator &QTreeWidgetItemIterator::operator--()
{
if (current)
do {
current = d_func()->previous(current);
} while (current && !matchesFlags(current));
return *this;
}
/*!
\internal
*/
bool QTreeWidgetItemIterator::matchesFlags(const QTreeWidgetItem *item) const
{
if (!item)
return false;
if (flags == All)
return true;
{
Qt::ItemFlags itemFlags = item->flags();
if ((flags & Selectable) && !(itemFlags & Qt::ItemIsSelectable))
return false;
if ((flags & NotSelectable) && (itemFlags & Qt::ItemIsSelectable))
return false;
if ((flags & DragEnabled) && !(itemFlags & Qt::ItemIsDragEnabled))
return false;
if ((flags & DragDisabled) && (itemFlags & Qt::ItemIsDragEnabled))
return false;
if ((flags & DropEnabled) && !(itemFlags & Qt::ItemIsDropEnabled))
return false;
if ((flags & DropDisabled) && (itemFlags & Qt::ItemIsDropEnabled))
return false;
if ((flags & Enabled) && !(itemFlags & Qt::ItemIsEnabled))
return false;
if ((flags & Disabled) && (itemFlags & Qt::ItemIsEnabled))
return false;
if ((flags & Editable) && !(itemFlags & Qt::ItemIsEditable))
return false;
if ((flags & NotEditable) && (itemFlags & Qt::ItemIsEditable))
return false;
}
if (flags & (Checked|NotChecked)) {
// ### We only test the check state for column 0
Qt::CheckState check = item->checkState(0);
// PartiallyChecked matches as Checked.
if ((flags & Checked) && (check == Qt::Unchecked))
return false;
if ((flags & NotChecked) && (check != Qt::Unchecked))
return false;
}
if ((flags & HasChildren) && !item->childCount())
return false;
if ((flags & NoChildren) && item->childCount())
return false;
if ((flags & Hidden) && !item->isHidden())
return false;
if ((flags & NotHidden) && item->isHidden())
return false;
if ((flags & Selected) && !item->isSelected())
return false;
if ((flags & Unselected) && item->isSelected())
return false;
return true;
}
/*
* Implementation of QTreeWidgetItemIteratorPrivate
*/
QTreeWidgetItem* QTreeWidgetItemIteratorPrivate::nextSibling(const QTreeWidgetItem* item) const
{
Q_ASSERT(item);
QTreeWidgetItem *next = 0;
if (QTreeWidgetItem *par = item->parent()) {
int i = par->indexOfChild(const_cast<QTreeWidgetItem*>(item));
next = par->child(i + 1);
} else {
QTreeWidget *tw = item->treeWidget();
int i = tw->indexOfTopLevelItem(const_cast<QTreeWidgetItem*>(item));
next = tw->topLevelItem(i + 1);
}
return next;
}
QTreeWidgetItem *QTreeWidgetItemIteratorPrivate::next(const QTreeWidgetItem *current)
{
if (!current) return 0;
QTreeWidgetItem *next = 0;
if (current->childCount()) {
// walk the child
m_parentIndex.push(m_currentIndex);
m_currentIndex = 0;
next = current->child(0);
} else {
// walk the sibling
QTreeWidgetItem *parent = current->parent();
next = parent ? parent->child(m_currentIndex + 1)
: m_model->rootItem->child(m_currentIndex + 1);
while (!next && parent) {
// if we had no sibling walk up the parent and try the sibling of that
parent = parent->parent();
m_currentIndex = m_parentIndex.pop();
next = parent ? parent->child(m_currentIndex + 1)
: m_model->rootItem->child(m_currentIndex + 1);
}
if (next) ++(m_currentIndex);
}
return next;
}
QTreeWidgetItem *QTreeWidgetItemIteratorPrivate::previous(const QTreeWidgetItem *current)
{
if (!current) return 0;
QTreeWidgetItem *prev = 0;
// walk the previous sibling
QTreeWidgetItem *parent = current->parent();
prev = parent ? parent->child(m_currentIndex - 1)
: m_model->rootItem->child(m_currentIndex - 1);
if (prev) {
// Yes, we had a previous sibling but we need go down to the last leafnode.
--m_currentIndex;
while (prev && prev->childCount()) {
m_parentIndex.push(m_currentIndex);
m_currentIndex = prev->childCount() - 1;
prev = prev->child(m_currentIndex);
}
} else if (parent) {
m_currentIndex = m_parentIndex.pop();
prev = parent;
}
return prev;
}
void QTreeWidgetItemIteratorPrivate::ensureValidIterator(const QTreeWidgetItem *itemToBeRemoved)
{
Q_Q(QTreeWidgetItemIterator);
Q_ASSERT(itemToBeRemoved);
if (!q->current) return;
QTreeWidgetItem *nextItem = q->current;
// Do not walk to the ancestor to find the other item if they have the same parent.
if (nextItem->parent() != itemToBeRemoved->parent()) {
while (nextItem->parent() && nextItem != itemToBeRemoved) {
nextItem = nextItem->parent();
}
}
// If the item to be removed is an ancestor of the current iterator item,
// we need to adjust the iterator.
if (nextItem == itemToBeRemoved) {
QTreeWidgetItem *parent = nextItem;
nextItem = 0;
while (parent && !nextItem) {
nextItem = nextSibling(parent);
parent = parent->parent();
}
if (nextItem) {
// Ooooh... Set the iterator to the next valid item
*q = QTreeWidgetItemIterator(nextItem, q->flags);
if (!(q->matchesFlags(nextItem))) ++(*q);
} else {
// set it to null.
q->current = 0;
m_parentIndex.clear();
return;
}
}
if (nextItem->parent() == itemToBeRemoved->parent()) {
// They have the same parent, i.e. we have to adjust the m_currentIndex member of the iterator
// if the deleted item is to the left of the nextItem.
QTreeWidgetItem *par = itemToBeRemoved->parent(); // We know they both have the same parent.
QTreeWidget *tw = itemToBeRemoved->treeWidget(); // ..and widget
int indexOfItemToBeRemoved = par ? par->indexOfChild(const_cast<QTreeWidgetItem *>(itemToBeRemoved))
: tw->indexOfTopLevelItem(const_cast<QTreeWidgetItem *>(itemToBeRemoved));
int indexOfNextItem = par ? par->indexOfChild(nextItem) : tw->indexOfTopLevelItem(nextItem);
if (indexOfItemToBeRemoved <= indexOfNextItem) {
// A sibling to the left of us was deleted, adjust the m_currentIndex member of the iterator.
// Note that the m_currentIndex will be wrong until the item is actually removed!
m_currentIndex--;
}
}
}
/*!
\fn const QTreeWidgetItemIterator QTreeWidgetItemIterator::operator++(int)
The postfix ++ operator (it++) advances the iterator to the next matching item
and returns an iterator to the previously current item.
*/
/*!
\fn QTreeWidgetItemIterator &QTreeWidgetItemIterator::operator+=(int n)
Makes the iterator go forward by \a n matching items. (If n is negative, the
iterator goes backward.)
If the current item is beyond the last item, the current item pointer is
set to 0. Returns the resulting iterator.
*/
/*!
\fn const QTreeWidgetItemIterator QTreeWidgetItemIterator::operator--(int)
The postfix -- operator (it--) makes the preceding matching item current and returns an iterator to the previously current item.
*/
/*!
\fn QTreeWidgetItemIterator &QTreeWidgetItemIterator::operator-=(int n)
Makes the iterator go backward by \a n matching items. (If n is negative, the
iterator goes forward.)
If the current item is ahead of the last item, the current item pointer is
set to 0. Returns the resulting iterator.
*/
/*!
\fn QTreeWidgetItem *QTreeWidgetItemIterator::operator*() const
Dereference operator. Returns a pointer to the current item.
*/
/*!
\enum QTreeWidgetItemIterator::IteratorFlag
These flags can be passed to a QTreeWidgetItemIterator constructor
(OR-ed together if more than one is used), so that the iterator
will only iterate over items that match the given flags.
\value All
\value Hidden
\value NotHidden
\value Selected
\value Unselected
\value Selectable
\value NotSelectable
\value DragEnabled
\value DragDisabled
\value DropEnabled
\value DropDisabled
\value HasChildren
\value NoChildren
\value Checked
\value NotChecked
\value Enabled
\value Disabled
\value Editable
\value NotEditable
\value UserFlag
*/
QT_END_NAMESPACE
#endif // QT_NO_TREEWIDGET
|