I recently discovered a container in C++ named
std::unordered_map, that will store the key-value pairs for the user. However, what if my program must ignore any hash value that is repetitive in the collection, while still maintaining the key-value pairs property (ideally all the functions too, provided that I have already written a program that prints out all the elements in the
std::unordered_map? Any container that is built-in or any variants of any built-in collections that could satisfy the conditions are appreciated. Postprocessing is also accepted, provided enough efficiency. Thank you very much!