Hashes can sometimes be cached, if there is more than enough space in the info structure where the key is stored; caching the result of comparisons (a binary operation) is usually impractical. On the other hand, comparisons can advantage from shortcutting: if keys typically differ within the 1st couple https://danielh902ipo7.wikicorrespondence.com/user