mirror of
https://github.com/triqs/dft_tools
synced 2024-11-01 11:43:47 +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.
60 lines
1.5 KiB
C++
60 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 "./common.hpp"
|
|
#include <triqs/arrays/array.hpp>
|
|
#include <iostream>
|
|
|
|
using namespace triqs::arrays;
|
|
|
|
|
|
template <typename U, typename To, bool B> void f(array_view<U, 2, To, B, true> const &a) {
|
|
std::cout << a << std::endl;
|
|
}
|
|
|
|
void f2(array_const_view<long, 2> const &a) { std::cout << a << std::endl; }
|
|
|
|
int main(int argc, char **argv) {
|
|
|
|
{
|
|
array<long, 2> A(2, 3);
|
|
A() = 3;
|
|
f2(A());
|
|
|
|
|
|
array_const_view<long,2> Vc = A();
|
|
//array_view<long,2> V = Vc;
|
|
}
|
|
|
|
//#define SHOULD_NOT_COMPILE
|
|
#ifdef SHOULD_NOT_COMPILE
|
|
{
|
|
const array<long, 1> A = {1, 2, 3, 4};
|
|
|
|
// None of this should compile
|
|
A(0) = 2;
|
|
A()(0) = 2;
|
|
A(range(0,2))(0) = 10;
|
|
}
|
|
#endif
|
|
return 0;
|
|
}
|
|
|