/*
 * Copyright (C) 2025  Johnny Richard <johnny@johnnyrichard.com>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */
#ifndef ARRAY_H
#define ARRAY_H
#include <stddef.h>

#define ARRAY_INITIAL_CAPACITY 4

#define array(T) (T*)array_new(sizeof(T))

#define array_append(arr, item)                                                \
    do {                                                                       \
        array_header_t* h = array_get_header(arr);                             \
        if (h->capacity < h->length + 1) {                                     \
            arr = array_grow(arr);                                             \
        }                                                                      \
        arr[h->length++] = item;                                               \
    } while (0)

typedef struct array_header
{
    size_t capacity;
    size_t item_size;
    size_t length;
} array_header_t;

void*
array_new(size_t item_size);

array_header_t*
array_get_header(void* arr);

void*
array_grow(void* arr);

size_t
array_length(void* arr);

#endif /* ARRAY_H */