mirror of
https://github.com/triqs/dft_tools
synced 2024-11-01 03:33:50 +01:00
47cb8a03f7
- Simplify group_indices - Only for C ordered, remove complex compile time. - Could be generalized to non C ordered, but no need. - Fix slice for custom orders. - Generalize the group_indices for the custom order. - Add c_ordered_transposed_view (useful ?) - Improve slice, special for ellipsis (quicker). - Simplify TraversalOrder - Assignement. Specialize one case for speed. - use FORCEINLINE in foreach, according to speed test for clang - add one speed test - Modify iterators for better speed. - along the lines decided for the foreach - update doc.
54 lines
1.8 KiB
C++
54 lines
1.8 KiB
C++
/*******************************************************************************
|
|
*
|
|
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
|
|
*
|
|
* Copyright (C) 2013 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, typename To, typename... I>
|
|
array_view<V, sizeof...(I)> reinterpret(array<V, R, To> const &a, I... index) {
|
|
return { {make_shape(index...)}, a.storage() };
|
|
}
|
|
|
|
// wrong for views
|
|
template <typename V, int R, bool B, typename To, typename ... I>
|
|
array_view<V, sizeof...(I)> reinterpret_array_view (array_view<V,R,To,B> const & a, I ... index) {
|
|
if (!has_contiguous_data(a)) TRIQS_RUNTIME_ERROR << "reinterpretation failure : data of the view are not contiguous";
|
|
return { {make_shape(index...)}, a.storage() };
|
|
}
|
|
|
|
}}
|
|
|
|
using namespace triqs::arrays;
|
|
int main(int argc, char **argv) {
|
|
triqs::arrays::array<long,1> A = {1,2,3,4,5,6};
|
|
std::cout << reinterpret(A, 2,3)<< std::endl;
|
|
//std::cout << reinterpret_array_view(A(range(1,5)), 2,3)<< std::endl;
|
|
return 0;
|
|
}
|
|
|
|
|
|
|
|
|
|
|