text: /*=============================================================================
    Copyright (c) 2011-2019 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_FIT_SET_INTERSECTION_HPP
  #define SPROUT_RANGE_ALGORITHM_FIT_SET_INTERSECTION_HPP
  
  #include <sprout/config.hpp>
  #include <sprout/container/functions.hpp>
  #include <sprout/algorithm/fit/results.hpp>
  #include <sprout/algorithm/fit/set_intersection.hpp>
  
  namespace sprout {
  	namespace range {
  		namespace fit {
  			//
  			// set_intersection
  			//
  			template<typename InputRange1, typename InputRange2, typename Result, typename Compare>
  			inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
  			set_intersection(InputRange1 const& rng1, InputRange2 const& rng2, Result const& result, Compare comp) {
  				return sprout::fit::set_intersection(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), result, comp);
  			}
  			template<typename InputRange1, typename InputRange2, typename Result>
  			inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Result>::type
  			set_intersection(InputRange1 const& rng1, InputRange2 const& rng2, Result const& result) {
  				return sprout::fit::set_intersection(sprout::begin(rng1), sprout::end(rng1), sprout::begin(rng2), sprout::end(rng2), result);
  			}
  		}	// namespace fit
  	}	// namespace range
  }	// namespace sprout
  
  #endif	// #ifndef SPROUT_RANGE_ALGORITHM_FIT_SET_INTERSECTION_HPP
  