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
|
/**
* \file list.c
*
* \brief Vector library - list definition
*
* Higher level functions for reading/writing/manipulating vectors.
*
* (C) 2001-2008 by the GRASS Development Team
*
* This program is free software under the GNU General Public
* License (>=v2). Read the file COPYING that comes with GRASS
* for details.
*
* \author Original author CERL, probably Dave Gerdes or Mike Higgins.
* Update to GRASS 5.7 Radim Blazek and David D. Gray
*
* \date 2001-2008
*/
#include <stdlib.h>
#include <grass/Vect.h>
#include <grass/gis.h>
/**
* \brief Creates and initializes a struct ilist.
*
* This structure is used as container for integer values. The
* library routines handle all memory allocation.
*
* \return pointer to struct ilist
* \return NULL on error
*/
struct ilist *Vect_new_list(void)
{
struct ilist *p;
p = (struct ilist *)G_malloc(sizeof(struct ilist));
if (p) {
p->value = NULL;
p->n_values = 0;
p->alloc_values = 0;
}
return p;
}
/**
* \brief Reset ilist structure.
*
* To make sure ilist structure is clean to be re-used. List must have
* previously been created with Vect_new_list().
*
* \param[in,out] list pointer to struct ilist
*
* \return 0
*/
int Vect_reset_list(struct ilist *list)
{
list->n_values = 0;
return 0;
}
/**
* \brief Frees all memory associated with a struct ilist, including
* the struct itself
*
* \param[in,out] list pointer to ilist structure
*
* \return 0
*/
int Vect_destroy_list(struct ilist *list)
{
if (list) { /* probably a moot test */
if (list->alloc_values) {
G_free((void *)list->value);
}
G_free((void *)list);
}
list = NULL;
return 0;
}
/**
* \brief Append new item to the end of list if not yet present
*
* \param[in,out] list pointer to ilist structure
* \param[in] val new item to append to the end of list
*
* \return 0 on success
* \return 1 on error
*/
int Vect_list_append(struct ilist *list, int val)
{
int i;
size_t size;
if (list == NULL)
return 1;
for (i = 0; i < list->n_values; i++) {
if (val == list->value[i])
return 0;
}
if (list->n_values == list->alloc_values) {
size = (list->n_values + 1000) * sizeof(int);
list->value = (int *)G_realloc((void *)list->value, size);
list->alloc_values = list->n_values + 1000;
}
list->value[list->n_values] = val;
list->n_values++;
return 0;
}
/**
* \brief Append new items to the end of list if not yet present
*
* \param[in,out] alist pointer to ilist structure where items will be appended
* \param[in] blist pointer to ilist structure with new items
*
* \return 0 on success
* \return 1 on error
*/
int Vect_list_append_list(struct ilist *alist, struct ilist *blist)
{
int i;
if (alist == NULL || blist == NULL)
return 1;
for (i = 0; i < blist->n_values; i++)
Vect_list_append(alist, blist->value[i]);
return 0;
}
/**
* \brief Remove a given value (item) from list
*
* \param[in,out] list pointer to ilist structure
* \param[in] val to remove
*
* \return 0 on success
* \return 1 on error
*/
int Vect_list_delete(struct ilist *list, int val)
{
int i, j;
if (list == NULL)
return 1;
for (i = 0; i < list->n_values; i++) {
if (val == list->value[i]) {
for (j = i + 1; j < list->n_values; j++)
list->value[j - 1] = list->value[j];
list->n_values--;
return 0;
}
}
return 0;
}
/**
* \brief Delete list from existing list
*
* \param[in,out] alist pointer to original ilist structure,
* \param[in] blist pointer to ilist structure with items to delete
*
* \return 0 on success
* \return 1 on error
*/
int Vect_list_delete_list(struct ilist *alist, struct ilist *blist)
{
int i;
if (alist == NULL || blist == NULL)
return 1;
for (i = 0; i < blist->n_values; i++)
Vect_list_delete(alist, blist->value[i]);
return 0;
}
/**
* \brief Find a given item in the list
*
* \param[in] list pointer to ilist structure
* \param[in] val value of item
*
* \return 1 if an item is found
* \return 0 no found item in the list
*/
int Vect_val_in_list(struct ilist *list, int val)
{
int i;
if (list == NULL)
return 0;
for (i = 0; i < list->n_values; i++) {
if (val == list->value[i])
return 1;
}
return 0;
}
|
