dequetest.cpp

计算机软件的测试驱动程序cppunit精简版。

#include "../TestHarness/TestHarness.h"
#include "Deque.h"

int main()
{
	TestResult tr;
	TestRegistry::runAllTests(tr);
	return 0;
}

TEST( Deque, construction)
{
	Deque<int> d;
	CHECK ( 0 == d.size() );
}

TEST( Deque, push_back)
{
	Deque<int> d;
	d.push_back(0);
	CHECK (	1 == d.size() );
}

TEST( Deque, pop_back)
{
	Deque<int> d;
	d.push_back(0);
	d.push_back(1);
	CHECK ( 1 == d.pop_back() );
	CHECK ( 0 == d.pop_back() );
}

TEST( Deque, grow)
{
	Deque<int> d;
	for (int i = 0; i < 10; i++)
		d.push_back(i);
	d.push_back(10);
	CHECK ( 11 == d.size() );
	CHECK ( 10 == d.pop_back() );
}

TEST (Deque, push_front)
{
	Deque<int> d;
	d.push_front(0);
	CHECK ( 1 == d.size() );
}

TEST (Deque, doit)
{
	Deque<int> d;
	d.push_front(0);
	d.push_back(1);
	d.push_back(2);
	d.push_back(3);
	CHECK ( 4 == d.size() );
	CHECK ( 0 == d.pop_front() );
	CHECK ( 3 == d.pop_back() );
}

TEST (Deque, pop_front)
{
	Deque<int> d;
	d.push_front(0);
	CHECK( 1 == d.size());
	CHECK( 0 == d.pop_front());
	CHECK( 0 == d.size());
}

TEST (Deque, copy_construction)
{
	Deque<int> d;
	d.push_front(1);
	Deque<int> d2 = d;
	d.pop_front();
	CHECK( 1 == d2.pop_front());
}

TEST (Deque, assignment_operator)
{
	Deque<int> d;
	d.push_front(1);
	Deque<int> d2;
	d2 = d;
	d.pop_front();
	CHECK( 1 == d2.pop_front());
}

TEST (Deque, dont_try_suicide)
{
	Deque<int> d;
	d.push_front(1);
	d = d;
	CHECK( 1 == d.pop_front());
}

TEST (Deque, double_test)
{
	Deque<double> d;
	d.push_front(0.1);
	d.push_back(1.1);
	d.push_back(2.1);
	d.push_back(3.1);
	CHECK ( 4 == d.size() );
	CHECK ( 0.1 == d.pop_front() );
	CHECK ( 3.1 == d.pop_back() );
}