/* Copyright (c) Marshall Clow 2017. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) */ /// \file reduce.hpp /// \brief Combine the elements of a sequence into a single value /// \author Marshall Clow #ifndef ACTIV_BOOST_ALGORITHM_REDUCE_HPP #define ACTIV_BOOST_ALGORITHM_REDUCE_HPP #include // for std::plus #include // for std::iterator_traits #include #include #include #include namespace Boost { namespace algorithm { template T reduce(InputIterator first, InputIterator last, T init, BinaryOperation bOp) { ; for (; first != last; ++first) init = bOp(init, *first); return init; } template T reduce(InputIterator first, InputIterator last, T init) { typedef typename std::iterator_traits::value_type VT; return Boost::algorithm::reduce(first, last, init, std::plus()); } template typename std::iterator_traits::value_type reduce(InputIterator first, InputIterator last) { return Boost::algorithm::reduce(first, last, typename std::iterator_traits::value_type()); } template typename Boost::range_value::type reduce(const Range &r) { return Boost::algorithm::reduce(Boost::begin(r), Boost::end(r)); } // Not sure that this won't be ambiguous (1) template T reduce(const Range &r, T init) { return Boost::algorithm::reduce(Boost::begin (r), Boost::end (r), init); } // Not sure that this won't be ambiguous (2) template T reduce(const Range &r, T init, BinaryOperation bOp) { return Boost::algorithm::reduce(Boost::begin(r), Boost::end(r), init, bOp); } }} // namespace Boost and algorithm #endif // ACTIV_BOOST_ALGORITHM_REDUCE_HPP