Hashes can sometimes be cached, if there is enough place in the data construction where The real key is stored; caching the results of comparisons (a binary operation) is often impractical. Then again, comparisons can benefit from shortcutting: if keys often vary within the primary couple of bytes, a negative comparison can be very rapid."We told t