Hashes can sometimes be cached, if there is plenty of area in the data structure where the key is stored; caching the result of comparisons (a binary operation) is often impractical. Conversely, comparisons can benefit from shortcutting: if keys generally vary within the main few bytes, a destru