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

add iterator category check for algorithm incomplete implementation

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-01-31 23:25:18 +09:00
parent 1cfec16e52
commit 092910e2f7
29 changed files with 139 additions and 91 deletions
Download patch file Download diff file Expand all files Collapse all files

44
sprout/algorithm/fixed/unique_copy.hpp
View file

@ -1,7 +1,6 @@
#ifndef SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_UNIQUE_COPY_HPP
#include <iterator>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
@ -11,6 +10,7 @@
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/pit.hpp>
#include <sprout/detail/container_complate.hpp>
#include <sprout/iterator/type_traits/is_iterator.hpp>
namespace sprout {
namespace fixed {
@ -63,27 +63,18 @@ namespace sprout {
;
}
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy_dyn(
InputIterator first, InputIterator last, Result const& result,
std::forward_iterator_tag*
)
{
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_unique_iterator(first, last),
sprout::make_unique_iterator(last, last)
);
}
template<typename InputIterator, typename Result>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy(InputIterator first, InputIterator last, Result const& result) {
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::fixed::detail::unique_copy_dyn(first, last, result, category());
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_unique_iterator(first, last),
sprout::make_unique_iterator(last, last)
);
}
} // namespace detail
//
@ -150,27 +141,18 @@ namespace sprout {
;
}
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
unique_copy_dyn(
InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred,
std::forward_iterator_tag*
)
{
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_unique_iterator(pred, first, last),
sprout::make_unique_iterator(pred, last, last)
);
}
template<typename InputIterator, typename Result, typename BinaryPredicate>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
unique_copy(InputIterator first, InputIterator last, Result const& result, BinaryPredicate pred) {
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::fixed::detail::unique_copy_dyn(first, last, result, pred, category());
static_assert(sprout::is_forward_iterator<InputIterator>::value, "Sorry, not implemented.");
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_unique_iterator(pred, first, last),
sprout::make_unique_iterator(pred, last, last)
);
}
} // namespace detail
//