Hashes can sometimes be cached, if there is enough room in the info structure where the key is stored; caching the results of comparisons (a binary operation) is commonly impractical. On the flip side, comparisons can gain from shortcutting: if keys frequently differ within the initial number of bytes, a adverse comparison can be very quickly.Retri