Reformated the project.

Author: MostafaTwfiq

DataStructure/Deque/Sources/DLinkedListDeque.c

@@ -360,7 +360,7 @@ void destroyDLDeque(void *deque) {
 
     }
 
-    destroyDoublyLinkedList( ((DLDeque *) deque)->linkedList );
+    destroyDoublyLinkedList(((DLDeque *) deque)->linkedList);
     free(deque);
 
 }

DataStructure/Deque/Sources/Deque.c

@@ -462,6 +462,6 @@ void destroyDeque(void *deque) {
     }
 
     clearDeque(deque);
-    free( ((Deque *) deque)->arr );
+    free(((Deque *) deque)->arr);
     free(deque);
 }

DataStructure/Graphs/Sources/DirectedGraph.c

@@ -591,7 +591,7 @@ void destroyDirGraph(void *graph) {
 
     }
 
-    destroyHashMap( ((DirectedGraph *)graph)->nodes );
+    destroyHashMap(((DirectedGraph *) graph)->nodes);
     free(graph);
 
 }

DataStructure/Graphs/Sources/UndirectedGraph.c

@@ -851,7 +851,7 @@ void destroyUDGraph(void *graph) {
 
     }
 
-    destroyHashMap( ((UndirectedGraph *)graph)->nodes );
+    destroyHashMap(((UndirectedGraph *) graph)->nodes);
     free(graph);
 
 }

DataStructure/Lists/Sources/ArrayList.c

@@ -18,7 +18,7 @@ arrayListInitialization(int initialLength, void (*freeFun)(void *), int (*compar
     if (freeFun == NULL) {
 #ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
         ERROR_TEST->errorCode = INVALID_ARG;
-       return NULL;
+        return NULL;
 #else
         fprintf(stderr, INVALID_ARG_MESSAGE, "free function", "array list data structure");
         exit(INVALID_ARG);
@@ -841,7 +841,7 @@ void destroyArrayList(void *list) {
     }
 
     clearArrayList(list);
-    free( ((ArrayList *) list)->arr );
+    free(((ArrayList *) list)->arr);
     free(list);
 
 }

DataStructure/Lists/Sources/Vector.c

@@ -79,7 +79,7 @@ void vectorAdd(Vector *list, void *item) {
     if (list == NULL) {
 #ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
         ERROR_TEST->errorCode = NULL_POINTER;
-       return;
+        return;
 #else
         fprintf(stderr, NULL_POINTER_MESSAGE, "vector", "vector data structure");
         exit(NULL_POINTER);
@@ -88,7 +88,7 @@ void vectorAdd(Vector *list, void *item) {
     } else if (item == NULL) {
 #ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
         ERROR_TEST->errorCode = INVALID_ARG;
-       return;
+        return;
 #else
         fprintf(stderr, INVALID_ARG_MESSAGE, "item pointer", "vector data structure");
         exit(INVALID_ARG);
@@ -103,7 +103,7 @@ void vectorAdd(Vector *list, void *item) {
         if (list->arr == NULL) {
 #ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
             ERROR_TEST->errorCode = FAILED_REALLOCATION;
-           return;
+            return;
 #else
             fprintf(stderr, FAILED_REALLOCATION_MESSAGE, "items memory", "vector data structure");
             exit(FAILED_REALLOCATION);
@@ -462,7 +462,7 @@ int vectorGetIndex(Vector *list, void *item) {
     } else if (list->comparator == NULL) {
 #ifdef C_DATASTRUCTURES_ERRORSTESTSTRUCT_H
         ERROR_TEST->errorCode = NULL_POINTER;
-       return -1;
+        return -1;
 #else
         fprintf(stderr, NULL_POINTER_MESSAGE, "comparator function", "vector data structure");
         exit(NULL_POINTER);
@@ -841,7 +841,7 @@ void destroyVector(void *list) {
     }
 
     clearVector(list);
-    free( ((Vector *) list)->arr );
+    free(((Vector *) list)->arr);
     free(list);
 
 }

DataStructure/Matrices/Sources/Matrix.c

@@ -1007,9 +1007,9 @@ void destroyMatrix(void *matrix) {
     clearMatrix(matrix);
 
     for (int i = 0; i < ((Matrix *) matrix)->rowsNum; i++)
-        free( ((Matrix *) matrix)->rows[i] );
+        free(((Matrix *) matrix)->rows[i]);
 
-    free( ((Matrix *) matrix)->rows );
+    free(((Matrix *) matrix)->rows);
     free(matrix);
 
 }

DataStructure/Pairs/Headers/Pair.h

@@ -24,6 +24,7 @@ typedef struct Pair {
     void *sElem;
 
     void (*fFreeFn)(void *);
+
     void (*sFreeFn)(void *);
 
 } Pair;

DataStructure/Pairs/Sources/Pair.c

@@ -3,10 +3,6 @@
 #include "../../../Unit Test/CuTest/CuTest.h"
 
 
-
-
-
-
 /** This function will allocate a new pair then it will return it's pointer.
  *
  * @param fElem the first element pointer
@@ -68,11 +64,6 @@ Pair *pairInitialization(void *fElem, void *sElem, void (*fFreeFn)(void *), void
 }
 
 
-
-
-
-
-
 /** This function will return the first element in the pair.
  *
  * @param pair the pair pointer
@@ -96,9 +87,6 @@ void *pairGetFElem(Pair *pair) {
 }
 
 
-
-
-
 /** This function will return the second element in the pair.
  *
  * @param pair the pair pointer
@@ -122,9 +110,6 @@ void *pairGetSElem(Pair *pair) {
 }
 
 
-
-
-
 /** This function will set the first element in the pair.
  *
  * Note: this function will free the old element
@@ -160,9 +145,6 @@ void pairSetFElem(Pair *pair, void *newElem) {
 }
 
 
-
-
-
 /** This function will set the second element in the pair.
  *
  * Note: this function will free the old element
@@ -198,10 +180,6 @@ void pairSetSElem(Pair *pair, void *newElem) {
 }
 
 
-
-
-
-
 /** This function will set the first element in the pair,
  * without freeing the old element.
  *
@@ -234,9 +212,6 @@ void pairSetFElemWtoFr(Pair *pair, void *newElem) {
 }
 
 
-
-
-
 /** This function will set the second element in the pair,
  * without freeing the old element.
  *
@@ -269,10 +244,6 @@ void pairSetSElemWtoFr(Pair *pair, void *newElem) {
 }
 
 
-
-
-
-
 /** This function will swap the pair elements.
  *
  * @param pair the pair pointer
@@ -301,8 +272,6 @@ void pairSwapElements(Pair *pair) {
 }
 
 
-
-
 /** This function will destroy and free the pair and its elements.
  *
  * @param pair the pair pointer

DataStructure/Queues/Headers/HPriorityQueue.h

@@ -12,7 +12,7 @@ typedef struct HPriorityQueue {
 
     struct BinaryHeap *heap;
 
-}HPriorityQueue;
+} HPriorityQueue;
 
 
 HPriorityQueue *hPriorityQueueInitialization(void (*freeFn)(void *), int (*cmp)(const void *, const void *));