Hashes can sometimes be cached, if there is ample place in the data framework where The main element is saved; caching the results of comparisons (a binary operation) is commonly impractical. Conversely, comparisons can advantage from shortcutting: if keys generally differ within the first several bytes, a damaging comparison can be extremely fast.