/* * Copyright (C) 2025 Johnny Richard * * 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 . */ #include #include #include #include "array.h" void * array_new(size_t item_size) { array_header_t *h = malloc((item_size * ARRAY_INITIAL_CAPACITY) + sizeof(array_header_t)); if (h == NULL) { return NULL; } h->length = 0; h->item_size = item_size; h->capacity = ARRAY_INITIAL_CAPACITY; return h + sizeof(array_header_t); } array_header_t * array_get_header(void *arr) { return (array_header_t *) arr - sizeof(array_header_t); } void * array_grow(void *arr) { array_header_t *h = array_get_header(arr); h->capacity *= 2; h = realloc(h, sizeof(array_header_t) + (h->capacity * h->item_size)); return h + sizeof(array_header_t); } size_t array_length(void *arr) { assert(arr); array_header_t *header = array_get_header(arr); return header->length; }