CPlusPlus2-DataStructures_MEGA_Review/StackQueueUnitTest.cpp at master · CarltonBranch/CPlusPlus2-DataStructures_MEGA_Review · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
/**	@file: LinkedList_Class_test.cpp
@author Carlton Branch
@author clbranch.jr@gmail.com
@author https://github.com/CarltonBranch
@date 2016-12-24
@brief Unit test of sorted_vector container
*/

#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#define BOOST_TEST_MODULE Stack_Queue_Class_Test

#include <boost/test/unit_test.hpp>
#include <iostream>
#include "Stack.hpp"
#include "Queue.hpp"
using namespace boost::unit_test;
using namespace std;
#define maximum 10


BOOST_AUTO_TEST_CASE(intro) {
	cout << "\n-- Stack Class --Unit test.\n";
	cout << "Last compiled: " << __TIMESTAMP__ << "\n\n";
}

BOOST_AUTO_TEST_CASE(default_constructor_test_int) {
	Stack<int> * s = new Stack<int>();

	delete s;
}

BOOST_AUTO_TEST_CASE(push_test_int) {
	Stack<int> * s = new Stack<int>();
	for (int i = 0; i < 1000; ++i)
	{
		s->push(i);
		BOOST_CHECK_EQUAL(s->getSize(), i + 1);
		BOOST_CHECK_EQUAL(s->peek(), i);
	}
	delete s;
}

BOOST_AUTO_TEST_CASE(pop_test_int) {
	Stack<int> * s = new Stack<int>();
	for (int i = 0; i <= maximum; ++i) {
		s->push(i);
	}

	for (int i = 0; i < maximum; ++i) {
		s->pop();
		BOOST_CHECK_EQUAL(s->peek(), maximum - i - 1);
	}
	delete s;
}

BOOST_AUTO_TEST_CASE(min_value_test_int) {
	Stack<int> * s = new Stack<int>();
	for (int i = 5; i < 1000; ++i)
	{
		s->push(i);
	}
	BOOST_CHECK_EQUAL(s->min(), 5);

	delete s;
}
//----------------------------------------------------------------------

BOOST_AUTO_TEST_CASE(intro2) {
	cout << "\n-- Queue Class --Unit test.\n";
	cout << "Last compiled: " << __TIMESTAMP__ << "\n\n";
}

BOOST_AUTO_TEST_CASE(default_queue_constructor_test_int) {
	Queue<int> * q = new Queue<int>();
	delete q;
}

BOOST_AUTO_TEST_CASE(push_queue_test_int) {
	Queue<int> * q = new Queue<int>();
		q->push(11);
		q->push(10);
		q->push(9);
		q->push(8);
		BOOST_CHECK_EQUAL(q->peek(), 11);
		BOOST_CHECK_EQUAL(q->getSize(), 4);
		delete q;
}

BOOST_AUTO_TEST_CASE(pop_queue_test_int) {
	Queue<int> * q = new Queue<int>();
	for (int i = 0; i < maximum; ++i)
	{
		q->push(i);
	}
	for (int i = 0; i < maximum - 1; ++i) {
		q->pop();
		BOOST_CHECK_EQUAL(q->peek(), i + 1);
		BOOST_CHECK_EQUAL(q->getSize(), maximum - 1 - i);
	}
	delete q;
}
BOOST_AUTO_TEST_CASE(pop_queue_test_int2) {
	Queue<int> * q2 = new Queue<int>();
	q2->push(5);
	q2->pop();
	BOOST_CHECK_EQUAL(q2->getSize(), 0);
	delete q2;
}

BOOST_AUTO_TEST_CASE(pop_queue_test_int3) {
	Queue<int> * q2 = new Queue<int>();
	q2->pop();
	BOOST_CHECK_EQUAL(q2->getSize(), 0);
	delete q2;
}

BOOST_AUTO_TEST_CASE(pop_isEmpty_test_int3) {
	Queue<int> * q2 = new Queue<int>();
	BOOST_CHECK_EQUAL(q2->isEmpty(), true);
	q2->push(5);
	BOOST_CHECK_EQUAL(q2->isEmpty(), false);
	q2->pop();
	BOOST_CHECK_EQUAL(q2->isEmpty(), true);
	delete q2;
}