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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/testcore/lib/stl_functional.H $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2014,2018 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or */
/* implied. See the License for the specific language governing */
/* permissions and limitations under the License. */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __LIB_STL_FUNCTIONAL_H
#define __LIB_STL_FUNCTIONAL_H
#include <cxxtest/TestSuite.H>
#include <functional>
#include <vector>
#include <list>
#include <initializer_list>
static bool STLFunctionalTest__matches1(int i)
{
return i == 1;
}
static bool STLFunctionalTest__matches(int n, int m)
{
return n == m;
}
class STLFunctionalTest : public CxxTest::TestSuite
{
public:
void test_UnaryPtrFun()
{
using std::ptr_fun;
if (!ptr_fun(&STLFunctionalTest__matches1)(1))
{
TS_FAIL("__matches1(1) is false.");
}
if (ptr_fun(&STLFunctionalTest__matches1)(100))
{
TS_FAIL("__matches1(100) is true.");
}
}
void test_BinaryPtrFun()
{
using std::ptr_fun;
using std::vector;
vector<int> v;
for(int i = 0; i < 10; i++)
{
v.push_back(i);
}
for(int i = 0; i < 10; i++)
{
if (*find_if(v.begin(), v.end(),
bind1st(ptr_fun(&STLFunctionalTest__matches), i)) != i)
{
TS_FAIL("find_if with bind1st of %d doesn't match.", i);
}
if (*find_if(v.begin(), v.end(),
bind2nd(ptr_fun(&STLFunctionalTest__matches), i)) != i)
{
TS_FAIL("find_if with bind2nd of %d doesn't match.", i);
}
}
}
void test_InitializerListVectorFun()
{
using std::vector;
vector<uint32_t> v {0,1,2,3,4};
uint32_t VEC_SIZE = 5;
TS_TRACE("max size of vector v is %d",v.max_size());
TS_TRACE("BEGIN: size of vector v is %d",v.size());
if(v.size() != VEC_SIZE)
{
TS_FAIL("Size not equal to expected value expected:%d "
"actual:%d!",
VEC_SIZE,v.size());
}
for(uint32_t i=0;i<VEC_SIZE;i++)
{
if (v[i] != i)
{
TS_FAIL("Vector array index %d is not equal to %d, "
"it is %d",
i,i,v[i]);
}
}
// Pop a couple off
v.pop_back();
v.pop_back();
if(v.size() != (VEC_SIZE-2))
{
TS_FAIL("pop_back did not reduce size as expected!");
}
// Add some back
v.push_back(100);
v.push_back(99);
if(v.size() != VEC_SIZE)
{
TS_FAIL("Size not equal to expected value expected:%d "
"actual:%d after pop and push!",
VEC_SIZE,v.size());
}
TS_TRACE("END: size of vector v is %d",v.size());
}
void test_InitializerListFun()
{
using std::list;
std::list<uint32_t> l = {0,1,2,3,4};
uint32_t LIST_SIZE = 5;
if(l.size() != LIST_SIZE)
{
TS_FAIL("Size not equal to expected value expected:%d "
"actual:%d!",
LIST_SIZE,l.size());
}
for(uint32_t i=0;i<LIST_SIZE;i++)
{
if (l.front() != i)
{
TS_FAIL("Index %d is not equal to %d, "
"it is %d",
i,i,l.front());
}
l.pop_front();
}
if(l.size() != 0)
{
TS_FAIL("List size not equal to 0 like it should be! %d",
l.size());
}
}
void test_lessFun()
{
TS_ASSERT( std::less<uint32_t>()(1,2) );
TS_ASSERT( std::less<uint16_t>()(5,20) );
TS_ASSERT( !std::less<uint8_t>()(100,2) );
TS_ASSERT( !std::less<int>()(-40,-40) );
TS_ASSERT( !std::less<int32_t>()(-40,-30) );
}
void test_lessEqualFun()
{
TS_ASSERT( std::less_equal<int>()(-40,-40) );
TS_ASSERT( std::less_equal<uint8_t>()(4,4) );
TS_ASSERT( std::less_equal<uint8_t>()(4,200) );
TS_ASSERT( std::less_equal<uint32_t>()(5,20) );
TS_ASSERT( !std::less_equal<uint16_t>()(300,50) );
}
void test_greaterFun()
{
TS_ASSERT( !std::greater<int>()(-40,-40) );
TS_ASSERT( !std::greater<uint8_t>()(4,4) );
TS_ASSERT( !std::greater<uint8_t>()(4,200) );
TS_ASSERT( !std::greater<uint32_t>()(5,20) );
TS_ASSERT( std::greater<int64_t>()(-5,-20) );
TS_ASSERT( std::greater<uint16_t>()(300,50) );
}
void test_greaterEqualFun()
{
TS_ASSERT( std::greater_equal<int>()(-40,-40) );
TS_ASSERT( std::greater_equal<uint8_t>()(4,4) );
TS_ASSERT( !std::greater_equal<uint8_t>()(4,200) );
TS_ASSERT( !std::greater_equal<uint32_t>()(5,20) );
TS_ASSERT( std::greater_equal<int64_t>()(-5,-20) );
TS_ASSERT( std::greater_equal<uint16_t>()(300,50) );
}
void test_equalTolFun()
{
TS_ASSERT( std::equal_to<int>()(-40,-40) );
TS_ASSERT( std::equal_to<uint8_t>()(4,4) );
TS_ASSERT( !std::equal_to<uint8_t>()(4,200) );
TS_ASSERT( !std::equal_to<uint32_t>()(5,20) );
TS_ASSERT( !std::equal_to<int64_t>()(-5,-20) );
TS_ASSERT( !std::equal_to<uint16_t>()(300,50) );
}
void test_NotEqualTolFun()
{
TS_ASSERT( std::not_equal_to<int>()(-40,-40) );
TS_ASSERT( std::not_equal_to<uint8_t>()(4,4) );
TS_ASSERT( !std::not_equal_to<uint8_t>()(4,200) );
TS_ASSERT( !std::not_equal_to<uint32_t>()(5,20) );
TS_ASSERT( !std::not_equal_to<int64_t>()(-5,-20) );
TS_ASSERT( !std::not_equal_to<uint16_t>()(300,50) );
}
};
#endif
|
