The point of `Hashable`

is to quickly calculate keys so the container can store its elements in a numeric graph. So what happens when distinct elements share a hash value? Are they just stored in a randomly-ordered list?

If the `Element`

is also `Comparable`

, are the hash-sharing elements also stored in escalating order? If not, can we add that? This could provide a speed up via binary search.