Hashes can sometimes be cached, if there is ample room in the data construction where The main element is stored; caching the results of comparisons (a binary operation) is frequently impractical. On the other hand, comparisons can profit from shortcutting: if keys typically differ within the main handful of bytes, a detrimental comparison can be q