Hashes can sometimes be cached, if there is ample place in the information structure where The main element is saved; caching the result of comparisons (a binary operation) is frequently impractical. Then again, comparisons can benefit from shortcutting: if keys frequently differ within the init