Hashes can sometimes be cached, if there is more than enough space in the info composition where the key is stored; caching the results of comparisons (a binary operation) is frequently impractical. On the other hand, comparisons can reward from shortcutting: if keys normally vary within the main several bytes, a detrimental comparison can be quite