Hashes can sometimes be cached, if there is ample room in the data construction where The main element is saved; caching the result of comparisons (a binary operation) is usually impractical. Conversely, comparisons can benefit from shortcutting: if keys usually differ within the very first couple bytes, a detrimental comparison can be quite quickl