1// Copyright (C) 2005-2015 Free Software Foundation, Inc.
2//
3// This file is part of the GNU ISO C++ Library.  This library is free
4// software; you can redistribute it and/or modify it under the
5// terms of the GNU General Public License as published by the
6// Free Software Foundation; either version 3, or (at your option)
7// any later version.
8
9// This library is distributed in the hope that it will be useful,
10// but WITHOUT ANY WARRANTY; without even the implied warranty of
11// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
12// GNU General Public License for more details.
13
14// You should have received a copy of the GNU General Public License along
15// with this library; see the file COPYING3.  If not see
16// <http://www.gnu.org/licenses/>.
17
18// 25.3.4 [lib.alg.merge]
19
20#include <algorithm>
21#include <testsuite_hooks.h>
22#include <testsuite_iterators.h>
23#include <testsuite_new_operators.h>
24
25using __gnu_test::test_container;
26using __gnu_test::bidirectional_iterator_wrapper;
27using std::inplace_merge;
28
29typedef test_container<int, bidirectional_iterator_wrapper> container;
30
31void
32test1()
33{
34  int array[] = { 1 };
35  container con1(array, array);
36  inplace_merge(con1.begin(), con1.end(), con1.end());
37  container con2(array, array + 1);
38  inplace_merge(con2.begin(), con2.end(), con2.end());
39  inplace_merge(con2.begin(), con2.begin(), con2.end());
40}
41
42void
43test2()
44{
45  bool test __attribute__((unused)) = true;
46
47  int array[] = { 0, 2, 4, 1, 3, 5 };
48  container con(array, array + 6);
49  inplace_merge(con.begin(), con.it(3), con.end());
50  VERIFY( array[0] == 0 && array[1] == 1 && array[2] == 2
51	  && array[3] == 3 && array[4] == 4 && array[5] == 5 );
52}
53
54struct S
55{
56  int a;
57  int b;
58  S(int _a, int _b) : a(_a), b(_b) { }
59  S() { }
60  bool
61  operator<(const S& _s) const
62  { return a < _s.a; }
63};
64
65void
66test3()
67{
68  bool test __attribute__((unused)) = true;
69
70  S s[8];
71  s[0].a = 0;
72  s[1].a = 1;
73  s[2].a = 2;
74  s[3].a = 3;
75  s[4].a = 0;
76  s[5].a = 1;
77  s[6].a = 2;
78  s[7].a = 3;
79
80  s[0].b = 0;
81  s[1].b = 1;
82  s[2].b = 2;
83  s[3].b = 3;
84  s[4].b = 4;
85  s[5].b = 5;
86  s[6].b = 6;
87  s[7].b = 7;
88
89  inplace_merge(s, s + 4, s + 8);
90  VERIFY( s[0].b == 0 && s[1].b == 4 && s[2].b == 1 && s[3].b == 5 );
91}
92
93int
94main()
95{
96  test1();
97  test2();
98  test3();
99
100  __gnu_test::set_new_limit(sizeof(S) * 4);
101  test3();
102
103  __gnu_test::set_new_limit(sizeof(S));
104  test3();
105
106  __gnu_test::set_new_limit(0);
107  test3();
108
109  return 0;
110}
111