an efficient C++ finite element environment
|
|
Go to the documentation of this file. 1 #ifndef _RHEOLEF_STACK_ALLOCATOR_H
2 #define _RHEOLEF_STACK_ALLOCATOR_H
28 #include "rheolef/compiler.h"
29 #include "rheolef/pretty_name.h"
120 new(
reinterpret_cast<void*
>(
p) )
T(
c);
142 throw std::bad_alloc();
170 trace_macro (
"stack_allocator::mem_info cstor NULL");
192 template <
typename T1>
195 return lhs.get_handler() == rhs.get_handler();
197 template <
typename T1>
200 return lhs.get_handler() != rhs.get_handler();
205 #endif // STACK_ALLOCATOR_H
handler_type(unsigned char *stack1, size_t size1)
bool operator!=(const heap_allocator< T1 > &lhs, const heap_allocator< T1 > &rhs)
const T & const_reference
check_macro(expr1.have_homogeneous_space(Xh1), "dual(expr1,expr2); expr1 should have homogeneous space. HINT: use dual(interpolate(Xh, expr1),expr2)")
std::ptrdiff_t difference_type
stack_allocator & operator=(const stack_allocator &sa)
pointer address(reference r) const
void construct(pointer p, const_reference c)
pointer allocate(size_type n, const void *=NULL)
bool operator==(const heap_allocator< T1 > &lhs, const heap_allocator< T1 > &rhs)
const handler_type * get_handler() const
size_type max_size() const
stack_allocator(const stack_allocator< U > &sa)
This file is part of Rheolef.
stack_allocator(const stack_allocator &sa)
void deallocate(pointer p, size_type n)
void construct(pointer p)
stack_allocator< U > other
const_pointer address(const_reference c) const
stack_allocator(unsigned char *stack, size_t stack_size)
#define trace_macro(message)