Sprout/sprout/algorithm/fit/copy_until.hpp

48 lines
1.8 KiB
C++
Raw Normal View History

2012-10-13 13:11:32 +00:00
#ifndef SPROUT_ALGORITHM_FIT_COPY_UNTIL_HPP
#define SPROUT_ALGORITHM_FIT_COPY_UNTIL_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/distance.hpp>
2012-10-13 13:11:32 +00:00
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/fixed/copy_while.hpp>
2012-10-13 13:11:32 +00:00
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/algorithm/find_if.hpp>
2012-10-13 13:11:32 +00:00
#include <sprout/sub_array.hpp>
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
#include <sprout/iterator/type_traits/is_iterator.hpp>
2012-10-13 13:11:32 +00:00
namespace sprout {
namespace fit {
namespace detail {
template<typename InputIterator, typename Result, typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
copy_until_impl(
InputIterator first, InputIterator last, Result const& result, Predicate pred,
typename sprout::container_traits<Result>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::copy_until(first, last, result, pred)),
offset,
offset + NS_SSCRISK_CEL_OR_SPROUT::min(
sprout::distance(first, sprout::find_if(first, last, pred)),
2012-10-13 13:11:32 +00:00
sprout::size(result)
)
);
}
} // namespace detail
//
// copy_until
//
template<typename InputIterator, typename Result, typename Predicate>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Result>::type
copy_until(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
2012-10-13 13:11:32 +00:00
return sprout::fit::detail::copy_until_impl(first, last, result, pred, sprout::internal_begin_offset(result));
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_COPY_UNTIL_HPP