4684ddb6aa
- import libcxx - reduce targets to the one when compiled as a tools Change-Id: Iabb8427f80ff8e89463559a28bcb8b4f2bdbc496
37 lines
949 B
C++
37 lines
949 B
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <list>
|
|
|
|
// void unique();
|
|
|
|
#include <list>
|
|
#include <cassert>
|
|
|
|
#include "../../../min_allocator.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3};
|
|
int a2[] = {2, 1, 4, 3};
|
|
std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
c.unique();
|
|
assert(c == std::list<int>(a2, a2+4));
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
int a1[] = {2, 1, 1, 4, 4, 4, 4, 3, 3};
|
|
int a2[] = {2, 1, 4, 3};
|
|
std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
c.unique();
|
|
assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
|
}
|
|
#endif
|
|
}
|