1*4bdff4beSrobert //===----------------------------------------------------------------------===// 2*4bdff4beSrobert // 3*4bdff4beSrobert // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4*4bdff4beSrobert // See https://llvm.org/LICENSE.txt for license information. 5*4bdff4beSrobert // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6*4bdff4beSrobert // 7*4bdff4beSrobert //===----------------------------------------------------------------------===// 8*4bdff4beSrobert 9*4bdff4beSrobert #ifndef _LIBCPP___ALGORITHM_RANGES_SET_INTERSECTION_H 10*4bdff4beSrobert #define _LIBCPP___ALGORITHM_RANGES_SET_INTERSECTION_H 11*4bdff4beSrobert 12*4bdff4beSrobert #include <__algorithm/in_in_out_result.h> 13*4bdff4beSrobert #include <__algorithm/iterator_operations.h> 14*4bdff4beSrobert #include <__algorithm/make_projected.h> 15*4bdff4beSrobert #include <__algorithm/set_intersection.h> 16*4bdff4beSrobert #include <__config> 17*4bdff4beSrobert #include <__functional/identity.h> 18*4bdff4beSrobert #include <__functional/invoke.h> 19*4bdff4beSrobert #include <__functional/ranges_operations.h> 20*4bdff4beSrobert #include <__iterator/concepts.h> 21*4bdff4beSrobert #include <__iterator/mergeable.h> 22*4bdff4beSrobert #include <__ranges/access.h> 23*4bdff4beSrobert #include <__ranges/concepts.h> 24*4bdff4beSrobert #include <__ranges/dangling.h> 25*4bdff4beSrobert #include <__utility/move.h> 26*4bdff4beSrobert 27*4bdff4beSrobert #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 28*4bdff4beSrobert # pragma GCC system_header 29*4bdff4beSrobert #endif 30*4bdff4beSrobert 31*4bdff4beSrobert #if _LIBCPP_STD_VER > 17 32*4bdff4beSrobert 33*4bdff4beSrobert _LIBCPP_BEGIN_NAMESPACE_STD 34*4bdff4beSrobert 35*4bdff4beSrobert namespace ranges { 36*4bdff4beSrobert 37*4bdff4beSrobert template <class _InIter1, class _InIter2, class _OutIter> 38*4bdff4beSrobert using set_intersection_result = in_in_out_result<_InIter1, _InIter2, _OutIter>; 39*4bdff4beSrobert 40*4bdff4beSrobert namespace __set_intersection { 41*4bdff4beSrobert 42*4bdff4beSrobert struct __fn { 43*4bdff4beSrobert template < 44*4bdff4beSrobert input_iterator _InIter1, 45*4bdff4beSrobert sentinel_for<_InIter1> _Sent1, 46*4bdff4beSrobert input_iterator _InIter2, 47*4bdff4beSrobert sentinel_for<_InIter2> _Sent2, 48*4bdff4beSrobert weakly_incrementable _OutIter, 49*4bdff4beSrobert class _Comp = less, 50*4bdff4beSrobert class _Proj1 = identity, 51*4bdff4beSrobert class _Proj2 = identity> 52*4bdff4beSrobert requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> operator__fn53*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr set_intersection_result<_InIter1, _InIter2, _OutIter> operator()( 54*4bdff4beSrobert _InIter1 __first1, 55*4bdff4beSrobert _Sent1 __last1, 56*4bdff4beSrobert _InIter2 __first2, 57*4bdff4beSrobert _Sent2 __last2, 58*4bdff4beSrobert _OutIter __result, 59*4bdff4beSrobert _Comp __comp = {}, 60*4bdff4beSrobert _Proj1 __proj1 = {}, 61*4bdff4beSrobert _Proj2 __proj2 = {}) const { 62*4bdff4beSrobert auto __ret = std::__set_intersection<_RangeAlgPolicy>( 63*4bdff4beSrobert std::move(__first1), 64*4bdff4beSrobert std::move(__last1), 65*4bdff4beSrobert std::move(__first2), 66*4bdff4beSrobert std::move(__last2), 67*4bdff4beSrobert std::move(__result), 68*4bdff4beSrobert ranges::__make_projected_comp(__comp, __proj1, __proj2)); 69*4bdff4beSrobert return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 70*4bdff4beSrobert } 71*4bdff4beSrobert 72*4bdff4beSrobert template < 73*4bdff4beSrobert input_range _Range1, 74*4bdff4beSrobert input_range _Range2, 75*4bdff4beSrobert weakly_incrementable _OutIter, 76*4bdff4beSrobert class _Comp = less, 77*4bdff4beSrobert class _Proj1 = identity, 78*4bdff4beSrobert class _Proj2 = identity> 79*4bdff4beSrobert requires mergeable< 80*4bdff4beSrobert iterator_t<_Range1>, 81*4bdff4beSrobert iterator_t<_Range2>, 82*4bdff4beSrobert _OutIter, 83*4bdff4beSrobert _Comp, 84*4bdff4beSrobert _Proj1, 85*4bdff4beSrobert _Proj2> 86*4bdff4beSrobert _LIBCPP_HIDE_FROM_ABI constexpr set_intersection_result<borrowed_iterator_t<_Range1>, 87*4bdff4beSrobert borrowed_iterator_t<_Range2>, 88*4bdff4beSrobert _OutIter> operator__fn89*4bdff4beSrobert operator()( 90*4bdff4beSrobert _Range1&& __range1, 91*4bdff4beSrobert _Range2&& __range2, 92*4bdff4beSrobert _OutIter __result, 93*4bdff4beSrobert _Comp __comp = {}, 94*4bdff4beSrobert _Proj1 __proj1 = {}, 95*4bdff4beSrobert _Proj2 __proj2 = {}) const { 96*4bdff4beSrobert auto __ret = std::__set_intersection<_RangeAlgPolicy>( 97*4bdff4beSrobert ranges::begin(__range1), 98*4bdff4beSrobert ranges::end(__range1), 99*4bdff4beSrobert ranges::begin(__range2), 100*4bdff4beSrobert ranges::end(__range2), 101*4bdff4beSrobert std::move(__result), 102*4bdff4beSrobert ranges::__make_projected_comp(__comp, __proj1, __proj2)); 103*4bdff4beSrobert return {std::move(__ret.__in1_), std::move(__ret.__in2_), std::move(__ret.__out_)}; 104*4bdff4beSrobert } 105*4bdff4beSrobert }; 106*4bdff4beSrobert 107*4bdff4beSrobert } // namespace __set_intersection 108*4bdff4beSrobert 109*4bdff4beSrobert inline namespace __cpo { 110*4bdff4beSrobert inline constexpr auto set_intersection = __set_intersection::__fn{}; 111*4bdff4beSrobert } // namespace __cpo 112*4bdff4beSrobert } // namespace ranges 113*4bdff4beSrobert 114*4bdff4beSrobert _LIBCPP_END_NAMESPACE_STD 115*4bdff4beSrobert 116*4bdff4beSrobert #endif // _LIBCPP_STD_VER > 17 117*4bdff4beSrobert #endif // _LIBCPP___ALGORITHM_RANGES_SET_INTERSECTION_H 118