Hashes can sometimes be cached, if there is plenty of place in the information structure where the key is stored; caching the result of comparisons (a binary operation) is often impractical. On the other hand, comparisons can benefit from shortcutting: if keys normally vary within the primary couple bytes, https://andyb130eif3.daneblogger.com/profile