An efficient way to make hash maps with insertion ordering

Re:An efficient way to make hash maps with insertion ordering by mypalmike on Thursday July 01, 2021 @12:52PM (#27701234)

Hash maps have been commonly used in C since just about forever.

"isn't a insertion order hash map, basically just a list?"

No. They are different in the computational complexity of random access operations.

[ Parent | on HN ]

Re:An efficient way to make hash maps with insertion ordering by benibela on Thursday July 01, 2021 @06:44PM (#27705806)

But the standard C++ std::unordered_map only came with C++11

[ Parent | on HN ]