// Copyright 2009-2014 Neil Groves. // 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) // // Copyright 2006 Thorsten Ottosen. // 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) // // Copyright 2004 Eric Niebler. // 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) // // Contains range-based versions of the numeric std algorithms // #if defined(_MSC_VER) #pragma once #endif #ifndef ACTIV_BOOST_RANGE_NUMERIC_HPP #define ACTIV_BOOST_RANGE_NUMERIC_HPP #include #include #include #include #include #include #include #include #include namespace Boost { template inline Value accumulate(const SinglePassRange& rng, Value init) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return std::accumulate(Boost::begin(rng), Boost::end(rng), init); } template inline Value accumulate(const SinglePassRange& rng, Value init, BinaryOperation op) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return std::accumulate(Boost::begin(rng), Boost::end(rng), init, op); } namespace range_detail { template inline bool inner_product_precondition( const SinglePassRange1&, const SinglePassRange2&, std::input_iterator_tag, std::input_iterator_tag) { return true; } template inline bool inner_product_precondition( const SinglePassRange1& rng1, const SinglePassRange2& rng2, std::forward_iterator_tag, std::forward_iterator_tag) { return Boost::size(rng2) >= Boost::size(rng1); } } // namespace range_detail template< class SinglePassRange1, class SinglePassRange2, class Value > inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); ACTIV_BOOST_ASSERT( range_detail::inner_product_precondition( rng1, rng2, typename range_category::type(), typename range_category::type())); return std::inner_product( Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), init); } template< class SinglePassRange1, class SinglePassRange2, class Value, class BinaryOperation1, class BinaryOperation2 > inline Value inner_product( const SinglePassRange1& rng1, const SinglePassRange2& rng2, Value init, BinaryOperation1 op1, BinaryOperation2 op2) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); ACTIV_BOOST_ASSERT( range_detail::inner_product_precondition( rng1, rng2, typename range_category::type(), typename range_category::type())); return std::inner_product( Boost::begin(rng1), Boost::end(rng1), Boost::begin(rng2), init, op1, op2); } template inline OutputIterator partial_sum(const SinglePassRange& rng, OutputIterator result) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return std::partial_sum(Boost::begin(rng), Boost::end(rng), result); } template inline OutputIterator partial_sum( const SinglePassRange& rng, OutputIterator result, BinaryOperation op) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return std::partial_sum(Boost::begin(rng), Boost::end(rng), result, op); } template inline OutputIterator adjacent_difference( const SinglePassRange& rng, OutputIterator result) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return std::adjacent_difference(Boost::begin(rng), Boost::end(rng), result); } template inline OutputIterator adjacent_difference( const SinglePassRange& rng, OutputIterator result, BinaryOperation op) { ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept)); return std::adjacent_difference(Boost::begin(rng), Boost::end(rng), result, op); } } // namespace Boost #endif