test_deque.cpp File Reference

#include "Tests.h"
#include <cstdio>
#include <deque>
#include "TestClass.h"
#include "LeakCheck.h"
#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_deque.cpp:

Go to the source code of this file.

Typedefs
typedef TestClass	DQTestClass
typedef EH_STD::deque< DQTestClass, eh_allocator(DQTestClass) >	TestDeque

Functions
sequence_container_tag	container_category (const TestDeque &)
void	test_deque ()

Typedef Documentation

DQTestClass

typedef TestClass DQTestClass

Definition at line 37 of file test_deque.cpp.

TestDeque

typedef EH_STD::deque<DQTestClass, eh_allocator(DQTestClass) > TestDeque

Definition at line 39 of file test_deque.cpp.

Function Documentation

container_category()

sequence_container_tag container_category ( const TestDeque &  )

inline

Definition at line 42 of file test_deque.cpp.

{
  return sequence_container_tag();
}

test_deque()

void test_deque

(

)

Definition at line 47 of file test_deque.cpp.

{
    size_t dequeSize = random_number(random_base);
    TestDeque emptyDeque;
    TestDeque testDeque, testDeque2;
    while ( testDeque.size() < dequeSize )
    {
        DQTestClass x;
        testDeque.push_back( x );
        testDeque2.push_back( DQTestClass() );
    }
 
    ConstCheck( testDeque, test_copy_construct<TestDeque>() );
    WeakCheck( testDeque, test_insert_one<TestDeque>(testDeque) );
    StrongCheck( testDeque, test_insert_one<TestDeque>(testDeque, 0) );
    StrongCheck( testDeque, test_insert_one<TestDeque>(testDeque, (int)testDeque.size()) );
 
    WeakCheck( testDeque, test_insert_n<TestDeque>(testDeque, random_number(random_base) ) );
    StrongCheck( testDeque, test_insert_n<TestDeque>(testDeque, random_number(random_base), 0 ) );
    StrongCheck( testDeque, test_insert_n<TestDeque>(testDeque, random_number(random_base), (int)testDeque.size() ) );
 
    size_t insCnt = random_number(random_base);
    DQTestClass *insFirst = new TestDeque::value_type[insCnt + 1];
 
    WeakCheck( testDeque, insert_range_tester(testDeque, insFirst, insFirst + insCnt) );
    StrongCheck( testDeque, insert_range_at_begin_tester(testDeque, insFirst, insFirst + insCnt) );
    StrongCheck( testDeque, insert_range_at_end_tester(testDeque, insFirst, insFirst + insCnt) );
 
    ConstCheck( 0, test_construct_pointer_range<TestDeque>(insFirst, insFirst + insCnt) );
    delete[] insFirst;
 
    WeakCheck( testDeque, insert_range_tester(testDeque, testDeque2.begin(), testDeque2.end() ) );
 
    StrongCheck( testDeque, test_push_back<TestDeque>(testDeque) );
    StrongCheck( emptyDeque, test_push_back<TestDeque>(emptyDeque) );
    StrongCheck( testDeque, test_push_front<TestDeque>(testDeque) );
    StrongCheck( emptyDeque, test_push_front<TestDeque>(emptyDeque) );
 
 
    ConstCheck( 0, test_default_construct<TestDeque>() );
    ConstCheck( 0, test_construct_n<TestDeque>( random_number(random_base) ) );
    ConstCheck( 0, test_construct_n_instance<TestDeque>( random_number(random_base) ) );
    ConstCheck( 0, test_construct_iter_range<TestDeque>( testDeque2 ) );
 
    testDeque2.resize( testDeque.size() * 3 / 2 );
    WeakCheck( testDeque, test_assign_op<TestDeque>( testDeque2 ) );
    testDeque2.resize( testDeque.size() * 2 / 3 );
    WeakCheck( testDeque, test_assign_op<TestDeque>( testDeque2 ) );
}

Referenced by main().