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
52size_t* vector_find(const Vector* haystack, const void* needle, int (*cmp)(const void*, const void*))
53{
54 size_t* ret;
55 size_t i;
56
57 for(i = 0; i < haystack->length; i++)
58 {
59 if(cmp ? cmp(haystack->items[i],needle) == 0 : haystack->items[i] == needle)
60 {
61 ret = malloc(sizeof(*ret));
62 *ret = i;
63 return ret;
64 }
65 }
66 return NULL;
67}
68
69bool vector_insert(Vector* vector, size_t index, void* item)
70{
71 if(index > vector->length || !vector_adjust_size(vector, vector->length+1))
72 return false;
73
74 memmove(vector->items+index+1, vector->items+index, (vector->length-index)*sizeof(*vector->items));
75 vector->items[index] = item;
76 ++vector->length;
77 return true;
78}
79
80bool vector_adjust_size(Vector* vector, size_t size)
81{
82 while(vector->capacity < size)
83 {
84 void** tmp = vector->items;
85 vector->items = realloc(vector->items, vector->capacity*2*sizeof(*vector->items));
86 if(!vector->items)
87 {
88 vector->items = tmp;
89 return false;
90 }
91 vector->capacity *= 2;
92 }
93 return true;
94}
95
96bool vector_shrink(Vector* vector)
97{
98 while(vector->capacity > (vector->length*2))
99 {
100 void** tmp = vector->items;
101 vector->items = realloc(vector->items, vector->capacity/2*sizeof(*vector->items));
102 if(!vector->items)
103 {
104 vector->items = tmp;
105 return false;
106 }
107 vector->capacity /= 2;
108 }
109 return true;
110}
111
112void delete_vector(Vector* vector, void (*rmv)(void*))
113{
114 size_t i;
115 for(i = 0; i < vector->length; i++)
116 {
117 if(rmv)
118 rmv(vector->items[i]);
119 }
120 free(vector->items);
121 free(vector);
122}
123