1
0
mirror of https://gitlab.com/klmp200/LO41.git synced 2024-10-31 22:18:05 +00:00
LO41/List/List.c

178 lines
3.5 KiB
C
Raw Normal View History

//
// Created by Antoine Bartuccio on 22/05/2018.
//
#include "List.h"
GETTER(List, Element*, head)
GETTER(List, Element*, tail)
GETTER(List, int, size)
2018-06-15 09:50:38 +00:00
void set_custom_free_List(THIS(List), void (*custom_free)(void *)){
this->custom_free = custom_free;
}
Element * get_element_List(THIS(List), int index){
Element * current = NULL;
int i;
if (index < this->size){
if (index == this->size - 1)
current = this->tail;
else if (index == 0)
current = this->head;
else if (index <= (this->size - 1) / 2){
i = 0;
current = this->head;
while (i < index){
current = current->next;
i++;
}
} else {
i = this->size - 1;
current = this->tail;
while (i > index){
current = current->previous;
i--;
}
}
2018-06-15 09:50:38 +00:00
} else {
OUTSIDE_BOUNDS;
}
return current;
}
void * get_element_data_List(THIS(List), int index){
Element * el = this->get_element(this, index);
if (el != NULL)
return el->data;
return NULL;
}
void * get_head_data_List(THIS(List)){
if (this->head != NULL)
return this->head->data;
return NULL;
}
void * get_tail_data_List(THIS(List)){
if (this->tail != NULL)
return this->tail->data;
return NULL;
}
void _free__List(THIS(List)){
this->clear(this);
free(this);
}
void clear_custom_List(THIS(List), void (*custom_free)(void *)){
Element *current = this->head;
Element *to_delete = NULL;
while (current != NULL){
to_delete = current;
current = current->next;
to_delete->list = NULL;
to_delete->data_free = custom_free;
DELETE(to_delete);
}
this->head = NULL;
this->tail = NULL;
this->size = 0;
}
void clear_List(THIS(List)){
this->clear_custom(this, free);
}
void insert_tail_List(THIS(List), void * data, size_t data_size){
/* Create a new element */
Element *new_element = NEW(Element, data, data_size, this);
2018-06-15 09:50:38 +00:00
new_element->data_free = this->custom_free;
if (this->tail == NULL){
this->head = new_element;
this->tail = new_element;
} else {
new_element->previous = this->tail;
this->tail->next = new_element;
this->tail = new_element;
}
}
void insert_head_List(THIS(List), void * data, size_t data_size){
/* Create a new element */
Element *new_element = NEW(Element, data, data_size, this);
2018-06-15 09:50:38 +00:00
new_element->data_free = this->custom_free;
if (this->head != NULL)
this->head->previous = new_element;
else
this->tail = new_element;
new_element->next = this->head;
this->head = new_element;
}
void insert_inside_List(THIS(List), void * data, size_t data_size, int index){
Element *new_element = NULL;
Element *old_element = NULL;
if (index == 0)
this->insert_head(this, data, data_size);
else if (index == this->size)
this->insert_tail(this, data, data_size);
else if (index < this->size){
new_element = NEW(Element, data, data_size, this);
2018-06-15 09:50:38 +00:00
new_element->data_free = this->custom_free;
old_element = this->get_element(this, index);
new_element->previous = old_element->previous;
new_element->next = old_element;
old_element->previous->next = new_element;
old_element->previous = new_element;
2018-06-18 13:20:19 +00:00
} else {
OUTSIDE_BOUNDS;
}
}
void remove_head_List(THIS(List)){
DELETE(this->head);
}
void remove_tail_List(THIS(List)){
DELETE(this->tail);
}
List *_init_List(){
List *l = (List*) malloc_or_die(sizeof(List));
l->size = 0;
l->head = NULL;
l->tail = NULL;
2018-06-15 09:50:38 +00:00
l->custom_free = free;
LINK_ALL(List, l,
get_head,
get_tail,
get_size,
get_head_data,
get_tail_data,
get_element,
get_element_data,
2018-06-15 09:50:38 +00:00
set_custom_free,
insert_inside,
insert_tail,
insert_head,
clear_custom,
clear,
remove_head,
remove_tail
)
return l;
}