test_slist.cpp File Reference

#include "Tests.h"
#include "TestClass.h"
#include "LeakCheck.h"
#include <slist>
#include "test_construct.h"
#include "test_assign_op.h"
#include "test_push_back.h"
#include "test_insert.h"
#include "test_push_front.h"

Include dependency graph for test_slist.cpp:

Go to the source code of this file.

Classes
struct	test_slist_sort

Typedefs
typedef EH_STD::__slist__< TestClass, eh_allocator(TestClass) >	TestSList

Functions
sequence_container_tag	container_category (const TestSList &)
void	test_slist ()

Typedef Documentation

TestSList

typedef EH_STD::__slist__<TestClass, eh_allocator(TestClass) > TestSList

Definition at line 34 of file test_slist.cpp.

Function Documentation

container_category()

sequence_container_tag container_category ( const TestSList &  )

inline

Definition at line 38 of file test_slist.cpp.

                                     {
  return sequence_container_tag();
}

test_slist()

void test_slist

(

void

)

Definition at line 55 of file test_slist.cpp.

                  {
  TestSList testSList, testSList2;
  size_t slistSize = random_number(random_base);
 
  while (testSList.size() < slistSize) {
    TestClass x;
    testSList.push_front( x );
    testSList2.push_front( TestClass() );
  }
 
  StrongCheck( testSList, test_insert_one<TestSList>(testSList) );
  StrongCheck( testSList, test_insert_one<TestSList>(testSList, 0) );
  StrongCheck( testSList, test_insert_one<TestSList>(testSList, (int)testSList.size()) );
 
  WeakCheck( testSList, test_insert_n<TestSList>(testSList, random_number(random_base) ) );
  WeakCheck( testSList, test_insert_n<TestSList>(testSList, random_number(random_base), 0 ) );
  WeakCheck( testSList, test_insert_n<TestSList>(testSList, random_number(random_base), (int)testSList.size() ) );
 
  size_t insCnt = random_number(random_base);
  TestClass *insFirst = new TestSList::value_type[1+insCnt];
  WeakCheck( testSList, insert_range_tester(testSList, insFirst, insFirst+insCnt) );
 
  ConstCheck( 0, test_construct_pointer_range<TestSList>(insFirst, insFirst+insCnt) );
  delete[] insFirst;
  WeakCheck( testSList, test_insert_range<TestSList,TestSList::iterator>(testSList, testSList2.begin(), testSList2.end() ) );
  StrongCheck( testSList, test_push_front<TestSList>(testSList) );
  StrongCheck( testSList, test_slist_sort() );  // Simply to verify strength.
 
  ConstCheck( 0, test_default_construct<TestSList>() );
  ConstCheck( 0, test_construct_n<TestSList>( random_number(random_base) ) );
  ConstCheck( 0, test_construct_n_instance<TestSList>( random_number(random_base) ) );
  ConstCheck( 0, test_construct_iter_range<TestSList>( testSList2 ) );
  ConstCheck( testSList, test_copy_construct<TestSList>() );
  WeakCheck( testSList, test_assign_op<TestSList>( testSList2 ) );
}