ReactOS 0.4.15-dev-8145-ga541a46
SlistTest Class Reference
Inheritance diagram for SlistTest:
Collaboration diagram for SlistTest:

Protected Member Functions

void slist1 ()
 
void erase ()
 
void insert ()
 
void splice ()
 
void allocator_with_state ()
 

Private Member Functions

 CPPUNIT_TEST_SUITE (SlistTest)
 
 CPPUNIT_TEST (slist1)
 
 CPPUNIT_TEST (erase)
 
 CPPUNIT_TEST (insert)
 
 CPPUNIT_TEST (splice)
 
 CPPUNIT_TEST (allocator_with_state)
 
 CPPUNIT_TEST_SUITE_END ()
 

Private Attributes

 CPPUNIT_IGNORE
 

Detailed Description

Definition at line 28 of file slist_test.cpp.

Member Function Documentation

◆ allocator_with_state()

void SlistTest::allocator_with_state ( )
protected

Definition at line 330 of file slist_test.cpp.

331{
332#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
333 char buf1[1024];
334 StackAllocator<int> stack1(buf1, buf1 + sizeof(buf1));
335
336 char buf2[1024];
337 StackAllocator<int> stack2(buf2, buf2 + sizeof(buf2));
338
339 typedef slist<int, StackAllocator<int> > SlistInt;
340 {
341 SlistInt slint1(10, 0, stack1);
342 SlistInt slint1Cpy(slint1);
343
344 SlistInt slint2(10, 1, stack2);
345 SlistInt slint2Cpy(slint2);
346
347 slint1.swap(slint2);
348
349 CPPUNIT_ASSERT( slint1.get_allocator().swaped() );
350 CPPUNIT_ASSERT( slint2.get_allocator().swaped() );
351
352 CPPUNIT_ASSERT( slint1 == slint2Cpy );
353 CPPUNIT_ASSERT( slint2 == slint1Cpy );
354 CPPUNIT_ASSERT( slint1.get_allocator() == stack2 );
355 CPPUNIT_ASSERT( slint2.get_allocator() == stack1 );
356 }
357 CPPUNIT_CHECK( stack1.ok() );
358 CPPUNIT_CHECK( stack2.ok() );
359 stack1.reset(); stack2.reset();
360
361 {
362 SlistInt slint1(stack1);
363 SlistInt slint1Cpy(slint1);
364
365 SlistInt slint2(10, 1, stack2);
366 SlistInt slint2Cpy(slint2);
367
368 slint1.swap(slint2);
369
370 CPPUNIT_ASSERT( slint1.get_allocator().swaped() );
371 CPPUNIT_ASSERT( slint2.get_allocator().swaped() );
372
373 CPPUNIT_ASSERT( slint1 == slint2Cpy );
374 CPPUNIT_ASSERT( slint2 == slint1Cpy );
375 CPPUNIT_ASSERT( slint1.get_allocator() == stack2 );
376 CPPUNIT_ASSERT( slint2.get_allocator() == stack1 );
377 }
378 CPPUNIT_CHECK( stack1.ok() );
379 CPPUNIT_CHECK( stack2.ok() );
380 stack1.reset(); stack2.reset();
381
382 {
383 SlistInt slint1(10, 0, stack1);
384 SlistInt slint1Cpy(slint1);
385
386 SlistInt slint2(stack2);
387 SlistInt slint2Cpy(slint2);
388
389 slint1.swap(slint2);
390
391 CPPUNIT_ASSERT( slint1.get_allocator().swaped() );
392 CPPUNIT_ASSERT( slint2.get_allocator().swaped() );
393
394 CPPUNIT_ASSERT( slint1 == slint2Cpy );
395 CPPUNIT_ASSERT( slint2 == slint1Cpy );
396 CPPUNIT_ASSERT( slint1.get_allocator() == stack2 );
397 CPPUNIT_ASSERT( slint2.get_allocator() == stack1 );
398 }
399 CPPUNIT_CHECK( stack1.ok() );
400 CPPUNIT_CHECK( stack2.ok() );
401 stack1.reset(); stack2.reset();
402
403 //splice(iterator, slist)
404 {
405 SlistInt slint1(10, 0, stack1);
406 SlistInt slint2(10, 1, stack2);
407
408 slint1.splice(slint1.begin(), slint2);
409 CPPUNIT_ASSERT( slint1.size() == 20 );
410 CPPUNIT_ASSERT( slint2.empty() );
411 }
412 CPPUNIT_CHECK( stack1.ok() );
413 CPPUNIT_CHECK( stack2.ok() );
414 stack1.reset(); stack2.reset();
415
416 //splice(iterator, slist, iterator)
417 {
418 SlistInt slint1(10, 0, stack1);
419 SlistInt slint2(10, 1, stack2);
420
421 slint1.splice(slint1.begin(), slint2, slint2.begin());
422 CPPUNIT_ASSERT( slint1.size() == 11 );
423 CPPUNIT_ASSERT( slint2.size() == 9 );
424 }
425 CPPUNIT_CHECK( stack1.ok() );
426 CPPUNIT_CHECK( stack2.ok() );
427 stack1.reset(); stack2.reset();
428
429 //splice(iterator, slist, iterator, iterator)
430 {
431 SlistInt slint1(10, 0, stack1);
432 SlistInt slint2(10, 1, stack2);
433
434 SlistInt::iterator lit(slint2.begin());
435 advance(lit, 5);
436 slint1.splice(slint1.begin(), slint2, slint2.begin(), lit);
437 CPPUNIT_ASSERT( slint1.size() == 15 );
438 CPPUNIT_ASSERT( slint2.size() == 5 );
439 }
440 CPPUNIT_CHECK( stack1.ok() );
441 CPPUNIT_CHECK( stack2.ok() );
442 stack1.reset(); stack2.reset();
443
444 //splice_after(iterator, slist)
445 {
446 SlistInt slint1(10, 0, stack1);
447 SlistInt slint2(10, 1, stack2);
448
449 slint1.splice_after(slint1.before_begin(), slint2);
450 CPPUNIT_ASSERT( slint1.size() == 20 );
451 CPPUNIT_ASSERT( slint2.empty() );
452 }
453 CPPUNIT_CHECK( stack1.ok() );
454 CPPUNIT_CHECK( stack2.ok() );
455 stack1.reset(); stack2.reset();
456
457 //splice_after(iterator, slist, iterator)
458 {
459 SlistInt slint1(10, 0, stack1);
460 SlistInt slint2(10, 1, stack2);
461
462 slint1.splice_after(slint1.before_begin(), slint2, slint2.before_begin());
463 CPPUNIT_ASSERT( slint1.size() == 11 );
464 CPPUNIT_ASSERT( slint2.size() == 9 );
465 }
466 CPPUNIT_CHECK( stack1.ok() );
467 CPPUNIT_CHECK( stack2.ok() );
468 stack1.reset(); stack2.reset();
469
470 //splice_after(iterator, slist, iterator, iterator)
471 {
472 SlistInt slint1(10, 0, stack1);
473 SlistInt slint2(10, 1, stack2);
474
475 SlistInt::iterator lit(slint2.begin());
476 advance(lit, 4);
477 slint1.splice_after(slint1.before_begin(), slint2, slint2.before_begin(), lit);
478 CPPUNIT_ASSERT( slint1.size() == 15 );
479 CPPUNIT_ASSERT( slint2.size() == 5 );
480 }
481 CPPUNIT_CHECK( stack1.ok() );
482 CPPUNIT_CHECK( stack2.ok() );
483 stack1.reset(); stack2.reset();
484
485 //merge(slist)
486 {
487 SlistInt slint1(10, 0, stack1);
488 SlistInt slint2(10, 1, stack2);
489
490 SlistInt slintref(stack2);
491 slintref.insert_after(slintref.before_begin(), 10, 1);
492 slintref.insert_after(slintref.before_begin(), 10, 0);
493
494 slint1.merge(slint2);
495 CPPUNIT_ASSERT( slint1.size() == 20 );
496 CPPUNIT_ASSERT( slint1 == slintref );
497 CPPUNIT_ASSERT( slint2.empty() );
498 }
499 CPPUNIT_CHECK( stack1.ok() );
500 CPPUNIT_CHECK( stack2.ok() );
501
502 //merge(slist, predicate)
503# if (!defined (STLPORT) || !defined (_STLP_NO_MEMBER_TEMPLATES)) && \
504 (!defined (_MSC_VER) || (_MSC_VER >= 1300))
505 {
506 SlistInt slint1(10, 0, stack1);
507 SlistInt slint2(10, 1, stack2);
508
509 SlistInt slintref(stack2);
510 slintref.insert_after(slintref.before_begin(), 10, 0);
511 slintref.insert_after(slintref.before_begin(), 10, 1);
512
513 slint1.merge(slint2, greater<int>());
514 CPPUNIT_ASSERT( slint1.size() == 20 );
515 CPPUNIT_ASSERT( slint1 == slintref );
516 CPPUNIT_ASSERT( slint2.empty() );
517 }
518 CPPUNIT_CHECK( stack1.ok() );
519 CPPUNIT_CHECK( stack2.ok() );
520
521 //sort
522 {
523 //This is rather a compile time test.
524 //We check that sort implementation is correct when list is instanciated
525 //with an allocator that do not have a default constructor.
526 SlistInt slint1(stack1);
527 slint1.push_front(1);
528 slint1.insert_after(slint1.before_begin(), 10, 0);
529 greater<int> gt;
530 slint1.sort(gt);
531 CPPUNIT_ASSERT( slint1.front() == 1 );
532 slint1.sort();
533 SlistInt::iterator slit(slint1.begin());
534 advance(slit, 10);
535 CPPUNIT_ASSERT( *slit == 1 );
536 }
537# endif
538#endif
539}
_STLP_MOVE_TO_STD_NAMESPACE void _STLP_CALL advance(_InputIterator &__i, _Distance __n)
Definition: _slist.h:57
#define CPPUNIT_CHECK(X)
Definition: cppunit_mini.h:195
#define CPPUNIT_ASSERT(X)
Definition: cppunit_mini.h:200

◆ CPPUNIT_TEST() [1/5]

SlistTest::CPPUNIT_TEST ( allocator_with_state  )
private

◆ CPPUNIT_TEST() [2/5]

SlistTest::CPPUNIT_TEST ( erase  )
private

◆ CPPUNIT_TEST() [3/5]

SlistTest::CPPUNIT_TEST ( insert  )
private

◆ CPPUNIT_TEST() [4/5]

SlistTest::CPPUNIT_TEST ( slist1  )
private

◆ CPPUNIT_TEST() [5/5]

SlistTest::CPPUNIT_TEST ( splice  )
private

◆ CPPUNIT_TEST_SUITE()

SlistTest::CPPUNIT_TEST_SUITE ( SlistTest  )
private

◆ CPPUNIT_TEST_SUITE_END()

SlistTest::CPPUNIT_TEST_SUITE_END ( )
private

◆ erase()

void SlistTest::erase ( )
protected

Definition at line 123 of file slist_test.cpp.

124{
125#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
126 int array[] = { 0, 1, 2, 3, 4 };
127 slist<int> sl(array, array + 5);
129
130 slit = sl.erase(sl.begin());
131 CPPUNIT_ASSERT( *slit == 1);
132
133 ++slit++; ++slit;
134 slit = sl.erase(sl.begin(), slit);
135 CPPUNIT_ASSERT( *slit == 3 );
136
137 sl.assign(array, array + 5);
138
139 slit = sl.erase_after(sl.begin());
140 CPPUNIT_ASSERT( *slit == 2 );
141
142 slit = sl.begin(); ++slit; ++slit;
143 slit = sl.erase_after(sl.begin(), slit);
144 CPPUNIT_ASSERT( *slit == 3 );
145
146 sl.erase_after(sl.before_begin());
147 CPPUNIT_ASSERT( sl.front() == 3 );
148#endif
149}
_STLP_PRIV _Slist_iterator< _Tp, _Nonconst_traits< _Tp > > iterator
Definition: _slist.h:239
iterator erase(iterator __pos)
Definition: _slist.h:676
iterator erase_after(iterator __pos)
Definition: _slist.h:671
iterator begin()
Definition: _slist.h:416

◆ insert()

void SlistTest::insert ( )
protected

Definition at line 151 of file slist_test.cpp.

152{
153#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
154 int array[] = { 0, 1, 2, 3, 4 };
155
156 //insert
157 {
158 slist<int> sl;
159
160 sl.insert(sl.begin(), 5);
161 CPPUNIT_ASSERT( sl.front() == 5 );
162 CPPUNIT_ASSERT( sl.size() == 1 );
163
164 //debug mode check:
165 //sl.insert(sl.before_begin(), array, array + 5);
166
167 sl.insert(sl.begin(), array, array + 5);
168 CPPUNIT_ASSERT( sl.size() == 6 );
169 int i;
170 slist<int>::iterator slit(sl.begin());
171 for (i = 0; slit != sl.end(); ++slit, ++i) {
172 CPPUNIT_ASSERT( *slit == i );
173 }
174 }
175
176 //insert_after
177 {
178 slist<int> sl;
179
180 //debug check:
181 //sl.insert_after(sl.begin(), 5);
182
183 sl.insert_after(sl.before_begin(), 5);
184 CPPUNIT_ASSERT( sl.front() == 5 );
185 CPPUNIT_ASSERT( sl.size() == 1 );
186
187 sl.insert_after(sl.before_begin(), array, array + 5);
188 CPPUNIT_ASSERT( sl.size() == 6 );
189 int i;
190 slist<int>::iterator slit(sl.begin());
191 for (i = 0; slit != sl.end(); ++slit, ++i) {
192 CPPUNIT_ASSERT( *slit == i );
193 }
194 }
195#endif
196}
iterator end()
Definition: _slist.h:420
size_type size() const
Definition: _slist.h:423
iterator insert_after(iterator __pos, const value_type &__x=_Tp())
Definition: _slist.h:601
iterator insert(iterator __pos, const value_type &__x=_Tp())
Definition: _slist.h:635
iterator before_begin()
Definition: _slist.h:412
reference front()
Definition: _slist.h:437
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

◆ slist1()

void SlistTest::slist1 ( )
protected

Definition at line 57 of file slist_test.cpp.

58{
59#if defined (STLPORT) && !defined (_STLP_USE_NO_IOSTREAMS) && !defined (_STLP_NO_EXTENSIONS)
60/*
61original: xlxtss
62reversed: sstxlx
63removed: sstl
64uniqued: stl
65sorted: lst
66*/
67
68 char array [] = { 'x', 'l', 'x', 't', 's', 's' };
71 slist<char> str(array+0, array + 6);
73 //Check const_iterator construction from iterator
76// cout << "reversed: ";
77 str.reverse();
78 for(i = str.begin(); i != str.end(); i++)
79 os << *i;
80 stringbuf* buff=os.rdbuf();
81 string result=buff->str();
82 CPPUNIT_ASSERT(!strcmp(result.c_str(),"sstxlx"));
83
84 //cout << "removed: ";
85 str.remove('x');
86 ostringstream os2;
87 for(i = str.begin(); i != str.end(); i++)
88 os2 << *i;
89 buff=os2.rdbuf();
90 result=buff->str();
91 CPPUNIT_ASSERT(!strcmp(result.c_str(),"sstl"));
92
93
94 //cout << "uniqued: ";
95 str.unique();
96 ostringstream os3;
97 for(i = str.begin(); i != str.end(); i++)
98 os3 << *i;
99 buff=os3.rdbuf();
100 result=buff->str();
101 CPPUNIT_ASSERT(!strcmp(result.c_str(),"stl"));
102
103 //cout << "sorted: ";
104 str.sort();
105 ostringstream os4;
106 for(i = str.begin(); i != str.end(); i++)
107 os4 << *i;
108 buff = os4.rdbuf();
109 result = buff->str();
110 CPPUNIT_ASSERT(!strcmp(result.c_str(),"lst"));
111
112 //A small compilation time check to be activated from time to time:
113# if 0
114 {
115 slist<char>::iterator sl_char_ite;
116 slist<int>::iterator sl_int_ite;
117 CPPUNIT_ASSERT( sl_char_ite != sl_int_ite );
118 }
119# endif
120#endif
121}
int strcmp(const char *String1, const char *String2)
Definition: utclib.c:469
basic_stringbuf< _CharT, _Traits, _Alloc > * rdbuf() const
Definition: _sstream.h:181
_STLP_PRIV _Slist_iterator< _Tp, _Const_traits< _Tp > > const_iterator
Definition: _slist.h:240
static unsigned char buff[32768]
Definition: fatten.c:17
GLuint64EXT * result
Definition: glext.h:11304
const WCHAR * str

◆ splice()

void SlistTest::splice ( )
protected

Definition at line 198 of file slist_test.cpp.

199{
200#if defined (STLPORT) && !defined (_STLP_NO_EXTENSIONS)
201 int array[] = { 0, 1, 2, 3, 4 };
202
203 //splice
204 {
205 slist<int> sl1(array, array + 5);
206 slist<int> sl2(array, array + 5);
208
209 //a no op:
210 sl1.splice(sl1.begin(), sl1, sl1.begin());
211 CPPUNIT_ASSERT( sl1 == sl2 );
212
213 slit = sl1.begin(); ++slit;
214 //a no op:
215 sl1.splice(slit, sl1, sl1.begin());
216 CPPUNIT_ASSERT( sl1 == sl2 );
217
218 sl1.splice(sl1.end(), sl1, sl1.begin());
219 slit = sl1.begin();
220 CPPUNIT_ASSERT( *(slit++) == 1 );
221 CPPUNIT_ASSERT( *(slit++) == 2 );
222 CPPUNIT_ASSERT( *(slit++) == 3 );
223 CPPUNIT_ASSERT( *(slit++) == 4 );
224 CPPUNIT_ASSERT( *slit == 0 );
225 sl1.splice(sl1.begin(), sl1, slit);
226 CPPUNIT_ASSERT( sl1 == sl2 );
227
228 sl1.splice(sl1.begin(), sl2);
229 size_t i;
230 for (i = 0, slit = sl1.begin(); slit != sl1.end(); ++slit, ++i) {
231 if (i == 5) i = 0;
232 CPPUNIT_ASSERT( *slit == array[i] );
233 }
234
235 slit = sl1.begin();
236 advance(slit, 5);
237 CPPUNIT_ASSERT( *slit == 0 );
238 sl2.splice(sl2.begin(), sl1, sl1.begin(), slit);
239 CPPUNIT_ASSERT( sl1 == sl2 );
240
241 slit = sl1.begin(); ++slit;
242 sl1.splice(sl1.begin(), sl1, slit, sl1.end());
243 slit = sl1.begin();
244 CPPUNIT_ASSERT( *(slit++) == 1 );
245 CPPUNIT_ASSERT( *(slit++) == 2 );
246 CPPUNIT_ASSERT( *(slit++) == 3 );
247 CPPUNIT_ASSERT( *(slit++) == 4 );
248 CPPUNIT_ASSERT( *slit == 0 );
249
250 // a no op
251 sl2.splice(sl2.end(), sl2, sl2.begin(), sl2.end());
252 for (i = 0, slit = sl2.begin(); slit != sl2.end(); ++slit, ++i) {
253 CPPUNIT_ASSERT( i < 5 );
254 CPPUNIT_ASSERT( *slit == array[i] );
255 }
256
257 slit = sl2.begin();
258 advance(slit, 3);
259 sl2.splice(sl2.end(), sl2, sl2.begin(), slit);
260 slit = sl2.begin();
261 CPPUNIT_ASSERT( *(slit++) == 3 );
262 CPPUNIT_ASSERT( *(slit++) == 4 );
263 CPPUNIT_ASSERT( *(slit++) == 0 );
264 CPPUNIT_ASSERT( *(slit++) == 1 );
265 CPPUNIT_ASSERT( *slit == 2 );
266 }
267
268 //splice_after
269 {
270 slist<int> sl1(array, array + 5);
271 slist<int> sl2(array, array + 5);
273
274 //a no op:
275 sl1.splice_after(sl1.begin(), sl1, sl1.begin());
276 CPPUNIT_ASSERT( sl1 == sl2 );
277
278 sl1.splice_after(sl1.before_begin(), sl1, sl1.begin());
279 slit = sl1.begin();
280 CPPUNIT_ASSERT( *(slit++) == 1 );
281 CPPUNIT_ASSERT( *(slit++) == 0 );
282 CPPUNIT_ASSERT( *(slit++) == 2 );
283 CPPUNIT_ASSERT( *(slit++) == 3 );
284 CPPUNIT_ASSERT( *slit == 4 );
285 sl1.splice_after(sl1.before_begin(), sl1, sl1.begin());
286 CPPUNIT_ASSERT( sl1 == sl2 );
287
288 sl1.splice_after(sl1.before_begin(), sl2);
289 size_t i;
290 for (i = 0, slit = sl1.begin(); slit != sl1.end(); ++slit, ++i) {
291 if (i == 5) i = 0;
292 CPPUNIT_ASSERT( *slit == array[i] );
293 }
294
295 slit = sl1.begin();
296 advance(slit, 4);
297 CPPUNIT_ASSERT( *slit == 4 );
298 sl2.splice_after(sl2.before_begin(), sl1, sl1.before_begin(), slit);
299 CPPUNIT_ASSERT( sl1 == sl2 );
300
301 sl1.splice_after(sl1.before_begin(), sl1, sl1.begin(), sl1.previous(sl1.end()));
302 slit = sl1.begin();
303 CPPUNIT_ASSERT( *(slit++) == 1 );
304 CPPUNIT_ASSERT( *(slit++) == 2 );
305 CPPUNIT_ASSERT( *(slit++) == 3 );
306 CPPUNIT_ASSERT( *(slit++) == 4 );
307 CPPUNIT_ASSERT( *slit == 0 );
308
309 // a no op
310 sl2.splice_after(sl2.before_begin(), sl2, sl2.before_begin(), sl2.previous(sl2.end()));
311 for (i = 0, slit = sl2.begin(); slit != sl2.end(); ++slit, ++i) {
312 CPPUNIT_ASSERT( i < 5 );
313 CPPUNIT_ASSERT( *slit == array[i] );
314 }
315
316 slit = sl2.begin();
317 advance(slit, 2);
318 sl2.splice_after(sl2.previous(sl2.end()), sl2, sl2.before_begin(), slit);
319 slit = sl2.begin();
320 CPPUNIT_ASSERT( *(slit++) == 3 );
321 CPPUNIT_ASSERT( *(slit++) == 4 );
322 CPPUNIT_ASSERT( *(slit++) == 0 );
323 CPPUNIT_ASSERT( *(slit++) == 1 );
324 CPPUNIT_ASSERT( *slit == 2 );
325 }
326#endif
327}
void splice_after(iterator __pos, _Self &__x, iterator __before_first, iterator __before_last)
Definition: _slist.h:697
void splice(iterator __pos, _Self &__x)
Definition: _slist.h:737

Member Data Documentation

◆ CPPUNIT_IGNORE

SlistTest::CPPUNIT_IGNORE
private

Definition at line 32 of file slist_test.cpp.


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