ReactOS 0.4.15-dev-8102-g108db8f
AlgTest Class Reference
Inheritance diagram for AlgTest:
Collaboration diagram for AlgTest:

Protected Member Functions

void min_max ()
 
void count_test ()
 
void sort_test ()
 
void search_n_test ()
 
void find_first_of_test ()
 
void find_first_of_nsc_test ()
 

Private Member Functions

 CPPUNIT_TEST_SUITE (AlgTest)
 
 CPPUNIT_TEST (min_max)
 
 CPPUNIT_TEST (count_test)
 
 CPPUNIT_TEST (sort_test)
 
 CPPUNIT_TEST (search_n_test)
 
 CPPUNIT_TEST (find_first_of_test)
 
 CPPUNIT_TEST (find_first_of_nsc_test)
 
 CPPUNIT_TEST_SUITE_END ()
 

Detailed Description

Definition at line 21 of file alg_test.cpp.

Member Function Documentation

◆ count_test()

void AlgTest::count_test ( )
protected

Definition at line 61 of file alg_test.cpp.

62{
63 {
64 int i[] = { 1, 4, 2, 8, 2, 2 };
65 int n = count(i, i + 6, 2);
66 CPPUNIT_ASSERT(n==3);
67#if defined (STLPORT) && !defined (_STLP_NO_ANACHRONISMS)
68 n = 0;
69 count(i, i + 6, 2, n);
70 CPPUNIT_ASSERT(n==3);
71#endif
72 }
73 {
75 i.push_back(1);
76 i.push_back(4);
77 i.push_back(2);
78 i.push_back(8);
79 i.push_back(2);
80 i.push_back(2);
81 int n = count(i.begin(), i.end(), 2);
82 CPPUNIT_ASSERT(n==3);
83#if defined (STLPORT) && !defined (_STLP_NO_ANACHRONISMS)
84 n = 0;
85 count(i.begin(), i.end(), 2, n);
86 CPPUNIT_ASSERT(n==3);
87#endif
88 }
89}
#define CPPUNIT_ASSERT(X)
Definition: cppunit_mini.h:200
GLuint GLuint GLsizei count
Definition: gl.h:1545
GLdouble n
Definition: glext.h:7729
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint i
Definition: glfuncs.h:248

◆ CPPUNIT_TEST() [1/6]

AlgTest::CPPUNIT_TEST ( count_test  )
private

◆ CPPUNIT_TEST() [2/6]

AlgTest::CPPUNIT_TEST ( find_first_of_nsc_test  )
private

◆ CPPUNIT_TEST() [3/6]

AlgTest::CPPUNIT_TEST ( find_first_of_test  )
private

◆ CPPUNIT_TEST() [4/6]

AlgTest::CPPUNIT_TEST ( min_max  )
private

◆ CPPUNIT_TEST() [5/6]

AlgTest::CPPUNIT_TEST ( search_n_test  )
private

◆ CPPUNIT_TEST() [6/6]

AlgTest::CPPUNIT_TEST ( sort_test  )
private

◆ CPPUNIT_TEST_SUITE()

AlgTest::CPPUNIT_TEST_SUITE ( AlgTest  )
private

◆ CPPUNIT_TEST_SUITE_END()

AlgTest::CPPUNIT_TEST_SUITE_END ( )
private

◆ find_first_of_nsc_test()

void AlgTest::find_first_of_nsc_test ( )
protected

Definition at line 344 of file alg_test.cpp.

345{
346 // Non-symmetrical comparator
347
350
351 m[1] = "one";
352 m[4] = "four";
353 m[10] = "ten";
354 m[20] = "twenty";
355
356 values.push_back( "four" );
357 values.push_back( "ten" );
358
359 map<int, string>::iterator i = find_first_of(m.begin(), m.end(), values.begin(), values.end(), ValueFinder());
360
361 CPPUNIT_ASSERT( i != m.end() );
362 CPPUNIT_ASSERT( i->first == 4 || i->first == 10 );
363 CPPUNIT_ASSERT( i->second == "four" || i->second == "ten" );
364}
_InputIter find_first_of(_InputIter __first1, _InputIter __last1, _ForwardIter __first2, _ForwardIter __last2)
Definition: _algo.h:136
Definition: _map.h:48
_Rep_type::iterator iterator
Definition: _map.h:85
GLboolean GLenum GLenum GLvoid * values
Definition: glext.h:5666
const GLfloat * m
Definition: glext.h:10848

◆ find_first_of_test()

void AlgTest::find_first_of_test ( )
protected

Definition at line 215 of file alg_test.cpp.

216{
217#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
218 slist<int> intsl;
219 intsl.push_front(1);
220 intsl.push_front(2);
221
222 {
223 vector<int> intv;
224 intv.push_back(0);
225 intv.push_back(1);
226 intv.push_back(2);
227 intv.push_back(3);
228
230 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end());
231 CPPUNIT_ASSERT( first != intv.end() );
232 CPPUNIT_ASSERT( *first == 1 );
233 }
234 {
235 vector<int> intv;
236 intv.push_back(3);
237 intv.push_back(2);
238 intv.push_back(1);
239 intv.push_back(0);
240
242 first = find_first_of(intv.begin(), intv.end(), intsl.begin(), intsl.end());
243 CPPUNIT_ASSERT( first != intv.end() );
244 CPPUNIT_ASSERT( *first == 2 );
245 }
246#endif
247
248 list<int> intl;
249 intl.push_front(1);
250 intl.push_front(2);
251
252 {
253 vector<int> intv;
254 intv.push_back(0);
255 intv.push_back(1);
256 intv.push_back(2);
257 intv.push_back(3);
258
260 first = find_first_of(intv.begin(), intv.end(), intl.begin(), intl.end());
261 CPPUNIT_ASSERT( first != intv.end() );
262 CPPUNIT_ASSERT( *first == 1 );
263 }
264 {
265 vector<int> intv;
266 intv.push_back(3);
267 intv.push_back(2);
268 intv.push_back(1);
269 intv.push_back(0);
270
272 first = find_first_of(intv.begin(), intv.end(), intl.begin(), intl.end());
273 CPPUNIT_ASSERT( first != intv.end() );
274 CPPUNIT_ASSERT( *first == 2 );
275 }
276 {
277 char chars[] = {1, 2};
278
279 vector<int> intv;
280 intv.push_back(0);
281 intv.push_back(1);
282 intv.push_back(2);
283 intv.push_back(3);
284
286 first = find_first_of(intv.begin(), intv.end(), chars, chars + sizeof(chars));
287 CPPUNIT_ASSERT( first != intv.end() );
288 CPPUNIT_ASSERT( *first == 1 );
289 }
290 {
291 unsigned char chars[] = {1, 2, 255};
292
293 vector<int> intv;
294 intv.push_back(-10);
295 intv.push_back(1029);
296 intv.push_back(255);
297 intv.push_back(4);
298
300 first = find_first_of(intv.begin(), intv.end(), chars, chars + sizeof(chars));
301 CPPUNIT_ASSERT( first != intv.end() );
302 CPPUNIT_ASSERT( *first == 255 );
303 }
304 {
305 signed char chars[] = {93, 2, -101, 13};
306
307 vector<int> intv;
308 intv.push_back(-10);
309 intv.push_back(1029);
310 intv.push_back(-2035);
311 intv.push_back(-101);
312 intv.push_back(4);
313
315 first = find_first_of(intv.begin(), intv.end(), chars, chars + sizeof(chars));
316 CPPUNIT_ASSERT( first != intv.end() );
317 CPPUNIT_ASSERT( *first == -101 );
318 }
319 {
320 char chars[] = {1, 2};
321
323 intv.push_back(0);
324 intv.push_back(1);
325 intv.push_back(2);
326 intv.push_back(3);
327
329 first = find_first_of(intv.begin(), intv.end(), chars, chars + sizeof(chars));
330 CPPUNIT_ASSERT( first != intv.end() );
331 CPPUNIT_ASSERT( *first == 1 );
332 }
333}
Definition: list.h:37
iterator begin()
Definition: _list.h:367
iterator end()
Definition: _list.h:370
void push_front(const_reference __x)
Definition: _list.h:508
Definition: _slist.h:57
iterator end()
Definition: _slist.h:420
void push_front(const value_type &__x=_Tp())
Definition: _slist.h:440
iterator begin()
Definition: _slist.h:416
const GLint * first
Definition: glext.h:5794
iterator end()
Definition: _vector.h:184
void push_back(const _Tp &__x=_STLP_DEFAULT_CONSTRUCTED(_Tp))
Definition: _vector.h:379
iterator begin()
Definition: _vector.h:182
value_type * iterator
Definition: _vector.h:124

◆ min_max()

void AlgTest::min_max ( )
protected

Definition at line 46 of file alg_test.cpp.

47{
48 int i = min(4, 7);
49 CPPUNIT_ASSERT( i == 4 );
50 char c = max('a', 'z');
51 CPPUNIT_ASSERT( c == 'z' );
52
53#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
54 c = min('a', 'z', greater<char>());
55 CPPUNIT_ASSERT( c == 'z' );
56 i = max(4, 7, greater<int>());
57 CPPUNIT_ASSERT( i == 4 );
58#endif
59}
const GLubyte * c
Definition: glext.h:8905
#define min(a, b)
Definition: monoChain.cc:55
#define max(a, b)
Definition: svc.c:63

◆ search_n_test()

void AlgTest::search_n_test ( )
protected

Definition at line 121 of file alg_test.cpp.

122{
123 int ints[] = {0, 1, 2, 3, 3, 4, 4, 4, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5};
124
125#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
126 //search_n
127 //Forward iterator
128 {
130 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 2);
131 CPPUNIT_ASSERT( slit != slint.end() );
132 CPPUNIT_ASSERT( *(slit++) == 2 );
133 CPPUNIT_ASSERT( *slit == 2 );
134 }
135#endif
136
137 //Bidirectionnal iterator
138 {
140 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 3);
141 CPPUNIT_ASSERT( lit != lint.end() );
142 CPPUNIT_ASSERT( *(lit++) == 3 );
143 CPPUNIT_ASSERT( *(lit++) == 3 );
144 CPPUNIT_ASSERT( *lit == 3 );
145 }
146
147 //Random access iterator
148 {
150 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 4);
151 CPPUNIT_ASSERT( dit != dint.end() );
152 CPPUNIT_ASSERT( *(dit++) == 4 );
153 CPPUNIT_ASSERT( *(dit++) == 4 );
154 CPPUNIT_ASSERT( *(dit++) == 4 );
155 CPPUNIT_ASSERT( *dit == 4 );
156 }
157
158#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
159 //search_n with predicate
160 //Forward iterator
161 {
163 slist<int>::iterator slit = search_n(slint.begin(), slint.end(), 2, 1, greater<int>());
164 CPPUNIT_ASSERT( slit != slint.end() );
165 CPPUNIT_ASSERT( *(slit++) > 1 );
166 CPPUNIT_ASSERT( *slit > 2 );
167 }
168#endif
169
170 //Bidirectionnal iterator
171 {
173 list<int>::iterator lit = search_n(lint.begin(), lint.end(), 3, 2, greater<int>());
174 CPPUNIT_ASSERT( lit != lint.end() );
175 CPPUNIT_ASSERT( *(lit++) > 2 );
176 CPPUNIT_ASSERT( *(lit++) > 2 );
177 CPPUNIT_ASSERT( *lit > 2 );
178 }
179
180 //Random access iterator
181 {
183 deque<int>::iterator dit = search_n(dint.begin(), dint.end(), 4, 3, greater<int>());
184 CPPUNIT_ASSERT( dit != dint.end() );
185 CPPUNIT_ASSERT( *(dit++) > 3 );
186 CPPUNIT_ASSERT( *(dit++) > 3 );
187 CPPUNIT_ASSERT( *(dit++) > 3 );
188 CPPUNIT_ASSERT( *dit > 3 );
189 }
190
191 // test for bug reported by Jim Xochellis
192 {
193 int array[] = {0, 0, 1, 0, 1, 1};
194 int* array_end = array + sizeof(array) / sizeof(*array);
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end);
196 }
197
198 // test for bug with counter == 1, reported by Timmie Smith
199 {
200 int array[] = {0, 1, 2, 3, 4, 5};
201 int* array_end = array + sizeof(array) / sizeof(*array);
202 CPPUNIT_ASSERT( search_n(array, array_end, 1, 1, equal_to<int>() ) == &array[1] );
203 }
204}
_STLP_MOVE_TO_STD_NAMESPACE _ForwardIter search_n(_ForwardIter __first, _ForwardIter __last, _Integer __count, const _Tp &__val)
Definition: _algo.c:246
#define ARRAY_SIZE(arr)
Definition: alg_test.cpp:119
#define lint
Definition: hash.c:43
Definition: _deque.h:404
_Base::iterator iterator
Definition: _deque.h:420
_STLP_PRIV _List_iterator< _Tp, _Nonconst_traits< _Tp > > iterator
Definition: _list.h:275
_STLP_PRIV _Slist_iterator< _Tp, _Nonconst_traits< _Tp > > iterator
Definition: _slist.h:239
static const struct encodedInt ints[]
Definition: encode.c:48

◆ sort_test()

void AlgTest::sort_test ( )
protected

Definition at line 91 of file alg_test.cpp.

92{
93 {
94 vector<int> years;
95 years.push_back(1962);
96 years.push_back(1992);
97 years.push_back(2001);
98 years.push_back(1999);
99 sort(years.begin(), years.end());
100 CPPUNIT_ASSERT(years[0]==1962);
101 CPPUNIT_ASSERT(years[1]==1992);
102 CPPUNIT_ASSERT(years[2]==1999);
103 CPPUNIT_ASSERT(years[3]==2001);
104 }
105 {
106 deque<int> years;
107 years.push_back(1962);
108 years.push_back(1992);
109 years.push_back(2001);
110 years.push_back(1999);
111 sort(years.begin(), years.end()); // <-- changed!
112 CPPUNIT_ASSERT(years[0]==1962);
113 CPPUNIT_ASSERT(years[1]==1992);
114 CPPUNIT_ASSERT(years[2]==1999);
115 CPPUNIT_ASSERT(years[3]==2001);
116 }
117}
_STLP_MOVE_TO_STD_NAMESPACE void sort(_RandomAccessIter __first, _RandomAccessIter __last)
Definition: _algo.c:993
iterator end()
Definition: _deque.h:433
void push_back(const value_type &__t=_STLP_DEFAULT_CONSTRUCTED(_Tp))
Definition: _deque.h:668
iterator begin()
Definition: _deque.h:432

The documentation for this class was generated from the following file: