Help me create more content like this!
www.paypal.com...
With all the knowledge we've acquired so far, we can build our very own data structure in Zig. In this episode, we'll build a stack that can handle growth via heap allocation and as a bonus we even make it generic. NOTE: I had a little off-by-one bug in the code shown in the video where I compared the slice length plus one as greater than or equal to, when it should be just greater than (in the push method). I made the fix and the code in the repo is now correct.
The code: codeberg.org/d...
Relevant Links:
ziglang.org/do...
Thumbnail artwork courtesy of: www.deviantart...
14 окт 2024