From 6187bc112e792d94fae1fa72c52e380aa8d347ca Mon Sep 17 00:00:00 2001
From: Michael Tryby <tryby.michael@epa.gov>
Date: Wed, 10 Apr 2019 16:17:36 -0400
Subject: [PATCH] Fixing indent

---
 src/util/list.c          | 20 +++++++++----------
 tests/util/test_list.cpp | 43 ++++++++++++++++++++--------------------
 2 files changed, 31 insertions(+), 32 deletions(-)

diff --git a/src/util/list.c b/src/util/list.c
index 96d4ad7..237ec1a 100644
--- a/src/util/list.c
+++ b/src/util/list.c
@@ -28,17 +28,17 @@
 
 
 typedef struct list_node_s {
-	void *data;
-	list_node_t *next;
+    void *data;
+    list_node_t *next;
 } list_node_t;
 
 
 typedef struct list_s {
-	int logicalLength;
-	size_t elementSize;
-	list_node_t *head;
-	list_node_t *tail;
-	freeFunction freeFn;
+    int logicalLength;
+    size_t elementSize;
+    list_node_t *head;
+    list_node_t *tail;
+    freeFunction freeFn;
 } list_t;
 
 
@@ -111,7 +111,7 @@ void for_each_list(list_t *list, listIterator iterator)
 {
     assert(iterator != NULL);
 
-	list_node_t *node = list->head;
+    list_node_t *node = list->head;
     bool result = true;
     while(node != NULL && result) {
         result = iterator(node->data);
@@ -126,7 +126,7 @@ void *head_list(list_t *list, bool removeFromList)
 {
     assert(list->head != NULL);
 
-	list_node_t *node = list->head;
+    list_node_t *node = list->head;
     // Allocating and copying pointer to node data
     void *element = (void *)malloc(list->elementSize);
     memcpy(element, node->data, list->elementSize);
@@ -152,7 +152,7 @@ void *tail_list(list_t *list)
 {
     assert(list->tail != NULL);
 
-	list_node_t *node = list->tail;
+    list_node_t *node = list->tail;
     // Allocating and copying pointer to node data
     void *element = (void *)malloc(list->elementSize);
     memcpy(element, node->data, list->elementSize);
diff --git a/tests/util/test_list.cpp b/tests/util/test_list.cpp
index 89ee0c4..33bcd01 100644
--- a/tests/util/test_list.cpp
+++ b/tests/util/test_list.cpp
@@ -130,15 +130,15 @@ BOOST_FIXTURE_TEST_CASE(test_tail_list, FixtureStrings) {
 
 
 typedef struct test_data_s {
-  int    num;
-  char   *name;
+    int    num;
+    char   *name;
 } test_data_t;
 
 test_data_t *create_test_data(int number, char *name){
 
     test_data_t *data = (test_data_t *)malloc(sizeof(test_data_t));
     data->num = number;
-	if (name)
+    if (name)
         data->name = _strdup(name);
     else
         data->name = NULL;
@@ -147,43 +147,42 @@ test_data_t *create_test_data(int number, char *name){
 }
 
 void delete_test_data(void *data) {
-	
-	test_data_t *test_data = *(test_data_t **)data;
+
+    test_data_t *test_data = *(test_data_t **)data;
 
     if (test_data->name)
         free(test_data->name);
-	
+
 	free(test_data);
 }
 
 bool iterate_test_data(void *data)
 {
-	test_data_t *test_data = *(test_data_t **)data;
+    test_data_t *test_data = *(test_data_t **)data;
 
-	printf("Found number: %i name: %s\n", 
-		test_data->num, test_data->name);
-	return true;
+    printf("Found number: %i name: %s\n", test_data->num, test_data->name);
+    return true;
 }
 
 BOOST_AUTO_TEST_CASE(test_struct_list){
-	
-	list_t *list = NULL;
+
+    list_t *list = NULL;
     list = create_list(sizeof(test_data_t *), delete_test_data);
 
 
-	test_data_t *data = create_test_data(1, "David");
-	append_list(list, &data);
+    test_data_t *data = create_test_data(1, "David");
+    append_list(list, &data);
 
-	data = create_test_data(2, "Kevin");
-	append_list(list, &data);
-	
-	data = create_test_data(3, "Michael");
-	append_list(list, &data);
+    data = create_test_data(2, "Kevin");
+    append_list(list, &data);
 
-    
-	BOOST_CHECK(size_list(list) == 3);
+    data = create_test_data(3, "Michael");
+    append_list(list, &data);
 
-	for_each_list(list, iterate_test_data);
+
+    BOOST_CHECK(size_list(list) == 3);
+
+    for_each_list(list, iterate_test_data);
 
     delete_list(list);
 }