Linked allocator template to gather linked objects. More...
#include <containers.h>
Inheritance diagram for ucommon::linked_allocator< T >:
Collaboration diagram for ucommon::linked_allocator< T >:
Public Member Functions | |
| T * | get (void) |
| T * | get (timeout_t timeout) |
| linked_allocator (size_t size) | |
| void | release (T *node) |
 Public Member Functions inherited from ucommon::LinkedAllocator | |
| operator bool () | |
| Test if there is still objects in the free list. More... | |
| bool | operator! () |
| Test if the free list is empty. More... | |
Additional Inherited Members | |
| Protected Member Functions inherited from ucommon::LinkedAllocator | |
| LinkedObject * | get (void) |
| LinkedObject * | get (timeout_t timeout) |
| void | release (LinkedObject *node) |
| Protected Attributes inherited from ucommon::LinkedAllocator | |
| LinkedObject * | freelist |
Detailed Description
template<class T>
class ucommon::linked_allocator< T >
Linked allocator template to gather linked objects.
This allocates the object pool in a single array as a single heap allocation, and releases the whole pool with a single delete when done. It is also threadsafe. The types used must be derived of LinkedObject.
Definition at line 397 of file containers.h.
The documentation for this class was generated from the following file:
- ucommon/containers.h
