|
9 | 9 | #include "DSStack/dsstack.h" |
10 | 10 | #include "DSDoublyLL/dsdoublyll.h" |
11 | 11 |
|
12 | | -TEST_CASE("Data_Structures_Test", "[Data_Structures_Test]"){ |
13 | | - |
14 | 12 | /* |
15 | | - * Set Variables |
| 13 | + * DSString |
16 | 14 | */ |
17 | | - |
| 15 | +TEST_CASE("Data_Structures_String", "[String][Data_Structures_Test]"){ |
18 | 16 | const int intArray1[3] = {0, 1, 2}; |
19 | 17 | int arr1StartSize = 3; |
20 | 18 | const int intArray2[3] = {3, 4, 5}; |
21 | 19 | int arr2StartSize = 3; |
22 | 20 | const int intArray3[6] = {0, 1, 2, 3, 4, 5}; |
23 | 21 | int arr3StartSize = 6; |
24 | 22 |
|
25 | | -/* |
26 | | - * DSString |
27 | | - */ |
28 | | - |
29 | 23 | DSString* testStringArray[3]; |
30 | 24 |
|
31 | 25 | testStringArray[0] = new DSString("test1"); |
@@ -157,10 +151,18 @@ TEST_CASE("Data_Structures_Test", "[Data_Structures_Test]"){ |
157 | 151 | clearFile.open(filePath.c_str()); |
158 | 152 | clearFile.close(); |
159 | 153 | } |
| 154 | +} |
160 | 155 |
|
161 | | - /* |
| 156 | +/* |
162 | 157 | * DSVector |
163 | 158 | */ |
| 159 | +TEST_CASE("Data_Structures_Vector", "[Vector][Data_Structures_Test]"){ |
| 160 | + const int intArray1[3] = {0, 1, 2}; |
| 161 | + int arr1StartSize = 3; |
| 162 | + const int intArray2[3] = {3, 4, 5}; |
| 163 | + int arr2StartSize = 3; |
| 164 | + const int intArray3[6] = {0, 1, 2, 3, 4, 5}; |
| 165 | + int arr3StartSize = 6; |
164 | 166 |
|
165 | 167 | DSVector<int> numVect1(8); |
166 | 168 | DSVector<int> numVect1Copy; |
@@ -249,10 +251,18 @@ TEST_CASE("Data_Structures_Test", "[Data_Structures_Test]"){ |
249 | 251 |
|
250 | 252 | numVect1 = numVect1Copy; |
251 | 253 | } |
| 254 | +} |
252 | 255 |
|
253 | 256 | /* |
254 | | - * DSStack |
| 257 | + * DSStack |
255 | 258 | */ |
| 259 | +TEST_CASE("Data_Structures_Stack", "[Stack][Data_Structures_Test]"){ |
| 260 | + const int intArray1[3] = {0, 1, 2}; |
| 261 | + int arr1StartSize = 3; |
| 262 | + const int intArray2[3] = {3, 4, 5}; |
| 263 | + int arr2StartSize = 3; |
| 264 | + const int intArray3[6] = {0, 1, 2, 3, 4, 5}; |
| 265 | + int arr3StartSize = 6; |
256 | 266 |
|
257 | 267 | DSStack<int> numStack1(4); |
258 | 268 | DSStack<int> numStack1Copy; |
@@ -334,9 +344,19 @@ TEST_CASE("Data_Structures_Test", "[Data_Structures_Test]"){ |
334 | 344 | numStack1 = numStack1Copy; |
335 | 345 | } |
336 | 346 |
|
| 347 | + |
| 348 | +} |
| 349 | + |
337 | 350 | /* |
338 | | - * DSDoublyLL |
| 351 | + * DSDoublyLL |
339 | 352 | */ |
| 353 | +TEST_CASE("Data_Structures_Doubly_Linked_List", "[Doubly_Linked_List][Data_Structures_Test]"){ |
| 354 | + const int intArray1[3] = {0, 1, 2}; |
| 355 | + int arr1StartSize = 3; |
| 356 | + const int intArray2[3] = {3, 4, 5}; |
| 357 | + int arr2StartSize = 3; |
| 358 | + const int intArray3[6] = {0, 1, 2, 3, 4, 5}; |
| 359 | + int arr3StartSize = 6; |
340 | 360 |
|
341 | 361 | DSDoublyLL<int> numList1; |
342 | 362 | DSDoublyLL<int> numList1Copy; |
@@ -412,7 +432,5 @@ TEST_CASE("Data_Structures_Test", "[Data_Structures_Test]"){ |
412 | 432 | REQUIRE(numList3 == numList2); |
413 | 433 |
|
414 | 434 | numList3 = numList1 + numList2; |
415 | | - |
416 | 435 | } |
417 | | - |
418 | 436 | } |
0 commit comments