Sprout/sprout/algorithm/fixed/swap_element_copy.hpp

133 lines
5.1 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>
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>
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>
2011-10-28 14:28:24 +00:00
#include <sprout/detail/container_complate.hpp>
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>
inline SPROUT_CONSTEXPR 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
: 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>
inline SPROUT_CONSTEXPR 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,
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 ForwardIterator, typename Result, 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
swap_element_copy_impl(
ForwardIterator first, ForwardIterator last,
Result const& result,
ForwardIterator pos1, ForwardIterator pos2,
typename sprout::container_traits<Result>::size_type size,
Args const&... args
)
{
return sprout::remake<Result>(result, sprout::size(result), args...);
}
template<typename ForwardIterator, typename Result, 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
swap_element_copy_impl(
ForwardIterator first, ForwardIterator last,
Result const& result,
ForwardIterator pos1, ForwardIterator 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
)
2011-10-28 14:28:24 +00:00
: sprout::detail::container_complate(result, args...)
;
}
template<typename ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
swap_element_copy(
ForwardIterator first, ForwardIterator last,
Result const& result,
ForwardIterator pos1, ForwardIterator pos2,
2013-02-23 06:21:27 +00:00
std::forward_iterator_tag*
)
{
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 ForwardIterator, typename Result>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
swap_element_copy(ForwardIterator first, ForwardIterator last, Result const& result, ForwardIterator pos1, ForwardIterator pos2) {
typedef typename std::iterator_traits<ForwardIterator>::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
}
2013-01-20 11:49:37 +00:00
template<typename Result, typename ForwardIterator>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Result>::type
swap_element_copy(ForwardIterator first, ForwardIterator last, ForwardIterator pos1, ForwardIterator pos2) {
return sprout::fixed::swap_element_copy(first, last, sprout::pit<Result>(), pos1, pos2);
}
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