OpenCores
URL https://opencores.org/ocsvn/scarts/scarts/trunk

Subversion Repositories scarts

[/] [scarts/] [trunk/] [toolchain/] [scarts-gcc/] [gcc-4.1.1/] [libstdc++-v3/] [testsuite/] [25_algorithms/] [stable_sort/] [1.cc] - Blame information for rev 19

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 19 jlechner
// Copyright (C) 2005 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 2, 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 COPYING.  If not, write to the Free
16
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
17
// USA.
18
 
19
// 25.3.1.2 [lib.stable.sort]
20
 
21
#include <algorithm>
22
#include <testsuite_hooks.h>
23
#include <testsuite_iterators.h>
24
 
25
using __gnu_test::test_container;
26
using __gnu_test::random_access_iterator_wrapper;
27
using std::stable_sort;
28
 
29
typedef test_container<int, random_access_iterator_wrapper> Container;
30
 
31
void
32
test1()
33
{
34
  int array[]={0};
35
  Container con(array, array);
36
  stable_sort(con.begin(), con.end());
37
}
38
 
39
void
40
test2()
41
{
42
  int array[] = {6, 5, 4, 3, 2, 1, 0};
43
  Container con(array, array + 7);
44
  stable_sort(con.begin(), con.end());
45
  VERIFY(array[0] == 0 && array[1] == 1 && array[2] == 2 &&
46
         array[3] == 3 && array[4] == 4 && array[5] == 5 &&
47
         array[6] == 6);
48
}
49
struct S
50
{
51
  int i;
52
  int j;
53
  S() {}
54
  S(int in)
55
  {
56
    if(in > 0)
57
    {
58
      i = in;
59
      j = 1;
60
    }
61
    else
62
    {
63
      i = -in;
64
      j = 0;
65
    }
66
  }
67
};
68
 
69
bool
70
operator<(const S& s1, const S& s2)
71
{ return s1.i < s2.i; }
72
 
73
void
74
test3()
75
{
76
 
77
  S array[] = {-1, -2, 1, 2, -3 ,-5 ,3 , -4, 5, 4};
78
  test_container<S, random_access_iterator_wrapper> con(array,array + 10);
79
  stable_sort(con.begin(), con.end());
80
  for(int i = 0; i < 10; ++i)
81
    VERIFY(array[i].j == i % 2);
82
}
83
 
84
int
85
main()
86
{
87
  test1();
88
  test2();
89
  test3();
90
}

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.