1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/* ########################################################### */
/* This Software is licensed under the GPL licensed Version 2, */
/* please read http://www.gnu.org/copyleft/gpl.html */
/* ########################################################### */
#ifndef LIST_H
#define LIST_H
typedef struct ll_node_s ll_node_t;
typedef struct ll_s ll_t;
/* ******************************* */
/* Linked list specific structures */
/* ******************************* */
/* Linked list node structure */
/* """""""""""""""""""""""""" */
struct ll_node_s
{
void * data;
struct ll_node_s * next;
struct ll_node_s * prev;
};
/* Linked List structure */
/* """"""""""""""""""""" */
struct ll_s
{
ll_node_t * head;
ll_node_t * tail;
long len;
};
void
ll_append(ll_t * const list, void * const data);
#if 0
void
ll_prepend(ll_t * const list, void * const data);
#endif
#if 0
void
ll_insert_before(ll_t * const list, ll_node_t * node, void * const data);
#endif
#if 0
void
ll_insert_after(ll_t * const list, ll_node_t * node, void * const data);
#endif
void
ll_quicksort(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
void (*swap)(void * a, void *));
void
ll_sort(ll_t * list, int (*comp)(void *, void *),
void (*swap)(void * a, void *));
int
ll_delete(ll_t * const list, ll_node_t * node);
ll_node_t *
ll_find(ll_t * const, void * const, int (*)(const void *, const void *));
void
ll_init(ll_t * list);
ll_node_t *
ll_new_node(void);
ll_t *
ll_new(void);
#endif
|
