test_list.cpp File Reference

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

Include dependency graph for test_list.cpp:

Go to the source code of this file.

Classes
struct	test_list_sort

Typedefs
typedef EH_STD::__list__< TestClass, eh_allocator(TestClass) >	TestList

Functions
sequence_container_tag	container_category (const TestList &)
void	test_list ()

Typedef Documentation

TestList

typedef EH_STD::__list__<TestClass, eh_allocator(TestClass) > TestList

Definition at line 31 of file test_list.cpp.

Function Documentation

container_category()

sequence_container_tag container_category ( const TestList &  )

inline

Definition at line 34 of file test_list.cpp.

{
  return sequence_container_tag();
}

test_list()

void test_list

(

)

Definition at line 64 of file test_list.cpp.

{
    TestList testList, testList2;
    size_t listSize = random_number(random_base);
 
    while ( testList.size() < listSize )
    {
        TestClass x;
        testList.push_back( x );
        testList2.push_back( TestClass() );
    }
 
    StrongCheck( testList, test_insert_one<TestList>(testList) );
    StrongCheck( testList, test_insert_one<TestList>(testList, 0) );
    StrongCheck( testList, test_insert_one<TestList>(testList, (int)testList.size()) );
 
    WeakCheck( testList, test_insert_n<TestList>(testList, random_number(random_base) ) );
    WeakCheck( testList, test_insert_n<TestList>(testList, random_number(random_base), 0 ) );
    WeakCheck( testList, test_insert_n<TestList>(testList, random_number(random_base), (int)testList.size() ) );
 
    size_t insCnt = random_number(random_base);
    TestClass *insFirst = new TestList::value_type[1+insCnt];
 
    WeakCheck( testList, insert_range_tester(testList, insFirst, insFirst+insCnt) );
    WeakCheck( testList, insert_range_at_begin_tester(testList, insFirst, insFirst+insCnt) );
    WeakCheck( testList, insert_range_at_end_tester(testList, insFirst, insFirst+insCnt) );
 
    ConstCheck( 0, test_construct_pointer_range<TestList>(insFirst, insFirst+insCnt) );
    delete[] insFirst;
 
    WeakCheck( testList, insert_range_tester(testList, testList2.begin(), testList2.end() ) );
 
    StrongCheck( testList, test_push_front<TestList>(testList) );
    StrongCheck( testList, test_push_back<TestList>(testList) );
 
    StrongCheck( testList, test_list_sort() );  // Simply to verify strength.
 
    ConstCheck( 0, test_default_construct<TestList>() );
    ConstCheck( 0, test_construct_n<TestList>( random_number(random_base) ) );
    ConstCheck( 0, test_construct_n_instance<TestList>( random_number(random_base) ) );
    ConstCheck( 0, test_construct_iter_range<TestList>( testList2 ) );
    ConstCheck( testList, test_copy_construct<TestList>() );
 
    WeakCheck( testList, test_assign_op<TestList>( testList2 ) );
}