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
24using __gnu_test::test_container;
25using __gnu_test::input_iterator_wrapper;
26using __gnu_test::output_iterator_wrapper;
27using std::merge;
28
29typedef test_container<int, input_iterator_wrapper> Icontainer;
30typedef test_container<int, output_iterator_wrapper> Ocontainer;
31
32void
33test1()
34{
35  int array1[1], array2[1];
36  Icontainer con1(array1, array1);
37  Icontainer con2(array1, array1);
38  Ocontainer con3(array2, array2);
39  VERIFY(merge(con1.begin(), con1.end(), con2.begin(), con2.end(),
40	       con3.begin()).ptr == array2);
41}
42
43void
44test2()
45{
46  int array1[]={0,1,4};
47  int array2[]={2,3};
48  int array3[5];
49  Icontainer con1(array1, array1 + 3);
50  Icontainer con2(array2, array2 + 2);
51  Ocontainer con3(array3, array3 + 5);
52  VERIFY(merge(con1.begin(), con1.end(), con2.begin(), con2.end(),
53	       con3.begin()).ptr == array3 + 5);
54  VERIFY(array3[0] == 0 && array3[1] == 1 && array3[2] == 2 &&
55	 array3[3] == 3 && array3[4] == 4);
56
57}
58
59struct S
60{
61  int i;
62  int j;
63  S() {}
64  S(int in)
65  {
66    if(in > 0)
67    {
68      i = in;
69      j = 1;
70    }
71    else
72    {
73      i = -in;
74      j = 0;
75    }
76  }
77};
78
79bool
80operator<(const S& s1, const S& s2)
81{ return s1.i < s2.i; }
82
83void
84test3()
85{
86  S array1[] = { -1 , -3};
87  S array2[] = { 1, 2, 3};
88  S array3[5];
89  merge(array1, array1 + 2, array2, array2 + 3, array3);
90  VERIFY(array3[0].j == 0 && array3[1].j == 1 && array3[2].j == 1 &&
91         array3[3].j == 0 && array3[4].j == 1);
92}
93
94int
95main()
96{
97  test1();
98  test2();
99  test3();
100}
101