Lines Matching defs:list
17 * std::list such that for data types with alignment issues the correct allocator
24 class list<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
25 : public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
27 typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \
33 explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \
35 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \
36 list(const list& c) : list_base(c) {} \
37 explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {} \
38 list(iterator start, iterator end) : list_base(start, end) {} \
39 list& operator=(const list& x) { \
46 // check whether we really need the std::list specialization
47 #if !EIGEN_HAS_CXX11_CONTAINERS && !(defined(_GLIBCXX_LIST) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::list::resize(size_type,const T&). */
59 explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \
61 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
63 list(const list& c) : list_base(c) {} \
64 explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {} \
65 list(iterator start, iterator end) : list_base(start, end) {} \
66 list& operator=(const list& x) { \
72 class list<T,EIGEN_ALIGNED_ALLOCATOR<T> >
73 : public list<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
76 typedef list<EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T),
92 // workaround MSVC std::list implementation
