Dynamic allocation of array elements

I have finished the last of the three experiments recently undertaken to explore the use of Zig in a set of data management mechanisms. The subject of this experiment is the use of dynamically allocated elements in an array that is intended to be treated as a set whose membership changes over time. Again the subject matter is a bit obscure, but the example program is this experiment integrates the two other modules on adjacency matrices and Robin Hood hash indexing.

I have reworked a wiki page on the repository where the files are available. I hope the documented and worked-out example code that is found in the literate program documents may be of interest, even if the subject matter is rather systems-mechanism oriented.

This will be the last showcase posting I will make for some time. I’m off to finish some other work that has been lingering while I’ve taken a dive into Zig. Thanks to all for the help I obtained here. Zig is a language of such great potential and its community is most welcoming. For an old “C” programmer (I learned “C” in 1981), Zig is a true breath of fresh air.


As a C++ developer myself, I know that feeling. I’ll never go back to virtual methods and inheritance ever again. Thanks for sharing your work!