Hashes can sometimes be cached, if there is sufficient home in the info structure where the key is stored; caching the result of comparisons (a binary operation) is commonly impractical. Then again, comparisons can gain from shortcutting: if keys generally vary within the first few bytes, a adverse comparison can be extremely rapid.According to The