libcutils

libcutils/src/vector.c
vector.c
⎇
Raw
1#include <cutils/vector.h>
2
3Vector* vector_with_capacity(size_t capacity)
4{
5 Vector* vector = malloc(sizeof(*vector));
6 if(!vector)
7 return NULL;
8 vector->items = malloc(sizeof(*vector->items)*capacity);
9 if(!vector->items)
10 {
11 free(vector);
12 return NULL;
13 }
14 vector->length = 0;
15 vector->capacity = capacity;
16
17 return vector;
18}
19
20void* vector_at(const Vector* vector, size_t index)
21{
22 if(index >= vector->length)
23 return NULL;
24 else
25 return vector->items[index];
26}
27
28void* vector_pop_at(Vector* vector, size_t index)
29{
30 void* tmp = vector_at(vector, index);
31 if(!tmp)
32 {
33 return NULL;
34 } else {
35 vector_remove(vector, index, NULL);
36 return tmp;
37 }
38}
39
40
41void vector_remove(Vector* vector, size_t index, void (*rmv)(void*))
42{
43 if(index < vector->length)
44 {
45 if(rmv)
46 rmv(vector->items[index]);
47 memmove(vector->items+index, vector->items+index+1, (vector->length-index-1)*sizeof(*vector->items));
48 vector->length--;
49 }
50}
51/* TODO: optimize */
52void vector_remove_range(Vector* vector, size_t index, size_t length, void (*rmv)(void*))
53{
54 size_t i;
55 for(i = 0; i < length; i++)
56 {
57 vector_remove(vector, index+i, rmv);
58 }
59}
60
61size_t* vector_find(const Vector* haystack, const void* needle, int (*cmp)(const void*, const void*))
62{
63 size_t i, *ret;
64
65 for(i = 0; i < haystack->length; i++)
66 {
67 if(cmp(haystack->items[i],needle) == 0)
68 {
69 ret = malloc(sizeof(*ret));
70 *ret = i;
71 return ret;
72 }
73 }
74 return NULL;
75}
76
77bool vector_insert(Vector* vector, size_t index, void* item)
78{
79 if(index > vector->length || vector->length == SIZE_MAX || !vector_adjust_size(vector, vector->length+1))
80 return false;
81
82 memmove(vector->items+index+1, vector->items+index, (vector->length-index)*sizeof(*vector->items));
83 vector->items[index] = item;
84 vector->length++;
85 return true;
86}
87
88bool vector_adjust_size(Vector* vector, size_t size)
89{
90 while(vector->capacity < size)
91 {
92 void** tmp = vector->items;
93 vector->items = reallocsafe_inc(vector->items, sizeof(*vector->items), vector->capacity, vector->capacity);
94 if(!vector->items)
95 {
96 vector->items = tmp;
97 return false;
98 }
99 vector->capacity *= 2;
100 }
101 return true;
102}
103
104bool vector_shrink(Vector* vector)
105{
106 while(vector->capacity > (vector->length*2))
107 {
108 void** tmp = vector->items;
109 vector->items = realloc(vector->items, vector->capacity/2*sizeof(*vector->items));
110 if(!vector->items)
111 {
112 vector->items = tmp;
113 return false;
114 }
115 vector->capacity /= 2;
116 }
117 return true;
118}
119
120void delete_vector(Vector* vector, void (*rmv)(void*))
121{
122 if(rmv)
123 {
124 size_t i;
125 for(i = 0; i < vector->length; i++)
126 {
127 rmv(vector->items[i]);
128 }
129 }
130 free(vector->items);
131 free(vector);
132}
133