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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
|
/*
Copyright (c) 2002-2003 by Juliusz Chroboczek
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include "list.h"
int
listMember(char *elt, ListPtr list)
{
while(list != NULL) {
if(strcmp(elt, list->value) == 0)
return 1;
list = list->next;
}
return 0;
}
ListPtr
listCons(char *car, ListPtr cdr)
{
ListPtr lcar = malloc(sizeof(ListRec));
if(!lcar)
return NULL;
lcar -> value = car;
lcar -> next = cdr;
return lcar;
}
ListPtr
listAdjoin(char *car, ListPtr cdr)
{
if(listMember(car, cdr)) {
free(car);
return cdr;
}
return listCons(car, cdr);
}
char *
dsprintf(char *f, ...)
{
va_list args;
char *string;
{
int n, size = 20;
while(1) {
if(size > 4096)
return NULL;
string = malloc(size);
if(!string)
return NULL;
va_start(args, f);
n = vsnprintf(string, size, f, args);
va_end(args);
if(n >= 0 && n < size)
return string;
else if(n >= size)
size = n + 1;
else
size = size * 3 / 2 + 1;
free(string);
}
}
}
ListPtr
listConsF(ListPtr cdr, char *f, ...)
{
va_list args;
char *string;
{
int n, size = 20;
while(1) {
if(size > 4096)
return NULL;
string = malloc(size);
if(!string)
return NULL;
va_start(args, f);
n = vsnprintf(string, size, f, args);
va_end(args);
if(n >= 0 && n < size)
return listCons(string, cdr);
else if(n >= size)
size = n + 1;
else
size = size * 3 / 2 + 1;
free(string);
}
}
}
ListPtr
listAdjoinF(ListPtr cdr, char *f, ...)
{
va_list args;
char *string;
{
int n, size = 20;
while(1) {
if(size > 4096)
return NULL;
string = malloc(size);
if(!string)
return NULL;
va_start(args, f);
n = vsnprintf(string, size, f, args);
va_end(args);
if(n >= 0 && n < size)
return listAdjoin(string, cdr);
else if(n >= size)
size = n + 1;
else
size = size * 3 / 2 + 1;
free(string);
}
}
}
int
listLength(ListPtr list)
{
int n = 0;
while(list) {
n++;
list = list->next;
}
return n;
}
ListPtr
appendList(ListPtr first, ListPtr second)
{
ListPtr current;
if(second == NULL)
return first;
if(first == NULL)
return second;
for(current = first; current->next; current = current->next)
;
current->next = second;
return first;
}
ListPtr
makeList(char **a, int n, ListPtr old, int begin)
{
ListPtr first, current, next;
int i;
if(n == 0)
return old;
first = malloc(sizeof(ListRec));
if(!first)
return NULL;
first->value = a[0];
first->next = NULL;
current = first;
for(i = 1; i < n; i++) {
next = malloc(sizeof(ListRec));
if(!next)
return NULL;
next->value = a[i];
next->next = NULL;
current->next = next;
current = next;
}
if(begin) {
current->next = old;
return first;
} else {
return appendList(old, first);
}
}
ListPtr
reverseList(ListPtr old)
{
ListPtr new = NULL, current;
while(old) {
current = old;
old = old->next;
current->next = new;
new = current;
}
return new;
}
void
destroyList(ListPtr old)
{
ListPtr next;
if(!old)
return;
while(old) {
next = old->next;
free(old);
old = next;
}
}
void
deepDestroyList(ListPtr old)
{
ListPtr next;
if(!old)
return;
while(old) {
next = old->next;
free(old->value);
free(old);
old = next;
}
}
|
