Sprout/sprout/algorithm/fixed/replace_copy.hpp

153 lines
6.4 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
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)
=============================================================================*/
2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_REPLACE_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_REPLACE_COPY_HPP
#include <iterator>
#include <type_traits>
2011-09-01 02:48:32 +00:00
#include <sprout/config.hpp>
2013-04-06 04:06:51 +00:00
#include <sprout/index_tuple/metafunction.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
2013-03-31 06:14:10 +00:00
#include <sprout/container/indexes.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/replace_iterator.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/pit/pit.hpp>
#include <sprout/detail/container_complate.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
2012-02-28 01:46:39 +00:00
template<typename RandomAccessIterator, typename Result, typename T, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy_impl_ra(
2013-07-22 13:00:09 +00:00
RandomAccessIterator first, RandomAccessIterator,
Result const& result, T const& old_value, T const& new_value,
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Result>::difference_type offset,
typename sprout::container_traits<Result>::size_type size,
typename sprout::container_traits<Result>::size_type input_size
2011-09-01 02:48:32 +00:00
)
{
return sprout::remake<Result>(
result, sprout::size(result),
2011-09-01 02:48:32 +00:00
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
? NS_SSCRISK_CEL_OR_SPROUT::equal_to<T>()(first[Indexes - offset], old_value) ? new_value : first[Indexes - offset]
: *sprout::next(sprout::internal_begin(result), Indexes)
2011-09-01 02:48:32 +00:00
)...
2011-09-03 13:26:26 +00:00
);
2011-09-01 02:48:32 +00:00
}
template<typename RandomAccessIterator, typename Result, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy(
RandomAccessIterator first, RandomAccessIterator last,
Result const& result, T const& old_value, T const& new_value,
std::random_access_iterator_tag*
)
{
return sprout::fixed::detail::replace_copy_impl_ra(
first, last,
result, old_value, new_value,
2013-03-31 06:14:10 +00:00
sprout::container_indexes<Result>::make(),
sprout::internal_begin_offset(result),
sprout::size(result),
sprout::distance(first, last)
);
}
template<typename InputIterator, typename Result, typename T, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
replace_copy_impl(
2013-07-22 13:00:09 +00:00
InputIterator, InputIterator,
Result const& result, T const&, T const&,
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 T, typename... Args>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
replace_copy_impl(
InputIterator first, InputIterator last,
Result const& result, T const& old_value, T const& new_value,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
return first != last && sizeof...(Args) < size
? replace_copy_impl(
sprout::next(first), last, result, old_value, new_value,
size,
args..., *first == old_value ? new_value : *first
)
: sprout::detail::container_complate(result, args...)
;
}
template<typename InputIterator, typename Result, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy(
InputIterator first, InputIterator last,
Result const& result, T const& old_value, T const& new_value,
2013-02-23 06:21:27 +00:00
std::input_iterator_tag*
)
{
return sprout::fixed::detail::replace_copy_impl(first, last, result, old_value, new_value, sprout::size(result));
}
template<typename InputIterator, typename Result, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
replace_copy(InputIterator first, InputIterator last, Result const& result, T const& old_value, T const& new_value) {
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
return sprout::fixed::detail::replace_copy(first, last, result, old_value, new_value, category());
}
template<typename InputIterator, typename Result, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Result>::value,
typename sprout::fixed::result_of::algorithm<Result>::type
>::type
replace_copy(InputIterator first, InputIterator last, Result const& result, T const& old_value, T const& new_value) {
return sprout::remake<Result>(
result, sprout::size(result),
sprout::make_replace_iterator(first, old_value, new_value),
sprout::make_replace_iterator(last, old_value, new_value)
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// replace_copy
//
template<typename InputIterator, typename Result, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy(InputIterator first, InputIterator last, Result const& result, T const& old_value, T const& new_value) {
return sprout::fixed::detail::replace_copy(first, last, result, old_value, new_value);
}
template<typename Result, typename InputIterator, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
replace_copy(InputIterator first, InputIterator last, T const& old_value, T const& new_value) {
return sprout::fixed::replace_copy(first, last, sprout::pit<Result>(), old_value, new_value);
2011-09-01 02:48:32 +00:00
}
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::fixed::replace_copy;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_REPLACE_COPY_HPP