From e0f58aeb62913c0ca91cb6c9bcdc294f6b1db242 Mon Sep 17 00:00:00 2001
From: Olivier Parcollet <olivier.parcollet@cea.fr>
Date: Tue, 10 Sep 2013 10:47:41 +0200
Subject: [PATCH] gf : clean product mesh

- reinterpret array is much simple.
clean old code after check on various compilers
---
 triqs/gfs/meshes/product.hpp | 10 ++++++++--
 1 file changed, 8 insertions(+), 2 deletions(-)

diff --git a/triqs/gfs/meshes/product.hpp b/triqs/gfs/meshes/product.hpp
index ee2b8514..b600151b 100644
--- a/triqs/gfs/meshes/product.hpp
+++ b/triqs/gfs/meshes/product.hpp
@@ -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()} ;
+*/
+
 
 
 }}