set_intersection.h 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  4. // See https://llvm.org/LICENSE.txt for license information.
  5. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  6. //
  7. //===----------------------------------------------------------------------===//
  8. #ifndef _LIBCPP___ALGORITHM_SET_INTERSECTION_H
  9. #define _LIBCPP___ALGORITHM_SET_INTERSECTION_H
  10. #include <__algorithm/comp.h>
  11. #include <__algorithm/comp_ref_type.h>
  12. #include <__algorithm/iterator_operations.h>
  13. #include <__config>
  14. #include <__iterator/iterator_traits.h>
  15. #include <__utility/move.h>
  16. #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
  17. # pragma GCC system_header
  18. #endif
  19. _LIBCPP_BEGIN_NAMESPACE_STD
  20. template <class _InIter1, class _InIter2, class _OutIter>
  21. struct __set_intersection_result {
  22. _InIter1 in1;
  23. _InIter2 in2;
  24. _OutIter out;
  25. // need a constructor as C++03 aggregate init is hard
  26. _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17
  27. __set_intersection_result(_InIter1&& __in_iter1, _InIter2&& __in_iter2, _OutIter&& __out_iter)
  28. : in1(std::move(__in_iter1)), in2(std::move(__in_iter2)), out(std::move(__out_iter)) {}
  29. };
  30. template < class _IterOper, class _Compare, class _InIter1, class _Sent1, class _InIter2, class _Sent2, class _OutIter>
  31. _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17 __set_intersection_result<_InIter1, _InIter2, _OutIter>
  32. __set_intersection(
  33. _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) {
  34. while (__first1 != __last1 && __first2 != __last2) {
  35. if (__comp(*__first1, *__first2))
  36. ++__first1;
  37. else {
  38. if (!__comp(*__first2, *__first1)) {
  39. *__result = *__first1;
  40. ++__result;
  41. ++__first1;
  42. }
  43. ++__first2;
  44. }
  45. }
  46. return __set_intersection_result<_InIter1, _InIter2, _OutIter>(
  47. _IterOper::next(std::move(__first1), std::move(__last1)),
  48. _IterOper::next(std::move(__first2), std::move(__last2)),
  49. std::move(__result));
  50. }
  51. template <class _InputIterator1, class _InputIterator2, class _OutputIterator, class _Compare>
  52. inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator set_intersection(
  53. _InputIterator1 __first1,
  54. _InputIterator1 __last1,
  55. _InputIterator2 __first2,
  56. _InputIterator2 __last2,
  57. _OutputIterator __result,
  58. _Compare __comp) {
  59. typedef typename __comp_ref_type<_Compare>::type _Comp_ref;
  60. return std::__set_intersection<_StdIterOps, _Comp_ref>(
  61. std::move(__first1),
  62. std::move(__last1),
  63. std::move(__first2),
  64. std::move(__last2),
  65. std::move(__result),
  66. __comp)
  67. .out;
  68. }
  69. template <class _InputIterator1, class _InputIterator2, class _OutputIterator>
  70. inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator set_intersection(
  71. _InputIterator1 __first1,
  72. _InputIterator1 __last1,
  73. _InputIterator2 __first2,
  74. _InputIterator2 __last2,
  75. _OutputIterator __result) {
  76. return std::__set_intersection<_StdIterOps>(
  77. std::move(__first1),
  78. std::move(__last1),
  79. std::move(__first2),
  80. std::move(__last2),
  81. std::move(__result),
  82. __less<typename iterator_traits<_InputIterator1>::value_type,
  83. typename iterator_traits<_InputIterator2>::value_type>())
  84. .out;
  85. }
  86. _LIBCPP_END_NAMESPACE_STD
  87. #endif // _LIBCPP___ALGORITHM_SET_INTERSECTION_H