A list class for reference counted objects. More...
#include <smrtptr.h>
Inheritance diagram for a2dSmrtPtrList< T >:
Collaboration diagram for a2dSmrtPtrList< T >:
Public Types | |
|
typedef a2dlist< a2dSmrtPtr< T > >::iterator | itSmart |
|
typedef a2dlist< a2dSmrtPtr< T > >::const_iterator | const_itSmart |
Public Member Functions | |
| itSmart | Find (T *object) |
| Find a specific object. | |
| const_itSmart | Find (T *object) const |
| Find a specific object. | |
| int | IndexOf (T *object) const |
| Find the index of a specific object. | |
| bool | ReleaseObject (T *object) |
| release a certain object from the list | |
 Public Member Functions inherited from a2dlist< a2dSmrtPtr< T > > | |
| a2dlist () | |
| Default constructor. | |
| a2dlist (const a2dlist &other) | |
| Copy constructor. | |
| ~a2dlist () | |
| Destructor. | |
|
a2dlist< a2dSmrtPtr< T > >::const_iterator | item (size_t index) const |
|
a2dlist< a2dSmrtPtr< T > >::iterator | item (size_t index) |
|
a2dlist< a2dSmrtPtr< T > >::reverse_iterator | rerase (typename std::list< a2dSmrtPtr< T >, std::allocator< a2dSmrtPtr< T > > >::reverse_iterator iterr) |
|
std::list< a2dSmrtPtr< T > , std::allocator< a2dSmrtPtr < T > > >::iterator | GetPreviousAround (typename std::list< a2dSmrtPtr< T >, std::allocator< a2dSmrtPtr< T > > >::iterator iter) |
| get the previous node ( –end() if no previous ) | |
|
std::list< a2dSmrtPtr< T > , std::allocator< a2dSmrtPtr < T > > >::iterator | GetNextAround (typename std::list< a2dSmrtPtr< T >, std::allocator< a2dSmrtPtr< T > > >::iterator iter) |
| get the next node ( begin() if no next ) | |
Detailed Description
template<class T>
class a2dSmrtPtrList< T >
A list class for reference counted objects.
The list uses a2dSmrtPtr for reference counting, and therefore objects which reach refcount zero will be deleted automatically.
The documentation for this class was generated from the following files: