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_pop_at(Vector* vector, size_t index)
21{
22 void* tmp = vector_at(vector, index);
23 if(!tmp)
24 {
25 return NULL;
26 } else {
27 vector_remove(vector, index, NULL);
28 return tmp;
29 }
30}
31
32void vector_remove_range(Vector* vector, size_t index, size_t length, void (*rmv)(void*))
33{
34 size_t i;
35 if(rmv)
36 {
37 for(i = index; i < length; i++)
38 {
39 rmv(vector_at(vector, i));
40 }
41 }
42 memmove(vector->items+index, vector->items+index+length, (vector->length-(index+length))*sizeof(*vector->items));
43 vector->length -= length;
44}
45
46size_t* vector_find(const Vector* haystack, const void* needle, int (*cmp)(const void*, const void*))
47{
48 size_t i, *ret;
49
50 for(i = 0; i < haystack->length; i++)
51 {
52 if(cmp(haystack->items[i],needle) == 0)
53 {
54 ret = malloc(sizeof(*ret));
55 *ret = i;
56 return ret;
57 }
58 }
59 return NULL;
60}
61
62bool vector_insert(Vector* vector, size_t index, void* item)
63{
64 if(!vector_grow(vector, 1))
65 return false;
66
67 memmove(vector->items+index+1, vector->items+index, (vector->length-index)*sizeof(*vector->items));
68 vector->items[index] = item;
69 vector->length++;
70 return true;
71}
72
73bool vector_grow(Vector* vector, size_t add)
74{
75 if(vector->length+add < vector->length)
76 return false;
77 return vector_adjust_size(vector, vector->length+add);
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 = cutil_reallocarray_inc(vector->items, vector->capacity, sizeof(*vector->items), vector->capacity);
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 = cutil_reallocarray(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 if(rmv)
115 {
116 size_t i;
117 for(i = 0; i < vector->length; i++)
118 {
119 rmv(vector->items[i]);
120 }
121 }
122 free(vector->items);
123 free(vector);
124}
125