Hashes can sometimes be cached, if there is plenty of room in the data composition where the key is stored; caching the result of comparisons (a binary operation) is usually impractical. On the flip side, comparisons can benefit from shortcutting: if keys generally vary within the initial couple byt