#ifndef LIBKEKE_ARRAY
#define LIBKEKE_ARRAY

#include <stddef.h>
#include <stdlib.h>
#include <string.h>

struct KekeArray {
	size_t type_size;
	size_t len;
	size_t max_len;
	void *content;
};

static void *keke_array_alloc(size_t initial_len, size_t type_size) {
	if(initial_len == 0) initial_len = 1;
	struct KekeArray *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 keke_array_free(struct KekeArray *array) {
	free(array->content);
	free(array);
}


static void keke_array_set(struct KekeArray *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 *keke_array_get(struct KekeArray *array, size_t index) {
	if(index >= array->len) return NULL; // is ur fault
	return array->content + array->type_size * index;
}

static int keke_array_copy(struct KekeArray *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 keke_array_set_len(struct KekeArray *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;
	} else if(new_len < array->len) {
        memset(array->content + new_len * array->type_size, 0, (array->len - new_len) * array->type_size);
    }
	array->len = new_len;
}

static void keke_array_insert(struct KekeArray *array, size_t index, const void *value) {
    keke_array_set_len(array, array->len + 1);
    memmove(array->content + ((index + 1) * array->type_size), array->content + (index * array->type_size), (array->len - index - 1) * array->type_size);
    memcpy(array->content + index * array->type_size, value, array->type_size);
}

static void keke_array_remove(struct KekeArray *array, size_t index, void *value) {
    keke_array_set_len(array, array->len - 1);
    memcpy(value, array->content + index * array->type_size, array->type_size);
    memmove(array->content + (index * array->type_size), array->content + ((index + 1) * array->type_size), (array->len - index + 1) * array->type_size);
}

static void keke_array_push(struct KekeArray *array, const void *value) {
	keke_array_set(array, array->len, value);
}

static void keke_array_pop(struct KekeArray *array, void *value) {
	keke_array_remove(array, array->len - 1, value);
}

static void keke_array_delete(struct KekeArray *array, size_t index) {
    keke_array_set_len(array, array->len - 1);
    memmove(array->content + (index * array->type_size), array->content + ((index + 1) * array->type_size), (array->len - index + 1) * array->type_size);
}

static struct KekeArray *keke_array_yoink(struct KekeArray *array, size_t start_index, size_t len) {
	if(start_index + len >= array->len) return NULL;
	struct KekeArray *ret = keke_array_alloc(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);
	keke_array_set_len(array, array->len - len);
	return ret;
}

static int keke_array_insert_data(struct KekeArray *array, size_t index, void *data, size_t len) {
    if(index >= array->len) return -1;
    size_t current_len = array->len;
    keke_array_set_len(array, current_len + len);
    memmove(array->content + (index + len) * array->type_size, array->content + index * array->type_size, (current_len - index) * array->type_size);
    memcpy(array->content + index * array->type_size, data, len * array->type_size);
    return 0;
}

static int keke_array_plop(struct KekeArray *array, size_t index, struct KekeArray *array2) {
    int ret = keke_array_insert_data(array, index, array2->content, array2->len);
    if(ret) return ret;
    keke_array_free(array2);
    return 0;
}

typedef void (*Callback_func)(void *, size_t, struct KekeArray *);

static void keke_array_foreach(struct KekeArray *array, Callback_func callback) {
    for(size_t i = 0; i < array->len; i++) callback(keke_array_get(array, i), i, array);
}

static struct KekeArray *keke_array_clone(struct KekeArray *array) {
    struct KekeArray *ret = malloc(sizeof(*array));
    memcpy(ret, array, sizeof(*array));
    ret->content = malloc(array->max_len * array->type_size);
    memcpy(ret->content, array->content, array->max_len * array->type_size);
    return ret;
}

#endif