array.h

#pragma once
 
#include <kiba/allocators/allocator.h>
 
typedef struct array_header {
    usize      size;
    usize      capacity;
    usize      element_size;
    allocator *alloc;
} array_header;
 
static inline array_header *_array_get_header(const void *arr) { return ((array_header *) arr) - 1; }
 
#define array_of(type)            type *
#define array_size(array)         (_array_get_header(array)->size)
#define array_capacity(array)     (_array_get_header(array)->capacity)
#define array_element_size(array) (_array_get_header(array)->element_size)
#define array_alloc(array)        (_array_get_header(array)->alloc)
 
// TODO figure out better alignment strategy!
KB_API void *_array_create(usize initial_capacity, usize element_size, usize element_alignment, allocator *alloc);
#define array_create(type, initial_capacity, alloc_ptr) \
    (array_of(type))(_array_create(initial_capacity, sizeof(type), 1, alloc_ptr))
 
KB_API void array_destroy(void *arr_ptr);
 
KB_API b8 array_reserve(void *arr_ptr, usize new_capacity);
KB_API b8 array_resize(void *arr_ptr, usize new_size);
KB_API void *array_clone(const void *arr, allocator *alloc);
 
#define array_push(array, element)            \
    do {                                      \
        array[array_size(array)++] = element; \
    } while (0)
KB_API b8 array_push_checked(void *arr, void *element);
 
#define array_pop(array) array[--array_size(array)]
KB_API b8 array_pop_checked(void *arr_ptr, void *element);
 
KB_API b8 array_insert(void *arr_ptr, usize index, void *element);
 
KB_API b8 array_remove(void *arr_ptr, usize index, void *element);
 
#define array_for_each(type, var, arr) for (type *var = arr; var < arr + array_size(arr); ++var)