mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-16 15:14:13 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

porting sscrisk/CEL

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-04-01 22:15:09 +09:00
parent ad60c8c530
commit db20f64991
181 changed files with 2531 additions and 607 deletions
Download patch file Download diff file Expand all files Collapse all files

47
sprout/algorithm/search_n.hpp Normal file
View file

@ -0,0 +1,47 @@
#ifndef SPROUT_ALGORITHM_SEARCH_N_HPP
#define SPROUT_ALGORITHM_SEARCH_N_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.2.13 Search
template<typename ForwardIterator, typename Size, typename T>
SPROUT_CONSTEXPR ForwardIterator search_n(
ForwardIterator first,
ForwardIterator last,
Size count,
T const& value
)
{
return first == last || count == 0 ? first
: sprout::next(first) == last && count > 1 ? last
: *first == value
&& sprout::search_n(sprout::next(first), last, count - 1, value) == sprout::next(first)
? first
: sprout::search_n(sprout::next(first), last, count, value)
;
}
template<typename ForwardIterator, typename Size, typename T, typename BinaryPredicate>
SPROUT_CONSTEXPR ForwardIterator search_n(
ForwardIterator first,
ForwardIterator last,
Size count,
T const& value,
BinaryPredicate pred
)
{
return first == last || count == 0 ? first
: sprout::next(first) == last && count > 1 ? last
: *first == value
&& sprout::search_n(sprout::next(first), last, count - 1, value, pred) == sprout::next(first)
? first
: sprout::search_n(sprout::next(first), last, count, value, pred)
;
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_SEARCH_N_HPP