Sprout/sprout/range/algorithm/find_end.hpp

/*=============================================================================
  Copyright (c) 2011 RiSK (sscrisk)
  https://github.com/sscrisk/CEL---ConstExpr-Library

  Copyright (c) 2011-2016 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_RANGE_ALGORITHM_FIND_END_HPP
#define SPROUT_RANGE_ALGORITHM_FIND_END_HPP

#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/range/range_return.hpp>
#include <sprout/algorithm/find_end.hpp>

namespace sprout {
	namespace range {

		// 25.2.6 Find end
		template<typename ForwardRange1, typename ForwardRange2>
		inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1>::type
		find_end(ForwardRange1&& range1, ForwardRange2&& range2) {
			return sprout::range::range_return<ForwardRange1>::pack(
				sprout::find_end(
					sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
					sprout::end(SPROUT_FORWARD(ForwardRange2, range2))
					),
				SPROUT_FORWARD(ForwardRange1, range1)
				);
		}

		template<typename ForwardRange1, typename ForwardRange2, typename BinaryPredicate>
		inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1>::type
		find_end(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) {
			return sprout::range::range_return<ForwardRange1>::pack(
				sprout::find_end(
					sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
					sprout::end(SPROUT_FORWARD(ForwardRange2, range2)),
					pred
					),
				SPROUT_FORWARD(ForwardRange1, range1)
				);
		}

		template<sprout::range::range_return_value RetV, typename ForwardRange1, typename ForwardRange2>
		inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1, RetV>::type
		find_end(ForwardRange1&& range1, ForwardRange2&& range2) {
			return sprout::range::range_return<ForwardRange1, RetV>::pack(
				sprout::find_end(
					sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
					sprout::end(SPROUT_FORWARD(ForwardRange2, range2))
					),
				SPROUT_FORWARD(ForwardRange1, range1)
				);
		}

		template<sprout::range::range_return_value RetV, typename ForwardRange1, typename ForwardRange2, typename BinaryPredicate>
		inline SPROUT_CONSTEXPR typename sprout::range::range_return<ForwardRange1, RetV>::type
		find_end(ForwardRange1&& range1, ForwardRange2&& range2, BinaryPredicate pred) {
			return sprout::range::range_return<ForwardRange1, RetV>::pack(
				sprout::find_end(
					sprout::begin(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::end(SPROUT_FORWARD(ForwardRange1, range1)),
					sprout::begin(SPROUT_FORWARD(ForwardRange2, range2)),
					sprout::end(SPROUT_FORWARD(ForwardRange2, range2)),
					pred
					),
				SPROUT_FORWARD(ForwardRange1, range1)
				);
		}
	}	// namespace range
}	// namespace sprout

#endif	// #ifndef SPROUT_RANGE_ALGORITHM_FIND_END_HPP