A generic dynamic array in C that stores no capacity and needs no struct

▤ Summary

This article explains a generic dynamic array pattern in C that stores its length and data using a two-pointer array instead of a struct. It shows how the approach uses a uintptr_t to hold the length and relies on realloc to grow the array on demand. The design removes the need to define custom vector types, but it also depends on implementation-defined behavior. The article also notes a tradeoff: the method makes manual reserve-style preallocation harder because growth resets capacity to the next power of two.

▦ Linked Companies