container-playground

Experimental "flat" Dictionary container supporting efficient serialization/deserialization

Simplying assumptions

1. Value type must be a struct of strictly POD types with no heap memory allocation
2. Key/value pairs are never removed from the dictionary

Dictionary approach

The Dict container is a fixed size which is specified at template instantiation time. Storage is comprised of:

1. std::array of Value elements ordered by the original insertion order
2. std::array of Key elements (a 32-bit key value and an index into the Values array). This array is kept in sorted order by the key value
3. a count of the current number of elements in the container