mirror of
https://github.com/triqs/dft_tools
synced 2024-11-01 03:33:50 +01:00
46 lines
1.5 KiB
C++
46 lines
1.5 KiB
C++
|
/*******************************************************************************
|
||
|
*
|
||
|
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
|
||
|
*
|
||
|
* Copyright (C) 2011 by O. Parcollet
|
||
|
*
|
||
|
* TRIQS is free software: you can redistribute it and/or modify it under the
|
||
|
* terms of the GNU General Public License as published by the Free Software
|
||
|
* Foundation, either version 3 of the License, or (at your option) any later
|
||
|
* version.
|
||
|
*
|
||
|
* TRIQS is distributed in the hope that it will be useful, but WITHOUT ANY
|
||
|
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
||
|
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
|
||
|
* details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU General Public License along with
|
||
|
* TRIQS. If not, see <http://www.gnu.org/licenses/>.
|
||
|
*
|
||
|
******************************************************************************/
|
||
|
|
||
|
#include <triqs/arrays.hpp>
|
||
|
#include <iostream>
|
||
|
|
||
|
namespace triqs { namespace arrays {
|
||
|
|
||
|
template <typename V, int R, ull_t Opt, ull_t To, typename ... I>
|
||
|
array_view<V, sizeof...(I), Opt> reinterpret_array_view (array<V,R,Opt,To> const & a, I ... index) {
|
||
|
static int constexpr rank = sizeof...(I);
|
||
|
typedef array_view<V, rank, Opt, indexmaps::mem_layout::c_order(rank)> return_t;
|
||
|
return return_t (typename return_t::indexmap_type (mini_vector<size_t,rank>(index...)) , a.storage());
|
||
|
}
|
||
|
|
||
|
}}
|
||
|
|
||
|
int main(int argc, char **argv) {
|
||
|
triqs::arrays::array<long,1> A = {1,2,3,4,5,6};
|
||
|
std::cout << reinterpret_array_view(A, 2,3);
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
|
||
|
|
||
|
|
||
|
|