blob: 71a2281685c3e5e4550a8aaa7cd1c84fd9a5cc19 (
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
|
/*
This file is part of libkcal.
Copyright (c) 2003 Cornelius Schumacher <schumacher@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 KCAL_LISTBASE_H
#define KCAL_LISTBASE_H
#include <qvaluelist.h>
namespace KCal {
/**
This class provides a template for lists of pointers.
It extends QValueList<T *> by auto delete funtionality known from QPtrList.
*/
template<class T>
class ListBase : public QValueList<T *>
{
public:
ListBase()
: QValueList<T *>(), mAutoDelete( false )
{
}
ListBase( const ListBase &l )
: QValueList<T *>( l ), mAutoDelete( false )
{
}
~ListBase()
{
if ( mAutoDelete ) {
QValueListIterator<T *> it;
for( it = QValueList<T*>::begin(); it != QValueList<T*>::end(); ++it ) {
delete *it;
}
}
}
ListBase &operator=( const ListBase &l )
{
if ( this == &l ) return *this;
QValueList<T *>::operator=( l );
return *this;
}
void setAutoDelete( bool autoDelete )
{
mAutoDelete = autoDelete;
}
bool removeRef( T *t )
{
QValueListIterator<T *> it = find( t );
if ( it == QValueList<T*>::end() ) {
return false;
} else {
if ( mAutoDelete ) delete t;
this->remove( it );
return true;
}
}
void clearAll()
{
if ( mAutoDelete ) {
for ( QValueListIterator<T*> it = QValueList<T*>::begin();
it != QValueList<T*>::end(); ++it ) {
delete *it;
}
}
QValueList<T*>::clear();
}
private:
bool mAutoDelete;
};
}
#endif
|
