Hashes can sometimes be cached, if there is enough room in the information structure where The main element is saved; caching the result of comparisons (a binary operation) is often impractical. On the other hand, comparisons can advantage from shortcutting: if keys normally differ within the primary few bytes, a negative comparison can be quite qu