|
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 #include <vector> |
|
18 #include <algorithm> |
|
19 #include <functional> |
|
20 #include "cppunit/cppunit_proxy.h" |
|
21 |
|
22 #if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES) |
|
23 using namespace std; |
|
24 #endif |
|
25 |
|
26 // |
|
27 // TestCase class |
|
28 // |
|
29 class EqualTest : public CPPUNIT_NS::TestCase |
|
30 { |
|
31 CPPUNIT_TEST_SUITE(EqualTest); |
|
32 CPPUNIT_TEST(equal_range0); |
|
33 CPPUNIT_TEST(equal_range1); |
|
34 CPPUNIT_TEST(equal_range2); |
|
35 CPPUNIT_TEST(equal0); |
|
36 CPPUNIT_TEST(equal1); |
|
37 CPPUNIT_TEST(equal2); |
|
38 CPPUNIT_TEST(equalto); |
|
39 CPPUNIT_TEST_SUITE_END(); |
|
40 |
|
41 protected: |
|
42 void equal_range0(); |
|
43 void equal_range1(); |
|
44 void equal_range2(); |
|
45 void equal0(); |
|
46 void equal1(); |
|
47 void equal2(); |
|
48 void equalto(); |
|
49 static bool values_squared(int a_, int b_); |
|
50 }; |
|
51 |
|
52 CPPUNIT_TEST_SUITE_REGISTRATION(EqualTest); |
|
53 |
|
54 // |
|
55 // tests implementation |
|
56 // |
|
57 void EqualTest::equal_range0() |
|
58 { |
|
59 int numbers[10] = { 0, 0, 1, 1, 2, 2, 2, 2, 3, 3 }; |
|
60 pair<int*, int*> range = equal_range((int*)numbers, (int*)numbers + 10, 2); |
|
61 CPPUNIT_ASSERT( (range.first - numbers) == 4 ); |
|
62 CPPUNIT_ASSERT( (range.second - numbers) == 8 ); |
|
63 } |
|
64 |
|
65 void EqualTest::equal_range1() |
|
66 { |
|
67 typedef vector <int> IntVec; |
|
68 IntVec v(10); |
|
69 for (int i = 0; (size_t)i < v.size(); ++i) |
|
70 v[i] = i / 3; |
|
71 |
|
72 pair<IntVec::iterator, IntVec::iterator> range = equal_range(v.begin(), v.end(), 2); |
|
73 CPPUNIT_ASSERT( (range.first - v.begin()) == 6 ); |
|
74 CPPUNIT_ASSERT( (range.second - v.begin()) == 9 ); |
|
75 for (; range.first != range.second; ++range.first) |
|
76 CPPUNIT_ASSERT( *range.first == 2 ); |
|
77 |
|
78 range = equal_range(v.begin(), v.end(), 4); |
|
79 CPPUNIT_ASSERT( range.first == range.second ); |
|
80 CPPUNIT_ASSERT( range.first == v.end() ); |
|
81 } |
|
82 |
|
83 struct Test { |
|
84 Test(int val) : value(val) {} |
|
85 int value; |
|
86 |
|
87 bool operator == (int i) const |
|
88 { return value == i; } |
|
89 }; |
|
90 |
|
91 bool operator < (const Test& v1, int v2) |
|
92 { return v1.value < v2; } |
|
93 |
|
94 bool operator < (int v1, const Test& v2) |
|
95 { return v1 < v2.value; } |
|
96 |
|
97 void EqualTest::equal_range2() |
|
98 { |
|
99 char chars[] = "aabbccddggghhklllmqqqqssyyzz"; |
|
100 |
|
101 const unsigned count = sizeof(chars) - 1; |
|
102 pair<char*, char*> range = equal_range((char*)chars, (char*)chars + count, 'q', less<char>()); |
|
103 CPPUNIT_ASSERT( (range.first - chars) == 18 ); |
|
104 CPPUNIT_ASSERT( (range.second - chars) == 22 ); |
|
105 for (; range.first != range.second; ++range.first) |
|
106 CPPUNIT_ASSERT( *range.first == 'q' ); |
|
107 |
|
108 range = equal_range((char*)chars, (char*)chars + count, 'm', less<char>()); |
|
109 CPPUNIT_ASSERT( (range.second - range.first) == 1 ); |
|
110 CPPUNIT_ASSERT( *range.first == 'm' ); |
|
111 |
|
112 vector<Test> tv; |
|
113 vector<Test>::iterator it; |
|
114 pair<vector<Test>::iterator, vector<Test>::iterator> p; |
|
115 |
|
116 for (int i = 0; i < 10; ++i) { |
|
117 tv.push_back(i); |
|
118 } |
|
119 |
|
120 it = upper_bound(tv.begin(), tv.end(), 5); |
|
121 CPPUNIT_ASSERT( it != tv.end() ); |
|
122 CPPUNIT_ASSERT( *it == 6 ); |
|
123 |
|
124 it = lower_bound(tv.begin(), tv.end(), 5); |
|
125 CPPUNIT_ASSERT( it != tv.end() ); |
|
126 CPPUNIT_ASSERT( *it == 5 ); |
|
127 |
|
128 p = equal_range(tv.begin(), tv.end(), 5); |
|
129 CPPUNIT_ASSERT( p.first != p.second ); |
|
130 CPPUNIT_ASSERT( p.first != tv.end() ); |
|
131 CPPUNIT_ASSERT( p.second != tv.end() ); |
|
132 CPPUNIT_ASSERT( *p.first == 5 ); |
|
133 CPPUNIT_ASSERT( *p.second == 6 ); |
|
134 } |
|
135 |
|
136 void EqualTest::equal0() |
|
137 { |
|
138 int numbers1[5] = { 1, 2, 3, 4, 5 }; |
|
139 int numbers2[5] = { 1, 2, 4, 8, 16 }; |
|
140 int numbers3[2] = { 1, 2 }; |
|
141 |
|
142 CPPUNIT_ASSERT( !equal(numbers1, numbers1 + 5, numbers2) ); |
|
143 CPPUNIT_ASSERT( equal(numbers3, numbers3 + 2, numbers1) ); |
|
144 } |
|
145 |
|
146 void EqualTest::equal1() |
|
147 { |
|
148 vector <int> v1(10); |
|
149 for (int i = 0; (size_t)i < v1.size(); ++i) |
|
150 v1[i] = i; |
|
151 vector <int> v2(10); |
|
152 CPPUNIT_ASSERT( !equal(v1.begin(), v1.end(), v2.begin()) ); |
|
153 |
|
154 copy(v1.begin(), v1.end(), v2.begin()); |
|
155 CPPUNIT_ASSERT( equal(v1.begin(), v1.end(), v2.begin()) ) |
|
156 } |
|
157 |
|
158 void EqualTest::equal2() |
|
159 { |
|
160 vector <int> v1(10); |
|
161 vector <int> v2(10); |
|
162 for (int i = 0; (size_t)i < v1.size(); ++i) { |
|
163 v1[i] = i; |
|
164 v2[i] = i * i; |
|
165 } |
|
166 CPPUNIT_ASSERT( equal(v1.begin(), v1.end(), v2.begin(), values_squared) ); |
|
167 } |
|
168 |
|
169 void EqualTest::equalto() |
|
170 { |
|
171 int input1 [4] = { 1, 7, 2, 2 }; |
|
172 int input2 [4] = { 1, 6, 2, 3 }; |
|
173 |
|
174 int output [4]; |
|
175 transform((int*)input1, (int*)input1 + 4, (int*)input2, (int*)output, equal_to<int>()); |
|
176 CPPUNIT_ASSERT( output[0] == 1 ); |
|
177 CPPUNIT_ASSERT( output[1] == 0 ); |
|
178 CPPUNIT_ASSERT( output[2] == 1 ); |
|
179 CPPUNIT_ASSERT( output[3] == 0 ); |
|
180 } |
|
181 |
|
182 bool EqualTest::values_squared(int a_, int b_) |
|
183 { |
|
184 return (a_ * a_ == b_); |
|
185 } |