Hashes can sometimes be cached, if there is plenty of room in the data composition where The important thing is stored; caching the result of comparisons (a binary operation) is usually impractical. Then again, comparisons can gain from shortcutting: if keys generally differ within the primary number of bytes, a adverse comparison can be quite rapi