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 // void sort();
13
14 #include <list>
15 #include <cassert>
16
17 #include "min_allocator.h"
18
main()19 int main()
20 {
21 {
22 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9};
23 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
25 c1.sort();
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
27 }
28 #if __cplusplus >= 201103L
29 {
30 int a1[] = {4, 8, 1, 0, 5, 7, 2, 3, 6, 11, 10, 9};
31 int a2[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 c1.sort();
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
35 }
36 #endif
37 }
38