Hashes can sometimes be cached, if there is adequate area in the information structure where the key is saved; caching the results of comparisons (a binary operation) is commonly impractical. On the flip side, comparisons can advantage from shortcutting: if keys generally vary within the 1st couple bytes, a unfavorable comparison can be extremely s