Hashes can sometimes be cached, if there is enough home in the information construction where The real key is stored; caching the results of comparisons (a binary operation) is commonly impractical. However, comparisons can benefit from shortcutting: if keys generally vary within the 1st several bytes, a detrimental comparison can be quite rapidly.