mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
119 lines
5 KiB
C++
119 lines
5 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2013 Bolero MURAKAMI
|
|
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)
|
|
=============================================================================*/
|
|
#ifndef SPROUT_ALGORITHM_FIXED_COPY_UNTIL_HPP
|
|
#define SPROUT_ALGORITHM_FIXED_COPY_UNTIL_HPP
|
|
|
|
#include <iterator>
|
|
#include <type_traits>
|
|
#include <sprout/config.hpp>
|
|
#include <sprout/container/traits.hpp>
|
|
#include <sprout/container/functions.hpp>
|
|
#include <sprout/iterator/operation.hpp>
|
|
#include <sprout/iterator/while_iterator.hpp>
|
|
#include <sprout/functional/not1.hpp>
|
|
#include <sprout/algorithm/find_if.hpp>
|
|
#include <sprout/algorithm/fixed/results.hpp>
|
|
#include <sprout/algorithm/fixed/copy.hpp>
|
|
#include <sprout/pit/pit.hpp>
|
|
#include <sprout/detail/container_complate.hpp>
|
|
|
|
namespace sprout {
|
|
namespace fixed {
|
|
namespace detail {
|
|
template<typename RandomAccessIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
copy_until(
|
|
RandomAccessIterator first, RandomAccessIterator last, Result const& result, Predicate pred,
|
|
std::random_access_iterator_tag*
|
|
)
|
|
{
|
|
return sprout::fixed::copy(first, sprout::find_if(first, last, pred), result);
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename Predicate, typename... Args>
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
|
sprout::container_traits<Result>::static_size == sizeof...(Args),
|
|
typename sprout::fixed::results::algorithm<Result>::type
|
|
>::type
|
|
copy_until_impl(
|
|
InputIterator, InputIterator, Result const& result, Predicate,
|
|
typename sprout::container_traits<Result>::size_type,
|
|
Args const&... args
|
|
)
|
|
{
|
|
return sprout::remake<Result>(result, sprout::size(result), args...);
|
|
}
|
|
template<typename InputIterator, typename Result, typename Predicate, typename... Args>
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
|
sprout::container_traits<Result>::static_size != sizeof...(Args),
|
|
typename sprout::fixed::results::algorithm<Result>::type
|
|
>::type
|
|
copy_until_impl(
|
|
InputIterator first, InputIterator last, Result const& result, Predicate pred,
|
|
typename sprout::container_traits<Result>::size_type size,
|
|
Args const&... args
|
|
)
|
|
{
|
|
return first != last && sizeof...(Args) < size && !pred(*first)
|
|
? sprout::fixed::detail::copy_until_impl(sprout::next(first), last, result, pred, size, args..., *first)
|
|
: sprout::detail::container_complate(result, args...)
|
|
;
|
|
}
|
|
template<typename InputIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
copy_until(
|
|
InputIterator first, InputIterator last, Result const& result, Predicate pred,
|
|
std::input_iterator_tag*
|
|
)
|
|
{
|
|
return sprout::fixed::detail::copy_until_impl(first, last, result, pred, sprout::size(result));
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
|
sprout::is_fixed_container<Result>::value,
|
|
typename sprout::fixed::results::algorithm<Result>::type
|
|
>::type
|
|
copy_until(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
|
|
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
|
|
return sprout::fixed::detail::copy_until(first, last, result, pred, category());
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
|
!sprout::is_fixed_container<Result>::value,
|
|
typename sprout::fixed::results::algorithm<Result>::type
|
|
>::type
|
|
copy_until(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
|
|
return sprout::remake<Result>(
|
|
result, sprout::size(result),
|
|
sprout::make_while_iterator(sprout::not1(pred), first, last),
|
|
sprout::make_while_iterator(sprout::not1(pred), last, last)
|
|
);
|
|
}
|
|
} // namespace detail
|
|
//
|
|
// copy_until
|
|
//
|
|
template<typename InputIterator, typename Result, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
copy_until(InputIterator first, InputIterator last, Result const& result, Predicate pred) {
|
|
return sprout::fixed::detail::copy_until(first, last, result, pred);
|
|
}
|
|
|
|
template<typename Result, typename InputIterator, typename Predicate>
|
|
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
|
|
copy_until(InputIterator first, InputIterator last, Predicate pred) {
|
|
return sprout::fixed::copy_until(first, last, sprout::pit<Result>(), pred);
|
|
}
|
|
} // namespace fixed
|
|
|
|
using sprout::fixed::copy_until;
|
|
} // namespace sprout
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_COPY_UNTIL_HPP
|