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
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtQml module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, 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, Digia gives you certain additional
** rights. These rights are described in the Digia 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.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qintrusivelist_p.h"
/*!
\class QIntrusiveList
\brief The QIntrusiveList class is a template class that provides a list of objects using static storage.
\internal
QIntrusiveList creates a linked list of objects. Adding and removing objects from the
QIntrusiveList is a constant time operation and is very quick. The list performs no memory
allocations, but does require the objects being added to the list to contain a QIntrusiveListNode
instance for the list's use. Even so, for small lists QIntrusiveList uses less memory than Qt's
other list classes.
As QIntrusiveList uses storage inside the objects in the list, each object can only be in one
list at a time. Objects are inserted by the insert() method. If the object is already
in a list (including the one it is being inserted into) it is first removed, and then inserted
at the head of the list. QIntrusiveList is a last-in-first-out list. That is, following an
insert() the inserted object becomes the list's first() object.
\code
struct MyObject {
MyObject(int value) : value(value) {}
int value;
QIntrusiveListNode node;
};
typedef QIntrusiveList<MyObject, &MyObject::node> MyObjectList;
void foo() {
MyObjectList list;
MyObject m0(0);
MyObject m1(1);
MyObject m2(2);
list.insert(&m0);
list.insert(&m1);
list.insert(&m2);
// QIntrusiveList is LIFO, so will print: 2... 1... 0...
for (MyObjectList::iterator iter = list.begin(); iter != list.end(); ++iter) {
qWarning() << iter->value;
}
}
\endcode
*/
/*!
\fn QIntrusiveList::QIntrusiveList();
Construct an empty list.
*/
/*!
\fn QIntrusiveList::~QIntrusiveList();
Destroy the list. All entries are removed.
*/
/*!
\fn void QIntrusiveList::insert(N *object);
Insert \a object into the list. If \a object is a member of this, or another list, it will be
removed and inserted at the head of this list.
*/
/*!
\fn void QIntrusiveList::remove(N *object);
Remove \a object from the list. \a object must not be null.
*/
/*!
\fn bool QIntrusiveList::contains(N *object) const
Returns true if the list contains \a object; otherwise returns false.
*/
/*!
\fn N *QIntrusiveList::first() const
Returns the first entry in this list, or null if the list is empty.
*/
/*!
\fn N *QIntrusiveList::next(N *current)
Returns the next object after \a current, or null if \a current is the last object. \a current cannot be null.
*/
/*!
\fn iterator QIntrusiveList::begin()
Returns an STL-style interator pointing to the first item in the list.
\sa end()
*/
/*!
\fn iterator QIntrusiveList::end()
Returns an STL-style iterator pointing to the imaginary item after the last item in the list.
\sa begin()
*/
/*!
\fn iterator &QIntrusiveList::iterator::erase()
Remove the current object from the list, and return an iterator to the next element.
*/
/*!
\fn QIntrusiveListNode::QIntrusiveListNode()
Create a QIntrusiveListNode.
*/
/*!
\fn QIntrusiveListNode::~QIntrusiveListNode()
Destroy the QIntrusiveListNode. If the node is in a list, it is removed.
*/
/*!
\fn void QIntrusiveListNode::remove()
If in a list, remove this node otherwise do nothing.
*/
/*!
\fn bool QIntrusiveListNode::isInList() const
Returns true if this node is in a list, false otherwise.
*/
|
