summaryrefslogtreecommitdiff
path: root/array.c
AgeCommit message (Collapse)Author
2020-10-10array: mark array_peek argument as constMarc André Tanner
2020-10-10array: mark array_capacity argument as constMarc André Tanner
2020-10-10array: mark array_init_from argument as constMarc André Tanner
2020-10-10array: mark array_get_ptr argument as constMarc André Tanner
2020-10-10array: mark array_get argument as constMarc André Tanner
2020-10-10array: mark array_length argument as constMarc André Tanner
2020-02-03array: make array_sort work for empty arraysMarc André Tanner
2018-04-10array: fix off by one error in array_removeMarc André Tanner
If the array was full, attempting to remove an element caused an out of bounds memory access. As an example this was triggered when reaching the capacity limit of the jumplist. It can be forced by repeatedly searching for something (i.e. `/.` and then holding down `n`).
2017-07-10array: add helper functions for LIFO usageMarc André Tanner
2017-06-15array: add array initialization utility functionMarc André Tanner
Reuses the element size from another array.
2017-06-15array: add array_sort utility functionMarc André Tanner
2017-04-19array: implement array_resizeMarc André Tanner
2017-04-19array: implement array_truncateMarc André Tanner
2017-04-18array: implement array_capacityMarc André Tanner
2016-12-27array: implement array_removeMarc André Tanner
2016-03-30array: allow arbitrarily sized array elementsMarc André Tanner
There exist two typical ways to use an array: 1) to hold pointers to externally allocated memory regions Use array_init(...) for initialization, an element has the size of a pointer. Use the functions suffixed with `_ptr' to manage your pointers. The cleanup function array_release_full must only be used with this type of array. 2) to hold arbitrary sized objects Use array_init_sized(...) to specify the size of a single element. Use the regular (i.e. without the `_ptr' suffix) functions to manage your objects. array_get will return a pointer to the object stored within the array.
2016-02-18Add a simple dynamically growing array data structureMarc André Tanner