added tests

Author: sethcg

core/include/sorts/MergeSort.hpp

@@ -12,7 +12,7 @@ namespace MergeSort {
 
     void GetMergeCount(Rectangle* array, int left, int middle, int right, int* stepCount);
 
-    int GetMergeSortCount(Rectangle* array);
+    int GetStepCount(Rectangle* array);
 
     void Merge(Rectangle* array, int left, int middle, int right, int* currentStep, SortSequence sort, int currentSize);
 

core/include/utils/Rect.hpp

@@ -10,6 +10,7 @@ typedef struct {
 #define rect_base_color rgb_color { .r = 50, .g = 50, .b = 50 }
 
 // OTHER COLORS TO BETTER DISTINGUISH THE SORTING PROCESS
+#define rect_red_color rgb_color { .r = 200, .g = 60, .b = 40 }
 #define rect_green_color rgb_color { .r = 0, .g = 150, .b = 75 }
 #define rect_blue_color rgb_color { .r = 0, .g = 120, .b = 160 }
 #define rect_orange_color rgb_color { .r = 200, .g = 120, .b = 0 }

core/src/sorts/MergeSort.cpp

@@ -9,8 +9,6 @@
 
 #define min(a, b) (((a) < (b)) ? (a) : (b))
 
-#define rect_red_color rgb_color { .r = 200, .g = 60, .b = 40 }
-
 namespace MergeSort {
 
     rgb_color GetRectangleColor(bool isSelected, bool inGrouping) {
@@ -72,7 +70,7 @@ namespace MergeSort {
         (*stepCount)++;
     }
 
-    int GetMergeSortCount(Rectangle* items) {
+    int GetStepCount(Rectangle* items) {
         int* stepCount = (int*) calloc(1, sizeof(int));
 
         // COPY ARRAY TO AVOID CHANGING UNDERLYING DATA
@@ -171,7 +169,7 @@ namespace MergeSort {
         Rectangle* array = CopyArray(items);
 
         // RUN THE SORT TO CALCULATE THE TOTAL NUMBER OF STEPS
-        int stepCount = GetMergeSortCount(items);
+        int stepCount = GetStepCount(items);
 
         SortSequence sort = create_sort_sequence(stepCount);
         sort.steps = (SortStep*) malloc(LIST_SIZE * stepCount * sizeof(SortStep));

test/sorts/MergeSort.cc

@@ -0,0 +1,47 @@
+#include <gtest/gtest.h>
+#include <SDL3/SDL.h>
+
+#include <TestUtils.hpp>
+
+#include <MergeSort.hpp>
+#include <List.hpp>
+#include <Rect.hpp>
+
+using namespace MergeSort;
+
+TEST(MergeSort_Test, GetStepCount_GreaterThanOne) {
+    // ARRANGE
+    SDL_Renderer* renderer = (SDL_Renderer*) malloc(sizeof(Rectangle));
+    Rectangle* items = (Rectangle*) malloc(LIST_SIZE * sizeof(Rectangle));
+
+    CreateList(renderer, items, WINDOW_WIDTH, WINDOW_HEIGHT);
+    ShuffleList(items);
+
+    // ACT
+    int stepCount = GetStepCount(items);
+
+    // ASSERT
+    EXPECT_TRUE(stepCount > 1);
+}
+
+TEST(MergeSort_Test, GetSequence_CorrectOrder) {
+    // ARRANGE
+    SDL_Renderer* renderer = (SDL_Renderer*) malloc(sizeof(Rectangle));
+    Rectangle* items = (Rectangle*) malloc(LIST_SIZE * sizeof(Rectangle));
+
+    CreateList(renderer, items, WINDOW_WIDTH, WINDOW_HEIGHT);
+    ShuffleList(items);
+
+    // ACT
+    SortSequence sequence = GetSequence(items);
+
+    // ASSERT
+    EXPECT_TRUE(sequence.stepCount > 0);
+
+    int lastStep = sequence.stepCount - 1;
+    int offset;
+    for (int i = 0; i < LIST_SIZE; i++) {
+        offset = (lastStep * LIST_SIZE) + i;
+        EXPECT_EQ(sequence.steps[offset].value, (i + 1));
+    }
+}