an efficient C++ finite element environment
|
|
Go to the documentation of this file. 1 #ifndef _RHEOLEF_VEC_CONCAT_H
2 #define _RHEOLEF_VEC_CONCAT_H
25 #include "rheolef/vec.h"
27 namespace rheolef {
namespace details {
34 static int constraint_process_rank (
const communicator& comm = communicator()) {
return 0; }
36 template <
class T,
class M>
44 =
typename std::enable_if<
60 template <
class T,
class M>
73 typedef typename std::initializer_list<value_type>::const_iterator
const_iterator;
81 std::list<value_type>
_l;
88 template <
class T,
class M>
93 return details::constraint_process_rank (base::comm());
95 template <
class T,
class M>
102 template <
class T,
class M>
113 #endif // _RHEOLEF_VEC_CONCAT_H
vec< T, M > & operator=(const vec< T, M > &x)
vec< T, M >::size_type size_type
vec< T, M > build_vec() const
vec_concat_value(const std::vector< T > &x)
see the vec page for the full documentation
std::list< value_type > _l
vec_concat(const std::initializer_list< value_type > &il)
vec_concat_value(const vec< T, M > &x)
This file is part of Rheolef.
vec_concat_value< T, M > value_type
vec_concat_value(const U &x)
int constraint_process_rank() const
base::size_type size_type