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
|
/***************************************************************************
* Copyright (C) 2006-2007 by Rajko Albrecht *
* [email protected] *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#ifndef SVNTQT_SHARED_POINTER_HPP
#define SVNTQT_SHARED_POINTER_HPP
#include "svnqt/smart_pointer.hpp"
/*!
* \file shared_pointer.hpp
* \brief shared pointer adapter
* \sa smart_pointer.hpp
*/
namespace svn
{
template<class T> class SharedPointer;
/*!
* Data container for svn::SharedPointer
*/
template<class T> class SharedPointerData:public ref_count
{
friend class SharedPointer<T>;
protected:
//! The protected pointer
T*data;
public:
//! Constructor
/*!
* Take ownership of pointer dt
* \param dt the data to wrap
**/
SharedPointerData(T*dt){
data = dt;
}
//! Destructor
/*!
* Release content data
*/
~SharedPointerData() {
delete data;
}
};
//! Shared pointer adapater
/*!
* Implements a thread safe reference counter around any pointer.
* This class takes ownership of data, eg., last reference will delete
* the data it inspects.
*/
template<class T> class SharedPointer
{
typedef SharedPointerData<T> Data;
Data*data;
//! count down reference of data and release if it was the last share
void unref(){
if (data) {
data->Decr();
if (!data->Shared()) {
delete data;
}
data = 0;
}
}
public:
//! empty constructor
SharedPointer():data(0){}
//! copy constructor
/*!
* \param p Data to increase reference for
*/
SharedPointer(const SharedPointer<T>& p)
{
if ( (data = p.data) ) data->Incr();
}
//! assignment constructor
/*!
* Take ownership of data pointer t
* \param t data pointer to store inside
*/
SharedPointer(T*t)
{
data = new Data(t);data->Incr();
}
//! destructor
/*!
* decrease reference, if reference == 0 release data
*/
~SharedPointer()
{
unref();
}
//! assignment operator
/*!
* \param p Data to increase reference for
*/
SharedPointer<T> &operator=(const SharedPointer<T>&p)
{
// we always have a reference to the data
if (data==p.data) return *this;
unref();
if ((data=p.data)) data->Incr();
return *this;
}
//! assignment operator
/*!
* \param p Data to increase reference for
*/
SharedPointer<T> &operator=(T*p)
{
if (data && data->data==p) {
return *this;
}
unref();
data = new Data(p);
data->Incr();
return *this;
}
//! access operator
/*!
* Use this operator with care!
* \return pointer to wrapped data
*/
operator T*()const {return data->data;}
//! access operator
/*!
* \return reference to wrapped data
*/
T& operator*() {return *data->data;}
//! access operator
/*!
* \return const reference to wrapped data
*/
const T& operator*()const{return *data->data;}
//! access operator
/*!
* \return pointer to wrapped data
*/
T*operator->() {return data->data;}
//! access operator
/*!
* \return const pointer to wrapped data
*/
const T*operator->()const{return data->data;}
//! Bool operator
/*!
* \return true if content set and not a null-pointer, otherwise false
*/
operator bool () const { return (data != 0 && data->data != 0); }
//! Bool operator
/*!
* \return true if content set and not a null-pointer, otherwise false
*/
operator bool () { return ( data != 0 && data->data != 0 );}
//! Negation operator
/*!
* \return true if content not set or a null-pointer, otherwise false
*/
bool operator! () const { return (data == 0 || data->data == 0); }
//! Negation operator
/*!
* \return true if content not set or a null-pointer, otherwise false
*/
bool operator! () { return (data == 0 || data->data == 0); }
};
}
#endif
|
