LCPQ/dft_tools
3
0
Fork 0
mirror of https://github.com/triqs/dft_tools synced 2025-01-12 22:18:23 +01:00
Code Issues Releases Wiki Activity

gf : clean product mesh

Browse Source 
- reinterpret array is much simple.
clean old code after check on various compilers
This commit is contained in:
Olivier Parcollet 2013-09-10 10:47:41 +02:00
parent 1a85f5a16c
commit e0f58aeb62
1 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
triqs/gfs/meshes/product.hpp
View File

@ -180,7 +180,9 @@ namespace triqs { namespace gfs {
template<typename ... Meshes, typename T, ull_t OptionsFlags >
arrays::array_view<T, sizeof...(Meshes),OptionsFlags, arrays::indexmaps::mem_layout::fortran_order(sizeof...(Meshes)) >
reinterpret_linear_array(mesh_product<Meshes...> const & m, arrays::array_view<T,1,OptionsFlags> const & A) {
static int constexpr rank = sizeof...(Meshes);
return { {m.all_size_as_mini_vector()}, A.storage()};
}
/* static int constexpr rank = sizeof...(Meshes);
typedef arrays::array_view<T, sizeof...(Meshes),OptionsFlags, arrays::indexmaps::mem_layout::fortran_order(rank)> return_t;
typedef typename return_t::indexmap_type im_t;
auto l = m.all_size_as_mini_vector();
@ -188,7 +190,11 @@ namespace triqs { namespace gfs {
std::ptrdiff_t s= 1;
for (int u=0; u<rank; ++u) { sv[u] = s; s *= l[u];} // fortran type folding
return return_t (im_t (l,sv,0) , A.storage());
}
// why fortran ??
// why compute the stride ?? just use return { {l}, A.storage()} ;
*/
}}