Hashes can sometimes be cached, if there is enough space in the data composition where The important thing is stored; caching the results of comparisons (a binary operation) is commonly impractical. Conversely, comparisons can advantage from shortcutting: if keys normally differ within the first