93 lines
2.4 KiB
C
93 lines
2.4 KiB
C
#include "ref_vec.h"
|
|
#include <stdlib.h>
|
|
|
|
libab_result libab_ref_vec_init(libab_ref_vec* vec) {
|
|
libab_result result = LIBAB_SUCCESS;
|
|
vec->capacity = LIBABACUS_REF_VEC_INITIAL_SIZE;
|
|
vec->size = 0;
|
|
vec->data = malloc(sizeof(*vec->data) * LIBABACUS_REF_VEC_INITIAL_SIZE);
|
|
if (vec->data == NULL) {
|
|
result = LIBAB_MALLOC;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
libab_result libab_ref_vec_init_copy(libab_ref_vec* vec,
|
|
libab_ref_vec* copy_of) {
|
|
libab_result result = LIBAB_SUCCESS;
|
|
if ((vec->data = malloc(sizeof(*vec->data) * copy_of->capacity))) {
|
|
size_t index = 0;
|
|
vec->size = copy_of->size;
|
|
vec->capacity = copy_of->capacity;
|
|
for (; index < copy_of->size; index++) {
|
|
libab_ref_copy(©_of->data[index], &vec->data[index]);
|
|
}
|
|
} else {
|
|
result = LIBAB_MALLOC;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
libab_result _libab_ref_vec_try_resize(libab_ref_vec* vec) {
|
|
libab_result result = LIBAB_SUCCESS;
|
|
if (vec->size == vec->capacity) {
|
|
libab_ref* new_memory =
|
|
realloc(vec->data, (vec->capacity *= 2) * sizeof(*vec->data));
|
|
if(new_memory) {
|
|
vec->data = new_memory;
|
|
} else {
|
|
result = LIBAB_MALLOC;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
libab_result libab_ref_vec_insert(libab_ref_vec* vec, libab_ref* data) {
|
|
libab_result result = _libab_ref_vec_try_resize(vec);
|
|
|
|
if (result == LIBAB_SUCCESS) {
|
|
libab_ref_copy(data, &vec->data[vec->size++]);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
libab_result libab_ref_vec_insert_value(libab_ref_vec* vec, void* data,
|
|
void (*free_func)(void*)) {
|
|
libab_result result = _libab_ref_vec_try_resize(vec);
|
|
|
|
if (result == LIBAB_SUCCESS) {
|
|
result = libab_ref_new(&vec->data[vec->size], data, free_func);
|
|
}
|
|
|
|
if (result == LIBAB_SUCCESS) {
|
|
vec->size++;
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
void libab_ref_vec_index(libab_ref_vec* vec, size_t index, libab_ref* into) {
|
|
if (index < vec->size) {
|
|
libab_ref_copy(&vec->data[index], into);
|
|
} else {
|
|
libab_ref_null(into);
|
|
}
|
|
}
|
|
|
|
void libab_ref_vec_clear(libab_ref_vec* vec) {
|
|
size_t i = 0;
|
|
for (; i < vec->size; i++) {
|
|
libab_ref_free(&vec->data[i]);
|
|
}
|
|
vec->size = 0;
|
|
}
|
|
|
|
void libab_ref_vec_free(libab_ref_vec* vec) {
|
|
size_t i = 0;
|
|
for (; i < vec->size; i++) {
|
|
libab_ref_free(&vec->data[i]);
|
|
}
|
|
free(vec->data);
|
|
}
|