From 4029c99123c240d6e26505940cb5d2be10f9ef2a Mon Sep 17 00:00:00 2001 From: Benjamin Auder Date: Fri, 15 May 2015 11:17:47 +0200 Subject: [PATCH] remove FTEST marker in test files --- test/t.BufferTop.c | 10 +++++----- test/t.Heap.c | 10 +++++----- test/t.List.c | 10 +++++----- test/t.PriorityQueue.c | 10 +++++----- test/t.Queue.c | 10 +++++----- test/t.Stack.c | 10 +++++----- test/t.Tree.c | 10 +++++----- test/t.Vector.c | 10 +++++----- 8 files changed, 40 insertions(+), 40 deletions(-) diff --git a/test/t.BufferTop.c b/test/t.BufferTop.c index f022d13..17492c6 100644 --- a/test/t.BufferTop.c +++ b/test/t.BufferTop.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_buffertop_clear() //FTEST +void t_buffertop_clear() { BufferTop* bt = buffertop_new(int, 10, MIN_T, 2); @@ -19,7 +19,7 @@ void t_buffertop_clear() //FTEST buffertop_destroy(bt); } -void t_buffertop_size() //FTEST +void t_buffertop_size() { BufferTop* bt = buffertop_new(double, 10, MAX_T, 3); @@ -55,7 +55,7 @@ void t_buffertop_size() //FTEST buffertop_destroy(bt); } -void t_buffertop_push_pop_basic() //FTEST +void t_buffertop_push_pop_basic() { BufferTop* bt = buffertop_new(int, 5, MIN_T, 3); @@ -89,7 +89,7 @@ void t_buffertop_push_pop_basic() //FTEST buffertop_destroy(bt); } -void t_buffertop_push_pop_evolved() //FTEST +void t_buffertop_push_pop_evolved() { int n = 10; @@ -136,7 +136,7 @@ void t_buffertop_push_pop_evolved() //FTEST buffertop_destroy(bt); } -void t_buffertop_copy() //FTEST +void t_buffertop_copy() { int n = 10; diff --git a/test/t.Heap.c b/test/t.Heap.c index 41c0805..e3d6bbc 100644 --- a/test/t.Heap.c +++ b/test/t.Heap.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_heap_clear() //FTEST +void t_heap_clear() { Heap* h = heap_new(int, MIN_T, 2); @@ -19,7 +19,7 @@ void t_heap_clear() //FTEST heap_destroy(h); } -void t_heap_size() //FTEST +void t_heap_size() { Heap* h = heap_new(double, MAX_T, 3); @@ -40,7 +40,7 @@ void t_heap_size() //FTEST heap_destroy(h); } -void t_heap_push_pop_basic() //FTEST +void t_heap_push_pop_basic() { Heap* h = heap_new(int, MIN_T, 3); @@ -101,7 +101,7 @@ void t_heap_push_pop_basic() //FTEST heap_destroy(h); } -void t_heap_push_pop_evolved() //FTEST +void t_heap_push_pop_evolved() { int n = 10; @@ -148,7 +148,7 @@ void t_heap_push_pop_evolved() //FTEST heap_destroy(h); } -void t_heap_copy() //FTEST +void t_heap_copy() { int n = 10; diff --git a/test/t.List.c b/test/t.List.c index b5da4da..51a83b3 100644 --- a/test/t.List.c +++ b/test/t.List.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_list_clear() //FTEST +void t_list_clear() { List* L = list_new(int); @@ -17,7 +17,7 @@ void t_list_clear() //FTEST list_destroy(L); } -void t_list_size() //FTEST +void t_list_size() { List* L = list_new(double); @@ -51,7 +51,7 @@ void t_list_size() //FTEST list_destroy(L); } -void t_list_push_pop_basic() //FTEST +void t_list_push_pop_basic() { int n = 10; @@ -84,7 +84,7 @@ void t_list_push_pop_basic() //FTEST listI_destroy(li); } -void t_list_push_pop_evolved() //FTEST +void t_list_push_pop_evolved() { int n = 10; @@ -134,7 +134,7 @@ void t_list_push_pop_evolved() //FTEST list_destroy(L); } -void t_list_copy() //FTEST +void t_list_copy() { int n = 10; diff --git a/test/t.PriorityQueue.c b/test/t.PriorityQueue.c index e4f2a75..66417e5 100644 --- a/test/t.PriorityQueue.c +++ b/test/t.PriorityQueue.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_priorityqueue_clear() //FTEST +void t_priorityqueue_clear() { PriorityQueue* pq = priorityqueue_new(int, MIN_T, 2); @@ -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; diff --git a/test/t.Queue.c b/test/t.Queue.c index cb86b9d..bf095c7 100644 --- a/test/t.Queue.c +++ b/test/t.Queue.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/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,7 +38,7 @@ void t_queue_size() //FTEST queue_destroy(q); } -void t_queue_push_pop_basic() //FTEST +void t_queue_push_pop_basic() { int n = 10; @@ -60,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; @@ -107,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; diff --git a/test/t.Stack.c b/test/t.Stack.c index bb879f9..5b99b4f 100644 --- a/test/t.Stack.c +++ b/test/t.Stack.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_stack_clear() //FTEST +void t_stack_clear() { Stack* s = stack_new(int); @@ -17,7 +17,7 @@ void t_stack_clear() //FTEST stack_destroy(s); } -void t_stack_size() //FTEST +void t_stack_size() { Stack* s = stack_new(int); @@ -38,7 +38,7 @@ void t_stack_size() //FTEST stack_destroy(s); } -void t_stack_push_pop_basic() //FTEST +void t_stack_push_pop_basic() { int n = 10; @@ -61,7 +61,7 @@ void t_stack_push_pop_basic() //FTEST stack_destroy(s); } -void t_stack_push_pop_evolved() //FTEST +void t_stack_push_pop_evolved() { Stack* s = stack_new(StructTest1); @@ -108,7 +108,7 @@ void t_stack_push_pop_evolved() //FTEST stack_destroy(s); } -void t_stack_copy() //FTEST +void t_stack_copy() { int n = 10; diff --git a/test/t.Tree.c b/test/t.Tree.c index 481508a..131ba15 100644 --- a/test/t.Tree.c +++ b/test/t.Tree.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_tree_clear() //FTEST +void t_tree_clear() { Tree* t = tree_new(int); @@ -24,7 +24,7 @@ void t_tree_clear() //FTEST tree_destroy(t); } -void t_tree_size() //FTEST +void t_tree_size() { Tree* t = tree_new(int); @@ -47,7 +47,7 @@ void t_tree_size() //FTEST tree_destroy(t); } -void t_tree_add_remove() //FTEST +void t_tree_add_remove() { Tree* t = tree_new(int); @@ -74,7 +74,7 @@ void t_tree_add_remove() //FTEST tree_destroy(t); } -void t_tree_iterate() //FTEST +void t_tree_iterate() { Tree* t = tree_new(int); @@ -103,7 +103,7 @@ void t_tree_iterate() //FTEST tree_destroy(t); } -void t_tree_copy() //FTEST +void t_tree_copy() { Tree* t = tree_new(int); diff --git a/test/t.Vector.c b/test/t.Vector.c index aa88c3a..8eb32bd 100644 --- a/test/t.Vector.c +++ b/test/t.Vector.c @@ -3,7 +3,7 @@ #include "test/helpers.h" #include "test/lut.h" -void t_vector_clear() //FTEST +void t_vector_clear() { Vector* v = vector_new(int); lu_assert(vector_empty(v)); @@ -25,7 +25,7 @@ void t_vector_clear() //FTEST vector_destroy(v); } -void t_vector_size() //FTEST +void t_vector_size() { Vector* v = vector_new(int); lu_assert(vector_empty(v)); @@ -47,7 +47,7 @@ void t_vector_size() //FTEST vector_destroy(v); } -void t_vector_push_pop_basic() //FTEST +void t_vector_push_pop_basic() { int n = 10; @@ -80,7 +80,7 @@ void t_vector_push_pop_basic() //FTEST vectorI_destroy(vi); } -void t_vector_push_pop_evolved() //FTEST +void t_vector_push_pop_evolved() { int n = 10; @@ -126,7 +126,7 @@ void t_vector_push_pop_evolved() //FTEST vector_destroy(v); } -void t_vector_copy() //FTEST +void t_vector_copy() { int n = 10; -- 2.44.0