Hashes can sometimes be cached, if there is sufficient area in the info composition where The important thing is saved; caching the results of comparisons (a binary operation) is usually impractical. On the flip side, comparisons can gain from shortcutting: if keys generally vary within the init