Hashes can sometimes be cached, if there is plenty of place in the info structure where the key is stored; caching the result of comparisons (a binary operation) is commonly impractical. On the flip side, comparisons can profit from shortcutting: if keys usually vary within the 1st several bytes, a unfavorable comparison can be extremely rapid.Encr