|
| Pool (size_t const &capacity) |
| Create a pool with a certain capacity.
|
|
std::deque< std::shared_ptr< T > >::iterator | begin () |
| Getter to the iterator to the beginning of the Pool.
|
|
std::deque< std::shared_ptr< T > >::iterator | end () |
| Getter to the iterator to the end of the Pool.
|
|
size_t | size () |
| Getter to the pool's size.
|
|
bool | empty () |
| Returns true if the Pool is empty. (Thus begin() would equal end()).
|
|
size_t | capacity () const |
| Getter to the pool's capacity.
|
|
void | push_back (std::shared_ptr< T > const &data) |
| The function creates an element at the end of the pool and assigns the given data to it. Once inserted one waiting thread is woken up.
|
|
std::shared_ptr< T > | pop_front () |
| Extract an element from the queue. If none is available wait until one become available.
|
|
template<class T>
class hh::tool::Pool< T >
Pool of data used by the memory manager.
- Template Parameters
-
Definition at line 39 of file pool.h.