1 // Baruch Even baruch@ev-en.org 2001-02-20
2 // This version is a modified version for use in LyX
3 // The modifications are done in order to use it where exceptions are disabled
4 // Currently it has no "no memory" checks in place, asserts are probably the
6 // all changed are #ifded'ed by LYX_NO_EXCEPTIONS
7 #define LYX_NO_EXCEPTIONS
9 // Boost smart_ptr.hpp header file -----------------------------------------//
11 // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. Permission to copy,
12 // use, modify, sell and distribute this software is granted provided this
13 // copyright notice appears in all copies. This software is provided "as is"
14 // without express or implied warranty, and with no claim as to its
15 // suitability for any purpose.
17 // See http://www.boost.org for most recent version including documentation.
20 // 21 May 01 Require complete type where incomplete type is unsafe.
21 // (suggested by Vladimir Prus)
22 // 21 May 01 operator= fails if operand transitively owned by *this, as in a
23 // linked list (report by Ken Johnson, fix by Beman Dawes)
24 // 21 Jan 01 Suppress some useless warnings with MSVC (David Abrahams)
25 // 19 Oct 00 Make shared_ptr ctor from auto_ptr explicit. (Robert Vugts)
26 // 24 Jul 00 Change throw() to // never throws. See lib guidelines
27 // Exception-specification rationale. (Beman Dawes)
28 // 22 Jun 00 Remove #if continuations to fix GCC 2.95.2 problem (Beman Dawes)
29 // 1 Feb 00 Additional shared_ptr BOOST_NO_MEMBER_TEMPLATES workarounds
31 // 31 Dec 99 Condition tightened for no member template friend workaround
33 // 30 Dec 99 Moved BOOST_NMEMBER_TEMPLATES compatibility code to config.hpp
35 // 30 Nov 99 added operator ==, operator !=, and std::swap and std::less
36 // specializations for shared types (Darin Adler)
37 // 11 Oct 99 replaced op[](int) with op[](std::size_t) (Ed Brey, Valentin
38 // Bonnard), added shared_ptr workaround for no member template
39 // friends (Matthew Langston)
40 // 25 Sep 99 added shared_ptr::swap and shared_array::swap (Luis Coelho).
41 // 20 Jul 99 changed name to smart_ptr.hpp, #include <boost/config.hpp>,
42 // #include <boost/utility.hpp> and use boost::noncopyable
43 // 17 May 99 remove scoped_array and shared_array operator*() as
44 // unnecessary (Beman Dawes)
45 // 14 May 99 reorder code so no effects when bad_alloc thrown (Abrahams/Dawes)
46 // 13 May 99 remove certain throw() specifiers to avoid generated try/catch
47 // code cost (Beman Dawes)
48 // 11 May 99 get() added, conversion to T* placed in macro guard (Valentin
49 // Bonnard, Dave Abrahams, and others argued for elimination
50 // of the automatic conversion)
51 // 28 Apr 99 #include <memory> fix (Valentin Bonnard)
52 // 28 Apr 99 rename transfer() to share() for clarity (Dave Abrahams)
53 // 28 Apr 99 remove unsafe shared_array template conversions(Valentin Bonnard)
54 // 28 Apr 99 p(r) changed to p(r.px) for clarity (Dave Abrahams)
55 // 21 Apr 99 reset() self assignment fix (Valentin Bonnard)
56 // 21 Apr 99 dispose() provided to improve clarity (Valentin Bonnard)
57 // 27 Apr 99 leak when new throws fixes (Dave Abrahams)
58 // 21 Oct 98 initial Version (Greg Colvin/Beman Dawes)
60 #ifndef BOOST_SMART_PTR_HPP
61 #define BOOST_SMART_PTR_HPP
63 #include <boost/config.hpp> // for broken compiler workarounds
64 #include <cstddef> // for std::size_t
65 #include <memory> // for std::auto_ptr
66 #include <algorithm> // for std::swap
67 #include <boost/utility.hpp> // for boost::noncopyable, checked_delete, checked_array_delete
68 #include <functional> // for std::less
69 #include <boost/static_assert.hpp> // for BOOST_STATIC_ASSERT
71 #ifdef LYX_NO_EXCEPTIONS
75 #ifdef BOOST_MSVC // moved here to work around VC++ compiler crash
76 # pragma warning(push)
77 # pragma warning(disable:4284) // return type for 'identifier::operator->' is not a UDT or reference to a UDT. Will produce errors if applied using infix notation
82 // scoped_ptr --------------------------------------------------------------//
84 // scoped_ptr mimics a built-in pointer except that it guarantees deletion
85 // of the object pointed to, either on destruction of the scoped_ptr or via
86 // an explicit reset(). scoped_ptr is a simple solution for simple needs;
87 // see shared_ptr (below) or std::auto_ptr if your needs are more complex.
89 template<typename T> class scoped_ptr : noncopyable {
94 typedef T element_type;
96 explicit scoped_ptr( T* p=0 ) : ptr(p) {} // never throws
97 ~scoped_ptr() { checked_delete(ptr); }
98 void reset( T* p=0 ) { if ( ptr != p ) { checked_delete(ptr); ptr =
100 T& operator*() const { return *ptr; } // never throws
102 # pragma warning(push)
103 # pragma warning(disable:4284) // return type for 'identifier::operator->' is not a UDT or reference to a UDT. Will produce errors if applied using infix notation
105 T* operator->() const { return ptr; } // never throws
107 # pragma warning(pop)
109 T* get() const { return ptr; } // never throws
110 #ifdef BOOST_SMART_PTR_CONVERSION
111 // get() is safer! Define BOOST_SMART_PTR_CONVERSION at your own risk!
112 operator T*() const { return ptr; } // never throws
116 // scoped_array ------------------------------------------------------------//
118 // scoped_array extends scoped_ptr to arrays. Deletion of the array pointed to
119 // is guaranteed, either on destruction of the scoped_array or via an explicit
120 // reset(). See shared_array or std::vector if your needs are more complex.
122 template<typename T> class scoped_array : noncopyable {
127 typedef T element_type;
129 explicit scoped_array( T* p=0 ) : ptr(p) {} // never throws
130 ~scoped_array() { delete [] ptr; }
132 void reset( T* p=0 ) { if ( ptr != p ) {delete [] ptr; ptr=p;} }
134 T* get() const { return ptr; } // never throws
135 #ifdef BOOST_SMART_PTR_CONVERSION
136 // get() is safer! Define BOOST_SMART_PTR_CONVERSION at your own risk!
137 operator T*() const { return ptr; } // never throws
139 T& operator[](std::size_t i) const { return ptr[i]; } // never throws
143 // shared_ptr --------------------------------------------------------------//
145 // An enhanced relative of scoped_ptr with reference counted copy semantics.
146 // The object pointed to is deleted when the last shared_ptr pointing to it
147 // is destroyed or reset.
149 template<typename T> class shared_ptr {
151 typedef T element_type;
153 explicit shared_ptr(T* p =0) : px(p) {
154 #ifndef LYX_NO_EXCEPTIONS
155 try { pn = new long(1); } // fix: prevent leak if new throws
156 catch (...) { delete p; throw; }
163 shared_ptr(const shared_ptr& r) : px(r.px) { ++*(pn = r.pn); } // never throws
165 ~shared_ptr() { dispose(); }
167 shared_ptr& operator=(const shared_ptr& r) {
172 #if !defined( BOOST_NO_MEMBER_TEMPLATES )
174 shared_ptr(const shared_ptr<Y>& r) : px(r.px) { // never throws
177 #ifndef BOOST_NO_AUTO_PTR
179 explicit shared_ptr(std::auto_ptr<Y>& r) {
180 pn = new long(1); // may throw
181 px = r.release(); // fix: moved here to stop leak if new throws
186 shared_ptr& operator=(const shared_ptr<Y>& r) {
191 #ifndef BOOST_NO_AUTO_PTR
193 shared_ptr& operator=(std::auto_ptr<Y>& r) {
194 // code choice driven by guarantee of "no effect if new throws"
195 if (*pn == 1) { delete px; }
196 else { // allocate new reference counter
197 long * tmp = new long(1); // may throw
198 --*pn; // only decrement once danger of new throwing is past
200 } // allocate new reference counter
201 px = r.release(); // fix: moved here so doesn't leak if new throws
206 #ifndef BOOST_NO_AUTO_PTR
207 explicit shared_ptr(std::auto_ptr<T>& r) {
208 pn = new long(1); // may throw
209 px = r.release(); // fix: moved here to stop leak if new throws
212 shared_ptr& operator=(std::auto_ptr<T>& r) {
213 // code choice driven by guarantee of "no effect if new throws"
214 if (*pn == 1) { delete px; }
215 else { // allocate new reference counter
216 long * tmp = new long(1); // may throw
217 --*pn; // only decrement once danger of new throwing is past
219 } // allocate new reference counter
220 px = r.release(); // fix: moved here so doesn't leak if new throws
227 if ( px == p ) return; // fix: self-assignment safe
228 if (--*pn == 0) { delete px; }
229 else { // allocate new reference counter
230 #ifndef LYX_NO_EXCEPTIONS
231 try { pn = new long; } // fix: prevent leak if new throws
233 ++*pn; // undo effect of --*pn above to meet effects guarantee
241 } // allocate new reference counter
246 T& operator*() const { return *px; } // never throws
248 # pragma warning(push)
249 # pragma warning(disable:4284) // return type for 'identifier::operator->' is not a UDT or reference to a UDT. Will produce errors if applied using infix notation
251 T* operator->() const { return px; } // never throws
253 # pragma warning(pop)
255 T* get() const { return px; } // never throws
256 #ifdef BOOST_SMART_PTR_CONVERSION
257 // get() is safer! Define BOOST_SMART_PTR_CONVERSION at your own risk!
258 operator T*() const { return px; } // never throws
261 long use_count() const { return *pn; } // never throws
262 bool unique() const { return *pn == 1; } // never throws
264 void swap(shared_ptr<T>& other) // never throws
265 { std::swap(px,other.px); std::swap(pn,other.pn); }
267 // Tasteless as this may seem, making all members public allows member templates
268 // to work in the absence of member template friends. (Matthew Langston)
269 // Don't split this line into two; that causes problems for some GCC 2.95.2 builds
270 #if defined(BOOST_NO_MEMBER_TEMPLATES) || !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS )
274 T* px; // contained pointer
275 long* pn; // ptr to reference counter
277 // Don't split this line into two; that causes problems for some GCC 2.95.2 builds
278 #if !defined( BOOST_NO_MEMBER_TEMPLATES ) && !defined( BOOST_NO_MEMBER_TEMPLATE_FRIENDS )
279 template<typename Y> friend class shared_ptr;
282 void dispose() { if (--*pn == 0) { delete px; delete pn; } }
284 void share(T* rpx, long* rpn) {
293 template<typename T, typename U>
294 inline bool operator==(const shared_ptr<T>& a, const shared_ptr<U>& b)
295 { return a.get() == b.get(); }
297 template<typename T, typename U>
298 inline bool operator!=(const shared_ptr<T>& a, const shared_ptr<U>& b)
299 { return a.get() != b.get(); }
301 // shared_array ------------------------------------------------------------//
303 // shared_array extends shared_ptr to arrays.
304 // The array pointed to is deleted when the last shared_array pointing to it
305 // is destroyed or reset.
307 template<typename T> class shared_array {
309 typedef T element_type;
311 explicit shared_array(T* p =0) : px(p) {
312 #ifndef LYX_NO_EXCEPTIONS
313 try { pn = new long(1); } // fix: prevent leak if new throws
314 catch (...) { delete [] p; throw; }
321 shared_array(const shared_array& r) : px(r.px) // never throws
324 ~shared_array() { dispose(); }
326 shared_array& operator=(const shared_array& r) {
336 if ( px == p ) return; // fix: self-assignment safe
337 if (--*pn == 0) { delete [] px; }
338 else { // allocate new reference counter
339 #ifndef LYX_NO_EXCEPTIONS
340 try { pn = new long; } // fix: prevent leak if new throws
342 ++*pn; // undo effect of --*pn above to meet effects guarantee
350 } // allocate new reference counter
355 T* get() const { return px; } // never throws
356 #ifdef BOOST_SMART_PTR_CONVERSION
357 // get() is safer! Define BOOST_SMART_PTR_CONVERSION at your own risk!
358 operator T*() const { return px; } // never throws
360 T& operator[](std::size_t i) const { return px[i]; } // never throws
363 long use_count() const { return *pn; } // never throws
364 bool unique() const { return *pn == 1; } // never throws
366 void swap(shared_array<T>& other) // never throws
367 { std::swap(px,other.px); std::swap(pn,other.pn); }
371 T* px; // contained pointer
372 long* pn; // ptr to reference counter
374 void dispose() { if (--*pn == 0) { delete [] px; delete pn; } }
379 inline bool operator==(const shared_array<T>& a, const shared_array<T>& b)
380 { return a.get() == b.get(); }
383 inline bool operator!=(const shared_array<T>& a, const shared_array<T>& b)
384 { return a.get() != b.get(); }
388 // specializations for things in namespace std -----------------------------//
390 #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
394 // Specialize std::swap to use the fast, non-throwing swap that's provided
395 // as a member function instead of using the default algorithm which creates
396 // a temporary and uses assignment.
399 inline void swap(boost::shared_ptr<T>& a, boost::shared_ptr<T>& b)
403 inline void swap(boost::shared_array<T>& a, boost::shared_array<T>& b)
406 // Specialize std::less so we can use shared pointers and arrays as keys in
407 // associative collections.
409 // It's still a controversial question whether this is better than supplying
410 // a full range of comparison operators (<, >, <=, >=).
413 struct less< boost::shared_ptr<T> >
414 : binary_function<boost::shared_ptr<T>, boost::shared_ptr<T>, bool>
416 bool operator()(const boost::shared_ptr<T>& a,
417 const boost::shared_ptr<T>& b) const
418 { return less<T*>()(a.get(),b.get()); }
422 struct less< boost::shared_array<T> >
423 : binary_function<boost::shared_array<T>, boost::shared_array<T>, bool>
425 bool operator()(const boost::shared_array<T>& a,
426 const boost::shared_array<T>& b) const
427 { return less<T*>()(a.get(),b.get()); }
432 #endif // ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
434 #endif // BOOST_SMART_PTR_HPP