Hashes can sometimes be cached, if there is more than enough area in the info composition where The important thing is stored; caching the results of comparisons (a binary operation) is commonly impractical. Alternatively, comparisons can gain from shortcutting: if keys usually vary within the main couple of bytes, a destructive comparison can be q