Hashes can sometimes be cached, if there is plenty of area in the data composition where The main element is stored; caching the results of comparisons (a binary operation) is usually impractical. On the flip side, comparisons can advantage from shortcutting: if keys typically differ within the initial couple of bytes, a adverse comparison can be v