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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/* Standard C */
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
/* Project */
#include "util.h"
/* --8<-- list_tail_type */
typedef int T;
struct list_node {
struct list_node *next;
T data;
};
struct list {
struct list_node *head, *tail;
};
/* -->8-- */
/* --8<-- list_tail_init */
void
list_init(struct list *list)
{
list->head = NULL;
}
/* -->8-- */
/* --8<-- list_tail_create_node */
static struct list_node *
create_node(struct list_node *next, T data)
{
struct list_node *node = malloc(sizeof *node);
if ( node != NULL ) {
node->next = next;
node->data = data;
}
return node;
}
/* -->8-- */
/* --8<-- list_tail_push_back */
void
list_push_back(struct list *list, T data)
{
struct list_node *node = create_node(NULL, data);
if ( node != NULL ) {
if ( list->head == NULL ) {
list->head = node;
}
else {
list->tail->next = node;
}
list->tail = node;
}
else {
ERROR("out of memory");
}
}
/* -->8-- */
/* --8<-- list_tail_front */
void
list_push_front(struct list *list, T data)
{
struct list_node *node = create_node(list->head, data);
if ( node != NULL ) {
if ( list->head == NULL ) { // Einfügen in eine leere Liste?
list->tail = node;
}
list->head = node;
}
else {
ERROR("out of memory");
}
}
/* -->8-- */
/* --8<-- list_tail_pop_front */
bool
list_pop_front(struct list *list, T *data)
{
if ( list->head != NULL ) {
struct list_node *next = list->head->next;
if ( data != NULL ) {
*data = list->head->data;
}
free(list->head);
list->head = next;
return true;
}
else {
return false;
}
}
/* -->8-- */
/* --8<-- list_tail_insert_next */
void
list_insert_next(struct list *list, struct list_node *node, T data)
{
if ( node == NULL ) { // Am Anfang einfügen
list_push_front(list, data);
}
else {
struct list_node *new_node = create_node(node->next, data);
if ( new_node != NULL ) {
if ( node->next == NULL ) { // Am Ende einfügen
list->tail = new_node;
}
node->next = new_node;
}
else {
ERROR("out of memory");
}
}
}
/* -->8-- */
/* --8<-- list_tail_delete_next */
void
list_delete_next(struct list *list, struct list_node *node, T *data)
{
if ( node == NULL ) { // Am Anfang entfernen
list_pop_front(list, data);
}
else {
if ( node->next != NULL ) {
struct list_node *old_node = node->next;
node->next = node->next->next;
if ( node->next == NULL ) {
list->tail = node;
}
if ( data != NULL ) {
*data = old_node->data;
}
free(old_node);
}
}
}
/* -->8-- */
/* --8<-- list_tail_empty */
bool
list_empty(struct list *list)
{
return list->head == NULL;
}
/* -->8-- */
/* --8<-- list_tail_free */
void
list_free(struct list *list)
{
struct list_node *item, *next;
for ( item = list->head; item; item = next ) {
next = item->next;
free(item);
}
}
/* -->8-- */
int
main()
{
struct list list[1];
list_init(list);
for ( int i = 0; i != 10; ++i )
list_push_front(list, -i);
for ( int i = 0; i != 10; ++i )
list_push_back(list, i);
while ( !list_empty(list) ) {
int i;
if ( list_pop_front(list, &i) )
printf("%d\n", i);
else
ERROR("this shouldn't happen!");
}
list_free(list);
return EXIT_SUCCESS;
}
|
