I don&#x27;t disagree with the spirit of your comment, only the primary example.<p>Most of the dynamically-sized containers I end up needing are one of vector, map, set, or list. For the latter three, there&#x27;s &lt;sys&#x2F;tree.h&gt; and &lt;sys&#x2F;queue.h&gt; on most BSDs which provide intrusive macro-based implementations. Sure, they&#x27;re a bit more clunky to use than e.g., std::map, but I&#x27;m neither concerned with their speed nor their reliability (insofar as their implementation).<p>Naturally, when you need to reach for a less-common data structure (e.g., a bloom filter or B+ tree) you&#x27;ll have to look elsewhere, but feels like the same situation as if you were using C++&#x27;s STL.