|
template<typename T1 , std::size_t t1, typename T2 , std::size_t t2> |
bool | Dune::operator== (const PoolAllocator< T1, t1 > &, const PoolAllocator< T2, t2 > &) |
|
template<typename T1 , std::size_t t1, typename T2 , std::size_t t2> |
bool | Dune::operator!= (const PoolAllocator< T1, t1 > &, const PoolAllocator< T2, t2 > &) |
|
template<typename T , std::size_t t1, std::size_t t2> |
bool | Dune::operator== (const PoolAllocator< T, t1 > &p1, const PoolAllocator< T, t2 > &p2) |
|
template<typename T , std::size_t t1, std::size_t t2> |
bool | Dune::operator!= (const PoolAllocator< T, t1 > &p1, const PoolAllocator< T, t2 > &p2) |
|
template<typename T , std::size_t t1, std::size_t t2> |
bool | Dune::operator== (const PoolAllocator< void, t1 > &, const PoolAllocator< T, t2 > &) |
|
template<typename T , std::size_t t1, std::size_t t2> |
bool | Dune::operator!= (const PoolAllocator< void, t1 > &, const PoolAllocator< T, t2 > &) |
|
template<std::size_t t1, std::size_t t2> |
bool | Dune::operator== (const PoolAllocator< void, t1 > &p1, const PoolAllocator< void, t2 > &p2) |
|
template<std::size_t t1, std::size_t t2> |
bool | Dune::operator!= (const PoolAllocator< void, t1 > &p1, const PoolAllocator< void, t2 > &p2) |
|
| Dune::Pool< T, s >::Pool () |
| Constructor.
|
|
| Dune::Pool< T, s >::~Pool () |
| Destructor.
|
|
void | Dune::Pool< T, s >::print (std::ostream &os) |
| Print elements in pool for debugging.
|
|
void | Dune::Pool< T, s >::free (void *o) |
| Free an object.
|
|
void * | Dune::Pool< T, s >::allocate () |
| Get a new or recycled object.
|
|
| Dune::PoolAllocator< T, s >::PoolAllocator () |
| Constructor.
|
|
pointer | Dune::PoolAllocator< T, s >::allocate (std::size_t n, const_pointer hint=0) |
| Allocates objects.
|
|
void | Dune::PoolAllocator< T, s >::deallocate (pointer p, std::size_t n) |
| Free objects.
|
|
void | Dune::PoolAllocator< T, s >::construct (pointer p, const_reference value) |
| Construct an object.
|
|
void | Dune::PoolAllocator< T, s >::destroy (pointer p) |
| Destroy an object without freeing memory.
|
|
Implementations of the STL allocator concept.