Hashes can sometimes be cached, if there is sufficient home in the information structure where The real key is saved; caching the results of comparisons (a binary operation) is frequently impractical. Alternatively, comparisons can reward from shortcutting: if keys normally vary within the initial couple of bytes, a adverse comparison can be very q