Sprout/sprout/range/algorithm/search.hpp

112 lines
4.4 KiB
C++
Raw Permalink Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011 RiSK (sscrisk)
https://github.com/sscrisk/CEL---ConstExpr-Library
Copyright (c) 2011-2019 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_SEARCH_HPP
#define SPROUT_RANGE_ALGORITHM_SEARCH_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/search.hpp>
namespace sprout {
namespace range {
// 25.2.13 Search
template<typename ForwardRange1, typename ForwardRange2>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1>::type
search(ForwardRange1&& range1, ForwardRange2&& range2) {
return sprout::range::range_return<ForwardRange1>::pack(
2012-04-04 08:48:02 +00:00
sprout::search(
sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
sprout::end(SPROUT_FORWARD(ForwardRange2, range2))
2012-04-04 08:48:02 +00:00
),
SPROUT_FORWARD(ForwardRange1, range1)
2012-04-04 08:48:02 +00:00
);
}
template<typename ForwardRange1, typename ForwardRange2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1>::type
search(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) {
return sprout::range::range_return<ForwardRange1>::pack(
2012-04-04 08:48:02 +00:00
sprout::search(
sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
sprout::end(SPROUT_FORWARD(ForwardRange2, range2)),
2012-04-04 08:48:02 +00:00
pred
),
SPROUT_FORWARD(ForwardRange1, range1)
2012-04-04 08:48:02 +00:00
);
}
template<sprout::range::range_return_value RetV, typename ForwardRange1, typename ForwardRange2>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1, RetV>::type
search(ForwardRange1&& range1, ForwardRange2&& range2) {
return sprout::range::range_return<ForwardRange1, RetV>::pack(
2012-04-04 08:48:02 +00:00
sprout::search(
sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
sprout::end(SPROUT_FORWARD(ForwardRange2, range2))
2012-04-04 08:48:02 +00:00
),
SPROUT_FORWARD(ForwardRange1, range1)
2012-04-04 08:48:02 +00:00
);
}
template<sprout::range::range_return_value RetV, typename ForwardRange1, typename ForwardRange2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1, RetV>::type
search(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) {
return sprout::range::range_return<ForwardRange1, RetV>::pack(
2012-04-04 08:48:02 +00:00
sprout::search(
sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
sprout::end(SPROUT_FORWARD(ForwardRange2, range2)),
2012-04-04 08:48:02 +00:00
pred
),
SPROUT_FORWARD(ForwardRange1, range1)
2012-04-04 08:48:02 +00:00
);
}
2014-12-14 03:59:51 +00:00
//
template<typename ForwardRange, typename Searcher>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange>::type
search(ForwardRange&& range, Searcher const& searcher) {
return sprout::range::range_return<ForwardRange>::pack(
sprout::search(
sprout::begin(SPROUT_FORWARD(ForwardRange, range)),
sprout::end(SPROUT_FORWARD(ForwardRange, range)),
searcher
),
SPROUT_FORWARD(ForwardRange, range)
);
}
template<sprout::range::range_return_value RetV, typename ForwardRange, typename Searcher>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange, RetV>::type
search(ForwardRange&& range, Searcher const& searcher) {
return sprout::range::range_return<ForwardRange, RetV>::pack(
sprout::search(
sprout::begin(SPROUT_FORWARD(ForwardRange, range)),
sprout::end(SPROUT_FORWARD(ForwardRange, range)),
searcher
),
SPROUT_FORWARD(ForwardRange, range)
);
}
2012-04-04 08:48:02 +00:00
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_SEARCH_HPP