remove_if.hpp 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209
  1. /// \file
  2. // Range v3 library
  3. //
  4. // Copyright Eric Niebler 2013-present
  5. //
  6. // Use, modification and distribution is subject to the
  7. // Boost Software License, Version 1.0. (See accompanying
  8. // file LICENSE_1_0.txt or copy at
  9. // http://www.boost.org/LICENSE_1_0.txt)
  10. //
  11. // Project home: https://github.com/ericniebler/range-v3
  12. //
  13. #ifndef RANGES_V3_VIEW_REMOVE_IF_HPP
  14. #define RANGES_V3_VIEW_REMOVE_IF_HPP
  15. #include <type_traits>
  16. #include <utility>
  17. #include <meta/meta.hpp>
  18. #include <range/v3/range_fwd.hpp>
  19. #include <range/v3/functional/bind_back.hpp>
  20. #include <range/v3/functional/compose.hpp>
  21. #include <range/v3/functional/invoke.hpp>
  22. #include <range/v3/range/access.hpp>
  23. #include <range/v3/range/concepts.hpp>
  24. #include <range/v3/range/traits.hpp>
  25. #include <range/v3/utility/box.hpp>
  26. #include <range/v3/utility/optional.hpp>
  27. #include <range/v3/utility/semiregular_box.hpp>
  28. #include <range/v3/utility/static_const.hpp>
  29. #include <range/v3/view/adaptor.hpp>
  30. #include <range/v3/view/view.hpp>
  31. #include <range/v3/detail/prologue.hpp>
  32. namespace ranges
  33. {
  34. /// \addtogroup group-views
  35. /// @{
  36. template<typename Rng, typename Pred>
  37. struct RANGES_EMPTY_BASES remove_if_view
  38. : view_adaptor<remove_if_view<Rng, Pred>, Rng,
  39. is_finite<Rng>::value ? finite : range_cardinality<Rng>::value>
  40. , private box<semiregular_box_t<Pred>>
  41. {
  42. remove_if_view() = default;
  43. constexpr remove_if_view(Rng rng, Pred pred)
  44. : remove_if_view::view_adaptor{detail::move(rng)}
  45. , remove_if_view::box(detail::move(pred))
  46. {}
  47. private:
  48. friend range_access;
  49. struct adaptor : adaptor_base
  50. {
  51. adaptor() = default;
  52. constexpr adaptor(remove_if_view * rng) noexcept
  53. : rng_(rng)
  54. {}
  55. static constexpr iterator_t<Rng> begin(remove_if_view & rng)
  56. {
  57. return *rng.begin_;
  58. }
  59. constexpr void next(iterator_t<Rng> & it) const
  60. {
  61. RANGES_ASSERT(it != ranges::end(rng_->base()));
  62. rng_->satisfy_forward(++it);
  63. }
  64. CPP_member
  65. constexpr auto prev(iterator_t<Rng> & it) const //
  66. -> CPP_ret(void)(
  67. requires bidirectional_range<Rng>)
  68. {
  69. rng_->satisfy_reverse(it);
  70. }
  71. void advance() = delete;
  72. void distance_to() = delete;
  73. private:
  74. remove_if_view * rng_;
  75. };
  76. constexpr adaptor begin_adaptor()
  77. {
  78. cache_begin();
  79. return {this};
  80. }
  81. CPP_member
  82. constexpr auto end_adaptor() const noexcept //
  83. -> CPP_ret(adaptor_base)(
  84. requires (!common_range<Rng>))
  85. {
  86. return {};
  87. }
  88. CPP_member
  89. constexpr auto end_adaptor() //
  90. -> CPP_ret(adaptor)(
  91. requires common_range<Rng>)
  92. {
  93. if(bidirectional_range<Rng>)
  94. cache_begin();
  95. return {this};
  96. }
  97. constexpr void satisfy_forward(iterator_t<Rng> & it)
  98. {
  99. auto const last = ranges::end(this->base());
  100. auto & pred = this->remove_if_view::box::get();
  101. while(it != last && invoke(pred, *it))
  102. ++it;
  103. }
  104. constexpr void satisfy_reverse(iterator_t<Rng> & it)
  105. {
  106. RANGES_ASSERT(begin_);
  107. auto const & first = *begin_;
  108. auto & pred = this->remove_if_view::box::get();
  109. do
  110. {
  111. RANGES_ASSERT(it != first);
  112. (void)first;
  113. --it;
  114. } while(invoke(pred, *it));
  115. }
  116. constexpr void cache_begin()
  117. {
  118. if(begin_)
  119. return;
  120. auto it = ranges::begin(this->base());
  121. satisfy_forward(it);
  122. begin_.emplace(std::move(it));
  123. }
  124. detail::non_propagating_cache<iterator_t<Rng>> begin_;
  125. };
  126. #if RANGES_CXX_DEDUCTION_GUIDES >= RANGES_CXX_DEDUCTION_GUIDES_17
  127. template(typename Rng, typename Pred)(
  128. requires copy_constructible<Pred>)
  129. remove_if_view(Rng &&, Pred)
  130. -> remove_if_view<views::all_t<Rng>, Pred>;
  131. #endif
  132. namespace views
  133. {
  134. /// Given a source range, unary predicate, and optional projection,
  135. /// present a view of the elements that do not satisfy the predicate.
  136. struct remove_if_base_fn
  137. {
  138. template(typename Rng, typename Pred)(
  139. requires viewable_range<Rng> AND input_range<Rng> AND
  140. indirect_unary_predicate<Pred, iterator_t<Rng>>)
  141. constexpr remove_if_view<all_t<Rng>, Pred> operator()(Rng && rng, Pred pred)
  142. const
  143. {
  144. return remove_if_view<all_t<Rng>, Pred>{all(static_cast<Rng &&>(rng)),
  145. std::move(pred)};
  146. }
  147. template(typename Rng, typename Pred, typename Proj)(
  148. requires viewable_range<Rng> AND input_range<Rng> AND
  149. indirect_unary_predicate<Pred, projected<iterator_t<Rng>, Proj>>)
  150. constexpr remove_if_view<all_t<Rng>, composed<Pred, Proj>> //
  151. operator()(Rng && rng, Pred pred, Proj proj) const
  152. {
  153. return remove_if_view<all_t<Rng>, composed<Pred, Proj>>{
  154. all(static_cast<Rng &&>(rng)),
  155. compose(std::move(pred), std::move(proj))};
  156. }
  157. };
  158. struct remove_if_bind_fn
  159. {
  160. template<typename Pred>
  161. constexpr auto operator()(Pred pred) const // TODO: underconstrained
  162. {
  163. return make_view_closure(bind_back(remove_if_base_fn{}, std::move(pred)));
  164. }
  165. template(typename Pred, typename Proj)(
  166. requires (!range<Pred>)) // TODO: underconstrained
  167. constexpr auto operator()(Pred && pred, Proj proj) const
  168. {
  169. return make_view_closure(bind_back(
  170. remove_if_base_fn{}, static_cast<Pred &&>(pred), std::move(proj)));
  171. }
  172. };
  173. struct RANGES_EMPTY_BASES remove_if_fn
  174. : remove_if_base_fn, remove_if_bind_fn
  175. {
  176. using remove_if_base_fn::operator();
  177. using remove_if_bind_fn::operator();
  178. };
  179. /// \relates remove_if_fn
  180. /// \ingroup group-views
  181. RANGES_INLINE_VARIABLE(remove_if_fn, remove_if)
  182. } // namespace views
  183. /// @}
  184. } // namespace ranges
  185. #include <range/v3/detail/satisfy_boost_range.hpp>
  186. RANGES_SATISFY_BOOST_RANGE(::ranges::remove_if_view)
  187. #include <range/v3/detail/epilogue.hpp>
  188. #endif