Hi all,
I haven't used hash_map too much, usually map works good enough for me, but for my current task hash_map seems to be more preferable container.
I was confused when I read that Microsoft hash_map requires keys to be less than comparable, whereas other sources say that a Binary Predicate used for comparing keys must be an equivalence relation. I'm aware that hash_map is not a really "standart" template, but wonder if I need to implement both opeator == and operator < for possible compartible issues, or using Strict Weak Ordering for hash_map is pretty common.
Thanks in advance.