4 ms·
Not even considering that unordered_map is not the fastest hash map implementation for C++. There is plenty of the flat hash map implementation (swiss tables) a
by adev_ 8y ago
Not even considering that unordered_map is not the fastest hash map implementation for C++. There is plenty of the flat hash map implementation (swiss tables) around that beats unordered_map by an other factor....
https://abseil.io/blog/20180927-swisstables https://abseil.io/blog/20180927-swisstables