Hashes can sometimes be cached, if there is adequate room in the info composition where The main element is stored; caching the results of comparisons (a binary operation) is usually impractical. Conversely, comparisons can advantage from shortcutting: if keys generally vary within the 1st number of bytes, a damaging comparison can be very fast."Dr