Sprout/sprout/range/algorithm/adjacent_find.hpp

77 lines
2.8 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011 RiSK (sscrisk)
https://github.com/sscrisk/CEL---ConstExpr-Library
2015-01-10 10:13:57 +00:00
Copyright (c) 2011-2015 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
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)
=============================================================================*/
2012-04-04 08:48:02 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP
#define SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
2012-10-05 15:58:56 +00:00
#include <sprout/utility/forward.hpp>
2012-04-04 08:48:02 +00:00
#include <sprout/range/range_return.hpp>
#include <sprout/algorithm/adjacent_find.hpp>
namespace sprout {
namespace range {
// 25.2.8 Adjacent find
template<typename ForwardRange>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange>::type
adjacent_find(ForwardRange&& range) {
return sprout::range::range_return<ForwardRange>::pack(
2012-04-04 08:48:02 +00:00
sprout::adjacent_find(
sprout::begin(SPROUT_FORWARD(ForwardRange, range)),
sprout::end(SPROUT_FORWARD(ForwardRange, range))
2012-04-04 08:48:02 +00:00
),
SPROUT_FORWARD(ForwardRange, range)
2012-04-04 08:48:02 +00:00
);
}
template<typename ForwardRange, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange>::type
adjacent_find(ForwardRange&& range, BinaryPredicate pred) {
return sprout::range::range_return<ForwardRange>::pack(
2012-04-04 08:48:02 +00:00
sprout::adjacent_find(
sprout::begin(SPROUT_FORWARD(ForwardRange, range)),
sprout::end(SPROUT_FORWARD(ForwardRange, range)),
2012-04-04 08:48:02 +00:00
pred
),
SPROUT_FORWARD(ForwardRange, range)
2012-04-04 08:48:02 +00:00
);
}
template<sprout::range::range_return_value RetV, typename ForwardRange>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange, RetV>::type
adjacent_find(ForwardRange&& range) {
return sprout::range::range_return<ForwardRange, RetV>::pack(
2012-04-04 08:48:02 +00:00
sprout::adjacent_find(
sprout::begin(SPROUT_FORWARD(ForwardRange, range)),
sprout::end(SPROUT_FORWARD(ForwardRange, range))
2012-04-04 08:48:02 +00:00
),
SPROUT_FORWARD(ForwardRange, range)
2012-04-04 08:48:02 +00:00
);
}
template<sprout::range::range_return_value RetV, typename ForwardRange, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange, RetV>::type
adjacent_find(ForwardRange&& range, BinaryPredicate pred) {
return sprout::range::range_return<ForwardRange, RetV>::pack(
2012-04-04 08:48:02 +00:00
sprout::adjacent_find(
sprout::begin(SPROUT_FORWARD(ForwardRange, range)),
sprout::end(SPROUT_FORWARD(ForwardRange, range)),
2012-04-04 08:48:02 +00:00
pred
),
SPROUT_FORWARD(ForwardRange, range)
2012-04-04 08:48:02 +00:00
);
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP