Hashes can sometimes be cached, if there is more than enough home in the info structure where The real key is stored; caching the results of comparisons (a binary operation) is usually impractical. On the flip side, comparisons can reward from shortcutting: if keys usually differ within the first number of bytes, a damaging comparison can be very q