1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
| //===----------------------------------------------------------------------===//
| //
| // 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.
| //
| //===----------------------------------------------------------------------===//
|
| // <forward_list>
|
| // template <class Compare> void merge(forward_list&& x, Compare comp);
|
| #include <forward_list>
| #include <iterator>
| #include <functional>
| #include <cassert>
|
| #include "min_allocator.h"
|
| int main()
| {
| {
| typedef int T;
| typedef std::forward_list<T> C;
| const T t1[] = {13, 12, 7, 6, 5, 3};
| const T t2[] = {15, 14, 11, 10, 9, 8, 4, 2, 1, 0};
| const T t3[] = {15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
| C c1(std::begin(t1), std::end(t1));
| C c2(std::begin(t2), std::end(t2));
| c1.merge(c2, std::greater<T>());
| C c3(std::begin(t3), std::end(t3));
| assert(c1 == c3);
| }
| #if TEST_STD_VER >= 11
| {
| typedef int T;
| typedef std::forward_list<T, min_allocator<T>> C;
| const T t1[] = {13, 12, 7, 6, 5, 3};
| const T t2[] = {15, 14, 11, 10, 9, 8, 4, 2, 1, 0};
| const T t3[] = {15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
| C c1(std::begin(t1), std::end(t1));
| C c2(std::begin(t2), std::end(t2));
| c1.merge(c2, std::greater<T>());
| C c3(std::begin(t3), std::end(t3));
| assert(c1 == c3);
| }
| #endif
| }
|
|
