Classes | Namespaces | Macros
StdDeque.h File Reference
#include "details.h"
Include dependency graph for StdDeque.h:

Go to the source code of this file.

Classes

class  std::deque< T, EIGEN_ALIGNED_ALLOCATOR< T > >
 

Namespaces

 std
 

Macros

#define EIGEN_DEFINE_STL_DEQUE_SPECIALIZATION(...)
 
#define EIGEN_STD_DEQUE_SPECIALIZATION_BODY
 

Macro Definition Documentation

#define EIGEN_DEFINE_STL_DEQUE_SPECIALIZATION (   ...)
Value:
namespace std \
{ \
template<> \
class deque<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
: public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
{ \
typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \
public: \
typedef __VA_ARGS__ value_type; \
typedef deque_base::allocator_type allocator_type; \
typedef deque_base::size_type size_type; \
typedef deque_base::iterator iterator; \
explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
template<typename InputIterator> \
deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \
deque(const deque& c) : deque_base(c) {} \
explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
deque(iterator start, iterator end) : deque_base(start, end) {} \
deque& operator=(const deque& x) { \
deque_base::operator=(x); \
return *this; \
} \
}; \
}
constexpr int last(int, int result)
Scalar Scalar * c
Definition: benchVecAdd.cpp:17
Definition: Half.h:150
if n return
Array33i a
constexpr int first(int i)
Implementation details for constexpr functions.
set noclip points set clip one set noclip two set bar set border lt lw set xdata set ydata set zdata set x2data set y2data set boxwidth set dummy x

This section contains a convenience MACRO which allows an easy specialization of std::deque such that for data types with alignment issues the correct allocator is used automatically.

Definition at line 21 of file StdDeque.h.

#define EIGEN_STD_DEQUE_SPECIALIZATION_BODY
Value:
public: \
typedef T value_type; \
typedef typename deque_base::allocator_type allocator_type; \
typedef typename deque_base::size_type size_type; \
typedef typename deque_base::iterator iterator; \
typedef typename deque_base::const_iterator const_iterator; \
explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
template<typename InputIterator> \
deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
: deque_base(first, last, a) {} \
deque(const deque& c) : deque_base(c) {} \
explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
deque(iterator start, iterator end) : deque_base(start, end) {} \
deque& operator=(const deque& x) { \
deque_base::operator=(x); \
return *this; \
}
constexpr int last(int, int result)
Scalar Scalar * c
Definition: benchVecAdd.cpp:17
if n return
Array33i a
constexpr int first(int i)
Implementation details for constexpr functions.
set noclip points set clip one set noclip two set bar set border lt lw set xdata set ydata set zdata set x2data set y2data set boxwidth set dummy x

Definition at line 52 of file StdDeque.h.



gtsam
Author(s):
autogenerated on Sat May 8 2021 02:51:40