Limitless Containers without dynamic memory allocation in C/C++

Originally published at: Limitless Containers without dynamic memory allocation in C/C++. - Patterns in the Machine

Lists, FIFOs, dictionaries, maps, etc. are handy-dandy data structures when designing and implementing code.  However, most container implementations either use dynamic memory allocation or have a fixed number of elements they can contain.  Because my day job is as an embedded developer, I typically do not get to use the heap (aka dynamic memory) after…