File: ranges_remove_copy_if.pass.cpp

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (297 lines) | stat: -rw-r--r-- 10,180 bytes parent folder | download | duplicates (13)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//

// UNSUPPORTED: c++03, c++11, c++14, c++17

// <algorithm>

// template<input_iterator I, sentinel_for<I> S, weakly_incrementable O,
//          class Proj = identity, indirect_unary_predicate<projected<I, Proj>> Pred>
//   requires indirectly_copyable<I, O>
//   constexpr remove_copy_if_result<I, O>
//     remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {});                        // Since C++20
//
// template<input_range R, weakly_incrementable O, class Proj = identity,
//          indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
//   requires indirectly_copyable<iterator_t<R>, O>
//   constexpr remove_copy_if_result<borrowed_iterator_t<R>, O>
//     remove_copy_if(R&& r, O result, Pred pred, Proj proj = {});                                  // Since C++20

#include <algorithm>
#include <array>
#include <concepts>
#include <functional>
#include <ranges>
#include <type_traits>
#include <utility>

#include "almost_satisfies_types.h"
#include "counting_predicates.h"
#include "counting_projection.h"
#include "test_iterators.h"

struct AlwaysTrue {
  constexpr bool operator()(auto&&...) const { return true; }
};

template <
    class I,
    class S    = sentinel_wrapper<std::decay_t<I>>,
    class O    = int*,
    class Pred = AlwaysTrue>
concept HasRemoveCopyIfIter =
  requires(I&& iter, S&& sent, O&& out, Pred&& pred) {
    std::ranges::remove_copy_if(std::forward<I>(iter), std::forward<S>(sent),
                                std::forward<O>(out), std::forward<Pred>(pred));
};

static_assert(HasRemoveCopyIfIter<int*, int*, int*>);

// !input_iterator<I>
static_assert(!HasRemoveCopyIfIter<InputIteratorNotDerivedFrom>);
static_assert(!HasRemoveCopyIfIter<cpp20_output_iterator<int*>>);

// !sentinel_for<S, I>
static_assert(!HasRemoveCopyIfIter<int*, SentinelForNotWeaklyEqualityComparableWith>);
static_assert(!HasRemoveCopyIfIter<int*, SentinelForNotSemiregular>);

// !weakly_incrementable<O>
static_assert(!HasRemoveCopyIfIter<int*, int*, WeaklyIncrementableNotMovable>);

// !indirect_unary_predicate<Pred, projected<I, Proj>>
static_assert(!HasRemoveCopyIfIter<int*, int*, int*, IndirectUnaryPredicateNotPredicate>);
static_assert(!HasRemoveCopyIfIter<int*, int*, int*, IndirectUnaryPredicateNotCopyConstructible>);

// !indirectly_copyable<I, O>
static_assert(!HasRemoveCopyIfIter<int*, int*, OutputIteratorNotIndirectlyWritable>);
static_assert(!HasRemoveCopyIfIter<const int*, const int*, const int*>);

template < class R, class O = int*, class Pred = AlwaysTrue, class Proj = std::identity>
concept HasRemoveCopyIfRange =
    requires(R&& r, O&& out, Pred&& pred, Proj&& proj) {
      std::ranges::remove_copy_if(
          std::forward<R>(r), std::forward<O>(out), std::forward<Pred>(pred), std::forward<Proj>(proj));
    };

template <class T>
using R = UncheckedRange<T>;

static_assert(HasRemoveCopyIfRange<R<int*>>);

// !input_range<R>
static_assert(!HasRemoveCopyIfRange<R<InputIteratorNotDerivedFrom>>);
static_assert(!HasRemoveCopyIfRange<R<cpp20_output_iterator<int*>>>);

// !weakly_incrementable<O>
static_assert(!HasRemoveCopyIfRange<R<int*>, WeaklyIncrementableNotMovable>);

// !indirect_unary_predicate<Pred, projected<iterator_t<R>, Proj>>
static_assert(!HasRemoveCopyIfRange<R<int*>, int*, IndirectUnaryPredicateNotPredicate>);
static_assert(!HasRemoveCopyIfRange<R<int*>, int*, IndirectUnaryPredicateNotCopyConstructible>);

// !indirectly_copyable<iterator_t<R>, O>
static_assert(!HasRemoveCopyIfRange<R<int*>, OutputIteratorNotIndirectlyWritable>);
static_assert(!HasRemoveCopyIfRange<R<const int*>, const int*>);

template <class InIter, class OutIter, template <class> class SentWrapper, std::size_t N1, std::size_t N2, class Pred>
constexpr void testRemoveCopyIfImpl(std::array<int, N1> in, std::array<int, N2> expected, Pred pred) {
  using Sent = SentWrapper<InIter>;
  using Result = std::ranges::remove_copy_if_result<InIter, OutIter>;

  // iterator overload
  {
    std::array<int, N2> out;
    std::same_as<Result> decltype(auto) result =
        std::ranges::remove_copy_if(InIter{in.data()}, Sent{InIter{in.data() + in.size()}}, OutIter{out.data()}, pred);
    assert(std::ranges::equal(out, expected));
    assert(base(result.in) == in.data() + in.size());
    assert(base(result.out) == out.data() + out.size());
  }

  // range overload
  {
    std::array<int, N2> out;
    std::ranges::subrange r{InIter{in.data()}, Sent{InIter{in.data() + in.size()}}};
    std::same_as<Result> decltype(auto) result =
        std::ranges::remove_copy_if(r, OutIter{out.data()}, pred);
    assert(std::ranges::equal(out, expected));
    assert(base(result.in) == in.data() + in.size());
    assert(base(result.out) == out.data() + out.size());
  }
}

template <class InIter, class OutIter, template <class> class SentWrapper>
constexpr void testImpl() {
  // remove multiple elements
  {
    std::array in{1, 2, 3, 2, 1};
    std::array expected{1, 3, 1};
    auto pred = [](int i) { return i == 2; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // remove single elements
  {
    std::array in{1, 2, 3, 2, 1};
    std::array expected{1, 2, 2, 1};
    auto pred = [](int i) { return i == 3; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // nothing removed
  {
    std::array in{1, 2, 3, 2, 1};
    std::array expected{1, 2, 3, 2, 1};
    auto pred = [](int) { return false; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // all removed
  {
    std::array in{1, 2, 3, 2, 1};
    std::array<int, 0> expected{};
    auto pred = [](int) { return true; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // remove first
  {
    std::array in{1, 2, 3, 2};
    std::array expected{2, 3, 2};
    auto pred = [](int i) { return i < 2; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // remove last
  {
    std::array in{1, 2, 3, 2, 5};
    std::array expected{1, 2, 3, 2};
    auto pred = [](int i) { return i > 3; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // stable
  {
    std::array in{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    std::array expected{6, 7, 8, 9, 10};
    auto pred = [](int i) { return i < 6; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // empty range
  {
    std::array<int, 0> in{};
    std::array<int, 0> expected{};
    auto pred = [](int) { return false; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }

  // one element range
  {
    std::array in{1};
    std::array<int, 0> expected{};
    auto pred = [](int i) { return i == 1; };
    testRemoveCopyIfImpl<InIter, OutIter, SentWrapper>(in, expected, pred);
  }
}

template <class OutIter, template <class> class SentWrapper>
constexpr void withAllPermutationsOfInIter() {
  testImpl<cpp20_input_iterator<int*>, OutIter, sentinel_wrapper>();
  testImpl<forward_iterator<int*>, OutIter, SentWrapper>();
  testImpl<bidirectional_iterator<int*>, OutIter, SentWrapper>();
  testImpl<random_access_iterator<int*>, OutIter, SentWrapper>();
  testImpl<contiguous_iterator<int*>, OutIter, SentWrapper>();
  testImpl<int*, OutIter, SentWrapper>();
}

template <template <class> class SentWrapper>
constexpr void withAllPermutationsOfInIterOutIter() {
  withAllPermutationsOfInIter<cpp20_output_iterator<int*>, SentWrapper>();
  withAllPermutationsOfInIter<int*, SentWrapper>();
}

constexpr bool test() {
  withAllPermutationsOfInIterOutIter<std::type_identity_t>();
  withAllPermutationsOfInIterOutIter<sentinel_wrapper>();

  // Test custom projection
  {
    struct Data {
      int data;
    };

    std::array in{Data{4}, Data{8}, Data{12}, Data{12}};
    std::array expected{Data{4}, Data{12}, Data{12}};

    const auto proj = &Data::data;
    const auto pred = [](int i) { return i == 8; };

    const auto equals = [](const Data& x, const Data& y) { return x.data == y.data; };
    // iterator overload
    {
      std::array<Data, 3> out;
      auto result = std::ranges::remove_copy_if(in.begin(), in.end(), out.begin(), pred, proj);
      assert(std::ranges::equal(out, expected, equals));
      assert(result.in == in.end());
      assert(result.out == out.end());
    }

    // range overload
    {
      std::array<Data, 3> out;
      auto result = std::ranges::remove_copy_if(in, out.begin(), pred, proj);
      assert(std::ranges::equal(out, expected, equals));
      assert(result.in == in.end());
      assert(result.out == out.end());
    }
  }

  // Complexity: Exactly last - first applications of the corresponding predicate and any projection.
  {
    std::array in{4, 4, 5, 6};
    std::array expected{5, 6};

    const auto pred = [](int i) { return i == 4; };

    // iterator overload
    {
      int numberOfPred = 0;
      int numberOfProj = 0;
      std::array<int, 2> out;
      std::ranges::remove_copy_if(
          in.begin(), in.end(), out.begin(), counting_predicate(pred, numberOfPred), counting_projection(numberOfProj));

      assert(numberOfPred == static_cast<int>(in.size()));
      assert(numberOfProj == static_cast<int>(in.size()));

      assert(std::ranges::equal(out, expected));
    }

    // range overload
    {
      int numberOfPred = 0;
      int numberOfProj = 0;
      std::array<int, 2> out;
      std::ranges::remove_copy_if(
          in, out.begin(), counting_predicate(pred, numberOfPred), counting_projection(numberOfProj));
      assert(numberOfPred == static_cast<int>(in.size()));
      assert(numberOfProj == static_cast<int>(in.size()));
      assert(std::ranges::equal(out, expected));
    }
  }

  return true;
}

int main(int, char**) {
  test();
  static_assert(test());

  return 0;
}