modify list_t by adding macro to create list of any structs
This commit is contained in:
@@ -1,19 +1,10 @@
|
||||
|
||||
#include "list_t/list_t.h"
|
||||
|
||||
#if 0
|
||||
|
||||
#define GEN_LIST_ALL(type)\
|
||||
/*struct list_##type {\
|
||||
type value;\
|
||||
struct list_##type *preview;\
|
||||
struct list_##type *next;\
|
||||
};\
|
||||
struct main_list_##type {\
|
||||
struct list_##type *begin_list;\
|
||||
struct list_##type *current_list;\
|
||||
size_t current_index;\
|
||||
struct list_##type *end_list;\
|
||||
size_t size;\
|
||||
};*/\
|
||||
\
|
||||
struct main_list_##type *create_var_list_##type(){\
|
||||
struct main_list_##type *ret_var_list = malloc(sizeof(struct main_list_##type));\
|
||||
ret_var_list->begin_list = NULL;\
|
||||
@@ -142,7 +133,7 @@
|
||||
--(var_list->current_index);\
|
||||
}\
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
GEN_LIST_ALL(TYPE_CHAR)
|
||||
GEN_LIST_ALL(TYPE_U_CHAR)
|
||||
|
||||
@@ -44,4 +44,144 @@ GENERATE_LIST_ALL(TYPE_STRING)
|
||||
GENERATE_LIST_ALL(TYPE_PTR)
|
||||
|
||||
|
||||
|
||||
|
||||
#define GEN_LIST_ALL(type)\
|
||||
\
|
||||
struct main_list_##type *create_var_list_##type(){\
|
||||
struct main_list_##type *ret_var_list = malloc(sizeof(struct main_list_##type));\
|
||||
ret_var_list->begin_list = NULL;\
|
||||
ret_var_list->end_list = NULL;\
|
||||
ret_var_list->current_list = NULL;\
|
||||
ret_var_list->current_index = 0;\
|
||||
ret_var_list->size = 0;\
|
||||
return ret_var_list;\
|
||||
}\
|
||||
void push_back_list_##type(struct main_list_##type *var_list, type value){\
|
||||
struct list_##type * list_to_add = malloc(sizeof(struct list_##type));\
|
||||
list_to_add->value = value;\
|
||||
list_to_add->preview = var_list->end_list;\
|
||||
list_to_add->next = NULL;\
|
||||
if(var_list->end_list){\
|
||||
(var_list->end_list)->next = list_to_add;\
|
||||
}else {\
|
||||
var_list->begin_list = list_to_add;\
|
||||
var_list->current_list= list_to_add;\
|
||||
}\
|
||||
var_list->end_list = list_to_add;\
|
||||
++(var_list->size);\
|
||||
}\
|
||||
void push_front_list_##type(struct main_list_##type *var_list, type value){\
|
||||
struct list_##type * list_to_add = malloc(sizeof(struct list_##type));\
|
||||
list_to_add->value = value;\
|
||||
list_to_add->preview = NULL;\
|
||||
list_to_add->next = var_list->begin_list;\
|
||||
if(var_list->begin_list){\
|
||||
(var_list->begin_list)->preview = list_to_add;\
|
||||
++(var_list->current_index);\
|
||||
}else {\
|
||||
var_list->end_list = list_to_add;\
|
||||
var_list->current_list= list_to_add;\
|
||||
}\
|
||||
var_list->begin_list = list_to_add;\
|
||||
++(var_list->size);\
|
||||
}\
|
||||
size_t move_current_to_index_list_##type(struct main_list_##type *var_list, size_t index){\
|
||||
if(index == var_list->current_index) return index;\
|
||||
if(var_list->begin_list == NULL) return 0;\
|
||||
if(index >= var_list->size){\
|
||||
var_list->current_list = var_list->end_list;\
|
||||
var_list->current_index = var_list->size - 1;\
|
||||
return var_list->size - 1;\
|
||||
}\
|
||||
if((var_list->current_index >= var_list->size) || !(var_list->current_list)){\
|
||||
var_list->current_list = var_list->end_list;\
|
||||
var_list->current_index = var_list->size - 1;\
|
||||
}\
|
||||
long from_current_index = var_list->current_index - index; \
|
||||
size_t abs_cur_diff = abs(from_current_index); \
|
||||
size_t array_diff_index[3] = {index, abs_cur_diff , var_list->size - 1 - index}; \
|
||||
size_t index_nearest = ARG_MIN_ARRAY_TYPE_SIZE_T(array_diff_index, 3);\
|
||||
if(index_nearest == 0){\
|
||||
var_list->current_list = var_list->begin_list;\
|
||||
for(size_t i=0; i<array_diff_index[0]; ++i) var_list->current_list = (var_list->current_list)->next; \
|
||||
}\
|
||||
else if(index_nearest == 2){\
|
||||
var_list->current_list = var_list->end_list;\
|
||||
for(size_t i=0; i < array_diff_index[0]; ++i) var_list->current_list = (var_list->current_list)->preview; \
|
||||
}else if(from_current_index >= 0) \
|
||||
for(size_t i=0; i < array_diff_index[1]; ++i) var_list->current_list = (var_list->current_list)->preview; \
|
||||
else \
|
||||
for(size_t i=0; i < array_diff_index[1]; ++i) var_list->current_list = (var_list->current_list)->next; \
|
||||
\
|
||||
var_list->current_index = index;\
|
||||
return index;\
|
||||
}\
|
||||
void insert_into_list_##type(struct main_list_##type *var_list, size_t index, type value ){\
|
||||
struct list_##type * list_to_add = malloc(sizeof(struct list_##type));\
|
||||
list_to_add->value = value;\
|
||||
if(var_list->begin_list == NULL){\
|
||||
list_to_add->preview = NULL;\
|
||||
list_to_add->next = NULL;\
|
||||
var_list->begin_list = list_to_add;\
|
||||
var_list->end_list = list_to_add;\
|
||||
var_list->current_list = list_to_add;\
|
||||
var_list->current_index = 0;\
|
||||
\
|
||||
}else {\
|
||||
size_t ii = move_current_to_index_list_##type(var_list, index);\
|
||||
if(index > ii)\
|
||||
printf("%ld out of range, we put the value at %ld index of the list \n",index, ii);\
|
||||
if(var_list->current_list){\
|
||||
list_to_add->preview = (var_list->current_list)->preview;\
|
||||
list_to_add->next = var_list->current_list;\
|
||||
if(list_to_add->preview)\
|
||||
(list_to_add->preview)->next = list_to_add;\
|
||||
else var_list->begin_list = list_to_add;\
|
||||
(var_list->current_list)->preview = list_to_add;\
|
||||
var_list->current_list = list_to_add;\
|
||||
}\
|
||||
}\
|
||||
++(var_list->size);\
|
||||
}\
|
||||
void remove_index_from_list_##type(struct main_list_##type *var_list, size_t index ){\
|
||||
if( index == move_current_to_index_list_##type(var_list, index)) {\
|
||||
struct list_##type * list_tmp_prev = (var_list->current_list)->preview;\
|
||||
struct list_##type * list_tmp_next = (var_list->current_list)->next;\
|
||||
if(list_tmp_prev){\
|
||||
list_tmp_prev->next = list_tmp_next;\
|
||||
if(list_tmp_next) list_tmp_next->preview = list_tmp_prev;\
|
||||
}\
|
||||
free(var_list->current_list);\
|
||||
var_list->current_list = list_tmp_next;\
|
||||
--(var_list->size);\
|
||||
\
|
||||
}\
|
||||
}\
|
||||
void free_all_var_list_##type(struct main_list_##type *var_list){\
|
||||
struct list_##type *tmp = var_list->begin_list;\
|
||||
while(tmp){\
|
||||
var_list->current_list = tmp;\
|
||||
tmp = tmp->next;\
|
||||
free(var_list->current_list);\
|
||||
}\
|
||||
free(var_list);\
|
||||
}\
|
||||
void increment_list_##type(struct main_list_##type * var_list){\
|
||||
var_list->current_list = (var_list->current_list)->next;\
|
||||
++(var_list->current_index);\
|
||||
}\
|
||||
void decrement_list_##type(struct main_list_##type * var_list){\
|
||||
var_list->current_list = (var_list->current_list)->preview;\
|
||||
--(var_list->current_index);\
|
||||
}\
|
||||
|
||||
|
||||
|
||||
#define LIST_T(type) \
|
||||
GENERATE_LIST_ALL(type)\
|
||||
GEN_LIST_ALL(type)
|
||||
|
||||
|
||||
#endif /* __LIST_T_C__H */
|
||||
|
||||
|
||||
@@ -74,6 +74,99 @@ TEST(remove){
|
||||
|
||||
}
|
||||
|
||||
/*
|
||||
struct test_c {
|
||||
int value;
|
||||
double *Q;
|
||||
};
|
||||
|
||||
*/
|
||||
|
||||
//#include "test_c.c"
|
||||
|
||||
struct test_c {
|
||||
int value;
|
||||
double *Q;
|
||||
};
|
||||
|
||||
typedef struct test_c test_c;
|
||||
|
||||
//GEN_LIST_ALL(test_c);
|
||||
|
||||
//GENERATE_LIST_ALL(test_c);
|
||||
|
||||
TEST(list_TYPE_PTR){
|
||||
struct main_list_TYPE_PTR * var_list_ptr = create_var_list_TYPE_PTR();
|
||||
|
||||
test_c * t0 = malloc(sizeof(test_c));
|
||||
test_c * t1 = malloc(sizeof(test_c));
|
||||
test_c * t2 = malloc(sizeof(test_c));
|
||||
|
||||
t0->value = 0;
|
||||
t1->value = 1;
|
||||
t2->value = 2;
|
||||
|
||||
push_back_list_TYPE_PTR(var_list_ptr,t0);
|
||||
push_back_list_TYPE_PTR(var_list_ptr,t1);
|
||||
push_back_list_TYPE_PTR(var_list_ptr,t2);
|
||||
|
||||
for(move_current_to_index_list_TYPE_PTR(var_list_ptr, 0); var_list_ptr->current_list; increment_list_TYPE_PTR(var_list_ptr))
|
||||
LOG("cur %ld : %d : size :%ld \n", var_list_ptr->current_index, ((test_c*)((var_list_ptr->current_list)->value))->value, var_list_ptr->size);
|
||||
|
||||
|
||||
free_all_var_list_TYPE_PTR(var_list_ptr);
|
||||
|
||||
}
|
||||
|
||||
LIST_T(test_c)
|
||||
|
||||
TEST(list_struct_test_c){
|
||||
struct main_list_test_c * var_list_ptr = create_var_list_test_c();
|
||||
|
||||
test_c t0, t1, t2;
|
||||
|
||||
t0.value = 0;
|
||||
t1.value = 1;
|
||||
t2.value = 2;
|
||||
|
||||
push_back_list_test_c(var_list_ptr,t0);
|
||||
push_back_list_test_c(var_list_ptr,t1);
|
||||
push_back_list_test_c(var_list_ptr,t2);
|
||||
|
||||
for(move_current_to_index_list_test_c(var_list_ptr, 0); var_list_ptr->current_list; increment_list_test_c(var_list_ptr))
|
||||
LOG("cur %ld : %d : size :%ld \n", var_list_ptr->current_index, ((var_list_ptr->current_list)->value).value, var_list_ptr->size);
|
||||
|
||||
|
||||
free_all_var_list_test_c(var_list_ptr);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
/*
|
||||
TEST(list_struct_test_c){
|
||||
struct main_list_TYPE_PTR * var_list_ptr = create_var_list_TYPE_PTR();
|
||||
|
||||
test_c * t0 = malloc(sizeof(test_c));
|
||||
test_c * t1 = malloc(sizeof(test_c));
|
||||
test_c * t2 = malloc(sizeof(test_c));
|
||||
|
||||
t0->value = 0;
|
||||
t1->value = 1;
|
||||
t2->value = 2;
|
||||
|
||||
push_back_list_TYPE_PTR(var_list_ptr,t0);
|
||||
push_back_list_TYPE_PTR(var_list_ptr,t1);
|
||||
push_back_list_TYPE_PTR(var_list_ptr,t2);
|
||||
|
||||
for(move_current_to_index_list_TYPE_PTR(var_list_ptr, 0); var_list_ptr->current_list; increment_list_TYPE_PTR(var_list_ptr))
|
||||
LOG("cur %ld : %d : size :%ld \n", var_list_ptr->current_index, ((test_c*)((var_list_ptr->current_list)->value))->value, var_list_ptr->size);
|
||||
|
||||
|
||||
free_all_var_list_TYPE_PTR(var_list_ptr);
|
||||
|
||||
}
|
||||
*/
|
||||
|
||||
int main(int argc, char **argv){
|
||||
|
||||
|
||||
Reference in New Issue
Block a user