Hashes can sometimes be cached, if there is plenty of space in the information construction where the key is stored; caching the results of comparisons (a binary operation) is frequently impractical. On the flip side, comparisons can gain from shortcutting: if keys usually vary within the first few bytes, https://joyceq917spf5.blogs100.com/profile