169 lines
3.9 KiB
C
169 lines
3.9 KiB
C
#include "vector.h"
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
|
|
/*****************************************************************************
|
|
* VECTOR IMPLEMENTATIONS
|
|
* ***************************************************************************/
|
|
|
|
struct vector {
|
|
size_t m_size;
|
|
void *m_data;
|
|
size_t m_capacity;
|
|
size_t m_item_size;
|
|
};
|
|
|
|
static int vector_reallocate_(vector_t *vector, size_t new_capacity)
|
|
{
|
|
assert(vector);
|
|
assert(new_capacity > vector->m_capacity);
|
|
|
|
size_t new_size = new_capacity * vector->m_item_size;
|
|
vector->m_data = realloc(vector->m_data, new_size);
|
|
if (vector->m_data == NULL)
|
|
return -1;
|
|
return 0;
|
|
}
|
|
|
|
/* ------------ Constructors & Destructors ----------------------------- */
|
|
|
|
vector_t *create_vector(size_t item_size, size_t capacity)
|
|
{
|
|
vector_t *vector = (vector_t *)malloc(sizeof(vector_t));
|
|
if (vector == NULL) {
|
|
SYS_LOG_ERROR("Failed to allocate memory for asock vector");
|
|
return NULL;
|
|
}
|
|
|
|
size_t init_size = MAX(item_size * capacity, 1);
|
|
vector->m_data = malloc(init_size);
|
|
if (vector->m_data == NULL) {
|
|
SYS_LOG_ERROR("Failed to allocate memory for asock vector inern. buffer");
|
|
free(vector);
|
|
return NULL;
|
|
}
|
|
|
|
vector->m_size = 0;
|
|
vector->m_capacity = capacity;
|
|
vector->m_item_size = item_size;
|
|
|
|
return vector;
|
|
}
|
|
|
|
|
|
void destroy_vector(vector_t *vector)
|
|
{
|
|
assert(vector);
|
|
free(vector->m_data);
|
|
free(vector);
|
|
}
|
|
|
|
vector_t *copy_vector(vector_t *v)
|
|
{
|
|
if (v == NULL)
|
|
return NULL;
|
|
|
|
vector_t *new_vector = create_vector(v->m_item_size, v->m_capacity);
|
|
if (new_vector == NULL)
|
|
return NULL;
|
|
|
|
memcpy(new_vector->m_data, v->m_data, v->m_item_size * v->m_size);
|
|
new_vector->m_size = v->m_size ;
|
|
new_vector->m_item_size = v->m_item_size ;
|
|
return new_vector;
|
|
}
|
|
|
|
|
|
|
|
/* ----------- Nonmodifying functions --------------------------------- */
|
|
|
|
size_t vector_size(const vector_t *vector)
|
|
{
|
|
assert(vector);
|
|
return vector->m_size;
|
|
}
|
|
|
|
|
|
size_t vector_capacity(const vector_t *vector)
|
|
{
|
|
assert(vector);
|
|
return vector->m_capacity;
|
|
}
|
|
|
|
size_t vector_index_of(const vector_t *vector, const void *item)
|
|
{
|
|
assert(vector);
|
|
assert(item);
|
|
|
|
size_t i = 0;
|
|
for (i = 0; i < vector->m_size; ++i) {
|
|
void *data_pos = (char *)vector->m_data + i * vector->m_item_size;
|
|
if (memcmp(data_pos, item, vector->m_item_size) == 0) {
|
|
return i;
|
|
}
|
|
}
|
|
return INVALID_VEC_INDEX;
|
|
}
|
|
|
|
|
|
/* ----------- Modifying functions ------------------------------------- */
|
|
|
|
int vector_push(vector_t *vector, const void *item)
|
|
{
|
|
assert(vector);
|
|
assert(item);
|
|
|
|
if (vector->m_size == vector->m_capacity) {
|
|
if (vector_reallocate_(vector, vector->m_capacity * 2) == -1)
|
|
return FT_ERROR;
|
|
vector->m_capacity = vector->m_capacity * 2;
|
|
}
|
|
|
|
ptrdiff_t deviation = vector->m_size * vector->m_item_size;
|
|
memcpy((char *)vector->m_data + deviation, item, vector->m_item_size);
|
|
|
|
++(vector->m_size);
|
|
|
|
return FT_SUCCESS;
|
|
}
|
|
|
|
|
|
int vector_erase(vector_t *vector, size_t index)
|
|
{
|
|
assert(vector);
|
|
|
|
if (vector->m_size == 0 || index >= vector->m_size)
|
|
return FT_ERROR;
|
|
|
|
memmove((char *)vector->m_data + vector->m_item_size * index,
|
|
(char *)vector->m_data + vector->m_item_size * (index + 1),
|
|
(vector->m_size - 1 - index) * vector->m_item_size);
|
|
vector->m_size--;
|
|
return FT_SUCCESS;
|
|
}
|
|
|
|
|
|
void vector_clear(vector_t *vector)
|
|
{
|
|
vector->m_size = 0;
|
|
}
|
|
|
|
const void *vector_at_c(const vector_t *vector, size_t index)
|
|
{
|
|
if (index >= vector->m_size)
|
|
return NULL;
|
|
|
|
return (char *)vector->m_data + index * vector->m_item_size;
|
|
}
|
|
|
|
|
|
void *vector_at(vector_t *vector, size_t index)
|
|
{
|
|
if (index >= vector->m_size)
|
|
return NULL;
|
|
|
|
return (char *)vector->m_data + index * vector->m_item_size;
|
|
}
|
|
|
|
|