]>
Commit | Line | Data |
---|---|---|
8a158962 | 1 | // 2003-10-14 Paolo Carlini <pcarlini@unitus.it> |
2 | ||
fbd26352 | 3 | // Copyright (C) 2003-2019 Free Software Foundation, Inc. |
8a158962 | 4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free | |
6 | // software; you can redistribute it and/or modify it under the | |
7 | // terms of the GNU General Public License as published by the | |
6bc9506f | 8 | // Free Software Foundation; either version 3, or (at your option) |
8a158962 | 9 | // any later version. |
10 | ||
11 | // This library is distributed in the hope that it will be useful, | |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | // GNU General Public License for more details. | |
15 | ||
16 | // You should have received a copy of the GNU General Public License along | |
6bc9506f | 17 | // with this library; see the file COPYING3. If not see |
18 | // <http://www.gnu.org/licenses/>. | |
8a158962 | 19 | |
20 | // 25.2.8 [lib.alg.unique] Unique | |
21 | ||
22 | #include <list> | |
23 | #include <algorithm> | |
24 | #include <functional> | |
25 | #include <testsuite_hooks.h> | |
26 | ||
27 | const int T1[] = {1, 4, 4, 6, 1, 2, 2, 3, 1, 6, 6, 6, 5, 7, 5, 4, 4}; | |
28 | const int T2[] = {1, 1, 1, 2, 2, 1, 1, 7, 6, 6, 7, 8, 8, 8, 8, 9, 9}; | |
29 | const int N = sizeof(T1) / sizeof(int); | |
30 | ||
31 | const int A1[] = {1, 4, 6, 1, 2, 3, 1, 6, 5, 7, 5, 4}; | |
32 | const int A2[] = {1, 4, 4, 6, 6, 6, 6, 7}; | |
33 | const int A3[] = {1, 1, 1}; | |
34 | ||
35 | const int B1[] = {1, 2, 1, 7, 6, 7, 8, 9}; | |
36 | const int B2[] = {1, 1, 1, 2, 2, 7, 7, 8, 8, 8, 8, 9, 9}; | |
37 | const int B3[] = {9, 9, 8, 8, 8, 8, 7, 6, 6, 1, 1, 1, 1, 1}; | |
38 | ||
39 | void test01() | |
40 | { | |
8a158962 | 41 | using namespace std; |
42 | ||
43 | list<int>::iterator pos; | |
44 | ||
45 | list<int> coll(T1, T1 + N); | |
46 | pos = unique(coll.begin(), coll.end()); | |
47 | VERIFY( equal(coll.begin(), pos, A1) ); | |
48 | ||
49 | list<int> coll2(T2, T2 + N); | |
50 | pos = unique(coll2.begin(), coll2.end()); | |
51 | VERIFY( equal(coll2.begin(), pos, B1) ); | |
52 | } | |
53 | ||
54 | void test02() | |
55 | { | |
8a158962 | 56 | using namespace std; |
57 | ||
58 | list<int>::iterator pos; | |
59 | ||
60 | list<int> coll(T1, T1 + N); | |
61 | pos = unique(coll.begin(), coll.end(), greater<int>()); | |
62 | VERIFY( equal(coll.begin(), pos, A2) ); | |
63 | ||
64 | list<int> coll2(T2, T2 + N); | |
65 | pos = unique(coll2.begin(), coll2.end(), greater<int>()); | |
66 | VERIFY( equal(coll2.begin(), pos, B2) ); | |
67 | } | |
68 | ||
69 | void test03() | |
70 | { | |
8a158962 | 71 | using namespace std; |
72 | ||
73 | list<int>::iterator pos; | |
74 | ||
75 | list<int> coll(T1, T1 + N); | |
76 | pos = unique(coll.begin(), coll.end(), less<int>()); | |
77 | VERIFY( equal(coll.begin(), pos, A3) ); | |
78 | ||
79 | list<int> coll2(T2, T2 + N); | |
80 | reverse(coll2.begin(), coll2.end()); | |
81 | pos = unique(coll2.begin(), coll2.end(), less<int>()); | |
82 | VERIFY( equal(coll2.begin(), pos, B3) ); | |
83 | } | |
84 | ||
85 | int main() | |
86 | { | |
87 | test01(); | |
88 | test02(); | |
89 | test03(); | |
90 | return 0; | |
91 | } |