It's easy to use an unordered_set, or unordered_map with a basic key type, like int, float, string.
You simply set it up like
std::unordered_set<string> simple_hash_table;
But how does one create hash functors and compare functors for a more complex key?
You simply set it up like
std::unordered_set<string> simple_hash_table;
But how does one create hash functors and compare functors for a more complex key?