Simplify installation procedure

[cgds.git] / test / t.Queue.c

diff --git a/test/t.Queue.c b/test/t.Queue.c
index 6141dd0..a393da2 100644 (file)
--- a/test/t.Queue.c
+++ b/test/t.Queue.c
@@ -1,9 +1,9 @@
 #include <stdlib.h>
 #include "cgds/Queue.h"
-#include "test/helpers.h"
-#include "test/lut.h"
+#include "helpers.h"
+#include "lut.h"
 
-void t_queue_clear() //FTEST
+void t_queue_clear()
 {
        Queue* q = queue_new(int);
 
@@ -17,7 +17,7 @@ void t_queue_clear() //FTEST
        queue_destroy(q);
 }
 
-void t_queue_size() //FTEST
+void t_queue_size()
 {
        Queue* q = queue_new(int);
 
@@ -38,12 +38,13 @@ void t_queue_size() //FTEST
        queue_destroy(q);
 }
 
-void t_queue_push_pop_basic() //FTEST
+void t_queue_push_pop_basic()
 {
        int n = 10;
 
        Queue* q = queue_new(double);
-       for (int i = 0; i < n; i++) queue_push(q, (double) i);
+       for (int i = 0; i < n; i++) 
+               queue_push(q, (double) i);
        // iterate and check values
        double ckValue = 0.0;
        while (!queue_empty(q))
@@ -59,7 +60,7 @@ void t_queue_push_pop_basic() //FTEST
        queue_destroy(q);
 }
 
-void t_queue_push_pop_evolved() //FTEST
+void t_queue_push_pop_evolved()
 {
        int n = 10;
 
@@ -106,7 +107,7 @@ void t_queue_push_pop_evolved() //FTEST
        queue_destroy(q);
 }
 
-void t_queue_copy() //FTEST
+void t_queue_copy()
 {
        int n = 10;
 
@@ -115,7 +116,7 @@ void t_queue_copy() //FTEST
                queue_push(q, rand() % 42);
        Queue* qc = queue_copy(q);
 
-       lu_assert_int_eq(q->size, qc->size);
+       lu_assert_int_eq(queue_size(q), queue_size(qc));
        int a, b;
        for (int i = 0; i < n; i++)
        {