Sprout/sprout/range/algorithm/find_intersection.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_RANGE_ALGORITHM_FIND_INTERSECTION_HPP
#define SPROUT_RANGE_ALGORITHM_FIND_INTERSECTION_HPP

#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/utility/forward.hpp>
#include <sprout/utility/pair/pair.hpp>
#include <sprout/range/type_traits/lvalue_iterator.hpp>
#include <sprout/algorithm/find_intersection.hpp>

namespace sprout {
	namespace range {
		//
		// find_intersection
		//
		template<typename InputRange1, typename InputRange2, typename Compare>
		inline SPROUT_CONSTEXPR sprout::pair<
			typename sprout::range::lvalue_iterator<InputRange1>::type,
			typename sprout::range::lvalue_iterator<InputRange2>::type
		>
		find_intersection(InputRange1&& range1, InputRange2&& range2, Compare comp) {
			return sprout::find_intersection(
				sprout::begin(sprout::forward<InputRange1>(range1)),
				sprout::end(sprout::forward<InputRange1>(range1)),
				sprout::begin(sprout::forward<InputRange2>(range2)),
				sprout::end(sprout::forward<InputRange2>(range2)),
				comp
				);
		}

		template<typename InputRange1, typename InputRange2>
		inline SPROUT_CONSTEXPR sprout::pair<
			typename sprout::range::lvalue_iterator<InputRange1>::type,
			typename sprout::range::lvalue_iterator<InputRange2>::type
		>
		find_intersection(InputRange1&& range1, InputRange2&& range2) {
			return sprout::find_intersection(
				sprout::begin(sprout::forward<InputRange1>(range1)),
				sprout::end(sprout::forward<InputRange1>(range1)),
				sprout::begin(sprout::forward<InputRange2>(range2)),
				sprout::end(sprout::forward<InputRange2>(range2))
				);
		}
	}	// namespace range
}	// namespace sprout

#endif	// #ifndef SPROUT_RANGE_ALGORITHM_FIND_INTERSECTION_HPP