1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/sprout/range/algorithm/find_first_of.hpp

76 lines
3 KiB
C++
Raw Normal View History

2012-04-04 08:48:02 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_FIND_FIRST_OF_HPP
#define SPROUT_RANGE_ALGORITHM_FIND_FIRST_OF_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/find_first_of.hpp>
namespace sprout {
namespace range {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.2.7 Find first
template<typename InputRange1, typename InputRange2>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<InputRange1>::type
find_first_of(InputRange1&& range1, InputRange2&& range2) {
return sprout::range::range_return<InputRange1>::pack(
2012-04-04 08:48:02 +00:00
sprout::find_first_of(
sprout::begin(sprout::forward<InputRange1>(range1)),
sprout::end(sprout::forward<InputRange1>(range1)),
sprout::begin(sprout::forward<InputRange2>(range2)),
sprout::end(sprout::forward<InputRange2>(range2))
2012-04-04 08:48:02 +00:00
),
sprout::forward<InputRange1>(range1)
2012-04-04 08:48:02 +00:00
);
}
template<typename InputRange1, typename InputRange2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<InputRange1>::type
find_first_of(InputRange1&& range1, InputRange2&& range2, BinaryPredicate pred) {
return sprout::range::range_return<InputRange1>::pack(
2012-04-04 08:48:02 +00:00
sprout::find_first_of(
sprout::begin(sprout::forward<InputRange1>(range1)),
sprout::end(sprout::forward<InputRange1>(range1)),
sprout::begin(sprout::forward<InputRange2>(range2)),
sprout::end(sprout::forward<InputRange2>(range2)),
2012-04-04 08:48:02 +00:00
pred
),
sprout::forward<InputRange1>(range1)
2012-04-04 08:48:02 +00:00
);
}
template<sprout::range::range_return_value RetV, typename InputRange1, typename InputRange2>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<InputRange1, RetV>::type
find_first_of(InputRange1&& range1, InputRange2&& range2) {
return sprout::range::range_return<InputRange1, RetV>::pack(
2012-04-04 08:48:02 +00:00
sprout::find_first_of(
sprout::begin(sprout::forward<InputRange1>(range1)),
sprout::end(sprout::forward<InputRange1>(range1)),
sprout::begin(sprout::forward<InputRange2>(range2)),
sprout::end(sprout::forward<InputRange2>(range2))
2012-04-04 08:48:02 +00:00
),
sprout::forward<InputRange1>(range1)
2012-04-04 08:48:02 +00:00
);
}
template<sprout::range::range_return_value RetV, typename InputRange1, typename InputRange2, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<InputRange1, RetV>::type
find_first_of(InputRange1&& range1, InputRange2&& range2, BinaryPredicate pred) {
return sprout::range::range_return<InputRange1, RetV>::pack(
2012-04-04 08:48:02 +00:00
sprout::find_first_of(
sprout::begin(sprout::forward<InputRange1>(range1)),
sprout::end(sprout::forward<InputRange1>(range1)),
sprout::begin(sprout::forward<InputRange2>(range2)),
sprout::end(sprout::forward<InputRange2>(range2)),
2012-04-04 08:48:02 +00:00
pred
),
sprout::forward<InputRange1>(range1)
2012-04-04 08:48:02 +00:00
);
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_FIND_FIRST_OF_HPP