unique_pred.pass.cpp revision d24c465beaec2fe9a0e365e6379cd5d3acaeb2ca 
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// <list>
11
12// template <class BinaryPred> void unique(BinaryPred pred);
13
14#include <list>
15#include <cassert>
16
17#include "min_allocator.h"
18
19bool g(int x, int y)
20{
21    return x == y;
22}
23
24int main()
25{
26    {
27    int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3};
28    int a2[] = {2, 1, 4, 3};
29    std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
30    c.unique(g);
31    assert(c == std::list<int>(a2, a2+4));
32    }
33#if TEST_STD_VER >= 11
34    {
35    int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3};
36    int a2[] = {2, 1, 4, 3};
37    std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
38    c.unique(g);
39    assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
40    }
41#endif
42}
43