Repository navigation
Expand file tree
/
Copy pathsortedarray.c
More file actions
229 lines (183 loc) · 5.05 KB
/
Copy pathsortedarray.c
File metadata and controls
229 lines (183 loc) · 5.05 KB
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
/*
Copyright (c) 2016, Stefan Cloudt
Permission to use, copy, modify, and/or distribute this software
for any purpose with or without fee is hereby granted, provided
that the above copyright notice and this permission notice appear
in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "sortedarray.h"
#ifdef ALLOC_TESTING
#include "alloc-testing.h"
#endif
struct _SortedArray {
SortedArrayValue *data;
unsigned int length;
unsigned int _alloced;
SortedArrayCompareFunc cmp_func;
};
static const SortedArrayValue sortedarray_null_value = SORTED_ARRAY_NULL;
SortedArrayValue sortedarray_get(SortedArray *array, unsigned int i)
{
if (array == NULL || i >= array->length) {
return sortedarray_null_value;
}
return array->data[i];
}
unsigned int sortedarray_length(SortedArray *array)
{
return array->length;
}
SortedArray *sortedarray_new(unsigned int length,
SortedArrayCompareFunc cmp_func)
{
SortedArrayValue *array;
SortedArray *sortedarray;
if (cmp_func == NULL) {
return NULL;
}
/* If length is 0, set it to a default. */
if (length == 0) {
length = 16;
}
array = malloc(sizeof(SortedArrayValue) * length);
if (array == NULL) {
return NULL;
}
sortedarray = malloc(sizeof(SortedArray));
if (sortedarray == NULL) {
free(array);
return NULL;
}
sortedarray->data = array;
sortedarray->length = 0;
sortedarray->_alloced = length;
sortedarray->cmp_func = cmp_func;
return sortedarray;
}
void sortedarray_free(SortedArray *sortedarray)
{
if (sortedarray != NULL) {
free(sortedarray->data);
free(sortedarray);
}
}
int sortedarray_remove(SortedArray *sortedarray, unsigned int index)
{
/* same as remove range of length 1 */
return sortedarray_remove_range(sortedarray, index, 1);
}
int sortedarray_remove_range(SortedArray *sortedarray, unsigned int index,
unsigned int length)
{
/* check if valid range */
if (sortedarray == NULL || index >= sortedarray->length) {
return 0;
}
if (index + length > sortedarray->length) {
length = sortedarray->length - index;
}
/* move entries back */
memmove(&sortedarray->data[index], &sortedarray->data[index + length],
(sortedarray->length - (index + length)) *
sizeof(SortedArrayValue));
sortedarray->length -= length;
return 1;
}
int sortedarray_insert(SortedArray *sortedarray, SortedArrayValue data)
{
unsigned int left, right, index;
int order;
if (sortedarray == NULL) {
return 0;
}
left = 0;
right = sortedarray->length;
index = 0;
/* When length is 1 set right to 0 so that the loop is not entered */
right = (right > 1) ? right : 0;
while (left != right) {
index = (left + right) / 2;
order = sortedarray->cmp_func(data, sortedarray->data[index]);
if (order < 0) {
/* value should be left of index */
right = index;
} else if (order > 0) {
/* value should be right of index */
left = index + 1;
} else {
/* value should be at index */
break;
}
}
/* look whether the item should be put before or after the index */
if (sortedarray->length > 0 &&
sortedarray->cmp_func(data, sortedarray->data[index]) > 0) {
index++;
}
/* insert element at index */
if (sortedarray->length + 1 > sortedarray->_alloced) {
/* enlarge the array */
unsigned int newsize;
SortedArrayValue *data;
newsize = sortedarray->_alloced * 2;
data = realloc(sortedarray->data,
sizeof(SortedArrayValue) * newsize);
if (data == NULL) {
return 0;
} else {
sortedarray->data = data;
sortedarray->_alloced = newsize;
}
}
/* move all other elements */
memmove(&sortedarray->data[index + 1], &sortedarray->data[index],
(sortedarray->length - index) * sizeof(SortedArrayValue));
/* insert entry */
sortedarray->data[index] = data;
++sortedarray->length;
return 1;
}
/* TODO: Refactor to eliminate duplicated binary search */
int sortedarray_index_of(SortedArray *sortedarray, SortedArrayValue data)
{
unsigned int left, right, index;
int order;
if (sortedarray == NULL) {
return -1;
}
left = 0;
right = sortedarray->length;
index = 0;
/* safe subtract 1 of right without going negative */
right = (right > 1) ? right : 0;
while (left != right) {
index = (left + right) / 2;
order = sortedarray->cmp_func(data, sortedarray->data[index]);
if (order < 0) {
/* value should be left */
right = index;
} else if (order > 0) {
/* value should be right */
left = index + 1;
} else {
return (int) index;
}
}
return -1;
}
void sortedarray_clear(SortedArray *sortedarray)
{
/* set length to 0 */
sortedarray->length = 0;
}