Singly-Linked-List/UnitTest.cpp at master · PDS-DX/Singly-Linked-List · 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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
#include <iostream>
#include <fstream>
#include "SinglyLinkedList.h"
using namespace std;

int main()
{
	fstream output;
	SinglyLinkedList< int > * list;

	output.open("unit_test_output.txt", ios_base::out);
	int arr[10], arr2[10];
	for (int i = 0; i < 10; i++)
		arr[i] = i;
	for (int i = 0; i < 10; i++)
		arr2[i] = i + 10;

	// output seed array
	output << "Array = [";
	for (int i = 0; i < 10; i++)
	{
		if (i < 9)
		{
			output << arr[i] << ", ";
		}
		else
		{
			output << arr[i];
		}
	}
	output << "]" << endl;

	// test deleteFromHead() with insertHead()
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertHead(i);
	}
	output << "SinglyLinkedList<T>::deleteFromHead() using SinglyLinkedList<T>::insertHead() to populate" << endl;
	while (!list->isEmpty())
	{
		output << list->deleteFromHead() << endl;
	}

	delete list;

	// test deleteFromHead() with insertTail()
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertTail(i);
	}
	output << "SinglyLinkedList<T>::deleteFromHead() using SinglyLinkedList<T>::insertTail() to populate" << endl;
	while (!list->isEmpty())
	{
		output << list->deleteFromHead() << endl;
	}

	delete list;

	// test deleteFromTail() with insertTail()
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertTail(i);
	}
	output << "SinglyLinkedList<T>::deleteFromTail() using SinglyLinkedList<T>::insertTail() to populate" << endl;
	while (!list->isEmpty())
	{
		output << list->deleteFromTail() << endl;
	}

	delete list;

	// test deleteFromTail() with insertTail()
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertHead(i);
	}
	output << "SinglyLinkedList<T>::deleteFromTail() using SinglyLinkedList<T>::insertHead() to populate" << endl;
	while (!list->isEmpty())
	{
		output << list->deleteFromTail() << endl;
	}

	delete list;

	// test deleteIndex() forward iteration
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertHead(i);
	}

	output << "SinglyLinkedList<T>::deleteIndex() forward iteration" << endl;
	for (int i = 0; i < 10; i++)
	{
		if (list->deleteIndex(arr[i]))
			output << i << " : True" << endl;
		else
			output << i << " : False" << endl;
	}

	delete list;

	// test deleteIndex() reverse iteration
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertTail(i);
	}

	output << "SinglyLinkedList<T>::deleteIndex() reverse iteration" << endl;
	for (int i = 10; i > 0; i--)
	{
		if (list->deleteIndex(arr[i - 1]))
			output << arr[i - 1] << " : True" << endl;
		else
			output << arr[i - 1] << " : False" << endl;
	}

	delete list;

	// test deleteIndex() for non-existing elements
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertTail(i);
	}

	output << "SinglyLinkedList<T>::deleteIndex() for non-existing elements" << endl;
	for (int & i : arr2)
	{
		if (list->deleteIndex(i))
			output << i << " : True" << endl;
		else
			output << i << " : False" << endl;
	}

	delete list;

	// test isInList()
	list = new SinglyLinkedList < int >;

	for (int & i : arr)
	{
		list->insertHead(i);
	}

	output << "SinglyLinkedList<T>::isInList() for existing elements" << endl;

	for (int & i : arr)
	{
		if (list->isInList(i))
			output << i << " : True" << endl;
		else
			output << i << " : False" << endl;
	}

	output << "SinglyLinkedList<T>::isInList() for non-existing elements" << endl;
	for (int & i : arr2)
	{
		if (list->isInList(i))
			output << i << " : True" << endl;
		else
			output << i << " : False" << endl;
	}

	delete list;

	// test isEmpty()
	list = new SinglyLinkedList < int >;
	output << "SinglyLinkedList<T>::isEmpty() for empty list" << endl;
	if (list->isEmpty())
		output << "True" << endl;
	else
		output << "False" << endl;

	output << "SinglyLinkedList<T>::isEmpty() for non-empty list" << endl;
	for (int i = 0; i < 10; i++)
	{
		list->insertHead(arr[i]);
	}

	if (list->isEmpty())
		output << "True" << endl;
	else
		output << "False" << endl;
	output.close();

	return 0;
}