xref: /llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/unique.pass.cpp (revision ddda456a76b2809e818c82d90252f42511900b12)
1 //===----------------------------------------------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 
10 // <algorithm>
11 
12 // template<ForwardIterator Iter>
13 //   requires OutputIterator<Iter, Iter::reference>
14 //         && EqualityComparable<Iter::value_type>
15 //   Iter
16 //   unique(Iter first, Iter last);
17 
18 #include <algorithm>
19 #include <cassert>
20 #include <memory>
21 
22 #include "test_macros.h"
23 #include "test_iterators.h"
24 
25 template <class Iter>
26 void
27 test()
28 {
29     int ia[] = {0};
30     const unsigned sa = sizeof(ia)/sizeof(ia[0]);
31     Iter r = std::unique(Iter(ia), Iter(ia+sa));
32     assert(base(r) == ia + sa);
33     assert(ia[0] == 0);
34 
35     int ib[] = {0, 1};
36     const unsigned sb = sizeof(ib)/sizeof(ib[0]);
37     r = std::unique(Iter(ib), Iter(ib+sb));
38     assert(base(r) == ib + sb);
39     assert(ib[0] == 0);
40     assert(ib[1] == 1);
41 
42     int ic[] = {0, 0};
43     const unsigned sc = sizeof(ic)/sizeof(ic[0]);
44     r = std::unique(Iter(ic), Iter(ic+sc));
45     assert(base(r) == ic + 1);
46     assert(ic[0] == 0);
47 
48     int id[] = {0, 0, 1};
49     const unsigned sd = sizeof(id)/sizeof(id[0]);
50     r = std::unique(Iter(id), Iter(id+sd));
51     assert(base(r) == id + 2);
52     assert(id[0] == 0);
53     assert(id[1] == 1);
54 
55     int ie[] = {0, 0, 1, 0};
56     const unsigned se = sizeof(ie)/sizeof(ie[0]);
57     r = std::unique(Iter(ie), Iter(ie+se));
58     assert(base(r) == ie + 3);
59     assert(ie[0] == 0);
60     assert(ie[1] == 1);
61     assert(ie[2] == 0);
62 
63     int ig[] = {0, 0, 1, 1};
64     const unsigned sg = sizeof(ig)/sizeof(ig[0]);
65     r = std::unique(Iter(ig), Iter(ig+sg));
66     assert(base(r) == ig + 2);
67     assert(ig[0] == 0);
68     assert(ig[1] == 1);
69 
70     int ih[] = {0, 1, 1};
71     const unsigned sh = sizeof(ih)/sizeof(ih[0]);
72     r = std::unique(Iter(ih), Iter(ih+sh));
73     assert(base(r) == ih + 2);
74     assert(ih[0] == 0);
75     assert(ih[1] == 1);
76 
77     int ii[] = {0, 1, 1, 1, 2, 2, 2};
78     const unsigned si = sizeof(ii)/sizeof(ii[0]);
79     r = std::unique(Iter(ii), Iter(ii+si));
80     assert(base(r) == ii + 3);
81     assert(ii[0] == 0);
82     assert(ii[1] == 1);
83     assert(ii[2] == 2);
84 }
85 
86 #if TEST_STD_VER >= 11
87 
88 struct do_nothing
89 {
90     void operator()(void*) const {}
91 };
92 
93 typedef std::unique_ptr<int, do_nothing> Ptr;
94 
95 template <class Iter>
96 void
97 test1()
98 {
99     int one = 1;
100     int two = 2;
101     Ptr ia[1];
102     const unsigned sa = sizeof(ia)/sizeof(ia[0]);
103     Iter r = std::unique(Iter(ia), Iter(ia+sa));
104     assert(base(r) == ia + sa);
105     assert(ia[0] == 0);
106 
107     Ptr ib[2];
108     ib[1].reset(&one);
109     const unsigned sb = sizeof(ib)/sizeof(ib[0]);
110     r = std::unique(Iter(ib), Iter(ib+sb));
111     assert(base(r) == ib + sb);
112     assert(ib[0] == 0);
113     assert(*ib[1] == 1);
114 
115     Ptr ic[2];
116     const unsigned sc = sizeof(ic)/sizeof(ic[0]);
117     r = std::unique(Iter(ic), Iter(ic+sc));
118     assert(base(r) == ic + 1);
119     assert(ic[0] == 0);
120 
121     Ptr id[3];
122     id[2].reset(&one);
123     const unsigned sd = sizeof(id)/sizeof(id[0]);
124     r = std::unique(Iter(id), Iter(id+sd));
125     assert(base(r) == id + 2);
126     assert(id[0] == 0);
127     assert(*id[1] == 1);
128 
129     Ptr ie[4];
130     ie[2].reset(&one);
131     const unsigned se = sizeof(ie)/sizeof(ie[0]);
132     r = std::unique(Iter(ie), Iter(ie+se));
133     assert(base(r) == ie + 3);
134     assert(ie[0] == 0);
135     assert(*ie[1] == 1);
136     assert(ie[2] == 0);
137 
138     Ptr ig[4];
139     ig[2].reset(&one);
140     ig[3].reset(&one);
141     const unsigned sg = sizeof(ig)/sizeof(ig[0]);
142     r = std::unique(Iter(ig), Iter(ig+sg));
143     assert(base(r) == ig + 2);
144     assert(ig[0] == 0);
145     assert(*ig[1] == 1);
146 
147     Ptr ih[3];
148     ih[1].reset(&one);
149     ih[2].reset(&one);
150     const unsigned sh = sizeof(ih)/sizeof(ih[0]);
151     r = std::unique(Iter(ih), Iter(ih+sh));
152     assert(base(r) == ih + 2);
153     assert(ih[0] == 0);
154     assert(*ih[1] == 1);
155 
156     Ptr ii[7];
157     ii[1].reset(&one);
158     ii[2].reset(&one);
159     ii[3].reset(&one);
160     ii[4].reset(&two);
161     ii[5].reset(&two);
162     ii[6].reset(&two);
163     const unsigned si = sizeof(ii)/sizeof(ii[0]);
164     r = std::unique(Iter(ii), Iter(ii+si));
165     assert(base(r) == ii + 3);
166     assert(ii[0] == 0);
167     assert(*ii[1] == 1);
168     assert(*ii[2] == 2);
169 }
170 #endif // TEST_STD_VER >= 11
171 
172 int main()
173 {
174     test<forward_iterator<int*> >();
175     test<bidirectional_iterator<int*> >();
176     test<random_access_iterator<int*> >();
177     test<int*>();
178 
179 #if TEST_STD_VER >= 11
180     test1<forward_iterator<Ptr*> >();
181     test1<bidirectional_iterator<Ptr*> >();
182     test1<random_access_iterator<Ptr*> >();
183     test1<Ptr*>();
184 #endif
185 }
186