Sprout/sprout/algorithm/fixed/swap_element_copy.hpp

135 lines
4.8 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_SWAP_ELEMENT_COPY_HPP
#define SPROUT_ALGORITHM_FIXED_SWAP_ELEMENT_COPY_HPP
#include <iterator>
#include <type_traits>
2011-09-01 02:48:32 +00:00
#include <sprout/config.hpp>
#include <sprout/index_tuple.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2011-10-28 14:28:24 +00:00
#include <sprout/detail/container_complate.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_ITERATOR_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, sprout::index_t... Indexes>
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type swap_element_copy_impl_ra(
RandomAccessIterator first,
RandomAccessIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
RandomAccessIterator pos1,
RandomAccessIterator pos2,
2011-10-28 14:28:24 +00:00
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>(
2011-09-03 13:26:26 +00:00
result,
sprout::size(result),
2011-09-01 02:48:32 +00:00
(Indexes >= offset && Indexes < offset + size && Indexes < offset + input_size
2011-10-01 15:19:13 +00:00
? sprout::next(first, Indexes - offset) == pos1
2011-09-01 02:48:32 +00:00
? *pos2
2011-10-01 15:19:13 +00:00
: sprout::next(first, Indexes - offset) == pos2
2011-09-01 02:48:32 +00:00
? *pos1
2011-10-01 15:19:13 +00:00
: *sprout::next(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>
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type swap_element_copy(
RandomAccessIterator first,
RandomAccessIterator last,
Result const& result,
RandomAccessIterator pos1,
RandomAccessIterator pos2,
std::random_access_iterator_tag*
)
{
return sprout::fixed::detail::swap_element_copy_impl_ra(
first,
last,
result,
pos1,
pos2,
typename sprout::index_range<0, sprout::container_traits<Result>::static_size>::type(),
sprout::internal_begin_offset(result),
sprout::size(result),
2012-04-01 13:15:09 +00:00
NS_SSCRISK_CEL_OR_SPROUT::distance(first, last)
);
}
template<typename InputIterator, typename Result, typename... Args>
SPROUT_CONSTEXPR inline typename std::enable_if<
sprout::container_traits<Result>::static_size == sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
2011-10-28 14:28:24 +00:00
>::type swap_element_copy_impl(
InputIterator first,
InputIterator last,
Result const& result,
InputIterator pos1,
InputIterator pos2,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args...);
}
template<typename InputIterator, typename Result, typename... Args>
SPROUT_CONSTEXPR inline typename std::enable_if<
sprout::container_traits<Result>::static_size != sizeof...(Args),
typename sprout::fixed::result_of::algorithm<Result>::type
2011-10-28 14:28:24 +00:00
>::type swap_element_copy_impl(
InputIterator first,
InputIterator last,
Result const& result,
InputIterator pos1,
InputIterator pos2,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
2011-10-28 14:28:24 +00:00
return first != last && sizeof...(Args) < size
? sprout::fixed::detail::swap_element_copy_impl(sprout::next(first), last, result, pos1, pos2, size, args..., first == pos1 ? *pos2 : first == pos2 ? *pos1 : *first)
: sprout::detail::container_complate(result, args...)
;
}
template<typename InputIterator, typename Result>
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type swap_element_copy(
InputIterator first,
InputIterator last,
Result const& result,
InputIterator pos1,
InputIterator pos2,
void*
)
{
2011-10-28 14:28:24 +00:00
return sprout::fixed::detail::swap_element_copy_impl(first, last, result, sprout::size(result));
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// swap_element_copy
//
template<typename InputIterator, typename Result>
2011-09-03 13:26:26 +00:00
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type swap_element_copy(
InputIterator first,
InputIterator last,
2011-09-01 02:48:32 +00:00
Result const& result,
InputIterator pos1,
InputIterator pos2
2011-09-01 02:48:32 +00:00
)
{
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
2011-10-28 14:28:24 +00:00
return sprout::fixed::detail::swap_element_copy(first, last, result, pos1, pos2, category());
2011-09-01 02:48:32 +00:00
}
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::fixed::swap_element_copy;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_SWAP_ELEMENT_COPY_HPP