ordered-map

Iteration returns values in the exact insertion order, similar to Python's OrderedDict, filling a gap in the C++ standard library for predictable hash-based containers.

Provides values_container() method to expose the underlying std::vector or std::deque, enabling efficient C API interaction via data() and contiguous storage without holes.

Offers O(1) average lookups with benchmarked performance comparable to std::unordered_map, plus faster insertions and reduced memory usage due to linear robin hood probing.

Supports find with types different from the key, using transparent comparators to avoid temporary object construction, as shown in the employee example.