2010-10-27 19:51:49 +02:00
|
|
|
/*
|
2011-03-05 13:44:21 +01:00
|
|
|
* This software is licensed under the terms of the MIT-License
|
|
|
|
* See COPYING for further information.
|
|
|
|
* ---
|
|
|
|
* Copyright (C) 2011, Lukas Weber <laochailan@web.de>
|
2010-10-27 19:51:49 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "list.h"
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
2010-11-28 12:54:13 +01:00
|
|
|
#include <stdio.h>
|
2010-10-27 19:51:49 +02:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
void *next;
|
|
|
|
void *prev;
|
|
|
|
} List;
|
|
|
|
|
|
|
|
void *create_element(void **dest, int size) {
|
|
|
|
void *last = *dest;
|
|
|
|
void *e = malloc(size);
|
|
|
|
|
|
|
|
if(last != NULL) {
|
|
|
|
while(((List *)last)->next != NULL)
|
|
|
|
last = ((List *)last)->next;
|
|
|
|
((List *)last)->next = e;
|
|
|
|
} else {
|
|
|
|
*dest = e;
|
|
|
|
}
|
|
|
|
|
|
|
|
((List *)e)->prev = last;
|
|
|
|
((List *)e)->next = NULL;
|
|
|
|
|
|
|
|
return e;
|
|
|
|
}
|
|
|
|
|
2011-04-26 22:39:50 +02:00
|
|
|
void delete_element(void **dest, void *e) {
|
2010-10-27 19:51:49 +02:00
|
|
|
if(((List *)e)->prev != NULL)
|
|
|
|
((List *)((List *)e)->prev)->next = ((List *)e)->next;
|
|
|
|
if(((List *)e)->next != NULL)
|
|
|
|
((List *)((List *)e)->next)->prev = ((List *)e)->prev;
|
|
|
|
if(*dest == e)
|
|
|
|
*dest = ((List *)e)->next;
|
|
|
|
|
|
|
|
free(e);
|
|
|
|
}
|
|
|
|
|
2011-05-08 13:48:25 +02:00
|
|
|
void delete_all_elements(void **dest, void (callback)(void **, void *)) {
|
2010-10-27 19:51:49 +02:00
|
|
|
void *e = *dest;
|
|
|
|
void *tmp;
|
|
|
|
|
|
|
|
while(e != 0) {
|
|
|
|
tmp = e;
|
|
|
|
e = ((List *)e)->next;
|
2011-04-26 22:39:50 +02:00
|
|
|
callback(dest, tmp);
|
2010-10-27 19:51:49 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
*dest = NULL;
|
2010-11-14 13:24:56 +01:00
|
|
|
}
|