Hashes can sometimes be cached, if there is adequate room in the data structure where The main element is stored; caching the results of comparisons (a binary operation) is commonly impractical. Then again, comparisons can benefit from shortcutting: if keys often differ within the primary several bytes, a adverse comparison can be very speedy.This