mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-27 00:53:44 +00:00
72 lines
3.4 KiB
C++
72 lines
3.4 KiB
C++
|
/*=============================================================================
|
||
|
|
Copyright (c) 2011-2017 Bolero MURAKAMI
|
||
|
|
https://github.com/bolero-MURAKAMI/Sprout
|
||
|
|
|
||
|
|
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)
|
||
|
|
=============================================================================*/
|
||
|
|
#ifndef SPROUT_RANGE_NUMERIC_FIXED_INCLUSIVE_SCAN_HPP
|
||
|
|
#define SPROUT_RANGE_NUMERIC_FIXED_INCLUSIVE_SCAN_HPP
|
||
|
|
|
||
|
|
#include <sprout/config.hpp>
|
||
|
|
#include <sprout/container/traits.hpp>
|
||
|
|
#include <sprout/container/functions.hpp>
|
||
|
|
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
|
||
|
|
#include <sprout/type_traits/enabler_if.hpp>
|
||
|
|
#include <sprout/algorithm/fixed/results.hpp>
|
||
|
|
#include <sprout/numeric/fixed/inclusive_scan.hpp>
|
||
|
|
|
||
|
|
namespace sprout {
|
||
|
|
namespace range {
|
||
|
|
namespace fixed {
|
||
|
|
//
|
||
|
|
// inclusive_scan
|
||
|
|
//
|
||
|
|
template<
|
||
|
|
typename InputRange, typename Result,
|
||
|
|
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
|
||
|
|
>
|
||
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
||
|
|
inclusive_scan(InputRange const& rng, Result const& result) {
|
||
|
|
return sprout::fixed::inclusive_scan(sprout::begin(rng), sprout::end(rng), result);
|
||
|
|
}
|
||
|
|
template<
|
||
|
|
typename InputRange, typename Result, typename BinaryOperation,
|
||
|
|
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
|
||
|
|
>
|
||
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
||
|
|
inclusive_scan(InputRange const& rng, Result const& result, BinaryOperation binary_op) {
|
||
|
|
return sprout::fixed::inclusive_scan(sprout::begin(rng), sprout::end(rng), result, binary_op);
|
||
|
|
}
|
||
|
|
template<
|
||
|
|
typename InputRange, typename Result, typename BinaryOperation, typename T,
|
||
|
|
typename sprout::enabler_if<!sprout::is_iterator_outputable<Result>::value>::type = sprout::enabler
|
||
|
|
>
|
||
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
||
|
|
inclusive_scan(InputRange const& rng, Result const& result, BinaryOperation binary_op, T init) {
|
||
|
|
return sprout::fixed::inclusive_scan(sprout::begin(rng), sprout::end(rng), result, binary_op, init);
|
||
|
|
}
|
||
|
|
|
||
|
|
template<typename Result, typename InputRange>
|
||
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
||
|
|
inclusive_scan(InputRange const& rng) {
|
||
|
|
return sprout::fixed::inclusive_scan<Result>(sprout::begin(rng), sprout::end(rng));
|
||
|
|
}
|
||
|
|
template<typename Result, typename InputRange, typename BinaryOperation>
|
||
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
||
|
|
inclusive_scan(InputRange const& rng, BinaryOperation binary_op) {
|
||
|
|
return sprout::fixed::inclusive_scan<Result>(sprout::begin(rng), sprout::end(rng), binary_op);
|
||
|
|
}
|
||
|
|
template<typename Result, typename InputRange, typename BinaryOperation, typename T>
|
||
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
||
|
|
inclusive_scan(InputRange const& rng, BinaryOperation binary_op, T init) {
|
||
|
|
return sprout::fixed::inclusive_scan<Result>(sprout::begin(rng), sprout::end(rng), binary_op, init);
|
||
|
|
}
|
||
|
|
} // namespace fixed
|
||
|
|
|
||
|
|
using sprout::range::fixed::inclusive_scan;
|
||
|
|
} // namespace range
|
||
|
|
} // namespace sprout
|
||
|
|
|
||
|
|
#endif // #ifndef SPROUT_RANGE_NUMERIC_FIXED_INCLUSIVE_SCAN_HPP
|