Hashes can sometimes be cached, if there is adequate place in the info structure where The main element is stored; caching the results of comparisons (a binary operation) is usually impractical. On the flip side, comparisons can profit from shortcutting: if keys generally vary within the 1st couple bytes, a detrimental comparison can be extremely q