a typed memory pool that saves time spent allocation small object. This is typically used by container such as DataVector and DataList
More...
#include <DataPool.h>
|
| static const std::string & | typeName () |
| | typename of pool
|
| static const std::string & | typeName () |
| | typename of pool
|
| static const std::string & | typeName () |
| | typename of pool
|
template<typename VALUE>
class DataPool< VALUE >
a typed memory pool that saves time spent allocation small object. This is typically used by container such as DataVector and DataList
- Author
- Srini Rajagopalan - ATLAS Collaboration
- Id
- DataPool.h,v 1.5 2003/08/19 23:52:06 calaf Exp
Definition at line 30 of file Event/GeneratorObject/include/DataModel/DataPool.h.
◆ const_iterator [1/3]
template<typename VALUE>
| typedef Pool::const_iterator DataPool< VALUE >::const_iterator |
◆ const_iterator [2/3]
template<typename VALUE>
| typedef Pool::const_iterator DataPool< VALUE >::const_iterator |
◆ const_iterator [3/3]
template<typename VALUE>
| typedef Pool::const_iterator DataPool< VALUE >::const_iterator |
◆ iterator [1/3]
template<typename VALUE>
| typedef Pool::iterator DataPool< VALUE >::iterator |
◆ iterator [2/3]
template<typename VALUE>
| typedef Pool::iterator DataPool< VALUE >::iterator |
◆ iterator [3/3]
template<typename VALUE>
| typedef Pool::iterator DataPool< VALUE >::iterator |
◆ pointer [1/3]
template<typename VALUE>
| typedef Pool::pointer DataPool< VALUE >::pointer |
◆ pointer [2/3]
template<typename VALUE>
| typedef Pool::pointer DataPool< VALUE >::pointer |
◆ pointer [3/3]
template<typename VALUE>
| typedef Pool::pointer DataPool< VALUE >::pointer |
◆ Pool [1/3]
template<typename VALUE>
| typedef std::vector<VALUE*> DataPool< VALUE >::Pool |
◆ Pool [2/3]
template<typename VALUE>
| typedef std::vector<VALUE*> DataPool< VALUE >::Pool |
◆ Pool [3/3]
template<typename VALUE>
| typedef std::vector<VALUE*> DataPool< VALUE >::Pool |
◆ reference [1/3]
template<typename VALUE>
| typedef Pool::reference DataPool< VALUE >::reference |
◆ reference [2/3]
template<typename VALUE>
| typedef Pool::reference DataPool< VALUE >::reference |
◆ reference [3/3]
template<typename VALUE>
| typedef Pool::reference DataPool< VALUE >::reference |
◆ size_type [1/3]
template<typename VALUE>
| typedef Pool::size_type DataPool< VALUE >::size_type |
◆ size_type [2/3]
template<typename VALUE>
| typedef Pool::size_type DataPool< VALUE >::size_type |
◆ size_type [3/3]
template<typename VALUE>
| typedef Pool::size_type DataPool< VALUE >::size_type |
◆ DataPool() [1/9]
Constructors:
default constructor will initialize the pool with m_minRefCount
◆ DataPool() [2/9]
◆ DataPool() [3/9]
◆ ~DataPool() [1/3]
◆ DataPool() [4/9]
Constructors:
default constructor will initialize the pool with m_minRefCount
◆ DataPool() [5/9]
◆ DataPool() [6/9]
◆ ~DataPool() [2/3]
◆ DataPool() [7/9]
Constructors:
default constructor will initialize the pool with m_minRefCount
◆ DataPool() [8/9]
◆ DataPool() [9/9]
◆ ~DataPool() [3/3]
◆ addRef() [1/3]
template<typename VALUE>
| virtual unsigned long DataPool< VALUE >::addRef |
( |
| ) |
|
|
virtual |
methods to adhere to IInterface:
◆ addRef() [2/3]
template<typename VALUE>
| virtual unsigned long DataPool< VALUE >::addRef |
( |
| ) |
|
|
virtual |
methods to adhere to IInterface:
◆ addRef() [3/3]
template<typename VALUE>
| virtual unsigned long DataPool< VALUE >::addRef |
( |
| ) |
|
|
virtual |
methods to adhere to IInterface:
◆ allocated() [1/3]
template<typename VALUE>
| unsigned int DataPool< VALUE >::allocated |
( |
| ) |
|
|
inline |
◆ allocated() [2/3]
template<typename VALUE>
| unsigned int DataPool< VALUE >::allocated |
( |
| ) |
|
|
inline |
◆ allocated() [3/3]
template<typename VALUE>
| unsigned int DataPool< VALUE >::allocated |
( |
| ) |
|
|
inline |
◆ begin() [1/6]
begin iterators over pool
◆ begin() [2/6]
begin iterators over pool
◆ begin() [3/6]
begin iterators over pool
◆ begin() [4/6]
◆ begin() [5/6]
◆ begin() [6/6]
◆ capacity() [1/3]
template<typename VALUE>
| unsigned int DataPool< VALUE >::capacity |
( |
| ) |
|
|
inline |
◆ capacity() [2/3]
template<typename VALUE>
| unsigned int DataPool< VALUE >::capacity |
( |
| ) |
|
|
inline |
◆ capacity() [3/3]
template<typename VALUE>
| unsigned int DataPool< VALUE >::capacity |
( |
| ) |
|
|
inline |
◆ end() [1/6]
the end() method will allow looping over only valid elements and not over ALL elements of the pool
◆ end() [2/6]
the end() method will allow looping over only valid elements and not over ALL elements of the pool
◆ end() [3/6]
the end() method will allow looping over only valid elements and not over ALL elements of the pool
◆ end() [4/6]
◆ end() [5/6]
◆ end() [6/6]
◆ erase() [1/3]
erase the pool and initializes m_minRefCount default elements
◆ erase() [2/3]
erase the pool and initializes m_minRefCount default elements
◆ erase() [3/3]
erase the pool and initializes m_minRefCount default elements
◆ handle() [1/3]
template<typename VALUE>
| void DataPool< VALUE >::handle |
( |
const Incident & | | ) |
|
◆ handle() [2/3]
template<typename VALUE>
| void DataPool< VALUE >::handle |
( |
const Incident & | | ) |
|
◆ handle() [3/3]
template<typename VALUE>
| void DataPool< VALUE >::handle |
( |
const Incident & | | ) |
|
◆ initialize() [1/3]
◆ initialize() [2/3]
◆ initialize() [3/3]
◆ mem() [1/3]
obtain the next available element in pool by pointer return as void* to minimize misuse, client usage is: MyElement* m = new(pool->mem) MyElement(...); // pool is ptr
◆ mem() [2/3]
obtain the next available element in pool by pointer return as void* to minimize misuse, client usage is: MyElement* m = new(pool->mem) MyElement(...); // pool is ptr
◆ mem() [3/3]
obtain the next available element in pool by pointer return as void* to minimize misuse, client usage is: MyElement* m = new(pool->mem) MyElement(...); // pool is ptr
◆ nextElementRef() [1/3]
should we allow clients to get a reference? obtain the next available element in pool by reference pool is resized if reached its limit
◆ nextElementRef() [2/3]
should we allow clients to get a reference? obtain the next available element in pool by reference pool is resized if reached its limit
◆ nextElementRef() [3/3]
should we allow clients to get a reference? obtain the next available element in pool by reference pool is resized if reached its limit
◆ operator()() [1/3]
template<typename VALUE>
| void * DataPool< VALUE >::operator() |
( |
| ) |
|
can also say: MyElement* m = new ((pool)()) MyElement(...); // pool = pointer MyElement m = new (pool()) MyElement(...); // pool = value
◆ operator()() [2/3]
template<typename VALUE>
| void * DataPool< VALUE >::operator() |
( |
| ) |
|
can also say: MyElement* m = new ((pool)()) MyElement(...); // pool = pointer MyElement m = new (pool()) MyElement(...); // pool = value
◆ operator()() [3/3]
template<typename VALUE>
| void * DataPool< VALUE >::operator() |
( |
| ) |
|
can also say: MyElement* m = new ((pool)()) MyElement(...); // pool = pointer MyElement m = new (pool()) MyElement(...); // pool = value
◆ queryInterface() [1/3]
template<typename VALUE>
| virtual StatusCode DataPool< VALUE >::queryInterface |
( |
const InterfaceID & | riid, |
|
|
void ** | ppvInterface ) |
|
virtual |
◆ queryInterface() [2/3]
template<typename VALUE>
| virtual StatusCode DataPool< VALUE >::queryInterface |
( |
const InterfaceID & | riid, |
|
|
void ** | ppvInterface ) |
|
virtual |
◆ queryInterface() [3/3]
template<typename VALUE>
| virtual StatusCode DataPool< VALUE >::queryInterface |
( |
const InterfaceID & | riid, |
|
|
void ** | ppvInterface ) |
|
virtual |
◆ release() [1/3]
template<typename VALUE>
| virtual unsigned long DataPool< VALUE >::release |
( |
| ) |
|
|
virtual |
◆ release() [2/3]
template<typename VALUE>
| virtual unsigned long DataPool< VALUE >::release |
( |
| ) |
|
|
virtual |
◆ release() [3/3]
template<typename VALUE>
| virtual unsigned long DataPool< VALUE >::release |
( |
| ) |
|
|
virtual |
◆ reset() [1/3]
reset refCount... but not maxRefCount.
◆ reset() [2/3]
reset refCount... but not maxRefCount.
◆ reset() [3/3]
reset refCount... but not maxRefCount.
◆ resizePool() [1/3]
resize pool if usage exceeds capacity:
◆ resizePool() [2/3]
resize pool if usage exceeds capacity:
◆ resizePool() [3/3]
resize pool if usage exceeds capacity:
◆ setSize() [1/3]
template<typename VALUE>
| void DataPool< VALUE >::setSize |
( |
unsigned int | size | ) |
|
◆ setSize() [2/3]
template<typename VALUE>
| void DataPool< VALUE >::setSize |
( |
unsigned int | size | ) |
|
◆ setSize() [3/3]
template<typename VALUE>
| void DataPool< VALUE >::setSize |
( |
unsigned int | size | ) |
|
◆ typeName() [1/3]
template<typename VALUE>
| const std::string & DataPool< VALUE >::typeName |
( |
| ) |
|
|
static |
◆ typeName() [2/3]
template<typename VALUE>
| const std::string & DataPool< VALUE >::typeName |
( |
| ) |
|
|
static |
◆ typeName() [3/3]
template<typename VALUE>
| const std::string & DataPool< VALUE >::typeName |
( |
| ) |
|
|
static |
The documentation for this class was generated from the following files: