Hashes can sometimes be cached, if there is ample place in the info structure where The important thing is stored; caching the result of comparisons (a binary operation) is commonly impractical. However, comparisons can advantage from shortcutting: if keys typically differ within the 1st couple bytes, a detrimental comparison can be extremely quick