aboutsummaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite/25_algorithms/partial_sort_copy/1.cc
blob: 0b7263d3e3029e3c46a9fba86b7a562293a2f5b1 (plain)
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
// Copyright (C) 2005 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING.  If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.

// 25.3.1.4 [lib.partial.sort.copy]

#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>

using __gnu_test::test_container;
using __gnu_test::random_access_iterator_wrapper;
using __gnu_test::input_iterator_wrapper;
using std::partial_sort_copy;

typedef test_container<int, random_access_iterator_wrapper> Rcontainer;
typedef test_container<int, input_iterator_wrapper> Icontainer;

void 
test1()
{
  int array[]={2,1,0};
  Rcontainer rcon1(array, array);
  Rcontainer rcon2(array, array + 2);
  Icontainer icon1(array, array);
  Icontainer icon2(array, array + 2);
  partial_sort_copy(icon1.begin(), icon1.end(), rcon1.begin(), rcon1.end());
  partial_sort_copy(icon1.begin(), icon1.end(), rcon2.begin(), rcon2.end());
  partial_sort_copy(icon2.begin(), icon2.end(), rcon1.begin(), rcon1.end());
  partial_sort_copy(icon2.begin(), icon2.end(), rcon2.begin(), rcon2.end()); 
}

void 
test2()
{
  int array1[] = {4, 3, 2, 1, 0};
  int array2[5];
  Icontainer icon(array1, array1 + 5);
  Rcontainer rcon(array2, array2 + 5);
  partial_sort_copy(icon.begin(), icon.end(), rcon.begin(), rcon.end());
  VERIFY(array2[0] == 0 && array2[1] == 1 && array2[2] == 2 &&
	 array2[3] == 3 && array2[4] == 4);
}

void 
test3()
{
  int array1[] = {4, 0, 1, 3, 2};
  int array2[5];
  Icontainer icon(array1, array1 + 5);
  Rcontainer rcon(array2, array2 + 2);
  partial_sort_copy(icon.begin(), icon.end(), rcon.begin(), rcon.end());
  VERIFY(array2[0] == 0 && array2[1] == 1);
}

void 
test4()
{
  int array1[] = {4, 1, 3, 2, 0};
  int array2[20];
  Icontainer icon(array1, array1 + 5);
  Rcontainer rcon(array2, array2 + 20);
  partial_sort_copy(icon.begin(), icon.end(), rcon.begin(), rcon.end());
  VERIFY(array2[0] == 0 && array2[1] == 1 && array2[2] == 2 &&
	 array2[3] == 3 && array2[4] == 4);
}

int 
main()
{
  test1();
  test2();
  test3();
  test4();
}