3
// Copyright (C) 2004 Navel Ltd.
5
// This library is free software; you can redistribute it and/or
6
// modify it under the terms of the GNU Lesser General Public
7
// License as published by the Free Software Foundation; either
8
// version 2.1 of the License, or (at your option) any later version.
10
// This library is distributed in the hope that it will be useful,
11
// but WITHOUT ANY WARRANTY; without even the implied warranty of
12
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13
// Lesser General Public License for more details.
15
// You should have received a copy of the GNU Lesser General Public
16
// License along with this library; if not, write to the Free Software
17
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22
#ifndef __tools_smart_pointer_h
23
#define __tools_smart_pointer_h
27
template <class X> class SmartPointer
30
explicit SmartPointer( X* p = 0 ) throw() : m_pointer( p ) { m_prev = m_next = this; }
31
~SmartPointer() { release(); }
32
SmartPointer( const SmartPointer& p ) throw() { acquire( p ); }
33
SmartPointer& operator=( const SmartPointer& p )
43
X& operator*() const throw() { return *m_pointer; }
44
X* operator->() const throw() { return m_pointer; }
45
X* get() const throw() { return m_pointer; }
46
bool unique() const throw() { return m_prev ? m_prev == this : true; }
50
mutable const SmartPointer* m_prev;
51
mutable const SmartPointer* m_next;
53
void acquire( const SmartPointer& p ) throw()
55
m_pointer = p.m_pointer;
57
m_next->m_prev = this;
62
( const_cast<linked_ptr<X>*>( &p ) )->m_next = this;
68
if ( unique() ) delete m_pointer;
71
m_prev->m_next = m_next;
72
m_next->m_prev = m_prev;
80
#endif /* __tools_smart_pointer_h */