Sprout/sprout/algorithm/transform.hpp

/*=============================================================================
  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)
=============================================================================*/
#ifndef SPROUT_ALGORITHM_TRANSFORM_HPP
#define SPROUT_ALGORITHM_TRANSFORM_HPP

#include <sprout/config.hpp>
#include <sprout/iterator/type_traits/is_iterator_of.hpp>
#include <sprout/type_traits/enabler_if.hpp>

namespace sprout {
	//
	// 25.3.4 Transform
	//
	template<
		typename InputIterator, typename OutputIterator, typename UnaryOperation,
		typename sprout::enabler_if<sprout::is_output_iterator<OutputIterator>::value>::type = sprout::enabler
	>
	inline SPROUT_CXX14_CONSTEXPR OutputIterator
	transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op) {
		while (first != last) {
			*result++ = op(*first++);
		}
		return result;
	}
	template<
		typename InputIterator1, typename InputIterator2, typename OutputIterator, typename BinaryOperation,
		typename sprout::enabler_if<sprout::is_output_iterator<OutputIterator>::value>::type = sprout::enabler
	>
	inline SPROUT_CXX14_CONSTEXPR OutputIterator
	transform(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator result, BinaryOperation op) {
		while (first1 != last1) {
			*result++ = op(*first1++, *first2++);
		}
		return result;
	}
}	// namespace sprout

#include <sprout/algorithm/fixed/transform.hpp>
#include <sprout/algorithm/fit/transform.hpp>

#endif	// #ifndef SPROUT_ALGORITHM_TRANSFORM_HPP