Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
52 views

Fastest implementation of priority_queue in C++?

I stumbled upon custom implementations of hash tables, which are faster than std::unordered_map for say, int type. (For example ska::flat_hash_map) For my use case, I don't need to optimize memory, ...
ztart14578's user avatar