Hashes can sometimes be cached, if there is more than enough room in the data structure where The main element is stored; caching the results of comparisons (a binary operation) is often impractical. However, comparisons can gain from shortcutting: if keys frequently differ within the very first handful of bytes, a adverse comparison can be quite q