In this video, I walk through some techniques and helper code within the Digital Grove codebase for building various common data structures, including: arrays, singly-linked stacks, singly-linked queues, doubly-linked lists, chunked linked lists, n-ary trees, hash tables, and simultaneous combinations of them. All memory management for the data structures is arena-based.
This concretizes many of the ideas I’ve previously written about, and walks through the codebase’s basic building blocks for hand-rolling custom data structures which are better suited for one’s problem than—for instance—a generic data structure object in a language standard library.
