| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2017-06-15 | array: add array initialization utility function | Marc André Tanner | 1 | -0/+2 | |
| Reuses the element size from another array. | |||||
| 2017-06-15 | array: add array_sort utility function | Marc André Tanner | 1 | -0/+4 | |
| 2017-05-03 | array: convert comments to doxygen format | Marc André Tanner | 1 | -34/+75 | |
| 2017-04-19 | array: implement array_resize | Marc André Tanner | 1 | -0/+3 | |
| 2017-04-19 | array: implement array_truncate | Marc André Tanner | 1 | -0/+2 | |
| 2017-04-18 | array: implement array_capacity | Marc André Tanner | 1 | -0/+2 | |
| 2016-12-27 | array: implement array_remove | Marc André Tanner | 1 | -0/+2 | |
| 2016-03-30 | array: allow arbitrarily sized array elements | Marc André Tanner | 1 | -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-18 | Add a simple dynamically growing array data structure | Marc André Tanner | 1 | -0/+31 | |
