aboutsummaryrefslogtreecommitdiff
path: root/array.h
AgeCommit message (Collapse)AuthorFilesLines
2025-01-12array: delete onelinersRandy Palamar1-4/+0
same as buffer commit Array is completely visible
2022-11-29fix miscellaneous spelling mistakesNick Hanley1-2/+2
2020-12-10fix typos in commentsMoesasji1-1/+1
2020-10-10array: mark array_peek argument as constMarc André Tanner1-1/+1
2020-10-10array: mark array_capacity argument as constMarc André Tanner1-1/+1
2020-10-10array: mark array_init_from argument as constMarc André Tanner1-1/+1
2020-10-10array: mark array_get_ptr argument as constMarc André Tanner1-1/+1
2020-10-10array: mark array_get argument as constMarc André Tanner1-1/+1
2020-10-10array: mark array_length argument as constMarc André Tanner1-1/+1
2017-07-10array: add helper functions for LIFO usageMarc André Tanner1-0/+21
2017-06-15array: add array initialization utility functionMarc André Tanner1-0/+2
Reuses the element size from another array.
2017-06-15array: add array_sort utility functionMarc André Tanner1-0/+4
2017-05-03array: convert comments to doxygen formatMarc André Tanner1-34/+75
2017-04-19array: implement array_resizeMarc André Tanner1-0/+3
2017-04-19array: implement array_truncateMarc André Tanner1-0/+2
2017-04-18array: implement array_capacityMarc André Tanner1-0/+2
2016-12-27array: implement array_removeMarc André Tanner1-0/+2
2016-03-30array: allow arbitrarily sized array elementsMarc André Tanner1-5/+30
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é Tanner1-0/+31