Hashes can sometimes be cached, if there is plenty of area in the data framework where The main element is stored; caching the results of comparisons (a binary operation) is frequently impractical. On the flip side, comparisons can gain from shortcutting: if keys typically vary within the main couple bytes, a destructive comparison can be very quic