#ifndef _ARRAY_H_
#define _ARRAY_H_

#define ARRAY_DECL(T, array) \
    T *array; \
    int array##_len; \
    int array##_size;

#define ARRAY_INIT(array) \
    array = NULL; \
    array##_len = 0; \
    array##_size = 0;

#define ARRAY_ASSIGN(array, array2) \
    array = array2; \
    array##_len = array2##_len; \
    array##_size = array##_size;

#define ARRAY_CLONE(T, array, array2) \
{ \
    int len = array2##_len; \
    int size = array2##_size; \
    T *new_array = calloc(size, sizeof(T)); \
    if(new_array == NULL)return 1; \
    for(int i = 0; i < len; i++){ \
        array[i] = array2[i]; \
    } \
    array##_len = len; \
    array##_size = size; \
    array = new_array; \
}

#define ARRAY_REMOVE(array, elem, elem_cleanup) \
{ \
    bool found = false; \
    int i1 = array##_len; \
    for(int i = 0; i < i1; i++){ \
        if(array[i] == elem){ \
            found = true; \
            int j1 = array##_len - 1; \
            for(int j = i; j < j1; j++){ \
                array[j] = array[j + 1]; \
            } \
            array##_len--; \
        } \
    } \
    if(found)elem_cleanup(elem); \
}

#define ARRAY_REMOVE_PTR(array, elem, elem_cleanup) { \
    ARRAY_REMOVE(array, elem, elem_cleanup) \
    free(elem); \
}

#define ARRAY_UNHOOK(array, elem) ARRAY_REMOVE(array, elem, (void))

#define ARRAY_GROW(T, array) \
{ \
    int new_size; \
    T *new_array; \
    if(array##_size == 0){ \
        new_size = 8; \
        new_array = malloc(sizeof(*new_array) * new_size); \
    }else{ \
        new_size = array##_size * 2; \
        new_array = realloc(array, \
            sizeof(*new_array) * new_size); \
    } \
    if(new_array == NULL)return 1; \
    for(int i = array##_size; i < new_size; i++){ \
        new_array[i] = (T){0};} \
    array = new_array; \
    array##_size = new_size; \
}

#define ARRAY_PUSH_MANY(T, array, new_elem, _n) \
{ \
    int n = _n; \
    while(array##_len + n - 1 >= array##_size) \
        ARRAY_GROW(T, array) \
    int old_len = array##_len; \
    int new_len = old_len + n; \
    array##_len = new_len; \
    for(int i = old_len; i < new_len; i++){ \
        array[i] = (new_elem);} \
}

#define ARRAY_PUSH_UNINITIALIZED(T, array) \
{ \
    if(array##_len >= array##_size) \
        ARRAY_GROW(T, array) \
    array##_len++; \
}

#define ARRAY_PUSH(T, array, new_elem) \
{ \
    ARRAY_PUSH_UNINITIALIZED(T, array) \
    array[array##_len - 1] = (new_elem); \
}

#define ARRAY_PUSH_NEW(T, array, new_elem) \
T new_elem = NULL; \
{ \
    if(array##_len >= array##_size) \
        ARRAY_GROW(T, array) \
    new_elem = calloc(1, sizeof(*new_elem)); \
    if(new_elem == NULL)return 1; \
    array##_len++; \
    array[array##_len - 1] = new_elem; \
}

#define ARRAY_FREE(T, array, elem_cleanup) \
{ \
    for(int i = 0; i < array##_len; i++){ \
        elem_cleanup(&array[i]);} \
    free(array); \
    array##_len = 0; \
    array##_size = 0; \
}

#define ARRAY_FREE_PTR(T, array, elem_cleanup) \
{ \
    for(int i = 0; i < array##_len; i++){ \
        elem_cleanup(array[i]); \
        free(array[i]);} \
    free(array); \
    array##_len = 0; \
    array##_size = 0; \
}

#define ARRAY_POP(array, elem_cleanup) \
    if(array##_len <= 0)return 2; \
    array##_len--; \
    elem_cleanup(array[array##_len]);

#define ARRAY_POP_PTR(array, elem_cleanup) \
    if(array##_len <= 0)return 2; \
    array##_len--; \
    elem_cleanup(array[array##_len]); \
    free(array[array##_len]);

#endif