|
31
|
1 |
/*
|
|
|
2 |
* Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
|
3 |
* All rights reserved.
|
|
|
4 |
* This component and the accompanying materials are made available
|
|
|
5 |
* under the terms of "Eclipse Public License v1.0"
|
|
|
6 |
* which accompanies this distribution, and is available
|
|
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
|
8 |
*
|
|
|
9 |
* Initial Contributors:
|
|
|
10 |
* Nokia Corporation - initial contribution.
|
|
|
11 |
*
|
|
|
12 |
* Contributors:
|
|
|
13 |
*
|
|
|
14 |
* Description:
|
|
|
15 |
*
|
|
|
16 |
*/
|
|
|
17 |
|
|
|
18 |
// STLport regression testsuite component.
|
|
|
19 |
// To compile as a separate example, please #define MAIN.
|
|
|
20 |
|
|
|
21 |
#include <vector>
|
|
|
22 |
#include <algorithm>
|
|
|
23 |
#include <cstdlib>
|
|
|
24 |
#include <iostream>
|
|
|
25 |
#include <iterator>
|
|
|
26 |
|
|
|
27 |
#ifdef MAIN
|
|
|
28 |
#define parsrt1_test main
|
|
|
29 |
#endif
|
|
|
30 |
|
|
|
31 |
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
|
|
|
32 |
using namespace std;
|
|
|
33 |
#endif
|
|
|
34 |
int parsrt1_test(int, char**)
|
|
|
35 |
{
|
|
|
36 |
|
|
|
37 |
int failures=0;
|
|
|
38 |
cout<<"Results of parsrt1_test:"<<endl;
|
|
|
39 |
vector <int> v1(10);
|
|
|
40 |
//for(int i = 0; i < v1.size(); i++)
|
|
|
41 |
//v1[i] = i;
|
|
|
42 |
int arr[]={1,4,5,2,6,7,0,9,8,3};
|
|
|
43 |
|
|
|
44 |
for(int i=0;i<v1.size();i++)
|
|
|
45 |
v1[i]=arr[i];
|
|
|
46 |
|
|
|
47 |
ostream_iterator<int> iter(cout, " ");
|
|
|
48 |
copy(v1.begin(), v1.end(), iter);
|
|
|
49 |
cout << endl;
|
|
|
50 |
|
|
|
51 |
if(1!=v1[0])
|
|
|
52 |
failures++;
|
|
|
53 |
else if( 4 !=v1[1])
|
|
|
54 |
failures++;
|
|
|
55 |
else if( 5 !=v1[2])
|
|
|
56 |
failures++;
|
|
|
57 |
else if( 2 !=v1[3])
|
|
|
58 |
failures++;
|
|
|
59 |
else if( 6 !=v1[4])
|
|
|
60 |
failures++;
|
|
|
61 |
else if( 7 !=v1[5])
|
|
|
62 |
failures++;
|
|
|
63 |
else if( 0 !=v1[6])
|
|
|
64 |
failures++;
|
|
|
65 |
else if( 9 !=v1[7])
|
|
|
66 |
failures++;
|
|
|
67 |
else if( 8 !=v1[8])
|
|
|
68 |
failures++;
|
|
|
69 |
else if( 3 !=v1[9])
|
|
|
70 |
failures++;
|
|
|
71 |
|
|
|
72 |
partial_sort(v1.begin(),
|
|
|
73 |
v1.begin() + v1.size() / 2,
|
|
|
74 |
v1.end());
|
|
|
75 |
copy(v1.begin(), v1.end(), iter);
|
|
|
76 |
|
|
|
77 |
cout << endl;
|
|
|
78 |
|
|
|
79 |
if(0!=v1[0])
|
|
|
80 |
failures++;
|
|
|
81 |
else if( 1 !=v1[1])
|
|
|
82 |
failures++;
|
|
|
83 |
else if( 2 !=v1[2])
|
|
|
84 |
failures++;
|
|
|
85 |
else if( 3 !=v1[3])
|
|
|
86 |
failures++;
|
|
|
87 |
else if( 4 !=v1[4])
|
|
|
88 |
failures++;
|
|
|
89 |
else if( 7 !=v1[5])
|
|
|
90 |
failures++;
|
|
|
91 |
else if( 6 !=v1[6])
|
|
|
92 |
failures++;
|
|
|
93 |
else if( 9 !=v1[7])
|
|
|
94 |
failures++;
|
|
|
95 |
else if( 8 !=v1[8])
|
|
|
96 |
failures++;
|
|
|
97 |
else if( 5 !=v1[9])
|
|
|
98 |
failures++;
|
|
|
99 |
|
|
|
100 |
if(failures)
|
|
|
101 |
return 1;
|
|
|
102 |
else
|
|
|
103 |
return 0;
|
|
|
104 |
}
|