87 lines
2.8 KiB
C
87 lines
2.8 KiB
C
|
|
|
|
#ifndef HEHE_ARRAYLIB
|
|
#define HEHE_ARRAYLIB
|
|
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
struct HeheArray {
|
|
size_t type_size;
|
|
size_t len;
|
|
size_t max_len;
|
|
void *content;
|
|
};
|
|
|
|
static void *hehe_alloc_array(size_t initial_len, size_t type_size) {
|
|
if(initial_len == 0) initial_len = 1;
|
|
struct HeheArray *array = malloc(sizeof(*array));
|
|
array->len = initial_len;
|
|
size_t max_len = 1;
|
|
while(initial_len >>= 1) max_len <<= 1;
|
|
|
|
array->type_size = type_size;
|
|
array->max_len = max_len;
|
|
array->content = malloc(max_len * type_size);
|
|
memset(array->content, 0, max_len * type_size);
|
|
return array;
|
|
}
|
|
|
|
static void hehe_array_set(struct HeheArray *array, size_t index, const void *value) {
|
|
if(index >= array->max_len) {
|
|
array->content = realloc(array->content, (array->max_len << 1) * array->type_size);
|
|
memset(array->content + array->max_len * array->type_size, 0, array->max_len * array->type_size);
|
|
array->max_len <<= 1;
|
|
}
|
|
if(index >= array->len) array->len = index + 1;
|
|
memcpy(array->content + index * array->type_size, value, array->type_size);
|
|
}
|
|
|
|
static void *hehe_array_get(struct HeheArray *array, size_t index) {
|
|
if(index >= array->len) return NULL; // is ur fault
|
|
return array->content + array->type_size * index;
|
|
}
|
|
|
|
static int hehe_array_copy(struct HeheArray *array, size_t index, void *value) {
|
|
if(index >= array->len) return -1; // is ur fault
|
|
memcpy(value, array->content + array->type_size * index, array->type_size);
|
|
return 0;
|
|
}
|
|
|
|
static void hehe_array_set_len(struct HeheArray *array, size_t new_len) {
|
|
if(new_len >= array->max_len) {
|
|
size_t new_max_len = 1;
|
|
size_t len = new_len;
|
|
while(len >>= 1) new_max_len <<= 1;
|
|
array->content = realloc(array->content, new_max_len * array->type_size);
|
|
memset(array->content + array->max_len * array->type_size, 0, (new_max_len - array->max_len) * array->type_size);
|
|
array->max_len <<= 1;
|
|
}
|
|
array->len = new_len;
|
|
}
|
|
|
|
static void hehe_array_push(struct HeheArray *array, const void *value) {
|
|
hehe_array_set(array, array->len, value);
|
|
}
|
|
|
|
static int hehe_array_pop(struct HeheArray *array, void *value) {
|
|
return hehe_array_copy(array, array->len, value) || ((array->len -= 1) && 0);
|
|
}
|
|
|
|
static struct HeheArray *hehe_array_yoink(struct HeheArray *array, size_t start_index, size_t len) {
|
|
if(start_index + len >= array->len) return NULL;
|
|
struct HeheArray *ret = hehe_alloc_array(len, array->type_size);
|
|
memcpy(ret->content, array->content + start_index * array->type_size, len * array->type_size);
|
|
memmove(array->content + start_index * array->type_size, array->content + (start_index + len) * array->type_size, (array->len - len - start_index) * array->type_size);
|
|
hehe_array_set_len(array, array->len - len);
|
|
return ret;
|
|
}
|
|
|
|
static void hehe_array_free(struct HeheArray *array) {
|
|
free(array->content);
|
|
free(array);
|
|
}
|
|
|
|
#endif
|