Implement HashTable + fix some extra blank spaces, remove Bool type (using bool ...

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

diff --git a/test/t.PriorityQueue.c b/test/t.PriorityQueue.c
index e4f2a75..8cabc1e 100644 (file)
--- a/test/t.PriorityQueue.c
+++ b/test/t.PriorityQueue.c
@@ -1,13 +1,13 @@
 #include <stdlib.h>
 #include "cgds/PriorityQueue.h"
-#include "test/helpers.h"
-#include "test/lut.h"
+#include "helpers.h"
+#include "lut.h"
 
-void t_priorityqueue_clear() //FTEST
+void t_priorityqueue_clear()
 {
        PriorityQueue* pq = priorityqueue_new(int, MIN_T, 2);
 
-       // NOTE: items with same priorities are supported; 
+       // NOTE: items with same priorities are supported;
        // since it is unused in this test, we arbitrarily choose 0.0
        priorityqueue_insert(pq, 0, 0.0);
        priorityqueue_insert(pq, 0, 0.0);
@@ -19,7 +19,7 @@ void t_priorityqueue_clear() //FTEST
        priorityqueue_destroy(pq);
 }
 
-void t_priorityqueue_size() //FTEST
+void t_priorityqueue_size()
 {
        PriorityQueue* pq = priorityqueue_new(double, MAX_T, 3);
 
@@ -40,7 +40,7 @@ void t_priorityqueue_size() //FTEST
        priorityqueue_destroy(pq);
 }
 
-void t_priorityqueue_push_pop_basic() //FTEST
+void t_priorityqueue_push_pop_basic()
 {
        PriorityQueue* pq = priorityqueue_new(int, MIN_T, 3);
 
@@ -101,7 +101,7 @@ void t_priorityqueue_push_pop_basic() //FTEST
        priorityqueue_destroy(pq);
 }
 
-void t_priorityqueue_push_pop_evolved() //FTEST
+void t_priorityqueue_push_pop_evolved()
 {
        int n = 10;
 
@@ -148,7 +148,7 @@ void t_priorityqueue_push_pop_evolved() //FTEST
        priorityqueue_destroy(pq);
 }
 
-void t_priorityqueue_copy() //FTEST
+void t_priorityqueue_copy()
 {
        int n = 10;