| 1 | #include <stdlib.h> |
| 2 | |
| 3 | int main(int argc, char** argv) |
| 4 | { |
| 5 | //file ./t.Vector.c : |
| 6 | t_vector_clear(); |
| 7 | t_vector_size(); |
| 8 | t_vector_push_pop_basic(); |
| 9 | t_vector_push_pop_evolved(); |
| 10 | t_vector_copy(); |
| 11 | |
| 12 | //file ./t.BufferTop.c : |
| 13 | t_buffertop_clear(); |
| 14 | t_buffertop_size(); |
| 15 | t_buffertop_push_pop_basic(); |
| 16 | t_buffertop_push_pop_evolved(); |
| 17 | t_buffertop_copy(); |
| 18 | |
| 19 | //file ./t.Tree.c : |
| 20 | t_tree_clear(); |
| 21 | t_tree_size(); |
| 22 | t_tree_add_remove(); |
| 23 | t_tree_iterate(); |
| 24 | t_tree_copy(); |
| 25 | |
| 26 | //file ./t.Heap.c : |
| 27 | t_heap_clear(); |
| 28 | t_heap_size(); |
| 29 | t_heap_push_pop_basic(); |
| 30 | t_heap_push_pop_evolved(); |
| 31 | t_heap_copy(); |
| 32 | |
| 33 | //file ./t.List.c : |
| 34 | t_list_clear(); |
| 35 | t_list_size(); |
| 36 | t_list_push_pop_basic(); |
| 37 | t_list_push_pop_evolved(); |
| 38 | t_list_copy(); |
| 39 | |
| 40 | //file ./t.Queue.c : |
| 41 | t_queue_clear(); |
| 42 | t_queue_size(); |
| 43 | t_queue_push_pop_basic(); |
| 44 | t_queue_push_pop_evolved(); |
| 45 | t_queue_copy(); |
| 46 | |
| 47 | //file ./t.Stack.c : |
| 48 | t_stack_clear(); |
| 49 | t_stack_size(); |
| 50 | t_stack_push_pop_basic(); |
| 51 | t_stack_push_pop_evolved(); |
| 52 | t_stack_copy(); |
| 53 | |
| 54 | //file ./t.PriorityQueue.c : |
| 55 | t_priorityqueue_clear(); |
| 56 | t_priorityqueue_size(); |
| 57 | t_priorityqueue_push_pop_basic(); |
| 58 | t_priorityqueue_push_pop_evolved(); |
| 59 | t_priorityqueue_copy(); |
| 60 | |
| 61 | return 0; |
| 62 | } |