2011-09-01 02:48:32 +00:00
|
|
|
#ifndef SPROUT_ALGORITHM_FIXED_TRANSFORM_HPP
|
|
|
|
#define SPROUT_ALGORITHM_FIXED_TRANSFORM_HPP
|
|
|
|
|
|
|
|
#include <cstddef>
|
2011-10-28 11:34:24 +00:00
|
|
|
#include <iterator>
|
|
|
|
#include <type_traits>
|
2011-09-01 02:48:32 +00:00
|
|
|
#include <sprout/config.hpp>
|
|
|
|
#include <sprout/index_tuple.hpp>
|
|
|
|
#include <sprout/fixed_container/traits.hpp>
|
|
|
|
#include <sprout/fixed_container/functions.hpp>
|
2011-10-28 11:34:24 +00:00
|
|
|
#include <sprout/iterator/operation.hpp>
|
2011-09-03 13:26:26 +00:00
|
|
|
#include <sprout/algorithm/fixed/result_of.hpp>
|
2011-10-28 11:34:24 +00:00
|
|
|
#include <sprout/detail/container_complate.hpp>
|
2011-09-01 02:48:32 +00:00
|
|
|
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT_DETAIL
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
namespace fixed {
|
|
|
|
namespace detail {
|
2011-10-28 11:34:24 +00:00
|
|
|
template<typename RandomAccessIterator, typename Result, typename UnaryOperation, std::ptrdiff_t... Indexes>
|
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform_impl_ra(
|
|
|
|
RandomAccessIterator first,
|
|
|
|
RandomAccessIterator last,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
UnaryOperation op,
|
2011-10-28 11:34:24 +00:00
|
|
|
sprout::index_tuple<Indexes...>,
|
2011-09-01 02:48:32 +00:00
|
|
|
typename sprout::fixed_container_traits<Result>::difference_type offset,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type size,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type input_size
|
|
|
|
)
|
|
|
|
{
|
2011-09-03 13:26:26 +00:00
|
|
|
return sprout::remake_clone<Result, Result>(
|
|
|
|
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
|
|
|
? op(*sprout::next(first, Indexes - offset))
|
|
|
|
: *sprout::next(sprout::fixed_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
|
|
|
}
|
2011-10-28 11:34:24 +00:00
|
|
|
template<typename RandomAccessIterator, typename Result, typename UnaryOperation>
|
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform(
|
|
|
|
RandomAccessIterator first,
|
|
|
|
RandomAccessIterator last,
|
|
|
|
Result const& result,
|
|
|
|
UnaryOperation op,
|
|
|
|
std::random_access_iterator_tag*
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::fixed::detail::transform_impl_ra(
|
|
|
|
first,
|
|
|
|
last,
|
|
|
|
result,
|
|
|
|
op,
|
|
|
|
typename sprout::index_range<0, sprout::fixed_container_traits<Result>::fixed_size>::type(),
|
|
|
|
sprout::fixed_begin_offset(result),
|
|
|
|
sprout::size(result),
|
|
|
|
NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(first, last)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename UnaryOperation, typename... Args>
|
|
|
|
SPROUT_CONSTEXPR inline typename std::enable_if<
|
|
|
|
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
|
|
|
>::type transform_impl(
|
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
|
|
|
Result const& result,
|
|
|
|
UnaryOperation op,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type size,
|
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
|
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename UnaryOperation, typename... Args>
|
|
|
|
SPROUT_CONSTEXPR inline typename std::enable_if<
|
|
|
|
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
|
|
|
>::type transform_impl(
|
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
|
|
|
Result const& result,
|
|
|
|
UnaryOperation op,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type size,
|
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return first != last && sizeof...(Args) < size
|
|
|
|
? sprout::fixed::detail::transform_impl(sprout::next(first), last, result, op, size, args..., op(*first))
|
|
|
|
: sprout::detail::container_complate(result, args...)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
template<typename InputIterator, typename Result, typename UnaryOperation>
|
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform(
|
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
|
|
|
Result const& result,
|
|
|
|
UnaryOperation op,
|
|
|
|
void*
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::fixed::detail::transform_impl(first, last, result, op, sprout::size(result));
|
|
|
|
}
|
2011-09-01 02:48:32 +00:00
|
|
|
} // namespace detail
|
|
|
|
//
|
|
|
|
// transform
|
|
|
|
//
|
2011-10-28 11:34:24 +00:00
|
|
|
template<typename InputIterator, typename Result, typename UnaryOperation>
|
2011-09-03 13:26:26 +00:00
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform(
|
2011-10-28 11:34:24 +00:00
|
|
|
InputIterator first,
|
|
|
|
InputIterator last,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
UnaryOperation op
|
|
|
|
)
|
|
|
|
{
|
2011-10-28 11:34:24 +00:00
|
|
|
typedef typename std::iterator_traits<InputIterator>::iterator_category* category;
|
|
|
|
return sprout::fixed::detail::transform(first, last, result, op, category());
|
2011-09-01 02:48:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
namespace detail {
|
2011-10-28 11:34:24 +00:00
|
|
|
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Result, typename BinaryOperation, std::ptrdiff_t... Indexes>
|
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform2_impl_ra(
|
|
|
|
RandomAccessIterator1 first1,
|
|
|
|
RandomAccessIterator1 last1,
|
|
|
|
RandomAccessIterator2 first2,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
BinaryOperation op,
|
2011-10-28 11:34:24 +00:00
|
|
|
sprout::index_tuple<Indexes...>,
|
2011-09-01 02:48:32 +00:00
|
|
|
typename sprout::fixed_container_traits<Result>::difference_type offset,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type size,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type input_size
|
|
|
|
)
|
|
|
|
{
|
2011-09-03 13:26:26 +00:00
|
|
|
return sprout::remake_clone<Result, Result>(
|
|
|
|
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
|
|
|
? op(*sprout::next(first1, Indexes - offset), *sprout::next(first2, Indexes - offset))
|
|
|
|
: *sprout::next(sprout::fixed_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
|
|
|
}
|
2011-10-28 11:34:24 +00:00
|
|
|
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Result, typename BinaryOperation>
|
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform2(
|
|
|
|
RandomAccessIterator1 first1,
|
|
|
|
RandomAccessIterator1 last1,
|
|
|
|
RandomAccessIterator2 first2,
|
|
|
|
Result const& result,
|
|
|
|
BinaryOperation op,
|
|
|
|
std::random_access_iterator_tag*
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::fixed::detail::transform2_impl_ra(
|
|
|
|
first1,
|
|
|
|
last1,
|
|
|
|
first2,
|
|
|
|
result,
|
|
|
|
op,
|
|
|
|
typename sprout::index_range<0, sprout::fixed_container_traits<Result>::fixed_size>::type(),
|
|
|
|
sprout::fixed_begin_offset(result),
|
|
|
|
sprout::size(result),
|
|
|
|
NS_SSCRISK_CEL_OR_SPROUT_DETAIL::distance(first1, last1)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename BinaryOperation, typename... Args>
|
|
|
|
SPROUT_CONSTEXPR inline typename std::enable_if<
|
|
|
|
sprout::fixed_container_traits<Result>::fixed_size == sizeof...(Args),
|
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
|
|
|
>::type transform2_impl(
|
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
Result const& result,
|
|
|
|
BinaryOperation op,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type size,
|
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::remake_clone<Result, Result>(result, sprout::size(result), args...);
|
|
|
|
}
|
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename BinaryOperation, typename... Args>
|
|
|
|
SPROUT_CONSTEXPR inline typename std::enable_if<
|
|
|
|
sprout::fixed_container_traits<Result>::fixed_size != sizeof...(Args),
|
|
|
|
typename sprout::fixed::result_of::algorithm<Result>::type
|
|
|
|
>::type transform2_impl(
|
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
Result const& result,
|
|
|
|
BinaryOperation op,
|
|
|
|
typename sprout::fixed_container_traits<Result>::size_type size,
|
|
|
|
Args const&... args
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return first1 != last1 && sizeof...(Args) < size
|
|
|
|
? sprout::fixed::detail::transform2_impl(sprout::next(first1), last1, sprout::next(first2), result, op, size, args..., op(*first1, *first2))
|
|
|
|
: sprout::detail::container_complate(result, args...)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename BinaryOperation>
|
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform2(
|
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
|
|
|
Result const& result,
|
|
|
|
BinaryOperation op,
|
|
|
|
void*
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return sprout::fixed::detail::transform2_impl(first1, last1, first2, result, op, sprout::size(result));
|
|
|
|
}
|
2011-09-01 02:48:32 +00:00
|
|
|
} // namespace detail
|
|
|
|
//
|
|
|
|
// transform
|
|
|
|
//
|
2011-10-28 11:34:24 +00:00
|
|
|
template<typename InputIterator1, typename InputIterator2, typename Result, typename BinaryOperation>
|
2011-09-03 13:26:26 +00:00
|
|
|
SPROUT_CONSTEXPR inline typename sprout::fixed::result_of::algorithm<Result>::type transform(
|
2011-10-28 11:34:24 +00:00
|
|
|
InputIterator1 first1,
|
|
|
|
InputIterator1 last1,
|
|
|
|
InputIterator2 first2,
|
2011-09-01 02:48:32 +00:00
|
|
|
Result const& result,
|
|
|
|
BinaryOperation op
|
|
|
|
)
|
|
|
|
{
|
2011-10-28 11:34:24 +00:00
|
|
|
typedef typename std::iterator_traits<InputIterator1>::iterator_category* category;
|
|
|
|
return sprout::fixed::detail::transform2(first1, last1, first2, result, op, category());
|
2011-09-01 02:48:32 +00:00
|
|
|
}
|
|
|
|
} // namespace fixed
|
2011-09-03 13:26:26 +00:00
|
|
|
|
|
|
|
using sprout::fixed::transform;
|
2011-09-01 02:48:32 +00:00
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FIXED_TRANSFORM_HPP
|