/******************************************************************************* * * 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 . * ******************************************************************************/ #ifndef TRIQS_ARRAYS_ALGORITHMS_H #define TRIQS_ARRAYS_ALGORITHMS_H #include #include #include #include "./functional/fold.hpp" #include namespace triqs { namespace arrays { // get_first_element(a) returns .. the first element, i.e. a(0,0,0...) #define ZERO(z, n, text) 0 #define IMPL(z, N, unused)\ template typename std::enable_if::type get_first_element(ArrayType const & A) \ { return A(BOOST_PP_ENUM(N,ZERO,0));} BOOST_PP_REPEAT_FROM_TO(1,ARRAY_NRANK_MAX , IMPL, nil); #undef IMPL #undef ZERO template typename A::value_type max_element(A const &a) { typedef typename A::value_type T; return fold ([](T const & a, T const & b) { return std::max(a,b);} ) (a, get_first_element(a)); } template typename A::value_type min_element(A const &a) { typedef typename A::value_type T; return fold ([](T const & a, T const & b) { return std::min(a,b);} ) (a, get_first_element(a)); } template typename A::value_type sum(A const & a) { return fold ( std::plus()) (a); } template typename A::value_type prod(A const & a) { return fold ( std::multiplies()) (a,1); } }}//namespace triqs::arrays #endif