libds/src/vec.c

103 lines
2.3 KiB
C
Raw Normal View History

#include "vec.h"
#include <stdio.h>
2016-12-21 14:50:32 -08:00
#include <stdlib.h>
#include <string.h>
2016-12-21 14:50:32 -08:00
libds_result vec_init(vec* v) {
libds_result result = LIBDS_SUCCESS;
2016-12-21 14:50:32 -08:00
v->size = 0;
v->capacity = LIBDS_VEC_CAPACITY;
v->data = malloc(LIBDS_VEC_CAPACITY * sizeof(void*));
2016-12-21 14:50:32 -08:00
if (v->data == NULL) {
result = LIBDS_MALLOC;
}
return result;
}
2016-12-21 14:50:32 -08:00
void vec_free(vec* v) {
v->size = 0;
v->capacity = 0;
2016-12-21 14:50:32 -08:00
if (v->data) {
free(v->data);
}
v->data = NULL;
}
2016-12-21 14:50:32 -08:00
libds_result vec_add(vec* v, void* data) {
libds_result result = LIBDS_SUCCESS;
2016-12-21 14:50:32 -08:00
if (v->size >= v->capacity) {
void* new_mem = malloc((v->capacity *= 2) * sizeof(void*));
2016-12-21 14:50:32 -08:00
if (new_mem) {
memcpy(new_mem, v->data, sizeof(void*) * v->capacity / 2);
free(v->data);
v->data = new_mem;
} else {
result = LIBDS_MALLOC;
}
}
if (result == LIBDS_SUCCESS) {
((void**) v->data)[v->size++] = data;
}
return result;
}
2016-12-21 14:50:32 -08:00
void vec_remove(vec* v, void* data) {
size_t index = 0;
void** data_array = v->data;
while (index < v->size && data_array[index]) {
size_t search_ahead = 0;
while(data_array[index + search_ahead] == data){
search_ahead++;
}
if(search_ahead){
size_t remaining_elements = v->size - (index + search_ahead);
memmove(data_array + index, data_array + index + search_ahead, remaining_elements);
v->size -= search_ahead;
}
index++;
}
}
void* vec_find(const vec* v, void* data, compare_func compare) {
size_t index = 0;
void* found = NULL;
void** data_array = v->data;
while (index < v->size && found == NULL) {
if (data_array[index] && compare(data, data_array[index])) {
found = data_array[index];
2016-12-21 14:50:32 -08:00
}
index++;
}
return found;
}
int vec_foreach(const vec* v, void* data, compare_func compare, foreach_func foreach,
2016-12-21 14:50:32 -08:00
...) {
size_t index = 0;
int return_code = 0;
void** data_array = v->data;
va_list args;
while (index < v->size && return_code == 0) {
if (data_array[index] && compare(data, data_array[index])) {
va_start(args, foreach);
return_code = foreach (data_array[index], args);
va_end(args);
}
index++;
}
return return_code;
}
void* vec_index(const vec* v, size_t index) {
void* to_return = NULL;
if (index < v->capacity) {
to_return = ((void**) v->data)[index];
}
return to_return;
}
2017-06-11 21:08:39 -07:00
void vec_clear(vec* vec) {
vec->size = 0;
}