Hashes can sometimes be cached, if there is enough area in the data composition where The main element is stored; caching the result of comparisons (a binary operation) is frequently impractical. However, comparisons can benefit from shortcutting: if keys usually vary within the very first number of bytes, a negative comparison can be quite rapidly